X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/39ceb25bdbe9fe2a0963f55430a8dd44e82c3161..09ccae9b18a7c09ebf7bb8df2a18c8c4a6def248:/tests/torture.at diff --git a/tests/torture.at b/tests/torture.at index 2e0cfc92..753fc919 100644 --- a/tests/torture.at +++ b/tests/torture.at @@ -1,24 +1,37 @@ # Torturing Bison. -*- Autotest -*- -# Copyright (C) 2001, 2002 Free Software Foundation, Inc. +# Copyright (C) 2001, 2002, 2004, 2005, 2006, 2007 Free Software Foundation, +# Inc. -# This program is free software; you can redistribute it and/or modify +# 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. - +# the Free Software Foundation, either version 3 of the License, 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. +# along with this program. If not, see . AT_BANNER([[Torture Tests.]]) +# AT_INCREASE_DATA_SIZE(SIZE) +# --------------------------- +# Try to increase the data size to SIZE KiB if possible. +m4_define([AT_INCREASE_DATA_SIZE], +[data_limit=`(ulimit -S -d) 2>/dev/null` +case $data_limit in +[[0-9]]*) + if test "$data_limit" -lt $1; then + AT_CHECK([ulimit -S -d $1 || exit 77]) + ulimit -S -d $1 + fi +esac]) + + ## ------------------------------------- ## ## Creating a large artificial grammar. ## ## ------------------------------------- ## @@ -35,13 +48,12 @@ use strict; my $max = $ARGV[0] || 10; print < #include -#include - -#define YYERROR_VERBOSE 1 -#define YYDEBUG 1 static int yylex (void); static void yyerror (const char *msg); @@ -57,14 +69,14 @@ EOF for my $size (1 .. $max) { - print "%token \"$size\" ", $size, "\n"; + print "%token t$size $size \"$size\"\n"; }; print < #include -#include - -#define YYERROR_VERBOSE 1 -#define YYDEBUG 1 static int yylex (void); static void yyerror (const char *msg); %} -EOF +%token +EOF for my $size (1 .. $max) { - print "%token \"$size\" ", $size, "\n"; + print " t$size $size \"$size\"\n"; }; print < $max) - return 0; - else - return counter++; + if (counter <= $max) + return counter++; + if (counter++ != $max + 1) + abort (); + return 0; } static void @@ -228,19 +244,24 @@ AT_SETUP([Big horizontal]) # ./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]) + +# GNU m4 requires about 70 MiB for this test on a 32-bit host. +# Ask for 200 MiB, which should be plenty even on a 64-bit host. +AT_INCREASE_DATA_SIZE(204000) + +AT_BISON_CHECK_NO_XML([-v -o input.c input.y]) +AT_COMPILE([input]) +AT_PARSER_CHECK([./input]) AT_CLEANUP -# AT_DATA_LOOKAHEADS_GRAMMAR(FILE-NAME, SIZE) -# ------------------------------------------- +# AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR(FILE-NAME, SIZE) +# -------------------------------------------------- # Create FILE-NAME, containing a self checking parser for a grammar -# requiring SIZE lookaheads. -m4_define([AT_DATA_LOOKAHEADS_GRAMMAR], +# requiring SIZE lookahead tokens. +m4_define([AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR], [AT_DATA([[gengram.pl]], [[#! /usr/bin/perl -w @@ -249,13 +270,12 @@ use Text::Wrap; my $max = $ARGV[0] || 10; print < -#include -#include - -#define YYERROR_VERBOSE 1 -#define YYDEBUG 1 +# include +# include +# include static int yylex (void); static void yyerror (const char *msg); @@ -272,12 +292,13 @@ EOF print wrap ("%type ", " ", - map { "token$_" } (1 .. $max)), + map { "n$_" } (1 .. $max)), "\n"; +print "%token\n"; for my $count (1 .. $max) { - print "%token \"$count\" $count\n"; + print " t$count $count \"$count\"\n"; }; print < $max) - return 0; + { + if (counter++ != $max + 1) + abort (); + return 0; + } if (return_token) { return_token = 0; @@ -340,39 +365,43 @@ mv stdout $1 ]) -## ----------------- ## -## Many lookaheads. ## -## ----------------- ## +## ------------------------ ## +## Many lookahead tokens. ## +## ------------------------ ## + +AT_SETUP([Many lookahead tokens]) + +AT_DATA_LOOKAHEAD_TOKENS_GRAMMAR([input.y], [1000]) -AT_SETUP([Many lookaheads]) +# GNU m4 requires about 70 MiB for this test on a 32-bit host. +# Ask for 200 MiB, which should be plenty even on a 64-bit host. +AT_INCREASE_DATA_SIZE(204000) -AT_DATA_LOOKAHEADS_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_BISON_CHECK([-v -o input.c input.y]) +AT_COMPILE([input]) +AT_PARSER_CHECK([./input]) AT_CLEANUP -# AT_DATA_STACK_TORTURE(C-PROLOGUE) -# --------------------------------- +# AT_DATA_STACK_TORTURE(C-PROLOGUE, [BISON-DECLS]) +# ------------------------------------------------ # 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 +#include #include #include -#include ]$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); %} +]$2[ %error-verbose %debug %token WAIT_FOR_EOF @@ -383,15 +412,13 @@ 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 < 0) + abort (); if (yylval--) return WAIT_FOR_EOF; else @@ -401,14 +428,41 @@ yylex (void) int main (int argc, const char **argv) { - assert (argc == 2); - yylval = atoi (argv[1]); + char *endp; + YYSTYPE yylval_init; + if (argc != 2) + abort (); + yylval_init = strtol (argv[1], &endp, 10); + if (! (argv[1] != endp + && 0 <= yylval_init && yylval_init <= INT_MAX + && errno != ERANGE)) + abort (); yydebug = 1; - return yyparse (); + { + int count; + int status; +]m4_bmatch([$2], [%push-], +[[ yypstate *ps = yypstate_new (); +]])[ for (count = 0; count < 2; ++count) + { + int new_status; + yylval = yylval_init; +]m4_bmatch([$2], [%push-], +[[ new_status = yypull_parse (ps); +]], +[[ new_status = yyparse (); +]])[ if (count > 0 && new_status != status) + abort (); + status = new_status; + } +]m4_bmatch([$2], [%push-], +[[ yypstate_delete (ps); +]])[ return status; + } } ]]) -AT_CHECK([bison input.y -o input.c]) -AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore]) +AT_BISON_CHECK([-o input.c input.y]) +AT_COMPILE([input]) ]) @@ -418,15 +472,40 @@ AT_CHECK([$CC $CFLAGS $CPPFLAGS input.c -o input], 0, [], [ignore]) AT_SETUP([Exploding the Stack Size with Alloca]) -AT_DATA_STACK_TORTURE +m4_pushdef([AT_USE_ALLOCA], [[ +#if (defined __GNUC__ || defined __BUILTIN_VA_ARG_INCR \ + || defined _AIX || defined _MSC_VER || defined _ALLOCA_H) +# define YYSTACK_USE_ALLOCA 1 +#endif +]]) + +AT_DATA_STACK_TORTURE([AT_USE_ALLOCA]) # Below the limit of 200. -AT_CHECK([./input 20], 0, [], [ignore]) +AT_PARSER_CHECK([./input 20], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) # Two enlargements: 2 * 2 * 200. -AT_CHECK([./input 900], 0, [], [ignore]) +AT_PARSER_CHECK([./input 900], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) # 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_PARSER_CHECK([./input 10000], 2, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) + +# The push parser can't use alloca since the stacks can't be locals. This test +# just helps guarantee we don't let the YYSTACK_USE_ALLOCA feature affect +# push parsers. +AT_DATA_STACK_TORTURE([AT_USE_ALLOCA], +[[%define api.push_pull "both" +]]) +AT_PARSER_CHECK([./input 20], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) +AT_PARSER_CHECK([./input 900], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) +AT_PARSER_CHECK([./input 10000], 2, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) + +m4_popdef([AT_USE_ALLOCA]) AT_CLEANUP @@ -439,14 +518,31 @@ AT_CLEANUP AT_SETUP([Exploding the Stack Size with Malloc]) -AT_DATA_STACK_TORTURE([[#define YYSTACK_USE_ALLOCA 0]]) +m4_pushdef([AT_USE_ALLOCA], [[#define YYSTACK_USE_ALLOCA 0]]) + +AT_DATA_STACK_TORTURE([AT_USE_ALLOCA]) # Below the limit of 200. -AT_CHECK([./input 20], 0, [], [ignore]) +AT_PARSER_CHECK([./input 20], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) # Two enlargements: 2 * 2 * 200. -AT_CHECK([./input 900], 0, [], [ignore]) +AT_PARSER_CHECK([./input 900], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) # 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_PARSER_CHECK([./input 10000], 2, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) + +AT_DATA_STACK_TORTURE([AT_USE_ALLOCA], +[[%define api.push_pull "both" +]]) +AT_PARSER_CHECK([./input 20], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) +AT_PARSER_CHECK([./input 900], 0, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) +AT_PARSER_CHECK([./input 10000], 2, [], [ignore], + [[VALGRIND_OPTS="$VALGRIND_OPTS --log-fd=1"]]) + +m4_popdef([AT_USE_ALLOCA]) AT_CLEANUP