/* A Bison parser, made by GNU Bison 3.0.4. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015 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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* 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 "3.0.4"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Copy the first part of user declarations. */
#line 26 "awkgram.y" /* yacc.c:339 */
#ifdef GAWKDEBUG
#define YYDEBUG 12
#endif
#include "awk.h"
#if defined(__STDC__) && __STDC__ < 1 /* VMS weirdness, maybe elsewhere */
#define signed /**/
#endif
static void yyerror(const char *m, ...) ATTRIBUTE_PRINTF_1;
static void error_ln(int line, const char *m, ...) ATTRIBUTE_PRINTF_2;
static void lintwarn_ln(int line, const char *m, ...) ATTRIBUTE_PRINTF_2;
static void warning_ln(int line, const char *m, ...) ATTRIBUTE_PRINTF_2;
static char *get_src_buf(void);
static int yylex(void);
int yyparse(void);
static INSTRUCTION *snode(INSTRUCTION *subn, INSTRUCTION *op);
static char **check_params(char *fname, int pcount, INSTRUCTION *list);
static int install_function(char *fname, INSTRUCTION *fi, INSTRUCTION *plist);
static NODE *mk_rexp(INSTRUCTION *exp);
static void param_sanity(INSTRUCTION *arglist);
static int parms_shadow(INSTRUCTION *pc, bool *shadow);
#ifndef NO_LINT
static int isnoeffect(OPCODE type);
#endif
static INSTRUCTION *make_assignable(INSTRUCTION *ip);
static void dumpintlstr(const char *str, size_t len);
static void dumpintlstr2(const char *str1, size_t len1, const char *str2, size_t len2);
static int include_source(INSTRUCTION *file);
static int load_library(INSTRUCTION *file);
static void next_sourcefile(void);
static char *tokexpand(void);
static NODE *set_profile_text(NODE *n, const char *str, size_t len);
#define instruction(t) bcalloc(t, 1, 0)
static INSTRUCTION *mk_program(void);
static INSTRUCTION *append_rule(INSTRUCTION *pattern, INSTRUCTION *action);
static INSTRUCTION *mk_function(INSTRUCTION *fi, INSTRUCTION *def);
static INSTRUCTION *mk_condition(INSTRUCTION *cond, INSTRUCTION *ifp, INSTRUCTION *true_branch,
INSTRUCTION *elsep, INSTRUCTION *false_branch);
static INSTRUCTION *mk_expression_list(INSTRUCTION *list, INSTRUCTION *s1);
static INSTRUCTION *mk_for_loop(INSTRUCTION *forp, INSTRUCTION *init, INSTRUCTION *cond,
INSTRUCTION *incr, INSTRUCTION *body);
static void fix_break_continue(INSTRUCTION *list, INSTRUCTION *b_target, INSTRUCTION *c_target);
static INSTRUCTION *mk_binary(INSTRUCTION *s1, INSTRUCTION *s2, INSTRUCTION *op);
static INSTRUCTION *mk_boolean(INSTRUCTION *left, INSTRUCTION *right, INSTRUCTION *op);
static INSTRUCTION *mk_assignment(INSTRUCTION *lhs, INSTRUCTION *rhs, INSTRUCTION *op);
static INSTRUCTION *mk_getline(INSTRUCTION *op, INSTRUCTION *opt_var, INSTRUCTION *redir, int redirtype);
static int count_expressions(INSTRUCTION **list, bool isarg);
static INSTRUCTION *optimize_assignment(INSTRUCTION *exp);
static void add_lint(INSTRUCTION *list, LINTTYPE linttype);
enum defref { FUNC_DEFINE, FUNC_USE, FUNC_EXT };
static void func_use(const char *name, enum defref how);
static void check_funcs(void);
static ssize_t read_one_line(int fd, void *buffer, size_t count);
static int one_line_close(int fd);
static void split_comment(void);
static void check_comment(void);
static void add_sign_to_num(NODE *n, char sign);
static bool at_seen = false;
static bool want_source = false;
static bool want_regexp = false; /* lexical scanning kludge */
static enum {
FUNC_HEADER,
FUNC_BODY,
DONT_CHECK
} want_param_names = DONT_CHECK; /* ditto */
static char *in_function; /* parsing kludge */
static int rule = 0;
const char *const ruletab[] = {
"?",
"BEGIN",
"Rule",
"END",
"BEGINFILE",
"ENDFILE",
};
static bool in_print = false; /* lexical scanning kludge for print */
static int in_parens = 0; /* lexical scanning kludge for print */
static int sub_counter = 0; /* array dimension counter for use in delete */
static char *lexptr; /* pointer to next char during parsing */
static char *lexend; /* end of buffer */
static char *lexptr_begin; /* keep track of where we were for error msgs */
static char *lexeme; /* beginning of lexeme for debugging */
static bool lexeof; /* seen EOF for current source? */
static char *thisline = NULL;
static int in_braces = 0; /* count braces for firstline, lastline in an 'action' */
static int lastline = 0;
static int firstline = 0;
static SRCFILE *sourcefile = NULL; /* current program source */
static int lasttok = 0;
static bool eof_warned = false; /* GLOBAL: want warning for each file */
static int break_allowed; /* kludge for break */
static int continue_allowed; /* kludge for continue */
#define END_FILE -1000
#define END_SRC -2000
#define YYDEBUG_LEXER_TEXT (lexeme)
static char *tokstart = NULL;
static char *tok = NULL;
static char *tokend;
static int errcount = 0;
extern char *source;
extern int sourceline;
extern SRCFILE *srcfiles;
extern INSTRUCTION *rule_list;
extern int max_args;
extern NODE **args_array;
static INSTRUCTION *rule_block[sizeof(ruletab)];
static INSTRUCTION *ip_rec;
static INSTRUCTION *ip_newfile;
static INSTRUCTION *ip_atexit = NULL;
static INSTRUCTION *ip_end;
static INSTRUCTION *ip_endfile;
static INSTRUCTION *ip_beginfile;
INSTRUCTION *main_beginfile;
static INSTRUCTION *comment = NULL;
static INSTRUCTION *prior_comment = NULL;
static INSTRUCTION *comment_to_save = NULL;
static INSTRUCTION *program_comment = NULL;
static INSTRUCTION *function_comment = NULL;
static INSTRUCTION *block_comment = NULL;
static bool func_first = true;
static bool first_rule = true;
static inline INSTRUCTION *list_create(INSTRUCTION *x);
static inline INSTRUCTION *list_append(INSTRUCTION *l, INSTRUCTION *x);
static inline INSTRUCTION *list_prepend(INSTRUCTION *l, INSTRUCTION *x);
static inline INSTRUCTION *list_merge(INSTRUCTION *l1, INSTRUCTION *l2);
static inline INSTRUCTION *add_pending_comment(INSTRUCTION *stmt);
extern double fmod(double x, double y);
#define YYSTYPE INSTRUCTION *
#line 216 "awkgram.c" /* yacc.c:339 */
# ifndef YY_NULLPTR
# if defined __cplusplus && 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
FUNC_CALL = 258,
NAME = 259,
REGEXP = 260,
FILENAME = 261,
YNUMBER = 262,
YSTRING = 263,
TYPED_REGEXP = 264,
RELOP = 265,
IO_OUT = 266,
IO_IN = 267,
ASSIGNOP = 268,
ASSIGN = 269,
MATCHOP = 270,
CONCAT_OP = 271,
SUBSCRIPT = 272,
LEX_BEGIN = 273,
LEX_END = 274,
LEX_IF = 275,
LEX_ELSE = 276,
LEX_RETURN = 277,
LEX_DELETE = 278,
LEX_SWITCH = 279,
LEX_CASE = 280,
LEX_DEFAULT = 281,
LEX_WHILE = 282,
LEX_DO = 283,
LEX_FOR = 284,
LEX_BREAK = 285,
LEX_CONTINUE = 286,
LEX_PRINT = 287,
LEX_PRINTF = 288,
LEX_NEXT = 289,
LEX_EXIT = 290,
LEX_FUNCTION = 291,
LEX_BEGINFILE = 292,
LEX_ENDFILE = 293,
LEX_GETLINE = 294,
LEX_NEXTFILE = 295,
LEX_IN = 296,
LEX_AND = 297,
LEX_OR = 298,
INCREMENT = 299,
DECREMENT = 300,
LEX_BUILTIN = 301,
LEX_LENGTH = 302,
LEX_EOF = 303,
LEX_INCLUDE = 304,
LEX_EVAL = 305,
LEX_LOAD = 306,
NEWLINE = 307,
SLASH_BEFORE_EQUAL = 308,
UNARY = 309
};
#endif
/* Tokens. */
#define FUNC_CALL 258
#define NAME 259
#define REGEXP 260
#define FILENAME 261
#define YNUMBER 262
#define YSTRING 263
#define TYPED_REGEXP 264
#define RELOP 265
#define IO_OUT 266
#define IO_IN 267
#define ASSIGNOP 268
#define ASSIGN 269
#define MATCHOP 270
#define CONCAT_OP 271
#define SUBSCRIPT 272
#define LEX_BEGIN 273
#define LEX_END 274
#define LEX_IF 275
#define LEX_ELSE 276
#define LEX_RETURN 277
#define LEX_DELETE 278
#define LEX_SWITCH 279
#define LEX_CASE 280
#define LEX_DEFAULT 281
#define LEX_WHILE 282
#define LEX_DO 283
#define LEX_FOR 284
#define LEX_BREAK 285
#define LEX_CONTINUE 286
#define LEX_PRINT 287
#define LEX_PRINTF 288
#define LEX_NEXT 289
#define LEX_EXIT 290
#define LEX_FUNCTION 291
#define LEX_BEGINFILE 292
#define LEX_ENDFILE 293
#define LEX_GETLINE 294
#define LEX_NEXTFILE 295
#define LEX_IN 296
#define LEX_AND 297
#define LEX_OR 298
#define INCREMENT 299
#define DECREMENT 300
#define LEX_BUILTIN 301
#define LEX_LENGTH 302
#define LEX_EOF 303
#define LEX_INCLUDE 304
#define LEX_EVAL 305
#define LEX_LOAD 306
#define NEWLINE 307
#define SLASH_BEFORE_EQUAL 308
#define UNARY 309
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef int YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
int yyparse (void);
/* Copy the second part of user declarations. */
#line 372 "awkgram.c" /* yacc.c:358 */
#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;
#else
typedef signed char 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
# 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 defined YYENABLE_NLS && 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
#ifndef YY_ATTRIBUTE
# if (defined __GNUC__ \
&& (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
|| defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
# else
# define YY_ATTRIBUTE(Spec) /* empty */
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
#endif
#if !defined _Noreturn \
&& (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
# if defined _MSC_VER && 1200 <= _MSC_VER
# define _Noreturn __declspec (noreturn)
# else
# define _Noreturn YY_ATTRIBUTE ((__noreturn__))
# 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
#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#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 EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (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 EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* 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)) \
+ YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* 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_alloc, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 2
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 1236
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 76
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 70
/* YYNRULES -- Number of rules. */
#define YYNRULES 203
/* YYNSTATES -- Number of states. */
#define YYNSTATES 350
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 309
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, without out-of-bounds checking. */
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, 64, 2, 2, 67, 63, 2, 2,
68, 69, 61, 59, 56, 60, 2, 62, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 55, 75,
57, 2, 58, 54, 70, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 71, 2, 72, 66, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 73, 2, 74, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 65
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 215, 215, 217, 222, 223, 227, 239, 244, 255,
262, 268, 277, 285, 287, 292, 300, 302, 308, 316,
326, 356, 370, 384, 392, 403, 415, 417, 419, 425,
433, 434, 438, 438, 484, 483, 517, 532, 534, 539,
549, 596, 601, 602, 606, 608, 610, 617, 707, 749,
791, 904, 911, 918, 929, 939, 949, 959, 971, 988,
987, 1012, 1024, 1024, 1123, 1123, 1157, 1188, 1197, 1198,
1204, 1205, 1212, 1217, 1229, 1243, 1245, 1253, 1260, 1262,
1270, 1279, 1281, 1290, 1291, 1299, 1304, 1304, 1315, 1319,
1327, 1328, 1331, 1333, 1338, 1339, 1348, 1349, 1354, 1359,
1368, 1370, 1372, 1379, 1380, 1386, 1387, 1392, 1394, 1399,
1401, 1409, 1414, 1423, 1424, 1429, 1431, 1436, 1438, 1446,
1451, 1459, 1460, 1465, 1472, 1476, 1478, 1480, 1493, 1510,
1520, 1527, 1529, 1534, 1536, 1538, 1546, 1548, 1553, 1555,
1560, 1562, 1564, 1621, 1623, 1625, 1627, 1629, 1631, 1633,
1635, 1649, 1654, 1659, 1684, 1690, 1692, 1694, 1696, 1698,
1700, 1705, 1709, 1741, 1748, 1754, 1760, 1773, 1774, 1775,
1780, 1785, 1789, 1793, 1808, 1829, 1834, 1871, 1900, 1901,
1907, 1908, 1913, 1915, 1922, 1939, 1956, 1958, 1965, 1970,
1978, 1988, 2000, 2009, 2013, 2017, 2021, 2025, 2029, 2032,
2034, 2038, 2042, 2046
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || 0
/* 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", "FUNC_CALL", "NAME", "REGEXP",
"FILENAME", "YNUMBER", "YSTRING", "TYPED_REGEXP", "RELOP", "IO_OUT",
"IO_IN", "ASSIGNOP", "ASSIGN", "MATCHOP", "CONCAT_OP", "SUBSCRIPT",
"LEX_BEGIN", "LEX_END", "LEX_IF", "LEX_ELSE", "LEX_RETURN", "LEX_DELETE",
"LEX_SWITCH", "LEX_CASE", "LEX_DEFAULT", "LEX_WHILE", "LEX_DO",
"LEX_FOR", "LEX_BREAK", "LEX_CONTINUE", "LEX_PRINT", "LEX_PRINTF",
"LEX_NEXT", "LEX_EXIT", "LEX_FUNCTION", "LEX_BEGINFILE", "LEX_ENDFILE",
"LEX_GETLINE", "LEX_NEXTFILE", "LEX_IN", "LEX_AND", "LEX_OR",
"INCREMENT", "DECREMENT", "LEX_BUILTIN", "LEX_LENGTH", "LEX_EOF",
"LEX_INCLUDE", "LEX_EVAL", "LEX_LOAD", "NEWLINE", "SLASH_BEFORE_EQUAL",
"'?'", "':'", "','", "'<'", "'>'", "'+'", "'-'", "'*'", "'/'", "'%'",
"'!'", "UNARY", "'^'", "'$'", "'('", "')'", "'@'", "'['", "']'", "'{'",
"'}'", "';'", "$accept", "program", "rule", "source", "library",
"pattern", "action", "func_name", "lex_builtin", "function_prologue",
"$@1", "regexp", "$@2", "typed_regexp", "a_slash", "statements",
"statement_term", "statement", "non_compound_stmt", "$@3", "simple_stmt",
"$@4", "$@5", "opt_simple_stmt", "case_statements", "case_statement",
"case_value", "print", "print_expression_list", "output_redir", "$@6",
"if_statement", "nls", "opt_nls", "input_redir", "opt_param_list",
"param_list", "opt_exp", "opt_expression_list", "expression_list",
"opt_fcall_expression_list", "fcall_expression_list", "fcall_exp", "exp",
"assign_operator", "relop_or_less", "a_relop", "common_exp", "simp_exp",
"simp_exp_nc", "non_post_simp_exp", "func_call", "direct_func_call",
"opt_variable", "delete_subscript_list", "delete_subscript",
"delete_exp_list", "bracketed_exp_list", "subscript", "subscript_list",
"simple_variable", "variable", "opt_incdec", "l_brace", "r_brace",
"r_paren", "opt_semi", "semi", "colon", "comma", YY_NULLPTR
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
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, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 63, 58, 44, 60, 62, 43,
45, 42, 47, 37, 33, 309, 94, 36, 40, 41,
64, 91, 93, 123, 125, 59
};
# endif
#define YYPACT_NINF -275
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-275)))
#define YYTABLE_NINF -115
#define yytable_value_is_error(Yytable_value) \
(!!((Yytable_value) == (-115)))
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
-275, 376, -275, -275, -12, -9, -275, -275, -275, -275,
171, -275, -275, 44, 44, 44, 5, 40, -275, -275,
-275, 1139, 1139, -275, 1139, 1166, 869, 27, -275, -18,
2, -275, -275, 89, 884, 1065, 192, 214, -275, -275,
-275, -275, 248, 795, 869, -275, 10, -275, -275, -275,
-275, -275, 116, 82, -275, 115, -275, -275, -275, 795,
795, 166, 107, 104, 107, 107, 1139, 117, -275, -275,
15, 349, 23, 45, -275, 125, -275, -275, -275, 89,
-275, 125, -275, 178, -275, -275, 1092, 172, 1139, 1139,
1139, 125, -275, -275, -275, 1139, 146, 192, 1139, 1139,
1139, 1139, 1139, 1139, 1139, 1139, 1139, 1139, 1139, 1139,
-275, 181, -275, -275, 173, 1139, -275, -275, -275, 128,
73, -275, 1107, 14, 1107, -275, -275, -275, -275, 1139,
-275, 128, 128, 349, -275, -275, -275, 1139, 125, -275,
152, 916, -275, -275, 16, 92, -275, 20, 92, 89,
-275, 599, -275, -275, -275, 148, -275, 124, 22, 1048,
1139, 199, 44, 265, 265, 107, 107, 107, 107, 265,
265, 107, 107, 107, 107, -275, -275, 1107, -275, 1092,
842, -275, 43, 192, -275, -275, 1107, -275, 172, -275,
1107, -275, -275, -275, -275, -275, 133, -275, 41, 144,
145, 125, 147, 92, 92, -275, -275, 92, 1139, 92,
125, -275, -275, 92, -275, -275, 1107, -275, 151, 125,
1139, 1107, -275, -275, -275, -275, -275, -275, 128, 76,
-275, 1139, 1139, -275, 224, 1139, 1139, 715, 949, -275,
-275, -275, 92, 1107, -275, -275, -275, 646, 599, 125,
-275, -275, 1107, 125, -275, 49, 349, 92, -9, 160,
349, 349, 206, 113, -275, 151, -275, 869, 225, -275,
169, -275, -275, -275, -275, -275, 125, -275, -275, 11,
-275, -275, -275, 125, 125, 179, 172, 125, 15, -275,
-275, 715, -275, -275, 2, 715, 1139, 128, 762, 152,
1139, 219, -275, -275, 349, 125, 275, 125, 1065, 125,
112, 125, 715, 125, 997, 715, -275, 261, 205, -275,
191, -275, -275, 997, 128, -275, -275, -275, 271, 272,
-275, -275, 205, -275, 125, -275, 128, 125, -275, -275,
125, -275, 125, 715, -275, 449, 715, -275, 524, -275
};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE does not specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
2, 0, 1, 6, 0, 189, 171, 172, 21, 22,
0, 23, 24, 178, 0, 0, 0, 166, 5, 90,
38, 0, 0, 37, 0, 0, 0, 0, 3, 0,
0, 161, 34, 4, 19, 132, 140, 141, 143, 167,
175, 191, 168, 0, 0, 186, 0, 190, 27, 26,
30, 31, 0, 0, 28, 94, 179, 169, 170, 0,
0, 0, 174, 168, 173, 162, 0, 195, 168, 109,
0, 107, 0, 0, 176, 92, 201, 7, 8, 42,
39, 92, 9, 0, 91, 136, 0, 0, 0, 0,
0, 92, 137, 139, 138, 0, 0, 142, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
134, 133, 151, 152, 0, 0, 117, 36, 122, 0,
0, 115, 121, 0, 107, 188, 187, 29, 32, 0,
150, 0, 0, 0, 193, 194, 192, 110, 92, 198,
0, 0, 163, 14, 0, 0, 17, 0, 0, 93,
196, 0, 43, 35, 127, 128, 129, 125, 126, 0,
0, 130, 178, 148, 149, 145, 146, 147, 144, 159,
160, 156, 157, 158, 155, 124, 135, 123, 177, 118,
0, 185, 0, 95, 164, 165, 111, 203, 0, 112,
108, 13, 10, 16, 11, 41, 0, 59, 0, 0,
0, 92, 0, 0, 0, 81, 82, 0, 103, 0,
92, 40, 53, 0, 62, 46, 67, 39, 199, 92,
0, 20, 154, 119, 120, 116, 100, 98, 0, 0,
153, 0, 103, 64, 0, 0, 0, 0, 68, 54,
55, 56, 0, 104, 57, 197, 61, 0, 0, 92,
200, 44, 131, 92, 101, 0, 0, 0, 180, 0,
0, 0, 0, 189, 69, 0, 58, 0, 85, 83,
0, 45, 25, 33, 102, 99, 92, 60, 65, 0,
182, 184, 66, 92, 92, 0, 0, 92, 0, 86,
63, 0, 181, 183, 0, 0, 0, 0, 0, 84,
0, 88, 70, 48, 0, 92, 0, 92, 87, 92,
0, 92, 0, 92, 68, 0, 72, 0, 0, 71,
0, 49, 50, 68, 0, 89, 75, 78, 0, 0,
79, 80, 0, 202, 92, 47, 0, 92, 77, 76,
92, 39, 92, 0, 39, 0, 0, 52, 0, 51
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-275, -275, -275, -275, -275, -275, 252, -275, -275, -275,
-275, -33, -275, -80, -275, -213, 100, -144, -275, -275,
-231, -275, -275, -274, -275, -275, -275, -275, -275, -275,
-275, -275, 7, 62, -275, -275, -275, 54, -275, -43,
1, -275, -23, -1, -275, -275, -275, -13, 17, -275,
263, -275, 8, 127, -275, -275, 21, -36, -275, -275,
-78, -2, -275, -27, -230, -65, -275, -15, -38, -94
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 1, 28, 145, 148, 29, 77, 53, 54, 30,
182, 31, 83, 118, 32, 151, 78, 211, 212, 232,
213, 247, 258, 265, 310, 319, 332, 214, 268, 290,
300, 215, 149, 150, 130, 228, 229, 242, 269, 70,
119, 120, 121, 216, 115, 94, 95, 35, 36, 37,
38, 39, 40, 55, 278, 279, 280, 45, 46, 47,
41, 42, 136, 217, 218, 142, 249, 219, 334, 141
};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule whose
number is the opposite. If YYTABLE_NINF, syntax error. */
static const yytype_int16 yytable[] =
{
34, 123, 80, 80, 248, 140, 154, 264, 33, 156,
126, 56, 57, 58, 81, 137, 137, 191, 271, 63,
63, 193, 63, 68, 143, 71, 180, 125, 292, 144,
4, 175, 85, 63, 19, 74, 79, 86, 62, 64,
324, 65, 122, 124, 226, 233, 146, 227, 5, 336,
274, 147, 97, 275, 178, 75, 43, 76, 122, 122,
131, 132, 44, 87, 88, 133, 184, 185, -12, 74,
138, 138, -15, 59, 179, 75, 72, 254, 73, 92,
93, 44, 44, 264, 139, 155, 181, 157, 158, 159,
335, -12, 264, 262, 161, -15, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 60, 234,
230, 25, -96, 316, 177, 163, 164, 165, 166, 167,
168, 169, 170, 171, 172, 173, 174, 63, 345, 138,
81, 348, 138, 81, 85, 255, 186, 317, 318, 86,
190, 84, -114, 152, 19, -97, 183, 301, 112, 113,
128, 303, 79, 160, 286, 79, 223, 225, 85, 221,
56, 134, 135, 253, 19, 87, 127, 76, 322, 4,
137, 325, 129, 103, 48, 49, 5, 19, 122, 122,
-106, 92, 93, 153, 44, 162, -92, 176, 81, 81,
117, 276, 81, 188, 81, 283, 284, 139, 81, 347,
187, 231, 349, 250, 270, 92, 93, 243, 297, -115,
79, 79, 235, 236, 79, 238, 79, 50, 51, 252,
79, -106, 281, 299, 288, 138, 76, 81, 259, 282,
256, 243, 305, 285, 260, 261, 289, 331, -106, 311,
309, 52, 81, 281, -106, 192, 124, 296, 194, 79,
287, 98, 99, 100, 101, 102, -115, -115, 103, 337,
333, 110, 111, 237, 79, 210, 71, 302, 326, 327,
117, 342, 245, 104, 105, 106, 107, 108, 338, 339,
109, 251, 82, 307, 330, 85, 257, 308, 67, 222,
86, 313, 112, 113, 340, 304, 0, 306, 63, 0,
293, 114, 0, 239, 240, 0, 63, 241, 0, 244,
0, 272, 0, 246, 20, 273, 87, 88, 89, 0,
328, 329, 0, 23, 0, 97, 100, 101, 102, 90,
0, 103, 92, 93, 0, 0, 0, 0, 291, 0,
0, 0, 266, 0, 0, 294, 295, 0, 0, 298,
76, 0, 0, 0, 0, 0, 0, 277, 0, 85,
0, 0, 0, 0, 86, 0, 0, 312, 0, 314,
0, 315, 320, 321, 0, 323, 2, 3, 0, 4,
5, 0, 0, 6, 7, 0, 0, 0, 0, 0,
87, 88, 89, 0, 8, 9, 341, 0, 0, 343,
0, 0, 344, 90, 346, 0, 92, 93, 0, 0,
0, 0, 10, 11, 12, 13, 0, 0, 139, 0,
14, 15, 16, 17, 18, 0, 0, 0, 19, 20,
0, 0, 0, 0, 0, 21, 22, 0, 23, 0,
24, 0, 0, 25, 26, 0, 27, 0, 0, -18,
195, -18, 4, 5, 0, 0, 6, 7, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 196,
0, 197, 198, 199, -74, -74, 200, 201, 202, 203,
204, 205, 206, 207, 208, 0, 0, 0, 13, 209,
0, 0, 0, 14, 15, 16, 17, 0, 0, 0,
0, -74, 20, 0, 0, 0, 0, 0, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 0, 61,
0, 0, 75, -74, 76, 195, 0, 4, 5, 0,
0, 6, 7, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 196, 0, 197, 198, 199, -73,
-73, 200, 201, 202, 203, 204, 205, 206, 207, 208,
0, 0, 0, 13, 209, 0, 0, 0, 14, 15,
16, 17, 0, 0, 0, 0, -73, 20, 0, 0,
0, 0, 0, 21, 22, 0, 23, 0, 24, 0,
0, 25, 26, 0, 61, 0, 0, 75, -73, 76,
195, 0, 4, 5, 0, 0, 6, 7, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 196,
0, 197, 198, 199, 0, 0, 200, 201, 202, 203,
204, 205, 206, 207, 208, 0, 0, 0, 13, 209,
0, 0, 0, 14, 15, 16, 17, 69, 0, 4,
5, 0, 20, 6, 7, 0, 0, -105, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 0, 61,
0, 0, 75, 210, 76, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 13, 0, 0, 0, 0,
14, 15, 16, 17, 0, 0, 0, 0, -105, 20,
0, 0, 0, 0, 0, 21, 22, 0, 23, 0,
24, 0, 0, 25, 267, -105, 61, 0, 4, 5,
0, -105, 6, 7, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 196, 0, 197, 198, 199,
0, 0, 200, 201, 202, 203, 204, 205, 206, 207,
208, 0, 0, 0, 13, 209, 0, 0, 0, 14,
15, 16, 17, 0, 0, 4, 5, 0, 20, 6,
7, 0, 0, 0, 21, 22, 0, 23, 0, 24,
0, 0, 25, 26, 0, 61, 0, 0, 75, 0,
76, 0, 0, 0, 0, 0, 116, 0, 4, 5,
0, 13, 6, 7, 117, 0, 14, 15, 16, 17,
0, 0, 0, 0, 0, 20, 0, 0, 0, 0,
0, 21, 22, 0, 23, 0, 24, 0, 0, 25,
26, 0, 61, 0, 13, 0, 0, 76, 0, 14,
15, 16, 17, 224, 0, 4, 5, 0, 20, 6,
7, 117, 0, 0, 21, 22, 0, 23, 0, 24,
0, 0, 25, 26, -113, 61, 0, 0, 0, 0,
69, 0, 4, 5, 0, 0, 6, 7, 0, 0,
0, 13, 0, 0, 0, 0, 14, 15, 16, 17,
0, 0, 0, 0, 85, 20, 0, 0, 0, 86,
0, 21, 22, 0, 23, 0, 24, 0, 13, 25,
26, 0, 61, 14, 15, 16, 17, 189, 0, 4,
5, 0, 20, 6, 7, 87, 88, 89, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 90, 61,
91, 92, 93, 0, 0, 0, 0, 0, 0, 0,
0, 0, 4, 263, 0, 13, 6, 7, 0, 0,
14, 15, 16, 17, 0, 0, 0, 0, 0, 20,
0, 0, 198, 0, 0, 21, 22, 0, 23, 0,
24, 205, 206, 25, 26, 0, 61, 0, 13, 0,
0, 0, 0, 14, 15, 16, 17, 0, 0, 0,
4, 5, 20, 0, 6, 7, 0, 0, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 0, 61,
198, 0, 0, 0, 0, 0, 0, 0, 0, 205,
206, 0, 0, 0, 0, 0, 13, 0, 0, 0,
0, 14, 15, 16, 17, 0, 0, 0, 0, 0,
20, 0, 0, 0, 0, 0, 21, 22, 85, 23,
0, 24, 0, 86, 25, 26, 0, 61, 4, 5,
0, 0, 6, 7, 0, 0, 0, 96, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 87,
88, 89, 0, 0, 0, 4, 5, 0, 0, 6,
7, 117, 90, 220, 13, 92, 93, 0, 0, 14,
15, 16, 17, 0, 0, 0, 0, 85, 20, 0,
0, 0, 86, 0, 21, 22, 0, 23, 0, 24,
0, 13, 25, 26, 0, 61, 14, 15, 16, 17,
0, 0, 4, 5, 0, 20, 6, 7, 87, 88,
89, 21, 22, 0, 23, 0, 24, 0, 0, 25,
26, 90, 61, 0, 92, 93, 0, 0, 0, 4,
5, 0, 0, 6, 7, 0, 0, 0, 13, 0,
0, 0, 0, 14, 15, 16, 17, 0, 0, 0,
0, 0, 20, 0, 0, 0, 0, 0, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 0, 61,
14, 15, 16, 17, 0, 0, 0, 0, 0, 20,
0, 0, 0, 0, 0, 21, 22, 0, 23, 0,
24, 0, 0, 25, 66, 0, 61
};
static const yytype_int16 yycheck[] =
{
1, 44, 29, 30, 217, 70, 86, 238, 1, 87,
46, 13, 14, 15, 29, 1, 1, 1, 248, 21,
22, 1, 24, 25, 1, 26, 120, 17, 17, 6,
3, 111, 10, 35, 52, 27, 29, 15, 21, 22,
314, 24, 43, 44, 1, 4, 1, 4, 4, 323,
1, 6, 35, 4, 119, 73, 68, 75, 59, 60,
59, 60, 71, 41, 42, 66, 131, 132, 52, 61,
56, 56, 52, 68, 1, 73, 49, 1, 51, 57,
58, 71, 71, 314, 69, 86, 72, 88, 89, 90,
320, 75, 323, 237, 95, 75, 98, 99, 100, 101,
102, 103, 104, 105, 106, 107, 108, 109, 68, 68,
188, 67, 69, 1, 115, 98, 99, 100, 101, 102,
103, 104, 105, 106, 107, 108, 109, 129, 341, 56,
145, 344, 56, 148, 10, 229, 137, 25, 26, 15,
141, 52, 69, 81, 52, 69, 129, 291, 44, 45,
68, 295, 145, 91, 41, 148, 179, 180, 10, 160,
162, 44, 45, 228, 52, 41, 50, 75, 312, 3,
1, 315, 57, 66, 3, 4, 4, 52, 179, 180,
11, 57, 58, 5, 71, 39, 74, 14, 203, 204,
9, 256, 207, 41, 209, 260, 261, 69, 213, 343,
138, 68, 346, 218, 247, 57, 58, 208, 286, 10,
203, 204, 68, 68, 207, 68, 209, 46, 47, 220,
213, 52, 258, 288, 267, 56, 75, 242, 4, 69,
231, 232, 297, 27, 235, 236, 11, 317, 69, 304,
21, 70, 257, 279, 75, 145, 247, 68, 148, 242,
265, 59, 60, 61, 62, 63, 57, 58, 66, 324,
55, 13, 14, 201, 257, 74, 267, 294, 7, 8,
9, 336, 210, 59, 60, 61, 62, 63, 7, 7,
66, 219, 30, 298, 317, 10, 232, 300, 25, 162,
15, 306, 44, 45, 332, 296, -1, 298, 300, -1,
279, 53, -1, 203, 204, -1, 308, 207, -1, 209,
-1, 249, -1, 213, 53, 253, 41, 42, 43, -1,
59, 60, -1, 62, -1, 308, 61, 62, 63, 54,
-1, 66, 57, 58, -1, -1, -1, -1, 276, -1,
-1, -1, 242, -1, -1, 283, 284, -1, -1, 287,
75, -1, -1, -1, -1, -1, -1, 257, -1, 10,
-1, -1, -1, -1, 15, -1, -1, 305, -1, 307,
-1, 309, 310, 311, -1, 313, 0, 1, -1, 3,
4, -1, -1, 7, 8, -1, -1, -1, -1, -1,
41, 42, 43, -1, 18, 19, 334, -1, -1, 337,
-1, -1, 340, 54, 342, -1, 57, 58, -1, -1,
-1, -1, 36, 37, 38, 39, -1, -1, 69, -1,
44, 45, 46, 47, 48, -1, -1, -1, 52, 53,
-1, -1, -1, -1, -1, 59, 60, -1, 62, -1,
64, -1, -1, 67, 68, -1, 70, -1, -1, 73,
1, 75, 3, 4, -1, -1, 7, 8, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 20,
-1, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 33, 34, 35, -1, -1, -1, 39, 40,
-1, -1, -1, 44, 45, 46, 47, -1, -1, -1,
-1, 52, 53, -1, -1, -1, -1, -1, 59, 60,
-1, 62, -1, 64, -1, -1, 67, 68, -1, 70,
-1, -1, 73, 74, 75, 1, -1, 3, 4, -1,
-1, 7, 8, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 20, -1, 22, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
-1, -1, -1, 39, 40, -1, -1, -1, 44, 45,
46, 47, -1, -1, -1, -1, 52, 53, -1, -1,
-1, -1, -1, 59, 60, -1, 62, -1, 64, -1,
-1, 67, 68, -1, 70, -1, -1, 73, 74, 75,
1, -1, 3, 4, -1, -1, 7, 8, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 20,
-1, 22, 23, 24, -1, -1, 27, 28, 29, 30,
31, 32, 33, 34, 35, -1, -1, -1, 39, 40,
-1, -1, -1, 44, 45, 46, 47, 1, -1, 3,
4, -1, 53, 7, 8, -1, -1, 11, 59, 60,
-1, 62, -1, 64, -1, -1, 67, 68, -1, 70,
-1, -1, 73, 74, 75, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 39, -1, -1, -1, -1,
44, 45, 46, 47, -1, -1, -1, -1, 52, 53,
-1, -1, -1, -1, -1, 59, 60, -1, 62, -1,
64, -1, -1, 67, 68, 69, 70, -1, 3, 4,
-1, 75, 7, 8, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 20, -1, 22, 23, 24,
-1, -1, 27, 28, 29, 30, 31, 32, 33, 34,
35, -1, -1, -1, 39, 40, -1, -1, -1, 44,
45, 46, 47, -1, -1, 3, 4, -1, 53, 7,
8, -1, -1, -1, 59, 60, -1, 62, -1, 64,
-1, -1, 67, 68, -1, 70, -1, -1, 73, -1,
75, -1, -1, -1, -1, -1, 1, -1, 3, 4,
-1, 39, 7, 8, 9, -1, 44, 45, 46, 47,
-1, -1, -1, -1, -1, 53, -1, -1, -1, -1,
-1, 59, 60, -1, 62, -1, 64, -1, -1, 67,
68, -1, 70, -1, 39, -1, -1, 75, -1, 44,
45, 46, 47, 1, -1, 3, 4, -1, 53, 7,
8, 9, -1, -1, 59, 60, -1, 62, -1, 64,
-1, -1, 67, 68, 69, 70, -1, -1, -1, -1,
1, -1, 3, 4, -1, -1, 7, 8, -1, -1,
-1, 39, -1, -1, -1, -1, 44, 45, 46, 47,
-1, -1, -1, -1, 10, 53, -1, -1, -1, 15,
-1, 59, 60, -1, 62, -1, 64, -1, 39, 67,
68, -1, 70, 44, 45, 46, 47, 1, -1, 3,
4, -1, 53, 7, 8, 41, 42, 43, 59, 60,
-1, 62, -1, 64, -1, -1, 67, 68, 54, 70,
56, 57, 58, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 3, 4, -1, 39, 7, 8, -1, -1,
44, 45, 46, 47, -1, -1, -1, -1, -1, 53,
-1, -1, 23, -1, -1, 59, 60, -1, 62, -1,
64, 32, 33, 67, 68, -1, 70, -1, 39, -1,
-1, -1, -1, 44, 45, 46, 47, -1, -1, -1,
3, 4, 53, -1, 7, 8, -1, -1, 59, 60,
-1, 62, -1, 64, -1, -1, 67, 68, -1, 70,
23, -1, -1, -1, -1, -1, -1, -1, -1, 32,
33, -1, -1, -1, -1, -1, 39, -1, -1, -1,
-1, 44, 45, 46, 47, -1, -1, -1, -1, -1,
53, -1, -1, -1, -1, -1, 59, 60, 10, 62,
-1, 64, -1, 15, 67, 68, -1, 70, 3, 4,
-1, -1, 7, 8, -1, -1, -1, 12, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 41,
42, 43, -1, -1, -1, 3, 4, -1, -1, 7,
8, 9, 54, 55, 39, 57, 58, -1, -1, 44,
45, 46, 47, -1, -1, -1, -1, 10, 53, -1,
-1, -1, 15, -1, 59, 60, -1, 62, -1, 64,
-1, 39, 67, 68, -1, 70, 44, 45, 46, 47,
-1, -1, 3, 4, -1, 53, 7, 8, 41, 42,
43, 59, 60, -1, 62, -1, 64, -1, -1, 67,
68, 54, 70, -1, 57, 58, -1, -1, -1, 3,
4, -1, -1, 7, 8, -1, -1, -1, 39, -1,
-1, -1, -1, 44, 45, 46, 47, -1, -1, -1,
-1, -1, 53, -1, -1, -1, -1, -1, 59, 60,
-1, 62, -1, 64, -1, -1, 67, 68, -1, 70,
44, 45, 46, 47, -1, -1, -1, -1, -1, 53,
-1, -1, -1, -1, -1, 59, 60, -1, 62, -1,
64, -1, -1, 67, 68, -1, 70
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 77, 0, 1, 3, 4, 7, 8, 18, 19,
36, 37, 38, 39, 44, 45, 46, 47, 48, 52,
53, 59, 60, 62, 64, 67, 68, 70, 78, 81,
85, 87, 90, 108, 119, 123, 124, 125, 126, 127,
128, 136, 137, 68, 71, 133, 134, 135, 3, 4,
46, 47, 70, 83, 84, 129, 137, 137, 137, 68,
68, 70, 124, 137, 124, 124, 68, 126, 137, 1,
115, 119, 49, 51, 128, 73, 75, 82, 92, 108,
139, 143, 82, 88, 52, 10, 15, 41, 42, 43,
54, 56, 57, 58, 121, 122, 12, 124, 59, 60,
61, 62, 63, 66, 59, 60, 61, 62, 63, 66,
13, 14, 44, 45, 53, 120, 1, 9, 89, 116,
117, 118, 119, 115, 119, 17, 133, 50, 68, 57,
110, 116, 116, 119, 44, 45, 138, 1, 56, 69,
141, 145, 141, 1, 6, 79, 1, 6, 80, 108,
109, 91, 109, 5, 89, 119, 136, 119, 119, 119,
109, 119, 39, 124, 124, 124, 124, 124, 124, 124,
124, 124, 124, 124, 124, 89, 14, 119, 141, 1,
145, 72, 86, 124, 141, 141, 119, 109, 41, 1,
119, 1, 92, 1, 92, 1, 20, 22, 23, 24,
27, 28, 29, 30, 31, 32, 33, 34, 35, 40,
74, 93, 94, 96, 103, 107, 119, 139, 140, 143,
55, 119, 129, 118, 1, 118, 1, 4, 111, 112,
136, 68, 95, 4, 68, 68, 68, 109, 68, 92,
92, 92, 113, 119, 92, 109, 92, 97, 91, 142,
143, 109, 119, 141, 1, 145, 119, 113, 98, 4,
119, 119, 93, 4, 96, 99, 92, 68, 104, 114,
115, 140, 109, 109, 1, 4, 141, 92, 130, 131,
132, 133, 69, 141, 141, 27, 41, 143, 115, 11,
105, 109, 17, 132, 109, 109, 68, 136, 109, 141,
106, 93, 139, 93, 119, 141, 119, 143, 123, 21,
100, 141, 109, 143, 109, 109, 1, 25, 26, 101,
109, 109, 93, 109, 99, 93, 7, 8, 59, 60,
87, 89, 102, 55, 144, 140, 99, 141, 7, 7,
144, 109, 141, 109, 109, 91, 109, 93, 91, 93
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 76, 77, 77, 77, 77, 77, 78, 78, 78,
78, 78, 79, 79, 79, 80, 80, 80, 81, 81,
81, 81, 81, 81, 81, 82, 83, 83, 83, 83,
84, 84, 86, 85, 88, 87, 89, 90, 90, 91,
91, 91, 92, 92, 93, 93, 93, 93, 93, 93,
93, 93, 93, 93, 94, 94, 94, 94, 94, 95,
94, 94, 97, 96, 98, 96, 96, 96, 99, 99,
100, 100, 100, 101, 101, 102, 102, 102, 102, 102,
102, 103, 103, 104, 104, 105, 106, 105, 107, 107,
108, 108, 109, 109, 110, 110, 111, 111, 112, 112,
112, 112, 112, 113, 113, 114, 114, 115, 115, 115,
115, 115, 115, 116, 116, 117, 117, 117, 117, 117,
117, 118, 118, 119, 119, 119, 119, 119, 119, 119,
119, 119, 119, 120, 120, 120, 121, 121, 122, 122,
123, 123, 123, 124, 124, 124, 124, 124, 124, 124,
124, 124, 124, 124, 125, 125, 125, 125, 125, 125,
125, 126, 126, 126, 126, 126, 126, 126, 126, 126,
126, 126, 126, 126, 126, 127, 127, 128, 129, 129,
130, 130, 131, 131, 132, 133, 134, 134, 135, 136,
136, 137, 137, 138, 138, 138, 139, 140, 141, 142,
142, 143, 144, 145
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 0, 2, 2, 2, 2, 2, 2, 2,
4, 4, 1, 2, 1, 1, 2, 1, 0, 1,
4, 1, 1, 1, 1, 5, 1, 1, 1, 2,
1, 1, 0, 7, 0, 3, 1, 1, 1, 0,
2, 2, 1, 2, 2, 3, 1, 9, 6, 8,
8, 12, 11, 1, 2, 2, 2, 2, 3, 0,
4, 2, 0, 4, 0, 4, 4, 1, 0, 1,
0, 2, 2, 5, 4, 1, 2, 2, 1, 1,
1, 1, 1, 1, 3, 0, 0, 3, 6, 9,
1, 2, 0, 1, 0, 2, 0, 1, 1, 3,
1, 2, 3, 0, 1, 0, 1, 1, 3, 1,
2, 3, 3, 0, 1, 1, 3, 1, 2, 3,
3, 1, 1, 3, 3, 3, 3, 3, 3, 3,
3, 5, 1, 1, 1, 2, 1, 1, 1, 1,
1, 1, 2, 1, 3, 3, 3, 3, 3, 3,
3, 2, 2, 5, 4, 3, 3, 3, 3, 3,
3, 1, 2, 3, 4, 4, 1, 1, 1, 2,
2, 1, 1, 2, 2, 1, 2, 4, 0, 1,
0, 2, 1, 2, 1, 3, 1, 2, 2, 1,
2, 1, 3, 1, 1, 0, 2, 2, 1, 0,
1, 1, 1, 2
};
#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
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (yylen); \
yystate = *yyssp; \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (0)
/* Error token number */
#define YYTERROR 1
#define YYERRCODE 256
/* 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)
/* This macro is provided for backward compatibility. */
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
#endif
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*----------------------------------------.
| Print this symbol's value on YYOUTPUT. |
`----------------------------------------*/
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyo = yyoutput;
YYUSE (yyo);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
YYUSE (yytype);
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyoutput, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
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. |
`------------------------------------------------*/
static void
yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
{
unsigned long int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[yyssp[yyi + 1 - yynrhs]],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, 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 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. */
static YYSIZE_T
yystrlen (const char *yystr)
{
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. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
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 *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
{
YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
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 yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (! (yysize <= yysize1
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* 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 = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
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;
/* 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),
&yystacksize);
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_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + 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));
if (yystate == YYFINAL)
YYACCEPT;
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. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
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);
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 (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
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];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 3:
#line 218 "awkgram.y" /* yacc.c:1646 */
{
rule = 0;
yyerrok;
}
#line 1897 "awkgram.c" /* yacc.c:1646 */
break;
case 5:
#line 224 "awkgram.y" /* yacc.c:1646 */
{
next_sourcefile();
}
#line 1905 "awkgram.c" /* yacc.c:1646 */
break;
case 6:
#line 228 "awkgram.y" /* yacc.c:1646 */
{
rule = 0;
/*
* If errors, give up, don't produce an infinite
* stream of syntax error messages.
*/
/* yyerrok; */
}
#line 1918 "awkgram.c" /* yacc.c:1646 */
break;
case 7:
#line 240 "awkgram.y" /* yacc.c:1646 */
{
(void) append_rule((yyvsp[-1]), (yyvsp[0]));
first_rule = false;
}
#line 1927 "awkgram.c" /* yacc.c:1646 */
break;
case 8:
#line 245 "awkgram.y" /* yacc.c:1646 */
{
if (rule != Rule) {
msg(_("%s blocks must have an action part"), ruletab[rule]);
errcount++;
} else if ((yyvsp[-1]) == NULL) {
msg(_("each rule must have a pattern or an action part"));
errcount++;
} else /* pattern rule with non-empty pattern */
(void) append_rule((yyvsp[-1]), NULL);
}
#line 1942 "awkgram.c" /* yacc.c:1646 */
break;
case 9:
#line 256 "awkgram.y" /* yacc.c:1646 */
{
in_function = NULL;
(void) mk_function((yyvsp[-1]), (yyvsp[0]));
want_param_names = DONT_CHECK;
yyerrok;
}
#line 1953 "awkgram.c" /* yacc.c:1646 */
break;
case 10:
#line 263 "awkgram.y" /* yacc.c:1646 */
{
want_source = false;
at_seen = false;
yyerrok;
}
#line 1963 "awkgram.c" /* yacc.c:1646 */
break;
case 11:
#line 269 "awkgram.y" /* yacc.c:1646 */
{
want_source = false;
at_seen = false;
yyerrok;
}
#line 1973 "awkgram.c" /* yacc.c:1646 */
break;
case 12:
#line 278 "awkgram.y" /* yacc.c:1646 */
{
if (include_source((yyvsp[0])) < 0)
YYABORT;
efree((yyvsp[0])->lextok);
bcfree((yyvsp[0]));
(yyval) = NULL;
}
#line 1985 "awkgram.c" /* yacc.c:1646 */
break;
case 13:
#line 286 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 1991 "awkgram.c" /* yacc.c:1646 */
break;
case 14:
#line 288 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 1997 "awkgram.c" /* yacc.c:1646 */
break;
case 15:
#line 293 "awkgram.y" /* yacc.c:1646 */
{
if (load_library((yyvsp[0])) < 0)
YYABORT;
efree((yyvsp[0])->lextok);
bcfree((yyvsp[0]));
(yyval) = NULL;
}
#line 2009 "awkgram.c" /* yacc.c:1646 */
break;
case 16:
#line 301 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 2015 "awkgram.c" /* yacc.c:1646 */
break;
case 17:
#line 303 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 2021 "awkgram.c" /* yacc.c:1646 */
break;
case 18:
#line 308 "awkgram.y" /* yacc.c:1646 */
{
rule = Rule;
if (comment != NULL) {
(yyval) = list_create(comment);
comment = NULL;
} else
(yyval) = NULL;
}
#line 2034 "awkgram.c" /* yacc.c:1646 */
break;
case 19:
#line 317 "awkgram.y" /* yacc.c:1646 */
{
rule = Rule;
if (comment != NULL) {
(yyval) = list_prepend((yyvsp[0]), comment);
comment = NULL;
} else
(yyval) = (yyvsp[0]);
}
#line 2047 "awkgram.c" /* yacc.c:1646 */
break;
case 20:
#line 327 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *tp;
add_lint((yyvsp[-3]), LINT_assign_in_cond);
add_lint((yyvsp[0]), LINT_assign_in_cond);
tp = instruction(Op_no_op);
list_prepend((yyvsp[-3]), bcalloc(Op_line_range, !!do_pretty_print + 1, 0));
(yyvsp[-3])->nexti->triggered = false;
(yyvsp[-3])->nexti->target_jmp = (yyvsp[0])->nexti;
list_append((yyvsp[-3]), instruction(Op_cond_pair));
(yyvsp[-3])->lasti->line_range = (yyvsp[-3])->nexti;
(yyvsp[-3])->lasti->target_jmp = tp;
list_append((yyvsp[0]), instruction(Op_cond_pair));
(yyvsp[0])->lasti->line_range = (yyvsp[-3])->nexti;
(yyvsp[0])->lasti->target_jmp = tp;
if (do_pretty_print) {
((yyvsp[-3])->nexti + 1)->condpair_left = (yyvsp[-3])->lasti;
((yyvsp[-3])->nexti + 1)->condpair_right = (yyvsp[0])->lasti;
}
if (comment != NULL) {
(yyval) = list_append(list_merge(list_prepend((yyvsp[-3]), comment), (yyvsp[0])), tp);
comment = NULL;
} else
(yyval) = list_append(list_merge((yyvsp[-3]), (yyvsp[0])), tp);
rule = Rule;
}
#line 2081 "awkgram.c" /* yacc.c:1646 */
break;
case 21:
#line 357 "awkgram.y" /* yacc.c:1646 */
{
static int begin_seen = 0;
func_first = false;
if (do_lint_old && ++begin_seen == 2)
warning_ln((yyvsp[0])->source_line,
_("old awk does not support multiple `BEGIN' or `END' rules"));
(yyvsp[0])->in_rule = rule = BEGIN;
(yyvsp[0])->source_file = source;
check_comment();
(yyval) = (yyvsp[0]);
}
#line 2099 "awkgram.c" /* yacc.c:1646 */
break;
case 22:
#line 371 "awkgram.y" /* yacc.c:1646 */
{
static int end_seen = 0;
func_first = false;
if (do_lint_old && ++end_seen == 2)
warning_ln((yyvsp[0])->source_line,
_("old awk does not support multiple `BEGIN' or `END' rules"));
(yyvsp[0])->in_rule = rule = END;
(yyvsp[0])->source_file = source;
check_comment();
(yyval) = (yyvsp[0]);
}
#line 2117 "awkgram.c" /* yacc.c:1646 */
break;
case 23:
#line 385 "awkgram.y" /* yacc.c:1646 */
{
func_first = false;
(yyvsp[0])->in_rule = rule = BEGINFILE;
(yyvsp[0])->source_file = source;
check_comment();
(yyval) = (yyvsp[0]);
}
#line 2129 "awkgram.c" /* yacc.c:1646 */
break;
case 24:
#line 393 "awkgram.y" /* yacc.c:1646 */
{
func_first = false;
(yyvsp[0])->in_rule = rule = ENDFILE;
(yyvsp[0])->source_file = source;
check_comment();
(yyval) = (yyvsp[0]);
}
#line 2141 "awkgram.c" /* yacc.c:1646 */
break;
case 25:
#line 404 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *ip;
if ((yyvsp[-3]) == NULL)
ip = list_create(instruction(Op_no_op));
else
ip = (yyvsp[-3]);
(yyval) = ip;
}
#line 2154 "awkgram.c" /* yacc.c:1646 */
break;
case 26:
#line 416 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 2160 "awkgram.c" /* yacc.c:1646 */
break;
case 27:
#line 418 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 2166 "awkgram.c" /* yacc.c:1646 */
break;
case 28:
#line 420 "awkgram.y" /* yacc.c:1646 */
{
yyerror(_("`%s' is a built-in function, it cannot be redefined"),
tokstart);
YYABORT;
}
#line 2176 "awkgram.c" /* yacc.c:1646 */
break;
case 29:
#line 426 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = (yyvsp[0]);
at_seen = false;
}
#line 2185 "awkgram.c" /* yacc.c:1646 */
break;
case 32:
#line 438 "awkgram.y" /* yacc.c:1646 */
{ want_param_names = FUNC_HEADER; }
#line 2191 "awkgram.c" /* yacc.c:1646 */
break;
case 33:
#line 439 "awkgram.y" /* yacc.c:1646 */
{
/*
* treat any comments between BOF and the first function
* definition (with no intervening BEGIN etc block) as
* program comments. Special kludge: iff there are more
* than one such comments, treat the last as a function
* comment.
*/
if (prior_comment != NULL) {
comment_to_save = prior_comment;
prior_comment = NULL;
} else if (comment != NULL) {
comment_to_save = comment;
comment = NULL;
} else
comment_to_save = NULL;
if (comment_to_save != NULL && func_first
&& strstr(comment_to_save->memory->stptr, "\n\n") != NULL)
split_comment();
/* save any other pre-function comment as function comment */
if (comment_to_save != NULL) {
function_comment = comment_to_save;
comment_to_save = NULL;
}
func_first = false;
(yyvsp[-6])->source_file = source;
if (install_function((yyvsp[-5])->lextok, (yyvsp[-6]), (yyvsp[-2])) < 0)
YYABORT;
in_function = (yyvsp[-5])->lextok;
(yyvsp[-5])->lextok = NULL;
bcfree((yyvsp[-5]));
/* $5 already free'd in install_function */
(yyval) = (yyvsp[-6]);
want_param_names = FUNC_BODY;
}
#line 2233 "awkgram.c" /* yacc.c:1646 */
break;
case 34:
#line 484 "awkgram.y" /* yacc.c:1646 */
{ want_regexp = true; }
#line 2239 "awkgram.c" /* yacc.c:1646 */
break;
case 35:
#line 486 "awkgram.y" /* yacc.c:1646 */
{
NODE *n, *exp;
char *re;
size_t len;
re = (yyvsp[0])->lextok;
(yyvsp[0])->lextok = NULL;
len = strlen(re);
if (do_lint) {
if (len == 0)
lintwarn_ln((yyvsp[0])->source_line,
_("regexp constant `//' looks like a C++ comment, but is not"));
else if (re[0] == '*' && re[len-1] == '*')
/* possible C comment */
lintwarn_ln((yyvsp[0])->source_line,
_("regexp constant `/%s/' looks like a C comment, but is not"), re);
}
exp = make_str_node(re, len, ALREADY_MALLOCED);
n = make_regnode(Node_regex, exp);
if (n == NULL) {
unref(exp);
YYABORT;
}
(yyval) = (yyvsp[0]);
(yyval)->opcode = Op_match_rec;
(yyval)->memory = n;
}
#line 2272 "awkgram.c" /* yacc.c:1646 */
break;
case 36:
#line 518 "awkgram.y" /* yacc.c:1646 */
{
char *re;
size_t len;
re = (yyvsp[0])->lextok;
(yyvsp[0])->lextok = NULL;
len = strlen(re);
(yyval) = (yyvsp[0]);
(yyval)->opcode = Op_push_re;
(yyval)->memory = make_typed_regex(re, len);
}
#line 2289 "awkgram.c" /* yacc.c:1646 */
break;
case 37:
#line 533 "awkgram.y" /* yacc.c:1646 */
{ bcfree((yyvsp[0])); }
#line 2295 "awkgram.c" /* yacc.c:1646 */
break;
case 39:
#line 539 "awkgram.y" /* yacc.c:1646 */
{
if (prior_comment != NULL) {
(yyval) = list_create(prior_comment);
prior_comment = NULL;
} else if (comment != NULL) {
(yyval) = list_create(comment);
comment = NULL;
} else
(yyval) = NULL;
}
#line 2310 "awkgram.c" /* yacc.c:1646 */
break;
case 40:
#line 550 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[0]) == NULL) {
if (prior_comment != NULL) {
(yyval) = list_append((yyvsp[-1]), prior_comment);
prior_comment = NULL;
if (comment != NULL) {
(yyval) = list_append((yyval), comment);
comment = NULL;
}
} else if (comment != NULL) {
(yyval) = list_append((yyvsp[-1]), comment);
comment = NULL;
} else
(yyval) = (yyvsp[-1]);
} else {
add_lint((yyvsp[0]), LINT_no_effect);
if ((yyvsp[-1]) == NULL) {
if (prior_comment != NULL) {
(yyval) = list_append((yyvsp[0]), prior_comment);
prior_comment = NULL;
if (comment != NULL) {
(yyval) = list_append((yyval), comment);
comment = NULL;
}
} else if (comment != NULL) {
(yyval) = list_append((yyvsp[0]), comment);
comment = NULL;
} else
(yyval) = (yyvsp[0]);
} else {
if (prior_comment != NULL) {
list_append((yyvsp[0]), prior_comment);
prior_comment = NULL;
if (comment != NULL) {
list_append((yyvsp[0]), comment);
comment = NULL;
}
} else if (comment != NULL) {
list_append((yyvsp[0]), comment);
comment = NULL;
}
(yyval) = list_merge((yyvsp[-1]), (yyvsp[0]));
}
}
yyerrok;
}
#line 2361 "awkgram.c" /* yacc.c:1646 */
break;
case 41:
#line 597 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 2367 "awkgram.c" /* yacc.c:1646 */
break;
case 44:
#line 607 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 2373 "awkgram.c" /* yacc.c:1646 */
break;
case 45:
#line 609 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[-1]); }
#line 2379 "awkgram.c" /* yacc.c:1646 */
break;
case 46:
#line 611 "awkgram.y" /* yacc.c:1646 */
{
if (do_pretty_print)
(yyval) = list_prepend((yyvsp[0]), instruction(Op_exec_count));
else
(yyval) = (yyvsp[0]);
}
#line 2390 "awkgram.c" /* yacc.c:1646 */
break;
case 47:
#line 618 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *dflt, *curr = NULL, *cexp, *cstmt;
INSTRUCTION *ip, *nextc, *tbreak;
const char **case_values = NULL;
int maxcount = 128;
int case_count = 0;
int i;
tbreak = instruction(Op_no_op);
cstmt = list_create(tbreak);
cexp = list_create(instruction(Op_pop));
dflt = instruction(Op_jmp);
dflt->target_jmp = tbreak; /* if no case match and no explicit default */
if ((yyvsp[-2]) != NULL) {
curr = (yyvsp[-2])->nexti;
bcfree((yyvsp[-2])); /* Op_list */
} /* else
curr = NULL; */
for (; curr != NULL; curr = nextc) {
INSTRUCTION *caseexp = curr->case_exp;
INSTRUCTION *casestmt = curr->case_stmt;
nextc = curr->nexti;
if (curr->opcode == Op_K_case) {
if (caseexp->opcode == Op_push_i) {
/* a constant scalar */
char *caseval;
caseval = force_string(caseexp->memory)->stptr;
for (i = 0; i < case_count; i++) {
if (strcmp(caseval, case_values[i]) == 0)
error_ln(curr->source_line,
_("duplicate case values in switch body: %s"), caseval);
}
if (case_values == NULL)
emalloc(case_values, const char **, sizeof(char *) * maxcount, "statement");
else if (case_count >= maxcount) {
maxcount += 128;
erealloc(case_values, const char **, sizeof(char*) * maxcount, "statement");
}
case_values[case_count++] = caseval;
} else {
/* match a constant regex against switch expression. */
(curr + 1)->match_exp = true;
}
curr->stmt_start = casestmt->nexti;
curr->stmt_end = casestmt->lasti;
(void) list_prepend(cexp, curr);
(void) list_prepend(cexp, caseexp);
} else {
if (dflt->target_jmp != tbreak)
error_ln(curr->source_line,
_("duplicate `default' detected in switch body"));
else
dflt->target_jmp = casestmt->nexti;
if (do_pretty_print) {
curr->stmt_start = casestmt->nexti;
curr->stmt_end = casestmt->lasti;
(void) list_prepend(cexp, curr);
} else
bcfree(curr);
}
cstmt = list_merge(casestmt, cstmt);
}
if (case_values != NULL)
efree(case_values);
ip = (yyvsp[-6]);
if (do_pretty_print) {
(void) list_prepend(ip, (yyvsp[-8]));
(void) list_prepend(ip, instruction(Op_exec_count));
(yyvsp[-8])->target_break = tbreak;
((yyvsp[-8]) + 1)->switch_start = cexp->nexti;
((yyvsp[-8]) + 1)->switch_end = cexp->lasti;
}/* else
$1 is NULL */
(void) list_append(cexp, dflt);
(void) list_merge(ip, cexp);
(yyval) = list_merge(ip, cstmt);
break_allowed--;
fix_break_continue(ip, tbreak, NULL);
}
#line 2484 "awkgram.c" /* yacc.c:1646 */
break;
case 48:
#line 708 "awkgram.y" /* yacc.c:1646 */
{
/*
* -----------------
* tc:
* cond
* -----------------
* [Op_jmp_false tb ]
* -----------------
* body
* -----------------
* [Op_jmp tc ]
* tb:[Op_no_op ]
*/
INSTRUCTION *ip, *tbreak, *tcont;
tbreak = instruction(Op_no_op);
add_lint((yyvsp[-3]), LINT_assign_in_cond);
tcont = (yyvsp[-3])->nexti;
ip = list_append((yyvsp[-3]), instruction(Op_jmp_false));
ip->lasti->target_jmp = tbreak;
if (do_pretty_print) {
(void) list_append(ip, instruction(Op_exec_count));
(yyvsp[-5])->target_break = tbreak;
(yyvsp[-5])->target_continue = tcont;
((yyvsp[-5]) + 1)->while_body = ip->lasti;
(void) list_prepend(ip, (yyvsp[-5]));
}/* else
$1 is NULL */
if ((yyvsp[0]) != NULL)
(void) list_merge(ip, (yyvsp[0]));
(void) list_append(ip, instruction(Op_jmp));
ip->lasti->target_jmp = tcont;
(yyval) = list_append(ip, tbreak);
break_allowed--;
continue_allowed--;
fix_break_continue(ip, tbreak, tcont);
}
#line 2530 "awkgram.c" /* yacc.c:1646 */
break;
case 49:
#line 750 "awkgram.y" /* yacc.c:1646 */
{
/*
* -----------------
* z:
* body
* -----------------
* tc:
* cond
* -----------------
* [Op_jmp_true | z ]
* tb:[Op_no_op ]
*/
INSTRUCTION *ip, *tbreak, *tcont;
tbreak = instruction(Op_no_op);
tcont = (yyvsp[-2])->nexti;
add_lint((yyvsp[-2]), LINT_assign_in_cond);
if ((yyvsp[-5]) != NULL)
ip = list_merge((yyvsp[-5]), (yyvsp[-2]));
else
ip = list_prepend((yyvsp[-2]), instruction(Op_no_op));
if (do_pretty_print)
(void) list_prepend(ip, instruction(Op_exec_count));
(void) list_append(ip, instruction(Op_jmp_true));
ip->lasti->target_jmp = ip->nexti;
(yyval) = list_append(ip, tbreak);
break_allowed--;
continue_allowed--;
fix_break_continue(ip, tbreak, tcont);
if (do_pretty_print) {
(yyvsp[-7])->target_break = tbreak;
(yyvsp[-7])->target_continue = tcont;
((yyvsp[-7]) + 1)->doloop_cond = tcont;
(yyval) = list_prepend(ip, (yyvsp[-7]));
bcfree((yyvsp[-4]));
} /* else
$1 and $4 are NULLs */
}
#line 2576 "awkgram.c" /* yacc.c:1646 */
break;
case 50:
#line 792 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *ip;
char *var_name = (yyvsp[-5])->lextok;
if ((yyvsp[0]) != NULL
&& (yyvsp[0])->lasti->opcode == Op_K_delete
&& (yyvsp[0])->lasti->expr_count == 1
&& (yyvsp[0])->nexti->opcode == Op_push
&& ((yyvsp[0])->nexti->memory->type != Node_var || !((yyvsp[0])->nexti->memory->var_update))
&& strcmp((yyvsp[0])->nexti->memory->vname, var_name) == 0
) {
/* Efficiency hack. Recognize the special case of
*
* for (iggy in foo)
* delete foo[iggy]
*
* and treat it as if it were
*
* delete foo
*
* Check that the body is a `delete a[i]' statement,
* and that both the loop var and array names match.
*/
NODE *arr = NULL;
ip = (yyvsp[0])->nexti->nexti;
if ((yyvsp[-3])->nexti->opcode == Op_push && (yyvsp[-3])->lasti == (yyvsp[-3])->nexti)
arr = (yyvsp[-3])->nexti->memory;
if (arr != NULL
&& ip->opcode == Op_no_op
&& ip->nexti->opcode == Op_push_array
&& strcmp(ip->nexti->memory->vname, arr->vname) == 0
&& ip->nexti->nexti == (yyvsp[0])->lasti
) {
(void) make_assignable((yyvsp[0])->nexti);
(yyvsp[0])->lasti->opcode = Op_K_delete_loop;
(yyvsp[0])->lasti->expr_count = 0;
if ((yyvsp[-7]) != NULL)
bcfree((yyvsp[-7]));
efree(var_name);
bcfree((yyvsp[-5]));
bcfree((yyvsp[-4]));
bcfree((yyvsp[-3]));
(yyval) = (yyvsp[0]);
} else
goto regular_loop;
} else {
INSTRUCTION *tbreak, *tcont;
/* [ Op_push_array a ]
* [ Op_arrayfor_init | ib ]
* ic:[ Op_arrayfor_incr | ib ]
* [ Op_var_assign if any ]
*
* body
*
* [Op_jmp | ic ]
* ib:[Op_arrayfor_final ]
*/
regular_loop:
ip = (yyvsp[-3]);
ip->nexti->opcode = Op_push_array;
tbreak = instruction(Op_arrayfor_final);
(yyvsp[-4])->opcode = Op_arrayfor_incr;
(yyvsp[-4])->array_var = variable((yyvsp[-5])->source_line, var_name, Node_var);
(yyvsp[-4])->target_jmp = tbreak;
tcont = (yyvsp[-4]);
(yyvsp[-5])->opcode = Op_arrayfor_init;
(yyvsp[-5])->target_jmp = tbreak;
(void) list_append(ip, (yyvsp[-5]));
if (do_pretty_print) {
(yyvsp[-7])->opcode = Op_K_arrayfor;
(yyvsp[-7])->target_continue = tcont;
(yyvsp[-7])->target_break = tbreak;
(void) list_append(ip, (yyvsp[-7]));
} /* else
$1 is NULL */
/* add update_FOO instruction if necessary */
if ((yyvsp[-4])->array_var->type == Node_var && (yyvsp[-4])->array_var->var_update) {
(void) list_append(ip, instruction(Op_var_update));
ip->lasti->update_var = (yyvsp[-4])->array_var->var_update;
}
(void) list_append(ip, (yyvsp[-4]));
/* add set_FOO instruction if necessary */
if ((yyvsp[-4])->array_var->type == Node_var && (yyvsp[-4])->array_var->var_assign) {
(void) list_append(ip, instruction(Op_var_assign));
ip->lasti->assign_var = (yyvsp[-4])->array_var->var_assign;
}
if (do_pretty_print) {
(void) list_append(ip, instruction(Op_exec_count));
((yyvsp[-7]) + 1)->forloop_cond = (yyvsp[-4]);
((yyvsp[-7]) + 1)->forloop_body = ip->lasti;
}
if ((yyvsp[0]) != NULL)
(void) list_merge(ip, (yyvsp[0]));
(void) list_append(ip, instruction(Op_jmp));
ip->lasti->target_jmp = (yyvsp[-4]);
(yyval) = list_append(ip, tbreak);
fix_break_continue(ip, tbreak, tcont);
}
break_allowed--;
continue_allowed--;
}
#line 2693 "awkgram.c" /* yacc.c:1646 */
break;
case 51:
#line 905 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_for_loop((yyvsp[-11]), (yyvsp[-9]), (yyvsp[-6]), (yyvsp[-3]), (yyvsp[0]));
break_allowed--;
continue_allowed--;
}
#line 2704 "awkgram.c" /* yacc.c:1646 */
break;
case 52:
#line 912 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_for_loop((yyvsp[-10]), (yyvsp[-8]), (INSTRUCTION *) NULL, (yyvsp[-3]), (yyvsp[0]));
break_allowed--;
continue_allowed--;
}
#line 2715 "awkgram.c" /* yacc.c:1646 */
break;
case 53:
#line 919 "awkgram.y" /* yacc.c:1646 */
{
if (do_pretty_print)
(yyval) = list_prepend((yyvsp[0]), instruction(Op_exec_count));
else
(yyval) = (yyvsp[0]);
(yyval) = add_pending_comment((yyval));
}
#line 2727 "awkgram.c" /* yacc.c:1646 */
break;
case 54:
#line 930 "awkgram.y" /* yacc.c:1646 */
{
if (! break_allowed)
error_ln((yyvsp[-1])->source_line,
_("`break' is not allowed outside a loop or switch"));
(yyvsp[-1])->target_jmp = NULL;
(yyval) = list_create((yyvsp[-1]));
(yyval) = add_pending_comment((yyval));
}
#line 2741 "awkgram.c" /* yacc.c:1646 */
break;
case 55:
#line 940 "awkgram.y" /* yacc.c:1646 */
{
if (! continue_allowed)
error_ln((yyvsp[-1])->source_line,
_("`continue' is not allowed outside a loop"));
(yyvsp[-1])->target_jmp = NULL;
(yyval) = list_create((yyvsp[-1]));
(yyval) = add_pending_comment((yyval));
}
#line 2755 "awkgram.c" /* yacc.c:1646 */
break;
case 56:
#line 950 "awkgram.y" /* yacc.c:1646 */
{
/* if inside function (rule = 0), resolve context at run-time */
if (rule && rule != Rule)
error_ln((yyvsp[-1])->source_line,
_("`next' used in %s action"), ruletab[rule]);
(yyvsp[-1])->target_jmp = ip_rec;
(yyval) = list_create((yyvsp[-1]));
(yyval) = add_pending_comment((yyval));
}
#line 2769 "awkgram.c" /* yacc.c:1646 */
break;
case 57:
#line 960 "awkgram.y" /* yacc.c:1646 */
{
/* if inside function (rule = 0), resolve context at run-time */
if (rule == BEGIN || rule == END || rule == ENDFILE)
error_ln((yyvsp[-1])->source_line,
_("`nextfile' used in %s action"), ruletab[rule]);
(yyvsp[-1])->target_newfile = ip_newfile;
(yyvsp[-1])->target_endfile = ip_endfile;
(yyval) = list_create((yyvsp[-1]));
(yyval) = add_pending_comment((yyval));
}
#line 2785 "awkgram.c" /* yacc.c:1646 */
break;
case 58:
#line 972 "awkgram.y" /* yacc.c:1646 */
{
/* Initialize the two possible jump targets, the actual target
* is resolved at run-time.
*/
(yyvsp[-2])->target_end = ip_end; /* first instruction in end_block */
(yyvsp[-2])->target_atexit = ip_atexit; /* cleanup and go home */
if ((yyvsp[-1]) == NULL) {
(yyval) = list_create((yyvsp[-2]));
(void) list_prepend((yyval), instruction(Op_push_i));
(yyval)->nexti->memory = dupnode(Nnull_string);
} else
(yyval) = list_append((yyvsp[-1]), (yyvsp[-2]));
(yyval) = add_pending_comment((yyval));
}
#line 2805 "awkgram.c" /* yacc.c:1646 */
break;
case 59:
#line 988 "awkgram.y" /* yacc.c:1646 */
{
if (! in_function)
yyerror(_("`return' used outside function context"));
}
#line 2814 "awkgram.c" /* yacc.c:1646 */
break;
case 60:
#line 991 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-1]) == NULL) {
(yyval) = list_create((yyvsp[-3]));
(void) list_prepend((yyval), instruction(Op_push_i));
(yyval)->nexti->memory = dupnode(Nnull_string);
} else {
if (do_optimize
&& (yyvsp[-1])->lasti->opcode == Op_func_call
&& strcmp((yyvsp[-1])->lasti->func_name, in_function) == 0
) {
/* Do tail recursion optimization. Tail
* call without a return value is recognized
* in mk_function().
*/
((yyvsp[-1])->lasti + 1)->tail_call = true;
}
(yyval) = list_append((yyvsp[-1]), (yyvsp[-3]));
}
(yyval) = add_pending_comment((yyval));
}
#line 2840 "awkgram.c" /* yacc.c:1646 */
break;
case 62:
#line 1024 "awkgram.y" /* yacc.c:1646 */
{ in_print = true; in_parens = 0; }
#line 2846 "awkgram.c" /* yacc.c:1646 */
break;
case 63:
#line 1025 "awkgram.y" /* yacc.c:1646 */
{
/*
* Optimization: plain `print' has no expression list, so $3 is null.
* If $3 is NULL or is a bytecode list for $0 use Op_K_print_rec,
* which is faster for these two cases.
*/
if ((yyvsp[-3])->opcode == Op_K_print &&
((yyvsp[-1]) == NULL
|| ((yyvsp[-1])->lasti->opcode == Op_field_spec
&& (yyvsp[-1])->nexti->nexti->nexti == (yyvsp[-1])->lasti
&& (yyvsp[-1])->nexti->nexti->opcode == Op_push_i
&& (yyvsp[-1])->nexti->nexti->memory->type == Node_val)
)
) {
static bool warned = false;
/* -----------------
* output_redir
* [ redirect exp ]
* -----------------
* expression_list
* ------------------
* [Op_K_print_rec | NULL | redir_type | expr_count]
*/
if ((yyvsp[-1]) != NULL) {
NODE *n = (yyvsp[-1])->nexti->nexti->memory;
if (! iszero(n))
goto regular_print;
bcfree((yyvsp[-1])->lasti); /* Op_field_spec */
unref(n); /* Node_val */
bcfree((yyvsp[-1])->nexti->nexti); /* Op_push_i */
bcfree((yyvsp[-1])->nexti); /* Op_list */
bcfree((yyvsp[-1])); /* Op_list */
} else {
if (do_lint && (rule == BEGIN || rule == END) && ! warned) {
warned = true;
lintwarn_ln((yyvsp[-3])->source_line,
_("plain `print' in BEGIN or END rule should probably be `print \"\"'"));
}
}
(yyvsp[-3])->expr_count = 0;
(yyvsp[-3])->opcode = Op_K_print_rec;
if ((yyvsp[0]) == NULL) { /* no redircetion */
(yyvsp[-3])->redir_type = redirect_none;
(yyval) = list_create((yyvsp[-3]));
} else {
INSTRUCTION *ip;
ip = (yyvsp[0])->nexti;
(yyvsp[-3])->redir_type = ip->redir_type;
(yyvsp[0])->nexti = ip->nexti;
bcfree(ip);
(yyval) = list_append((yyvsp[0]), (yyvsp[-3]));
}
} else {
/* -----------------
* [ output_redir ]
* [ redirect exp ]
* -----------------
* [ expression_list ]
* ------------------
* [$1 | NULL | redir_type | expr_count]
*
*/
regular_print:
if ((yyvsp[0]) == NULL) { /* no redirection */
if ((yyvsp[-1]) == NULL) { /* printf without arg */
(yyvsp[-3])->expr_count = 0;
(yyvsp[-3])->redir_type = redirect_none;
(yyval) = list_create((yyvsp[-3]));
} else {
INSTRUCTION *t = (yyvsp[-1]);
(yyvsp[-3])->expr_count = count_expressions(&t, false);
(yyvsp[-3])->redir_type = redirect_none;
(yyval) = list_append(t, (yyvsp[-3]));
}
} else {
INSTRUCTION *ip;
ip = (yyvsp[0])->nexti;
(yyvsp[-3])->redir_type = ip->redir_type;
(yyvsp[0])->nexti = ip->nexti;
bcfree(ip);
if ((yyvsp[-1]) == NULL) {
(yyvsp[-3])->expr_count = 0;
(yyval) = list_append((yyvsp[0]), (yyvsp[-3]));
} else {
INSTRUCTION *t = (yyvsp[-1]);
(yyvsp[-3])->expr_count = count_expressions(&t, false);
(yyval) = list_append(list_merge((yyvsp[0]), t), (yyvsp[-3]));
}
}
}
(yyval) = add_pending_comment((yyval));
}
#line 2948 "awkgram.c" /* yacc.c:1646 */
break;
case 64:
#line 1123 "awkgram.y" /* yacc.c:1646 */
{ sub_counter = 0; }
#line 2954 "awkgram.c" /* yacc.c:1646 */
break;
case 65:
#line 1124 "awkgram.y" /* yacc.c:1646 */
{
char *arr = (yyvsp[-2])->lextok;
(yyvsp[-2])->opcode = Op_push_array;
(yyvsp[-2])->memory = variable((yyvsp[-2])->source_line, arr, Node_var_new);
if (! do_posix && ! do_traditional) {
if ((yyvsp[-2])->memory == symbol_table)
fatal(_("`delete' is not allowed with SYMTAB"));
else if ((yyvsp[-2])->memory == func_table)
fatal(_("`delete' is not allowed with FUNCTAB"));
}
if ((yyvsp[0]) == NULL) {
/*
* As of September 2012, POSIX has added support
* for `delete array'. See:
* http://austingroupbugs.net/view.php?id=544
*
* Thanks to Nathan Weeks for the initiative.
*
* Thus we no longer warn or check do_posix.
* Also, since BWK awk supports it, we don't have to
* check do_traditional either.
*/
(yyvsp[-3])->expr_count = 0;
(yyval) = list_append(list_create((yyvsp[-2])), (yyvsp[-3]));
} else {
(yyvsp[-3])->expr_count = sub_counter;
(yyval) = list_append(list_append((yyvsp[0]), (yyvsp[-2])), (yyvsp[-3]));
}
(yyval) = add_pending_comment((yyval));
}
#line 2992 "awkgram.c" /* yacc.c:1646 */
break;
case 66:
#line 1162 "awkgram.y" /* yacc.c:1646 */
{
static bool warned = false;
char *arr = (yyvsp[-1])->lextok;
if (do_lint && ! warned) {
warned = true;
lintwarn_ln((yyvsp[-3])->source_line,
_("`delete(array)' is a non-portable tawk extension"));
}
if (do_traditional) {
error_ln((yyvsp[-3])->source_line,
_("`delete(array)' is a non-portable tawk extension"));
}
(yyvsp[-1])->memory = variable((yyvsp[-1])->source_line, arr, Node_var_new);
(yyvsp[-1])->opcode = Op_push_array;
(yyvsp[-3])->expr_count = 0;
(yyval) = list_append(list_create((yyvsp[-1])), (yyvsp[-3]));
if (! do_posix && ! do_traditional) {
if ((yyvsp[-1])->memory == symbol_table)
fatal(_("`delete' is not allowed with SYMTAB"));
else if ((yyvsp[-1])->memory == func_table)
fatal(_("`delete' is not allowed with FUNCTAB"));
}
(yyval) = add_pending_comment((yyval));
}
#line 3023 "awkgram.c" /* yacc.c:1646 */
break;
case 67:
#line 1189 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = optimize_assignment((yyvsp[0]));
(yyval) = add_pending_comment((yyval));
}
#line 3032 "awkgram.c" /* yacc.c:1646 */
break;
case 68:
#line 1197 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3038 "awkgram.c" /* yacc.c:1646 */
break;
case 69:
#line 1199 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3044 "awkgram.c" /* yacc.c:1646 */
break;
case 70:
#line 1204 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3050 "awkgram.c" /* yacc.c:1646 */
break;
case 71:
#line 1206 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-1]) == NULL)
(yyval) = list_create((yyvsp[0]));
else
(yyval) = list_prepend((yyvsp[-1]), (yyvsp[0]));
}
#line 3061 "awkgram.c" /* yacc.c:1646 */
break;
case 72:
#line 1213 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3067 "awkgram.c" /* yacc.c:1646 */
break;
case 73:
#line 1218 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *casestmt = (yyvsp[0]);
if ((yyvsp[0]) == NULL)
casestmt = list_create(instruction(Op_no_op));
if (do_pretty_print)
(void) list_prepend(casestmt, instruction(Op_exec_count));
(yyvsp[-4])->case_exp = (yyvsp[-3]);
(yyvsp[-4])->case_stmt = casestmt;
bcfree((yyvsp[-2]));
(yyval) = (yyvsp[-4]);
}
#line 3083 "awkgram.c" /* yacc.c:1646 */
break;
case 74:
#line 1230 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *casestmt = (yyvsp[0]);
if ((yyvsp[0]) == NULL)
casestmt = list_create(instruction(Op_no_op));
if (do_pretty_print)
(void) list_prepend(casestmt, instruction(Op_exec_count));
bcfree((yyvsp[-2]));
(yyvsp[-3])->case_stmt = casestmt;
(yyval) = (yyvsp[-3]);
}
#line 3098 "awkgram.c" /* yacc.c:1646 */
break;
case 75:
#line 1244 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3104 "awkgram.c" /* yacc.c:1646 */
break;
case 76:
#line 1246 "awkgram.y" /* yacc.c:1646 */
{
NODE *n = (yyvsp[0])->memory;
(void) force_number(n);
negate_num(n);
bcfree((yyvsp[-1]));
(yyval) = (yyvsp[0]);
}
#line 3116 "awkgram.c" /* yacc.c:1646 */
break;
case 77:
#line 1254 "awkgram.y" /* yacc.c:1646 */
{
NODE *n = (yyvsp[0])->lasti->memory;
bcfree((yyvsp[-1]));
add_sign_to_num(n, '+');
(yyval) = (yyvsp[0]);
}
#line 3127 "awkgram.c" /* yacc.c:1646 */
break;
case 78:
#line 1261 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3133 "awkgram.c" /* yacc.c:1646 */
break;
case 79:
#line 1263 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[0])->memory->type == Node_regex)
(yyvsp[0])->opcode = Op_push_re;
else
(yyvsp[0])->opcode = Op_push;
(yyval) = (yyvsp[0]);
}
#line 3145 "awkgram.c" /* yacc.c:1646 */
break;
case 80:
#line 1271 "awkgram.y" /* yacc.c:1646 */
{
assert(((yyvsp[0])->memory->flags & REGEX) == REGEX);
(yyvsp[0])->opcode = Op_push_re;
(yyval) = (yyvsp[0]);
}
#line 3155 "awkgram.c" /* yacc.c:1646 */
break;
case 81:
#line 1280 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3161 "awkgram.c" /* yacc.c:1646 */
break;
case 82:
#line 1282 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3167 "awkgram.c" /* yacc.c:1646 */
break;
case 84:
#line 1292 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = (yyvsp[-1]);
}
#line 3175 "awkgram.c" /* yacc.c:1646 */
break;
case 85:
#line 1299 "awkgram.y" /* yacc.c:1646 */
{
in_print = false;
in_parens = 0;
(yyval) = NULL;
}
#line 3185 "awkgram.c" /* yacc.c:1646 */
break;
case 86:
#line 1304 "awkgram.y" /* yacc.c:1646 */
{ in_print = false; in_parens = 0; }
#line 3191 "awkgram.c" /* yacc.c:1646 */
break;
case 87:
#line 1305 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-2])->redir_type == redirect_twoway
&& (yyvsp[0])->lasti->opcode == Op_K_getline_redir
&& (yyvsp[0])->lasti->redir_type == redirect_twoway)
yyerror(_("multistage two-way pipelines don't work"));
(yyval) = list_prepend((yyvsp[0]), (yyvsp[-2]));
}
#line 3203 "awkgram.c" /* yacc.c:1646 */
break;
case 88:
#line 1316 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_condition((yyvsp[-3]), (yyvsp[-5]), (yyvsp[0]), NULL, NULL);
}
#line 3211 "awkgram.c" /* yacc.c:1646 */
break;
case 89:
#line 1321 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_condition((yyvsp[-6]), (yyvsp[-8]), (yyvsp[-3]), (yyvsp[-2]), (yyvsp[0]));
}
#line 3219 "awkgram.c" /* yacc.c:1646 */
break;
case 94:
#line 1338 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3225 "awkgram.c" /* yacc.c:1646 */
break;
case 95:
#line 1340 "awkgram.y" /* yacc.c:1646 */
{
bcfree((yyvsp[-1]));
(yyval) = (yyvsp[0]);
}
#line 3234 "awkgram.c" /* yacc.c:1646 */
break;
case 96:
#line 1348 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3240 "awkgram.c" /* yacc.c:1646 */
break;
case 97:
#line 1350 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3246 "awkgram.c" /* yacc.c:1646 */
break;
case 98:
#line 1355 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->param_count = 0;
(yyval) = list_create((yyvsp[0]));
}
#line 3255 "awkgram.c" /* yacc.c:1646 */
break;
case 99:
#line 1360 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-2]) != NULL && (yyvsp[0]) != NULL) {
(yyvsp[0])->param_count = (yyvsp[-2])->lasti->param_count + 1;
(yyval) = list_append((yyvsp[-2]), (yyvsp[0]));
yyerrok;
} else
(yyval) = NULL;
}
#line 3268 "awkgram.c" /* yacc.c:1646 */
break;
case 100:
#line 1369 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3274 "awkgram.c" /* yacc.c:1646 */
break;
case 101:
#line 1371 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[-1]); }
#line 3280 "awkgram.c" /* yacc.c:1646 */
break;
case 102:
#line 1373 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[-2]); }
#line 3286 "awkgram.c" /* yacc.c:1646 */
break;
case 103:
#line 1379 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3292 "awkgram.c" /* yacc.c:1646 */
break;
case 104:
#line 1381 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3298 "awkgram.c" /* yacc.c:1646 */
break;
case 105:
#line 1386 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3304 "awkgram.c" /* yacc.c:1646 */
break;
case 106:
#line 1388 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3310 "awkgram.c" /* yacc.c:1646 */
break;
case 107:
#line 1393 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_expression_list(NULL, (yyvsp[0])); }
#line 3316 "awkgram.c" /* yacc.c:1646 */
break;
case 108:
#line 1395 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_expression_list((yyvsp[-2]), (yyvsp[0]));
yyerrok;
}
#line 3325 "awkgram.c" /* yacc.c:1646 */
break;
case 109:
#line 1400 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3331 "awkgram.c" /* yacc.c:1646 */
break;
case 110:
#line 1402 "awkgram.y" /* yacc.c:1646 */
{
/*
* Returning the expression list instead of NULL lets
* snode get a list of arguments that it can count.
*/
(yyval) = (yyvsp[-1]);
}
#line 3343 "awkgram.c" /* yacc.c:1646 */
break;
case 111:
#line 1410 "awkgram.y" /* yacc.c:1646 */
{
/* Ditto */
(yyval) = mk_expression_list((yyvsp[-2]), (yyvsp[0]));
}
#line 3352 "awkgram.c" /* yacc.c:1646 */
break;
case 112:
#line 1415 "awkgram.y" /* yacc.c:1646 */
{
/* Ditto */
(yyval) = (yyvsp[-2]);
}
#line 3361 "awkgram.c" /* yacc.c:1646 */
break;
case 113:
#line 1423 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3367 "awkgram.c" /* yacc.c:1646 */
break;
case 114:
#line 1425 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3373 "awkgram.c" /* yacc.c:1646 */
break;
case 115:
#line 1430 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_expression_list(NULL, (yyvsp[0])); }
#line 3379 "awkgram.c" /* yacc.c:1646 */
break;
case 116:
#line 1432 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_expression_list((yyvsp[-2]), (yyvsp[0]));
yyerrok;
}
#line 3388 "awkgram.c" /* yacc.c:1646 */
break;
case 117:
#line 1437 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 3394 "awkgram.c" /* yacc.c:1646 */
break;
case 118:
#line 1439 "awkgram.y" /* yacc.c:1646 */
{
/*
* Returning the expression list instead of NULL lets
* snode get a list of arguments that it can count.
*/
(yyval) = (yyvsp[-1]);
}
#line 3406 "awkgram.c" /* yacc.c:1646 */
break;
case 119:
#line 1447 "awkgram.y" /* yacc.c:1646 */
{
/* Ditto */
(yyval) = mk_expression_list((yyvsp[-2]), (yyvsp[0]));
}
#line 3415 "awkgram.c" /* yacc.c:1646 */
break;
case 120:
#line 1452 "awkgram.y" /* yacc.c:1646 */
{
/* Ditto */
(yyval) = (yyvsp[-2]);
}
#line 3424 "awkgram.c" /* yacc.c:1646 */
break;
case 121:
#line 1459 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3430 "awkgram.c" /* yacc.c:1646 */
break;
case 122:
#line 1460 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = list_create((yyvsp[0])); }
#line 3436 "awkgram.c" /* yacc.c:1646 */
break;
case 123:
#line 1466 "awkgram.y" /* yacc.c:1646 */
{
if (do_lint && (yyvsp[0])->lasti->opcode == Op_match_rec)
lintwarn_ln((yyvsp[-1])->source_line,
_("regular expression on right of assignment"));
(yyval) = mk_assignment((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1]));
}
#line 3447 "awkgram.c" /* yacc.c:1646 */
break;
case 124:
#line 1473 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_assignment((yyvsp[-2]), list_create((yyvsp[0])), (yyvsp[-1]));
}
#line 3455 "awkgram.c" /* yacc.c:1646 */
break;
case 125:
#line 1477 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_boolean((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3461 "awkgram.c" /* yacc.c:1646 */
break;
case 126:
#line 1479 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_boolean((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3467 "awkgram.c" /* yacc.c:1646 */
break;
case 127:
#line 1481 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-2])->lasti->opcode == Op_match_rec)
warning_ln((yyvsp[-1])->source_line,
_("regular expression on left of `~' or `!~' operator"));
assert((yyvsp[0])->opcode == Op_push_re
&& ((yyvsp[0])->memory->flags & REGEX) != 0);
/* RHS is @/.../ */
(yyvsp[-1])->memory = (yyvsp[0])->memory;
bcfree((yyvsp[0]));
(yyval) = list_append((yyvsp[-2]), (yyvsp[-1]));
}
#line 3484 "awkgram.c" /* yacc.c:1646 */
break;
case 128:
#line 1494 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[-2])->lasti->opcode == Op_match_rec)
warning_ln((yyvsp[-1])->source_line,
_("regular expression on left of `~' or `!~' operator"));
if ((yyvsp[0])->lasti == (yyvsp[0])->nexti && (yyvsp[0])->nexti->opcode == Op_match_rec) {
/* RHS is /.../ */
(yyvsp[-1])->memory = (yyvsp[0])->nexti->memory;
bcfree((yyvsp[0])->nexti); /* Op_match_rec */
bcfree((yyvsp[0])); /* Op_list */
(yyval) = list_append((yyvsp[-2]), (yyvsp[-1]));
} else {
(yyvsp[-1])->memory = make_regnode(Node_dynregex, NULL);
(yyval) = list_append(list_merge((yyvsp[-2]), (yyvsp[0])), (yyvsp[-1]));
}
}
#line 3505 "awkgram.c" /* yacc.c:1646 */
break;
case 129:
#line 1511 "awkgram.y" /* yacc.c:1646 */
{
if (do_lint_old)
warning_ln((yyvsp[-1])->source_line,
_("old awk does not support the keyword `in' except after `for'"));
(yyvsp[0])->nexti->opcode = Op_push_array;
(yyvsp[-1])->opcode = Op_in_array;
(yyvsp[-1])->expr_count = 1;
(yyval) = list_append(list_merge((yyvsp[-2]), (yyvsp[0])), (yyvsp[-1]));
}
#line 3519 "awkgram.c" /* yacc.c:1646 */
break;
case 130:
#line 1521 "awkgram.y" /* yacc.c:1646 */
{
if (do_lint && (yyvsp[0])->lasti->opcode == Op_match_rec)
lintwarn_ln((yyvsp[-1])->source_line,
_("regular expression on right of comparison"));
(yyval) = list_append(list_merge((yyvsp[-2]), (yyvsp[0])), (yyvsp[-1]));
}
#line 3530 "awkgram.c" /* yacc.c:1646 */
break;
case 131:
#line 1528 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_condition((yyvsp[-4]), (yyvsp[-3]), (yyvsp[-2]), (yyvsp[-1]), (yyvsp[0])); }
#line 3536 "awkgram.c" /* yacc.c:1646 */
break;
case 132:
#line 1530 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3542 "awkgram.c" /* yacc.c:1646 */
break;
case 133:
#line 1535 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3548 "awkgram.c" /* yacc.c:1646 */
break;
case 134:
#line 1537 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3554 "awkgram.c" /* yacc.c:1646 */
break;
case 135:
#line 1539 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->opcode = Op_assign_quotient;
(yyval) = (yyvsp[0]);
}
#line 3563 "awkgram.c" /* yacc.c:1646 */
break;
case 136:
#line 1547 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3569 "awkgram.c" /* yacc.c:1646 */
break;
case 137:
#line 1549 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3575 "awkgram.c" /* yacc.c:1646 */
break;
case 138:
#line 1554 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3581 "awkgram.c" /* yacc.c:1646 */
break;
case 139:
#line 1556 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3587 "awkgram.c" /* yacc.c:1646 */
break;
case 140:
#line 1561 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3593 "awkgram.c" /* yacc.c:1646 */
break;
case 141:
#line 1563 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 3599 "awkgram.c" /* yacc.c:1646 */
break;
case 142:
#line 1565 "awkgram.y" /* yacc.c:1646 */
{
int count = 2;
bool is_simple_var = false;
if ((yyvsp[-1])->lasti->opcode == Op_concat) {
/* multiple (> 2) adjacent strings optimization */
is_simple_var = ((yyvsp[-1])->lasti->concat_flag & CSVAR) != 0;
count = (yyvsp[-1])->lasti->expr_count + 1;
(yyvsp[-1])->lasti->opcode = Op_no_op;
} else {
is_simple_var = ((yyvsp[-1])->nexti->opcode == Op_push
&& (yyvsp[-1])->lasti == (yyvsp[-1])->nexti); /* first exp. is a simple
* variable?; kludge for use
* in Op_assign_concat.
*/
}
if (do_optimize
&& (yyvsp[-1])->nexti == (yyvsp[-1])->lasti && (yyvsp[-1])->nexti->opcode == Op_push_i
&& (yyvsp[0])->nexti == (yyvsp[0])->lasti && (yyvsp[0])->nexti->opcode == Op_push_i
) {
NODE *n1 = (yyvsp[-1])->nexti->memory;
NODE *n2 = (yyvsp[0])->nexti->memory;
size_t nlen;
// 1.5 "" # can't fold this if program mucks with CONVFMT.
// See test #12 in test/posix.awk.
// Also can't fold if one or the other is translatable.
if ((n1->flags & (NUMBER|NUMINT|INTLSTR)) != 0 || (n2->flags & (NUMBER|NUMINT|INTLSTR)) != 0)
goto plain_concat;
n1 = force_string(n1);
n2 = force_string(n2);
nlen = n1->stlen + n2->stlen;
erealloc(n1->stptr, char *, nlen + 1, "constant fold");
memcpy(n1->stptr + n1->stlen, n2->stptr, n2->stlen);
n1->stlen = nlen;
n1->stptr[nlen] = '\0';
n1->flags &= ~(NUMCUR|NUMBER|NUMINT);
n1->flags |= (STRING|STRCUR);
unref(n2);
bcfree((yyvsp[0])->nexti);
bcfree((yyvsp[0]));
(yyval) = (yyvsp[-1]);
} else {
plain_concat:
(yyval) = list_append(list_merge((yyvsp[-1]), (yyvsp[0])), instruction(Op_concat));
(yyval)->lasti->concat_flag = (is_simple_var ? CSVAR : 0);
(yyval)->lasti->expr_count = count;
if (count > max_args)
max_args = count;
}
}
#line 3657 "awkgram.c" /* yacc.c:1646 */
break;
case 144:
#line 1624 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3663 "awkgram.c" /* yacc.c:1646 */
break;
case 145:
#line 1626 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3669 "awkgram.c" /* yacc.c:1646 */
break;
case 146:
#line 1628 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3675 "awkgram.c" /* yacc.c:1646 */
break;
case 147:
#line 1630 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3681 "awkgram.c" /* yacc.c:1646 */
break;
case 148:
#line 1632 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3687 "awkgram.c" /* yacc.c:1646 */
break;
case 149:
#line 1634 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3693 "awkgram.c" /* yacc.c:1646 */
break;
case 150:
#line 1636 "awkgram.y" /* yacc.c:1646 */
{
/*
* In BEGINFILE/ENDFILE, allow `getline [var] < file'
*/
if ((rule == BEGINFILE || rule == ENDFILE) && (yyvsp[0]) == NULL)
error_ln((yyvsp[-2])->source_line,
_("non-redirected `getline' invalid inside `%s' rule"), ruletab[rule]);
if (do_lint && rule == END && (yyvsp[0]) == NULL)
lintwarn_ln((yyvsp[-2])->source_line,
_("non-redirected `getline' undefined inside END action"));
(yyval) = mk_getline((yyvsp[-2]), (yyvsp[-1]), (yyvsp[0]), redirect_input);
}
#line 3711 "awkgram.c" /* yacc.c:1646 */
break;
case 151:
#line 1650 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->opcode = Op_postincrement;
(yyval) = mk_assignment((yyvsp[-1]), NULL, (yyvsp[0]));
}
#line 3720 "awkgram.c" /* yacc.c:1646 */
break;
case 152:
#line 1655 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->opcode = Op_postdecrement;
(yyval) = mk_assignment((yyvsp[-1]), NULL, (yyvsp[0]));
}
#line 3729 "awkgram.c" /* yacc.c:1646 */
break;
case 153:
#line 1660 "awkgram.y" /* yacc.c:1646 */
{
if (do_lint_old) {
warning_ln((yyvsp[-1])->source_line,
_("old awk does not support the keyword `in' except after `for'"));
warning_ln((yyvsp[-1])->source_line,
_("old awk does not support multidimensional arrays"));
}
(yyvsp[0])->nexti->opcode = Op_push_array;
(yyvsp[-1])->opcode = Op_in_array;
if ((yyvsp[-3]) == NULL) { /* error */
errcount++;
(yyvsp[-1])->expr_count = 0;
(yyval) = list_merge((yyvsp[0]), (yyvsp[-1]));
} else {
INSTRUCTION *t = (yyvsp[-3]);
(yyvsp[-1])->expr_count = count_expressions(&t, false);
(yyval) = list_append(list_merge(t, (yyvsp[0])), (yyvsp[-1]));
}
}
#line 3753 "awkgram.c" /* yacc.c:1646 */
break;
case 154:
#line 1685 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = mk_getline((yyvsp[-1]), (yyvsp[0]), (yyvsp[-3]), (yyvsp[-2])->redir_type);
bcfree((yyvsp[-2]));
}
#line 3762 "awkgram.c" /* yacc.c:1646 */
break;
case 155:
#line 1691 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3768 "awkgram.c" /* yacc.c:1646 */
break;
case 156:
#line 1693 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3774 "awkgram.c" /* yacc.c:1646 */
break;
case 157:
#line 1695 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3780 "awkgram.c" /* yacc.c:1646 */
break;
case 158:
#line 1697 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3786 "awkgram.c" /* yacc.c:1646 */
break;
case 159:
#line 1699 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3792 "awkgram.c" /* yacc.c:1646 */
break;
case 160:
#line 1701 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = mk_binary((yyvsp[-2]), (yyvsp[0]), (yyvsp[-1])); }
#line 3798 "awkgram.c" /* yacc.c:1646 */
break;
case 161:
#line 1706 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_create((yyvsp[0]));
}
#line 3806 "awkgram.c" /* yacc.c:1646 */
break;
case 162:
#line 1710 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[0])->opcode == Op_match_rec) {
(yyvsp[0])->opcode = Op_nomatch;
(yyvsp[-1])->opcode = Op_push_i;
(yyvsp[-1])->memory = set_profile_text(make_number(0.0), "0", 1);
(yyval) = list_append(list_append(list_create((yyvsp[-1])),
instruction(Op_field_spec)), (yyvsp[0]));
} else {
if (do_optimize && (yyvsp[0])->nexti == (yyvsp[0])->lasti
&& (yyvsp[0])->nexti->opcode == Op_push_i
&& ((yyvsp[0])->nexti->memory->flags & (MPFN|MPZN|INTLSTR)) == 0
) {
NODE *n = (yyvsp[0])->nexti->memory;
if ((n->flags & STRING) != 0) {
n->numbr = (AWKNUM) (n->stlen == 0);
n->flags &= ~(STRCUR|STRING);
n->flags |= (NUMCUR|NUMBER);
efree(n->stptr);
n->stptr = NULL;
n->stlen = 0;
} else
n->numbr = (AWKNUM) (n->numbr == 0.0);
bcfree((yyvsp[-1]));
(yyval) = (yyvsp[0]);
} else {
(yyvsp[-1])->opcode = Op_not;
add_lint((yyvsp[0]), LINT_assign_in_cond);
(yyval) = list_append((yyvsp[0]), (yyvsp[-1]));
}
}
}
#line 3842 "awkgram.c" /* yacc.c:1646 */
break;
case 163:
#line 1742 "awkgram.y" /* yacc.c:1646 */
{
if (do_pretty_print)
(yyval) = list_append((yyvsp[-1]), bcalloc(Op_parens, 1, sourceline));
else
(yyval) = (yyvsp[-1]);
}
#line 3853 "awkgram.c" /* yacc.c:1646 */
break;
case 164:
#line 1749 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = snode((yyvsp[-1]), (yyvsp[-3]));
if ((yyval) == NULL)
YYABORT;
}
#line 3863 "awkgram.c" /* yacc.c:1646 */
break;
case 165:
#line 1755 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = snode((yyvsp[-1]), (yyvsp[-3]));
if ((yyval) == NULL)
YYABORT;
}
#line 3873 "awkgram.c" /* yacc.c:1646 */
break;
case 166:
#line 1761 "awkgram.y" /* yacc.c:1646 */
{
static bool warned = false;
if (do_lint && ! warned) {
warned = true;
lintwarn_ln((yyvsp[0])->source_line,
_("call of `length' without parentheses is not portable"));
}
(yyval) = snode(NULL, (yyvsp[0]));
if ((yyval) == NULL)
YYABORT;
}
#line 3890 "awkgram.c" /* yacc.c:1646 */
break;
case 169:
#line 1776 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[-1])->opcode = Op_preincrement;
(yyval) = mk_assignment((yyvsp[0]), NULL, (yyvsp[-1]));
}
#line 3899 "awkgram.c" /* yacc.c:1646 */
break;
case 170:
#line 1781 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[-1])->opcode = Op_predecrement;
(yyval) = mk_assignment((yyvsp[0]), NULL, (yyvsp[-1]));
}
#line 3908 "awkgram.c" /* yacc.c:1646 */
break;
case 171:
#line 1786 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_create((yyvsp[0]));
}
#line 3916 "awkgram.c" /* yacc.c:1646 */
break;
case 172:
#line 1790 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_create((yyvsp[0]));
}
#line 3924 "awkgram.c" /* yacc.c:1646 */
break;
case 173:
#line 1794 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[0])->lasti->opcode == Op_push_i
&& ((yyvsp[0])->lasti->memory->flags & STRING) == 0
) {
NODE *n = (yyvsp[0])->lasti->memory;
(void) force_number(n);
negate_num(n);
(yyval) = (yyvsp[0]);
bcfree((yyvsp[-1]));
} else {
(yyvsp[-1])->opcode = Op_unary_minus;
(yyval) = list_append((yyvsp[0]), (yyvsp[-1]));
}
}
#line 3943 "awkgram.c" /* yacc.c:1646 */
break;
case 174:
#line 1809 "awkgram.y" /* yacc.c:1646 */
{
if ((yyvsp[0])->lasti->opcode == Op_push_i
&& ((yyvsp[0])->lasti->memory->flags & STRING) == 0
&& ((yyvsp[0])->lasti->memory->flags & NUMCONSTSTR) != 0) {
NODE *n = (yyvsp[0])->lasti->memory;
add_sign_to_num(n, '+');
(yyval) = (yyvsp[0]);
bcfree((yyvsp[-1]));
} else {
/*
* was: $$ = $2
* POSIX semantics: force a conversion to numeric type
*/
(yyvsp[-1])->opcode = Op_unary_plus;
(yyval) = list_append((yyvsp[0]), (yyvsp[-1]));
}
}
#line 3965 "awkgram.c" /* yacc.c:1646 */
break;
case 175:
#line 1830 "awkgram.y" /* yacc.c:1646 */
{
func_use((yyvsp[0])->lasti->func_name, FUNC_USE);
(yyval) = (yyvsp[0]);
}
#line 3974 "awkgram.c" /* yacc.c:1646 */
break;
case 176:
#line 1835 "awkgram.y" /* yacc.c:1646 */
{
/* indirect function call */
INSTRUCTION *f, *t;
char *name;
NODE *indirect_var;
static bool warned = false;
const char *msg = _("indirect function calls are a gawk extension");
if (do_traditional || do_posix)
yyerror("%s", msg);
else if (do_lint && ! warned) {
warned = true;
lintwarn("%s", msg);
}
f = (yyvsp[0])->lasti;
f->opcode = Op_indirect_func_call;
name = estrdup(f->func_name, strlen(f->func_name));
if (is_std_var(name))
yyerror(_("can not use special variable `%s' for indirect function call"), name);
indirect_var = variable(f->source_line, name, Node_var_new);
t = instruction(Op_push);
t->memory = indirect_var;
/* prepend indirect var instead of appending to arguments (opt_expression_list),
* and pop it off in setup_frame (eval.c) (left to right evaluation order); Test case:
* f = "fun"
* @f(f="real_fun")
*/
(yyval) = list_prepend((yyvsp[0]), t);
at_seen = false;
}
#line 4012 "awkgram.c" /* yacc.c:1646 */
break;
case 177:
#line 1872 "awkgram.y" /* yacc.c:1646 */
{
NODE *n;
if (! at_seen) {
n = lookup((yyvsp[-3])->func_name);
if (n != NULL && n->type != Node_func
&& n->type != Node_ext_func) {
error_ln((yyvsp[-3])->source_line,
_("attempt to use non-function `%s' in function call"),
(yyvsp[-3])->func_name);
}
}
param_sanity((yyvsp[-1]));
(yyvsp[-3])->opcode = Op_func_call;
(yyvsp[-3])->func_body = NULL;
if ((yyvsp[-1]) == NULL) { /* no argument or error */
((yyvsp[-3]) + 1)->expr_count = 0;
(yyval) = list_create((yyvsp[-3]));
} else {
INSTRUCTION *t = (yyvsp[-1]);
((yyvsp[-3]) + 1)->expr_count = count_expressions(&t, true);
(yyval) = list_append(t, (yyvsp[-3]));
}
}
#line 4041 "awkgram.c" /* yacc.c:1646 */
break;
case 178:
#line 1900 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 4047 "awkgram.c" /* yacc.c:1646 */
break;
case 179:
#line 1902 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 4053 "awkgram.c" /* yacc.c:1646 */
break;
case 180:
#line 1907 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 4059 "awkgram.c" /* yacc.c:1646 */
break;
case 181:
#line 1909 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[-1]); }
#line 4065 "awkgram.c" /* yacc.c:1646 */
break;
case 182:
#line 1914 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 4071 "awkgram.c" /* yacc.c:1646 */
break;
case 183:
#line 1916 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_merge((yyvsp[-1]), (yyvsp[0]));
}
#line 4079 "awkgram.c" /* yacc.c:1646 */
break;
case 184:
#line 1923 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *ip = (yyvsp[0])->lasti;
int count = ip->sub_count; /* # of SUBSEP-seperated expressions */
if (count > 1) {
/* change Op_subscript or Op_sub_array to Op_concat */
ip->opcode = Op_concat;
ip->concat_flag = CSUBSEP;
ip->expr_count = count;
} else
ip->opcode = Op_no_op;
sub_counter++; /* count # of dimensions */
(yyval) = (yyvsp[0]);
}
#line 4097 "awkgram.c" /* yacc.c:1646 */
break;
case 185:
#line 1940 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *t = (yyvsp[-1]);
if ((yyvsp[-1]) == NULL) {
error_ln((yyvsp[0])->source_line,
_("invalid subscript expression"));
/* install Null string as subscript. */
t = list_create(instruction(Op_push_i));
t->nexti->memory = dupnode(Nnull_string);
(yyvsp[0])->sub_count = 1;
} else
(yyvsp[0])->sub_count = count_expressions(&t, false);
(yyval) = list_append(t, (yyvsp[0]));
}
#line 4115 "awkgram.c" /* yacc.c:1646 */
break;
case 186:
#line 1957 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); }
#line 4121 "awkgram.c" /* yacc.c:1646 */
break;
case 187:
#line 1959 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_merge((yyvsp[-1]), (yyvsp[0]));
}
#line 4129 "awkgram.c" /* yacc.c:1646 */
break;
case 188:
#line 1966 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[-1]); }
#line 4135 "awkgram.c" /* yacc.c:1646 */
break;
case 189:
#line 1971 "awkgram.y" /* yacc.c:1646 */
{
char *var_name = (yyvsp[0])->lextok;
(yyvsp[0])->opcode = Op_push;
(yyvsp[0])->memory = variable((yyvsp[0])->source_line, var_name, Node_var_new);
(yyval) = list_create((yyvsp[0]));
}
#line 4147 "awkgram.c" /* yacc.c:1646 */
break;
case 190:
#line 1979 "awkgram.y" /* yacc.c:1646 */
{
char *arr = (yyvsp[-1])->lextok;
(yyvsp[-1])->memory = variable((yyvsp[-1])->source_line, arr, Node_var_new);
(yyvsp[-1])->opcode = Op_push_array;
(yyval) = list_prepend((yyvsp[0]), (yyvsp[-1]));
}
#line 4158 "awkgram.c" /* yacc.c:1646 */
break;
case 191:
#line 1989 "awkgram.y" /* yacc.c:1646 */
{
INSTRUCTION *ip = (yyvsp[0])->nexti;
if (ip->opcode == Op_push
&& ip->memory->type == Node_var
&& ip->memory->var_update
) {
(yyval) = list_prepend((yyvsp[0]), instruction(Op_var_update));
(yyval)->nexti->update_var = ip->memory->var_update;
} else
(yyval) = (yyvsp[0]);
}
#line 4174 "awkgram.c" /* yacc.c:1646 */
break;
case 192:
#line 2001 "awkgram.y" /* yacc.c:1646 */
{
(yyval) = list_append((yyvsp[-1]), (yyvsp[-2]));
if ((yyvsp[0]) != NULL)
mk_assignment((yyvsp[-1]), NULL, (yyvsp[0]));
}
#line 4184 "awkgram.c" /* yacc.c:1646 */
break;
case 193:
#line 2010 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->opcode = Op_postincrement;
}
#line 4192 "awkgram.c" /* yacc.c:1646 */
break;
case 194:
#line 2014 "awkgram.y" /* yacc.c:1646 */
{
(yyvsp[0])->opcode = Op_postdecrement;
}
#line 4200 "awkgram.c" /* yacc.c:1646 */
break;
case 195:
#line 2017 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = NULL; }
#line 4206 "awkgram.c" /* yacc.c:1646 */
break;
case 197:
#line 2025 "awkgram.y" /* yacc.c:1646 */
{ yyerrok; }
#line 4212 "awkgram.c" /* yacc.c:1646 */
break;
case 198:
#line 2029 "awkgram.y" /* yacc.c:1646 */
{ yyerrok; }
#line 4218 "awkgram.c" /* yacc.c:1646 */
break;
case 201:
#line 2038 "awkgram.y" /* yacc.c:1646 */
{ yyerrok; }
#line 4224 "awkgram.c" /* yacc.c:1646 */
break;
case 202:
#line 2042 "awkgram.y" /* yacc.c:1646 */
{ (yyval) = (yyvsp[0]); yyerrok; }
#line 4230 "awkgram.c" /* yacc.c:1646 */
break;
case 203:
#line 2046 "awkgram.y" /* yacc.c:1646 */
{ yyerrok; }
#line 4236 "awkgram.c" /* yacc.c:1646 */
break;
#line 4240 "awkgram.c" /* yacc.c:1646 */
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* 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:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead 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);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead 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;
/* Do not reclaim the symbols of the rule whose 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 (!yypact_value_is_default (yyn))
{
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;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* 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;
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
#line 2048 "awkgram.y" /* yacc.c:1906 */
struct token {
const char *operator; /* text to match */
OPCODE value; /* type */
int class; /* lexical class */
unsigned flags; /* # of args. allowed and compatability */
# define ARGS 0xFF /* 0, 1, 2, 3 args allowed (any combination */
# define A(n) (1<<(n))
# define VERSION_MASK 0xFF00 /* old awk is zero */
# define NOT_OLD 0x0100 /* feature not in old awk */
# define NOT_POSIX 0x0200 /* feature not in POSIX */
# define GAWKX 0x0400 /* gawk extension */
# define BREAK 0x0800 /* break allowed inside */
# define CONTINUE 0x1000 /* continue allowed inside */
# define DEBUG_USE 0x2000 /* for use by developers */
NODE *(*ptr)(int); /* function that implements this keyword */
NODE *(*ptr2)(int); /* alternate arbitrary-precision function */
};
#ifdef USE_EBCDIC
/* tokcompare --- lexicographically compare token names for sorting */
static int
tokcompare(const void *l, const void *r)
{
struct token *lhs, *rhs;
lhs = (struct token *) l;
rhs = (struct token *) r;
return strcmp(lhs->operator, rhs->operator);
}
#endif
/*
* Tokentab is sorted ASCII ascending order, so it can be binary searched.
* See check_special(), which sorts the table on EBCDIC systems.
* Function pointers come from declarations in awk.h.
*/
#ifdef HAVE_MPFR
#define MPF(F) do_mpfr_##F
#else
#define MPF(F) 0
#endif
static const struct token tokentab[] = {
{"BEGIN", Op_rule, LEX_BEGIN, 0, 0, 0},
{"BEGINFILE", Op_rule, LEX_BEGINFILE, GAWKX, 0, 0},
{"END", Op_rule, LEX_END, 0, 0, 0},
{"ENDFILE", Op_rule, LEX_ENDFILE, GAWKX, 0, 0},
#ifdef ARRAYDEBUG
{"adump", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2)|DEBUG_USE, do_adump, 0},
#endif
{"and", Op_builtin, LEX_BUILTIN, GAWKX, do_and, MPF(and)},
{"asort", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2)|A(3), do_asort, 0},
{"asorti", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2)|A(3), do_asorti, 0},
{"atan2", Op_builtin, LEX_BUILTIN, NOT_OLD|A(2), do_atan2, MPF(atan2)},
{"bindtextdomain", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2), do_bindtextdomain, 0},
{"break", Op_K_break, LEX_BREAK, 0, 0, 0},
{"case", Op_K_case, LEX_CASE, GAWKX, 0, 0},
{"close", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1)|A(2), do_close, 0},
{"compl", Op_builtin, LEX_BUILTIN, GAWKX|A(1), do_compl, MPF(compl)},
{"continue", Op_K_continue, LEX_CONTINUE, 0, 0, 0},
{"cos", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1), do_cos, MPF(cos)},
{"dcgettext", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2)|A(3), do_dcgettext, 0},
{"dcngettext", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2)|A(3)|A(4)|A(5), do_dcngettext, 0},
{"default", Op_K_default, LEX_DEFAULT, GAWKX, 0, 0},
{"delete", Op_K_delete, LEX_DELETE, NOT_OLD, 0, 0},
{"do", Op_K_do, LEX_DO, NOT_OLD|BREAK|CONTINUE, 0, 0},
{"else", Op_K_else, LEX_ELSE, 0, 0, 0},
{"eval", Op_symbol, LEX_EVAL, 0, 0, 0},
{"exit", Op_K_exit, LEX_EXIT, 0, 0, 0},
{"exp", Op_builtin, LEX_BUILTIN, A(1), do_exp, MPF(exp)},
{"fflush", Op_builtin, LEX_BUILTIN, A(0)|A(1), do_fflush, 0},
{"for", Op_K_for, LEX_FOR, BREAK|CONTINUE, 0, 0},
{"func", Op_func, LEX_FUNCTION, NOT_POSIX|NOT_OLD, 0, 0},
{"function",Op_func, LEX_FUNCTION, NOT_OLD, 0, 0},
{"gensub", Op_sub_builtin, LEX_BUILTIN, GAWKX|A(3)|A(4), 0, 0},
{"getline", Op_K_getline_redir, LEX_GETLINE, NOT_OLD, 0, 0},
{"gsub", Op_sub_builtin, LEX_BUILTIN, NOT_OLD|A(2)|A(3), 0, 0},
{"if", Op_K_if, LEX_IF, 0, 0, 0},
{"in", Op_symbol, LEX_IN, 0, 0, 0},
{"include", Op_symbol, LEX_INCLUDE, GAWKX, 0, 0},
{"index", Op_builtin, LEX_BUILTIN, A(2), do_index, 0},
{"int", Op_builtin, LEX_BUILTIN, A(1), do_int, MPF(int)},
#ifdef SUPPLY_INTDIV
{"intdiv0", Op_builtin, LEX_BUILTIN, GAWKX|A(3), do_intdiv, MPF(intdiv)},
#endif
{"isarray", Op_builtin, LEX_BUILTIN, GAWKX|A(1), do_isarray, 0},
{"length", Op_builtin, LEX_LENGTH, A(0)|A(1), do_length, 0},
{"load", Op_symbol, LEX_LOAD, GAWKX, 0, 0},
{"log", Op_builtin, LEX_BUILTIN, A(1), do_log, MPF(log)},
{"lshift", Op_builtin, LEX_BUILTIN, GAWKX|A(2), do_lshift, MPF(lshift)},
{"match", Op_builtin, LEX_BUILTIN, NOT_OLD|A(2)|A(3), do_match, 0},
{"mktime", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2), do_mktime, 0},
{"next", Op_K_next, LEX_NEXT, 0, 0, 0},
{"nextfile", Op_K_nextfile, LEX_NEXTFILE, 0, 0, 0},
{"or", Op_builtin, LEX_BUILTIN, GAWKX, do_or, MPF(or)},
{"patsplit", Op_builtin, LEX_BUILTIN, GAWKX|A(2)|A(3)|A(4), do_patsplit, 0},
{"print", Op_K_print, LEX_PRINT, 0, 0, 0},
{"printf", Op_K_printf, LEX_PRINTF, 0, 0, 0},
{"rand", Op_builtin, LEX_BUILTIN, NOT_OLD|A(0), do_rand, MPF(rand)},
{"return", Op_K_return, LEX_RETURN, NOT_OLD, 0, 0},
{"rshift", Op_builtin, LEX_BUILTIN, GAWKX|A(2), do_rshift, MPF(rshift)},
{"sin", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1), do_sin, MPF(sin)},
{"split", Op_builtin, LEX_BUILTIN, A(2)|A(3)|A(4), do_split, 0},
{"sprintf", Op_builtin, LEX_BUILTIN, 0, do_sprintf, 0},
{"sqrt", Op_builtin, LEX_BUILTIN, A(1), do_sqrt, MPF(sqrt)},
{"srand", Op_builtin, LEX_BUILTIN, NOT_OLD|A(0)|A(1), do_srand, MPF(srand)},
#if defined(GAWKDEBUG) || defined(ARRAYDEBUG) /* || ... */
{"stopme", Op_builtin, LEX_BUILTIN, GAWKX|A(0)|DEBUG_USE, stopme, 0},
#endif
{"strftime", Op_builtin, LEX_BUILTIN, GAWKX|A(0)|A(1)|A(2)|A(3), do_strftime, 0},
{"strtonum", Op_builtin, LEX_BUILTIN, GAWKX|A(1), do_strtonum, MPF(strtonum)},
{"sub", Op_sub_builtin, LEX_BUILTIN, NOT_OLD|A(2)|A(3), 0, 0},
{"substr", Op_builtin, LEX_BUILTIN, A(2)|A(3), do_substr, 0},
{"switch", Op_K_switch, LEX_SWITCH, GAWKX|BREAK, 0, 0},
{"system", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1), do_system, 0},
{"systime", Op_builtin, LEX_BUILTIN, GAWKX|A(0), do_systime, 0},
{"tolower", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1), do_tolower, 0},
{"toupper", Op_builtin, LEX_BUILTIN, NOT_OLD|A(1), do_toupper, 0},
{"typeof", Op_builtin, LEX_BUILTIN, GAWKX|A(1), do_typeof, 0},
{"while", Op_K_while, LEX_WHILE, BREAK|CONTINUE, 0, 0},
{"xor", Op_builtin, LEX_BUILTIN, GAWKX, do_xor, MPF(xor)},
};
/* Variable containing the current shift state. */
static mbstate_t cur_mbstate;
/* Ring buffer containing current characters. */
#define MAX_CHAR_IN_RING_BUFFER 8
#define RING_BUFFER_SIZE (MAX_CHAR_IN_RING_BUFFER * MB_LEN_MAX)
static char cur_char_ring[RING_BUFFER_SIZE];
/* Index for ring buffers. */
static int cur_ring_idx;
/* This macro means that last nextc() return a singlebyte character
or 1st byte of a multibyte character. */
#define nextc_is_1stbyte (cur_char_ring[cur_ring_idx] == 1)
/* getfname --- return name of a builtin function (for pretty printing) */
const char *
getfname(NODE *(*fptr)(int))
{
int i, j;
j = sizeof(tokentab) / sizeof(tokentab[0]);
/* linear search, no other way to do it */
for (i = 0; i < j; i++)
if (tokentab[i].ptr == fptr || tokentab[i].ptr2 == fptr)
return tokentab[i].operator;
return NULL;
}
/* negate_num --- negate a number in NODE */
void
negate_num(NODE *n)
{
#ifdef HAVE_MPFR
int tval = 0;
#endif
add_sign_to_num(n, '-');
if (! is_mpg_number(n)) {
n->numbr = -n->numbr;
return;
}
#ifdef HAVE_MPFR
if (is_mpg_integer(n)) {
if (! iszero(n)) {
mpz_neg(n->mpg_i, n->mpg_i);
return;
}
/*
* 0 --> -0 conversion. Requires turning the MPG integer
* into an MPFR float.
*/
mpz_clear(n->mpg_i); /* release the integer storage */
/* Convert and fall through. */
tval = mpfr_set_d(n->mpg_numbr, 0.0, ROUND_MODE);
IEEE_FMT(n->mpg_numbr, tval);
n->flags &= ~MPZN;
n->flags |= MPFN;
}
/* mpfr float case */
tval = mpfr_neg(n->mpg_numbr, n->mpg_numbr, ROUND_MODE);
IEEE_FMT(n->mpg_numbr, tval);
#endif
}
/* add_sign_to_num --- make a constant unary plus or minus for profiling */
static void
add_sign_to_num(NODE *n, char sign)
{
if ((n->flags & NUMCONSTSTR) != 0) {
char *s;
s = n->stptr;
memmove(& s[1], & s[0], n->stlen + 1);
s[0] = sign;
n->stlen++;
}
}
/* print_included_from --- print `Included from ..' file names and locations */
static void
print_included_from()
{
int saveline, line;
SRCFILE *s;
/* suppress current file name, line # from `.. included from ..' msgs */
saveline = sourceline;
sourceline = 0;
for (s = sourcefile; s != NULL && s->stype == SRC_INC; ) {
s = s->next;
if (s == NULL || s->fd <= INVALID_HANDLE)
continue;
line = s->srclines;
/* if last token is NEWLINE, line number is off by 1. */
if (s->lasttok == NEWLINE)
line--;
msg("%s %s:%d%c",
s->prev == sourcefile ? "In file included from"
: " from",
(s->stype == SRC_INC ||
s->stype == SRC_FILE) ? s->src : "cmd. line",
line,
s->stype == SRC_INC ? ',' : ':'
);
}
sourceline = saveline;
}
/* warning_ln --- print a warning message with location */
static void
warning_ln(int line, const char *mesg, ...)
{
va_list args;
int saveline;
saveline = sourceline;
sourceline = line;
print_included_from();
va_start(args, mesg);
err(false, _("warning: "), mesg, args);
va_end(args);
sourceline = saveline;
}
/* lintwarn_ln --- print a lint warning and location */
static void
lintwarn_ln(int line, const char *mesg, ...)
{
va_list args;
int saveline;
saveline = sourceline;
sourceline = line;
print_included_from();
va_start(args, mesg);
if (lintfunc == r_fatal)
err(true, _("fatal: "), mesg, args);
else
err(false, _("warning: "), mesg, args);
va_end(args);
sourceline = saveline;
if (lintfunc == r_fatal)
gawk_exit(EXIT_FATAL);
}
/* error_ln --- print an error message and location */
static void
error_ln(int line, const char *m, ...)
{
va_list args;
int saveline;
saveline = sourceline;
sourceline = line;
print_included_from();
errcount++;
va_start(args, m);
err(false, "error: ", m, args);
va_end(args);
sourceline = saveline;
}
/* yyerror --- print a syntax error message, show where */
static void
yyerror(const char *m, ...)
{
va_list args;
const char *mesg = NULL;
char *bp, *cp;
char *scan;
char *buf;
int count;
static char end_of_file_line[] = "(END OF FILE)";
print_included_from();
errcount++;
/* Find the current line in the input file */
if (lexptr && lexeme) {
if (thisline == NULL) {
cp = lexeme;
if (*cp == '\n') {
if (cp > lexptr_begin)
cp--;
mesg = _("unexpected newline or end of string");
}
for (; cp != lexptr_begin && *cp != '\n'; --cp)
continue;
if (*cp == '\n')
cp++;
thisline = cp;
}
/* NL isn't guaranteed */
bp = lexeme;
if (bp < thisline)
bp = thisline + 1;
while (bp < lexend && *bp && *bp != '\n')
bp++;
} else {
thisline = end_of_file_line;
bp = thisline + strlen(thisline);
}
msg("%.*s", (int) (bp - thisline), thisline);
va_start(args, m);
if (mesg == NULL)
mesg = m;
count = strlen(mesg) + 1;
if (lexptr != NULL)
count += (lexeme - thisline) + 2;
ezalloc(buf, char *, count+1, "yyerror");
bp = buf;
if (lexptr != NULL) {
scan = thisline;
while (scan < lexeme)
if (*scan++ == '\t')
*bp++ = '\t';
else
*bp++ = ' ';
*bp++ = '^';
*bp++ = ' ';
}
strcpy(bp, mesg);
err(false, "", buf, args);
va_end(args);
efree(buf);
}
/* mk_program --- create a single list of instructions */
static INSTRUCTION *
mk_program()
{
INSTRUCTION *cp, *tmp;
#define begin_block rule_block[BEGIN]
#define end_block rule_block[END]
#define prog_block rule_block[Rule]
#define beginfile_block rule_block[BEGINFILE]
#define endfile_block rule_block[ENDFILE]
if (end_block == NULL)
end_block = list_create(ip_end);
else
(void) list_prepend(end_block, ip_end);
if (! in_main_context()) {
if (begin_block != NULL && prog_block != NULL)
cp = list_merge(begin_block, prog_block);
else
cp = (begin_block != NULL) ? begin_block : prog_block;
if (cp != NULL)
(void) list_merge(cp, end_block);
else
cp = end_block;
(void) list_append(cp, instruction(Op_stop));
goto out;
}
if (endfile_block == NULL)
endfile_block = list_create(ip_endfile);
else {
ip_rec->has_endfile = true;
(void) list_prepend(endfile_block, ip_endfile);
}
if (beginfile_block == NULL)
beginfile_block = list_create(ip_beginfile);
else
(void) list_prepend(beginfile_block, ip_beginfile);
if (prog_block == NULL) {
if (end_block->nexti == end_block->lasti
&& beginfile_block->nexti == beginfile_block->lasti
&& endfile_block->nexti == endfile_block->lasti
) {
/* no pattern-action and (real) end, beginfile or endfile blocks */
bcfree(ip_rec);
bcfree(ip_newfile);
ip_rec = ip_newfile = NULL;
list_append(beginfile_block, instruction(Op_after_beginfile));
(void) list_append(endfile_block, instruction(Op_after_endfile));
if (begin_block == NULL) /* no program at all */
cp = end_block;
else
cp = list_merge(begin_block, end_block);
if (program_comment != NULL) {
(void) list_prepend(cp, program_comment);
}
if (comment != NULL)
(void) list_append(cp, comment);
(void) list_append(cp, ip_atexit);
(void) list_append(cp, instruction(Op_stop));
/* append beginfile_block and endfile_block for sole use
* in getline without redirection (Op_K_getline).
*/
(void) list_merge(cp, beginfile_block);
(void) list_merge(cp, endfile_block);
goto out;
} else {
/* install a do-nothing prog block */
prog_block = list_create(instruction(Op_no_op));
}
}
(void) list_append(endfile_block, instruction(Op_after_endfile));
(void) list_prepend(prog_block, ip_rec);
(void) list_append(prog_block, instruction(Op_jmp));
prog_block->lasti->target_jmp = ip_rec;
list_append(beginfile_block, instruction(Op_after_beginfile));
cp = list_merge(beginfile_block, prog_block);
(void) list_prepend(cp, ip_newfile);
(void) list_merge(cp, endfile_block);
(void) list_merge(cp, end_block);
if (begin_block != NULL)
cp = list_merge(begin_block, cp);
if (program_comment != NULL) {
(void) list_prepend(cp, program_comment);
}
if (comment != NULL) {
(void) list_append(cp, comment);
}
(void) list_append(cp, ip_atexit);
(void) list_append(cp, instruction(Op_stop));
out:
/* delete the Op_list, not needed */
tmp = cp->nexti;
bcfree(cp);
/* these variables are not used again but zap them anyway. */
comment = NULL;
function_comment = NULL;
program_comment = NULL;
return tmp;
#undef begin_block
#undef end_block
#undef prog_block
#undef beginfile_block
#undef endfile_block
}
/* parse_program --- read in the program and convert into a list of instructions */
int
parse_program(INSTRUCTION **pcode)
{
int ret;
/* pre-create non-local jump targets
* ip_end (Op_no_op) -- used as jump target for `exit'
* outside an END block.
*/
ip_end = instruction(Op_no_op);
if (! in_main_context())
ip_newfile = ip_rec = ip_atexit = ip_beginfile = ip_endfile = NULL;
else {
ip_endfile = instruction(Op_no_op);
main_beginfile = ip_beginfile = instruction(Op_no_op);
ip_rec = instruction(Op_get_record); /* target for `next', also ip_newfile */
ip_newfile = bcalloc(Op_newfile, 2, 0); /* target for `nextfile' */
ip_newfile->target_jmp = ip_end;
ip_newfile->target_endfile = ip_endfile;
(ip_newfile + 1)->target_get_record = ip_rec;
ip_rec->target_newfile = ip_newfile;
ip_atexit = instruction(Op_atexit); /* target for `exit' in END block */
}
for (sourcefile = srcfiles->next; sourcefile->stype == SRC_EXTLIB;
sourcefile = sourcefile->next)
;
lexeof = false;
lexptr = NULL;
lasttok = 0;
memset(rule_block, 0, sizeof(ruletab) * sizeof(INSTRUCTION *));
errcount = 0;
tok = tokstart != NULL ? tokstart : tokexpand();
ret = yyparse();
*pcode = mk_program();
/* avoid false source indications */
source = NULL;
sourceline = 0;
if (ret == 0) /* avoid spurious warning if parser aborted with YYABORT */
check_funcs();
if (do_posix && ! check_param_names())
errcount++;
if (args_array == NULL)
emalloc(args_array, NODE **, (max_args + 2) * sizeof(NODE *), "parse_program");
else
erealloc(args_array, NODE **, (max_args + 2) * sizeof(NODE *), "parse_program");
return (ret || errcount);
}
/* free_srcfile --- free a SRCFILE struct */
void
free_srcfile(SRCFILE *thisfile)
{
efree(thisfile->src);
efree(thisfile);
}
/* do_add_srcfile --- add one item to srcfiles */
static SRCFILE *
do_add_srcfile(enum srctype stype, char *src, char *path, SRCFILE *thisfile)
{
SRCFILE *s;
ezalloc(s, SRCFILE *, sizeof(SRCFILE), "do_add_srcfile");
s->src = estrdup(src, strlen(src));
s->fullpath = path;
s->stype = stype;
s->fd = INVALID_HANDLE;
s->next = thisfile;
s->prev = thisfile->prev;
thisfile->prev->next = s;
thisfile->prev = s;
return s;
}
/* add_srcfile --- add one item to srcfiles after checking if
* a source file exists and not already in list.
*/
SRCFILE *
add_srcfile(enum srctype stype, char *src, SRCFILE *thisfile, bool *already_included, int *errcode)
{
SRCFILE *s;
struct stat sbuf;
char *path;
int errno_val = 0;
if (already_included)
*already_included = false;
if (errcode)
*errcode = 0;
if (stype == SRC_CMDLINE || stype == SRC_STDIN)
return do_add_srcfile(stype, src, NULL, thisfile);
path = find_source(src, & sbuf, & errno_val, stype == SRC_EXTLIB);
if (path == NULL) {
if (errcode) {
*errcode = errno_val;
return NULL;
}
/* use full messages to ease translation */
fatal(stype != SRC_EXTLIB
? _("can't open source file `%s' for reading (%s)")
: _("can't open shared library `%s' for reading (%s)"),
src,
errno_val ? strerror(errno_val) : _("reason unknown"));
}
/* N.B. We do not eliminate duplicate SRC_FILE (-f) programs. */
for (s = srcfiles->next; s != srcfiles; s = s->next) {
if ((s->stype == SRC_FILE || s->stype == SRC_INC || s->stype == SRC_EXTLIB) && files_are_same(path, s)) {
if (stype == SRC_INC || stype == SRC_EXTLIB) {
/* eliminate duplicates */
if ((stype == SRC_INC) && (s->stype == SRC_FILE))
fatal(_("can't include `%s' and use it as a program file"), src);
if (do_lint) {
int line = sourceline;
/* Kludge: the line number may be off for `@include file'.
* Since, this function is also used for '-f file' in main.c,
* sourceline > 1 check ensures that the call is at
* parse time.
*/
if (sourceline > 1 && lasttok == NEWLINE)
line--;
lintwarn_ln(line,
stype != SRC_EXTLIB
? _("already included source file `%s'")
: _("already loaded shared library `%s'"),
src);
}
efree(path);
if (already_included)
*already_included = true;
return NULL;
} else {
/* duplicates are allowed for -f */
if (s->stype == SRC_INC)
fatal(_("can't include `%s' and use it as a program file"), src);
/* no need to scan for further matches, since
* they must be of homogeneous type */
break;
}
}
}
s = do_add_srcfile(stype, src, path, thisfile);
s->sbuf = sbuf;
s->mtime = sbuf.st_mtime;
return s;
}
/* include_source --- read program from source included using `@include' */
static int
include_source(INSTRUCTION *file)
{
SRCFILE *s;
char *src = file->lextok;
int errcode;
bool already_included;
if (do_traditional || do_posix) {
error_ln(file->source_line, _("@include is a gawk extension"));
return -1;
}
if (strlen(src) == 0) {
if (do_lint)
lintwarn_ln(file->source_line, _("empty filename after @include"));
return 0;
}
s = add_srcfile(SRC_INC, src, sourcefile, &already_included, &errcode);
if (s == NULL) {
if (already_included)
return 0;
error_ln(file->source_line,
_("can't open source file `%s' for reading (%s)"),
src, errcode ? strerror(errcode) : _("reason unknown"));
return -1;
}
/* save scanner state for the current sourcefile */
sourcefile->srclines = sourceline;
sourcefile->lexptr = lexptr;
sourcefile->lexend = lexend;
sourcefile->lexptr_begin = lexptr_begin;
sourcefile->lexeme = lexeme;
sourcefile->lasttok = lasttok;
/* included file becomes the current source */
sourcefile = s;
lexptr = NULL;
sourceline = 0;
source = NULL;
lasttok = 0;
lexeof = false;
eof_warned = false;
return 0;
}
/* load_library --- load a shared library */
static int
load_library(INSTRUCTION *file)
{
SRCFILE *s;
char *src = file->lextok;
int errcode;
bool already_included;
if (do_traditional || do_posix) {
error_ln(file->source_line, _("@load is a gawk extension"));
return -1;
}
if (strlen(src) == 0) {
if (do_lint)
lintwarn_ln(file->source_line, _("empty filename after @load"));
return 0;
}
s = add_srcfile(SRC_EXTLIB, src, sourcefile, &already_included, &errcode);
if (s == NULL) {
if (already_included)
return 0;
error_ln(file->source_line,
_("can't open shared library `%s' for reading (%s)"),
src, errcode ? strerror(errcode) : _("reason unknown"));
return -1;
}
load_ext(s->fullpath);
return 0;
}
/* next_sourcefile --- read program from the next source in srcfiles */
static void
next_sourcefile()
{
static int (*closefunc)(int fd) = NULL;
if (closefunc == NULL) {
char *cp = getenv("AWKREADFUNC");
/* If necessary, one day, test value for different functions. */
if (cp == NULL)
closefunc = close;
else
closefunc = one_line_close;
}
/*
* This won't be true if there's an invalid character in
* the source file or source string (e.g., user typo).
* Previous versions of gawk did not core dump in such a
* case.
*
* assert(lexeof == true);
*/
lexeof = false;
eof_warned = false;
sourcefile->srclines = sourceline; /* total no of lines in current file */
if (sourcefile->fd > INVALID_HANDLE) {
if (sourcefile->fd != fileno(stdin)) /* safety */
(*closefunc)(sourcefile->fd);
sourcefile->fd = INVALID_HANDLE;
}
if (sourcefile->buf != NULL) {
efree(sourcefile->buf);
sourcefile->buf = NULL;
sourcefile->lexptr_begin = NULL;
}
while ((sourcefile = sourcefile->next) != NULL) {
if (sourcefile == srcfiles)
return;
if (sourcefile->stype != SRC_EXTLIB)
break;
}
if (sourcefile->lexptr_begin != NULL) {
/* resume reading from already opened file (postponed to process '@include') */
lexptr = sourcefile->lexptr;
lexend = sourcefile->lexend;
lasttok = sourcefile->lasttok;
lexptr_begin = sourcefile->lexptr_begin;
lexeme = sourcefile->lexeme;
sourceline = sourcefile->srclines;
source = sourcefile->src;
} else {
lexptr = NULL;
sourceline = 0;
source = NULL;
lasttok = 0;
}
}
/* get_src_buf --- read the next buffer of source program */
static char *
get_src_buf()
{
int n;
char *scan;
bool newfile;
int savelen;
struct stat sbuf;
/*
* No argument prototype on readfunc on purpose,
* avoids problems with some ancient systems where
* the types of arguments to read() aren't up to date.
*/
static ssize_t (*readfunc)() = 0;
if (readfunc == NULL) {
char *cp = getenv("AWKREADFUNC");
/* If necessary, one day, test value for different functions. */
if (cp == NULL)
/*
* cast is to remove warnings on systems with
* different return types for read.
*/
readfunc = ( ssize_t(*)() ) read;
else
readfunc = read_one_line;
}
newfile = false;
if (sourcefile == srcfiles)
return NULL;
if (sourcefile->stype == SRC_CMDLINE) {
if (sourcefile->bufsize == 0) {
sourcefile->bufsize = strlen(sourcefile->src);
lexptr = lexptr_begin = lexeme = sourcefile->src;
lexend = lexptr + sourcefile->bufsize;
sourceline = 1;
if (sourcefile->bufsize == 0) {
/*
* Yet Another Special case:
* gawk '' /path/name
* Sigh.
*/
static bool warned = false;
if (do_lint && ! warned) {
warned = true;
lintwarn(_("empty program text on command line"));
}
lexeof = true;
}
} else if (sourcefile->buf == NULL && *(lexptr-1) != '\n') {
/*
* The following goop is to ensure that the source
* ends with a newline and that the entire current
* line is available for error messages.
*/
int offset;
char *buf;
offset = lexptr - lexeme;
for (scan = lexeme; scan > lexptr_begin; scan--)
if (*scan == '\n') {
scan++;
break;
}
savelen = lexptr - scan;
emalloc(buf, char *, savelen + 1, "get_src_buf");
memcpy(buf, scan, savelen);
thisline = buf;
lexptr = buf + savelen;
*lexptr = '\n';
lexeme = lexptr - offset;
lexptr_begin = buf;
lexend = lexptr + 1;
sourcefile->buf = buf;
} else
lexeof = true;
return lexptr;
}
if (sourcefile->fd <= INVALID_HANDLE) {
int fd;
int l;
source = sourcefile->src;
if (source == NULL)
return NULL;
fd = srcopen(sourcefile);
if (fd <= INVALID_HANDLE) {
char *in;
/* suppress file name and line no. in error mesg */
in = source;
source = NULL;
error(_("can't open source file `%s' for reading (%s)"),
in, strerror(errno));
errcount++;
lexeof = true;
return sourcefile->src;
}
sourcefile->fd = fd;
l = optimal_bufsize(fd, &sbuf);
/*
* Make sure that something silly like
* AWKBUFSIZE=8 make check
* works ok.
*/
#define A_DECENT_BUFFER_SIZE 128
if (l < A_DECENT_BUFFER_SIZE)
l = A_DECENT_BUFFER_SIZE;
#undef A_DECENT_BUFFER_SIZE
sourcefile->bufsize = l;
newfile = true;
emalloc(sourcefile->buf, char *, sourcefile->bufsize, "get_src_buf");
lexptr = lexptr_begin = lexeme = sourcefile->buf;
savelen = 0;
sourceline = 1;
thisline = NULL;
} else {
/*
* Here, we retain the current source line in the beginning of the buffer.
*/
int offset;
for (scan = lexeme; scan > lexptr_begin; scan--)
if (*scan == '\n') {
scan++;
break;
}
savelen = lexptr - scan;
offset = lexptr - lexeme;
if (savelen > 0) {
/*
* Need to make sure we have room left for reading new text;
* grow the buffer (by doubling, an arbitrary choice), if the retained line
* takes up more than a certain percentage (50%, again an arbitrary figure)
* of the available space.
*/
if (savelen > sourcefile->bufsize / 2) { /* long line or token */
sourcefile->bufsize *= 2;
erealloc(sourcefile->buf, char *, sourcefile->bufsize, "get_src_buf");
scan = sourcefile->buf + (scan - lexptr_begin);
lexptr_begin = sourcefile->buf;
}
thisline = lexptr_begin;
memmove(thisline, scan, savelen);
lexptr = thisline + savelen;
lexeme = lexptr - offset;
} else {
savelen = 0;
lexptr = lexeme = lexptr_begin;
thisline = NULL;
}
}
n = (*readfunc)(sourcefile->fd, lexptr, sourcefile->bufsize - savelen);
if (n == -1) {
error(_("can't read sourcefile `%s' (%s)"),
source, strerror(errno));
errcount++;
lexeof = true;
} else {
lexend = lexptr + n;
if (n == 0) {
static bool warned = false;
if (do_lint && newfile && ! warned) {
warned = true;
sourceline = 0;
lintwarn(_("source file `%s' is empty"), source);
}
lexeof = true;
}
}
return sourcefile->buf;
}
/* tokadd --- add a character to the token buffer */
#define tokadd(x) (*tok++ = (x), tok == tokend ? tokexpand() : tok)
/* tokexpand --- grow the token buffer */
static char *
tokexpand()
{
static int toksize;
int tokoffset;
if (tokstart != NULL) {
tokoffset = tok - tokstart;
toksize *= 2;
erealloc(tokstart, char *, toksize, "tokexpand");
tok = tokstart + tokoffset;
} else {
toksize = 60;
emalloc(tokstart, char *, toksize, "tokexpand");
tok = tokstart;
}
tokend = tokstart + toksize;
return tok;
}
/* check_bad_char --- fatal if c isn't allowed in gawk source code */
/*
* The error message was inspired by someone who decided to put
* a physical \0 byte into the source code to see what would
* happen and then filed a bug report about it. Sigh.
*/
static void
check_bad_char(int c)
{
/* allow escapes. needed for autoconf. bleah. */
switch (c) {
case '\a':
case '\b':
case '\f':
case '\n':
case '\r':
case '\t':
return;
default:
break;
}
if (iscntrl(c) && ! isspace(c))
fatal(_("PEBKAC error: invalid character '\\%03o' in source code"), c & 0xFF);
}
/* nextc --- get the next input character */
static int
nextc(bool check_for_bad)
{
if (gawk_mb_cur_max > 1) {
again:
#ifdef NO_CONTINUE_SOURCE_STRINGS
if (lexeof)
return END_FILE;
#else
if (lexeof) {
if (sourcefile->next == srcfiles)
return END_FILE;
else
next_sourcefile();
}
#endif
if (lexptr == NULL || lexptr >= lexend) {
if (get_src_buf())
goto again;
return END_SRC;
}
/* Update the buffer index. */
cur_ring_idx = (cur_ring_idx == RING_BUFFER_SIZE - 1)? 0 :
cur_ring_idx + 1;
/* Did we already check the current character? */
if (cur_char_ring[cur_ring_idx] == 0) {
/* No, we need to check the next character on the buffer. */
int idx, work_ring_idx = cur_ring_idx;
mbstate_t tmp_state;
size_t mbclen;
for (idx = 0; lexptr + idx < lexend; idx++) {
tmp_state = cur_mbstate;
mbclen = mbrlen(lexptr, idx + 1, &tmp_state);
if (mbclen == 1 || mbclen == (size_t)-1 || mbclen == 0) {
/* It is a singlebyte character, non-complete multibyte
character or EOF. We treat it as a singlebyte
character. */
cur_char_ring[work_ring_idx] = 1;
break;
} else if (mbclen == (size_t)-2) {
/* It is not a complete multibyte character. */
cur_char_ring[work_ring_idx] = idx + 1;
} else {
/* mbclen > 1 */
cur_char_ring[work_ring_idx] = mbclen;
break;
}
work_ring_idx = (work_ring_idx == RING_BUFFER_SIZE - 1)?
0 : work_ring_idx + 1;
}
cur_mbstate = tmp_state;
/* Put a mark on the position on which we write next character. */
work_ring_idx = (work_ring_idx == RING_BUFFER_SIZE - 1)?
0 : work_ring_idx + 1;
cur_char_ring[work_ring_idx] = 0;
}
if (check_for_bad || *lexptr == '\0')
check_bad_char(*lexptr);
return (int) (unsigned char) *lexptr++;
} else {
do {
#ifdef NO_CONTINUE_SOURCE_STRINGS
if (lexeof)
return END_FILE;
#else
if (lexeof) {
if (sourcefile->next == srcfiles)
return END_FILE;
else
next_sourcefile();
}
#endif
if (lexptr && lexptr < lexend) {
if (check_for_bad || *lexptr == '\0')
check_bad_char(*lexptr);
return ((int) (unsigned char) *lexptr++);
}
} while (get_src_buf());
return END_SRC;
}
}
/* pushback --- push a character back on the input */
static inline void
pushback(void)
{
if (gawk_mb_cur_max > 1)
cur_ring_idx = (cur_ring_idx == 0)? RING_BUFFER_SIZE - 1 :
cur_ring_idx - 1;
(! lexeof && lexptr && lexptr > lexptr_begin ? lexptr-- : lexptr);
}
/* check_comment --- check for block comment */
void
check_comment(void)
{
if (comment != NULL) {
if (first_rule) {
program_comment = comment;
} else
block_comment = comment;
comment = NULL;
}
first_rule = false;
}
/*
* get_comment --- collect comment text.
* Flag = EOL_COMMENT for end-of-line comments.
* Flag = FULL_COMMENT for self-contained comments.
*/
int
get_comment(int flag)
{
int c;
int sl;
tok = tokstart;
tokadd('#');
sl = sourceline;
char *p1;
char *p2;
while (true) {
while ((c = nextc(false)) != '\n' && c != END_FILE) {
/* ignore \r characters */
if (c != '\r')
tokadd(c);
}
if (flag == EOL_COMMENT) {
/* comment at end of line. */
if (c == '\n')
tokadd(c);
break;
}
if (c == '\n') {
tokadd(c);
sourceline++;
do {
c = nextc(false);
if (c == '\n') {
sourceline++;
tokadd(c);
}
} while (isspace(c) && c != END_FILE);
if (c == END_FILE)
break;
else if (c != '#') {
pushback();
sourceline--;
break;
} else
tokadd(c);
} else
break;
}
if (comment != NULL)
prior_comment = comment;
/* remove any trailing blank lines (consecutive \n) from comment */
p1 = tok - 1;
p2 = tok - 2;
while (*p1 == '\n' && *p2 == '\n') {
p1--;
p2--;
tok--;
}
comment = bcalloc(Op_comment, 1, sl);
comment->source_file = source;
comment->memory = make_str_node(tokstart, tok - tokstart, 0);
comment->memory->comment_type = flag;
return c;
}
/* split_comment --- split initial comment text into program and function parts */
static void
split_comment(void)
{
char *p;
int l;
NODE *n;
p = comment_to_save->memory->stptr;
l = comment_to_save->memory->stlen - 3;
/* have at least two comments so split at last blank line (\n\n) */
while (l >= 0) {
if (p[l] == '\n' && p[l+1] == '\n') {
function_comment = comment_to_save;
n = function_comment->memory;
function_comment->memory = make_string(p + l + 2, n->stlen - l - 2);
/* create program comment */
program_comment = bcalloc(Op_comment, 1, sourceline);
program_comment->source_file = comment_to_save->source_file;
p[l + 2] = 0;
program_comment->memory = make_str_node(p, l + 2, 0);
comment_to_save = NULL;
freenode(n);
break;
}
else
l--;
}
}
/* allow_newline --- allow newline after &&, ||, ? and : */
static void
allow_newline(void)
{
int c;
for (;;) {
c = nextc(true);
if (c == END_FILE) {
pushback();
break;
}
if (c == '#') {
if (do_pretty_print && ! do_profile) {
/* collect comment byte code iff doing pretty print but not profiling. */
c = get_comment(EOL_COMMENT);
} else {
while ((c = nextc(false)) != '\n' && c != END_FILE)
continue;
}
if (c == END_FILE) {
pushback();
break;
}
}
if (c == '\n')
sourceline++;
if (! isspace(c)) {
pushback();
break;
}
}
}
/* newline_eof --- return newline or EOF as needed and adjust variables */
/*
* This routine used to be a macro, however GCC 4.6.2 warned about
* the result of a computation not being used. Converting to a function
* removes the warnings.
*/
static int
newline_eof()
{
/* NB: a newline at end does not start a source line. */
if (lasttok != NEWLINE) {
pushback();
if (do_lint && ! eof_warned) {
lintwarn(_("source file does not end in newline"));
eof_warned = true;
}
sourceline++;
return NEWLINE;
}
sourceline--;
eof_warned = false;
return LEX_EOF;
}
/* yylex --- Read the input and turn it into tokens. */
static int
#ifdef USE_EBCDIC
yylex_ebcdic(void)
#else
yylex(void)
#endif
{
int c;
bool seen_e = false; /* These are for numbers */
bool seen_point = false;
bool esc_seen; /* for literal strings */
int mid;
int base;
static bool did_newline = false;
char *tokkey;
bool inhex = false;
bool intlstr = false;
AWKNUM d;
bool collecting_typed_regexp = false;
#define GET_INSTRUCTION(op) bcalloc(op, 1, sourceline)
#define NEWLINE_EOF newline_eof()
yylval = (INSTRUCTION *) NULL;
if (lasttok == SUBSCRIPT) {
lasttok = 0;
return SUBSCRIPT;
}
if (lasttok == LEX_EOF) /* error earlier in current source, must give up !! */
return 0;
c = nextc(! want_regexp);
if (c == END_SRC)
return 0;
if (c == END_FILE)
return lasttok = NEWLINE_EOF;
pushback();
#if defined __EMX__
/*
* added for OS/2's extproc feature of cmd.exe
* (like #! in BSD sh)
*/
if (strncasecmp(lexptr, "extproc ", 8) == 0) {
while (*lexptr && *lexptr != '\n')
lexptr++;
}
#endif
lexeme = lexptr;
thisline = NULL;
collect_regexp:
if (want_regexp) {
int in_brack = 0; /* count brackets, [[:alnum:]] allowed */
int b_index = -1;
int cur_index = 0;
/*
* Here is what's ok with brackets:
*
* [..[..] []] [^]] [.../...]
* [...\[...] [...\]...] [...\/...]
*
* (Remember that all of the above are inside /.../)
*
* The code for \ handles \[, \] and \/.
*
* Otherwise, track the first open [ position, and if
* an embedded ] occurs, allow it to pass through
* if it's right after the first [ or after [^.
*
* Whew!
*/
want_regexp = false;
tok = tokstart;
for (;;) {
c = nextc(false);
cur_index = tok - tokstart;
if (gawk_mb_cur_max == 1 || nextc_is_1stbyte) switch (c) {
case '[':
if (nextc(false) == ':' || in_brack == 0) {
in_brack++;
if (in_brack == 1)
b_index = tok - tokstart;
}
pushback();
break;
case ']':
if (in_brack > 0
&& (cur_index == b_index + 1
|| (cur_index == b_index + 2 && tok[-1] == '^')))
; /* do nothing */
else {
in_brack--;
if (in_brack == 0)
b_index = -1;
}
break;
case '\\':
if ((c = nextc(false)) == END_FILE) {
pushback();
yyerror(_("unterminated regexp ends with `\\' at end of file"));
goto end_regexp; /* kludge */
}
if (c == '\r') /* allow MS-DOS files. bleah */
c = nextc(true);
if (c == '\n') {
sourceline++;
continue;
} else {
tokadd('\\');
tokadd(c);
continue;
}
break;
case '/': /* end of the regexp */
if (in_brack > 0)
break;
end_regexp:
yylval = GET_INSTRUCTION(Op_token);
yylval->lextok = estrdup(tokstart, tok - tokstart);
if (do_lint) {
int peek = nextc(true);
pushback();
if (peek == 'i' || peek == 's') {
if (source)
lintwarn(
_("%s: %d: tawk regex modifier `/.../%c' doesn't work in gawk"),
source, sourceline, peek);
else
lintwarn(
_("tawk regex modifier `/.../%c' doesn't work in gawk"),
peek);
}
}
if (collecting_typed_regexp) {
collecting_typed_regexp = false;
lasttok = TYPED_REGEXP;
} else
lasttok = REGEXP;
return lasttok;
case '\n':
pushback();
yyerror(_("unterminated regexp"));
goto end_regexp; /* kludge */
case END_FILE:
pushback();
yyerror(_("unterminated regexp at end of file"));
goto end_regexp; /* kludge */
}
tokadd(c);
}
}
retry:
/* skipping \r is a hack, but windows is just too pervasive. sigh. */
while ((c = nextc(true)) == ' ' || c == '\t' || c == '\r')
continue;
lexeme = lexptr ? lexptr - 1 : lexptr;
thisline = NULL;
tok = tokstart;
if (gawk_mb_cur_max == 1 || nextc_is_1stbyte)
switch (c) {
case END_SRC:
return 0;
case END_FILE:
return lasttok = NEWLINE_EOF;
case '\n':
sourceline++;
return lasttok = NEWLINE;
case '#': /* it's a comment */
if (do_pretty_print && ! do_profile) {
/*
* Collect comment byte code iff doing pretty print
* but not profiling.
*/
if (lasttok == NEWLINE || lasttok == 0)
c = get_comment(FULL_COMMENT);
else
c = get_comment(EOL_COMMENT);
if (c == END_FILE)
return lasttok = NEWLINE_EOF;
} else {
while ((c = nextc(false)) != '\n') {
if (c == END_FILE)
return lasttok = NEWLINE_EOF;
}
}
sourceline++;
return lasttok = NEWLINE;
case '@':
c = nextc(true);
if (c == '/') {
want_regexp = true;
collecting_typed_regexp = true;
goto collect_regexp;
}
pushback();
at_seen = true;
return lasttok = '@';
case '\\':
#ifdef RELAXED_CONTINUATION
/*
* This code purports to allow comments and/or whitespace
* after the `\' at the end of a line used for continuation.
* Use it at your own risk. We think it's a bad idea, which
* is why it's not on by default.
*/
if (! do_traditional) {
/* strip trailing white-space and/or comment */
while ((c = nextc(true)) == ' ' || c == '\t' || c == '\r')
continue;
if (c == '#') {
static bool warned = false;
if (do_lint && ! warned) {
warned = true;
lintwarn(
_("use of `\\ #...' line continuation is not portable"));
}
if (do_pretty_print && ! do_profile)
c = get_comment(EOL_COMMENT);
else {
while ((c = nextc(false)) != '\n')
if (c == END_FILE)
break;
}
}
pushback();
}
#endif /* RELAXED_CONTINUATION */
c = nextc(true);
if (c == '\r') /* allow MS-DOS files. bleah */
c = nextc(true);
if (c == '\n') {
sourceline++;
goto retry;
} else {
yyerror(_("backslash not last character on line"));
return lasttok = LEX_EOF;
}
break;
case ':':
case '?':
yylval = GET_INSTRUCTION(Op_cond_exp);
if (! do_posix)
allow_newline();
return lasttok = c;
/*
* in_parens is undefined unless we are parsing a print
* statement (in_print), but why bother with a check?
*/
case ')':
in_parens--;
return lasttok = c;
case '(':
in_parens++;
return lasttok = c;
case '$':
yylval = GET_INSTRUCTION(Op_field_spec);
return lasttok = c;
case '{':
if (++in_braces == 1)
firstline = sourceline;
case ';':
case ',':
case '[':
return lasttok = c;
case ']':
c = nextc(true);
pushback();
if (c == '[') {
if (do_traditional)
fatal(_("multidimensional arrays are a gawk extension"));
if (do_lint)
lintwarn(_("multidimensional arrays are a gawk extension"));
yylval = GET_INSTRUCTION(Op_sub_array);
lasttok = ']';
} else {
yylval = GET_INSTRUCTION(Op_subscript);
lasttok = SUBSCRIPT; /* end of subscripts */
}
return ']';
case '*':
if ((c = nextc(true)) == '=') {
yylval = GET_INSTRUCTION(Op_assign_times);
return lasttok = ASSIGNOP;
} else if (do_posix) {
pushback();
yylval = GET_INSTRUCTION(Op_times);
return lasttok = '*';
} else if (c == '*') {
/* make ** and **= aliases for ^ and ^= */
static bool did_warn_op = false, did_warn_assgn = false;
if (nextc(true) == '=') {
if (! did_warn_assgn) {
did_warn_assgn = true;
if (do_lint)
lintwarn(_("POSIX does not allow operator `**='"));
if (do_lint_old)
warning(_("old awk does not support operator `**='"));
}
yylval = GET_INSTRUCTION(Op_assign_exp);
return ASSIGNOP;
} else {
pushback();
if (! did_warn_op) {
did_warn_op = true;
if (do_lint)
lintwarn(_("POSIX does not allow operator `**'"));
if (do_lint_old)
warning(_("old awk does not support operator `**'"));
}
yylval = GET_INSTRUCTION(Op_exp);
return lasttok = '^';
}
}
pushback();
yylval = GET_INSTRUCTION(Op_times);
return lasttok = '*';
case '/':
if (nextc(false) == '=') {
pushback();
return lasttok = SLASH_BEFORE_EQUAL;
}
pushback();
yylval = GET_INSTRUCTION(Op_quotient);
return lasttok = '/';
case '%':
if (nextc(true) == '=') {
yylval = GET_INSTRUCTION(Op_assign_mod);
return lasttok = ASSIGNOP;
}
pushback();
yylval = GET_INSTRUCTION(Op_mod);
return lasttok = '%';
case '^':
{
static bool did_warn_op = false, did_warn_assgn = false;
if (nextc(true) == '=') {
if (do_lint_old && ! did_warn_assgn) {
did_warn_assgn = true;
warning(_("operator `^=' is not supported in old awk"));
}
yylval = GET_INSTRUCTION(Op_assign_exp);
return lasttok = ASSIGNOP;
}
pushback();
if (do_lint_old && ! did_warn_op) {
did_warn_op = true;
warning(_("operator `^' is not supported in old awk"));
}
yylval = GET_INSTRUCTION(Op_exp);
return lasttok = '^';
}
case '+':
if ((c = nextc(true)) == '=') {
yylval = GET_INSTRUCTION(Op_assign_plus);
return lasttok = ASSIGNOP;
}
if (c == '+') {
yylval = GET_INSTRUCTION(Op_symbol);
return lasttok = INCREMENT;
}
pushback();
yylval = GET_INSTRUCTION(Op_plus);
return lasttok = '+';
case '!':
if ((c = nextc(true)) == '=') {
yylval = GET_INSTRUCTION(Op_notequal);
return lasttok = RELOP;
}
if (c == '~') {
yylval = GET_INSTRUCTION(Op_nomatch);
return lasttok = MATCHOP;
}
pushback();
yylval = GET_INSTRUCTION(Op_symbol);
return lasttok = '!';
case '<':
if (nextc(true) == '=') {
yylval = GET_INSTRUCTION(Op_leq);
return lasttok = RELOP;
}
yylval = GET_INSTRUCTION(Op_less);
pushback();
return lasttok = '<';
case '=':
if (nextc(true) == '=') {
yylval = GET_INSTRUCTION(Op_equal);
return lasttok = RELOP;
}
yylval = GET_INSTRUCTION(Op_assign);
pushback();
return lasttok = ASSIGN;
case '>':
if ((c = nextc(true)) == '=') {
yylval = GET_INSTRUCTION(Op_geq);
return lasttok = RELOP;
} else if (c == '>') {
yylval = GET_INSTRUCTION(Op_symbol);
yylval->redir_type = redirect_append;
return lasttok = IO_OUT;
}
pushback();
if (in_print && in_parens == 0) {
yylval = GET_INSTRUCTION(Op_symbol);
yylval->redir_type = redirect_output;
return lasttok = IO_OUT;
}
yylval = GET_INSTRUCTION(Op_greater);
return lasttok = '>';
case '~':
yylval = GET_INSTRUCTION(Op_match);
return lasttok = MATCHOP;
case '}':
/*
* Added did newline stuff. Easier than
* hacking the grammar.
*/
if (did_newline) {
did_newline = false;
if (--in_braces == 0)
lastline = sourceline;
return lasttok = c;
}
did_newline = true;
--lexptr; /* pick up } next time */
return lasttok = NEWLINE;
case '"':
string:
esc_seen = false;
/*
* Allow any kind of junk in quoted string,
* so pass false to nextc().
*/
while ((c = nextc(false)) != '"') {
if (c == '\n') {
pushback();
yyerror(_("unterminated string"));
return lasttok = LEX_EOF;
}
if ((gawk_mb_cur_max == 1 || nextc_is_1stbyte) &&
c == '\\') {
c = nextc(true);
if (c == '\r') /* allow MS-DOS files. bleah */
c = nextc(true);
if (c == '\n') {
sourceline++;
continue;
}
esc_seen = true;
if (! want_source || c != '"')
tokadd('\\');
}
if (c == END_FILE) {
pushback();
yyerror(_("unterminated string"));
return lasttok = LEX_EOF;
}
tokadd(c);
}
yylval = GET_INSTRUCTION(Op_token);
if (want_source) {
yylval->lextok = estrdup(tokstart, tok - tokstart);
return lasttok = FILENAME;
}
yylval->opcode = Op_push_i;
yylval->memory = make_str_node(tokstart,
tok - tokstart, esc_seen ? SCAN : 0);
if (intlstr) {
yylval->memory->flags |= INTLSTR;
intlstr = false;
if (do_intl)
dumpintlstr(yylval->memory->stptr, yylval->memory->stlen);
}
return lasttok = YSTRING;
case '-':
if ((c = nextc(true)) == '=') {
yylval = GET_INSTRUCTION(Op_assign_minus);
return lasttok = ASSIGNOP;
}
if (c == '-') {
yylval = GET_INSTRUCTION(Op_symbol);
return lasttok = DECREMENT;
}
pushback();
yylval = GET_INSTRUCTION(Op_minus);
return lasttok = '-';
case '.':
c = nextc(true);
pushback();
if (! isdigit(c))
return lasttok = '.';
else
c = '.';
/* FALL THROUGH */
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
/* It's a number */
for (;;) {
bool gotnumber = false;
tokadd(c);
switch (c) {
case 'x':
case 'X':
if (do_traditional)
goto done;
if (tok == tokstart + 2) {
int peek = nextc(true);
if (isxdigit(peek)) {
inhex = true;
pushback(); /* following digit */
} else {
pushback(); /* x or X */
goto done;
}
}
break;
case '.':
/* period ends exponent part of floating point number */
if (seen_point || seen_e) {
gotnumber = true;
break;
}
seen_point = true;
break;
case 'e':
case 'E':
if (inhex)
break;
if (seen_e) {
gotnumber = true;
break;
}
seen_e = true;
if ((c = nextc(true)) == '-' || c == '+') {
int c2 = nextc(true);
if (isdigit(c2)) {
tokadd(c);
tokadd(c2);
} else {
pushback(); /* non-digit after + or - */
pushback(); /* + or - */
pushback(); /* e or E */
}
} else if (! isdigit(c)) {
pushback(); /* character after e or E */
pushback(); /* e or E */
} else {
pushback(); /* digit */
}
break;
case 'a':
case 'A':
case 'b':
case 'B':
case 'c':
case 'C':
case 'D':
case 'd':
case 'f':
case 'F':
if (do_traditional || ! inhex)
goto done;
/* fall through */
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
break;
default:
done:
gotnumber = true;
}
if (gotnumber)
break;
c = nextc(true);
}
pushback();
tokadd('\0');
yylval = GET_INSTRUCTION(Op_push_i);
base = 10;
if (! do_traditional) {
base = get_numbase(tokstart, strlen(tokstart)-1, false);
if (do_lint) {
if (base == 8)
lintwarn("numeric constant `%.*s' treated as octal",
(int) strlen(tokstart)-1, tokstart);
else if (base == 16)
lintwarn("numeric constant `%.*s' treated as hexadecimal",
(int) strlen(tokstart)-1, tokstart);
}
}
#ifdef HAVE_MPFR
if (do_mpfr) {
NODE *r;
if (! seen_point && ! seen_e) {
r = mpg_integer();
mpg_strtoui(r->mpg_i, tokstart, strlen(tokstart), NULL, base);
errno = 0;
} else {
int tval;
r = mpg_float();
tval = mpfr_strtofr(r->mpg_numbr, tokstart, NULL, base, ROUND_MODE);
errno = 0;
IEEE_FMT(r->mpg_numbr, tval);
}
yylval->memory = set_profile_text(r, tokstart, strlen(tokstart)-1);
return lasttok = YNUMBER;
}
#endif
if (base != 10)
d = nondec2awknum(tokstart, strlen(tokstart)-1, NULL);
else
d = atof(tokstart);
yylval->memory = set_profile_text(make_number(d), tokstart, strlen(tokstart) - 1);
if (d <= INT32_MAX && d >= INT32_MIN && d == (int32_t) d)
yylval->memory->flags |= NUMINT;
return lasttok = YNUMBER;
case '&':
if ((c = nextc(true)) == '&') {
yylval = GET_INSTRUCTION(Op_and);
allow_newline();
return lasttok = LEX_AND;
}
pushback();
yylval = GET_INSTRUCTION(Op_symbol);
return lasttok = '&';
case '|':
if ((c = nextc(true)) == '|') {
yylval = GET_INSTRUCTION(Op_or);
allow_newline();
return lasttok = LEX_OR;
} else if (! do_traditional && c == '&') {
yylval = GET_INSTRUCTION(Op_symbol);
yylval->redir_type = redirect_twoway;
return lasttok = (in_print && in_parens == 0 ? IO_OUT : IO_IN);
}
pushback();
if (in_print && in_parens == 0) {
yylval = GET_INSTRUCTION(Op_symbol);
yylval->redir_type = redirect_pipe;
return lasttok = IO_OUT;
} else {
yylval = GET_INSTRUCTION(Op_symbol);
yylval->redir_type = redirect_pipein;
return lasttok = IO_IN;
}
}
if (! is_letter(c)) {
yyerror(_("invalid char '%c' in expression"), c);
return lasttok = LEX_EOF;
}
/*
* Lots of fog here. Consider:
*
* print "xyzzy"$_"foo"
*
* Without the check for ` lasttok != '$' ', this is parsed as
*
* print "xxyzz" $(_"foo")
*
* With the check, it is "correctly" parsed as three
* string concatenations. Sigh. This seems to be
* "more correct", but this is definitely one of those
* occasions where the interactions are funny.
*/
if (! do_traditional && c == '_' && lasttok != '$') {
if ((c = nextc(true)) == '"') {
intlstr = true;
goto string;
}
pushback();
c = '_';
}
/* it's some type of name-type-thing. Find its length. */
tok = tokstart;
while (c != END_FILE && is_identchar(c)) {
tokadd(c);
c = nextc(true);
}
tokadd('\0');
pushback();
/* See if it is a special token. */
if ((mid = check_special(tokstart)) >= 0) {
static int warntab[sizeof(tokentab) / sizeof(tokentab[0])];
int class = tokentab[mid].class;
if ((class == LEX_INCLUDE || class == LEX_LOAD || class == LEX_EVAL)
&& lasttok != '@')
goto out;
/* allow parameter names to shadow the names of gawk extension built-ins */
if ((tokentab[mid].flags & GAWKX) != 0) {
NODE *f;
switch (want_param_names) {
case FUNC_HEADER:
/* in header, defining parameter names */
goto out;
case FUNC_BODY:
/* in body, name must be in symbol table for it to be a parameter */
if ((f = lookup(tokstart)) != NULL) {
if (f->type == Node_builtin_func)
break;
else
goto out;
}
/* else
fall through */
case DONT_CHECK:
/* regular code */
break;
default:
cant_happen();
break;
}
}
if (do_lint) {
if ((tokentab[mid].flags & GAWKX) != 0 && (warntab[mid] & GAWKX) == 0) {
lintwarn(_("`%s' is a gawk extension"),
tokentab[mid].operator);
warntab[mid] |= GAWKX;
}
if ((tokentab[mid].flags & NOT_POSIX) != 0 && (warntab[mid] & NOT_POSIX) == 0) {
lintwarn(_("POSIX does not allow `%s'"),
tokentab[mid].operator);
warntab[mid] |= NOT_POSIX;
}
}
if (do_lint_old && (tokentab[mid].flags & NOT_OLD) != 0
&& (warntab[mid] & NOT_OLD) == 0
) {
warning(_("`%s' is not supported in old awk"),
tokentab[mid].operator);
warntab[mid] |= NOT_OLD;
}
if ((tokentab[mid].flags & BREAK) != 0)
break_allowed++;
if ((tokentab[mid].flags & CONTINUE) != 0)
continue_allowed++;
switch (class) {
case LEX_INCLUDE:
case LEX_LOAD:
want_source = true;
break;
case LEX_EVAL:
if (in_main_context())
goto out;
emalloc(tokkey, char *, tok - tokstart + 1, "yylex");
tokkey[0] = '@';
memcpy(tokkey + 1, tokstart, tok - tokstart);
yylval = GET_INSTRUCTION(Op_token);
yylval->lextok = tokkey;
break;
case LEX_FUNCTION:
case LEX_BEGIN:
case LEX_END:
case LEX_BEGINFILE:
case LEX_ENDFILE:
yylval = bcalloc(tokentab[mid].value, 3, sourceline);
break;
case LEX_FOR:
case LEX_WHILE:
case LEX_DO:
case LEX_SWITCH:
if (! do_pretty_print)
return lasttok = class;
/* fall through */
case LEX_CASE:
yylval = bcalloc(tokentab[mid].value, 2, sourceline);
break;
/*
* These must be checked here, due to the LALR nature of the parser,
* the rules for continue and break may not be reduced until after
* a token that increments the xxx_allowed varibles is seen. Bleah.
*/
case LEX_CONTINUE:
if (! continue_allowed) {
error_ln(sourceline,
_("`continue' is not allowed outside a loop"));
errcount++;
}
goto make_instruction;
case LEX_BREAK:
if (! break_allowed) {
error_ln(sourceline,
_("`break' is not allowed outside a loop or switch"));
errcount++;
}
goto make_instruction;
default:
make_instruction:
yylval = GET_INSTRUCTION(tokentab[mid].value);
if (class == LEX_BUILTIN || class == LEX_LENGTH)
yylval->builtin_idx = mid;
break;
}
return lasttok = class;
}
out:
tokkey = estrdup(tokstart, tok - tokstart);
if (*lexptr == '(') {
yylval = bcalloc(Op_token, 2, sourceline);
yylval->lextok = tokkey;
return lasttok = FUNC_CALL;
} else {
static bool goto_warned = false;
yylval = GET_INSTRUCTION(Op_token);
yylval->lextok = tokkey;
#define SMART_ALECK 1
if (SMART_ALECK && do_lint
&& ! goto_warned && strcasecmp(tokkey, "goto") == 0) {
goto_warned = true;
lintwarn(_("`goto' considered harmful!\n"));
}
return lasttok = NAME;
}
#undef GET_INSTRUCTION
#undef NEWLINE_EOF
}
/* It's EBCDIC in a Bison grammar, run for the hills!
Or, convert single-character tokens coming out of yylex() from EBCDIC to
ASCII values on-the-fly so that the parse tables need not be regenerated
for EBCDIC systems. */
#ifdef USE_EBCDIC
static int
yylex(void)
{
static char etoa_xlate[256];
static int do_etoa_init = 1;
int tok;
if (do_etoa_init)
{
for (tok = 0; tok < 256; tok++)
etoa_xlate[tok] = (char) tok;
#ifdef HAVE___ETOA_L
/* IBM helpfully provides this function. */
__etoa_l(etoa_xlate, sizeof(etoa_xlate));
#else
# error "An EBCDIC-to-ASCII translation function is needed for this system"
#endif
do_etoa_init = 0;
}
tok = yylex_ebcdic();
if (tok >= 0 && tok <= 0xFF)
tok = etoa_xlate[tok];
return tok;
}
#endif /* USE_EBCDIC */
/* snode --- instructions for builtin functions. Checks for arg. count
and supplies defaults where possible. */
static INSTRUCTION *
snode(INSTRUCTION *subn, INSTRUCTION *r)
{
INSTRUCTION *arg;
INSTRUCTION *ip;
NODE *n;
int nexp = 0;
int args_allowed;
int idx = r->builtin_idx;
if (subn != NULL) {
INSTRUCTION *tp;
for (tp = subn->nexti; tp; tp = tp->nexti) {
tp = tp->lasti;
nexp++;
}
assert(nexp > 0);
}
/* check against how many args. are allowed for this builtin */
args_allowed = tokentab[idx].flags & ARGS;
if (args_allowed && (args_allowed & A(nexp)) == 0) {
yyerror(_("%d is invalid as number of arguments for %s"),
nexp, tokentab[idx].operator);
return NULL;
}
/* special processing for sub, gsub and gensub */
if (tokentab[idx].value == Op_sub_builtin) {
const char *operator = tokentab[idx].operator;
r->sub_flags = 0;
arg = subn->nexti; /* first arg list */
(void) mk_rexp(arg);
if (strcmp(operator, "gensub") != 0) {
/* sub and gsub */
if (strcmp(operator, "gsub") == 0)
r->sub_flags |= GSUB;
arg = arg->lasti->nexti; /* 2nd arg list */
if (nexp == 2) {
INSTRUCTION *expr;
expr = list_create(instruction(Op_push_i));
expr->nexti->memory = set_profile_text(make_number(0.0), "0", 1);
(void) mk_expression_list(subn,
list_append(expr, instruction(Op_field_spec)));
}
arg = arg->lasti->nexti; /* third arg list */
ip = arg->lasti;
if (ip->opcode == Op_push_i) {
if (do_lint)
lintwarn(_("%s: string literal as last arg of substitute has no effect"),
operator);
r->sub_flags |= LITERAL;
} else {
if (make_assignable(ip) == NULL)
yyerror(_("%s third parameter is not a changeable object"),
operator);
else
ip->do_reference = true;
}
r->expr_count = count_expressions(&subn, false);
ip = subn->lasti;
(void) list_append(subn, r);
/* add after_assign code */
if (ip->opcode == Op_push_lhs && ip->memory->type == Node_var && ip->memory->var_assign) {
(void) list_append(subn, instruction(Op_var_assign));
subn->lasti->assign_ctxt = Op_sub_builtin;
subn->lasti->assign_var = ip->memory->var_assign;
} else if (ip->opcode == Op_field_spec_lhs) {
(void) list_append(subn, instruction(Op_field_assign));
subn->lasti->assign_ctxt = Op_sub_builtin;
subn->lasti->field_assign = (Func_ptr) 0;
ip->target_assign = subn->lasti;
} else if (ip->opcode == Op_subscript_lhs) {
(void) list_append(subn, instruction(Op_subscript_assign));
subn->lasti->assign_ctxt = Op_sub_builtin;
}
return subn;
} else {
/* gensub */
r->sub_flags |= GENSUB;
if (nexp == 3) {
ip = instruction(Op_push_i);
ip->memory = set_profile_text(make_number(0.0), "0", 1);
(void) mk_expression_list(subn,
list_append(list_create(ip), instruction(Op_field_spec)));
}
r->expr_count = count_expressions(&subn, false);
return list_append(subn, r);
}
}
#ifdef HAVE_MPFR
/* N.B.: If necessary, add special processing for alternate builtin, below */
if (do_mpfr && tokentab[idx].ptr2)
r->builtin = tokentab[idx].ptr2;
else
#endif
r->builtin = tokentab[idx].ptr;
/* special case processing for a few builtins */
if (r->builtin == do_length) {
if (nexp == 0) {
/* no args. Use $0 */
INSTRUCTION *list;
r->expr_count = 1;
list = list_create(r);
(void) list_prepend(list, instruction(Op_field_spec));
(void) list_prepend(list, instruction(Op_push_i));
list->nexti->memory = set_profile_text(make_number(0.0), "0", 1);
return list;
} else {
arg = subn->nexti;
if (arg->nexti == arg->lasti && arg->nexti->opcode == Op_push)
arg->nexti->opcode = Op_push_arg; /* argument may be array */
}
} else if (r->builtin == do_isarray || r->builtin == do_typeof) {
arg = subn->nexti;
if (arg->nexti == arg->lasti && arg->nexti->opcode == Op_push)
arg->nexti->opcode = Op_push_arg_untyped; /* argument may be untyped */
#ifdef SUPPLY_INTDIV
} else if (r->builtin == do_intdiv
#ifdef HAVE_MPFR
|| r->builtin == MPF(intdiv)
#endif
) {
arg = subn->nexti->lasti->nexti->lasti->nexti; /* 3rd arg list */
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
#endif /* SUPPLY_INTDIV */
} else if (r->builtin == do_match) {
static bool warned = false;
arg = subn->nexti->lasti->nexti; /* 2nd arg list */
(void) mk_rexp(arg);
if (nexp == 3) { /* 3rd argument there */
if (do_lint && ! warned) {
warned = true;
lintwarn(_("match: third argument is a gawk extension"));
}
if (do_traditional) {
yyerror(_("match: third argument is a gawk extension"));
return NULL;
}
arg = arg->lasti->nexti; /* third arg list */
ip = arg->lasti;
if (/*ip == arg->nexti && */ ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
} else if (r->builtin == do_split) {
arg = subn->nexti->lasti->nexti; /* 2nd arg list */
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
if (nexp == 2) {
INSTRUCTION *expr;
expr = list_create(instruction(Op_push));
expr->nexti->memory = FS_node;
(void) mk_expression_list(subn, expr);
}
arg = arg->lasti->nexti;
n = mk_rexp(arg);
if (nexp == 2)
n->re_flags |= FS_DFLT;
if (nexp == 4) {
arg = arg->lasti->nexti;
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
} else if (r->builtin == do_patsplit) {
arg = subn->nexti->lasti->nexti; /* 2nd arg list */
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
if (nexp == 2) {
INSTRUCTION *expr;
expr = list_create(instruction(Op_push));
expr->nexti->memory = FPAT_node;
(void) mk_expression_list(subn, expr);
}
arg = arg->lasti->nexti;
n = mk_rexp(arg);
if (nexp == 4) {
arg = arg->lasti->nexti;
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
} else if (r->builtin == do_close) {
static bool warned = false;
if (nexp == 2) {
if (do_lint && ! warned) {
warned = true;
lintwarn(_("close: second argument is a gawk extension"));
}
if (do_traditional) {
yyerror(_("close: second argument is a gawk extension"));
return NULL;
}
}
} else if (do_intl /* --gen-po */
&& r->builtin == do_dcgettext /* dcgettext(...) */
&& subn->nexti->lasti->opcode == Op_push_i /* 1st arg is constant */
&& (subn->nexti->lasti->memory->flags & STRING) != 0) { /* it's a string constant */
/* ala xgettext, dcgettext("some string" ...) dumps the string */
NODE *str = subn->nexti->lasti->memory;
if ((str->flags & INTLSTR) != 0)
warning(_("use of dcgettext(_\"...\") is incorrect: remove leading underscore"));
/* don't dump it, the lexer already did */
else
dumpintlstr(str->stptr, str->stlen);
} else if (do_intl /* --gen-po */
&& r->builtin == do_dcngettext /* dcngettext(...) */
&& subn->nexti->lasti->opcode == Op_push_i /* 1st arg is constant */
&& (subn->nexti->lasti->memory->flags & STRING) != 0 /* it's a string constant */
&& subn->nexti->lasti->nexti->lasti->opcode == Op_push_i /* 2nd arg is constant too */
&& (subn->nexti->lasti->nexti->lasti->memory->flags & STRING) != 0) { /* it's a string constant */
/* ala xgettext, dcngettext("some string", "some plural" ...) dumps the string */
NODE *str1 = subn->nexti->lasti->memory;
NODE *str2 = subn->nexti->lasti->nexti->lasti->memory;
if (((str1->flags | str2->flags) & INTLSTR) != 0)
warning(_("use of dcngettext(_\"...\") is incorrect: remove leading underscore"));
else
dumpintlstr2(str1->stptr, str1->stlen, str2->stptr, str2->stlen);
} else if (r->builtin == do_asort || r->builtin == do_asorti) {
arg = subn->nexti; /* 1st arg list */
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
if (nexp >= 2) {
arg = ip->nexti;
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
}
else if (r->builtin == do_index) {
arg = subn->nexti->lasti->nexti; /* 2nd arg list */
ip = arg->lasti;
if (ip->opcode == Op_match_rec)
fatal(_("index: regexp constant as second argument is not allowed"));
}
#ifdef ARRAYDEBUG
else if (r->builtin == do_adump) {
ip = subn->nexti->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
#endif
if (subn != NULL) {
r->expr_count = count_expressions(&subn, false);
return list_append(subn, r);
}
r->expr_count = 0;
return list_create(r);
}
/* parms_shadow --- check if parameters shadow globals */
static int
parms_shadow(INSTRUCTION *pc, bool *shadow)
{
int pcount, i;
bool ret = false;
NODE *func, *fp;
char *fname;
func = pc->func_body;
fname = func->vname;
fp = func->fparms;
#if 0 /* can't happen, already exited if error ? */
if (fname == NULL || func == NULL) /* error earlier */
return false;
#endif
pcount = func->param_cnt;
if (pcount == 0) /* no args, no problem */
return 0;
source = pc->source_file;
sourceline = pc->source_line;
/*
* Use warning() and not lintwarn() so that can warn
* about all shadowed parameters.
*/
for (i = 0; i < pcount; i++) {
if (lookup(fp[i].param) != NULL) {
warning(
_("function `%s': parameter `%s' shadows global variable"),
fname, fp[i].param);
ret = true;
}
}
*shadow |= ret;
return 0;
}
/* valinfo --- dump var info */
void
valinfo(NODE *n, Func_print print_func, FILE *fp)
{
if (n == Nnull_string)
print_func(fp, "uninitialized scalar\n");
else if ((n->flags & REGEX) != 0)
print_func(fp, "@/%.*s/\n", n->stlen, n->stptr);
else if ((n->flags & STRING) != 0) {
pp_string_fp(print_func, fp, n->stptr, n->stlen, '"', false);
print_func(fp, "\n");
} else if ((n->flags & NUMBER) != 0) {
#ifdef HAVE_MPFR
if (is_mpg_float(n))
print_func(fp, "%s\n", mpg_fmt("%.17R*g", ROUND_MODE, n->mpg_numbr));
else if (is_mpg_integer(n))
print_func(fp, "%s\n", mpg_fmt("%Zd", n->mpg_i));
else
#endif
print_func(fp, "%.17g\n", n->numbr);
} else
print_func(fp, "?? flags %s\n", flags2str(n->flags));
}
/* dump_vars --- dump the symbol table */
void
dump_vars(const char *fname)
{
FILE *fp;
NODE **vars;
if (fname == NULL)
fp = stderr;
else if (strcmp(fname, "-") == 0)
fp = stdout;
else if ((fp = fopen(fname, "w")) == NULL) {
warning(_("could not open `%s' for writing (%s)"), fname, strerror(errno));
warning(_("sending variable list to standard error"));
fp = stderr;
}
vars = variable_list();
print_vars(vars, fprintf, fp);
efree(vars);
if (fp != stdout && fp != stderr && fclose(fp) != 0)
warning(_("%s: close failed (%s)"), fname, strerror(errno));
}
/* dump_funcs --- print all functions */
void
dump_funcs()
{
NODE **funcs;
funcs = function_list(true);
(void) foreach_func(funcs, (int (*)(INSTRUCTION *, void *)) pp_func, (void *) 0);
efree(funcs);
}
/* shadow_funcs --- check all functions for parameters that shadow globals */
void
shadow_funcs()
{
static int calls = 0;
bool shadow = false;
NODE **funcs;
if (calls++ != 0)
fatal(_("shadow_funcs() called twice!"));
funcs = function_list(true);
(void) foreach_func(funcs, (int (*)(INSTRUCTION *, void *)) parms_shadow, & shadow);
efree(funcs);
/* End with fatal if the user requested it. */
if (shadow && lintfunc == r_fatal)
lintwarn(_("there were shadowed variables."));
}
/* mk_function --- finalize function definition node; remove parameters
* out of the symbol table.
*/
static INSTRUCTION *
mk_function(INSTRUCTION *fi, INSTRUCTION *def)
{
NODE *thisfunc;
thisfunc = fi->func_body;
assert(thisfunc != NULL);
if (do_optimize && def->lasti->opcode == Op_pop) {
/* tail call which does not return any value. */
INSTRUCTION *t;
for (t = def->nexti; t->nexti != def->lasti; t = t->nexti)
;
if (t->opcode == Op_func_call
&& strcmp(t->func_name, thisfunc->vname) == 0)
(t + 1)->tail_call = true;
}
/* add any pre-function comment to start of action for profile.c */
if (function_comment != NULL) {
function_comment->source_line = 0;
(void) list_prepend(def, function_comment);
function_comment = NULL;
}
/* add an implicit return at end;
* also used by 'return' command in debugger
*/
(void) list_append(def, instruction(Op_push_i));
def->lasti->memory = dupnode(Nnull_string);
(void) list_append(def, instruction(Op_K_return));
if (do_pretty_print)
(void) list_prepend(def, instruction(Op_exec_count));
/* fi->opcode = Op_func */
(fi + 1)->firsti = def->nexti;
(fi + 1)->lasti = def->lasti;
(fi + 2)->first_line = fi->source_line;
(fi + 2)->last_line = lastline;
fi->nexti = def->nexti;
bcfree(def);
(void) list_append(rule_list, fi + 1); /* debugging */
/* update lint table info */
func_use(thisfunc->vname, FUNC_DEFINE);
/* remove params from symbol table */
remove_params(thisfunc);
return fi;
}
/*
* install_function:
* install function name in the symbol table.
* Extra work, build up and install a list of the parameter names.
*/
static int
install_function(char *fname, INSTRUCTION *fi, INSTRUCTION *plist)
{
NODE *r, *f;
int pcount = 0;
r = lookup(fname);
if (r != NULL) {
error_ln(fi->source_line, _("function name `%s' previously defined"), fname);
return -1;
}
if (plist != NULL)
pcount = plist->lasti->param_count + 1;
f = install_symbol(fname, Node_func);
fi->func_body = f;
f->param_cnt = pcount;
f->code_ptr = fi;
f->fparms = NULL;
if (pcount > 0) {
char **pnames;
pnames = check_params(fname, pcount, plist); /* frees plist */
f->fparms = make_params(pnames, pcount);
efree(pnames);
install_params(f);
}
return 0;
}
/* check_params --- build a list of function parameter names after
* making sure that the names are valid and there are no duplicates.
*/
static char **
check_params(char *fname, int pcount, INSTRUCTION *list)
{
INSTRUCTION *p, *np;
int i, j;
char *name;
char **pnames;
assert(pcount > 0);
emalloc(pnames, char **, pcount * sizeof(char *), "check_params");
for (i = 0, p = list->nexti; p != NULL; i++, p = np) {
np = p->nexti;
name = p->lextok;
p->lextok = NULL;
if (strcmp(name, fname) == 0) {
/* check for function foo(foo) { ... }. bleah. */
error_ln(p->source_line,
_("function `%s': can't use function name as parameter name"), fname);
} else if (is_std_var(name)) {
error_ln(p->source_line,
_("function `%s': can't use special variable `%s' as a function parameter"),
fname, name);
}
/* check for duplicate parameters */
for (j = 0; j < i; j++) {
if (strcmp(name, pnames[j]) == 0) {
error_ln(p->source_line,
_("function `%s': parameter #%d, `%s', duplicates parameter #%d"),
fname, i + 1, name, j + 1);
}
}
pnames[i] = name;
bcfree(p);
}
bcfree(list);
return pnames;
}
#ifdef HASHSIZE
undef HASHSIZE
#endif
#define HASHSIZE 1021
static struct fdesc {
char *name;
short used;
short defined;
short extension;
struct fdesc *next;
} *ftable[HASHSIZE];
/* func_use --- track uses and definitions of functions */
static void
func_use(const char *name, enum defref how)
{
struct fdesc *fp;
int len;
int ind;
len = strlen(name);
ind = hash(name, len, HASHSIZE, NULL);
for (fp = ftable[ind]; fp != NULL; fp = fp->next)
if (strcmp(fp->name, name) == 0)
goto update_value;
/* not in the table, fall through to allocate a new one */
ezalloc(fp, struct fdesc *, sizeof(struct fdesc), "func_use");
emalloc(fp->name, char *, len + 1, "func_use");
strcpy(fp->name, name);
fp->next = ftable[ind];
ftable[ind] = fp;
update_value:
if (how == FUNC_DEFINE)
fp->defined++;
else if (how == FUNC_EXT) {
fp->defined++;
fp->extension++;
} else
fp->used++;
}
/* track_ext_func --- add an extension function to the table */
void
track_ext_func(const char *name)
{
func_use(name, FUNC_EXT);
}
/* check_funcs --- verify functions that are called but not defined */
static void
check_funcs()
{
struct fdesc *fp, *next;
int i;
if (! in_main_context())
goto free_mem;
for (i = 0; i < HASHSIZE; i++) {
for (fp = ftable[i]; fp != NULL; fp = fp->next) {
#ifdef REALLYMEAN
/* making this the default breaks old code. sigh. */
if (fp->defined == 0 && ! fp->extension) {
error(
_("function `%s' called but never defined"), fp->name);
errcount++;
}
#else
if (do_lint && fp->defined == 0 && ! fp->extension)
lintwarn(
_("function `%s' called but never defined"), fp->name);
#endif
if (do_lint && fp->used == 0 && ! fp->extension) {
lintwarn(_("function `%s' defined but never called directly"),
fp->name);
}
}
}
free_mem:
/* now let's free all the memory */
for (i = 0; i < HASHSIZE; i++) {
for (fp = ftable[i]; fp != NULL; fp = next) {
next = fp->next;
efree(fp->name);
efree(fp);
}
ftable[i] = NULL;
}
}
/* param_sanity --- look for parameters that are regexp constants */
static void
param_sanity(INSTRUCTION *arglist)
{
INSTRUCTION *argl, *arg;
int i = 1;
if (arglist == NULL)
return;
for (argl = arglist->nexti; argl; ) {
arg = argl->lasti;
if (arg->opcode == Op_match_rec)
warning_ln(arg->source_line,
_("regexp constant for parameter #%d yields boolean value"), i);
argl = arg->nexti;
i++;
}
}
/* variable --- make sure NAME is in the symbol table */
NODE *
variable(int location, char *name, NODETYPE type)
{
NODE *r;
if ((r = lookup(name)) != NULL) {
if (r->type == Node_func || r->type == Node_ext_func )
error_ln(location, _("function `%s' called with space between name and `(',\nor used as a variable or an array"),
r->vname);
} else {
/* not found */
return install_symbol(name, type);
}
efree(name);
return r;
}
/* make_regnode --- make a regular expression node */
NODE *
make_regnode(int type, NODE *exp)
{
NODE *n;
assert(type == Node_regex || type == Node_dynregex);
getnode(n);
memset(n, 0, sizeof(NODE));
n->type = type;
n->re_cnt = 1;
if (type == Node_regex) {
n->re_reg[0] = make_regexp(exp->stptr, exp->stlen, false, true, false);
if (n->re_reg[0] == NULL) {
freenode(n);
return NULL;
}
n->re_reg[1] = make_regexp(exp->stptr, exp->stlen, true, true, false);
if (n->re_reg[1] == NULL) {
refree(n->re_reg[0]);
freenode(n);
return NULL;
}
n->re_exp = exp;
n->re_flags = CONSTANT;
}
return n;
}
/* mk_rexp --- make a regular expression constant */
static NODE *
mk_rexp(INSTRUCTION *list)
{
INSTRUCTION *ip;
ip = list->nexti;
if (ip == list->lasti && ip->opcode == Op_match_rec)
ip->opcode = Op_push_re;
else if (ip == list->lasti && ip->opcode == Op_push_re)
; /* do nothing --- @/.../ */
else {
ip = instruction(Op_push_re);
ip->memory = make_regnode(Node_dynregex, NULL);
ip->nexti = list->lasti->nexti;
list->lasti->nexti = ip;
list->lasti = ip;
}
return ip->memory;
}
#ifndef NO_LINT
/* isnoeffect --- when used as a statement, has no side effects */
static int
isnoeffect(OPCODE type)
{
switch (type) {
case Op_times:
case Op_times_i:
case Op_quotient:
case Op_quotient_i:
case Op_mod:
case Op_mod_i:
case Op_plus:
case Op_plus_i:
case Op_minus:
case Op_minus_i:
case Op_subscript:
case Op_concat:
case Op_exp:
case Op_exp_i:
case Op_unary_minus:
case Op_field_spec:
case Op_and_final:
case Op_or_final:
case Op_equal:
case Op_notequal:
case Op_less:
case Op_greater:
case Op_leq:
case Op_geq:
case Op_match:
case Op_nomatch:
case Op_match_rec:
case Op_not:
case Op_in_array:
return true;
default:
break; /* keeps gcc -Wall happy */
}
return false;
}
#endif /* NO_LINT */
/* make_assignable --- make this operand an assignable one if posiible */
static INSTRUCTION *
make_assignable(INSTRUCTION *ip)
{
switch (ip->opcode) {
case Op_push:
ip->opcode = Op_push_lhs;
return ip;
case Op_field_spec:
ip->opcode = Op_field_spec_lhs;
return ip;
case Op_subscript:
ip->opcode = Op_subscript_lhs;
return ip;
default:
break; /* keeps gcc -Wall happy */
}
return NULL;
}
/* stopme --- for debugging */
NODE *
stopme(int nargs ATTRIBUTE_UNUSED)
{
return make_number(0.0);
}
/* dumpintlstr --- write out an initial .po file entry for the string */
static void
dumpintlstr(const char *str, size_t len)
{
char *cp;
/* See the GNU gettext distribution for details on the file format */
if (source != NULL) {
/* ala the gettext sources, remove leading `./'s */
for (cp = source; cp[0] == '.' && cp[1] == '/'; cp += 2)
continue;
printf("#: %s:%d\n", cp, sourceline);
}
printf("msgid ");
pp_string_fp(fprintf, stdout, str, len, '"', true);
putchar('\n');
printf("msgstr \"\"\n\n");
fflush(stdout);
}
/* dumpintlstr2 --- write out an initial .po file entry for the string and its plural */
static void
dumpintlstr2(const char *str1, size_t len1, const char *str2, size_t len2)
{
char *cp;
/* See the GNU gettext distribution for details on the file format */
if (source != NULL) {
/* ala the gettext sources, remove leading `./'s */
for (cp = source; cp[0] == '.' && cp[1] == '/'; cp += 2)
continue;
printf("#: %s:%d\n", cp, sourceline);
}
printf("msgid ");
pp_string_fp(fprintf, stdout, str1, len1, '"', true);
putchar('\n');
printf("msgid_plural ");
pp_string_fp(fprintf, stdout, str2, len2, '"', true);
putchar('\n');
printf("msgstr[0] \"\"\nmsgstr[1] \"\"\n\n");
fflush(stdout);
}
/* mk_binary --- instructions for binary operators */
static INSTRUCTION *
mk_binary(INSTRUCTION *s1, INSTRUCTION *s2, INSTRUCTION *op)
{
INSTRUCTION *ip1,*ip2;
AWKNUM res;
ip2 = s2->nexti;
if (s2->lasti == ip2 && ip2->opcode == Op_push_i) {
/* do any numeric constant folding */
ip1 = s1->nexti;
if (do_optimize
&& ip1 == s1->lasti && ip1->opcode == Op_push_i
&& (ip1->memory->flags & (MPFN|MPZN|STRCUR|STRING)) == 0
&& (ip2->memory->flags & (MPFN|MPZN|STRCUR|STRING)) == 0
) {
NODE *n1 = ip1->memory, *n2 = ip2->memory;
res = force_number(n1)->numbr;
(void) force_number(n2);
switch (op->opcode) {
case Op_times:
res *= n2->numbr;
break;
case Op_quotient:
if (n2->numbr == 0.0) {
/* don't fatalize, allow parsing rest of the input */
error_ln(op->source_line, _("division by zero attempted"));
goto regular;
}
res /= n2->numbr;
break;
case Op_mod:
if (n2->numbr == 0.0) {
/* don't fatalize, allow parsing rest of the input */
error_ln(op->source_line, _("division by zero attempted in `%%'"));
goto regular;
}
#ifdef HAVE_FMOD
res = fmod(res, n2->numbr);
#else /* ! HAVE_FMOD */
(void) modf(res / n2->numbr, &res);
res = n1->numbr - res * n2->numbr;
#endif /* ! HAVE_FMOD */
break;
case Op_plus:
res += n2->numbr;
break;
case Op_minus:
res -= n2->numbr;
break;
case Op_exp:
res = calc_exp(res, n2->numbr);
break;
default:
goto regular;
}
op->opcode = Op_push_i;
// We don't need to call set_profile_text() here since
// optimizing is disabled when doing pretty printing.
op->memory = make_number(res);
unref(n1);
unref(n2);
bcfree(ip1);
bcfree(ip2);
bcfree(s1);
bcfree(s2);
return list_create(op);
} else {
/* do basic arithmetic optimisation */
/* convert (Op_push_i Node_val) + (Op_plus) to (Op_plus_i Node_val) */
switch (op->opcode) {
case Op_times:
op->opcode = Op_times_i;
break;
case Op_quotient:
op->opcode = Op_quotient_i;
break;
case Op_mod:
op->opcode = Op_mod_i;
break;
case Op_plus:
op->opcode = Op_plus_i;
break;
case Op_minus:
op->opcode = Op_minus_i;
break;
case Op_exp:
op->opcode = Op_exp_i;
break;
default:
goto regular;
}
op->memory = ip2->memory;
bcfree(ip2);
bcfree(s2); /* Op_list */
return list_append(s1, op);
}
}
regular:
/* append lists s1, s2 and add `op' bytecode */
(void) list_merge(s1, s2);
return list_append(s1, op);
}
/* mk_boolean --- instructions for boolean and, or */
static INSTRUCTION *
mk_boolean(INSTRUCTION *left, INSTRUCTION *right, INSTRUCTION *op)
{
INSTRUCTION *tp;
OPCODE opc, final_opc;
opc = op->opcode; /* Op_and or Op_or */
final_opc = (opc == Op_or) ? Op_or_final : Op_and_final;
add_lint(right, LINT_assign_in_cond);
tp = left->lasti;
if (tp->opcode != final_opc) { /* x || y */
list_append(right, instruction(final_opc));
add_lint(left, LINT_assign_in_cond);
(void) list_append(left, op);
left->lasti->target_jmp = right->lasti;
/* NB: target_stmt points to previous Op_and(Op_or) in a chain;
* target_stmt only used in the parser (see below).
*/
left->lasti->target_stmt = left->lasti;
right->lasti->target_stmt = left->lasti;
} else { /* optimization for x || y || z || ... */
INSTRUCTION *ip;
op->opcode = final_opc;
(void) list_append(right, op);
op->target_stmt = tp;
tp->opcode = opc;
tp->target_jmp = op;
/* update jump targets */
for (ip = tp->target_stmt; ; ip = ip->target_stmt) {
assert(ip->opcode == opc);
assert(ip->target_jmp == tp);
/* if (ip->opcode == opc && ip->target_jmp == tp) */
ip->target_jmp = op;
if (ip->target_stmt == ip)
break;
}
}
return list_merge(left, right);
}
/* mk_condition --- if-else and conditional */
static INSTRUCTION *
mk_condition(INSTRUCTION *cond, INSTRUCTION *ifp, INSTRUCTION *true_branch,
INSTRUCTION *elsep, INSTRUCTION *false_branch)
{
/*
* ----------------
* cond
* ----------------
* t: [Op_jmp_false f ]
* ----------------
* true_branch
*
* ----------------
* [Op_jmp y]
* ----------------
* f:
* false_branch
* ----------------
* y: [Op_no_op]
* ----------------
*/
INSTRUCTION *ip;
bool setup_else_part = true;
if (false_branch == NULL) {
false_branch = list_create(instruction(Op_no_op));
if (elsep == NULL) { /* else { } */
setup_else_part = false;
}
} else {
/* assert(elsep != NULL); */
/* avoid a series of no_op's: if .. else if .. else if .. */
if (false_branch->lasti->opcode != Op_no_op)
(void) list_append(false_branch, instruction(Op_no_op));
}
if (setup_else_part) {
if (do_pretty_print) {
(void) list_prepend(false_branch, elsep);
false_branch->nexti->branch_end = false_branch->lasti;
(void) list_prepend(false_branch, instruction(Op_exec_count));
} else
bcfree(elsep);
}
(void) list_prepend(false_branch, instruction(Op_jmp));
false_branch->nexti->target_jmp = false_branch->lasti;
add_lint(cond, LINT_assign_in_cond);
ip = list_append(cond, instruction(Op_jmp_false));
ip->lasti->target_jmp = false_branch->nexti->nexti;
if (do_pretty_print) {
(void) list_prepend(ip, ifp);
(void) list_append(ip, instruction(Op_exec_count));
ip->nexti->branch_if = ip->lasti;
ip->nexti->branch_else = false_branch->nexti;
} else
bcfree(ifp);
if (true_branch != NULL)
list_merge(ip, true_branch);
return list_merge(ip, false_branch);
}
enum defline { FIRST_LINE, LAST_LINE };
/* find_line -- find the first(last) line in a list of (pattern) instructions */
static int
find_line(INSTRUCTION *pattern, enum defline what)
{
INSTRUCTION *ip;
int lineno = 0;
for (ip = pattern->nexti; ip; ip = ip->nexti) {
if (what == LAST_LINE) {
if (ip->source_line > lineno)
lineno = ip->source_line;
} else { /* FIRST_LINE */
if (ip->source_line > 0
&& (lineno == 0 || ip->source_line < lineno))
lineno = ip->source_line;
}
if (ip == pattern->lasti)
break;
}
assert(lineno > 0);
return lineno;
}
/* append_rule --- pattern-action instructions */
static INSTRUCTION *
append_rule(INSTRUCTION *pattern, INSTRUCTION *action)
{
/*
* ----------------
* pattern
* ----------------
* [Op_jmp_false f ]
* ----------------
* action
* ----------------
* f: [Op_no_op ]
* ----------------
*/
INSTRUCTION *rp;
INSTRUCTION *tp;
INSTRUCTION *ip;
if (rule != Rule) {
rp = pattern;
if (do_pretty_print)
(void) list_append(action, instruction(Op_no_op));
(rp + 1)->firsti = action->nexti;
(rp + 1)->lasti = action->lasti;
(rp + 2)->first_line = pattern->source_line;
(rp + 2)->last_line = lastline;
if (block_comment != NULL) {
ip = list_prepend(list_prepend(action, block_comment), rp);
block_comment = NULL;
} else
ip = list_prepend(action, rp);
} else {
rp = bcalloc(Op_rule, 3, 0);
rp->in_rule = Rule;
rp->source_file = source;
tp = instruction(Op_no_op);
if (pattern == NULL) {
/* assert(action != NULL); */
if (do_pretty_print)
(void) list_prepend(action, instruction(Op_exec_count));
(rp + 1)->firsti = action->nexti;
(rp + 1)->lasti = tp;
(rp + 2)->first_line = firstline;
(rp + 2)->last_line = lastline;
rp->source_line = firstline;
ip = list_prepend(list_append(action, tp), rp);
} else {
(void) list_append(pattern, instruction(Op_jmp_false));
pattern->lasti->target_jmp = tp;
(rp + 2)->first_line = find_line(pattern, FIRST_LINE);
rp->source_line = (rp + 2)->first_line;
if (action == NULL) {
(rp + 2)->last_line = find_line(pattern, LAST_LINE);
action = list_create(instruction(Op_K_print_rec));
if (do_pretty_print)
(void) list_prepend(action, instruction(Op_exec_count));
} else
(rp + 2)->last_line = lastline;
if (do_pretty_print) {
(void) list_prepend(pattern, instruction(Op_exec_count));
(void) list_prepend(action, instruction(Op_exec_count));
}
(rp + 1)->firsti = action->nexti;
(rp + 1)->lasti = tp;
ip = list_append(
list_merge(list_prepend(pattern, rp),
action),
tp);
}
}
list_append(rule_list, rp + 1);
if (rule_block[rule] == NULL)
rule_block[rule] = ip;
else
(void) list_merge(rule_block[rule], ip);
return rule_block[rule];
}
/* mk_assignment --- assignment bytecodes */
static INSTRUCTION *
mk_assignment(INSTRUCTION *lhs, INSTRUCTION *rhs, INSTRUCTION *op)
{
INSTRUCTION *tp;
INSTRUCTION *ip;
tp = lhs->lasti;
switch (tp->opcode) {
case Op_field_spec:
tp->opcode = Op_field_spec_lhs;
break;
case Op_subscript:
tp->opcode = Op_subscript_lhs;
break;
case Op_push:
case Op_push_array:
tp->opcode = Op_push_lhs;
break;
case Op_field_assign:
yyerror(_("cannot assign a value to the result of a field post-increment expression"));
break;
default:
yyerror(_("invalid target of assignment (opcode %s)"),
opcode2str(tp->opcode));
break;
}
tp->do_reference = (op->opcode != Op_assign); /* check for uninitialized reference */
if (rhs != NULL)
ip = list_merge(rhs, lhs);
else
ip = lhs;
(void) list_append(ip, op);
if (tp->opcode == Op_push_lhs
&& tp->memory->type == Node_var
&& tp->memory->var_assign
) {
tp->do_reference = false; /* no uninitialized reference checking
* for a special variable.
*/
(void) list_append(ip, instruction(Op_var_assign));
ip->lasti->assign_var = tp->memory->var_assign;
} else if (tp->opcode == Op_field_spec_lhs) {
(void) list_append(ip, instruction(Op_field_assign));
ip->lasti->field_assign = (Func_ptr) 0;
tp->target_assign = ip->lasti;
} else if (tp->opcode == Op_subscript_lhs) {
(void) list_append(ip, instruction(Op_subscript_assign));
}
return ip;
}
/* optimize_assignment --- peephole optimization for assignment */
static INSTRUCTION *
optimize_assignment(INSTRUCTION *exp)
{
INSTRUCTION *i1, *i2, *i3;
/*
* Optimize assignment statements array[subs] = x; var = x; $n = x;
* string concatenation of the form s = s t.
*
* 1) Array element assignment array[subs] = x:
* Replaces Op_push_array + Op_subscript_lhs + Op_assign + Op_pop
* with single instruction Op_store_sub.
* Limitation: 1 dimension and sub is simple var/value.
*
* 2) Simple variable assignment var = x:
* Replaces Op_push_lhs + Op_assign + Op_pop with Op_store_var.
*
* 3) Field assignment $n = x:
* Replaces Op_field_spec_lhs + Op_assign + Op_field_assign + Op_pop
* with Op_store_field.
*
* 4) Optimization for string concatenation:
* For cases like x = x y, uses realloc to include y in x;
* also eliminates instructions Op_push_lhs and Op_pop.
*/
/*
* N.B.: do not append Op_pop instruction to the returned
* instruction list if optimized. None of these
* optimized instructions pushes the r-value of assignment
* onto the runtime stack.
*/
i2 = NULL;
i1 = exp->lasti;
if ( i1->opcode != Op_assign
&& i1->opcode != Op_field_assign)
return list_append(exp, instruction(Op_pop));
for (i2 = exp->nexti; i2 != i1; i2 = i2->nexti) {
switch (i2->opcode) {
case Op_concat:
if (i2->nexti->opcode == Op_push_lhs /* l.h.s is a simple variable */
&& (i2->concat_flag & CSVAR) != 0 /* 1st exp in r.h.s is a simple variable;
* see Op_concat in the grammer above.
*/
&& i2->nexti->memory == exp->nexti->memory /* and the same as in l.h.s */
&& i2->nexti->nexti == i1
&& i1->opcode == Op_assign
) {
/* s = s ... optimization */
/* avoid stuff like x = x (x = y) or x = x gsub(/./, "b", x);
* check for l-value reference to this variable in the r.h.s.
* Also, avoid function calls in general to guard against
* global variable assignment.
*/
for (i3 = exp->nexti->nexti; i3 != i2; i3 = i3->nexti) {
if ((i3->opcode == Op_push_lhs && i3->memory == i2->nexti->memory)
|| i3->opcode == Op_func_call)
return list_append(exp, instruction(Op_pop)); /* no optimization */
}
/* remove the variable from r.h.s */
i3 = exp->nexti;
exp->nexti = i3->nexti;
bcfree(i3);
if (--i2->expr_count == 1) /* one less expression in Op_concat */
i2->opcode = Op_no_op;
i3 = i2->nexti;
assert(i3->opcode == Op_push_lhs);
i3->opcode = Op_assign_concat; /* change Op_push_lhs to Op_assign_concat */
i3->nexti = NULL;
bcfree(i1); /* Op_assign */
exp->lasti = i3; /* update Op_list */
return exp;
}
break;
case Op_field_spec_lhs:
if (i2->nexti->opcode == Op_assign
&& i2->nexti->nexti == i1
&& i1->opcode == Op_field_assign
) {
/* $n = .. */
i2->opcode = Op_store_field;
bcfree(i2->nexti); /* Op_assign */
i2->nexti = NULL;
bcfree(i1); /* Op_field_assign */
exp->lasti = i2; /* update Op_list */
return exp;
}
break;
case Op_push_array:
if (i2->nexti->nexti->opcode == Op_subscript_lhs) {
i3 = i2->nexti->nexti;
if (i3->sub_count == 1
&& i3->nexti == i1
&& i1->opcode == Op_assign
) {
/* array[sub] = .. */
i3->opcode = Op_store_sub;
i3->memory = i2->memory;
i3->expr_count = 1; /* sub_count shadows memory,
* so use expr_count instead.
*/
i3->nexti = NULL;
i2->opcode = Op_no_op;
bcfree(i1); /* Op_assign */
exp->lasti = i3; /* update Op_list */
return exp;
}
}
break;
case Op_push_lhs:
if (i2->nexti == i1
&& i1->opcode == Op_assign
) {
/* var = .. */
i2->opcode = Op_store_var;
i2->nexti = NULL;
bcfree(i1); /* Op_assign */
exp->lasti = i2; /* update Op_list */
i3 = exp->nexti;
if (i3->opcode == Op_push_i
&& (i3->memory->flags & INTLSTR) == 0
&& i3->nexti == i2
) {
/* constant initializer */
i2->initval = i3->memory;
bcfree(i3);
exp->nexti = i2;
} else
i2->initval = NULL;
return exp;
}
break;
default:
break;
}
}
/* no optimization */
return list_append(exp, instruction(Op_pop));
}
/* mk_getline --- make instructions for getline */
static INSTRUCTION *
mk_getline(INSTRUCTION *op, INSTRUCTION *var, INSTRUCTION *redir, int redirtype)
{
INSTRUCTION *ip;
INSTRUCTION *tp;
INSTRUCTION *asgn = NULL;
/*
* getline [var] < [file]
*
* [ file (simp_exp)]
* [ [ var ] ]
* [ Op_K_getline_redir|NULL|redir_type|into_var]
* [ [var_assign] ]
*
*/
if (redir == NULL) {
int sline = op->source_line;
bcfree(op);
op = bcalloc(Op_K_getline, 2, sline);
(op + 1)->target_endfile = ip_endfile;
(op + 1)->target_beginfile = ip_beginfile;
}
if (var != NULL) {
tp = make_assignable(var->lasti);
assert(tp != NULL);
/* check if we need after_assign bytecode */
if (tp->opcode == Op_push_lhs
&& tp->memory->type == Node_var
&& tp->memory->var_assign
) {
asgn = instruction(Op_var_assign);
asgn->assign_ctxt = op->opcode;
asgn->assign_var = tp->memory->var_assign;
} else if (tp->opcode == Op_field_spec_lhs) {
asgn = instruction(Op_field_assign);
asgn->assign_ctxt = op->opcode;
asgn->field_assign = (Func_ptr) 0; /* determined at run time */
tp->target_assign = asgn;
} else if (tp->opcode == Op_subscript_lhs) {
asgn = instruction(Op_subscript_assign);
asgn->assign_ctxt = op->opcode;
}
if (redir != NULL) {
ip = list_merge(redir, var);
(void) list_append(ip, op);
} else
ip = list_append(var, op);
} else if (redir != NULL)
ip = list_append(redir, op);
else
ip = list_create(op);
op->into_var = (var != NULL);
op->redir_type = (redir != NULL) ? redirtype : redirect_none;
return (asgn == NULL ? ip : list_append(ip, asgn));
}
/* mk_for_loop --- for loop bytecodes */
static INSTRUCTION *
mk_for_loop(INSTRUCTION *forp, INSTRUCTION *init, INSTRUCTION *cond,
INSTRUCTION *incr, INSTRUCTION *body)
{
/*
* ------------------------
* init (may be NULL)
* ------------------------
* x:
* cond (Op_no_op if NULL)
* ------------------------
* [ Op_jmp_false tb ]
* ------------------------
* body (may be NULL)
* ------------------------
* tc:
* incr (may be NULL)
* [ Op_jmp x ]
* ------------------------
* tb:[ Op_no_op ]
*/
INSTRUCTION *ip, *tbreak, *tcont;
INSTRUCTION *jmp;
INSTRUCTION *pp_cond;
INSTRUCTION *ret;
tbreak = instruction(Op_no_op);
if (cond != NULL) {
add_lint(cond, LINT_assign_in_cond);
pp_cond = cond->nexti;
ip = cond;
(void) list_append(ip, instruction(Op_jmp_false));
ip->lasti->target_jmp = tbreak;
} else {
pp_cond = instruction(Op_no_op);
ip = list_create(pp_cond);
}
if (init != NULL)
ip = list_merge(init, ip);
if (do_pretty_print) {
(void) list_append(ip, instruction(Op_exec_count));
(forp + 1)->forloop_cond = pp_cond;
(forp + 1)->forloop_body = ip->lasti;
}
if (body != NULL)
(void) list_merge(ip, body);
jmp = instruction(Op_jmp);
jmp->target_jmp = pp_cond;
if (incr == NULL)
tcont = jmp;
else {
tcont = incr->nexti;
(void) list_merge(ip, incr);
}
(void) list_append(ip, jmp);
ret = list_append(ip, tbreak);
fix_break_continue(ret, tbreak, tcont);
if (do_pretty_print) {
forp->target_break = tbreak;
forp->target_continue = tcont;
ret = list_prepend(ret, forp);
} /* else
forp is NULL */
return ret;
}
/* add_lint --- add lint warning bytecode if needed */
static void
add_lint(INSTRUCTION *list, LINTTYPE linttype)
{
#ifndef NO_LINT
INSTRUCTION *ip;
switch (linttype) {
case LINT_assign_in_cond:
ip = list->lasti;
if (ip->opcode == Op_var_assign || ip->opcode == Op_field_assign) {
assert(ip != list->nexti);
for (ip = list->nexti; ip->nexti != list->lasti; ip = ip->nexti)
;
}
if (ip->opcode == Op_assign || ip->opcode == Op_assign_concat) {
list_append(list, instruction(Op_lint));
list->lasti->lint_type = linttype;
}
break;
case LINT_no_effect:
if (list->lasti->opcode == Op_pop && list->nexti != list->lasti) {
int line = 0;
// Get down to the last instruction (FIXME: why?)
for (ip = list->nexti; ip->nexti != list->lasti; ip = ip->nexti) {
// along the way track line numbers, we will use the line
// closest to the opcode if that opcode doesn't have one
if (ip->source_line != 0)
line = ip->source_line;
}
if (do_lint) { /* compile-time warning */
if (isnoeffect(ip->opcode)) {
if (ip->source_line != 0)
line = ip->source_line;
lintwarn_ln(line, ("statement may have no effect"));
}
}
if (ip->opcode == Op_push) { /* run-time warning */
list_append(list, instruction(Op_lint));
list->lasti->lint_type = linttype;
}
}
break;
default:
break;
}
#endif
}
/* mk_expression_list --- list of bytecode lists */
static INSTRUCTION *
mk_expression_list(INSTRUCTION *list, INSTRUCTION *s1)
{
INSTRUCTION *r;
/* we can't just combine all bytecodes, since we need to
* process individual expressions for a few builtins in snode() (-:
*/
/* -- list of lists */
/* [Op_list| ... ]------
* |
* [Op_list| ... ] -- |
* ... | |
* ... <------- |
* [Op_list| ... ] -- |
* ... | |
* ... | |
* ... <------- --
*/
assert(s1 != NULL && s1->opcode == Op_list);
if (list == NULL) {
list = instruction(Op_list);
list->nexti = s1;
list->lasti = s1->lasti;
return list;
}
/* append expression to the end of the list */
r = list->lasti;
r->nexti = s1;
list->lasti = s1->lasti;
return list;
}
/* count_expressions --- fixup expression_list from mk_expression_list.
* returns no of expressions in list. isarg is true
* for function arguments.
*/
static int
count_expressions(INSTRUCTION **list, bool isarg)
{
INSTRUCTION *expr;
INSTRUCTION *r = NULL;
int count = 0;
if (*list == NULL) /* error earlier */
return 0;
for (expr = (*list)->nexti; expr; ) {
INSTRUCTION *t1, *t2;
t1 = expr->nexti;
t2 = expr->lasti;
if (isarg && t1 == t2 && t1->opcode == Op_push)
t1->opcode = Op_push_param;
if (++count == 1)
r = expr;
else
(void) list_merge(r, expr);
expr = t2->nexti;
}
assert(count > 0);
if (! isarg && count > max_args)
max_args = count;
bcfree(*list);
*list = r;
return count;
}
/* fix_break_continue --- fix up break & continue codes in loop bodies */
static void
fix_break_continue(INSTRUCTION *list, INSTRUCTION *b_target, INSTRUCTION *c_target)
{
INSTRUCTION *ip;
list->lasti->nexti = NULL; /* just to make sure */
for (ip = list->nexti; ip != NULL; ip = ip->nexti) {
switch (ip->opcode) {
case Op_K_break:
if (ip->target_jmp == NULL)
ip->target_jmp = b_target;
break;
case Op_K_continue:
if (ip->target_jmp == NULL)
ip->target_jmp = c_target;
break;
default:
/* this is to keep the compiler happy. sheesh. */
break;
}
}
}
static inline INSTRUCTION *
list_create(INSTRUCTION *x)
{
INSTRUCTION *l;
l = instruction(Op_list);
l->nexti = x;
l->lasti = x;
return l;
}
static inline INSTRUCTION *
list_append(INSTRUCTION *l, INSTRUCTION *x)
{
#ifdef GAWKDEBUG
if (l->opcode != Op_list)
cant_happen();
#endif
l->lasti->nexti = x;
l->lasti = x;
return l;
}
static inline INSTRUCTION *
list_prepend(INSTRUCTION *l, INSTRUCTION *x)
{
#ifdef GAWKDEBUG
if (l->opcode != Op_list)
cant_happen();
#endif
x->nexti = l->nexti;
l->nexti = x;
return l;
}
static inline INSTRUCTION *
list_merge(INSTRUCTION *l1, INSTRUCTION *l2)
{
#ifdef GAWKDEBUG
if (l1->opcode != Op_list)
cant_happen();
if (l2->opcode != Op_list)
cant_happen();
#endif
l1->lasti->nexti = l2->nexti;
l1->lasti = l2->lasti;
bcfree(l2);
return l1;
}
/* add_pending_comment --- add a pending comment to a statement */
static inline INSTRUCTION *
add_pending_comment(INSTRUCTION *stmt)
{
INSTRUCTION *ret = stmt;
if (prior_comment != NULL) {
if (function_comment != prior_comment)
ret = list_append(stmt, prior_comment);
prior_comment = NULL;
} else if (comment != NULL && comment->memory->comment_type == EOL_COMMENT) {
if (function_comment != comment)
ret = list_append(stmt, comment);
comment = NULL;
}
return ret;
}
/* See if name is a special token. */
int
check_special(const char *name)
{
int low, high, mid;
int i;
int non_standard_flags = 0;
#ifdef USE_EBCDIC
static bool did_sort = false;
if (! did_sort) {
qsort((void *) tokentab,
sizeof(tokentab) / sizeof(tokentab[0]),
sizeof(tokentab[0]), tokcompare);
did_sort = true;
}
#endif
if (do_traditional)
non_standard_flags |= GAWKX;
if (do_posix)
non_standard_flags |= NOT_POSIX;
low = 0;
high = (sizeof(tokentab) / sizeof(tokentab[0])) - 1;
while (low <= high) {
mid = (low + high) / 2;
i = *name - tokentab[mid].operator[0];
if (i == 0)
i = strcmp(name, tokentab[mid].operator);
if (i < 0) /* token < mid */
high = mid - 1;
else if (i > 0) /* token > mid */
low = mid + 1;
else {
if ((tokentab[mid].flags & non_standard_flags) != 0)
return -1;
return mid;
}
}
return -1;
}
/*
* This provides a private version of functions that act like VMS's
* variable-length record filesystem, where there was a bug on
* certain source files.
*/
static FILE *fp = NULL;
/* read_one_line --- return one input line at a time. mainly for debugging. */
static ssize_t
read_one_line(int fd, void *buffer, size_t count)
{
char buf[BUFSIZ];
/* Minor potential memory leak here. Too bad. */
if (fp == NULL) {
fp = fdopen(fd, "r");
if (fp == NULL) {
fprintf(stderr, "ugh. fdopen: %s\n", strerror(errno));
gawk_exit(EXIT_FAILURE);
}
}
if (fgets(buf, sizeof buf, fp) == NULL)
return 0;
memcpy(buffer, buf, strlen(buf));
return strlen(buf);
}
/* one_line_close --- close the open file being read with read_one_line() */
static int
one_line_close(int fd)
{
int ret;
if (fp == NULL || fd != fileno(fp))
fatal("debugging read/close screwed up!");
ret = fclose(fp);
fp = NULL;
return ret;
}
/* lookup_builtin --- find a builtin function or return NULL */
builtin_func_t
lookup_builtin(const char *name)
{
int mid = check_special(name);
if (mid == -1)
return NULL;
switch (tokentab[mid].class) {
case LEX_BUILTIN:
case LEX_LENGTH:
break;
default:
return NULL;
}
/* And another special case... */
if (tokentab[mid].value == Op_sub_builtin)
return (builtin_func_t) do_sub;
#ifdef HAVE_MPFR
if (do_mpfr)
return tokentab[mid].ptr2;
#endif
return tokentab[mid].ptr;
}
/* install_builtins --- add built-in functions to FUNCTAB */
void
install_builtins(void)
{
int i, j;
int flags_that_must_be_clear = DEBUG_USE;
if (do_traditional)
flags_that_must_be_clear |= GAWKX;
if (do_posix)
flags_that_must_be_clear |= NOT_POSIX;
j = sizeof(tokentab) / sizeof(tokentab[0]);
for (i = 0; i < j; i++) {
if ( (tokentab[i].class == LEX_BUILTIN
|| tokentab[i].class == LEX_LENGTH)
&& (tokentab[i].flags & flags_that_must_be_clear) == 0) {
(void) install_symbol(tokentab[i].operator, Node_builtin_func);
}
}
}
/*
* 9/2014: Gawk cannot use <ctype.h> isalpha or isalnum when
* parsing the program since that can let through non-English
* letters. So, we supply our own. !@#$%^&*()-ing locales!
*/
/* is_alpha --- return true if c is an English letter */
/*
* The scene of the murder was grisly to look upon. When the inspector
* arrived, the sergeant turned to him and said, "Another programmer stabbed
* in the back. He never knew what happened."
*
* The inspector replied, "Looks like the MO of isalpha, and his even meaner
* big brother, isalnum. The Locale brothers." The sergeant merely
* shuddered in horror.
*/
bool
is_alpha(int c)
{
#ifdef I_DONT_KNOW_WHAT_IM_DOING
return isalpha(c);
#else /* ! I_DONT_KNOW_WHAT_IM_DOING */
switch (c) {
case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
case 's': case 't': case 'u': case 'v': case 'w': case 'x':
case 'y': case 'z':
case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
case 'Y': case 'Z':
return true;
}
return false;
#endif /* ! I_DONT_KNOW_WHAT_IM_DOING */
}
/* is_alnum --- return true for alphanumeric, English only letters */
bool
is_alnum(int c)
{
/* digit test is good for EBCDIC too. so there. */
return (is_alpha(c) || ('0' <= c && c <= '9'));
}
/*
* is_letter --- function to check letters
* isalpha() isn't good enough since it can look at the locale.
* Underscore counts as a letter in awk identifiers
*/
bool
is_letter(int c)
{
return (is_alpha(c) || c == '_');
}
/* is_identchar --- return true if c can be in an identifier */
bool
is_identchar(int c)
{
return (is_alnum(c) || c == '_');
}
/* set_profile_text --- make a number that can be printed when profiling */
static NODE *
set_profile_text(NODE *n, const char *str, size_t len)
{
if (do_pretty_print) {
// two extra bytes: one for NUL termination, and another in
// case we need to add a leading minus sign in add_sign_to_num
emalloc(n->stptr, char *, len + 2, "set_profile_text");
memcpy(n->stptr, str, len);
n->stptr[len] = '\0';
n->stlen = len;
// Set STRCUR and n->stfmt for use when profiling
// (i.e., actually running the program) so that
// force_string() on this item will work ok.
// Thanks and a tip of the hatlo to valgrind.
n->flags |= (NUMCONSTSTR|STRCUR);
n->stfmt = STFMT_UNUSED;
#ifdef HAVE_MPFR
n->strndmode = MPFR_round_mode;
#endif
}
return n;
}