2005-08-29 20:43:16 +00:00
|
|
|
|
/* A Bison parser, made by GNU Bison 1.875d. */
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
/* Skeleton parser for Yacc-like parsing with Bison,
|
2005-08-29 20:43:16 +00:00
|
|
|
|
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
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. */
|
|
|
|
|
|
|
|
|
|
/* As a special exception, when this file is copied by Bison into a
|
|
|
|
|
Bison output file, you may use that output file without restriction.
|
|
|
|
|
This special exception was added by the Free Software Foundation
|
|
|
|
|
in version 1.24 of Bison. */
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
|
#define YYPURE 1
|
|
|
|
|
|
|
|
|
|
/* Using locations. */
|
|
|
|
|
#define YYLSP_NEEDED 1
|
|
|
|
|
|
|
|
|
|
/* If NAME_PREFIX is specified substitute the variables and functions
|
|
|
|
|
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
|
|
|
|
|
#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 <sys/types.h>
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <locale.h>
|
|
|
|
|
#include <ctype.h>
|
|
|
|
|
#ifndef SOLARIS
|
|
|
|
|
#include <err.h>
|
|
|
|
|
#else
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#define quad_t int64_t
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#endif
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
#include <regex.h>
|
|
|
|
|
#include <limits.h>
|
|
|
|
|
#include <asterisk/ast_expr.h>
|
|
|
|
|
#include <asterisk/logger.h>
|
|
|
|
|
|
|
|
|
|
#ifdef LONG_LONG_MIN
|
|
|
|
|
#define QUAD_MIN LONG_LONG_MIN
|
|
|
|
|
#endif
|
|
|
|
|
#ifdef LONG_LONG_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
|
|
|
|
|
|
|
|
|
|
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)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
|
|
|
|
#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
|
|
|
|
|
#line 137 "ast_expr2.y"
|
|
|
|
|
typedef union YYSTYPE {
|
|
|
|
|
struct val *val;
|
|
|
|
|
} YYSTYPE;
|
|
|
|
|
/* Line 191 of yacc.c. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#line 264 "ast_expr2.c"
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# 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 141 "ast_expr2.y"
|
|
|
|
|
|
|
|
|
|
extern int ast_yylex __P((YYSTYPE *, YYLTYPE *, yyscan_t));
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Line 214 of yacc.c. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#line 291 "ast_expr2.c"
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# ifndef YYFREE
|
|
|
|
|
# define YYFREE free
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YYMALLOC
|
|
|
|
|
# define YYMALLOC malloc
|
|
|
|
|
# endif
|
|
|
|
|
|
2005-08-26 19:21:57 +00:00
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# ifdef YYSTACK_USE_ALLOCA
|
|
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# endif
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# else
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# if defined (alloca) || defined (_ALLOCA_H)
|
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# else
|
|
|
|
|
# ifdef __GNUC__
|
|
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
|
|
/* Pacify GCC's `empty if-body' warning. */
|
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
|
|
|
|
# else
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# endif
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# define YYSTACK_ALLOC YYMALLOC
|
|
|
|
|
# define YYSTACK_FREE YYFREE
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# endif
|
|
|
|
|
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if (! defined (yyoverflow) \
|
|
|
|
|
&& (! defined (__cplusplus) \
|
2005-08-29 20:43:16 +00:00
|
|
|
|
|| (defined (YYLTYPE_IS_TRIVIAL) && YYLTYPE_IS_TRIVIAL \
|
|
|
|
|
&& defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
|
union yyalloc
|
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
short int yyss;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
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) \
|
2005-08-29 20:43:16 +00:00
|
|
|
|
((N) * (sizeof (short int) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
|
2005-08-26 19:21:57 +00:00
|
|
|
|
+ 2 * YYSTACK_GAP_MAXIMUM)
|
|
|
|
|
|
|
|
|
|
/* Copy COUNT objects from FROM to TO. The source and destination do
|
|
|
|
|
not overlap. */
|
|
|
|
|
# ifndef YYCOPY
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# if defined (__GNUC__) && 1 < __GNUC__
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
|
|
|
|
# else
|
|
|
|
|
# define YYCOPY(To, From, Count) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
register YYSIZE_T yyi; \
|
|
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
|
(To)[yyi] = (From)[yyi]; \
|
|
|
|
|
} \
|
|
|
|
|
while (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 (0)
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
typedef signed char yysigned_char;
|
|
|
|
|
#else
|
2005-08-29 20:43:16 +00:00
|
|
|
|
typedef short int yysigned_char;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#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 22
|
|
|
|
|
/* 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 unsigned char 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 unsigned char yyprhs[] =
|
|
|
|
|
{
|
|
|
|
|
0, 0, 3, 5, 7, 11, 15, 19, 23, 27,
|
|
|
|
|
31, 35, 39, 43, 47, 51, 54, 57, 61, 65,
|
|
|
|
|
69, 73, 77
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
|
|
|
|
static const yysigned_char yyrhs[] =
|
|
|
|
|
{
|
|
|
|
|
25, 0, -1, 26, -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 unsigned char yyrline[] =
|
|
|
|
|
{
|
|
|
|
|
0, 160, 160, 165, 166, 169, 172, 175, 178, 181,
|
|
|
|
|
184, 187, 190, 193, 196, 199, 202, 205, 208, 211,
|
|
|
|
|
214, 217, 220
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG || YYERROR_VERBOSE
|
|
|
|
|
/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
|
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
|
|
|
|
static const char *const yytname[] =
|
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
"$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",
|
2005-08-26 19:21:57 +00:00
|
|
|
|
"start", "expr", 0
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
|
|
|
|
token YYLEX-NUM. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
static const unsigned short int yytoknum[] =
|
2005-08-26 19:21:57 +00:00
|
|
|
|
{
|
|
|
|
|
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 unsigned char yyr1[] =
|
|
|
|
|
{
|
|
|
|
|
0, 24, 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 unsigned char yyr2[] =
|
|
|
|
|
{
|
|
|
|
|
0, 2, 1, 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 unsigned char yydefact[] =
|
|
|
|
|
{
|
|
|
|
|
0, 0, 0, 0, 3, 0, 2, 15, 16, 0,
|
|
|
|
|
1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 4, 0, 5,
|
|
|
|
|
6, 12, 11, 10, 9, 8, 7, 14, 13, 19,
|
|
|
|
|
18, 17, 21, 20, 0, 22
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yysigned_char yydefgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-1, 5, 6
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
|
STATE-NUM. */
|
|
|
|
|
#define YYPACT_NINF -13
|
|
|
|
|
static const yysigned_char 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 yysigned_char 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 unsigned char 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 yysigned_char 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 unsigned char 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
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
|
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T) && defined (size_t)
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
|
|
# define YYSIZE_T unsigned int
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
|
#define YYEMPTY (-2)
|
|
|
|
|
#define YYEOF 0
|
|
|
|
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
|
#define YYABORT goto yyabortlab
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#define YYERROR goto yyerrorlab
|
|
|
|
|
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
/* 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; \
|
|
|
|
|
goto yybackup; \
|
|
|
|
|
} \
|
|
|
|
|
else \
|
|
|
|
|
{ \
|
|
|
|
|
yyerror ("syntax error: cannot back up");\
|
|
|
|
|
YYERROR; \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
|
|
#define YYTERROR 1
|
|
|
|
|
#define YYERRCODE 256
|
|
|
|
|
|
|
|
|
|
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
|
|
|
|
|
are run). */
|
|
|
|
|
|
|
|
|
|
#ifndef YYLLOC_DEFAULT
|
2005-08-29 20:43:16 +00:00
|
|
|
|
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
|
|
|
|
((Current).first_line = (Rhs)[1].first_line, \
|
|
|
|
|
(Current).first_column = (Rhs)[1].first_column, \
|
|
|
|
|
(Current).last_line = (Rhs)[N].last_line, \
|
|
|
|
|
(Current).last_column = (Rhs)[N].last_column)
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#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 (0)
|
|
|
|
|
|
|
|
|
|
# define YYDSYMPRINT(Args) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yysymprint Args; \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
# define YYDSYMPRINTF(Title, Token, Value, Location) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
{ \
|
|
|
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
|
|
|
yysymprint (stderr, \
|
|
|
|
|
Token, Value, Location); \
|
|
|
|
|
YYFPRINTF (stderr, "\n"); \
|
|
|
|
|
} \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
2005-08-29 20:43:16 +00:00
|
|
|
|
| TOP (included). |
|
2005-08-26 19:21:57 +00:00
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
static void
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yy_stack_print (short int *bottom, short int *top)
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_stack_print (bottom, top)
|
2005-08-29 20:43:16 +00:00
|
|
|
|
short int *bottom;
|
|
|
|
|
short int *top;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
|
|
for (/* Nothing. */; 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 (0)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
static void
|
|
|
|
|
yy_reduce_print (int yyrule)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yy_reduce_print (yyrule)
|
|
|
|
|
int yyrule;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
int yyi;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
unsigned int yylno = yyrline[yyrule];
|
2005-08-26 19:21:57 +00:00
|
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yyrule - 1, yylno);
|
2005-08-26 19:21:57 +00:00
|
|
|
|
/* Print the symbols being reduced, and their result. */
|
|
|
|
|
for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
|
|
|
|
|
YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
|
|
|
|
|
YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yy_reduce_print (Rule); \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
|
int yydebug;
|
|
|
|
|
#else /* !YYDEBUG */
|
|
|
|
|
# define YYDPRINTF(Args)
|
|
|
|
|
# define YYDSYMPRINT(Args)
|
|
|
|
|
# define YYDSYMPRINTF(Title, Token, 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
|
|
|
|
|
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
|
|
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
|
2005-08-26 19:21:57 +00:00
|
|
|
|
# undef YYMAXDEPTH
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#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. */
|
|
|
|
|
static YYSIZE_T
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yystrlen (const char *yystr)
|
|
|
|
|
# else
|
|
|
|
|
yystrlen (yystr)
|
|
|
|
|
const char *yystr;
|
|
|
|
|
# endif
|
|
|
|
|
{
|
|
|
|
|
register const char *yys = yystr;
|
|
|
|
|
|
|
|
|
|
while (*yys++ != '\0')
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
return yys - yystr - 1;
|
|
|
|
|
}
|
|
|
|
|
# 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. */
|
|
|
|
|
static char *
|
|
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
yystpcpy (char *yydest, const char *yysrc)
|
|
|
|
|
# else
|
|
|
|
|
yystpcpy (yydest, yysrc)
|
|
|
|
|
char *yydest;
|
|
|
|
|
const char *yysrc;
|
|
|
|
|
# endif
|
|
|
|
|
{
|
|
|
|
|
register char *yyd = yydest;
|
|
|
|
|
register const char *yys = yysrc;
|
|
|
|
|
|
|
|
|
|
while ((*yyd++ = *yys++) != '\0')
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
return yyd - 1;
|
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
#endif /* !YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/*--------------------------------.
|
|
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
|
|
`--------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
static void
|
|
|
|
|
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yysymprint (yyoutput, yytype, yyvaluep, yylocationp)
|
|
|
|
|
FILE *yyoutput;
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE *yyvaluep;
|
|
|
|
|
YYLTYPE *yylocationp;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
|
|
(void) yyvaluep;
|
|
|
|
|
(void) yylocationp;
|
|
|
|
|
|
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
|
|
|
|
# ifdef YYPRINT
|
|
|
|
|
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
|
|
|
|
# endif
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
|
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
YYFPRINTF (yyoutput, ")");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* ! YYDEBUG */
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
static void
|
|
|
|
|
yydestruct (int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
|
|
|
|
|
#else
|
|
|
|
|
static void
|
|
|
|
|
yydestruct (yytype, yyvaluep, yylocationp)
|
|
|
|
|
int yytype;
|
|
|
|
|
YYSTYPE *yyvaluep;
|
|
|
|
|
YYLTYPE *yylocationp;
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
|
|
(void) yyvaluep;
|
|
|
|
|
(void) yylocationp;
|
|
|
|
|
|
|
|
|
|
switch (yytype)
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
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 (__cplusplus)
|
|
|
|
|
int yyparse (void *YYPARSE_PARAM)
|
|
|
|
|
# else
|
|
|
|
|
int yyparse (YYPARSE_PARAM)
|
|
|
|
|
void *YYPARSE_PARAM;
|
|
|
|
|
# endif
|
|
|
|
|
#else /* ! YYPARSE_PARAM */
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
|
|
int
|
|
|
|
|
yyparse (void)
|
|
|
|
|
#else
|
|
|
|
|
int
|
|
|
|
|
yyparse ()
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
/* The lookahead symbol. */
|
|
|
|
|
int yychar;
|
|
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
|
int yynerrs;
|
|
|
|
|
/* Location data for the lookahead symbol. */
|
|
|
|
|
YYLTYPE yylloc;
|
|
|
|
|
|
|
|
|
|
register int yystate;
|
|
|
|
|
register int yyn;
|
|
|
|
|
int yyresult;
|
|
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
|
|
int yyerrstatus;
|
|
|
|
|
/* Lookahead token as an internal (translated) token number. */
|
|
|
|
|
int yytoken = 0;
|
|
|
|
|
|
|
|
|
|
/* 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. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
short int yyssa[YYINITDEPTH];
|
|
|
|
|
short int *yyss = yyssa;
|
|
|
|
|
register short int *yyssp;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
/* The semantic value stack. */
|
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
|
YYSTYPE *yyvs = yyvsa;
|
|
|
|
|
register YYSTYPE *yyvsp;
|
|
|
|
|
|
|
|
|
|
/* The location stack. */
|
|
|
|
|
YYLTYPE yylsa[YYINITDEPTH];
|
|
|
|
|
YYLTYPE *yyls = yylsa;
|
|
|
|
|
YYLTYPE *yylsp;
|
|
|
|
|
YYLTYPE *yylerrsp;
|
|
|
|
|
|
|
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
|
|
|
|
|
|
|
|
|
|
YYSIZE_T yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
|
action routines. */
|
|
|
|
|
YYSTYPE yyval;
|
|
|
|
|
YYLTYPE yyloc;
|
|
|
|
|
|
|
|
|
|
/* When reducing, the number of symbols on the RHS of the reduced
|
|
|
|
|
rule. */
|
|
|
|
|
int yylen;
|
|
|
|
|
|
|
|
|
|
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;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
|
2005-08-26 19:21:57 +00:00
|
|
|
|
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;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
short int *yyss1 = yyss;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
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 ("parser stack overflow",
|
|
|
|
|
&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 yyoverflowlab;
|
|
|
|
|
# else
|
|
|
|
|
/* Extend the stack our own way. */
|
|
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
|
|
|
|
goto yyoverflowlab;
|
|
|
|
|
yystacksize *= 2;
|
|
|
|
|
if (YYMAXDEPTH < yystacksize)
|
|
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
|
|
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
short int *yyss1 = yyss;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
union yyalloc *yyptr =
|
|
|
|
|
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
|
|
|
|
if (! yyptr)
|
|
|
|
|
goto yyoverflowlab;
|
|
|
|
|
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 lookahead token if we need one and don't already have one. */
|
|
|
|
|
/* yyresume: */
|
|
|
|
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
|
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (yyn == YYPACT_NINF)
|
|
|
|
|
goto yydefault;
|
|
|
|
|
|
|
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
|
|
|
|
|
|
|
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead 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);
|
|
|
|
|
YYDSYMPRINTF ("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;
|
|
|
|
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
|
YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));
|
|
|
|
|
|
|
|
|
|
/* Discard the token being shifted unless it is eof. */
|
|
|
|
|
if (yychar != YYEOF)
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
*++yylsp = yylloc;
|
|
|
|
|
|
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
|
|
status. */
|
|
|
|
|
if (yyerrstatus)
|
|
|
|
|
yyerrstatus--;
|
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
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. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
YYLLOC_DEFAULT (yyloc, yylsp - yylen, yylen);
|
2005-08-26 19:21:57 +00:00
|
|
|
|
YY_REDUCE_PRINT (yyn);
|
|
|
|
|
switch (yyn)
|
|
|
|
|
{
|
|
|
|
|
case 2:
|
|
|
|
|
#line 160 "ast_expr2.y"
|
|
|
|
|
{ ((struct parse_io *)parseio)->val = (struct val *)calloc(sizeof(struct val),1);
|
|
|
|
|
((struct parse_io *)parseio)->val->type = yyval.val->type;
|
|
|
|
|
((struct parse_io *)parseio)->val->u.s = yyval.val->u.s; ;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 3:
|
|
|
|
|
#line 165 "ast_expr2.y"
|
|
|
|
|
{ yyval.val= yyvsp[0].val;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 4:
|
|
|
|
|
#line 166 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = yyvsp[-1].val;
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 5:
|
|
|
|
|
#line 169 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_or (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 6:
|
|
|
|
|
#line 172 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_and (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 7:
|
|
|
|
|
#line 175 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_eq (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 8:
|
|
|
|
|
#line 178 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_gt (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 9:
|
|
|
|
|
#line 181 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_lt (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 10:
|
|
|
|
|
#line 184 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_ge (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 11:
|
|
|
|
|
#line 187 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_le (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 12:
|
|
|
|
|
#line 190 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_ne (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 13:
|
|
|
|
|
#line 193 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_plus (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 14:
|
|
|
|
|
#line 196 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_minus (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 15:
|
|
|
|
|
#line 199 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_negate (yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-1].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 16:
|
|
|
|
|
#line 202 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_compl (yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-1].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 17:
|
|
|
|
|
#line 205 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_times (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 18:
|
|
|
|
|
#line 208 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_div (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 19:
|
|
|
|
|
#line 211 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_rem (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 20:
|
|
|
|
|
#line 214 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_colon (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 21:
|
|
|
|
|
#line 217 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_eqtilde (yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-2].first_column; yyloc.last_column = yylsp[0].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 22:
|
|
|
|
|
#line 220 "ast_expr2.y"
|
|
|
|
|
{ yyval.val = op_cond (yyvsp[-4].val, yyvsp[-2].val, yyvsp[0].val);
|
|
|
|
|
yyloc.first_column = yylsp[-4].first_column; yyloc.last_column = yylsp[-2].last_column;
|
|
|
|
|
yyloc.first_line=0; yyloc.last_line=0;;}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
/* Line 1010 of yacc.c. */
|
|
|
|
|
#line 1381 "ast_expr2.c"
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
yyvsp -= yylen;
|
|
|
|
|
yyssp -= yylen;
|
|
|
|
|
yylsp -= yylen;
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
|
|
|
|
|
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
|
|
|
|
{
|
|
|
|
|
YYSIZE_T yysize = 0;
|
|
|
|
|
int yytype = YYTRANSLATE (yychar);
|
2005-08-29 20:43:16 +00:00
|
|
|
|
const char* yyprefix;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
char *yymsg;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
int yyx;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
/* Start YYX at -YYN if negative to avoid negative indexes in
|
|
|
|
|
YYCHECK. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
int yyxbegin = yyn < 0 ? -yyn : 0;
|
|
|
|
|
|
|
|
|
|
/* Stay within bounds of both yycheck and yytname. */
|
|
|
|
|
int yychecklim = YYLAST - yyn;
|
|
|
|
|
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
|
|
|
|
int yycount = 0;
|
|
|
|
|
|
|
|
|
|
yyprefix = ", expecting ";
|
|
|
|
|
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
2005-08-26 19:21:57 +00:00
|
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
2005-08-29 20:43:16 +00:00
|
|
|
|
{
|
|
|
|
|
yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
|
|
|
|
|
yycount += 1;
|
|
|
|
|
if (yycount == 5)
|
|
|
|
|
{
|
|
|
|
|
yysize = 0;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
yysize += (sizeof ("syntax error, unexpected ")
|
|
|
|
|
+ yystrlen (yytname[yytype]));
|
2005-08-26 19:21:57 +00:00
|
|
|
|
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
|
|
|
|
if (yymsg != 0)
|
|
|
|
|
{
|
|
|
|
|
char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
|
|
|
|
|
yyp = yystpcpy (yyp, yytname[yytype]);
|
|
|
|
|
|
|
|
|
|
if (yycount < 5)
|
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yyprefix = ", expecting ";
|
|
|
|
|
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
2005-08-26 19:21:57 +00:00
|
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yyp = yystpcpy (yyp, yyprefix);
|
2005-08-26 19:21:57 +00:00
|
|
|
|
yyp = yystpcpy (yyp, yytname[yyx]);
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yyprefix = " or ";
|
2005-08-26 19:21:57 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
yyerror (yymsg);
|
|
|
|
|
YYSTACK_FREE (yymsg);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
yyerror ("syntax error; also virtual memory exhausted");
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
|
|
yyerror ("syntax error");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
yylerrsp = yylsp;
|
|
|
|
|
|
|
|
|
|
if (yyerrstatus == 3)
|
|
|
|
|
{
|
|
|
|
|
/* If just tried and failed to reuse lookahead token after an
|
|
|
|
|
error, discard it. */
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
if (yychar <= YYEOF)
|
2005-08-26 19:21:57 +00:00
|
|
|
|
{
|
2005-08-29 20:43:16 +00:00
|
|
|
|
/* If at end of input, pop the error token,
|
|
|
|
|
then the rest of the stack, then return failure. */
|
|
|
|
|
if (yychar == YYEOF)
|
|
|
|
|
for (;;)
|
|
|
|
|
{
|
|
|
|
|
YYPOPSTACK;
|
|
|
|
|
if (yyssp == yyss)
|
|
|
|
|
YYABORT;
|
|
|
|
|
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
|
|
|
|
yydestruct (yystos[*yyssp], yyvsp, yylsp);
|
|
|
|
|
}
|
2005-08-26 19:21:57 +00:00
|
|
|
|
}
|
2005-08-29 20:43:16 +00:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
|
|
|
|
|
yydestruct (yytoken, &yylval, &yylloc);
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
*++yylerrsp = yylloc;
|
|
|
|
|
}
|
2005-08-26 19:21:57 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
|
token. */
|
2005-08-29 20:43:16 +00:00
|
|
|
|
goto yyerrlab1;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
/*---------------------------------------------------.
|
|
|
|
|
| yyerrorlab -- error raised explicitly by YYERROR. |
|
|
|
|
|
`---------------------------------------------------*/
|
|
|
|
|
yyerrorlab:
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
#ifdef __GNUC__
|
|
|
|
|
/* Pacify GCC when the user code never invokes YYERROR and the label
|
|
|
|
|
yyerrorlab therefore never appears in user code. */
|
|
|
|
|
if (0)
|
|
|
|
|
goto yyerrorlab;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yyvsp -= yylen;
|
|
|
|
|
yyssp -= yylen;
|
|
|
|
|
yystate = *yyssp;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
yylerrsp = yylsp;
|
|
|
|
|
*++yylerrsp = yyloc;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
yylsp -= yylen;
|
|
|
|
|
goto yyerrlab1;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
/*-------------------------------------------------------------.
|
|
|
|
|
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
|
|
|
|
`-------------------------------------------------------------*/
|
|
|
|
|
yyerrlab1:
|
2005-08-26 19:21:57 +00:00
|
|
|
|
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;
|
|
|
|
|
|
|
|
|
|
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
|
|
|
|
yydestruct (yystos[yystate], yyvsp, yylsp);
|
2005-08-29 20:43:16 +00:00
|
|
|
|
YYPOPSTACK;
|
|
|
|
|
yystate = *yyssp;
|
2005-08-26 19:21:57 +00:00
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Shifting error token, "));
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yylval;
|
2005-08-29 20:43:16 +00:00
|
|
|
|
YYLLOC_DEFAULT (yyloc, yylsp, yylerrsp - yylsp);
|
2005-08-26 19:21:57 +00:00
|
|
|
|
*++yylsp = yyloc;
|
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
|
`-------------------------------------*/
|
|
|
|
|
yyacceptlab:
|
|
|
|
|
yyresult = 0;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
yyabortlab:
|
|
|
|
|
yyresult = 1;
|
|
|
|
|
goto yyreturn;
|
|
|
|
|
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
/*----------------------------------------------.
|
|
|
|
|
| yyoverflowlab -- parser overflow comes here. |
|
|
|
|
|
`----------------------------------------------*/
|
|
|
|
|
yyoverflowlab:
|
|
|
|
|
yyerror ("parser stack overflow");
|
|
|
|
|
yyresult = 2;
|
|
|
|
|
/* Fall through. */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
yyreturn:
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
if (yyss != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss);
|
|
|
|
|
#endif
|
|
|
|
|
return yyresult;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#line 225 "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);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2005-08-29 20:43:16 +00:00
|
|
|
|
sprintf (tmp, "%ld", vp->u.i);
|
2005-08-26 19:21:57 +00:00
|
|
|
|
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;
|
|
|
|
|
|
|
|
|
|
s=ast_expr(argv[1]);
|
|
|
|
|
|
|
|
|
|
printf("=====%s======\n",s);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#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)) {
|
|
|
|
|
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)) {
|
|
|
|
|
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)) {
|
|
|
|
|
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);
|
|
|
|
|
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);
|
|
|
|
|
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);
|
|
|
|
|
ast_log(LOG_WARNING, "non-numeric argument\n");
|
|
|
|
|
return make_integer(0);
|
|
|
|
|
} else if (!to_integer (b)) {
|
|
|
|
|
free_value(a);
|
|
|
|
|
free_value(b);
|
|
|
|
|
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)) {
|
|
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
|