mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
62a3e4f0c5
RITEM. Note that it must be able to code symbol numbers as positive number, and the negation of rule numbers as negative numbers. Adjust all dependencies (pretty many). * src/reduce.c (rule): Remove this `short *' pointer: use item_number_t. * src/system.h (MINSHORT, MAXSHORT): Remove. Include `limits.h'. Adjust dependencies to using SHRT_MAX and SHRT_MIN. (shortcpy): Remove. (MAXTABLE): Move to... * src/output.c (MAXTABLE): here. (prepare_rules): Use output_int_table to output rhs. * data/bison.simple, data/bison.c++: Adjust. * tests/torture.at (Big triangle): Move the limit from 254 to 500. * tests/regression.at (Web2c Actions): Ajust. Trying with bigger grammars shows various phenomena: at 3000 (28Mb of grammar file) bison is killed by my system, at 2000 (12Mb) bison passes, but produces negative #line number, once fixed, GCC is killed while compiling 14Mb, at 1500 (6.7 Mb of grammar, 8.2Mb of C), it passes. * src/state.h (state_h): Code input lines on ints, not shorts.
340 lines
7.1 KiB
Plaintext
340 lines
7.1 KiB
Plaintext
# Torturing Bison. -*- Autotest -*-
|
|
# Copyright (C) 2001, 2002 Free Software Foundation, Inc.
|
|
|
|
# This program is free software; you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation; either version 2, or (at your option)
|
|
# any later version.
|
|
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program; if not, write to the Free Software
|
|
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
# 02111-1307, USA.
|
|
|
|
AT_BANNER([[Torture Tests.]])
|
|
|
|
|
|
## ------------------------------------- ##
|
|
## Creating a large artificial grammar. ##
|
|
## ------------------------------------- ##
|
|
|
|
# AT_DATA_TRIANGULAR_GRAMMAR(FILE-NAME, SIZE)
|
|
# -------------------------------------------
|
|
# Create FILE-NAME, containing a self checking parser for a huge
|
|
# triangular grammar.
|
|
# FIXME: The `10 *' below are there to avoid clashes with predefined
|
|
# tokens. These clashes should be exercised, I'm afraid something
|
|
# is broken wrt previous Bisons.
|
|
m4_define([AT_DATA_TRIANGULAR_GRAMMAR],
|
|
[AT_DATA([[gengram.pl]],
|
|
[[#! /usr/bin/perl -w
|
|
|
|
use strict;
|
|
my $max = $ARGV[0] || 10;
|
|
|
|
print <<EOF;
|
|
%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
#define YYERROR_VERBOSE 1
|
|
#define YYDEBUG 1
|
|
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
%}
|
|
%union
|
|
{
|
|
int val;
|
|
};
|
|
|
|
%token END "end"
|
|
%type <val> exp input
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
print "%token \"$size\" ", $size * 10, "\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
input:
|
|
exp { assert (\@S|@1 == 0); \$\$ = \@S|@1; }
|
|
| input exp { assert (\@S|@2 == \@S|@1 + 1); \$\$ = \@S|@2; }
|
|
;
|
|
|
|
exp:
|
|
END
|
|
{ \$\$ = 0; }
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
use Text::Wrap;
|
|
print wrap ("| ", " ",
|
|
(map { "\"$_\"" } (1 .. $size)),
|
|
" END \n"),
|
|
" { \$\$ = $size; }\n";
|
|
};
|
|
print ";\n";
|
|
|
|
print <<EOF;
|
|
%%
|
|
static int
|
|
yylex (void)
|
|
{
|
|
static int inner = 1;
|
|
static int outer = 0;
|
|
if (outer > $max)
|
|
return 0;
|
|
else if (inner > outer)
|
|
{
|
|
inner = 1;
|
|
++outer;
|
|
return END;
|
|
}
|
|
return inner++ * 10;
|
|
}
|
|
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\\n", msg);
|
|
}
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
yydebug = !!getenv ("YYDEBUG");
|
|
return yyparse ();
|
|
}
|
|
EOF
|
|
]])
|
|
|
|
AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
|
|
mv stdout $1
|
|
])
|
|
|
|
|
|
## -------------- ##
|
|
## Big triangle. ##
|
|
## -------------- ##
|
|
|
|
AT_SETUP([Big triangle])
|
|
|
|
# I have been able to go up to 2000 on my machine.
|
|
# I tried 3000, a 29Mb grammar file, but then my system killed bison.
|
|
AT_DATA_TRIANGULAR_GRAMMAR([input.y], [500])
|
|
AT_CHECK([bison input.y -v -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
AT_CHECK([./input])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
# AT_DATA_HORIZONTAL_GRAMMAR(FILE-NAME, SIZE)
|
|
# -------------------------------------------
|
|
# Create FILE-NAME, containing a self checking parser for a huge
|
|
# horizontal grammar.
|
|
# FIXME: The `10 *' below are there to avoid clashes with predefined
|
|
# tokens. These clashes should be exercised, I'm afraid something
|
|
# is broken wrt previous Bisons.
|
|
m4_define([AT_DATA_HORIZONTAL_GRAMMAR],
|
|
[AT_DATA([[gengram.pl]],
|
|
[[#! /usr/bin/perl -w
|
|
|
|
use strict;
|
|
my $max = $ARGV[0] || 10;
|
|
|
|
print <<EOF;
|
|
%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
#define YYERROR_VERBOSE 1
|
|
#define YYDEBUG 1
|
|
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
%}
|
|
EOF
|
|
|
|
for my $size (1 .. $max)
|
|
{
|
|
print "%token \"$size\" ", $size * 10, "\n";
|
|
};
|
|
|
|
print <<EOF;
|
|
%%
|
|
EOF
|
|
|
|
use Text::Wrap;
|
|
print
|
|
wrap ("exp: ", " ",
|
|
(map { "\"$_\"" } (1 .. $max)), ";"),
|
|
"\n";
|
|
|
|
print <<EOF;
|
|
%%
|
|
static int
|
|
yylex (void)
|
|
{
|
|
static int counter = 1;
|
|
if (counter > $max)
|
|
return 0;
|
|
else
|
|
return counter++ * 10;
|
|
}
|
|
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\\n", msg);
|
|
}
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
yydebug = !!getenv ("YYDEBUG");
|
|
return yyparse ();
|
|
}
|
|
EOF
|
|
]])
|
|
|
|
AT_CHECK([perl -w ./gengram.pl $2 || exit 77], 0, [stdout])
|
|
mv stdout $1
|
|
])
|
|
|
|
|
|
## ---------------- ##
|
|
## Big horizontal. ##
|
|
## ---------------- ##
|
|
|
|
AT_SETUP([Big horizontal])
|
|
|
|
# I have been able to go up to 10000 on my machine, but I had to
|
|
# increase the maximum stack size (* 100). It gave:
|
|
#
|
|
# input.y 263k
|
|
# input.tab.c 1.3M
|
|
# input 453k
|
|
#
|
|
# gengram.pl 10000 0.70s user 0.01s sys 99% cpu 0.711 total
|
|
# bison input.y 730.56s user 0.53s sys 99% cpu 12:12.34 total
|
|
# gcc -Wall input.tab.c -o input 5.81s user 0.20s sys 100% cpu 6.01 total
|
|
# ./input 0.00s user 0.01s sys 108% cpu 0.01 total
|
|
#
|
|
AT_DATA_HORIZONTAL_GRAMMAR([input.y], [1000])
|
|
AT_CHECK([bison input.y -v -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
AT_CHECK([./input])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
# AT_DATA_STACK_TORTURE(C-PROLOGUE)
|
|
# ---------------------------------
|
|
# A parser specialized in torturing the stack size.
|
|
m4_define([AT_DATA_STACK_TORTURE],
|
|
[# A grammar of parens growing the stack thanks to right recursion.
|
|
# exp:
|
|
AT_DATA([input.y],
|
|
[[%{
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
]$1[
|
|
static int yylex (void);
|
|
static void yyerror (const char *msg);
|
|
#define YYPRINT(File, Type, Value) \
|
|
fprintf (File, " (%d, stack size = %d, max = %d)", \
|
|
Value, yyssp - yyss + 1, yystacksize);
|
|
%}
|
|
%error-verbose
|
|
%debug
|
|
%token WAIT_FOR_EOF
|
|
%%
|
|
exp: WAIT_FOR_EOF exp | ;
|
|
%%
|
|
static void
|
|
yyerror (const char *msg)
|
|
{
|
|
fprintf (stderr, "%s\n", msg);
|
|
exit (1);
|
|
}
|
|
|
|
/* There are YYLVAL_MAX of WAIT_FOR_EOFs. */
|
|
unsigned int yylval_max;
|
|
|
|
static int
|
|
yylex (void)
|
|
{
|
|
if (yylval--)
|
|
return WAIT_FOR_EOF;
|
|
else
|
|
return EOF;
|
|
}
|
|
|
|
int
|
|
main (int argc, const char **argv)
|
|
{
|
|
assert (argc == 2);
|
|
yylval = atoi (argv[1]);
|
|
yydebug = 1;
|
|
return yyparse ();
|
|
}
|
|
]])
|
|
AT_CHECK([bison input.y -o input.c])
|
|
AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore])
|
|
])
|
|
|
|
|
|
## -------------------------------------- ##
|
|
## Exploding the Stack Size with Alloca. ##
|
|
## -------------------------------------- ##
|
|
|
|
AT_SETUP([Exploding the Stack Size with Alloca])
|
|
|
|
AT_DATA_STACK_TORTURE
|
|
|
|
# Below the limit of 200.
|
|
AT_CHECK([./input 20], 0, [], [ignore])
|
|
# Two enlargements: 2 * 2 * 200.
|
|
AT_CHECK([./input 900], 0, [], [ignore])
|
|
# Fails: beyond the limit of 10,000 (which we don't reach anyway since we
|
|
# multiply by two starting at 200 => 5120 is the last possible).
|
|
AT_CHECK([./input 10000], 1, [], [ignore])
|
|
|
|
AT_CLEANUP
|
|
|
|
|
|
|
|
|
|
## -------------------------------------- ##
|
|
## Exploding the Stack Size with Malloc. ##
|
|
## -------------------------------------- ##
|
|
|
|
AT_SETUP([Exploding the Stack Size with Malloc])
|
|
|
|
AT_DATA_STACK_TORTURE([[#define YYSTACK_USE_ALLOCA 0]])
|
|
|
|
# Below the limit of 200.
|
|
AT_CHECK([./input 20], 0, [], [ignore])
|
|
# Two enlargements: 2 * 2 * 200.
|
|
AT_CHECK([./input 900], 0, [], [ignore])
|
|
# Fails: beyond the limit of 10,000 (which we don't reach anyway since we
|
|
# multiply by two starting at 200 => 5120 is the possible).
|
|
AT_CHECK([./input 10000], 1, [], [ignore])
|
|
|
|
AT_CLEANUP
|