1 # Torturing Bison. -*- Autotest -*-
3 # Copyright (C) 2001-2002, 2004-2007, 2009-2012 Free Software
6 # This program is free software: you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation, either version 3 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful,
12 # but WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 # GNU General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program. If not, see <http://www.gnu.org/licenses/>.
19 AT_BANNER([[Torture Tests.]])
22 # AT_INCREASE_DATA_SIZE(SIZE)
23 # ---------------------------
24 # Try to increase the data size to SIZE KiB if possible.
25 m4_define([AT_INCREASE_DATA_SIZE],
26 [data_limit=`(ulimit -S -d) 2>/dev/null`
29 if test "$data_limit" -lt $1; then
30 AT_CHECK([ulimit -S -d $1 || exit 77])
36 ## ------------------------------------- ##
37 ## Creating a large artificial grammar. ##
38 ## ------------------------------------- ##
40 # AT_DATA_TRIANGULAR_GRAMMAR(FILE-NAME, SIZE)
41 # -------------------------------------------
42 # Create FILE-NAME, containing a self checking parser for a huge
44 m4_define([AT_DATA_TRIANGULAR_GRAMMAR],
45 [AT_BISON_OPTION_PUSHDEFS
46 AT_DATA([[gengram.pl]],
50 my $max = $ARGV[0] || 10;
53 ]AT_DATA_GRAMMAR_PROLOGUE[
73 for my $size (1 .. $max)
75 print "%token t$size $size \"$size\"\n";
81 exp { assert (\@S|@1 == 0); \$\$ = \@S|@1; }
82 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
90 for my $size (1 .. $max)
93 print wrap ("| ", " ",
94 (map { "\"$_\"" } (1 .. $size)),
96 " { \$\$ = $size; }\n";
106 static int inner = 1;
107 static int outer = 0;
110 else if (inner > outer)
121 yydebug = !!getenv ("YYDEBUG");
126 AT_BISON_OPTION_POPDEFS
128 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
137 AT_SETUP([Big triangle])
139 # I have been able to go up to 2000 on my machine.
140 # I tried 3000, a 29Mb grammar file, but then my system killed bison.
141 # With 500 and the new parser, which consume far too much memory,
142 # it gets killed too. Of course the parser is to be cleaned.
143 AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
144 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
146 AT_PARSER_CHECK([./input])
152 # AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
153 # -------------------------------------------
154 # Create FILE-NAME, containing a self checking parser for a huge
155 # horizontal grammar.
156 m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
157 [AT_BISON_OPTION_PUSHDEFS
158 AT_DATA([[gengram.pl]],
159 [[#! /usr/bin/perl -w
162 my $max = $ARGV[0] || 10;
165 ]AT_DATA_GRAMMAR_PROLOGUE[
178 for my $size (1 .. $max)
180 print " t$size $size \"$size\"\n";
191 (map { "\"$_\"" } (1 .. $max)), ";"),
201 static int counter = 1;
204 assert (counter++ == MAX + 1);
211 yydebug = !!getenv ("YYDEBUG");
217 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
219 AT_BISON_OPTION_POPDEFS
223 ## ---------------- ##
224 ## Big horizontal. ##
225 ## ---------------- ##
227 AT_SETUP([Big horizontal])
229 # I have been able to go up to 10000 on my machine, but I had to
230 # increase the maximum stack size (* 100). It gave:
236 # gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
237 # bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
238 # gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
239 # ./input 0.00s user 0.01s sys 108% cpu 0.01 total
241 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
243 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
244 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
245 AT_INCREASE_DATA_SIZE(204000)
247 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
249 AT_PARSER_CHECK([./input])
255 # AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
256 # --------------------------------------------------
257 # Create FILE-NAME, containing a self checking parser for a grammar
258 # requiring SIZE lookahead tokens.
259 m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR],
260 [AT_BISON_OPTION_PUSHDEFS
261 AT_DATA([[gengram.pl]],
262 [[#! /usr/bin/perl -w
266 my $max = $ARGV[0] || 10;
284 %type <val> input exp
289 wrap ("%type <val> ",
291 map { "n$_" } (1 .. $max)),
295 for my $count (1 .. $max)
297 print " t$count $count \"$count\"\n";
303 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
304 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
308 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
311 for my $count (2 .. $max)
313 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
317 for my $count (1 .. $max)
319 print "n$count: token { \$\$ = $count; };\n";
328 static int return_token = 1;
329 static int counter = 1;
332 assert (counter++ == MAX + 1);
347 yydebug = !!getenv ("YYDEBUG");
353 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
355 AT_BISON_OPTION_POPDEFS
359 ## ------------------------ ##
360 ## Many lookahead tokens. ##
361 ## ------------------------ ##
363 AT_SETUP([Many lookahead tokens])
365 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
367 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
368 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
369 AT_INCREASE_DATA_SIZE(204000)
371 AT_BISON_CHECK([-v -o input.c input.y])
373 AT_PARSER_CHECK([./input])
379 # AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS])
380 # ------------------------------------------------
381 # A parser specialized in torturing the stack size.
382 m4_define([AT_DATA_STACK_TORTURE],
383 [AT_BISON_OPTION_PUSHDEFS([$2])
384 # A grammar of parens growing the stack thanks to right recursion.
401 exp: WAIT_FOR_EOF exp | ;
408 assert (0 <= yylval);
416 main (int argc, const char **argv)
421 yylval_init = strtol (argv[1], &endp, 10);
422 assert (argv[1] != endp);
423 assert (0 <= yylval_init);
424 assert (yylval_init <= INT_MAX);
425 assert (errno != ERANGE);
430 ]m4_bmatch([$2], [%push-],
431 [[ yypstate *ps = yypstate_new ();
432 ]])[ for (count = 0; count < 2; ++count)
435 yylval = yylval_init;
436 ]m4_bmatch([$2], [%push-],
437 [[ new_status = yypull_parse (ps);
439 [[ new_status = yyparse ();
440 ]])[ assert (0 <= count || new_status == status);
443 ]m4_bmatch([$2], [%push-],
444 [[ yypstate_delete (ps);
449 AT_BISON_OPTION_POPDEFS([$2])
450 AT_BISON_CHECK([-o input.c input.y])
455 ## -------------------------------------- ##
456 ## Exploding the Stack Size with Alloca. ##
457 ## -------------------------------------- ##
459 AT_SETUP([Exploding the Stack Size with Alloca])
461 m4_pushdef([AT_USE_ALLOCA], [[
462 #if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
463 || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
464 # define YYSTACK_USE_ALLOCA 1
468 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
470 # Below the limit of 200.
471 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
472 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
473 # Two enlargements: 2 * 2 * 200.
474 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
475 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
476 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
477 # multiply by two starting at 200 => 5120 is the last possible).
478 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
479 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
481 # The push parser can't use alloca since the stacks can't be locals. This test
482 # just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect
484 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
485 [[%define api.push-pull both
487 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
488 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
489 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
490 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
491 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
492 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
494 m4_popdef([AT_USE_ALLOCA])
501 ## -------------------------------------- ##
502 ## Exploding the Stack Size with Malloc. ##
503 ## -------------------------------------- ##
505 AT_SETUP([Exploding the Stack Size with Malloc])
507 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
509 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
511 # Below the limit of 200.
512 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
513 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
514 # Two enlargements: 2 * 2 * 200.
515 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
516 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
517 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
518 # multiply by two starting at 200 => 5120 is the possible).
519 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
520 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
522 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
523 [[%define api.push-pull both
525 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
526 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
527 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
528 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
529 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
530 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
532 m4_popdef([AT_USE_ALLOCA])