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_DATA([[gengram.pl]],
49 my $max = $ARGV[0] || 10;
52 ]AT_DATA_GRAMMAR_PROLOGUE[
71 for my $size (1 .. $max)
73 print "%token t$size $size \"$size\"\n";
79 exp { if (\@S|@1 != 0) abort (); \$\$ = \@S|@1; }
80 | input exp { if (\@S|@2 != \@S|@1 + 1) abort (); \$\$ = \@S|@2; }
88 for my $size (1 .. $max)
91 print wrap ("| ", " ",
92 (map { "\"$_\"" } (1 .. $size)),
94 " { \$\$ = $size; }\n";
103 static int inner = 1;
104 static int outer = 0;
107 else if (inner > outer)
117 yyerror (const char *msg)
119 fprintf (stderr, "%s\\n", msg);
125 yydebug = !!getenv ("YYDEBUG");
131 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
140 AT_SETUP([Big triangle])
142 # I have been able to go up to 2000 on my machine.
143 # I tried 3000, a 29Mb grammar file, but then my system killed bison.
144 # With 500 and the new parser, which consume far too much memory,
145 # it gets killed too. Of course the parser is to be cleaned.
146 AT_DATA_TRIANGULAR_GRAMMAR([input.y], [200])
147 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
149 AT_PARSER_CHECK([./input])
155 # AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
156 # -------------------------------------------
157 # Create FILE-NAME, containing a self checking parser for a huge
158 # horizontal grammar.
159 m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
160 [AT_DATA([[gengram.pl]],
161 [[#! /usr/bin/perl -w
164 my $max = $ARGV[0] || 10;
167 ]AT_DATA_GRAMMAR_PROLOGUE[
180 for my $size (1 .. $max)
182 print " t$size $size \"$size\"\n";
193 (map { "\"$_\"" } (1 .. $max)), ";"),
201 static int counter = 1;
204 if (counter++ != $max + 1)
210 yyerror (const char *msg)
212 fprintf (stderr, "%s\\n", msg);
218 yydebug = !!getenv ("YYDEBUG");
224 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
229 ## ---------------- ##
230 ## Big horizontal. ##
231 ## ---------------- ##
233 AT_SETUP([Big horizontal])
235 # I have been able to go up to 10000 on my machine, but I had to
236 # increase the maximum stack size (* 100). It gave:
242 # gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
243 # bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
244 # gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
245 # ./input 0.00s user 0.01s sys 108% cpu 0.01 total
247 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
249 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
250 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
251 AT_INCREASE_DATA_SIZE(204000)
253 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
255 AT_PARSER_CHECK([./input])
261 # AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE)
262 # --------------------------------------------------
263 # Create FILE-NAME, containing a self checking parser for a grammar
264 # requiring SIZE lookahead tokens.
265 m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR],
266 [AT_DATA([[gengram.pl]],
267 [[#! /usr/bin/perl -w
271 my $max = $ARGV[0] || 10;
289 %type <val> input exp
294 wrap ("%type <val> ",
296 map { "n$_" } (1 .. $max)),
300 for my $count (1 .. $max)
302 print " t$count $count \"$count\"\n";
308 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
309 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
313 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
316 for my $count (2 .. $max)
318 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
322 for my $count (1 .. $max)
324 print "n$count: token { \$\$ = $count; };\n";
332 static int return_token = 1;
333 static int counter = 1;
336 if (counter++ != $max + 1)
350 yyerror (const char *msg)
352 fprintf (stderr, "%s\\n", msg);
358 yydebug = !!getenv ("YYDEBUG");
364 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
369 ## ------------------------ ##
370 ## Many lookahead tokens. ##
371 ## ------------------------ ##
373 AT_SETUP([Many lookahead tokens])
375 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
377 # GNU m4 requires about 70 MiB for this test on a 32-bit host.
378 # Ask for 200 MiB, which should be plenty even on a 64-bit host.
379 AT_INCREASE_DATA_SIZE(204000)
381 AT_BISON_CHECK([-v -o input.c input.y])
383 AT_PARSER_CHECK([./input])
389 # AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS])
390 # ------------------------------------------------
391 # A parser specialized in torturing the stack size.
392 m4_define([AT_DATA_STACK_TORTURE],
393 [AT_BISON_OPTION_PUSHDEFS([$2])
394 # A grammar of parens growing the stack thanks to right recursion.
411 exp: WAIT_FOR_EOF exp | ;
426 main (int argc, const char **argv)
432 yylval_init = strtol (argv[1], &endp, 10);
433 if (! (argv[1] != endp
434 && 0 <= yylval_init && yylval_init <= INT_MAX
441 ]m4_bmatch([$2], [%push-],
442 [[ yypstate *ps = yypstate_new ();
443 ]])[ for (count = 0; count < 2; ++count)
446 yylval = yylval_init;
447 ]m4_bmatch([$2], [%push-],
448 [[ new_status = yypull_parse (ps);
450 [[ new_status = yyparse ();
451 ]])[ if (count > 0 && new_status != status)
455 ]m4_bmatch([$2], [%push-],
456 [[ yypstate_delete (ps);
461 AT_BISON_OPTION_POPDEFS([$2])
462 AT_BISON_CHECK([-o input.c input.y])
467 ## -------------------------------------- ##
468 ## Exploding the Stack Size with Alloca. ##
469 ## -------------------------------------- ##
471 AT_SETUP([Exploding the Stack Size with Alloca])
473 m4_pushdef([AT_USE_ALLOCA], [[
474 #if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \
475 || defined _AIX || defined _MSC_VER || defined _ALLOCA_H)
476 # define YYSTACK_USE_ALLOCA 1
480 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
482 # Below the limit of 200.
483 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
484 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
485 # Two enlargements: 2 * 2 * 200.
486 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
487 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
488 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
489 # multiply by two starting at 200 => 5120 is the last possible).
490 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
491 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
493 # The push parser can't use alloca since the stacks can't be locals. This test
494 # just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect
496 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
497 [[%define api.push-pull both
499 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
500 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
501 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
502 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
503 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
504 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
506 m4_popdef([AT_USE_ALLOCA])
513 ## -------------------------------------- ##
514 ## Exploding the Stack Size with Malloc. ##
515 ## -------------------------------------- ##
517 AT_SETUP([Exploding the Stack Size with Malloc])
519 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
521 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
523 # Below the limit of 200.
524 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
525 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
526 # Two enlargements: 2 * 2 * 200.
527 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
528 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
529 # Fails: beyond the limit of 10,000 (which we don't reach anyway since we
530 # multiply by two starting at 200 => 5120 is the possible).
531 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
532 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
534 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
535 [[%define api.push-pull both
537 AT_PARSER_CHECK([./input 20], 0, [], [ignore],
538 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
539 AT_PARSER_CHECK([./input 900], 0, [], [ignore],
540 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
541 AT_PARSER_CHECK([./input 10000], 2, [], [ignore],
542 [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]])
544 m4_popdef([AT_USE_ALLOCA])