]> git.saurik.com Git - bison.git/blob - tests/torture.at
tests: support api.prefix.
[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
60 ]AT_YYLEX_DECLARE[
61 ]AT_YYERROR_DECLARE[
62 %}
63 %union
64 {
65 int val;
66 };
67
68 %token END "end"
69 %type <val> exp input
70 EOF
71
72 for my $size (1 .. $max)
73 {
74 print "%token t$size $size \"$size\"\n";
75 };
76
77 print <<EOF;
78 %%
79 input:
80 exp { if (\@S|@1 != 0) abort (); \$\$ = \@S|@1; }
81 | input exp { if (\@S|@2 != \@S|@1 + 1) abort (); \$\$ = \@S|@2; }
82 ;
83
84 exp:
85 END
86 { \$\$ = 0; }
87 EOF
88
89 for my $size (1 .. $max)
90 {
91 use Text::Wrap;
92 print wrap ("| ", " ",
93 (map { "\"$_\"" } (1 .. $size)),
94 " END \n"),
95 " { \$\$ = $size; }\n";
96 };
97 print ";\n";
98
99 print <<EOF;
100 %%
101 static int
102 yylex (void)
103 {
104 static int inner = 1;
105 static int outer = 0;
106 if (outer > $max)
107 return 0;
108 else if (inner > outer)
109 {
110 inner = 1;
111 ++outer;
112 return END;
113 }
114 return inner++;
115 }
116
117 static void
118 yyerror (const char *msg)
119 {
120 fprintf (stderr, "%s\\n", msg);
121 }
122
123 int
124 main (void)
125 {
126 yydebug = !!getenv ("YYDEBUG");
127 return yyparse ();
128 }
129 EOF
130 ]])
131 AT_BISON_OPTION_POPDEFS
132
133 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
134 mv stdout $1
135 ])
136
137
138 ## -------------- ##
139 ## Big triangle. ##
140 ## -------------- ##
141
142 AT_SETUP([Big triangle])
143
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])
150 AT_COMPILE([input])
151 AT_PARSER_CHECK([./input])
152
153 AT_CLEANUP
154
155
156
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
165
166 use strict;
167 my $max = $ARGV[0] || 10;
168
169 print <<EOF;
170 ]AT_DATA_GRAMMAR_PROLOGUE[
171 %error-verbose
172 %debug
173 %{
174 #include <stdio.h>
175 #include <stdlib.h>
176
177 ]AT_YYLEX_DECLARE[
178 ]AT_YYERROR_DECLARE[
179 %}
180
181 %token
182 EOF
183 for my $size (1 .. $max)
184 {
185 print " t$size $size \"$size\"\n";
186 };
187
188 print <<EOF;
189
190 %%
191 EOF
192
193 use Text::Wrap;
194 print
195 wrap ("exp: ", " ",
196 (map { "\"$_\"" } (1 .. $max)), ";"),
197 "\n";
198
199 print <<EOF;
200 %%
201 static int
202 yylex (void)
203 {
204 static int counter = 1;
205 if (counter <= $max)
206 return counter++;
207 if (counter++ != $max + 1)
208 abort ();
209 return 0;
210 }
211
212 static void
213 yyerror (const char *msg)
214 {
215 fprintf (stderr, "%s\\n", msg);
216 }
217
218 int
219 main (void)
220 {
221 yydebug = !!getenv ("YYDEBUG");
222 return yyparse ();
223 }
224 EOF
225 ]])
226
227 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
228 mv stdout $1
229 AT_BISON_OPTION_POPDEFS
230 ])
231
232
233 ## ---------------- ##
234 ## Big horizontal. ##
235 ## ---------------- ##
236
237 AT_SETUP([Big horizontal])
238
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:
241 #
242 # input.y 263k
243 # input.tab.c 1.3M
244 # input 453k
245 #
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
250 #
251 AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
252
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)
256
257 AT_BISON_CHECK_NO_XML([-v -o input.c input.y])
258 AT_COMPILE([input])
259 AT_PARSER_CHECK([./input])
260
261 AT_CLEANUP
262
263
264
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
273
274 use strict;
275 use Text::Wrap;
276 my $max = $ARGV[0] || 10;
277
278 print <<EOF;
279 %error-verbose
280 %debug
281 %{
282 # include <stdio.h>
283 # include <stdlib.h>
284 # include <assert.h>
285
286 ]AT_YYLEX_DECLARE[
287 ]AT_YYERROR_DECLARE[
288 %}
289 %union
290 {
291 int val;
292 };
293
294 %type <val> input exp
295 %token token
296 EOF
297
298 print
299 wrap ("%type <val> ",
300 " ",
301 map { "n$_" } (1 .. $max)),
302 "\n";
303
304 print "%token\n";
305 for my $count (1 .. $max)
306 {
307 print " t$count $count \"$count\"\n";
308 };
309
310 print <<EOF;
311 %%
312 input:
313 exp { assert (\@S|@1 == 1); \$\$ = \@S|@1; }
314 | input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
315 ;
316
317 exp:
318 n1 "1" { assert (\@S|@1 == 1); \@S|@\@S|@ = \@S|@1; }
319 EOF
320
321 for my $count (2 .. $max)
322 {
323 print "| n$count \"$count\" { assert (\@S|@1 == $count); \@S|@\@S|@ = \@S|@1; }\n";
324 };
325 print ";\n";
326
327 for my $count (1 .. $max)
328 {
329 print "n$count: token { \$\$ = $count; };\n";
330 };
331
332 print <<EOF;
333 %%
334 static int
335 yylex (void)
336 {
337 static int return_token = 1;
338 static int counter = 1;
339 if (counter > $max)
340 {
341 if (counter++ != $max + 1)
342 abort ();
343 return 0;
344 }
345 if (return_token)
346 {
347 return_token = 0;
348 return token;
349 }
350 return_token = 1;
351 return counter++;
352 }
353
354 static void
355 yyerror (const char *msg)
356 {
357 fprintf (stderr, "%s\\n", msg);
358 }
359
360 int
361 main (void)
362 {
363 yydebug = !!getenv ("YYDEBUG");
364 return yyparse ();
365 }
366 EOF
367 ]])
368
369 AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
370 mv stdout $1
371 AT_BISON_OPTION_POPDEFS
372 ])
373
374
375 ## ------------------------ ##
376 ## Many lookahead tokens. ##
377 ## ------------------------ ##
378
379 AT_SETUP([Many lookahead tokens])
380
381 AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000])
382
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)
386
387 AT_BISON_CHECK([-v -o input.c input.y])
388 AT_COMPILE([input])
389 AT_PARSER_CHECK([./input])
390
391 AT_CLEANUP
392
393
394
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.
401 # exp:
402 AT_DATA([input.y],
403 [[%{
404 #include <errno.h>
405 #include <limits.h>
406 #include <stdio.h>
407 #include <stdlib.h>
408 ]$1[
409 ]AT_YYLEX_DECLARE[
410 ]AT_YYERROR_DECLARE[
411 %}
412 ]$2[
413 %error-verbose
414 %debug
415 %token WAIT_FOR_EOF
416 %%
417 exp: WAIT_FOR_EOF exp | ;
418 %%
419 ]AT_YYERROR_DEFINE[
420 static int
421 yylex (void)
422 {
423 if (yylval < 0)
424 abort ();
425 if (yylval--)
426 return WAIT_FOR_EOF;
427 else
428 return EOF;
429 }
430
431 int
432 main (int argc, const char **argv)
433 {
434 char *endp;
435 YYSTYPE yylval_init;
436 if (argc != 2)
437 abort ();
438 yylval_init = strtol (argv[1], &endp, 10);
439 if (! (argv[1] != endp
440 && 0 <= yylval_init && yylval_init <= INT_MAX
441 && errno != ERANGE))
442 abort ();
443 yydebug = 1;
444 {
445 int count;
446 int status;
447 ]m4_bmatch([$2], [%push-],
448 [[ yypstate *ps = yypstate_new ();
449 ]])[ for (count = 0; count < 2; ++count)
450 {
451 int new_status;
452 yylval = yylval_init;
453 ]m4_bmatch([$2], [%push-],
454 [[ new_status = yypull_parse (ps);
455 ]],
456 [[ new_status = yyparse ();
457 ]])[ if (count > 0 && new_status != status)
458 abort ();
459 status = new_status;
460 }
461 ]m4_bmatch([$2], [%push-],
462 [[ yypstate_delete (ps);
463 ]])[ return status;
464 }
465 }
466 ]])
467 AT_BISON_OPTION_POPDEFS([$2])
468 AT_BISON_CHECK([-o input.c input.y])
469 AT_COMPILE([input])
470 ])
471
472
473 ## -------------------------------------- ##
474 ## Exploding the Stack Size with Alloca. ##
475 ## -------------------------------------- ##
476
477 AT_SETUP([Exploding the Stack Size with Alloca])
478
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
483 #endif
484 ]])
485
486 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
487
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"]])
498
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
501 # push parsers.
502 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
503 [[%define api.push-pull both
504 ]])
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"]])
511
512 m4_popdef([AT_USE_ALLOCA])
513
514 AT_CLEANUP
515
516
517
518
519 ## -------------------------------------- ##
520 ## Exploding the Stack Size with Malloc. ##
521 ## -------------------------------------- ##
522
523 AT_SETUP([Exploding the Stack Size with Malloc])
524
525 m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]])
526
527 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA])
528
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"]])
539
540 AT_DATA_STACK_TORTURE([AT_USE_ALLOCA],
541 [[%define api.push-pull both
542 ]])
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"]])
549
550 m4_popdef([AT_USE_ALLOCA])
551
552 AT_CLEANUP