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[
72 for my $size (1 .. $max)
74 print "%token t$size $size \"$size\"\n";
80 exp { if (\@S|@1 != 0) abort (); \$\$ = \@S|@1; }
81 | input exp { if (\@S|@2 != \@S|@1 + 1) abort (); \$\$ = \@S|@2; }
89 for my $size (1 .. $max)
92 print wrap ("| ", " ",
93 (map { "\"$_\"" } (1 .. $size)),
95 " { \$\$ = $size; }\n";
105 static int inner = 1;
106 static int outer = 0;
109 else if (inner > outer)
120 yydebug = !!getenv ("YYDEBUG");
125 AT_BISON_OPTION_POPDEFS
127 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
136 AT_SETUP([Big triangle])
138 # I have been able to go up to 2000 on my machine.
139 # I tried 3000, a 29Mb grammar file, but then my system killed bison.
140 # With 500 and the new parser, which consume far too much memory,
141 # it gets killed too. Of course the parser is to be cleaned.
142 AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
143 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
145 AT_PARSER_CHECK([./input])
151 # AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
152 # -------------------------------------------
153 # Create FILE-NAME, containing a self checking parser for a huge
154 # horizontal grammar.
155 m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
156 [AT_BISON_OPTION_PUSHDEFS
157 AT_DATA([[gengram.pl]],
158 [[#! /usr/bin/perl -w
161 my $max = $ARGV[0] || 10;
164 ]AT_DATA_GRAMMAR_PROLOGUE[
177 for my $size (1 .. $max)
179 print " t$size $size \"$size\"\n";
190 (map { "\"$_\"" } (1 .. $max)), ";"),
199 static int counter = 1;
202 if (counter++ != MAX + 1)
210 yydebug = !!getenv ("YYDEBUG");
216 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
218 AT_BISON_OPTION_POPDEFS
222 ## ---------------- ##
223 ## Big horizontal. ##
224 ## ---------------- ##
226 AT_SETUP([Big horizontal])
228 # I have been able to go up to 10000 on my machine, but I had to
229 # increase the maximum stack size (* 100). It gave:
235 # gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
236 # bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
237 # gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
238 # ./input 0.00s user 0.01s sys 108% cpu 0.01 total
240 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
242 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
243 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
244 AT_INCREASE_DATA_SIZE(204000)
246 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
248 AT_PARSER_CHECK([./input])
254 # AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
255 # --------------------------------------------------
256 # Create FILE-NAME, containing a self checking parser for a grammar
257 # requiring SIZE lookahead tokens.
258 m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR],
259 [AT_BISON_OPTION_PUSHDEFS
260 AT_DATA([[gengram.pl]],
261 [[#! /usr/bin/perl -w
265 my $max = $ARGV[0] || 10;
283 %type <val> input exp
288 wrap ("%type <val> ",
290 map { "n$_" } (1 .. $max)),
294 for my $count (1 .. $max)
296 print " t$count $count \"$count\"\n";
302 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
303 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
307 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
310 for my $count (2 .. $max)
312 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
316 for my $count (1 .. $max)
318 print "n$count: token { \$\$ = $count; };\n";
327 static int return_token = 1;
328 static int counter = 1;
331 if (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 | ;
416 main (int argc, const char **argv)
422 yylval_init = strtol (argv[1], &endp, 10);
423 if (! (argv[1] != endp
424 && 0 <= yylval_init && yylval_init <= INT_MAX
431 ]m4_bmatch([$2], [%push-],
432 [[ yypstate *ps = yypstate_new ();
433 ]])[ for (count = 0; count < 2; ++count)
436 yylval = yylval_init;
437 ]m4_bmatch([$2], [%push-],
438 [[ new_status = yypull_parse (ps);
440 [[ new_status = yyparse ();
441 ]])[ if (count > 0 && new_status != status)
445 ]m4_bmatch([$2], [%push-],
446 [[ yypstate_delete (ps);
451 AT_BISON_OPTION_POPDEFS([$2])
452 AT_BISON_CHECK([-o input.c input.y])
457 ## -------------------------------------- ##
458 ## Exploding the Stack Size with Alloca. ##
459 ## -------------------------------------- ##
461 AT_SETUP([Exploding the Stack Size with Alloca])
463 m4_pushdef([AT_USE_ALLOCA], [[
464 #if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
465 || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
466 # define YYSTACK_USE_ALLOCA 1
470 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
472 # Below the limit of 200.
473 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
474 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
475 # Two enlargements: 2 * 2 * 200.
476 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
477 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
478 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
479 # multiply by two starting at 200 => 5120 is the last possible).
480 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
481 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
483 # The push parser can't use alloca since the stacks can't be locals. This test
484 # just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect
486 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
487 [[%define api.push-pull both
489 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
490 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
491 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
492 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
493 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
494 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
496 m4_popdef([AT_USE_ALLOCA])
503 ## -------------------------------------- ##
504 ## Exploding the Stack Size with Malloc. ##
505 ## -------------------------------------- ##
507 AT_SETUP([Exploding the Stack Size with Malloc])
509 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
511 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
513 # Below the limit of 200.
514 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
515 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
516 # Two enlargements: 2 * 2 * 200.
517 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
518 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
519 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
520 # multiply by two starting at 200 => 5120 is the possible).
521 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
522 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
524 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
525 [[%define api.push-pull both
527 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
528 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
529 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
530 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
531 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
532 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
534 m4_popdef([AT_USE_ALLOCA])