1 # Torturing Bison. -*- Autotest -*-
3 # Copyright (C) 2001-2002, 2004-2007, 2009-2013 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 AT_BISON_OPTION_POPDEFS
123 AT_CHECK([$PERL -w ./gengram.pl $2 || exit 77], 0, [stdout])
132 AT_SETUP([Big triangle])
134 # I have been able to go up to 2000 on my machine.
135 # I tried 3000, a 29Mb grammar file, but then my system killed bison.
136 # With 500 and the new parser, which consume far too much memory,
137 # it gets killed too. Of course the parser is to be cleaned.
138 AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
139 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
141 AT_PARSER_CHECK([./input])
147 # AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
148 # -------------------------------------------
149 # Create FILE-NAME, containing a self checking parser for a huge
150 # horizontal grammar.
151 m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
152 [AT_BISON_OPTION_PUSHDEFS
153 AT_DATA([[gengram.pl]],
154 [[#! /usr/bin/perl -w
157 my $max = $ARGV[0] || 10;
160 ]AT_DATA_GRAMMAR_PROLOGUE[
173 for my $size (1 .. $max)
175 print " t$size $size \"$size\"\n";
186 (map { "\"$_\"" } (1 .. $max)), ";"),
196 static int counter = 1;
199 assert (counter++ == MAX + 1);
206 AT_CHECK([$PERL -w ./gengram.pl $2 || exit 77], 0, [stdout])
208 AT_BISON_OPTION_POPDEFS
212 ## ---------------- ##
213 ## Big horizontal. ##
214 ## ---------------- ##
216 AT_SETUP([Big horizontal])
218 # I have been able to go up to 10000 on my machine, but I had to
219 # increase the maximum stack size (* 100). It gave:
225 # gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
226 # bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
227 # gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
228 # ./input 0.00s user 0.01s sys 108% cpu 0.01 total
230 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
232 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
233 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
234 AT_INCREASE_DATA_SIZE(204000)
236 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
238 AT_PARSER_CHECK([./input])
244 # AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
245 # --------------------------------------------------
246 # Create FILE-NAME, containing a self checking parser for a grammar
247 # requiring SIZE lookahead tokens.
248 m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR],
249 [AT_BISON_OPTION_PUSHDEFS
250 AT_DATA([[gengram.pl]],
251 [[#! /usr/bin/perl -w
255 my $max = $ARGV[0] || 10;
261 ]AT_DATA_SOURCE_PROLOGUE[
274 %type <val> input exp
279 wrap ("%type <val> ",
281 map { "n$_" } (1 .. $max)),
285 for my $count (1 .. $max)
287 print " t$count $count \"$count\"\n";
293 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
294 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
298 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
301 for my $count (2 .. $max)
303 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
307 for my $count (1 .. $max)
309 print "n$count: token { \$\$ = $count; };\n";
318 static int return_token = 1;
319 static int counter = 1;
322 assert (counter++ == MAX + 1);
338 AT_CHECK([$PERL -w ./gengram.pl $2 || exit 77], 0, [stdout])
340 AT_BISON_OPTION_POPDEFS
344 ## ------------------------ ##
345 ## Many lookahead tokens. ##
346 ## ------------------------ ##
348 AT_SETUP([Many lookahead tokens])
350 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
352 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
353 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
354 AT_INCREASE_DATA_SIZE(204000)
356 AT_BISON_CHECK([-v -o input.c input.y])
358 AT_PARSER_CHECK([./input])
364 # AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS])
365 # ------------------------------------------------
366 # A parser specialized in torturing the stack size.
367 m4_define([AT_DATA_STACK_TORTURE],
368 [AT_BISON_OPTION_PUSHDEFS([$2])
369 # A grammar of parens growing the stack thanks to right recursion.
371 AT_DATA_GRAMMAR([input.y],
386 exp: WAIT_FOR_EOF exp | ;
393 assert (0 <= yylval);
400 /* Return argv[1] as an int. */
402 get_args (int argc, const char **argv)
407 res = strtol (argv[1], &endp, 10);
408 assert (argv[1] != endp);
410 assert (res <= INT_MAX);
411 assert (errno != ERANGE);
416 main (int argc, const char **argv)
418 YYSTYPE yylval_init = get_args (argc, argv);
421 ]m4_bmatch([$2], [api.push-pull both],
422 [[ yypstate *ps = yypstate_new ();
424 for (count = 0; count < 2; ++count)
427 yylval = yylval_init;
428 new_status = ]m4_bmatch([$2], [api.push-pull both],
429 [[yypull_parse (ps)]],
434 assert (new_status == status);
435 }]m4_bmatch([$2], [api.push-pull both],[[
436 yypstate_delete (ps);]])[
440 AT_BISON_OPTION_POPDEFS([$2])
441 AT_BISON_CHECK([-o input.c input.y])
446 ## -------------------------------------- ##
447 ## Exploding the Stack Size with Alloca. ##
448 ## -------------------------------------- ##
450 AT_SETUP([Exploding the Stack Size with Alloca])
452 m4_pushdef([AT_USE_ALLOCA], [[
453 #if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
454 || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
455 # define YYSTACK_USE_ALLOCA 1
459 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
461 # Below the limit of 200.
462 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
463 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
464 # Two enlargements: 2 * 2 * 200.
465 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
466 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
467 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
468 # multiply by two starting at 200 => 5120 is the last possible).
469 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
470 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
472 # The push parser can't use alloca since the stacks can't be locals. This test
473 # just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect
475 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
476 [[%define api.push-pull both
478 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
479 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
480 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
481 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
482 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
483 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
485 m4_popdef([AT_USE_ALLOCA])
492 ## -------------------------------------- ##
493 ## Exploding the Stack Size with Malloc. ##
494 ## -------------------------------------- ##
496 AT_SETUP([Exploding the Stack Size with Malloc])
498 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
500 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
502 # Below the limit of 200.
503 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
504 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
505 # Two enlargements: 2 * 2 * 200.
506 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
507 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
508 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
509 # multiply by two starting at 200 => 5120 is the possible).
510 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
511 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
513 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
514 [[%define api.push-pull both
516 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
517 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
518 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
519 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
520 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
521 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
523 m4_popdef([AT_USE_ALLOCA])