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";
104 static int inner = 1;
105 static int outer = 0;
108 else if (inner > outer)
118 yyerror (const char *msg)
120 fprintf (stderr, "%s\\n", msg);
126 yydebug = !!getenv ("YYDEBUG");
131 AT_BISON_OPTION_POPDEFS
133 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
142 AT_SETUP([Big triangle])
144 # I have been able to go up to 2000 on my machine.
145 # I tried 3000, a 29Mb grammar file, but then my system killed bison.
146 # With 500 and the new parser, which consume far too much memory,
147 # it gets killed too. Of course the parser is to be cleaned.
148 AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
149 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
151 AT_PARSER_CHECK([./input])
157 # AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
158 # -------------------------------------------
159 # Create FILE-NAME, containing a self checking parser for a huge
160 # horizontal grammar.
161 m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
162 [AT_BISON_OPTION_PUSHDEFS
163 AT_DATA([[gengram.pl]],
164 [[#! /usr/bin/perl -w
167 my $max = $ARGV[0] || 10;
170 ]AT_DATA_GRAMMAR_PROLOGUE[
183 for my $size (1 .. $max)
185 print " t$size $size \"$size\"\n";
196 (map { "\"$_\"" } (1 .. $max)), ";"),
204 static int counter = 1;
207 if (counter++ != $max + 1)
213 yyerror (const char *msg)
215 fprintf (stderr, "%s\\n", msg);
221 yydebug = !!getenv ("YYDEBUG");
227 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
229 AT_BISON_OPTION_POPDEFS
233 ## ---------------- ##
234 ## Big horizontal. ##
235 ## ---------------- ##
237 AT_SETUP([Big horizontal])
239 # I have been able to go up to 10000 on my machine, but I had to
240 # increase the maximum stack size (* 100). It gave:
246 # gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
247 # bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
248 # gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
249 # ./input 0.00s user 0.01s sys 108% cpu 0.01 total
251 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
253 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
254 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
255 AT_INCREASE_DATA_SIZE(204000)
257 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
259 AT_PARSER_CHECK([./input])
265 # AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
266 # --------------------------------------------------
267 # Create FILE-NAME, containing a self checking parser for a grammar
268 # requiring SIZE lookahead tokens.
269 m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR],
270 [AT_BISON_OPTION_PUSHDEFS
271 AT_DATA([[gengram.pl]],
272 [[#! /usr/bin/perl -w
276 my $max = $ARGV[0] || 10;
294 %type <val> input exp
299 wrap ("%type <val> ",
301 map { "n$_" } (1 .. $max)),
305 for my $count (1 .. $max)
307 print " t$count $count \"$count\"\n";
313 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
314 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
318 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
321 for my $count (2 .. $max)
323 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
327 for my $count (1 .. $max)
329 print "n$count: token { \$\$ = $count; };\n";
337 static int return_token = 1;
338 static int counter = 1;
341 if (counter++ != $max + 1)
355 yyerror (const char *msg)
357 fprintf (stderr, "%s\\n", msg);
363 yydebug = !!getenv ("YYDEBUG");
369 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
371 AT_BISON_OPTION_POPDEFS
375 ## ------------------------ ##
376 ## Many lookahead tokens. ##
377 ## ------------------------ ##
379 AT_SETUP([Many lookahead tokens])
381 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
383 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
384 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
385 AT_INCREASE_DATA_SIZE(204000)
387 AT_BISON_CHECK([-v -o input.c input.y])
389 AT_PARSER_CHECK([./input])
395 # AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS])
396 # ------------------------------------------------
397 # A parser specialized in torturing the stack size.
398 m4_define([AT_DATA_STACK_TORTURE],
399 [AT_BISON_OPTION_PUSHDEFS([$2])
400 # A grammar of parens growing the stack thanks to right recursion.
417 exp: WAIT_FOR_EOF exp | ;
432 main (int argc, const char **argv)
438 yylval_init = strtol (argv[1], &endp, 10);
439 if (! (argv[1] != endp
440 && 0 <= yylval_init && yylval_init <= INT_MAX
447 ]m4_bmatch([$2], [%push-],
448 [[ yypstate *ps = yypstate_new ();
449 ]])[ for (count = 0; count < 2; ++count)
452 yylval = yylval_init;
453 ]m4_bmatch([$2], [%push-],
454 [[ new_status = yypull_parse (ps);
456 [[ new_status = yyparse ();
457 ]])[ if (count > 0 && new_status != status)
461 ]m4_bmatch([$2], [%push-],
462 [[ yypstate_delete (ps);
467 AT_BISON_OPTION_POPDEFS([$2])
468 AT_BISON_CHECK([-o input.c input.y])
473 ## -------------------------------------- ##
474 ## Exploding the Stack Size with Alloca. ##
475 ## -------------------------------------- ##
477 AT_SETUP([Exploding the Stack Size with Alloca])
479 m4_pushdef([AT_USE_ALLOCA], [[
480 #if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
481 || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
482 # define YYSTACK_USE_ALLOCA 1
486 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
488 # Below the limit of 200.
489 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
490 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
491 # Two enlargements: 2 * 2 * 200.
492 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
493 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
494 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
495 # multiply by two starting at 200 => 5120 is the last possible).
496 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
497 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
499 # The push parser can't use alloca since the stacks can't be locals. This test
500 # just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect
502 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
503 [[%define api.push-pull both
505 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
506 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
507 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
508 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
509 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
510 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
512 m4_popdef([AT_USE_ALLOCA])
519 ## -------------------------------------- ##
520 ## Exploding the Stack Size with Malloc. ##
521 ## -------------------------------------- ##
523 AT_SETUP([Exploding the Stack Size with Malloc])
525 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
527 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
529 # Below the limit of 200.
530 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
531 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
532 # Two enlargements: 2 * 2 * 200.
533 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
534 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
535 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
536 # multiply by two starting at 200 => 5120 is the possible).
537 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
538 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
540 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
541 [[%define api.push-pull both
543 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
544 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
545 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
546 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
547 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
548 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
550 m4_popdef([AT_USE_ALLOCA])