diff options
author | kpfleming <kpfleming@f38db490-d61c-443f-a65b-d21fe96a405b> | 2006-08-21 02:11:39 +0000 |
---|---|---|
committer | kpfleming <kpfleming@f38db490-d61c-443f-a65b-d21fe96a405b> | 2006-08-21 02:11:39 +0000 |
commit | 8b0c007ad990aa27d9868da49215fd1076ac77cc (patch) | |
tree | 270b9c46c1e644483d6d2a35b509f43218ba3252 /ast_expr2.c | |
parent | a42edc84034f91932a3e12d503e07f76a6eb498a (diff) |
merge new_loader_completion branch, including (at least):
- restructured build tree and makefiles to eliminate recursion problems
- support for embedded modules
- support for static builds
- simpler cross-compilation support
- simpler module/loader interface (no exported symbols)
git-svn-id: http://svn.digium.com/svn/asterisk/trunk@40722 f38db490-d61c-443f-a65b-d21fe96a405b
Diffstat (limited to 'ast_expr2.c')
-rw-r--r-- | ast_expr2.c | 2871 |
1 files changed, 0 insertions, 2871 deletions
diff --git a/ast_expr2.c b/ast_expr2.c deleted file mode 100644 index bd152549b..000000000 --- a/ast_expr2.c +++ /dev/null @@ -1,2871 +0,0 @@ -/* A Bison parser, made by GNU Bison 2.3. */ - -/* Skeleton implementation for Bison's Yacc-like parsers in C - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 - 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., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - -/* C LALR(1) parser skeleton written by Richard Stallman, by - simplifying the original so-called "semantic" parser. */ - -/* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - -/* Identify Bison output. */ -#define YYBISON 1 - -/* Bison version. */ -#define YYBISON_VERSION "2.3" - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 1 - -/* Using locations. */ -#define YYLSP_NEEDED 1 - -/* Substitute the variable and function names. */ -#define yyparse ast_yyparse -#define yylex ast_yylex -#define yyerror ast_yyerror -#define yylval ast_yylval -#define yychar ast_yychar -#define yydebug ast_yydebug -#define yynerrs ast_yynerrs -#define yylloc ast_yylloc - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - TOK_COLONCOLON = 258, - TOK_COND = 259, - TOK_OR = 260, - TOK_AND = 261, - TOK_NE = 262, - TOK_LE = 263, - TOK_GE = 264, - TOK_LT = 265, - TOK_GT = 266, - TOK_EQ = 267, - TOK_MINUS = 268, - TOK_PLUS = 269, - TOK_MOD = 270, - TOK_DIV = 271, - TOK_MULT = 272, - TOK_COMPL = 273, - TOK_EQTILDE = 274, - TOK_COLON = 275, - TOK_LP = 276, - TOK_RP = 277, - TOKEN = 278 - }; -#endif -/* Tokens. */ -#define TOK_COLONCOLON 258 -#define TOK_COND 259 -#define TOK_OR 260 -#define TOK_AND 261 -#define TOK_NE 262 -#define TOK_LE 263 -#define TOK_GE 264 -#define TOK_LT 265 -#define TOK_GT 266 -#define TOK_EQ 267 -#define TOK_MINUS 268 -#define TOK_PLUS 269 -#define TOK_MOD 270 -#define TOK_DIV 271 -#define TOK_MULT 272 -#define TOK_COMPL 273 -#define TOK_EQTILDE 274 -#define TOK_COLON 275 -#define TOK_LP 276 -#define TOK_RP 277 -#define TOKEN 278 - - - - -/* Copy the first part of user declarations. */ -#line 1 "ast_expr2.y" - -/* Written by Pace Willisson (pace@blitz.com) - * and placed in the public domain. - * - * Largely rewritten by J.T. Conklin (jtc@wimsey.com) - * - * And then overhauled twice by Steve Murphy (murf@e-tools.com) - * to add double-quoted strings, allow mult. spaces, improve - * error messages, and then to fold in a flex scanner for the - * yylex operation. - * - * $FreeBSD: src/bin/expr/expr.y,v 1.16 2000/07/22 10:59:36 se Exp $ - */ - -#include "asterisk.h" - -#ifndef STANDALONE -ASTERISK_FILE_VERSION(__FILE__, "$Revision$") -#endif - -#include <sys/types.h> -#include <stdio.h> -#include <stdlib.h> -#include <string.h> -#include <locale.h> -#include <unistd.h> -#include <ctype.h> -#if !defined(SOLARIS) && !defined(__CYGWIN__) -#include <err.h> -#else -#define quad_t int64_t -#endif -#include <errno.h> -#include <regex.h> -#include <limits.h> - -#include "asterisk/ast_expr.h" -#include "asterisk/logger.h" - -#if defined(LONG_LONG_MIN) && !defined(QUAD_MIN) -#define QUAD_MIN LONG_LONG_MIN -#endif -#if defined(LONG_LONG_MAX) && !defined(QUAD_MAX) -#define QUAD_MAX LONG_LONG_MAX -#endif - -# if ! defined(QUAD_MIN) -# define QUAD_MIN (-0x7fffffffffffffffLL-1) -# endif -# if ! defined(QUAD_MAX) -# define QUAD_MAX (0x7fffffffffffffffLL) -# endif - -#define YYPARSE_PARAM parseio -#define YYLEX_PARAM ((struct parse_io *)parseio)->scanner -#define YYERROR_VERBOSE 1 -extern char extra_error_message[4095]; -extern int extra_error_message_supplied; - -enum valtype { - AST_EXPR_integer, AST_EXPR_numeric_string, AST_EXPR_string -} ; - -#ifdef STANDALONE -void ast_log(int level, const char *file, int line, const char *function, const char *fmt, ...) __attribute__ ((format (printf,5,6))); -#endif - -struct val { - enum valtype type; - union { - char *s; - quad_t i; - } u; -} ; - -typedef void *yyscan_t; - -struct parse_io -{ - char *string; - struct val *val; - yyscan_t scanner; -}; - -static int chk_div __P((quad_t, quad_t)); -static int chk_minus __P((quad_t, quad_t, quad_t)); -static int chk_plus __P((quad_t, quad_t, quad_t)); -static int chk_times __P((quad_t, quad_t, quad_t)); -static void free_value __P((struct val *)); -static int is_zero_or_null __P((struct val *)); -static int isstring __P((struct val *)); -static struct val *make_integer __P((quad_t)); -static struct val *make_str __P((const char *)); -static struct val *op_and __P((struct val *, struct val *)); -static struct val *op_colon __P((struct val *, struct val *)); -static struct val *op_eqtilde __P((struct val *, struct val *)); -static struct val *op_div __P((struct val *, struct val *)); -static struct val *op_eq __P((struct val *, struct val *)); -static struct val *op_ge __P((struct val *, struct val *)); -static struct val *op_gt __P((struct val *, struct val *)); -static struct val *op_le __P((struct val *, struct val *)); -static struct val *op_lt __P((struct val *, struct val *)); -static struct val *op_cond __P((struct val *, struct val *, struct val *)); -static struct val *op_minus __P((struct val *, struct val *)); -static struct val *op_negate __P((struct val *)); -static struct val *op_compl __P((struct val *)); -static struct val *op_ne __P((struct val *, struct val *)); -static struct val *op_or __P((struct val *, struct val *)); -static struct val *op_plus __P((struct val *, struct val *)); -static struct val *op_rem __P((struct val *, struct val *)); -static struct val *op_times __P((struct val *, struct val *)); -static quad_t to_integer __P((struct val *)); -static void to_string __P((struct val *)); - -/* uh, if I want to predeclare yylex with a YYLTYPE, I have to predeclare the yyltype... sigh */ -typedef struct yyltype -{ - int first_line; - int first_column; - - int last_line; - int last_column; -} yyltype; - -# define YYLTYPE yyltype -# define YYLTYPE_IS_TRIVIAL 1 - -/* we will get warning about no prototype for yylex! But we can't - define it here, we have no definition yet for YYSTYPE. */ - -int ast_yyerror(const char *,YYLTYPE *, struct parse_io *); - -/* I wanted to add args to the yyerror routine, so I could print out - some useful info about the error. Not as easy as it looks, but it - is possible. */ -#define ast_yyerror(x) ast_yyerror(x,&yyloc,parseio) -#define DESTROY(x) {if((x)->type == AST_EXPR_numeric_string || (x)->type == AST_EXPR_string) free((x)->u.s); (x)->u.s = 0; free(x);} - - -/* Enabling traces. */ -#ifndef YYDEBUG -# define YYDEBUG 0 -#endif - -/* Enabling verbose error messages. */ -#ifdef YYERROR_VERBOSE -# undef YYERROR_VERBOSE -# define YYERROR_VERBOSE 1 -#else -# define YYERROR_VERBOSE 0 -#endif - -/* Enabling the token table. */ -#ifndef YYTOKEN_TABLE -# define YYTOKEN_TABLE 0 -#endif - -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE -#line 147 "ast_expr2.y" -{ - struct val *val; -} -/* Line 193 of yacc.c. */ -#line 293 "ast_expr2.c" - YYSTYPE; -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - -#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED -typedef struct YYLTYPE -{ - int first_line; - int first_column; - int last_line; - int last_column; -} YYLTYPE; -# define yyltype YYLTYPE /* obsolescent; will be withdrawn */ -# define YYLTYPE_IS_DECLARED 1 -# define YYLTYPE_IS_TRIVIAL 1 -#endif - - -/* Copy the second part of user declarations. */ -#line 151 "ast_expr2.y" - -extern int ast_yylex __P((YYSTYPE *, YYLTYPE *, yyscan_t)); - - -/* Line 216 of yacc.c. */ -#line 321 "ast_expr2.c" - -#ifdef short -# undef short -#endif - -#ifdef YYTYPE_UINT8 -typedef YYTYPE_UINT8 yytype_uint8; -#else -typedef unsigned char yytype_uint8; -#endif - -#ifdef YYTYPE_INT8 -typedef YYTYPE_INT8 yytype_int8; -#elif (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -typedef signed char yytype_int8; -#else -typedef short int yytype_int8; -#endif - -#ifdef YYTYPE_UINT16 -typedef YYTYPE_UINT16 yytype_uint16; -#else -typedef unsigned short int yytype_uint16; -#endif - -#ifdef YYTYPE_INT16 -typedef YYTYPE_INT16 yytype_int16; -#else -typedef short int yytype_int16; -#endif - -#ifndef YYSIZE_T -# ifdef __SIZE_TYPE__ -# define YYSIZE_T __SIZE_TYPE__ -# elif defined size_t -# define YYSIZE_T size_t -# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include <stddef.h> /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# else -# define YYSIZE_T unsigned int -# endif -#endif - -#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) - -#ifndef YY_ -# if YYENABLE_NLS -# if ENABLE_NLS -# include <libintl.h> /* INFRINGES ON USER NAME SPACE */ -# define YY_(msgid) dgettext ("bison-runtime", msgid) -# endif -# endif -# ifndef YY_ -# define YY_(msgid) msgid -# endif -#endif - -/* Suppress unused-variable warnings by "using" E. */ -#if ! defined lint || defined __GNUC__ -# define YYUSE(e) ((void) (e)) -#else -# define YYUSE(e) /* empty */ -#endif - -/* Identity function, used to suppress warnings about constant conditions. */ -#ifndef lint -# define YYID(n) (n) -#else -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static int -YYID (int i) -#else -static int -YYID (i) - int i; -#endif -{ - return i; -} -#endif - -#if ! defined yyoverflow || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# ifdef YYSTACK_USE_ALLOCA -# if YYSTACK_USE_ALLOCA -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# elif defined __BUILTIN_VA_ARG_INCR -# include <alloca.h> /* INFRINGES ON USER NAME SPACE */ -# elif defined _AIX -# define YYSTACK_ALLOC __alloca -# elif defined _MSC_VER -# include <malloc.h> /* INFRINGES ON USER NAME SPACE */ -# define alloca _alloca -# else -# define YYSTACK_ALLOC alloca -# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's `empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) -# ifndef YYSTACK_ALLOC_MAXIMUM - /* The OS might guarantee only one guard page at the bottom of the stack, - and a page size can be as small as 4096 bytes. So we cannot safely - invoke alloca (N) if N exceeds 4096. Use a slightly smaller number - to allow for a few compiler-allocated temporary stack slots. */ -# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ -# endif -# else -# define YYSTACK_ALLOC YYMALLOC -# define YYSTACK_FREE YYFREE -# ifndef YYSTACK_ALLOC_MAXIMUM -# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM -# endif -# if (defined __cplusplus && ! defined _STDLIB_H \ - && ! ((defined YYMALLOC || defined malloc) \ - && (defined YYFREE || defined free))) -# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# ifndef YYMALLOC -# define YYMALLOC malloc -# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifndef YYFREE -# define YYFREE free -# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void free (void *); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# endif -#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ - - -#if (! defined yyoverflow \ - && (! defined __cplusplus \ - || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \ - && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) - -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - yytype_int16 yyss; - YYSTYPE yyvs; - YYLTYPE yyls; -}; - -/* The size of the maximum gap between one aligned stack and the next. */ -# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) - -/* The size of an array large to enough to hold all stacks, each with - N elements. */ -# define YYSTACK_BYTES(N) \ - ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAXIMUM) - -/* Copy COUNT objects from FROM to TO. The source and destination do - not overlap. */ -# ifndef YYCOPY -# if defined __GNUC__ && 1 < __GNUC__ -# define YYCOPY(To, From, Count) \ - __builtin_memcpy (To, From, (Count) * sizeof (*(From))) -# else -# define YYCOPY(To, From, Count) \ - do \ - { \ - YYSIZE_T yyi; \ - for (yyi = 0; yyi < (Count); yyi++) \ - (To)[yyi] = (From)[yyi]; \ - } \ - while (YYID (0)) -# endif -# endif - -/* Relocate STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ -# define YYSTACK_RELOCATE(Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - YYCOPY (&yyptr->Stack, Stack, yysize); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (YYID (0)) - -#endif - -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 10 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 140 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 24 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 3 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 23 -/* YYNRULES -- Number of states. */ -#define YYNSTATES 46 - -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 278 - -#define YYTRANSLATE(YYX) \ - ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) - -/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ -static const yytype_uint8 yytranslate[] = -{ - 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, - 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22, 23 -}; - -#if YYDEBUG -/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -static const yytype_uint8 yyprhs[] = -{ - 0, 0, 3, 5, 6, 8, 12, 16, 20, 24, - 28, 32, 36, 40, 44, 48, 52, 55, 58, 62, - 66, 70, 74, 78 -}; - -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -static const yytype_int8 yyrhs[] = -{ - 25, 0, -1, 26, -1, -1, 23, -1, 21, 26, - 22, -1, 26, 5, 26, -1, 26, 6, 26, -1, - 26, 12, 26, -1, 26, 11, 26, -1, 26, 10, - 26, -1, 26, 9, 26, -1, 26, 8, 26, -1, - 26, 7, 26, -1, 26, 14, 26, -1, 26, 13, - 26, -1, 13, 26, -1, 18, 26, -1, 26, 17, - 26, -1, 26, 16, 26, -1, 26, 15, 26, -1, - 26, 20, 26, -1, 26, 19, 26, -1, 26, 4, - 26, 3, 26, -1 -}; - -/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ -static const yytype_uint16 yyrline[] = -{ - 0, 175, 175, 183, 190, 191, 195, 199, 203, 207, - 211, 215, 219, 223, 227, 231, 235, 239, 243, 247, - 251, 255, 259, 263 -}; -#endif - -#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE -/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. - First, the terminals, then, starting at YYNTOKENS, nonterminals. */ -static const char *const yytname[] = -{ - "$end", "error", "$undefined", "TOK_COLONCOLON", "TOK_COND", "TOK_OR", - "TOK_AND", "TOK_NE", "TOK_LE", "TOK_GE", "TOK_LT", "TOK_GT", "TOK_EQ", - "TOK_MINUS", "TOK_PLUS", "TOK_MOD", "TOK_DIV", "TOK_MULT", "TOK_COMPL", - "TOK_EQTILDE", "TOK_COLON", "TOK_LP", "TOK_RP", "TOKEN", "$accept", - "start", "expr", 0 -}; -#endif - -# ifdef YYPRINT -/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to - token YYLEX-NUM. */ -static const yytype_uint16 yytoknum[] = -{ - 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, - 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, - 275, 276, 277, 278 -}; -# endif - -/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const yytype_uint8 yyr1[] = -{ - 0, 24, 25, 25, 26, 26, 26, 26, 26, 26, - 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, - 26, 26, 26, 26 -}; - -/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ -static const yytype_uint8 yyr2[] = -{ - 0, 2, 1, 0, 1, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 2, 2, 3, 3, - 3, 3, 3, 5 -}; - -/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state - STATE-NUM when YYTABLE doesn't specify something else to do. Zero - means the default is an error. */ -static const yytype_uint8 yydefact[] = -{ - 3, 0, 0, 0, 4, 0, 2, 16, 17, 0, - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 5, 0, 6, - 7, 13, 12, 11, 10, 9, 8, 15, 14, 20, - 19, 18, 22, 21, 0, 23 -}; - -/* YYDEFGOTO[NTERM-NUM]. */ -static const yytype_int8 yydefgoto[] = -{ - -1, 5, 6 -}; - -/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -#define YYPACT_NINF -13 -static const yytype_int8 yypact[] = -{ - 109, 109, 109, 109, -13, 6, 59, 106, 106, 22, - -13, 109, 109, 109, 109, 109, 109, 109, 109, 109, - 109, 109, 109, 109, 109, 109, 109, -13, 42, 90, - 104, 120, 120, 120, 120, 120, 120, -12, -12, 106, - 106, 106, -13, -13, 109, 75 -}; - -/* YYPGOTO[NTERM-NUM]. */ -static const yytype_int8 yypgoto[] = -{ - -13, -13, -1 -}; - -/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule which - number is the opposite. If zero, do what YYDEFACT says. - If YYTABLE_NINF, syntax error. */ -#define YYTABLE_NINF -1 -static const yytype_uint8 yytable[] = -{ - 7, 8, 9, 22, 23, 24, 10, 25, 26, 0, - 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, - 38, 39, 40, 41, 42, 43, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, - 0, 25, 26, 45, 27, 44, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, - 0, 25, 26, 11, 12, 13, 14, 15, 16, 17, - 18, 19, 20, 21, 22, 23, 24, 0, 25, 26, - 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, - 22, 23, 24, 0, 25, 26, 13, 14, 15, 16, - 17, 18, 19, 20, 21, 22, 23, 24, 0, 25, - 26, 14, 15, 16, 17, 18, 19, 20, 21, 22, - 23, 24, 1, 25, 26, 25, 26, 2, 0, 0, - 3, 0, 4, 20, 21, 22, 23, 24, 0, 25, - 26 -}; - -static const yytype_int8 yycheck[] = -{ - 1, 2, 3, 15, 16, 17, 0, 19, 20, -1, - 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, - 21, 22, 23, 24, 25, 26, 4, 5, 6, 7, - 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, - -1, 19, 20, 44, 22, 3, 4, 5, 6, 7, - 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, - -1, 19, 20, 4, 5, 6, 7, 8, 9, 10, - 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, - 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, - 15, 16, 17, -1, 19, 20, 6, 7, 8, 9, - 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, - 20, 7, 8, 9, 10, 11, 12, 13, 14, 15, - 16, 17, 13, 19, 20, 19, 20, 18, -1, -1, - 21, -1, 23, 13, 14, 15, 16, 17, -1, 19, - 20 -}; - -/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const yytype_uint8 yystos[] = -{ - 0, 13, 18, 21, 23, 25, 26, 26, 26, 26, - 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 19, 20, 22, 26, 26, - 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, - 26, 26, 26, 26, 3, 26 -}; - -#define yyerrok (yyerrstatus = 0) -#define yyclearin (yychar = YYEMPTY) -#define YYEMPTY (-2) -#define YYEOF 0 - -#define YYACCEPT goto yyacceptlab -#define YYABORT goto yyabortlab -#define YYERROR goto yyerrorlab - - -/* Like YYERROR except do call yyerror. This remains here temporarily - to ease the transition to the new meaning of YYERROR, for GCC. - Once GCC version 2 has supplanted version 1, this can go. */ - -#define YYFAIL goto yyerrlab - -#define YYRECOVERING() (!!yyerrstatus) - -#define YYBACKUP(Token, Value) \ -do \ - if (yychar == YYEMPTY && yylen == 1) \ - { \ - yychar = (Token); \ - yylval = (Value); \ - yytoken = YYTRANSLATE (yychar); \ - YYPOPSTACK (1); \ - goto yybackup; \ - } \ - else \ - { \ - yyerror (YY_("syntax error: cannot back up")); \ - YYERROR; \ - } \ -while (YYID (0)) - - -#define YYTERROR 1 -#define YYERRCODE 256 - - -/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. - If N is 0, then set CURRENT to the empty location which ends - the previous symbol: RHS[0] (always defined). */ - -#define YYRHSLOC(Rhs, K) ((Rhs)[K]) -#ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - do \ - if (YYID (N)) \ - { \ - (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ - (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ - (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ - (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ - } \ - else \ - { \ - (Current).first_line = (Current).last_line = \ - YYRHSLOC (Rhs, 0).last_line; \ - (Current).first_column = (Current).last_column = \ - YYRHSLOC (Rhs, 0).last_column; \ - } \ - while (YYID (0)) -#endif - - -/* YY_LOCATION_PRINT -- Print the location on the stream. - This macro was not mandated originally: define only if we know - we won't break user code: when these are the locations we know. */ - -#ifndef YY_LOCATION_PRINT -# if YYLTYPE_IS_TRIVIAL -# define YY_LOCATION_PRINT(File, Loc) \ - fprintf (File, "%d.%d-%d.%d", \ - (Loc).first_line, (Loc).first_column, \ - (Loc).last_line, (Loc).last_column) -# else -# define YY_LOCATION_PRINT(File, Loc) ((void) 0) -# endif -#endif - - -/* YYLEX -- calling `yylex' with the right arguments. */ - -#ifdef YYLEX_PARAM -# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) -#else -# define YYLEX yylex (&yylval, &yylloc) -#endif - -/* Enable debugging if requested. */ -#if YYDEBUG - -# ifndef YYFPRINTF -# include <stdio.h> /* INFRINGES ON USER NAME SPACE */ -# define YYFPRINTF fprintf -# endif - -# define YYDPRINTF(Args) \ -do { \ - if (yydebug) \ - YYFPRINTF Args; \ -} while (YYID (0)) - -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yy_symbol_print (stderr, \ - Type, Value, Location); \ - YYFPRINTF (stderr, "\n"); \ - } \ -} while (YYID (0)) - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp) -#else -static void -yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; - YYLTYPE const * const yylocationp; -#endif -{ - if (!yyvaluep) - return; - YYUSE (yylocationp); -# ifdef YYPRINT - if (yytype < YYNTOKENS) - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# else - YYUSE (yyoutput); -# endif - switch (yytype) - { - default: - break; - } -} - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp) -#else -static void -yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; - YYLTYPE const * const yylocationp; -#endif -{ - if (yytype < YYNTOKENS) - YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); - else - YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); - - YY_LOCATION_PRINT (yyoutput, *yylocationp); - YYFPRINTF (yyoutput, ": "); - yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp); - YYFPRINTF (yyoutput, ")"); -} - -/*------------------------------------------------------------------. -| yy_stack_print -- Print the state stack from its BOTTOM up to its | -| TOP (included). | -`------------------------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_stack_print (yytype_int16 *bottom, yytype_int16 *top) -#else -static void -yy_stack_print (bottom, top) - yytype_int16 *bottom; - yytype_int16 *top; -#endif -{ - YYFPRINTF (stderr, "Stack now"); - for (; bottom <= top; ++bottom) - YYFPRINTF (stderr, " %d", *bottom); - YYFPRINTF (stderr, "\n"); -} - -# define YY_STACK_PRINT(Bottom, Top) \ -do { \ - if (yydebug) \ - yy_stack_print ((Bottom), (Top)); \ -} while (YYID (0)) - - -/*------------------------------------------------. -| Report that the YYRULE is going to be reduced. | -`------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule) -#else -static void -yy_reduce_print (yyvsp, yylsp, yyrule) - YYSTYPE *yyvsp; - YYLTYPE *yylsp; - int yyrule; -#endif -{ - int yynrhs = yyr2[yyrule]; - int yyi; - unsigned long int yylno = yyrline[yyrule]; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", - yyrule - 1, yylno); - /* The symbols being reduced. */ - for (yyi = 0; yyi < yynrhs; yyi++) - { - fprintf (stderr, " $%d = ", yyi + 1); - yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], - &(yyvsp[(yyi + 1) - (yynrhs)]) - , &(yylsp[(yyi + 1) - (yynrhs)]) ); - fprintf (stderr, "\n"); - } -} - -# define YY_REDUCE_PRINT(Rule) \ -do { \ - if (yydebug) \ - yy_reduce_print (yyvsp, yylsp, Rule); \ -} while (YYID (0)) - -/* Nonzero means print parse trace. It is left uninitialized so that - multiple parsers can coexist. */ -int yydebug; -#else /* !YYDEBUG */ -# define YYDPRINTF(Args) -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) -# define YY_STACK_PRINT(Bottom, Top) -# define YY_REDUCE_PRINT(Rule) -#endif /* !YYDEBUG */ - - -/* YYINITDEPTH -- initial size of the parser's stacks. */ -#ifndef YYINITDEPTH -# define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only - if the built-in stack extension method is used). - - Do not make this value too large; the results are undefined if - YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ - -#ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 -#endif - - - -#if YYERROR_VERBOSE - -# ifndef yystrlen -# if defined __GLIBC__ && defined _STRING_H -# define yystrlen strlen -# else -/* Return the length of YYSTR. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static YYSIZE_T -yystrlen (const char *yystr) -#else -static YYSIZE_T -yystrlen (yystr) - const char *yystr; -#endif -{ - YYSIZE_T yylen; - for (yylen = 0; yystr[yylen]; yylen++) - continue; - return yylen; -} -# endif -# endif - -# ifndef yystpcpy -# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE -# define yystpcpy stpcpy -# else -/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in - YYDEST. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static char * -yystpcpy (char *yydest, const char *yysrc) -#else -static char * -yystpcpy (yydest, yysrc) - char *yydest; - const char *yysrc; -#endif -{ - char *yyd = yydest; - const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; -} -# endif -# endif - -# ifndef yytnamerr -/* Copy to YYRES the contents of YYSTR after stripping away unnecessary - quotes and backslashes, so that it's suitable for yyerror. The - heuristic is that double-quoting is unnecessary unless the string - contains an apostrophe, a comma, or backslash (other than - backslash-backslash). YYSTR is taken from yytname. If YYRES is - null, do not copy; instead, return the length of what the result - would have been. */ -static YYSIZE_T -yytnamerr (char *yyres, const char *yystr) -{ - if (*yystr == '"') - { - YYSIZE_T yyn = 0; - char const *yyp = yystr; - - for (;;) - switch (*++yyp) - { - case '\'': - case ',': - goto do_not_strip_quotes; - - case '\\': - if (*++yyp != '\\') - goto do_not_strip_quotes; - /* Fall through. */ - default: - if (yyres) - yyres[yyn] = *yyp; - yyn++; - break; - - case '"': - if (yyres) - yyres[yyn] = '\0'; - return yyn; - } - do_not_strip_quotes: ; - } - - if (! yyres) - return yystrlen (yystr); - - return yystpcpy (yyres, yystr) - yyres; -} -# endif - -/* Copy into YYRESULT an error message about the unexpected token - YYCHAR while in state YYSTATE. Return the number of bytes copied, - including the terminating null byte. If YYRESULT is null, do not - copy anything; just return the number of bytes that would be - copied. As a special case, return 0 if an ordinary "syntax error" - message will do. Return YYSIZE_MAXIMUM if overflow occurs during - size calculation. */ -static YYSIZE_T -yysyntax_error (char *yyresult, int yystate, int yychar) -{ - int yyn = yypact[yystate]; - - if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) - return 0; - else - { - int yytype = YYTRANSLATE (yychar); - YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); - YYSIZE_T yysize = yysize0; - YYSIZE_T yysize1; - int yysize_overflow = 0; - enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; - char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; - int yyx; - -# if 0 - /* This is so xgettext sees the translatable formats that are - constructed on the fly. */ - YY_("syntax error, unexpected %s"); - YY_("syntax error, unexpected %s, expecting %s"); - YY_("syntax error, unexpected %s, expecting %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); -# endif - char *yyfmt; - char const *yyf; - static char const yyunexpected[] = "syntax error, unexpected %s"; - static char const yyexpecting[] = ", expecting %s"; - static char const yyor[] = " or %s"; - char yyformat[sizeof yyunexpected - + sizeof yyexpecting - 1 - + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) - * (sizeof yyor - 1))]; - char const *yyprefix = yyexpecting; - - /* Start YYX at -YYN if negative to avoid negative indexes in - YYCHECK. */ - int yyxbegin = yyn < 0 ? -yyn : 0; - - /* Stay within bounds of both yycheck and yytname. */ - int yychecklim = YYLAST - yyn + 1; - int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; - int yycount = 1; - - yyarg[0] = yytname[yytype]; - yyfmt = yystpcpy (yyformat, yyunexpected); - - for (yyx = yyxbegin; yyx < yyxend; ++yyx) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - { - if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) - { - yycount = 1; - yysize = yysize0; - yyformat[sizeof yyunexpected - 1] = '\0'; - break; - } - yyarg[yycount++] = yytname[yyx]; - yysize1 = yysize + yytnamerr (0, yytname[yyx]); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - yyfmt = yystpcpy (yyfmt, yyprefix); - yyprefix = yyor; - } - - yyf = YY_(yyformat); - yysize1 = yysize + yystrlen (yyf); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - - if (yysize_overflow) - return YYSIZE_MAXIMUM; - - if (yyresult) - { - /* Avoid sprintf, as that infringes on the user's name space. - Don't have undefined behavior even if the translation - produced a string with the wrong number of "%s"s. */ - char *yyp = yyresult; - int yyi = 0; - while ((*yyp = *yyf) != '\0') - { - if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) - { - yyp += yytnamerr (yyp, yyarg[yyi++]); - yyf += 2; - } - else - { - yyp++; - yyf++; - } - } - } - return yysize; - } -} -#endif /* YYERROR_VERBOSE */ - - -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp) -#else -static void -yydestruct (yymsg, yytype, yyvaluep, yylocationp) - const char *yymsg; - int yytype; - YYSTYPE *yyvaluep; - YYLTYPE *yylocationp; -#endif -{ - YYUSE (yyvaluep); - YYUSE (yylocationp); - - if (!yymsg) - yymsg = "Deleting"; - YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); - - switch (yytype) - { - case 3: /* "TOK_COLONCOLON" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1268 "ast_expr2.c" - break; - case 4: /* "TOK_COND" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1273 "ast_expr2.c" - break; - case 5: /* "TOK_OR" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1278 "ast_expr2.c" - break; - case 6: /* "TOK_AND" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1283 "ast_expr2.c" - break; - case 7: /* "TOK_NE" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1288 "ast_expr2.c" - break; - case 8: /* "TOK_LE" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1293 "ast_expr2.c" - break; - case 9: /* "TOK_GE" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1298 "ast_expr2.c" - break; - case 10: /* "TOK_LT" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1303 "ast_expr2.c" - break; - case 11: /* "TOK_GT" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1308 "ast_expr2.c" - break; - case 12: /* "TOK_EQ" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1313 "ast_expr2.c" - break; - case 13: /* "TOK_MINUS" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1318 "ast_expr2.c" - break; - case 14: /* "TOK_PLUS" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1323 "ast_expr2.c" - break; - case 15: /* "TOK_MOD" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1328 "ast_expr2.c" - break; - case 16: /* "TOK_DIV" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1333 "ast_expr2.c" - break; - case 17: /* "TOK_MULT" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1338 "ast_expr2.c" - break; - case 18: /* "TOK_COMPL" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1343 "ast_expr2.c" - break; - case 19: /* "TOK_EQTILDE" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1348 "ast_expr2.c" - break; - case 20: /* "TOK_COLON" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1353 "ast_expr2.c" - break; - case 21: /* "TOK_LP" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1358 "ast_expr2.c" - break; - case 22: /* "TOK_RP" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1363 "ast_expr2.c" - break; - case 23: /* "TOKEN" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1368 "ast_expr2.c" - break; - case 26: /* "expr" */ -#line 169 "ast_expr2.y" - { free_value((yyvaluep->val)); }; -#line 1373 "ast_expr2.c" - break; - - default: - break; - } -} - - -/* Prevent warnings from -Wmissing-prototypes. */ - -#ifdef YYPARSE_PARAM -#if defined __STDC__ || defined __cplusplus -int yyparse (void *YYPARSE_PARAM); -#else -int yyparse (); -#endif -#else /* ! YYPARSE_PARAM */ -#if defined __STDC__ || defined __cplusplus -int yyparse (void); -#else -int yyparse (); -#endif -#endif /* ! YYPARSE_PARAM */ - - - - - - -/*----------. -| yyparse. | -`----------*/ - -#ifdef YYPARSE_PARAM -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void *YYPARSE_PARAM) -#else -int -yyparse (YYPARSE_PARAM) - void *YYPARSE_PARAM; -#endif -#else /* ! YYPARSE_PARAM */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void) -#else -int -yyparse () - -#endif -#endif -{ - /* The look-ahead symbol. */ -int yychar; - -/* The semantic value of the look-ahead symbol. */ -YYSTYPE yylval; - -/* Number of syntax errors so far. */ -int yynerrs; -/* Location data for the look-ahead symbol. */ -YYLTYPE yylloc; - - int yystate; - int yyn; - int yyresult; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - /* Look-ahead token as an internal (translated) token number. */ - int yytoken = 0; -#if YYERROR_VERBOSE - /* Buffer for error messages, and its allocated size. */ - char yymsgbuf[128]; - char *yymsg = yymsgbuf; - YYSIZE_T yymsg_alloc = sizeof yymsgbuf; -#endif - - /* Three stacks and their tools: - `yyss': related to states, - `yyvs': related to semantic values, - `yyls': related to locations. - - Refer to the stacks thru separate pointers, to allow yyoverflow - to reallocate them elsewhere. */ - - /* The state stack. */ - yytype_int16 yyssa[YYINITDEPTH]; - yytype_int16 *yyss = yyssa; - yytype_int16 *yyssp; - - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs = yyvsa; - YYSTYPE *yyvsp; - - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - /* The locations where the error started and ended. */ - YYLTYPE yyerror_range[2]; - -#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N)) - - YYSIZE_T yystacksize = YYINITDEPTH; - - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; - YYLTYPE yyloc; - - /* The number of symbols on the RHS of the reduced rule. - Keep to zero when no symbol should be popped. */ - int yylen = 0; - - YYDPRINTF ((stderr, "Starting parse\n")); - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - - /* Initialize stack pointers. - Waste one element of value and location stack - so that they stay on the same level as the state stack. - The wasted elements are never initialized. */ - - yyssp = yyss; - yyvsp = yyvs; - yylsp = yyls; -#if YYLTYPE_IS_TRIVIAL - /* Initialize the default location before parsing starts. */ - yylloc.first_line = yylloc.last_line = 1; - yylloc.first_column = yylloc.last_column = 0; -#endif - - goto yysetstate; - -/*------------------------------------------------------------. -| yynewstate -- Push a new state, which is found in yystate. | -`------------------------------------------------------------*/ - yynewstate: - /* In all cases, when you get here, the value and location stacks - have just been pushed. So pushing a state here evens the stacks. */ - yyssp++; - - yysetstate: - *yyssp = yystate; - - if (yyss + yystacksize - 1 <= yyssp) - { - /* Get the current used size of the three stacks, in elements. */ - YYSIZE_T yysize = yyssp - yyss + 1; - -#ifdef yyoverflow - { - /* Give user a chance to reallocate the stack. Use copies of - these so that the &'s don't force the real ones into - memory. */ - YYSTYPE *yyvs1 = yyvs; - yytype_int16 *yyss1 = yyss; - YYLTYPE *yyls1 = yyls; - - /* Each stack pointer address is followed by the size of the - data in use in that stack, in bytes. This used to be a - conditional around just the two extra args, but that might - be undefined if yyoverflow is a macro. */ - yyoverflow (YY_("memory exhausted"), - &yyss1, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - &yyls1, yysize * sizeof (*yylsp), - &yystacksize); - yyls = yyls1; - yyss = yyss1; - yyvs = yyvs1; - } -#else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyexhaustedlab; -# else - /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyexhaustedlab; - yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) - yystacksize = YYMAXDEPTH; - - { - yytype_int16 *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyexhaustedlab; - YYSTACK_RELOCATE (yyss); - YYSTACK_RELOCATE (yyvs); - YYSTACK_RELOCATE (yyls); -# undef YYSTACK_RELOCATE - if (yyss1 != yyssa) - YYSTACK_FREE (yyss1); - } -# endif -#endif /* no yyoverflow */ - - yyssp = yyss + yysize - 1; - yyvsp = yyvs + yysize - 1; - yylsp = yyls + yysize - 1; - - YYDPRINTF ((stderr, "Stack size increased to %lu\n", - (unsigned long int) yystacksize)); - - if (yyss + yystacksize - 1 <= yyssp) - YYABORT; - } - - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); - - goto yybackup; - -/*-----------. -| yybackup. | -`-----------*/ -yybackup: - - /* Do appropriate processing given the current state. Read a - look-ahead token if we need one and don't already have one. */ - - /* First try to decide what to do without reference to look-ahead token. */ - yyn = yypact[yystate]; - if (yyn == YYPACT_NINF) - goto yydefault; - - /* Not known => get a look-ahead token if don't already have one. */ - - /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ - if (yychar == YYEMPTY) - { - YYDPRINTF ((stderr, "Reading a token: ")); - yychar = YYLEX; - } - - if (yychar <= YYEOF) - { - yychar = yytoken = YYEOF; - YYDPRINTF ((stderr, "Now at end of input.\n")); - } - else - { - yytoken = YYTRANSLATE (yychar); - YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); - } - - /* If the proper action on seeing token YYTOKEN is to reduce or to - detect an error, take that action. */ - yyn += yytoken; - if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) - goto yydefault; - yyn = yytable[yyn]; - if (yyn <= 0) - { - if (yyn == 0 || yyn == YYTABLE_NINF) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - - if (yyn == YYFINAL) - YYACCEPT; - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; - - /* Shift the look-ahead token. */ - YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); - - /* Discard the shifted token unless it is eof. */ - if (yychar != YYEOF) - yychar = YYEMPTY; - - yystate = yyn; - *++yyvsp = yylval; - *++yylsp = yylloc; - goto yynewstate; - - -/*-----------------------------------------------------------. -| yydefault -- do the default action for the current state. | -`-----------------------------------------------------------*/ -yydefault: - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - goto yyreduce; - - -/*-----------------------------. -| yyreduce -- Do a reduction. | -`-----------------------------*/ -yyreduce: - /* yyn is the number of a rule to reduce with. */ - yylen = yyr2[yyn]; - - /* If YYLEN is nonzero, implement the default value of the action: - `$$ = $1'. - - Otherwise, the following line sets YYVAL to garbage. - This behavior is undocumented and Bison - users should not rely upon it. Assigning to YYVAL - unconditionally makes the parser a bit smaller, and it avoids a - GCC warning that YYVAL may be used uninitialized. */ - yyval = yyvsp[1-yylen]; - - /* Default location. */ - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - YY_REDUCE_PRINT (yyn); - switch (yyn) - { - case 2: -#line 175 "ast_expr2.y" - { ((struct parse_io *)parseio)->val = (struct val *)calloc(sizeof(struct val),1); - ((struct parse_io *)parseio)->val->type = (yyvsp[(1) - (1)].val)->type; - if( (yyvsp[(1) - (1)].val)->type == AST_EXPR_integer ) - ((struct parse_io *)parseio)->val->u.i = (yyvsp[(1) - (1)].val)->u.i; - else - ((struct parse_io *)parseio)->val->u.s = (yyvsp[(1) - (1)].val)->u.s; - free((yyvsp[(1) - (1)].val)); - ;} - break; - - case 3: -#line 183 "ast_expr2.y" - {/* nothing */ ((struct parse_io *)parseio)->val = (struct val *)calloc(sizeof(struct val),1); - ((struct parse_io *)parseio)->val->type = AST_EXPR_string; - ((struct parse_io *)parseio)->val->u.s = strdup(""); - ;} - break; - - case 4: -#line 190 "ast_expr2.y" - { (yyval.val)= (yyvsp[(1) - (1)].val);;} - break; - - case 5: -#line 191 "ast_expr2.y" - { (yyval.val) = (yyvsp[(2) - (3)].val); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0; - DESTROY((yyvsp[(1) - (3)].val)); DESTROY((yyvsp[(3) - (3)].val)); ;} - break; - - case 6: -#line 195 "ast_expr2.y" - { (yyval.val) = op_or ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 7: -#line 199 "ast_expr2.y" - { (yyval.val) = op_and ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 8: -#line 203 "ast_expr2.y" - { (yyval.val) = op_eq ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 9: -#line 207 "ast_expr2.y" - { (yyval.val) = op_gt ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 10: -#line 211 "ast_expr2.y" - { (yyval.val) = op_lt ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 11: -#line 215 "ast_expr2.y" - { (yyval.val) = op_ge ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 12: -#line 219 "ast_expr2.y" - { (yyval.val) = op_le ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 13: -#line 223 "ast_expr2.y" - { (yyval.val) = op_ne ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 14: -#line 227 "ast_expr2.y" - { (yyval.val) = op_plus ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 15: -#line 231 "ast_expr2.y" - { (yyval.val) = op_minus ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 16: -#line 235 "ast_expr2.y" - { (yyval.val) = op_negate ((yyvsp[(2) - (2)].val)); - DESTROY((yyvsp[(1) - (2)].val)); - (yyloc).first_column = (yylsp[(1) - (2)]).first_column; (yyloc).last_column = (yylsp[(2) - (2)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 17: -#line 239 "ast_expr2.y" - { (yyval.val) = op_compl ((yyvsp[(2) - (2)].val)); - DESTROY((yyvsp[(1) - (2)].val)); - (yyloc).first_column = (yylsp[(1) - (2)]).first_column; (yyloc).last_column = (yylsp[(2) - (2)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 18: -#line 243 "ast_expr2.y" - { (yyval.val) = op_times ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 19: -#line 247 "ast_expr2.y" - { (yyval.val) = op_div ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 20: -#line 251 "ast_expr2.y" - { (yyval.val) = op_rem ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 21: -#line 255 "ast_expr2.y" - { (yyval.val) = op_colon ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 22: -#line 259 "ast_expr2.y" - { (yyval.val) = op_eqtilde ((yyvsp[(1) - (3)].val), (yyvsp[(3) - (3)].val)); - DESTROY((yyvsp[(2) - (3)].val)); - (yyloc).first_column = (yylsp[(1) - (3)]).first_column; (yyloc).last_column = (yylsp[(3) - (3)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - case 23: -#line 263 "ast_expr2.y" - { (yyval.val) = op_cond ((yyvsp[(1) - (5)].val), (yyvsp[(3) - (5)].val), (yyvsp[(5) - (5)].val)); - DESTROY((yyvsp[(2) - (5)].val)); - DESTROY((yyvsp[(4) - (5)].val)); - (yyloc).first_column = (yylsp[(1) - (5)]).first_column; (yyloc).last_column = (yylsp[(3) - (5)]).last_column; - (yyloc).first_line=0; (yyloc).last_line=0;;} - break; - - -/* Line 1267 of yacc.c. */ -#line 1875 "ast_expr2.c" - default: break; - } - YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); - - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - - *++yyvsp = yyval; - *++yylsp = yyloc; - - /* Now `shift' the result of the reduction. Determine what state - that goes to, based on the state we popped back to and the rule - number reduced by. */ - - yyn = yyr1[yyn]; - - yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; - if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTOKENS]; - - goto yynewstate; - - -/*------------------------------------. -| yyerrlab -- here on detecting error | -`------------------------------------*/ -yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) - { - ++yynerrs; -#if ! YYERROR_VERBOSE - yyerror (YY_("syntax error")); -#else - { - YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); - if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) - { - YYSIZE_T yyalloc = 2 * yysize; - if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) - yyalloc = YYSTACK_ALLOC_MAXIMUM; - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); - yymsg = (char *) YYSTACK_ALLOC (yyalloc); - if (yymsg) - yymsg_alloc = yyalloc; - else - { - yymsg = yymsgbuf; - yymsg_alloc = sizeof yymsgbuf; - } - } - - if (0 < yysize && yysize <= yymsg_alloc) - { - (void) yysyntax_error (yymsg, yystate, yychar); - yyerror (yymsg); - } - else - { - yyerror (YY_("syntax error")); - if (yysize != 0) - goto yyexhaustedlab; - } - } -#endif - } - - yyerror_range[0] = yylloc; - - if (yyerrstatus == 3) - { - /* If just tried and failed to reuse look-ahead token after an - error, discard it. */ - - if (yychar <= YYEOF) - { - /* Return failure if at end of input. */ - if (yychar == YYEOF) - YYABORT; - } - else - { - yydestruct ("Error: discarding", - yytoken, &yylval, &yylloc); - yychar = YYEMPTY; - } - } - - /* Else will try to reuse look-ahead token after shifting the error - token. */ - goto yyerrlab1; - - -/*---------------------------------------------------. -| yyerrorlab -- error raised explicitly by YYERROR. | -`---------------------------------------------------*/ -yyerrorlab: - - /* Pacify compilers like GCC when the user code never invokes - YYERROR and the label yyerrorlab therefore never appears in user - code. */ - if (/*CONSTCOND*/ 0) - goto yyerrorlab; - - yyerror_range[0] = yylsp[1-yylen]; - /* Do not reclaim the symbols of the rule which action triggered - this YYERROR. */ - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - yystate = *yyssp; - goto yyerrlab1; - - -/*-------------------------------------------------------------. -| yyerrlab1 -- common code for both syntax error and YYERROR. | -`-------------------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ - - for (;;) - { - yyn = yypact[yystate]; - if (yyn != YYPACT_NINF) - { - yyn += YYTERROR; - if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) - { - yyn = yytable[yyn]; - if (0 < yyn) - break; - } - } - - /* Pop the current state because it cannot handle the error token. */ - if (yyssp == yyss) - YYABORT; - - yyerror_range[0] = *yylsp; - yydestruct ("Error: popping", - yystos[yystate], yyvsp, yylsp); - YYPOPSTACK (1); - yystate = *yyssp; - YY_STACK_PRINT (yyss, yyssp); - } - - if (yyn == YYFINAL) - YYACCEPT; - - *++yyvsp = yylval; - - yyerror_range[1] = yylloc; - /* Using YYLLOC is tempting, but would change the location of - the look-ahead. YYLOC is available though. */ - YYLLOC_DEFAULT (yyloc, (yyerror_range - 1), 2); - *++yylsp = yyloc; - - /* Shift the error token. */ - YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); - - yystate = yyn; - goto yynewstate; - - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#ifndef yyoverflow -/*-------------------------------------------------. -| yyexhaustedlab -- memory exhaustion comes here. | -`-------------------------------------------------*/ -yyexhaustedlab: - yyerror (YY_("memory exhausted")); - yyresult = 2; - /* Fall through. */ -#endif - -yyreturn: - if (yychar != YYEOF && yychar != YYEMPTY) - yydestruct ("Cleanup: discarding lookahead", - yytoken, &yylval, &yylloc); - /* Do not reclaim the symbols of the rule which action triggered - this YYABORT or YYACCEPT. */ - YYPOPSTACK (yylen); - YY_STACK_PRINT (yyss, yyssp); - while (yyssp != yyss) - { - yydestruct ("Cleanup: popping", - yystos[*yyssp], yyvsp, yylsp); - YYPOPSTACK (1); - } -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); -#endif -#if YYERROR_VERBOSE - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); -#endif - /* Make sure YYID is used. */ - return YYID (yyresult); -} - - -#line 270 "ast_expr2.y" - - -static struct val * -make_integer (quad_t i) -{ - struct val *vp; - - vp = (struct val *) malloc (sizeof (*vp)); - if (vp == NULL) { - ast_log(LOG_WARNING, "malloc() failed\n"); - return(NULL); - } - - vp->type = AST_EXPR_integer; - vp->u.i = i; - return vp; -} - -static struct val * -make_str (const char *s) -{ - struct val *vp; - size_t i; - int isint; - - vp = (struct val *) malloc (sizeof (*vp)); - if (vp == NULL || ((vp->u.s = strdup (s)) == NULL)) { - ast_log(LOG_WARNING,"malloc() failed\n"); - return(NULL); - } - - for(i = 1, isint = isdigit(s[0]) || s[0] == '-'; - isint && i < strlen(s); - i++) - { - if(!isdigit(s[i])) - isint = 0; - } - - if (isint) - vp->type = AST_EXPR_numeric_string; - else - vp->type = AST_EXPR_string; - - return vp; -} - - -static void -free_value (struct val *vp) -{ - if (vp==NULL) { - return; - } - if (vp->type == AST_EXPR_string || vp->type == AST_EXPR_numeric_string) - free (vp->u.s); - free(vp); -} - - -static quad_t -to_integer (struct val *vp) -{ - quad_t i; - - if (vp == NULL) { - ast_log(LOG_WARNING,"vp==NULL in to_integer()\n"); - return(0); - } - - if (vp->type == AST_EXPR_integer) - return 1; - - if (vp->type == AST_EXPR_string) - return 0; - - /* vp->type == AST_EXPR_numeric_string, make it numeric */ - errno = 0; - i = strtoll(vp->u.s, (char**)NULL, 10); - if (errno != 0) { - ast_log(LOG_WARNING,"Conversion of %s to integer under/overflowed!\n", vp->u.s); - free(vp->u.s); - vp->u.s = 0; - return(0); - } - free (vp->u.s); - vp->u.i = i; - vp->type = AST_EXPR_integer; - return 1; -} - -static void -strip_quotes(struct val *vp) -{ - if (vp->type != AST_EXPR_string && vp->type != AST_EXPR_numeric_string) - return; - - if( vp->u.s[0] == '"' && vp->u.s[strlen(vp->u.s)-1] == '"' ) - { - char *f, *t; - f = vp->u.s; - t = vp->u.s; - - while( *f ) - { - if( *f && *f != '"' ) - *t++ = *f++; - else - f++; - } - *t = *f; - } -} - -static void -to_string (struct val *vp) -{ - char *tmp; - - if (vp->type == AST_EXPR_string || vp->type == AST_EXPR_numeric_string) - return; - - tmp = malloc ((size_t)25); - if (tmp == NULL) { - ast_log(LOG_WARNING,"malloc() failed\n"); - return; - } - - sprintf(tmp, "%ld", (long int) vp->u.i); - vp->type = AST_EXPR_string; - vp->u.s = tmp; -} - - -static int -isstring (struct val *vp) -{ - /* only TRUE if this string is not a valid integer */ - return (vp->type == AST_EXPR_string); -} - - -static int -is_zero_or_null (struct val *vp) -{ - if (vp->type == AST_EXPR_integer) { - return (vp->u.i == 0); - } else { - return (*vp->u.s == 0 || (to_integer (vp) && vp->u.i == 0)); - } - /* NOTREACHED */ -} - -#ifdef STANDALONE - -void ast_log(int level, const char *file, int line, const char *function, const char *fmt, ...) -{ - va_list vars; - va_start(vars,fmt); - - printf("LOG: lev:%d file:%s line:%d func: %s ", - level, file, line, function); - vprintf(fmt, vars); - fflush(stdout); - va_end(vars); -} - - -int main(int argc,char **argv) { - char s[4096]; - char out[4096]; - FILE *infile; - - if( !argv[1] ) - exit(20); - - if( access(argv[1],F_OK)== 0 ) - { - int ret; - - infile = fopen(argv[1],"r"); - if( !infile ) - { - printf("Sorry, couldn't open %s for reading!\n", argv[1]); - exit(10); - } - while( fgets(s,sizeof(s),infile) ) - { - if( s[strlen(s)-1] == '\n' ) - s[strlen(s)-1] = 0; - - ret = ast_expr(s, out, sizeof(out)); - printf("Expression: %s Result: [%d] '%s'\n", - s, ret, out); - } - fclose(infile); - } - else - { - if (ast_expr(argv[1], s, sizeof(s))) - printf("=====%s======\n",s); - else - printf("No result\n"); - } -} - -#endif - -#undef ast_yyerror -#define ast_yyerror(x) ast_yyerror(x, YYLTYPE *yylloc, struct parse_io *parseio) - -/* I put the ast_yyerror func in the flex input file, - because it refers to the buffer state. Best to - let it access the BUFFER stuff there and not trying - define all the structs, macros etc. in this file! */ - - -static struct val * -op_or (struct val *a, struct val *b) -{ - if (is_zero_or_null (a)) { - free_value (a); - return (b); - } else { - free_value (b); - return (a); - } -} - -static struct val * -op_and (struct val *a, struct val *b) -{ - if (is_zero_or_null (a) || is_zero_or_null (b)) { - free_value (a); - free_value (b); - return (make_integer ((quad_t)0)); - } else { - free_value (b); - return (a); - } -} - -static struct val * -op_eq (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) == 0)); - } else { -#ifdef DEBUG_FOR_CONVERSIONS - char buffer[2000]; - sprintf(buffer,"Converting '%s' and '%s' ", a->u.s, b->u.s); -#endif - (void)to_integer(a); - (void)to_integer(b); -#ifdef DEBUG_FOR_CONVERSIONS - ast_log(LOG_WARNING,"%s to '%lld' and '%lld'\n", buffer, a->u.i, b->u.i); -#endif - r = make_integer ((quad_t)(a->u.i == b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_gt (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) > 0)); - } else { - (void)to_integer(a); - (void)to_integer(b); - r = make_integer ((quad_t)(a->u.i > b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_lt (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) < 0)); - } else { - (void)to_integer(a); - (void)to_integer(b); - r = make_integer ((quad_t)(a->u.i < b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_ge (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) >= 0)); - } else { - (void)to_integer(a); - (void)to_integer(b); - r = make_integer ((quad_t)(a->u.i >= b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_le (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) <= 0)); - } else { - (void)to_integer(a); - (void)to_integer(b); - r = make_integer ((quad_t)(a->u.i <= b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_cond (struct val *a, struct val *b, struct val *c) -{ - struct val *r; - - if( isstring(a) ) - { - if( strlen(a->u.s) && strcmp(a->u.s, "\"\"") != 0 && strcmp(a->u.s,"0") != 0 ) - { - free_value(a); - free_value(c); - r = b; - } - else - { - free_value(a); - free_value(b); - r = c; - } - } - else - { - (void)to_integer(a); - if( a->u.i ) - { - free_value(a); - free_value(c); - r = b; - } - else - { - free_value(a); - free_value(b); - r = c; - } - } - return r; -} - -static struct val * -op_ne (struct val *a, struct val *b) -{ - struct val *r; - - if (isstring (a) || isstring (b)) { - to_string (a); - to_string (b); - r = make_integer ((quad_t)(strcoll (a->u.s, b->u.s) != 0)); - } else { - (void)to_integer(a); - (void)to_integer(b); - r = make_integer ((quad_t)(a->u.i != b->u.i)); - } - - free_value (a); - free_value (b); - return r; -} - -static int -chk_plus (quad_t a, quad_t b, quad_t r) -{ - /* sum of two positive numbers must be positive */ - if (a > 0 && b > 0 && r <= 0) - return 1; - /* sum of two negative numbers must be negative */ - if (a < 0 && b < 0 && r >= 0) - return 1; - /* all other cases are OK */ - return 0; -} - -static struct val * -op_plus (struct val *a, struct val *b) -{ - struct val *r; - - if (!to_integer (a)) { - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING,"non-numeric argument\n"); - if (!to_integer (b)) { - free_value(a); - free_value(b); - return make_integer(0); - } else { - free_value(a); - return (b); - } - } else if (!to_integer(b)) { - free_value(b); - return (a); - } - - r = make_integer (/*(quad_t)*/(a->u.i + b->u.i)); - if (chk_plus (a->u.i, b->u.i, r->u.i)) { - ast_log(LOG_WARNING,"overflow\n"); - } - free_value (a); - free_value (b); - return r; -} - -static int -chk_minus (quad_t a, quad_t b, quad_t r) -{ - /* special case subtraction of QUAD_MIN */ - if (b == QUAD_MIN) { - if (a >= 0) - return 1; - else - return 0; - } - /* this is allowed for b != QUAD_MIN */ - return chk_plus (a, -b, r); -} - -static struct val * -op_minus (struct val *a, struct val *b) -{ - struct val *r; - - if (!to_integer (a)) { - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - if (!to_integer (b)) { - free_value(a); - free_value(b); - return make_integer(0); - } else { - r = make_integer(0 - b->u.i); - free_value(a); - free_value(b); - return (r); - } - } else if (!to_integer(b)) { - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - free_value(b); - return (a); - } - - r = make_integer (/*(quad_t)*/(a->u.i - b->u.i)); - if (chk_minus (a->u.i, b->u.i, r->u.i)) { - ast_log(LOG_WARNING, "overflow\n"); - } - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_negate (struct val *a) -{ - struct val *r; - - if (!to_integer (a) ) { - free_value(a); - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - return make_integer(0); - } - - r = make_integer (/*(quad_t)*/(- a->u.i)); - if (chk_minus (0, a->u.i, r->u.i)) { - ast_log(LOG_WARNING, "overflow\n"); - } - free_value (a); - return r; -} - -static struct val * -op_compl (struct val *a) -{ - int v1 = 1; - struct val *r; - - if( !a ) - { - v1 = 0; - } - else - { - switch( a->type ) - { - case AST_EXPR_integer: - if( a->u.i == 0 ) - v1 = 0; - break; - - case AST_EXPR_string: - if( a->u.s == 0 ) - v1 = 0; - else - { - if( a->u.s[0] == 0 ) - v1 = 0; - else if (strlen(a->u.s) == 1 && a->u.s[0] == '0' ) - v1 = 0; - } - break; - - case AST_EXPR_numeric_string: - if( a->u.s == 0 ) - v1 = 0; - else - { - if( a->u.s[0] == 0 ) - v1 = 0; - else if (strlen(a->u.s) == 1 && a->u.s[0] == '0' ) - v1 = 0; - } - break; - } - } - - r = make_integer (!v1); - free_value (a); - return r; -} - -static int -chk_times (quad_t a, quad_t b, quad_t r) -{ - /* special case: first operand is 0, no overflow possible */ - if (a == 0) - return 0; - /* cerify that result of division matches second operand */ - if (r / a != b) - return 1; - return 0; -} - -static struct val * -op_times (struct val *a, struct val *b) -{ - struct val *r; - - if (!to_integer (a) || !to_integer (b)) { - free_value(a); - free_value(b); - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - return(make_integer(0)); - } - - r = make_integer (/*(quad_t)*/(a->u.i * b->u.i)); - if (chk_times (a->u.i, b->u.i, r->u.i)) { - ast_log(LOG_WARNING, "overflow\n"); - } - free_value (a); - free_value (b); - return (r); -} - -static int -chk_div (quad_t a, quad_t b) -{ - /* div by zero has been taken care of before */ - /* only QUAD_MIN / -1 causes overflow */ - if (a == QUAD_MIN && b == -1) - return 1; - /* everything else is OK */ - return 0; -} - -static struct val * -op_div (struct val *a, struct val *b) -{ - struct val *r; - - if (!to_integer (a)) { - free_value(a); - free_value(b); - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - return make_integer(0); - } else if (!to_integer (b)) { - free_value(a); - free_value(b); - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - return make_integer(INT_MAX); - } - - if (b->u.i == 0) { - ast_log(LOG_WARNING, "division by zero\n"); - free_value(a); - free_value(b); - return make_integer(INT_MAX); - } - - r = make_integer (/*(quad_t)*/(a->u.i / b->u.i)); - if (chk_div (a->u.i, b->u.i)) { - ast_log(LOG_WARNING, "overflow\n"); - } - free_value (a); - free_value (b); - return r; -} - -static struct val * -op_rem (struct val *a, struct val *b) -{ - struct val *r; - - if (!to_integer (a) || !to_integer (b)) { - if( !extra_error_message_supplied ) - ast_log(LOG_WARNING, "non-numeric argument\n"); - free_value(a); - free_value(b); - return make_integer(0); - } - - if (b->u.i == 0) { - ast_log(LOG_WARNING, "div by zero\n"); - free_value(a); - return(b); - } - - r = make_integer (/*(quad_t)*/(a->u.i % b->u.i)); - /* chk_rem necessary ??? */ - free_value (a); - free_value (b); - return r; -} - - -static struct val * -op_colon (struct val *a, struct val *b) -{ - regex_t rp; - regmatch_t rm[2]; - char errbuf[256]; - int eval; - struct val *v; - - /* coerce to both arguments to strings */ - to_string(a); - to_string(b); - /* strip double quotes from both -- they'll screw up the pattern, and the search string starting at ^ */ - strip_quotes(a); - strip_quotes(b); - /* compile regular expression */ - if ((eval = regcomp (&rp, b->u.s, REG_EXTENDED)) != 0) { - regerror (eval, &rp, errbuf, sizeof(errbuf)); - ast_log(LOG_WARNING,"regcomp() error : %s",errbuf); - free_value(a); - free_value(b); - return make_str(""); - } - - /* compare string against pattern */ - /* remember that patterns are anchored to the beginning of the line */ - if (regexec(&rp, a->u.s, (size_t)2, rm, 0) == 0 && rm[0].rm_so == 0) { - if (rm[1].rm_so >= 0) { - *(a->u.s + rm[1].rm_eo) = '\0'; - v = make_str (a->u.s + rm[1].rm_so); - - } else { - v = make_integer ((quad_t)(rm[0].rm_eo - rm[0].rm_so)); - } - } else { - if (rp.re_nsub == 0) { - v = make_integer ((quad_t)0); - } else { - v = make_str (""); - } - } - - /* free arguments and pattern buffer */ - free_value (a); - free_value (b); - regfree (&rp); - - return v; -} - - -static struct val * -op_eqtilde (struct val *a, struct val *b) -{ - regex_t rp; - regmatch_t rm[2]; - char errbuf[256]; - int eval; - struct val *v; - - /* coerce to both arguments to strings */ - to_string(a); - to_string(b); - /* strip double quotes from both -- they'll screw up the pattern, and the search string starting at ^ */ - strip_quotes(a); - strip_quotes(b); - /* compile regular expression */ - if ((eval = regcomp (&rp, b->u.s, REG_EXTENDED)) != 0) { - regerror (eval, &rp, errbuf, sizeof(errbuf)); - ast_log(LOG_WARNING,"regcomp() error : %s",errbuf); - free_value(a); - free_value(b); - return make_str(""); - } - - /* compare string against pattern */ - /* remember that patterns are anchored to the beginning of the line */ - if (regexec(&rp, a->u.s, (size_t)2, rm, 0) == 0 ) { - if (rm[1].rm_so >= 0) { - *(a->u.s + rm[1].rm_eo) = '\0'; - v = make_str (a->u.s + rm[1].rm_so); - - } else { - v = make_integer ((quad_t)(rm[0].rm_eo - rm[0].rm_so)); - } - } else { - if (rp.re_nsub == 0) { - v = make_integer ((quad_t)0); - } else { - v = make_str (""); - } - } - - /* free arguments and pattern buffer */ - free_value (a); - free_value (b); - regfree (&rp); - - return v; -} - |