]> git.saurik.com Git - bison.git/blob - tests/torture.at
regen
[bison.git] / tests / torture.at
1 # Torturing Bison. -*- Autotest -*-
2
3 # Copyright (C) 2001-2002, 2004-2007, 2009-2012 Free Software
4 # Foundation, Inc.
5
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.
10 #
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.
15 #
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/>.
18
19 AT_BANNER([[Torture Tests.]])
20
21
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`
27 case $data_limit in
28 [[0-9]]*)
29 if test "$data_limit" -lt $1; then
30 AT_CHECK([ulimit -S -d $1 || exit 77])
31 ulimit -S -d $1
32 fi
33 esac])
34
35
36 ## ------------------------------------- ##
37 ## Creating a large artificial grammar. ##
38 ## ------------------------------------- ##
39
40 # AT_DATA_TRIANGULAR_GRAMMAR(FILE-NAME, SIZE)
41 # -------------------------------------------
42 # Create FILE-NAME, containing a self checking parser for a huge
43 # triangular grammar.
44 m4_define([AT_DATA_TRIANGULAR_GRAMMAR],
45 [AT_BISON_OPTION_PUSHDEFS
46 AT_DATA([[gengram.pl]],
47 [[#! /usr/bin/perl -w
48
49 use strict;
50 my $max = $ARGV[0] || 10;
51
52 print <<EOF;
53 ]AT_DATA_GRAMMAR_PROLOGUE[
54 %error-verbose
55 %debug
56 %{
57 #include <stdio.h>
58 #include <stdlib.h>
59 #include <assert.h>
60 #define MAX $max
61 ]AT_YYLEX_DECLARE[
62 ]AT_YYERROR_DECLARE[
63 %}
64 %union
65 {
66 int val;
67 };
68
69 %token END "end"
70 %type <val> exp input
71 EOF
72
73 for my $size (1 .. $max)
74 {
75 print "%token t$size $size \"$size\"\n";
76 };
77
78 print <<EOF;
79 %%
80 input:
81 exp { assert (\@S|@1 == 0); \$\$ = \@S|@1; }
82 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
83 ;
84
85 exp:
86 END
87 { \$\$ = 0; }
88 EOF
89
90 for my $size (1 .. $max)
91 {
92 use Text::Wrap;
93 print wrap ("| ", " ",
94 (map { "\"$_\"" } (1 .. $size)),
95 " END \n"),
96 " { \$\$ = $size; }\n";
97 };
98 print ";\n";
99
100 print <<\EOF;
101 %%
102 ]AT_YYERROR_DEFINE[
103 static int
104 yylex (void)
105 {
106 static int inner = 1;
107 static int outer = 0;
108 if (outer > MAX)
109 return 0;
110 else if (inner > outer)
111 {
112 inner = 1;
113 ++outer;
114 return END;
115 }
116 return inner++;
117 }
118 int
119 main (void)
120 {
121 yydebug = !!getenv ("YYDEBUG");
122 return yyparse ();
123 }
124 EOF
125 ]])
126 AT_BISON_OPTION_POPDEFS
127
128 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
129 mv stdout $1
130 ])
131
132
133 ## -------------- ##
134 ## Big triangle. ##
135 ## -------------- ##
136
137 AT_SETUP([Big triangle])
138
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])
145 AT_COMPILE([input])
146 AT_PARSER_CHECK([./input])
147
148 AT_CLEANUP
149
150
151
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
160
161 use strict;
162 my $max = $ARGV[0] || 10;
163
164 print <<EOF;
165 ]AT_DATA_GRAMMAR_PROLOGUE[
166 %error-verbose
167 %debug
168 %{
169 #include <stdio.h>
170 #include <stdlib.h>
171 #define MAX $max
172 ]AT_YYLEX_DECLARE[
173 ]AT_YYERROR_DECLARE[
174 %}
175
176 %token
177 EOF
178 for my $size (1 .. $max)
179 {
180 print " t$size $size \"$size\"\n";
181 };
182
183 print <<EOF;
184
185 %%
186 EOF
187
188 use Text::Wrap;
189 print
190 wrap ("exp: ", " ",
191 (map { "\"$_\"" } (1 .. $max)), ";"),
192 "\n";
193
194 print <<\EOF;
195 %%
196 #include <assert.h>
197 ]AT_YYERROR_DEFINE[
198 static int
199 yylex (void)
200 {
201 static int counter = 1;
202 if (counter <= MAX)
203 return counter++;
204 assert (counter++ == MAX + 1);
205 return 0;
206 }
207
208 int
209 main (void)
210 {
211 yydebug = !!getenv ("YYDEBUG");
212 return yyparse ();
213 }
214 EOF
215 ]])
216
217 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
218 mv stdout $1
219 AT_BISON_OPTION_POPDEFS
220 ])
221
222
223 ## ---------------- ##
224 ## Big horizontal. ##
225 ## ---------------- ##
226
227 AT_SETUP([Big horizontal])
228
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:
231 #
232 # input.y 263k
233 # input.tab.c 1.3M
234 # input 453k
235 #
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
240 #
241 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
242
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)
246
247 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
248 AT_COMPILE([input])
249 AT_PARSER_CHECK([./input])
250
251 AT_CLEANUP
252
253
254
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
263
264 use strict;
265 use Text::Wrap;
266 my $max = $ARGV[0] || 10;
267
268 print <<EOF;
269 %error-verbose
270 %debug
271 %{
272 # include <stdio.h>
273 # include <stdlib.h>
274 # include <assert.h>
275 # define MAX $max
276 ]AT_YYLEX_DECLARE[
277 ]AT_YYERROR_DECLARE[
278 %}
279 %union
280 {
281 int val;
282 };
283
284 %type <val> input exp
285 %token token
286 EOF
287
288 print
289 wrap ("%type <val> ",
290 " ",
291 map { "n$_" } (1 .. $max)),
292 "\n";
293
294 print "%token\n";
295 for my $count (1 .. $max)
296 {
297 print " t$count $count \"$count\"\n";
298 };
299
300 print <<EOF;
301 %%
302 input:
303 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
304 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
305 ;
306
307 exp:
308 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
309 EOF
310
311 for my $count (2 .. $max)
312 {
313 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
314 };
315 print ";\n";
316
317 for my $count (1 .. $max)
318 {
319 print "n$count: token { \$\$ = $count; };\n";
320 };
321
322 print <<\EOF;
323 %%
324 ]AT_YYERROR_DEFINE[
325 static int
326 yylex (void)
327 {
328 static int return_token = 1;
329 static int counter = 1;
330 if (counter > MAX)
331 {
332 assert (counter++ == MAX + 1);
333 return 0;
334 }
335 if (return_token)
336 {
337 return_token = 0;
338 return token;
339 }
340 return_token = 1;
341 return counter++;
342 }
343
344 int
345 main (void)
346 {
347 yydebug = !!getenv ("YYDEBUG");
348 return yyparse ();
349 }
350 EOF
351 ]])
352
353 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
354 mv stdout $1
355 AT_BISON_OPTION_POPDEFS
356 ])
357
358
359 ## ------------------------ ##
360 ## Many lookahead tokens. ##
361 ## ------------------------ ##
362
363 AT_SETUP([Many lookahead tokens])
364
365 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
366
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)
370
371 AT_BISON_CHECK([-v -o input.c input.y])
372 AT_COMPILE([input])
373 AT_PARSER_CHECK([./input])
374
375 AT_CLEANUP
376
377
378
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.
385 # exp:
386 AT_DATA([input.y],
387 [[%{
388 #include <errno.h>
389 #include <limits.h>
390 #include <stdio.h>
391 #include <stdlib.h>
392 ]$1[
393 ]AT_YYLEX_DECLARE[
394 ]AT_YYERROR_DECLARE[
395 %}
396 ]$2[
397 %error-verbose
398 %debug
399 %token WAIT_FOR_EOF
400 %%
401 exp: WAIT_FOR_EOF exp | ;
402 %%
403 ]AT_YYERROR_DEFINE[
404 #include <assert.h>
405 static int
406 yylex (void)
407 {
408 assert (0 <= yylval);
409 if (yylval--)
410 return WAIT_FOR_EOF;
411 else
412 return EOF;
413 }
414
415 int
416 main (int argc, const char **argv)
417 {
418 char *endp;
419 YYSTYPE yylval_init;
420 assert (argc == 2);
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);
426 yydebug = 1;
427 {
428 int count;
429 int status;
430 ]m4_bmatch([$2], [%push-],
431 [[ yypstate *ps = yypstate_new ();
432 ]])[ for (count = 0; count < 2; ++count)
433 {
434 int new_status;
435 yylval = yylval_init;
436 ]m4_bmatch([$2], [%push-],
437 [[ new_status = yypull_parse (ps);
438 ]],
439 [[ new_status = yyparse ();
440 ]])[ assert (0 <= count || new_status == status);
441 status = new_status;
442 }
443 ]m4_bmatch([$2], [%push-],
444 [[ yypstate_delete (ps);
445 ]])[ return status;
446 }
447 }
448 ]])
449 AT_BISON_OPTION_POPDEFS([$2])
450 AT_BISON_CHECK([-o input.c input.y])
451 AT_COMPILE([input])
452 ])
453
454
455 ## -------------------------------------- ##
456 ## Exploding the Stack Size with Alloca. ##
457 ## -------------------------------------- ##
458
459 AT_SETUP([Exploding the Stack Size with Alloca])
460
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
465 #endif
466 ]])
467
468 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
469
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"]])
480
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
483 # push parsers.
484 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
485 [[%define api.push-pull both
486 ]])
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"]])
493
494 m4_popdef([AT_USE_ALLOCA])
495
496 AT_CLEANUP
497
498
499
500
501 ## -------------------------------------- ##
502 ## Exploding the Stack Size with Malloc. ##
503 ## -------------------------------------- ##
504
505 AT_SETUP([Exploding the Stack Size with Malloc])
506
507 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
508
509 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
510
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"]])
521
522 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
523 [[%define api.push-pull both
524 ]])
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"]])
531
532 m4_popdef([AT_USE_ALLOCA])
533
534 AT_CLEANUP