/* A Bison parser, made by GNU Bison 3.8.2. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 . */
/* 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. */
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
especially those whose name start with YY_ or yy_. They are
private implementation details that can be changed or removed. */
/* 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, and Bison version. */
#define YYBISON 30802
/* Bison version string. */
#define YYBISON_VERSION "3.8.2"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* First part of user prologue. */
#line 26 "awkgram.y"
#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;
#define YYERROR_IS_DECLARED 1 /* for bison 3.8. sigh. */
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 bool include_source(INSTRUCTION *file, void **srcfile_p);
static bool load_library(INSTRUCTION *file, void **srcfile_p);
static void set_namespace(INSTRUCTION *ns, INSTRUCTION *comment);
static void change_namespace(const char *new_namespace);
static void next_sourcefile(void);
static char *tokexpand(void);
static NODE *set_profile_text(NODE *n, const char *str, size_t len);
static int check_qualified_special(char *token);
static char *qualify_name(const char *name, size_t len);
static INSTRUCTION *trailing_comment;
static INSTRUCTION *outer_comment;
static INSTRUCTION *interblock_comment;
static INSTRUCTION *pending_comment;
static INSTRUCTION *namespace_chain;
#ifdef DEBUG_COMMENTS
static void
debug_print_comment_s(const char *name, INSTRUCTION *comment, int line)
{
if (comment != NULL)
fprintf(stderr, "%d: %s: <%.*s>\n", line, name,
(int) (comment->memory->stlen - 1),
comment->memory->stptr);
}
#define debug_print_comment(comment) \
debug_print_comment_s(# comment, comment, __LINE__)
#endif
#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 merge_comments(INSTRUCTION *c1, INSTRUCTION *c2);
static INSTRUCTION *make_braced_statements(INSTRUCTION *lbrace, INSTRUCTION *stmts, INSTRUCTION *rbrace);
static void add_sign_to_num(NODE *n, char sign);
static int at_seen = 0;
static bool want_source = false;
static bool want_namespace = false;
static bool want_regexp = false; /* lexical scanning kludge */
static enum {
FUNC_HEADER,
FUNC_BODY,
DONT_CHECK
} want_param_names = DONT_CHECK; /* ditto */
static bool 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;
int errcount = 0;
extern char *source;
extern int sourceline;
extern SRCFILE *srcfiles;
extern INSTRUCTION *rule_list;
extern int max_args;
extern NODE **args_array;
const char awk_namespace[] = "awk";
const char *current_namespace = awk_namespace;
bool namespace_changed = false;
static INSTRUCTION *rule_block[sizeof(ruletab)/sizeof(ruletab[0])];
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 bool called_from_eval = false;
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);
extern double fmod(double x, double y);
#define YYSTYPE INSTRUCTION *
#line 239 "awkgram.c"
# ifndef YY_CAST
# ifdef __cplusplus
# define YY_CAST(Type, Val) static_cast (Val)
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast (Val)
# else
# define YY_CAST(Type, Val) ((Type) (Val))
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef YY_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# else
# define YY_NULLPTR ((void*)0)
# endif
# endif
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token kinds. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
YYEMPTY = -2,
YYEOF = 0, /* "end of file" */
YYerror = 256, /* error */
YYUNDEF = 257, /* "invalid token" */
FUNC_CALL = 258, /* FUNC_CALL */
NAME = 259, /* NAME */
REGEXP = 260, /* REGEXP */
FILENAME = 261, /* FILENAME */
YNUMBER = 262, /* YNUMBER */
YSTRING = 263, /* YSTRING */
TYPED_REGEXP = 264, /* TYPED_REGEXP */
RELOP = 265, /* RELOP */
IO_OUT = 266, /* IO_OUT */
IO_IN = 267, /* IO_IN */
ASSIGNOP = 268, /* ASSIGNOP */
ASSIGN = 269, /* ASSIGN */
MATCHOP = 270, /* MATCHOP */
CONCAT_OP = 271, /* CONCAT_OP */
SUBSCRIPT = 272, /* SUBSCRIPT */
LEX_BEGIN = 273, /* LEX_BEGIN */
LEX_END = 274, /* LEX_END */
LEX_IF = 275, /* LEX_IF */
LEX_ELSE = 276, /* LEX_ELSE */
LEX_RETURN = 277, /* LEX_RETURN */
LEX_DELETE = 278, /* LEX_DELETE */
LEX_SWITCH = 279, /* LEX_SWITCH */
LEX_CASE = 280, /* LEX_CASE */
LEX_DEFAULT = 281, /* LEX_DEFAULT */
LEX_WHILE = 282, /* LEX_WHILE */
LEX_DO = 283, /* LEX_DO */
LEX_FOR = 284, /* LEX_FOR */
LEX_BREAK = 285, /* LEX_BREAK */
LEX_CONTINUE = 286, /* LEX_CONTINUE */
LEX_PRINT = 287, /* LEX_PRINT */
LEX_PRINTF = 288, /* LEX_PRINTF */
LEX_NEXT = 289, /* LEX_NEXT */
LEX_EXIT = 290, /* LEX_EXIT */
LEX_FUNCTION = 291, /* LEX_FUNCTION */
LEX_BEGINFILE = 292, /* LEX_BEGINFILE */
LEX_ENDFILE = 293, /* LEX_ENDFILE */
LEX_GETLINE = 294, /* LEX_GETLINE */
LEX_NEXTFILE = 295, /* LEX_NEXTFILE */
LEX_IN = 296, /* LEX_IN */
LEX_AND = 297, /* LEX_AND */
LEX_OR = 298, /* LEX_OR */
INCREMENT = 299, /* INCREMENT */
DECREMENT = 300, /* DECREMENT */
LEX_BUILTIN = 301, /* LEX_BUILTIN */
LEX_LENGTH = 302, /* LEX_LENGTH */
LEX_EOF = 303, /* LEX_EOF */
LEX_INCLUDE = 304, /* LEX_INCLUDE */
LEX_EVAL = 305, /* LEX_EVAL */
LEX_LOAD = 306, /* LEX_LOAD */
LEX_NAMESPACE = 307, /* LEX_NAMESPACE */
NEWLINE = 308, /* NEWLINE */
SLASH_BEFORE_EQUAL = 309, /* SLASH_BEFORE_EQUAL */
UNARY = 310 /* UNARY */
};
typedef enum yytokentype yytoken_kind_t;
#endif
/* Token kinds. */
#define YYEMPTY -2
#define YYEOF 0
#define YYerror 256
#define YYUNDEF 257
#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 LEX_NAMESPACE 307
#define NEWLINE 308
#define SLASH_BEFORE_EQUAL 309
#define UNARY 310
/* 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);
/* Symbol kind. */
enum yysymbol_kind_t
{
YYSYMBOL_YYEMPTY = -2,
YYSYMBOL_YYEOF = 0, /* "end of file" */
YYSYMBOL_YYerror = 1, /* error */
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
YYSYMBOL_FUNC_CALL = 3, /* FUNC_CALL */
YYSYMBOL_NAME = 4, /* NAME */
YYSYMBOL_REGEXP = 5, /* REGEXP */
YYSYMBOL_FILENAME = 6, /* FILENAME */
YYSYMBOL_YNUMBER = 7, /* YNUMBER */
YYSYMBOL_YSTRING = 8, /* YSTRING */
YYSYMBOL_TYPED_REGEXP = 9, /* TYPED_REGEXP */
YYSYMBOL_RELOP = 10, /* RELOP */
YYSYMBOL_IO_OUT = 11, /* IO_OUT */
YYSYMBOL_IO_IN = 12, /* IO_IN */
YYSYMBOL_ASSIGNOP = 13, /* ASSIGNOP */
YYSYMBOL_ASSIGN = 14, /* ASSIGN */
YYSYMBOL_MATCHOP = 15, /* MATCHOP */
YYSYMBOL_CONCAT_OP = 16, /* CONCAT_OP */
YYSYMBOL_SUBSCRIPT = 17, /* SUBSCRIPT */
YYSYMBOL_LEX_BEGIN = 18, /* LEX_BEGIN */
YYSYMBOL_LEX_END = 19, /* LEX_END */
YYSYMBOL_LEX_IF = 20, /* LEX_IF */
YYSYMBOL_LEX_ELSE = 21, /* LEX_ELSE */
YYSYMBOL_LEX_RETURN = 22, /* LEX_RETURN */
YYSYMBOL_LEX_DELETE = 23, /* LEX_DELETE */
YYSYMBOL_LEX_SWITCH = 24, /* LEX_SWITCH */
YYSYMBOL_LEX_CASE = 25, /* LEX_CASE */
YYSYMBOL_LEX_DEFAULT = 26, /* LEX_DEFAULT */
YYSYMBOL_LEX_WHILE = 27, /* LEX_WHILE */
YYSYMBOL_LEX_DO = 28, /* LEX_DO */
YYSYMBOL_LEX_FOR = 29, /* LEX_FOR */
YYSYMBOL_LEX_BREAK = 30, /* LEX_BREAK */
YYSYMBOL_LEX_CONTINUE = 31, /* LEX_CONTINUE */
YYSYMBOL_LEX_PRINT = 32, /* LEX_PRINT */
YYSYMBOL_LEX_PRINTF = 33, /* LEX_PRINTF */
YYSYMBOL_LEX_NEXT = 34, /* LEX_NEXT */
YYSYMBOL_LEX_EXIT = 35, /* LEX_EXIT */
YYSYMBOL_LEX_FUNCTION = 36, /* LEX_FUNCTION */
YYSYMBOL_LEX_BEGINFILE = 37, /* LEX_BEGINFILE */
YYSYMBOL_LEX_ENDFILE = 38, /* LEX_ENDFILE */
YYSYMBOL_LEX_GETLINE = 39, /* LEX_GETLINE */
YYSYMBOL_LEX_NEXTFILE = 40, /* LEX_NEXTFILE */
YYSYMBOL_LEX_IN = 41, /* LEX_IN */
YYSYMBOL_LEX_AND = 42, /* LEX_AND */
YYSYMBOL_LEX_OR = 43, /* LEX_OR */
YYSYMBOL_INCREMENT = 44, /* INCREMENT */
YYSYMBOL_DECREMENT = 45, /* DECREMENT */
YYSYMBOL_LEX_BUILTIN = 46, /* LEX_BUILTIN */
YYSYMBOL_LEX_LENGTH = 47, /* LEX_LENGTH */
YYSYMBOL_LEX_EOF = 48, /* LEX_EOF */
YYSYMBOL_LEX_INCLUDE = 49, /* LEX_INCLUDE */
YYSYMBOL_LEX_EVAL = 50, /* LEX_EVAL */
YYSYMBOL_LEX_LOAD = 51, /* LEX_LOAD */
YYSYMBOL_LEX_NAMESPACE = 52, /* LEX_NAMESPACE */
YYSYMBOL_NEWLINE = 53, /* NEWLINE */
YYSYMBOL_SLASH_BEFORE_EQUAL = 54, /* SLASH_BEFORE_EQUAL */
YYSYMBOL_55_ = 55, /* '?' */
YYSYMBOL_56_ = 56, /* ':' */
YYSYMBOL_57_ = 57, /* ',' */
YYSYMBOL_58_ = 58, /* '<' */
YYSYMBOL_59_ = 59, /* '>' */
YYSYMBOL_60_ = 60, /* '+' */
YYSYMBOL_61_ = 61, /* '-' */
YYSYMBOL_62_ = 62, /* '*' */
YYSYMBOL_63_ = 63, /* '/' */
YYSYMBOL_64_ = 64, /* '%' */
YYSYMBOL_65_ = 65, /* '!' */
YYSYMBOL_UNARY = 66, /* UNARY */
YYSYMBOL_67_ = 67, /* '^' */
YYSYMBOL_68_ = 68, /* '$' */
YYSYMBOL_69_ = 69, /* '(' */
YYSYMBOL_70_ = 70, /* ')' */
YYSYMBOL_71_ = 71, /* '@' */
YYSYMBOL_72_ = 72, /* '[' */
YYSYMBOL_73_ = 73, /* ']' */
YYSYMBOL_74_ = 74, /* '{' */
YYSYMBOL_75_ = 75, /* '}' */
YYSYMBOL_76_ = 76, /* ';' */
YYSYMBOL_YYACCEPT = 77, /* $accept */
YYSYMBOL_program = 78, /* program */
YYSYMBOL_rule = 79, /* rule */
YYSYMBOL_source = 80, /* source */
YYSYMBOL_library = 81, /* library */
YYSYMBOL_namespace = 82, /* namespace */
YYSYMBOL_pattern = 83, /* pattern */
YYSYMBOL_action = 84, /* action */
YYSYMBOL_func_name = 85, /* func_name */
YYSYMBOL_lex_builtin = 86, /* lex_builtin */
YYSYMBOL_function_prologue = 87, /* function_prologue */
YYSYMBOL_88_1 = 88, /* $@1 */
YYSYMBOL_regexp = 89, /* regexp */
YYSYMBOL_90_2 = 90, /* $@2 */
YYSYMBOL_typed_regexp = 91, /* typed_regexp */
YYSYMBOL_a_slash = 92, /* a_slash */
YYSYMBOL_statements = 93, /* statements */
YYSYMBOL_statement_term = 94, /* statement_term */
YYSYMBOL_statement = 95, /* statement */
YYSYMBOL_non_compound_stmt = 96, /* non_compound_stmt */
YYSYMBOL_97_3 = 97, /* $@3 */
YYSYMBOL_simple_stmt = 98, /* simple_stmt */
YYSYMBOL_99_4 = 99, /* $@4 */
YYSYMBOL_100_5 = 100, /* $@5 */
YYSYMBOL_opt_simple_stmt = 101, /* opt_simple_stmt */
YYSYMBOL_case_statements = 102, /* case_statements */
YYSYMBOL_case_statement = 103, /* case_statement */
YYSYMBOL_case_value = 104, /* case_value */
YYSYMBOL_print = 105, /* print */
YYSYMBOL_print_expression_list = 106, /* print_expression_list */
YYSYMBOL_output_redir = 107, /* output_redir */
YYSYMBOL_108_6 = 108, /* $@6 */
YYSYMBOL_if_statement = 109, /* if_statement */
YYSYMBOL_nls = 110, /* nls */
YYSYMBOL_opt_nls = 111, /* opt_nls */
YYSYMBOL_input_redir = 112, /* input_redir */
YYSYMBOL_opt_param_list = 113, /* opt_param_list */
YYSYMBOL_param_list = 114, /* param_list */
YYSYMBOL_opt_exp = 115, /* opt_exp */
YYSYMBOL_opt_expression_list = 116, /* opt_expression_list */
YYSYMBOL_expression_list = 117, /* expression_list */
YYSYMBOL_opt_fcall_expression_list = 118, /* opt_fcall_expression_list */
YYSYMBOL_fcall_expression_list = 119, /* fcall_expression_list */
YYSYMBOL_fcall_exp = 120, /* fcall_exp */
YYSYMBOL_opt_fcall_exp = 121, /* opt_fcall_exp */
YYSYMBOL_exp = 122, /* exp */
YYSYMBOL_assign_operator = 123, /* assign_operator */
YYSYMBOL_relop_or_less = 124, /* relop_or_less */
YYSYMBOL_a_relop = 125, /* a_relop */
YYSYMBOL_common_exp = 126, /* common_exp */
YYSYMBOL_simp_exp = 127, /* simp_exp */
YYSYMBOL_simp_exp_nc = 128, /* simp_exp_nc */
YYSYMBOL_non_post_simp_exp = 129, /* non_post_simp_exp */
YYSYMBOL_func_call = 130, /* func_call */
YYSYMBOL_direct_func_call = 131, /* direct_func_call */
YYSYMBOL_opt_variable = 132, /* opt_variable */
YYSYMBOL_delete_subscript_list = 133, /* delete_subscript_list */
YYSYMBOL_delete_subscript = 134, /* delete_subscript */
YYSYMBOL_delete_exp_list = 135, /* delete_exp_list */
YYSYMBOL_bracketed_exp_list = 136, /* bracketed_exp_list */
YYSYMBOL_subscript = 137, /* subscript */
YYSYMBOL_subscript_list = 138, /* subscript_list */
YYSYMBOL_simple_variable = 139, /* simple_variable */
YYSYMBOL_variable = 140, /* variable */
YYSYMBOL_opt_incdec = 141, /* opt_incdec */
YYSYMBOL_l_brace = 142, /* l_brace */
YYSYMBOL_r_brace = 143, /* r_brace */
YYSYMBOL_r_paren = 144, /* r_paren */
YYSYMBOL_opt_semi = 145, /* opt_semi */
YYSYMBOL_semi = 146, /* semi */
YYSYMBOL_colon = 147, /* colon */
YYSYMBOL_comma = 148 /* comma */
};
typedef enum yysymbol_kind_t yysymbol_kind_t;
#ifdef short
# undef short
#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
and (if available) are included
so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__
# include /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include /* INFRINGES ON USER NAME SPACE */
# define YY_STDINT_H
# endif
#endif
/* Narrow types that promote to a signed type and that can represent a
signed or unsigned integer of at least N bits. In tables they can
save space and decrease cache pressure. Promoting to a signed type
helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif
/* Work around bug in HP-UX 11.23, which defines these macros
incorrectly for preprocessor constants. This workaround can likely
be removed in 2023, as HPE has promised support for HP-UX 11.23
(aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
. */
#ifdef __hpux
# undef UINT_LEAST8_MAX
# undef UINT_LEAST16_MAX
# define UINT_LEAST8_MAX 255
# define UINT_LEAST16_MAX 65535
#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif
#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
# define YYPTRDIFF_T __PTRDIFF_TYPE__
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
# ifndef ptrdiff_t
# include /* INFRINGES ON USER NAME SPACE */
# endif
# define YYPTRDIFF_T ptrdiff_t
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
# define YYPTRDIFF_T long
# define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned
# endif
#endif
#define YYSIZE_MAXIMUM \
YY_CAST (YYPTRDIFF_T, \
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
? YYPTRDIFF_MAXIMUM \
: YY_CAST (YYSIZE_T, -1)))
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */
typedef yytype_int16 yy_state_t;
/* State numbers in computations. */
typedef int yy_state_fast_t;
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include /* 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_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define YY_ATTRIBUTE_PURE
# endif
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define YY_ATTRIBUTE_UNUSED
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YY_USE(E) ((void) (E))
#else
# define YY_USE(E) /* empty */
#endif
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
# else
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# endif
# 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 __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif
#define YY_ASSERT(E) ((void) (0 && (E)))
#if !defined yyoverflow
/* 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 /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include /* 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 /* 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 */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yy_state_t yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (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 \
{ \
YYPTRDIFF_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / YYSIZEOF (*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, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYPTRDIFF_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 1200
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 77
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 72
/* YYNRULES -- Number of rules. */
#define YYNRULES 209
/* YYNSTATES -- Number of states. */
#define YYNSTATES 356
/* YYMAXUTOK -- Last valid token kind. */
#define YYMAXUTOK 310
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, with out-of-bounds checking. */
#define YYTRANSLATE(YYX) \
(0 <= (YYX) && (YYX) <= YYMAXUTOK \
? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
: YYSYMBOL_YYUNDEF)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex. */
static const yytype_int8 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, 65, 2, 2, 68, 64, 2, 2,
69, 70, 62, 60, 57, 61, 2, 63, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 56, 76,
58, 2, 59, 55, 71, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 72, 2, 73, 67, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 74, 2, 75, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 54,
66
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_int16 yyrline[] =
{
0, 235, 235, 236, 241, 251, 255, 267, 275, 289,
300, 310, 320, 346, 356, 358, 363, 373, 375, 380,
382, 384, 390, 394, 399, 429, 441, 453, 459, 468,
486, 487, 498, 504, 512, 513, 517, 517, 551, 550,
584, 599, 601, 606, 607, 627, 632, 633, 637, 648,
653, 660, 768, 819, 869, 995, 1017, 1038, 1048, 1058,
1068, 1079, 1092, 1110, 1109, 1126, 1144, 1144, 1246, 1246,
1279, 1309, 1317, 1318, 1324, 1325, 1332, 1337, 1350, 1365,
1367, 1375, 1382, 1384, 1392, 1401, 1403, 1412, 1413, 1421,
1426, 1426, 1439, 1446, 1459, 1463, 1485, 1486, 1492, 1493,
1502, 1503, 1508, 1513, 1530, 1532, 1534, 1541, 1542, 1548,
1549, 1554, 1556, 1563, 1565, 1573, 1578, 1589, 1590, 1595,
1597, 1604, 1606, 1614, 1619, 1629, 1630, 1635, 1636, 1641,
1648, 1652, 1654, 1656, 1669, 1686, 1696, 1703, 1705, 1710,
1712, 1714, 1722, 1724, 1729, 1731, 1736, 1738, 1740, 1797,
1799, 1801, 1803, 1805, 1807, 1809, 1811, 1825, 1830, 1835,
1861, 1867, 1869, 1871, 1873, 1875, 1877, 1882, 1886, 1918,
1926, 1932, 1938, 1951, 1952, 1953, 1958, 1963, 1967, 1971,
1986, 2007, 2012, 2049, 2086, 2087, 2093, 2094, 2099, 2101,
2108, 2125, 2142, 2144, 2151, 2156, 2162, 2174, 2186, 2195,
2199, 2204, 2208, 2212, 2216, 2221, 2222, 2226, 2230, 2234
};
#endif
/** Accessing symbol of state STATE. */
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
#if YYDEBUG || 0
/* The user-facing name of the symbol whose (internal) number is
YYSYMBOL. No bounds checking. */
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"\"end of file\"", "error", "\"invalid token\"", "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", "LEX_NAMESPACE",
"NEWLINE", "SLASH_BEFORE_EQUAL", "'?'", "':'", "','", "'<'", "'>'",
"'+'", "'-'", "'*'", "'/'", "'%'", "'!'", "UNARY", "'^'", "'$'", "'('",
"')'", "'@'", "'['", "']'", "'{'", "'}'", "';'", "$accept", "program",
"rule", "source", "library", "namespace", "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",
"opt_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
};
static const char *
yysymbol_name (yysymbol_kind_t yysymbol)
{
return yytname[yysymbol];
}
#endif
#define YYPACT_NINF (-276)
#define yypact_value_is_default(Yyn) \
((Yyn) == YYPACT_NINF)
#define YYTABLE_NINF (-119)
#define yytable_value_is_error(Yyn) \
((Yyn) == YYTABLE_NINF)
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
-276, 315, -276, -276, -45, -41, -276, -276, -276, -276,
133, -276, -276, 13, 13, 13, -13, -7, -276, -276,
-276, 1046, 1046, -276, 1046, 1074, 817, 172, -276, -23,
-10, -276, -276, 29, 1112, 973, 276, 310, -276, -276,
-276, -276, 137, 741, 817, -276, 1, -276, -276, -276,
-276, -276, 64, 84, -276, 98, -276, -276, -276, 741,
741, 173, 111, 117, 111, 111, 1046, 125, -276, -276,
15, 1016, 31, 65, 151, -276, 141, -276, -276, -276,
29, -276, 141, -276, 198, -276, -276, 1001, 203, 1046,
1046, 1046, 141, -276, -276, -276, 1046, 1046, 175, 276,
1046, 1046, 1046, 1046, 1046, 1046, 1046, 1046, 1046, 1046,
1046, 1046, -276, 209, -276, -276, 208, 1046, -276, -276,
-276, 142, 74, -276, 1141, 73, 1141, -276, -276, -276,
-276, 1046, -276, 142, 142, 1016, -276, -276, -276, 1046,
-276, 186, 845, -276, -276, 8, 90, -276, 34, 90,
-276, 59, 90, 29, -276, 541, -276, -276, -276, 11,
-276, 287, 130, 1131, -276, 139, 1141, 13, 123, 123,
111, 111, 111, 111, 123, 123, 111, 111, 111, 111,
-276, -276, 1141, -276, 1001, 769, -276, 45, 276, -276,
-276, 1141, 203, -276, 1141, -276, -276, -276, -276, -276,
-276, -276, 174, -276, 10, 179, 183, 141, 185, 90,
90, -276, -276, 90, 1046, 90, 141, -276, -276, 90,
-276, -276, 1141, -276, 182, 141, 1046, -276, -276, -276,
-276, -276, -276, 142, 77, -276, 1046, 1001, -276, 251,
1046, 1046, 659, 894, -276, -276, -276, 90, 1141, -276,
-276, -276, 589, 541, 141, -276, -276, 1141, 141, -276,
46, 1016, -276, 90, -41, 189, 1016, 1016, 243, -15,
-276, 182, -276, 817, 263, -276, 162, -276, -276, -276,
-276, -276, 141, -276, -276, 60, -276, -276, -276, 141,
141, 211, 203, 141, 15, -276, -276, 659, -276, -276,
-10, 659, 1046, 142, 693, 186, 1046, 256, -276, -276,
1016, 141, 1089, 141, 973, 141, 260, 141, 659, 141,
928, 659, -276, 340, 222, -276, 212, -276, -276, 928,
142, -276, -276, -276, 281, 282, -276, -276, 222, -276,
141, -276, 142, 141, -276, -276, 141, -276, 141, 659,
-276, 389, 659, -276, 465, -276
};
/* 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, 195, 177, 178, 25, 26,
0, 27, 28, 184, 0, 0, 0, 172, 5, 94,
42, 0, 0, 41, 0, 0, 0, 0, 3, 0,
0, 167, 38, 4, 23, 138, 146, 147, 149, 173,
181, 197, 174, 0, 0, 192, 0, 196, 31, 30,
34, 35, 0, 0, 32, 98, 185, 175, 176, 0,
0, 0, 180, 174, 179, 168, 0, 201, 174, 113,
0, 111, 0, 0, 0, 182, 96, 207, 7, 8,
46, 43, 96, 9, 0, 95, 142, 0, 0, 0,
0, 0, 96, 143, 145, 144, 0, 0, 0, 148,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 140, 139, 157, 158, 0, 0, 121, 40,
126, 0, 0, 119, 125, 0, 111, 194, 193, 33,
36, 0, 156, 0, 0, 0, 199, 200, 198, 114,
204, 0, 0, 169, 15, 0, 0, 18, 0, 0,
21, 0, 0, 97, 202, 0, 47, 39, 133, 134,
135, 131, 132, 0, 209, 136, 24, 184, 154, 155,
151, 152, 153, 150, 165, 166, 162, 163, 164, 161,
130, 141, 129, 183, 122, 0, 191, 0, 99, 170,
171, 115, 0, 116, 112, 14, 10, 17, 11, 20,
12, 45, 0, 63, 0, 0, 0, 96, 0, 0,
0, 85, 86, 0, 107, 0, 96, 44, 57, 0,
66, 50, 71, 43, 205, 96, 0, 160, 123, 124,
120, 104, 102, 0, 0, 159, 0, 127, 68, 0,
0, 0, 0, 72, 58, 59, 60, 0, 108, 61,
203, 65, 0, 0, 96, 206, 48, 137, 96, 105,
0, 0, 128, 0, 186, 0, 0, 0, 0, 195,
73, 0, 62, 0, 89, 87, 0, 49, 29, 37,
106, 103, 96, 64, 69, 0, 188, 190, 70, 96,
96, 0, 0, 96, 0, 90, 67, 0, 187, 189,
0, 0, 0, 0, 0, 88, 0, 92, 74, 52,
0, 96, 0, 96, 91, 96, 0, 96, 0, 96,
72, 0, 76, 0, 0, 75, 0, 53, 54, 72,
0, 93, 79, 82, 0, 0, 83, 84, 0, 208,
96, 51, 0, 96, 81, 80, 96, 43, 96, 0,
43, 0, 0, 56, 0, 55
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-276, -276, -276, -276, -276, -276, -276, 253, -276, -276,
-276, -276, -32, -276, -77, -276, -208, -55, -68, -276,
-276, -237, -276, -276, -275, -276, -276, -276, -276, -276,
-276, -276, -276, 47, -48, -276, -276, -276, -276, -276,
-43, 157, -276, -157, -276, -1, -276, -276, -276, 0,
17, -276, 268, -276, 2, 138, -276, -276, 22, -38,
-276, -276, -81, -2, -276, -27, -213, -66, -276, -22,
-30, -29
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
0, 1, 28, 146, 149, 152, 29, 78, 53, 54,
30, 187, 31, 84, 120, 32, 155, 79, 217, 218,
237, 219, 252, 264, 271, 316, 325, 338, 220, 274,
296, 306, 221, 153, 154, 132, 233, 234, 247, 275,
70, 121, 122, 123, 263, 222, 117, 95, 96, 35,
36, 37, 38, 39, 40, 55, 284, 285, 286, 45,
46, 47, 41, 42, 138, 223, 224, 143, 254, 82,
340, 142
};
/* 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, 125, 81, 81, 141, 97, 270, 160, 128, 195,
158, 56, 57, 58, 238, 253, 139, 5, 127, 63,
63, 86, 63, 68, 43, 71, 292, 228, 230, 75,
19, 44, 144, 63, 156, 197, 180, 145, 62, 64,
277, 65, 124, 126, 164, 330, 231, 280, 33, 232,
281, 76, 99, 77, 342, 183, 59, 44, 124, 124,
199, -13, 60, 75, 76, 135, 147, 189, 190, 93,
94, 148, 92, 44, 139, 184, 80, 298, 259, 239,
262, 25, 85, 270, -13, 140, 159, -16, 161, 162,
163, 196, 270, 185, 198, 165, 166, 200, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
-16, 235, -19, 341, 129, -100, 182, 168, 169, 170,
171, 172, 173, 174, 175, 176, 177, 178, 179, 63,
92, 92, 44, 225, 92, -19, 48, 49, 191, 351,
86, 194, 354, 19, -118, 87, 186, -101, 188, -119,
112, 113, 150, 130, 244, 245, 131, 151, 246, 242,
249, 114, 115, 139, 251, 56, 77, 258, 250, 136,
137, 88, 89, -110, 268, 4, 4, 256, 105, 50,
51, 114, 115, 124, 124, 102, 103, 104, 93, 94,
105, 116, 272, 80, 19, 282, 80, -119, -119, 80,
289, 290, 255, 157, 52, 260, 278, 5, 283, 276,
279, 303, 140, 248, 167, -110, 133, 134, 119, 92,
225, 72, 181, 73, 74, 257, 287, 192, 305, 307,
294, 225, -110, 309, 297, 261, 124, 311, -110, 266,
267, 300, 301, 236, 317, 304, 337, 287, 240, 293,
328, 126, 241, 331, 243, 265, 80, 80, 77, 288,
80, 322, 80, 318, 343, 320, 80, 321, 326, 327,
291, 329, 71, 308, 295, 225, 348, 315, 339, 225,
302, 353, 313, 83, 355, 323, 324, 216, 344, 345,
319, 336, 347, 67, 80, 349, 225, 86, 350, 225,
352, 310, 87, 312, 63, 227, 314, 299, 346, 0,
80, 0, 63, 19, 0, 2, 3, 0, 4, 5,
0, 0, 6, 7, 0, 0, 0, 225, 88, 225,
225, 99, 225, 8, 9, -96, 100, 101, 102, 103,
104, 0, 0, 105, 0, 93, 94, 332, 333, 119,
0, 10, 11, 12, 13, 0, 0, 0, 0, 14,
15, 16, 17, 18, 0, 0, 0, 0, 19, 20,
106, 107, 108, 109, 110, 21, 22, 111, 23, 0,
24, 0, 0, 25, 26, 0, 27, 0, 0, -22,
201, -22, 4, 5, 20, 0, 6, 7, 0, 0,
334, 335, 0, 23, 0, 0, 0, 0, 0, 202,
0, 203, 204, 205, -78, -78, 206, 207, 208, 209,
210, 211, 212, 213, 214, 0, 0, 0, 13, 215,
0, 0, 0, 14, 15, 16, 17, 0, 0, 0,
0, 0, -78, 20, 0, 0, 0, 0, 0, 21,
22, 0, 23, 0, 24, 0, 0, 25, 26, 0,
61, 0, 0, 76, -78, 77, 201, 0, 4, 5,
0, 0, 6, 7, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 202, 0, 203, 204, 205,
-77, -77, 206, 207, 208, 209, 210, 211, 212, 213,
214, 0, 0, 0, 13, 215, 0, 0, 0, 14,
15, 16, 17, 0, 0, 0, 0, 0, -77, 20,
0, 0, 0, 0, 0, 21, 22, 0, 23, 0,
24, 0, 0, 25, 26, 0, 61, 0, 0, 76,
-77, 77, 201, 0, 4, 5, 0, 0, 6, 7,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 202, 0, 203, 204, 205, 0, 0, 206, 207,
208, 209, 210, 211, 212, 213, 214, 0, 0, 0,
13, 215, 0, 0, 0, 14, 15, 16, 17, 0,
69, 0, 4, 5, 0, 20, 6, 7, 0, 0,
-109, 21, 22, 0, 23, 0, 24, 0, 0, 25,
26, 0, 61, 0, 0, 76, 216, 77, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 13, 0,
0, 0, 0, 14, 15, 16, 17, 0, 0, 0,
0, 0, -109, 20, 0, 0, 0, 0, 0, 21,
22, 0, 23, 0, 24, 0, 0, 25, 273, -109,
61, 0, 4, 5, 0, -109, 6, 7, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 202,
0, 203, 204, 205, 0, 0, 206, 207, 208, 209,
210, 211, 212, 213, 214, 0, 4, 5, 13, 215,
6, 7, 0, 14, 15, 16, 17, 0, 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, 76, 0, 77, 0, 14, 15, 16,
17, 0, 118, 0, 4, 5, 0, 20, 6, 7,
119, 0, 0, 21, 22, 0, 23, 0, 24, 0,
0, 25, 26, 0, 61, 0, 0, 0, 0, 77,
229, 0, 4, 5, 0, 0, 6, 7, 119, 0,
13, 0, 0, 0, 0, 14, 15, 16, 17, 0,
0, 0, 0, 0, 0, 20, 0, 0, 0, 0,
0, 21, 22, 0, 23, 0, 24, 0, 13, 25,
26, -117, 61, 14, 15, 16, 17, 0, 69, 0,
4, 5, 0, 20, 6, 7, 0, 0, 0, 21,
22, 0, 23, 0, 24, 0, 0, 25, 26, 0,
61, 0, 0, 0, 0, 0, 193, 0, 4, 5,
0, 0, 6, 7, 0, 0, 13, 0, 0, 0,
0, 14, 15, 16, 17, 0, 0, 0, 0, 0,
0, 20, 0, 0, 0, 0, 0, 21, 22, 0,
23, 0, 24, 0, 13, 25, 26, 0, 61, 14,
15, 16, 17, 0, 0, 0, 0, 4, 269, 20,
0, 6, 7, 0, 0, 21, 22, 0, 23, 0,
24, 0, 0, 25, 26, 0, 61, 204, 0, 0,
0, 0, 0, 0, 0, 0, 211, 212, 0, 0,
0, 4, 5, 13, 0, 6, 7, 0, 14, 15,
16, 17, 0, 0, 0, 0, 0, 0, 20, 0,
0, 204, 0, 0, 21, 22, 0, 23, 0, 24,
211, 212, 25, 26, 0, 61, 0, 13, 0, 0,
0, 0, 14, 15, 16, 17, 4, 5, 0, 0,
6, 7, 20, 0, 0, 98, 0, 0, 21, 22,
0, 23, 0, 24, 0, 0, 25, 26, 0, 61,
0, 0, 0, 0, 4, 5, 0, 0, 6, 7,
119, 0, 13, 0, 0, 0, 0, 14, 15, 16,
17, 0, 0, 0, 0, 0, 86, 20, 0, 0,
0, 87, 0, 21, 22, 0, 23, 0, 24, 0,
13, 25, 26, 0, 61, 14, 15, 16, 17, 4,
5, 0, 0, 6, 7, 20, 0, 88, 89, 90,
0, 21, 22, 0, 23, 0, 24, 0, 0, 25,
26, 91, 61, 0, 93, 94, 0, 4, 5, 0,
0, 6, 7, 0, 0, 13, 140, 0, 0, 0,
14, 15, 16, 17, 0, 0, 0, 0, 0, 86,
20, 0, 0, 0, 87, 0, 21, 22, 0, 23,
0, 24, 0, 0, 25, 26, 0, 61, 14, 15,
16, 17, 86, 0, 0, 0, 0, 87, 20, 0,
88, 89, 90, 0, 21, 22, 0, 23, 0, 24,
0, 86, 25, 66, 91, 61, 87, 93, 94, 0,
0, 86, 0, 88, 89, 90, 87, 0, 0, 0,
0, 0, 0, 0, 0, 77, 0, 91, 0, 92,
93, 94, 88, 89, 90, 0, 0, 0, 0, 0,
0, 0, 88, 89, 90, 0, 91, 226, 0, 93,
94, 0, 0, 0, 0, 0, 91, 0, 0, 93,
94
};
static const yytype_int16 yycheck[] =
{
1, 44, 29, 30, 70, 34, 243, 88, 46, 1,
87, 13, 14, 15, 4, 223, 1, 4, 17, 21,
22, 10, 24, 25, 69, 26, 41, 184, 185, 27,
53, 72, 1, 35, 82, 1, 113, 6, 21, 22,
253, 24, 43, 44, 92, 320, 1, 1, 1, 4,
4, 74, 35, 76, 329, 121, 69, 72, 59, 60,
1, 53, 69, 61, 74, 66, 1, 133, 134, 58,
59, 6, 57, 72, 1, 1, 29, 17, 1, 69,
237, 68, 53, 320, 76, 70, 87, 53, 89, 90,
91, 146, 329, 122, 149, 96, 97, 152, 100, 101,
102, 103, 104, 105, 106, 107, 108, 109, 110, 111,
76, 192, 53, 326, 50, 70, 117, 100, 101, 102,
103, 104, 105, 106, 107, 108, 109, 110, 111, 131,
57, 57, 72, 155, 57, 76, 3, 4, 139, 347,
10, 142, 350, 53, 70, 15, 73, 70, 131, 10,
13, 14, 1, 69, 209, 210, 58, 6, 213, 207,
215, 44, 45, 1, 219, 167, 76, 233, 216, 44,
45, 41, 42, 11, 242, 3, 3, 225, 67, 46,
47, 44, 45, 184, 185, 62, 63, 64, 58, 59,
67, 54, 247, 146, 53, 261, 149, 58, 59, 152,
266, 267, 224, 5, 71, 234, 254, 4, 263, 252,
258, 292, 70, 214, 39, 53, 59, 60, 9, 57,
242, 49, 14, 51, 52, 226, 264, 41, 294, 297,
273, 253, 70, 301, 282, 236, 237, 303, 76, 240,
241, 289, 290, 69, 310, 293, 323, 285, 69, 271,
318, 252, 69, 321, 69, 4, 209, 210, 76, 70,
213, 1, 215, 311, 330, 313, 219, 315, 316, 317,
27, 319, 273, 300, 11, 297, 342, 21, 56, 301,
69, 349, 304, 30, 352, 25, 26, 75, 7, 7,
312, 323, 340, 25, 247, 343, 318, 10, 346, 321,
348, 302, 15, 304, 306, 167, 306, 285, 338, -1,
263, -1, 314, 53, -1, 0, 1, -1, 3, 4,
-1, -1, 7, 8, -1, -1, -1, 349, 41, 351,
352, 314, 354, 18, 19, 75, 60, 61, 62, 63,
64, -1, -1, 67, -1, 58, 59, 7, 8, 9,
-1, 36, 37, 38, 39, -1, -1, -1, -1, 44,
45, 46, 47, 48, -1, -1, -1, -1, 53, 54,
60, 61, 62, 63, 64, 60, 61, 67, 63, -1,
65, -1, -1, 68, 69, -1, 71, -1, -1, 74,
1, 76, 3, 4, 54, -1, 7, 8, -1, -1,
60, 61, -1, 63, -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, -1, 53, 54, -1, -1, -1, -1, -1, 60,
61, -1, 63, -1, 65, -1, -1, 68, 69, -1,
71, -1, -1, 74, 75, 76, 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, -1, 53, 54,
-1, -1, -1, -1, -1, 60, 61, -1, 63, -1,
65, -1, -1, 68, 69, -1, 71, -1, -1, 74,
75, 76, 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, -1, 3, 4, -1, 54, 7, 8, -1, -1,
11, 60, 61, -1, 63, -1, 65, -1, -1, 68,
69, -1, 71, -1, -1, 74, 75, 76, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 39, -1,
-1, -1, -1, 44, 45, 46, 47, -1, -1, -1,
-1, -1, 53, 54, -1, -1, -1, -1, -1, 60,
61, -1, 63, -1, 65, -1, -1, 68, 69, 70,
71, -1, 3, 4, -1, 76, 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, 3, 4, 39, 40,
7, 8, -1, 44, 45, 46, 47, -1, -1, -1,
-1, -1, -1, 54, -1, -1, -1, -1, -1, 60,
61, -1, 63, -1, 65, -1, -1, 68, 69, -1,
71, -1, 39, 74, -1, 76, -1, 44, 45, 46,
47, -1, 1, -1, 3, 4, -1, 54, 7, 8,
9, -1, -1, 60, 61, -1, 63, -1, 65, -1,
-1, 68, 69, -1, 71, -1, -1, -1, -1, 76,
1, -1, 3, 4, -1, -1, 7, 8, 9, -1,
39, -1, -1, -1, -1, 44, 45, 46, 47, -1,
-1, -1, -1, -1, -1, 54, -1, -1, -1, -1,
-1, 60, 61, -1, 63, -1, 65, -1, 39, 68,
69, 70, 71, 44, 45, 46, 47, -1, 1, -1,
3, 4, -1, 54, 7, 8, -1, -1, -1, 60,
61, -1, 63, -1, 65, -1, -1, 68, 69, -1,
71, -1, -1, -1, -1, -1, 1, -1, 3, 4,
-1, -1, 7, 8, -1, -1, 39, -1, -1, -1,
-1, 44, 45, 46, 47, -1, -1, -1, -1, -1,
-1, 54, -1, -1, -1, -1, -1, 60, 61, -1,
63, -1, 65, -1, 39, 68, 69, -1, 71, 44,
45, 46, 47, -1, -1, -1, -1, 3, 4, 54,
-1, 7, 8, -1, -1, 60, 61, -1, 63, -1,
65, -1, -1, 68, 69, -1, 71, 23, -1, -1,
-1, -1, -1, -1, -1, -1, 32, 33, -1, -1,
-1, 3, 4, 39, -1, 7, 8, -1, 44, 45,
46, 47, -1, -1, -1, -1, -1, -1, 54, -1,
-1, 23, -1, -1, 60, 61, -1, 63, -1, 65,
32, 33, 68, 69, -1, 71, -1, 39, -1, -1,
-1, -1, 44, 45, 46, 47, 3, 4, -1, -1,
7, 8, 54, -1, -1, 12, -1, -1, 60, 61,
-1, 63, -1, 65, -1, -1, 68, 69, -1, 71,
-1, -1, -1, -1, 3, 4, -1, -1, 7, 8,
9, -1, 39, -1, -1, -1, -1, 44, 45, 46,
47, -1, -1, -1, -1, -1, 10, 54, -1, -1,
-1, 15, -1, 60, 61, -1, 63, -1, 65, -1,
39, 68, 69, -1, 71, 44, 45, 46, 47, 3,
4, -1, -1, 7, 8, 54, -1, 41, 42, 43,
-1, 60, 61, -1, 63, -1, 65, -1, -1, 68,
69, 55, 71, -1, 58, 59, -1, 3, 4, -1,
-1, 7, 8, -1, -1, 39, 70, -1, -1, -1,
44, 45, 46, 47, -1, -1, -1, -1, -1, 10,
54, -1, -1, -1, 15, -1, 60, 61, -1, 63,
-1, 65, -1, -1, 68, 69, -1, 71, 44, 45,
46, 47, 10, -1, -1, -1, -1, 15, 54, -1,
41, 42, 43, -1, 60, 61, -1, 63, -1, 65,
-1, 10, 68, 69, 55, 71, 15, 58, 59, -1,
-1, 10, -1, 41, 42, 43, 15, -1, -1, -1,
-1, -1, -1, -1, -1, 76, -1, 55, -1, 57,
58, 59, 41, 42, 43, -1, -1, -1, -1, -1,
-1, -1, 41, 42, 43, -1, 55, 56, -1, 58,
59, -1, -1, -1, -1, -1, 55, -1, -1, 58,
59
};
/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 78, 0, 1, 3, 4, 7, 8, 18, 19,
36, 37, 38, 39, 44, 45, 46, 47, 48, 53,
54, 60, 61, 63, 65, 68, 69, 71, 79, 83,
87, 89, 92, 110, 122, 126, 127, 128, 129, 130,
131, 139, 140, 69, 72, 136, 137, 138, 3, 4,
46, 47, 71, 85, 86, 132, 140, 140, 140, 69,
69, 71, 127, 140, 127, 127, 69, 129, 140, 1,
117, 122, 49, 51, 52, 131, 74, 76, 84, 94,
110, 142, 146, 84, 90, 53, 10, 15, 41, 42,
43, 55, 57, 58, 59, 124, 125, 148, 12, 127,
60, 61, 62, 63, 64, 67, 60, 61, 62, 63,
64, 67, 13, 14, 44, 45, 54, 123, 1, 9,
91, 118, 119, 120, 122, 117, 122, 17, 136, 50,
69, 58, 112, 118, 118, 122, 44, 45, 141, 1,
70, 144, 148, 144, 1, 6, 80, 1, 6, 81,
1, 6, 82, 110, 111, 93, 111, 5, 91, 122,
139, 122, 122, 122, 111, 122, 122, 39, 127, 127,
127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
91, 14, 122, 144, 1, 148, 73, 88, 127, 144,
144, 122, 41, 1, 122, 1, 94, 1, 94, 1,
94, 1, 20, 22, 23, 24, 27, 28, 29, 30,
31, 32, 33, 34, 35, 40, 75, 95, 96, 98,
105, 109, 122, 142, 143, 146, 56, 132, 120, 1,
120, 1, 4, 113, 114, 139, 69, 97, 4, 69,
69, 69, 111, 69, 94, 94, 94, 115, 122, 94,
111, 94, 99, 93, 145, 146, 111, 122, 144, 1,
148, 122, 120, 121, 100, 4, 122, 122, 95, 4,
98, 101, 94, 69, 106, 116, 117, 143, 111, 111,
1, 4, 144, 94, 133, 134, 135, 136, 70, 144,
144, 27, 41, 146, 117, 11, 107, 111, 17, 135,
111, 111, 69, 139, 111, 144, 108, 95, 142, 95,
122, 144, 122, 146, 126, 21, 102, 144, 111, 146,
111, 111, 1, 25, 26, 103, 111, 111, 95, 111,
101, 95, 7, 8, 60, 61, 89, 91, 104, 56,
147, 143, 101, 144, 7, 7, 147, 111, 144, 111,
111, 93, 111, 95, 93, 95
};
/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
static const yytype_uint8 yyr1[] =
{
0, 77, 78, 78, 78, 78, 78, 79, 79, 79,
79, 79, 79, 80, 80, 80, 81, 81, 81, 82,
82, 82, 83, 83, 83, 83, 83, 83, 83, 84,
85, 85, 85, 85, 86, 86, 88, 87, 90, 89,
91, 92, 92, 93, 93, 93, 94, 94, 95, 95,
95, 95, 95, 95, 95, 95, 95, 95, 96, 96,
96, 96, 96, 97, 96, 96, 99, 98, 100, 98,
98, 98, 101, 101, 102, 102, 102, 103, 103, 104,
104, 104, 104, 104, 104, 105, 105, 106, 106, 107,
108, 107, 109, 109, 110, 110, 111, 111, 112, 112,
113, 113, 114, 114, 114, 114, 114, 115, 115, 116,
116, 117, 117, 117, 117, 117, 117, 118, 118, 119,
119, 119, 119, 119, 119, 120, 120, 121, 121, 122,
122, 122, 122, 122, 122, 122, 122, 122, 122, 123,
123, 123, 124, 124, 125, 125, 126, 126, 126, 127,
127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
128, 128, 128, 128, 128, 128, 128, 129, 129, 129,
129, 129, 129, 129, 129, 129, 129, 129, 129, 129,
129, 130, 130, 131, 132, 132, 133, 133, 134, 134,
135, 136, 137, 137, 138, 139, 139, 140, 140, 141,
141, 141, 142, 143, 144, 145, 145, 146, 147, 148
};
/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
static const yytype_int8 yyr2[] =
{
0, 2, 0, 2, 2, 2, 2, 2, 2, 2,
4, 4, 4, 1, 2, 1, 1, 2, 1, 1,
2, 1, 0, 1, 3, 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, 0, 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
};
enum { YYENOMEM = -2 };
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
#define YYNOMEM goto yyexhaustedlab
#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)
/* Backward compatibility with an undocumented macro.
Use YYerror or YYUNDEF. */
#define YYERRCODE YYUNDEF
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Kind, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*-----------------------------------.
| Print this symbol's value on YYO. |
`-----------------------------------*/
static void
yy_symbol_value_print (FILE *yyo,
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
FILE *yyoutput = yyo;
YY_USE (yyoutput);
if (!yyvaluep)
return;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YY_USE (yykind);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/*---------------------------.
| Print this symbol on YYO. |
`---------------------------*/
static void
yy_symbol_print (FILE *yyo,
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyo, "%s %s (",
yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
yy_symbol_value_print (yyo, yykind, yyvaluep);
YYFPRINTF (yyo, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *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 (yy_state_t *yyssp, YYSTYPE *yyvsp,
int yyrule)
{
int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
YY_ACCESSING_SYMBOL (+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) ((void) 0)
# define YY_SYMBOL_PRINT(Title, Kind, 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
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg,
yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
{
YY_USE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YY_USE (yykind);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* Lookahead token kind. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
yy_state_fast_t yystate = 0;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus = 0;
/* Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* Their size. */
YYPTRDIFF_T yystacksize = YYINITDEPTH;
/* The state stack: array, bottom, top. */
yy_state_t yyssa[YYINITDEPTH];
yy_state_t *yyss = yyssa;
yy_state_t *yyssp = yyss;
/* The semantic value stack: array, bottom, top. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
YYSTYPE *yyvsp = yyvs;
int yyn;
/* The return value of yyparse. */
int yyresult;
/* Lookahead symbol kind. */
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#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;
YYDPRINTF ((stderr, "Starting parse\n"));
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 -- set current state (the top of the stack) to yystate. |
`--------------------------------------------------------------------*/
yysetstate:
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
YY_IGNORE_USELESS_CAST_BEGIN
*yyssp = YY_CAST (yy_state_t, yystate);
YY_IGNORE_USELESS_CAST_END
YY_STACK_PRINT (yyss, yyssp);
if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
YYNOMEM;
#else
{
/* Get the current used size of the three stacks, in elements. */
YYPTRDIFF_T yysize = yyssp - yyss + 1;
# if defined 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. */
yy_state_t *yyss1 = yyss;
YYSTYPE *yyvs1 = yyvs;
/* 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 * YYSIZEOF (*yyssp),
&yyvs1, yysize * YYSIZEOF (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
# else /* defined YYSTACK_RELOCATE */
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
YYNOMEM;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yy_state_t *yyss1 = yyss;
union yyalloc *yyptr =
YY_CAST (union yyalloc *,
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
if (! yyptr)
YYNOMEM;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YY_IGNORE_USELESS_CAST_BEGIN
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
YY_CAST (long, yystacksize)));
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
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 empty, or end-of-input, or a valid lookahead. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token\n"));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = YYEOF;
yytoken = YYSYMBOL_YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else if (yychar == YYerror)
{
/* The scanner already issued an error message, process directly
to error recovery. But do not keep the error token as
lookahead, it is too special and may lead us to an endless
loop in error recovery. */
yychar = YYUNDEF;
yytoken = YYSYMBOL_YYerror;
goto yyerrlab1;
}
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);
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Discard the shifted token. */
yychar = YYEMPTY;
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 2: /* program: %empty */
#line 235 "awkgram.y"
{ yyval = NULL; }
#line 1958 "awkgram.c"
break;
case 3: /* program: program rule */
#line 237 "awkgram.y"
{
rule = 0;
yyerrok;
}
#line 1967 "awkgram.c"
break;
case 4: /* program: program nls */
#line 242 "awkgram.y"
{
if (yyvsp[0] != NULL) {
if (yyvsp[-1] == NULL)
outer_comment = yyvsp[0];
else
interblock_comment = yyvsp[0];
}
yyval = yyvsp[-1];
}
#line 1981 "awkgram.c"
break;
case 5: /* program: program LEX_EOF */
#line 252 "awkgram.y"
{
next_sourcefile();
}
#line 1989 "awkgram.c"
break;
case 6: /* program: program error */
#line 256 "awkgram.y"
{
rule = 0;
/*
* If errors, give up, don't produce an infinite
* stream of syntax error messages.
*/
/* yyerrok; */
}
#line 2002 "awkgram.c"
break;
case 7: /* rule: pattern action */
#line 268 "awkgram.y"
{
(void) append_rule(yyvsp[-1], yyvsp[0]);
if (pending_comment != NULL) {
interblock_comment = pending_comment;
pending_comment = NULL;
}
}
#line 2014 "awkgram.c"
break;
case 8: /* rule: pattern statement_term */
#line 276 "awkgram.y"
{
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 */
if (yyvsp[0] != NULL)
list_append(yyvsp[-1], yyvsp[0]);
(void) append_rule(yyvsp[-1], NULL);
}
}
#line 2032 "awkgram.c"
break;
case 9: /* rule: function_prologue action */
#line 290 "awkgram.y"
{
in_function = false;
(void) mk_function(yyvsp[-1], yyvsp[0]);
want_param_names = DONT_CHECK;
if (pending_comment != NULL) {
interblock_comment = pending_comment;
pending_comment = NULL;
}
yyerrok;
}
#line 2047 "awkgram.c"
break;
case 10: /* rule: '@' LEX_INCLUDE source statement_term */
#line 301 "awkgram.y"
{
want_source = false;
at_seen--;
if (yyvsp[-1] != NULL && yyvsp[0] != NULL) {
SRCFILE *s = (SRCFILE *) yyvsp[-1];
s->comment = yyvsp[0];
}
yyerrok;
}
#line 2061 "awkgram.c"
break;
case 11: /* rule: '@' LEX_LOAD library statement_term */
#line 311 "awkgram.y"
{
want_source = false;
at_seen--;
if (yyvsp[-1] != NULL && yyvsp[0] != NULL) {
SRCFILE *s = (SRCFILE *) yyvsp[-1];
s->comment = yyvsp[0];
}
yyerrok;
}
#line 2075 "awkgram.c"
break;
case 12: /* rule: '@' LEX_NAMESPACE namespace statement_term */
#line 321 "awkgram.y"
{
/*
* 1/2022:
* We have an interesting isssue here. This production isn't
* reduced until after the token following the statement_term
* is seen. As a result, the change in namespace doesn't take
* effect until then. That's fine if the first token is 'function'
* or BEGIN or some such, but it's a disaster if it's an identifer;
* that identifier will be in the previous namespace.
* Therefore, the actual setting of the namespace is done immediately
* down in the scanner.
*/
want_source = false;
want_namespace = false;
at_seen--;
// this frees $3 storage in all cases
set_namespace(yyvsp[-1], yyvsp[0]);
yyerrok;
}
#line 2102 "awkgram.c"
break;
case 13: /* source: FILENAME */
#line 347 "awkgram.y"
{
void *srcfile = NULL;
if (! include_source(yyvsp[0], & srcfile))
YYABORT;
efree(yyvsp[0]->lextok);
bcfree(yyvsp[0]);
yyval = (INSTRUCTION *) srcfile;
}
#line 2116 "awkgram.c"
break;
case 14: /* source: FILENAME error */
#line 357 "awkgram.y"
{ yyval = NULL; }
#line 2122 "awkgram.c"
break;
case 15: /* source: error */
#line 359 "awkgram.y"
{ yyval = NULL; }
#line 2128 "awkgram.c"
break;
case 16: /* library: FILENAME */
#line 364 "awkgram.y"
{
void *srcfile;
if (! load_library(yyvsp[0], & srcfile))
YYABORT;
efree(yyvsp[0]->lextok);
bcfree(yyvsp[0]);
yyval = (INSTRUCTION *) srcfile;
}
#line 2142 "awkgram.c"
break;
case 17: /* library: FILENAME error */
#line 374 "awkgram.y"
{ yyval = NULL; }
#line 2148 "awkgram.c"
break;
case 18: /* library: error */
#line 376 "awkgram.y"
{ yyval = NULL; }
#line 2154 "awkgram.c"
break;
case 19: /* namespace: FILENAME */
#line 381 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 2160 "awkgram.c"
break;
case 20: /* namespace: FILENAME error */
#line 383 "awkgram.y"
{ yyval = NULL; }
#line 2166 "awkgram.c"
break;
case 21: /* namespace: error */
#line 385 "awkgram.y"
{ yyval = NULL; }
#line 2172 "awkgram.c"
break;
case 22: /* pattern: %empty */
#line 390 "awkgram.y"
{
rule = Rule;
yyval = NULL;
}
#line 2181 "awkgram.c"
break;
case 23: /* pattern: exp */
#line 395 "awkgram.y"
{
rule = Rule;
}
#line 2189 "awkgram.c"
break;
case 24: /* pattern: exp comma exp */
#line 400 "awkgram.y"
{
INSTRUCTION *tp;
add_lint(yyvsp[-2], LINT_assign_in_cond);
add_lint(yyvsp[0], LINT_assign_in_cond);
tp = instruction(Op_no_op);
list_prepend(yyvsp[-2], bcalloc(Op_line_range, !!do_pretty_print + 1, 0));
yyvsp[-2]->nexti->triggered = false;
yyvsp[-2]->nexti->target_jmp = yyvsp[0]->nexti;
list_append(yyvsp[-2], instruction(Op_cond_pair));
yyvsp[-2]->lasti->line_range = yyvsp[-2]->nexti;
yyvsp[-2]->lasti->target_jmp = tp;
list_append(yyvsp[0], instruction(Op_cond_pair));
yyvsp[0]->lasti->line_range = yyvsp[-2]->nexti;
yyvsp[0]->lasti->target_jmp = tp;
if (do_pretty_print) {
(yyvsp[-2]->nexti + 1)->condpair_left = yyvsp[-2]->lasti;
(yyvsp[-2]->nexti + 1)->condpair_right = yyvsp[0]->lasti;
}
/* Put any comments in front of the range expression */
if (yyvsp[-1] != NULL)
yyval = list_append(list_merge(list_prepend(yyvsp[-2], yyvsp[-1]), yyvsp[0]), tp);
else
yyval = list_append(list_merge(yyvsp[-2], yyvsp[0]), tp);
rule = Rule;
}
#line 2223 "awkgram.c"
break;
case 25: /* pattern: LEX_BEGIN */
#line 430 "awkgram.y"
{
static int begin_seen = 0;
if (do_lint_old && ++begin_seen == 2)
lintwarn_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;
yyval = yyvsp[0];
}
#line 2239 "awkgram.c"
break;
case 26: /* pattern: LEX_END */
#line 442 "awkgram.y"
{
static int end_seen = 0;
if (do_lint_old && ++end_seen == 2)
lintwarn_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;
yyval = yyvsp[0];
}
#line 2255 "awkgram.c"
break;
case 27: /* pattern: LEX_BEGINFILE */
#line 454 "awkgram.y"
{
yyvsp[0]->in_rule = rule = BEGINFILE;
yyvsp[0]->source_file = source;
yyval = yyvsp[0];
}
#line 2265 "awkgram.c"
break;
case 28: /* pattern: LEX_ENDFILE */
#line 460 "awkgram.y"
{
yyvsp[0]->in_rule = rule = ENDFILE;
yyvsp[0]->source_file = source;
yyval = yyvsp[0];
}
#line 2275 "awkgram.c"
break;
case 29: /* action: l_brace statements r_brace opt_semi opt_nls */
#line 469 "awkgram.y"
{
INSTRUCTION *ip = make_braced_statements(yyvsp[-4], yyvsp[-3], yyvsp[-2]);
if (yyvsp[-2] != NULL && yyvsp[0] != NULL) {
merge_comments(yyvsp[-2], yyvsp[0]);
pending_comment = yyvsp[-2];
} else if (yyvsp[-2] != NULL) {
pending_comment = yyvsp[-2];
} else if (yyvsp[0] != NULL) {
pending_comment = yyvsp[0];
}
yyval = ip;
}
#line 2294 "awkgram.c"
break;
case 31: /* func_name: FUNC_CALL */
#line 488 "awkgram.y"
{
const char *name = yyvsp[0]->lextok;
char *qname = qualify_name(name, strlen(name));
if (qname != name) {
efree((void *)name);
yyvsp[0]->lextok = qname;
}
yyval = yyvsp[0];
}
#line 2309 "awkgram.c"
break;
case 32: /* func_name: lex_builtin */
#line 499 "awkgram.y"
{
yyerror(_("`%s' is a built-in function, it cannot be redefined"),
tokstart);
YYABORT;
}
#line 2319 "awkgram.c"
break;
case 33: /* func_name: '@' LEX_EVAL */
#line 505 "awkgram.y"
{
yyval = yyvsp[0];
at_seen--;
}
#line 2328 "awkgram.c"
break;
case 36: /* $@1: %empty */
#line 517 "awkgram.y"
{ want_param_names = FUNC_HEADER; }
#line 2334 "awkgram.c"
break;
case 37: /* function_prologue: LEX_FUNCTION func_name '(' $@1 opt_param_list r_paren opt_nls */
#line 518 "awkgram.y"
{
INSTRUCTION *func_comment = NULL;
// Merge any comments found in the parameter list with those
// following the function header, associate the whole shebang
// with the function as one block comment.
if (yyvsp[-2] != NULL && yyvsp[-2]->comment != NULL) {
if (yyvsp[0] != NULL) {
merge_comments(yyvsp[-2]->comment, yyvsp[0]);
}
func_comment = yyvsp[-2]->comment;
} else if (yyvsp[0] != NULL) {
func_comment = yyvsp[0];
}
yyvsp[-6]->source_file = source;
yyvsp[-6]->comment = func_comment;
if (install_function(yyvsp[-5]->lextok, yyvsp[-6], yyvsp[-2]) < 0)
YYABORT;
in_function = true;
yyvsp[-5]->lextok = NULL;
bcfree(yyvsp[-5]);
/* $5 already free'd in install_function */
yyval = yyvsp[-6];
want_param_names = FUNC_BODY;
}
#line 2364 "awkgram.c"
break;
case 38: /* $@2: %empty */
#line 551 "awkgram.y"
{ want_regexp = true; }
#line 2370 "awkgram.c"
break;
case 39: /* regexp: a_slash $@2 REGEXP */
#line 553 "awkgram.y"
{
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 2403 "awkgram.c"
break;
case 40: /* typed_regexp: TYPED_REGEXP */
#line 585 "awkgram.y"
{
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 2420 "awkgram.c"
break;
case 41: /* a_slash: '/' */
#line 600 "awkgram.y"
{ bcfree(yyvsp[0]); }
#line 2426 "awkgram.c"
break;
case 43: /* statements: %empty */
#line 606 "awkgram.y"
{ yyval = NULL; }
#line 2432 "awkgram.c"
break;
case 44: /* statements: statements statement */
#line 608 "awkgram.y"
{
if (yyvsp[0] == NULL) {
yyval = yyvsp[-1];
} else {
add_lint(yyvsp[0], LINT_no_effect);
if (yyvsp[-1] == NULL) {
yyval = yyvsp[0];
} else {
yyval = list_merge(yyvsp[-1], yyvsp[0]);
}
}
if (trailing_comment != NULL) {
yyval = list_append(yyval, trailing_comment);
trailing_comment = NULL;
}
yyerrok;
}
#line 2456 "awkgram.c"
break;
case 45: /* statements: statements error */
#line 628 "awkgram.y"
{ yyval = NULL; }
#line 2462 "awkgram.c"
break;
case 46: /* statement_term: nls */
#line 632 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 2468 "awkgram.c"
break;
case 47: /* statement_term: semi opt_nls */
#line 633 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 2474 "awkgram.c"
break;
case 48: /* statement: semi opt_nls */
#line 638 "awkgram.y"
{
if (yyvsp[0] != NULL) {
INSTRUCTION *ip;
merge_comments(yyvsp[0], NULL);
ip = list_create(instruction(Op_no_op));
yyval = list_append(ip, yyvsp[0]);
} else
yyval = NULL;
}
#line 2489 "awkgram.c"
break;
case 49: /* statement: l_brace statements r_brace */
#line 649 "awkgram.y"
{
trailing_comment = yyvsp[0]; // NULL or comment
yyval = make_braced_statements(yyvsp[-2], yyvsp[-1], yyvsp[0]);
}
#line 2498 "awkgram.c"
break;
case 50: /* statement: if_statement */
#line 654 "awkgram.y"
{
if (do_pretty_print)
yyval = list_prepend(yyvsp[0], instruction(Op_exec_count));
else
yyval = yyvsp[0];
}
#line 2509 "awkgram.c"
break;
case 51: /* statement: LEX_SWITCH '(' exp r_paren opt_nls l_brace case_statements opt_nls r_brace */
#line 661 "awkgram.y"
{
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) {
// first merge comments
INSTRUCTION *head_comment = NULL;
if (yyvsp[-4] != NULL && yyvsp[-3] != NULL) {
merge_comments(yyvsp[-4], yyvsp[-3]);
head_comment = yyvsp[-4];
} else if (yyvsp[-4] != NULL)
head_comment = yyvsp[-4];
else
head_comment = yyvsp[-3];
yyvsp[-8]->comment = head_comment;
(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;
(yyvsp[-8] + 1)->switch_end->comment = yyvsp[0];
}
/* else
$1 is NULL */
(void) list_append(cexp, dflt);
(void) list_merge(ip, cexp);
if (yyvsp[-1] != NULL)
(void) list_append(cstmt, yyvsp[-1]);
yyval = list_merge(ip, cstmt);
break_allowed--;
fix_break_continue(ip, tbreak, NULL);
}
#line 2621 "awkgram.c"
break;
case 52: /* statement: LEX_WHILE '(' exp r_paren opt_nls statement */
#line 769 "awkgram.y"
{
/*
* -----------------
* 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[-1] != NULL) {
if (yyvsp[0] == NULL)
yyvsp[0] = list_create(instruction(Op_no_op));
yyvsp[-1]->memory->comment_type = BLOCK_COMMENT;
yyvsp[0] = list_prepend(yyvsp[0], yyvsp[-1]);
}
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 2676 "awkgram.c"
break;
case 53: /* statement: LEX_DO opt_nls statement LEX_WHILE '(' exp r_paren opt_nls */
#line 820 "awkgram.y"
{
/*
* -----------------
* 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 (yyvsp[-6] != NULL)
(void) list_prepend(ip, yyvsp[-6]);
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]);
if (yyvsp[0] != NULL)
yyvsp[-7]->comment = yyvsp[0];
}
/* else
$1 and $4 are NULLs */
}
#line 2730 "awkgram.c"
break;
case 54: /* statement: LEX_FOR '(' NAME LEX_IN simple_variable r_paren opt_nls statement */
#line 870 "awkgram.y"
{
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]);
if (yyvsp[-1] != NULL) {
merge_comments(yyvsp[-1], NULL);
yyvsp[0] = list_prepend(yyvsp[0], yyvsp[-1]);
}
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[-1] != NULL)
merge_comments(yyvsp[-1], NULL);
if (yyvsp[0] != NULL) {
if (yyvsp[-1] != NULL)
yyvsp[0] = list_prepend(yyvsp[0], yyvsp[-1]);
(void) list_merge(ip, yyvsp[0]);
} else if (yyvsp[-1] != NULL)
(void) list_append(ip, yyvsp[-1]);
(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 2860 "awkgram.c"
break;
case 55: /* statement: LEX_FOR '(' opt_simple_stmt semi opt_nls exp semi opt_nls opt_simple_stmt r_paren opt_nls statement */
#line 996 "awkgram.y"
{
if (yyvsp[-7] != NULL) {
merge_comments(yyvsp[-7], NULL);
yyvsp[-11]->comment = yyvsp[-7];
}
if (yyvsp[-4] != NULL) {
merge_comments(yyvsp[-4], NULL);
if (yyvsp[-11]->comment == NULL) {
yyvsp[-4]->memory->comment_type = FOR_COMMENT;
yyvsp[-11]->comment = yyvsp[-4];
} else
yyvsp[-11]->comment->comment = yyvsp[-4];
}
if (yyvsp[-1] != NULL)
yyvsp[0] = list_prepend(yyvsp[0], yyvsp[-1]);
add_lint(yyvsp[-6], LINT_assign_in_cond);
yyval = mk_for_loop(yyvsp[-11], yyvsp[-9], yyvsp[-6], yyvsp[-3], yyvsp[0]);
break_allowed--;
continue_allowed--;
}
#line 2886 "awkgram.c"
break;
case 56: /* statement: LEX_FOR '(' opt_simple_stmt semi opt_nls semi opt_nls opt_simple_stmt r_paren opt_nls statement */
#line 1018 "awkgram.y"
{
if (yyvsp[-6] != NULL) {
merge_comments(yyvsp[-6], NULL);
yyvsp[-10]->comment = yyvsp[-6];
}
if (yyvsp[-4] != NULL) {
merge_comments(yyvsp[-4], NULL);
if (yyvsp[-10]->comment == NULL) {
yyvsp[-4]->memory->comment_type = FOR_COMMENT;
yyvsp[-10]->comment = yyvsp[-4];
} else
yyvsp[-10]->comment->comment = yyvsp[-4];
}
if (yyvsp[-1] != NULL)
yyvsp[0] = list_prepend(yyvsp[0], yyvsp[-1]);
yyval = mk_for_loop(yyvsp[-10], yyvsp[-8], (INSTRUCTION *) NULL, yyvsp[-3], yyvsp[0]);
break_allowed--;
continue_allowed--;
}
#line 2911 "awkgram.c"
break;
case 57: /* statement: non_compound_stmt */
#line 1039 "awkgram.y"
{
if (do_pretty_print)
yyval = list_prepend(yyvsp[0], instruction(Op_exec_count));
else
yyval = yyvsp[0];
}
#line 2922 "awkgram.c"
break;
case 58: /* non_compound_stmt: LEX_BREAK statement_term */
#line 1049 "awkgram.y"
{
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]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 2936 "awkgram.c"
break;
case 59: /* non_compound_stmt: LEX_CONTINUE statement_term */
#line 1059 "awkgram.y"
{
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]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 2950 "awkgram.c"
break;
case 60: /* non_compound_stmt: LEX_NEXT statement_term */
#line 1069 "awkgram.y"
{
/* 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]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 2965 "awkgram.c"
break;
case 61: /* non_compound_stmt: LEX_NEXTFILE statement_term */
#line 1080 "awkgram.y"
{
/* 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]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 2982 "awkgram.c"
break;
case 62: /* non_compound_stmt: LEX_EXIT opt_exp statement_term */
#line 1093 "awkgram.y"
{
/* 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]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 3003 "awkgram.c"
break;
case 63: /* $@3: %empty */
#line 1110 "awkgram.y"
{
if (! in_function)
yyerror(_("`return' used outside function context"));
}
#line 3012 "awkgram.c"
break;
case 64: /* non_compound_stmt: LEX_RETURN $@3 opt_fcall_exp statement_term */
#line 1113 "awkgram.y"
{
if (called_from_eval)
yyvsp[-3]->opcode = Op_K_return_from_eval;
if (yyvsp[-1] == NULL) {
yyval = list_create(yyvsp[-3]);
(void) list_prepend(yyval, instruction(Op_push_i));
yyval->nexti->memory = dupnode(Nnull_string);
} else
yyval = list_append(yyvsp[-1], yyvsp[-3]);
if (yyvsp[0] != NULL)
yyval = list_append(yyval, yyvsp[0]);
}
#line 3030 "awkgram.c"
break;
case 65: /* non_compound_stmt: simple_stmt statement_term */
#line 1127 "awkgram.y"
{
if (yyvsp[0] != NULL)
yyval = list_append(yyvsp[-1], yyvsp[0]);
else
yyval = yyvsp[-1];
}
#line 3041 "awkgram.c"
break;
case 66: /* $@4: %empty */
#line 1144 "awkgram.y"
{ in_print = true; in_parens = 0; }
#line 3047 "awkgram.c"
break;
case 67: /* simple_stmt: print $@4 print_expression_list output_redir */
#line 1145 "awkgram.y"
{
/*
* 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 (do_optimize && 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 ((n->flags & (STRING|STRCUR)) != 0 || ! is_zero(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) { /* print/printf without arg */
yyvsp[-3]->expr_count = 0;
if (yyvsp[-3]->opcode == Op_K_print)
yyvsp[-3]->opcode = Op_K_print_rec;
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;
if (yyvsp[-3]->opcode == Op_K_print)
yyvsp[-3]->opcode = Op_K_print_rec;
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]);
}
}
}
}
#line 3152 "awkgram.c"
break;
case 68: /* $@5: %empty */
#line 1246 "awkgram.y"
{ sub_counter = 0; }
#line 3158 "awkgram.c"
break;
case 69: /* simple_stmt: LEX_DELETE NAME $@5 delete_subscript_list */
#line 1247 "awkgram.y"
{
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]);
}
}
#line 3195 "awkgram.c"
break;
case 70: /* simple_stmt: LEX_DELETE '(' NAME ')' */
#line 1284 "awkgram.y"
{
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"));
}
}
#line 3225 "awkgram.c"
break;
case 71: /* simple_stmt: exp */
#line 1310 "awkgram.y"
{
yyval = optimize_assignment(yyvsp[0]);
}
#line 3233 "awkgram.c"
break;
case 72: /* opt_simple_stmt: %empty */
#line 1317 "awkgram.y"
{ yyval = NULL; }
#line 3239 "awkgram.c"
break;
case 73: /* opt_simple_stmt: simple_stmt */
#line 1319 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3245 "awkgram.c"
break;
case 74: /* case_statements: %empty */
#line 1324 "awkgram.y"
{ yyval = NULL; }
#line 3251 "awkgram.c"
break;
case 75: /* case_statements: case_statements case_statement */
#line 1326 "awkgram.y"
{
if (yyvsp[-1] == NULL)
yyval = list_create(yyvsp[0]);
else
yyval = list_prepend(yyvsp[-1], yyvsp[0]);
}
#line 3262 "awkgram.c"
break;
case 76: /* case_statements: case_statements error */
#line 1333 "awkgram.y"
{ yyval = NULL; }
#line 3268 "awkgram.c"
break;
case 77: /* case_statement: LEX_CASE case_value colon opt_nls statements */
#line 1338 "awkgram.y"
{
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;
yyvsp[-4]->comment = yyvsp[-1];
bcfree(yyvsp[-2]);
yyval = yyvsp[-4];
}
#line 3285 "awkgram.c"
break;
case 78: /* case_statement: LEX_DEFAULT colon opt_nls statements */
#line 1351 "awkgram.y"
{
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;
yyvsp[-3]->comment = yyvsp[-1];
yyval = yyvsp[-3];
}
#line 3301 "awkgram.c"
break;
case 79: /* case_value: YNUMBER */
#line 1366 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3307 "awkgram.c"
break;
case 80: /* case_value: '-' YNUMBER */
#line 1368 "awkgram.y"
{
NODE *n = yyvsp[0]->memory;
(void) force_number(n);
negate_num(n);
bcfree(yyvsp[-1]);
yyval = yyvsp[0];
}
#line 3319 "awkgram.c"
break;
case 81: /* case_value: '+' YNUMBER */
#line 1376 "awkgram.y"
{
NODE *n = yyvsp[0]->lasti->memory;
bcfree(yyvsp[-1]);
add_sign_to_num(n, '+');
yyval = yyvsp[0];
}
#line 3330 "awkgram.c"
break;
case 82: /* case_value: YSTRING */
#line 1383 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3336 "awkgram.c"
break;
case 83: /* case_value: regexp */
#line 1385 "awkgram.y"
{
if (yyvsp[0]->memory->type == Node_regex)
yyvsp[0]->opcode = Op_push_re;
else
yyvsp[0]->opcode = Op_push;
yyval = yyvsp[0];
}
#line 3348 "awkgram.c"
break;
case 84: /* case_value: typed_regexp */
#line 1393 "awkgram.y"
{
assert((yyvsp[0]->memory->flags & REGEX) == REGEX);
yyvsp[0]->opcode = Op_push_re;
yyval = yyvsp[0];
}
#line 3358 "awkgram.c"
break;
case 85: /* print: LEX_PRINT */
#line 1402 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3364 "awkgram.c"
break;
case 86: /* print: LEX_PRINTF */
#line 1404 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3370 "awkgram.c"
break;
case 88: /* print_expression_list: '(' expression_list r_paren */
#line 1414 "awkgram.y"
{
yyval = yyvsp[-1];
}
#line 3378 "awkgram.c"
break;
case 89: /* output_redir: %empty */
#line 1421 "awkgram.y"
{
in_print = false;
in_parens = 0;
yyval = NULL;
}
#line 3388 "awkgram.c"
break;
case 90: /* $@6: %empty */
#line 1426 "awkgram.y"
{ in_print = false; in_parens = 0; }
#line 3394 "awkgram.c"
break;
case 91: /* output_redir: IO_OUT $@6 common_exp */
#line 1427 "awkgram.y"
{
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"));
if (do_lint && yyvsp[-2]->redir_type == redirect_output && yyvsp[0]->lasti->opcode == Op_concat)
lintwarn(_("concatenation as I/O `>' redirection target is ambiguous"));
yyval = list_prepend(yyvsp[0], yyvsp[-2]);
}
#line 3408 "awkgram.c"
break;
case 92: /* if_statement: LEX_IF '(' exp r_paren opt_nls statement */
#line 1440 "awkgram.y"
{
if (yyvsp[-1] != NULL)
yyvsp[-5]->comment = yyvsp[-1];
add_lint(yyvsp[-3], LINT_assign_in_cond);
yyval = mk_condition(yyvsp[-3], yyvsp[-5], yyvsp[0], NULL, NULL);
}
#line 3419 "awkgram.c"
break;
case 93: /* if_statement: LEX_IF '(' exp r_paren opt_nls statement LEX_ELSE opt_nls statement */
#line 1448 "awkgram.y"
{
if (yyvsp[-4] != NULL)
yyvsp[-8]->comment = yyvsp[-4];
if (yyvsp[-1] != NULL)
yyvsp[-2]->comment = yyvsp[-1];
add_lint(yyvsp[-6], LINT_assign_in_cond);
yyval = mk_condition(yyvsp[-6], yyvsp[-8], yyvsp[-3], yyvsp[-2], yyvsp[0]);
}
#line 3432 "awkgram.c"
break;
case 94: /* nls: NEWLINE */
#line 1460 "awkgram.y"
{
yyval = yyvsp[0];
}
#line 3440 "awkgram.c"
break;
case 95: /* nls: nls NEWLINE */
#line 1464 "awkgram.y"
{
if (yyvsp[-1] != NULL && yyvsp[0] != NULL) {
if (yyvsp[-1]->memory->comment_type == EOL_COMMENT) {
assert(yyvsp[0]->memory->comment_type == BLOCK_COMMENT);
yyvsp[-1]->comment = yyvsp[0]; // chain them
} else {
merge_comments(yyvsp[-1], yyvsp[0]);
}
yyval = yyvsp[-1];
} else if (yyvsp[-1] != NULL) {
yyval = yyvsp[-1];
} else if (yyvsp[0] != NULL) {
yyval = yyvsp[0];
} else
yyval = NULL;
}
#line 3462 "awkgram.c"
break;
case 96: /* opt_nls: %empty */
#line 1485 "awkgram.y"
{ yyval = NULL; }
#line 3468 "awkgram.c"
break;
case 97: /* opt_nls: nls */
#line 1487 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3474 "awkgram.c"
break;
case 98: /* input_redir: %empty */
#line 1492 "awkgram.y"
{ yyval = NULL; }
#line 3480 "awkgram.c"
break;
case 99: /* input_redir: '<' simp_exp */
#line 1494 "awkgram.y"
{
bcfree(yyvsp[-1]);
yyval = yyvsp[0];
}
#line 3489 "awkgram.c"
break;
case 100: /* opt_param_list: %empty */
#line 1502 "awkgram.y"
{ yyval = NULL; }
#line 3495 "awkgram.c"
break;
case 101: /* opt_param_list: param_list */
#line 1504 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3501 "awkgram.c"
break;
case 102: /* param_list: NAME */
#line 1509 "awkgram.y"
{
yyvsp[0]->param_count = 0;
yyval = list_create(yyvsp[0]);
}
#line 3510 "awkgram.c"
break;
case 103: /* param_list: param_list comma NAME */
#line 1514 "awkgram.y"
{
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;
// newlines are allowed after commas, catch any comments
if (yyvsp[-1] != NULL) {
if (yyvsp[-2]->comment != NULL)
merge_comments(yyvsp[-2]->comment, yyvsp[-1]);
else
yyvsp[-2]->comment = yyvsp[-1];
}
} else
yyval = NULL;
}
#line 3531 "awkgram.c"
break;
case 104: /* param_list: error */
#line 1531 "awkgram.y"
{ yyval = NULL; }
#line 3537 "awkgram.c"
break;
case 105: /* param_list: param_list error */
#line 1533 "awkgram.y"
{ yyval = yyvsp[-1]; }
#line 3543 "awkgram.c"
break;
case 106: /* param_list: param_list comma error */
#line 1535 "awkgram.y"
{ yyval = yyvsp[-2]; }
#line 3549 "awkgram.c"
break;
case 107: /* opt_exp: %empty */
#line 1541 "awkgram.y"
{ yyval = NULL; }
#line 3555 "awkgram.c"
break;
case 108: /* opt_exp: exp */
#line 1543 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3561 "awkgram.c"
break;
case 109: /* opt_expression_list: %empty */
#line 1548 "awkgram.y"
{ yyval = NULL; }
#line 3567 "awkgram.c"
break;
case 110: /* opt_expression_list: expression_list */
#line 1550 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3573 "awkgram.c"
break;
case 111: /* expression_list: exp */
#line 1555 "awkgram.y"
{ yyval = mk_expression_list(NULL, yyvsp[0]); }
#line 3579 "awkgram.c"
break;
case 112: /* expression_list: expression_list comma exp */
#line 1557 "awkgram.y"
{
if (yyvsp[-1] != NULL)
yyvsp[-2]->lasti->comment = yyvsp[-1];
yyval = mk_expression_list(yyvsp[-2], yyvsp[0]);
yyerrok;
}
#line 3590 "awkgram.c"
break;
case 113: /* expression_list: error */
#line 1564 "awkgram.y"
{ yyval = NULL; }
#line 3596 "awkgram.c"
break;
case 114: /* expression_list: expression_list error */
#line 1566 "awkgram.y"
{
/*
* Returning the expression list instead of NULL lets
* snode get a list of arguments that it can count.
*/
yyval = yyvsp[-1];
}
#line 3608 "awkgram.c"
break;
case 115: /* expression_list: expression_list error exp */
#line 1574 "awkgram.y"
{
/* Ditto */
yyval = mk_expression_list(yyvsp[-2], yyvsp[0]);
}
#line 3617 "awkgram.c"
break;
case 116: /* expression_list: expression_list comma error */
#line 1579 "awkgram.y"
{
/* Ditto */
if (yyvsp[-1] != NULL)
yyvsp[-2]->lasti->comment = yyvsp[-1];
yyval = yyvsp[-2];
}
#line 3628 "awkgram.c"
break;
case 117: /* opt_fcall_expression_list: %empty */
#line 1589 "awkgram.y"
{ yyval = NULL; }
#line 3634 "awkgram.c"
break;
case 118: /* opt_fcall_expression_list: fcall_expression_list */
#line 1591 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3640 "awkgram.c"
break;
case 119: /* fcall_expression_list: fcall_exp */
#line 1596 "awkgram.y"
{ yyval = mk_expression_list(NULL, yyvsp[0]); }
#line 3646 "awkgram.c"
break;
case 120: /* fcall_expression_list: fcall_expression_list comma fcall_exp */
#line 1598 "awkgram.y"
{
if (yyvsp[-1] != NULL)
yyvsp[-2]->lasti->comment = yyvsp[-1];
yyval = mk_expression_list(yyvsp[-2], yyvsp[0]);
yyerrok;
}
#line 3657 "awkgram.c"
break;
case 121: /* fcall_expression_list: error */
#line 1605 "awkgram.y"
{ yyval = NULL; }
#line 3663 "awkgram.c"
break;
case 122: /* fcall_expression_list: fcall_expression_list error */
#line 1607 "awkgram.y"
{
/*
* Returning the expression list instead of NULL lets
* snode get a list of arguments that it can count.
*/
yyval = yyvsp[-1];
}
#line 3675 "awkgram.c"
break;
case 123: /* fcall_expression_list: fcall_expression_list error fcall_exp */
#line 1615 "awkgram.y"
{
/* Ditto */
yyval = mk_expression_list(yyvsp[-2], yyvsp[0]);
}
#line 3684 "awkgram.c"
break;
case 124: /* fcall_expression_list: fcall_expression_list comma error */
#line 1620 "awkgram.y"
{
/* Ditto */
if (yyvsp[-1] != NULL)
yyvsp[-2]->comment = yyvsp[-1];
yyval = yyvsp[-2];
}
#line 3695 "awkgram.c"
break;
case 125: /* fcall_exp: exp */
#line 1629 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3701 "awkgram.c"
break;
case 126: /* fcall_exp: typed_regexp */
#line 1630 "awkgram.y"
{ yyval = list_create(yyvsp[0]); }
#line 3707 "awkgram.c"
break;
case 127: /* opt_fcall_exp: %empty */
#line 1635 "awkgram.y"
{ yyval = NULL; }
#line 3713 "awkgram.c"
break;
case 128: /* opt_fcall_exp: fcall_exp */
#line 1636 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3719 "awkgram.c"
break;
case 129: /* exp: variable assign_operator exp */
#line 1642 "awkgram.y"
{
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 3730 "awkgram.c"
break;
case 130: /* exp: variable ASSIGN typed_regexp */
#line 1649 "awkgram.y"
{
yyval = mk_assignment(yyvsp[-2], list_create(yyvsp[0]), yyvsp[-1]);
}
#line 3738 "awkgram.c"
break;
case 131: /* exp: exp LEX_AND exp */
#line 1653 "awkgram.y"
{ yyval = mk_boolean(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3744 "awkgram.c"
break;
case 132: /* exp: exp LEX_OR exp */
#line 1655 "awkgram.y"
{ yyval = mk_boolean(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3750 "awkgram.c"
break;
case 133: /* exp: exp MATCHOP typed_regexp */
#line 1657 "awkgram.y"
{
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 3767 "awkgram.c"
break;
case 134: /* exp: exp MATCHOP exp */
#line 1670 "awkgram.y"
{
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 3788 "awkgram.c"
break;
case 135: /* exp: exp LEX_IN simple_variable */
#line 1687 "awkgram.y"
{
if (do_lint_old)
lintwarn_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 3802 "awkgram.c"
break;
case 136: /* exp: exp a_relop exp */
#line 1697 "awkgram.y"
{
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 3813 "awkgram.c"
break;
case 137: /* exp: exp '?' exp ':' exp */
#line 1704 "awkgram.y"
{ yyval = mk_condition(yyvsp[-4], yyvsp[-3], yyvsp[-2], yyvsp[-1], yyvsp[0]); }
#line 3819 "awkgram.c"
break;
case 138: /* exp: common_exp */
#line 1706 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3825 "awkgram.c"
break;
case 139: /* assign_operator: ASSIGN */
#line 1711 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3831 "awkgram.c"
break;
case 140: /* assign_operator: ASSIGNOP */
#line 1713 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3837 "awkgram.c"
break;
case 141: /* assign_operator: SLASH_BEFORE_EQUAL ASSIGN */
#line 1715 "awkgram.y"
{
yyvsp[0]->opcode = Op_assign_quotient;
yyval = yyvsp[0];
}
#line 3846 "awkgram.c"
break;
case 142: /* relop_or_less: RELOP */
#line 1723 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3852 "awkgram.c"
break;
case 143: /* relop_or_less: '<' */
#line 1725 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3858 "awkgram.c"
break;
case 144: /* a_relop: relop_or_less */
#line 1730 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3864 "awkgram.c"
break;
case 145: /* a_relop: '>' */
#line 1732 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3870 "awkgram.c"
break;
case 146: /* common_exp: simp_exp */
#line 1737 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3876 "awkgram.c"
break;
case 147: /* common_exp: simp_exp_nc */
#line 1739 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 3882 "awkgram.c"
break;
case 148: /* common_exp: common_exp simp_exp */
#line 1741 "awkgram.y"
{
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 3940 "awkgram.c"
break;
case 150: /* simp_exp: simp_exp '^' simp_exp */
#line 1800 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3946 "awkgram.c"
break;
case 151: /* simp_exp: simp_exp '*' simp_exp */
#line 1802 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3952 "awkgram.c"
break;
case 152: /* simp_exp: simp_exp '/' simp_exp */
#line 1804 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3958 "awkgram.c"
break;
case 153: /* simp_exp: simp_exp '%' simp_exp */
#line 1806 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3964 "awkgram.c"
break;
case 154: /* simp_exp: simp_exp '+' simp_exp */
#line 1808 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3970 "awkgram.c"
break;
case 155: /* simp_exp: simp_exp '-' simp_exp */
#line 1810 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 3976 "awkgram.c"
break;
case 156: /* simp_exp: LEX_GETLINE opt_variable input_redir */
#line 1812 "awkgram.y"
{
/*
* 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 3994 "awkgram.c"
break;
case 157: /* simp_exp: variable INCREMENT */
#line 1826 "awkgram.y"
{
yyvsp[0]->opcode = Op_postincrement;
yyval = mk_assignment(yyvsp[-1], NULL, yyvsp[0]);
}
#line 4003 "awkgram.c"
break;
case 158: /* simp_exp: variable DECREMENT */
#line 1831 "awkgram.y"
{
yyvsp[0]->opcode = Op_postdecrement;
yyval = mk_assignment(yyvsp[-1], NULL, yyvsp[0]);
}
#line 4012 "awkgram.c"
break;
case 159: /* simp_exp: '(' expression_list r_paren LEX_IN simple_variable */
#line 1836 "awkgram.y"
{
if (do_lint_old) {
/* first one is warning so that second one comes out if warnings are fatal */
warning_ln(yyvsp[-1]->source_line,
_("old awk does not support the keyword `in' except after `for'"));
lintwarn_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 4037 "awkgram.c"
break;
case 160: /* simp_exp_nc: common_exp IO_IN LEX_GETLINE opt_variable */
#line 1862 "awkgram.y"
{
yyval = mk_getline(yyvsp[-1], yyvsp[0], yyvsp[-3], yyvsp[-2]->redir_type);
bcfree(yyvsp[-2]);
}
#line 4046 "awkgram.c"
break;
case 161: /* simp_exp_nc: simp_exp_nc '^' simp_exp */
#line 1868 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4052 "awkgram.c"
break;
case 162: /* simp_exp_nc: simp_exp_nc '*' simp_exp */
#line 1870 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4058 "awkgram.c"
break;
case 163: /* simp_exp_nc: simp_exp_nc '/' simp_exp */
#line 1872 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4064 "awkgram.c"
break;
case 164: /* simp_exp_nc: simp_exp_nc '%' simp_exp */
#line 1874 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4070 "awkgram.c"
break;
case 165: /* simp_exp_nc: simp_exp_nc '+' simp_exp */
#line 1876 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4076 "awkgram.c"
break;
case 166: /* simp_exp_nc: simp_exp_nc '-' simp_exp */
#line 1878 "awkgram.y"
{ yyval = mk_binary(yyvsp[-2], yyvsp[0], yyvsp[-1]); }
#line 4082 "awkgram.c"
break;
case 167: /* non_post_simp_exp: regexp */
#line 1883 "awkgram.y"
{
yyval = list_create(yyvsp[0]);
}
#line 4090 "awkgram.c"
break;
case 168: /* non_post_simp_exp: '!' simp_exp */
#line 1887 "awkgram.y"
{
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 4126 "awkgram.c"
break;
case 169: /* non_post_simp_exp: '(' exp r_paren */
#line 1919 "awkgram.y"
{
// Always include. Allows us to lint warn on
// print "foo" > "bar" 1
// but not warn on
// print "foo" > ("bar" 1)
yyval = list_append(yyvsp[-1], bcalloc(Op_parens, 1, sourceline));
}
#line 4138 "awkgram.c"
break;
case 170: /* non_post_simp_exp: LEX_BUILTIN '(' opt_fcall_expression_list r_paren */
#line 1927 "awkgram.y"
{
yyval = snode(yyvsp[-1], yyvsp[-3]);
if (yyval == NULL)
YYABORT;
}
#line 4148 "awkgram.c"
break;
case 171: /* non_post_simp_exp: LEX_LENGTH '(' opt_fcall_expression_list r_paren */
#line 1933 "awkgram.y"
{
yyval = snode(yyvsp[-1], yyvsp[-3]);
if (yyval == NULL)
YYABORT;
}
#line 4158 "awkgram.c"
break;
case 172: /* non_post_simp_exp: LEX_LENGTH */
#line 1939 "awkgram.y"
{
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 4175 "awkgram.c"
break;
case 175: /* non_post_simp_exp: INCREMENT variable */
#line 1954 "awkgram.y"
{
yyvsp[-1]->opcode = Op_preincrement;
yyval = mk_assignment(yyvsp[0], NULL, yyvsp[-1]);
}
#line 4184 "awkgram.c"
break;
case 176: /* non_post_simp_exp: DECREMENT variable */
#line 1959 "awkgram.y"
{
yyvsp[-1]->opcode = Op_predecrement;
yyval = mk_assignment(yyvsp[0], NULL, yyvsp[-1]);
}
#line 4193 "awkgram.c"
break;
case 177: /* non_post_simp_exp: YNUMBER */
#line 1964 "awkgram.y"
{
yyval = list_create(yyvsp[0]);
}
#line 4201 "awkgram.c"
break;
case 178: /* non_post_simp_exp: YSTRING */
#line 1968 "awkgram.y"
{
yyval = list_create(yyvsp[0]);
}
#line 4209 "awkgram.c"
break;
case 179: /* non_post_simp_exp: '-' simp_exp */
#line 1972 "awkgram.y"
{
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 4228 "awkgram.c"
break;
case 180: /* non_post_simp_exp: '+' simp_exp */
#line 1987 "awkgram.y"
{
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 4250 "awkgram.c"
break;
case 181: /* func_call: direct_func_call */
#line 2008 "awkgram.y"
{
func_use(yyvsp[0]->lasti->func_name, FUNC_USE);
yyval = yyvsp[0];
}
#line 4259 "awkgram.c"
break;
case 182: /* func_call: '@' direct_func_call */
#line 2013 "awkgram.y"
{
/* 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_extensions && ! 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(_("cannot 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--;
}
#line 4297 "awkgram.c"
break;
case 183: /* direct_func_call: FUNC_CALL '(' opt_fcall_expression_list r_paren */
#line 2050 "awkgram.y"
{
NODE *n;
char *name = yyvsp[-3]->func_name;
char *qname = qualify_name(name, strlen(name));
if (qname != name) {
efree((char *) name);
yyvsp[-3]->func_name = qname;
}
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 4334 "awkgram.c"
break;
case 184: /* opt_variable: %empty */
#line 2086 "awkgram.y"
{ yyval = NULL; }
#line 4340 "awkgram.c"
break;
case 185: /* opt_variable: variable */
#line 2088 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 4346 "awkgram.c"
break;
case 186: /* delete_subscript_list: %empty */
#line 2093 "awkgram.y"
{ yyval = NULL; }
#line 4352 "awkgram.c"
break;
case 187: /* delete_subscript_list: delete_subscript SUBSCRIPT */
#line 2095 "awkgram.y"
{ yyval = yyvsp[-1]; }
#line 4358 "awkgram.c"
break;
case 188: /* delete_subscript: delete_exp_list */
#line 2100 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 4364 "awkgram.c"
break;
case 189: /* delete_subscript: delete_subscript delete_exp_list */
#line 2102 "awkgram.y"
{
yyval = list_merge(yyvsp[-1], yyvsp[0]);
}
#line 4372 "awkgram.c"
break;
case 190: /* delete_exp_list: bracketed_exp_list */
#line 2109 "awkgram.y"
{
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 4390 "awkgram.c"
break;
case 191: /* bracketed_exp_list: '[' expression_list ']' */
#line 2126 "awkgram.y"
{
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 4408 "awkgram.c"
break;
case 192: /* subscript: bracketed_exp_list */
#line 2143 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 4414 "awkgram.c"
break;
case 193: /* subscript: subscript bracketed_exp_list */
#line 2145 "awkgram.y"
{
yyval = list_merge(yyvsp[-1], yyvsp[0]);
}
#line 4422 "awkgram.c"
break;
case 194: /* subscript_list: subscript SUBSCRIPT */
#line 2152 "awkgram.y"
{ yyval = yyvsp[-1]; }
#line 4428 "awkgram.c"
break;
case 195: /* simple_variable: NAME */
#line 2157 "awkgram.y"
{
yyvsp[0]->opcode = Op_push;
yyvsp[0]->memory = variable(yyvsp[0]->source_line, yyvsp[0]->lextok, Node_var_new);
yyval = list_create(yyvsp[0]);
}
#line 4438 "awkgram.c"
break;
case 196: /* simple_variable: NAME subscript_list */
#line 2163 "awkgram.y"
{
char *arr = yyvsp[-1]->lextok;
// Don't use Node_var_array here; breaks rwarray:readall extension.
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 4451 "awkgram.c"
break;
case 197: /* variable: simple_variable */
#line 2175 "awkgram.y"
{
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 4467 "awkgram.c"
break;
case 198: /* variable: '$' non_post_simp_exp opt_incdec */
#line 2187 "awkgram.y"
{
yyval = list_append(yyvsp[-1], yyvsp[-2]);
if (yyvsp[0] != NULL)
mk_assignment(yyvsp[-1], NULL, yyvsp[0]);
}
#line 4477 "awkgram.c"
break;
case 199: /* opt_incdec: INCREMENT */
#line 2196 "awkgram.y"
{
yyvsp[0]->opcode = Op_postincrement;
}
#line 4485 "awkgram.c"
break;
case 200: /* opt_incdec: DECREMENT */
#line 2200 "awkgram.y"
{
yyvsp[0]->opcode = Op_postdecrement;
}
#line 4493 "awkgram.c"
break;
case 201: /* opt_incdec: %empty */
#line 2204 "awkgram.y"
{ yyval = NULL; }
#line 4499 "awkgram.c"
break;
case 202: /* l_brace: '{' opt_nls */
#line 2208 "awkgram.y"
{ yyval = yyvsp[0]; }
#line 4505 "awkgram.c"
break;
case 203: /* r_brace: '}' opt_nls */
#line 2212 "awkgram.y"
{ yyval = yyvsp[0]; yyerrok; }
#line 4511 "awkgram.c"
break;
case 204: /* r_paren: ')' */
#line 2216 "awkgram.y"
{ yyerrok; }
#line 4517 "awkgram.c"
break;
case 205: /* opt_semi: %empty */
#line 2221 "awkgram.y"
{ yyval = NULL; }
#line 4523 "awkgram.c"
break;
case 207: /* semi: ';' */
#line 2226 "awkgram.y"
{ yyerrok; }
#line 4529 "awkgram.c"
break;
case 208: /* colon: ':' */
#line 2230 "awkgram.y"
{ yyval = yyvsp[0]; yyerrok; }
#line 4535 "awkgram.c"
break;
case 209: /* comma: ',' opt_nls */
#line 2234 "awkgram.y"
{ yyval = yyvsp[0]; yyerrok; }
#line 4541 "awkgram.c"
break;
#line 4545 "awkgram.c"
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 ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
*++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. */
{
const int yylhs = yyr1[yyn] - YYNTOKENS;
const int yyi = yypgoto[yylhs] + *yyssp;
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
? yytable[yyi]
: yydefgoto[yylhs]);
}
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 ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
yyerror (YY_("syntax error"));
}
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 when the user code never invokes YYERROR and the
label yyerrorlab therefore never appears in user code. */
if (0)
YYERROR;
++yynerrs;
/* 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. */
/* Pop stack until we find a state that shifts the error token. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYSYMBOL_YYerror;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
{
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",
YY_ACCESSING_SYMBOL (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", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturnlab;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturnlab;
/*-----------------------------------------------------------.
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
`-----------------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
goto yyreturnlab;
/*----------------------------------------------------------.
| yyreturnlab -- parsing is finished, clean up and return. |
`----------------------------------------------------------*/
yyreturnlab:
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",
YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
#line 2236 "awkgram.y"
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},
{"mkbool", Op_builtin, LEX_BUILTIN, GAWKX|A(1), do_mkbool, 0},
{"mktime", Op_builtin, LEX_BUILTIN, GAWKX|A(1)|A(2), do_mktime, 0},
{"namespace", Op_symbol, LEX_NAMESPACE, GAWKX, 0, 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)|A(2), 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), bool prepend_awk)
{
int i, j;
static char buf[100];
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) {
if (prepend_awk && (tokentab[i].flags & GAWKX) != 0) {
sprintf(buf, "awk::%s", tokentab[i].operator);
return buf;
}
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 (! is_zero(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)";
static char syntax_error[] = "syntax error";
static size_t syn_err_len = sizeof(syntax_error) - 1;
bool generic_error = (strncmp(m, syntax_error, syn_err_len) == 0);
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);
}
if (lexeof && mesg == NULL && generic_error) {
msg("%s", end_of_file_line);
mesg = _("source files / command-line arguments must contain complete functions or rules");
} else
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);
/* we don't use fatal(), that changes the exit status to 2 */
exit(EXIT_FAILURE);
}
/* 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 (interblock_comment != NULL) {
(void) list_append(cp, interblock_comment);
interblock_comment = NULL;
}
(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);
if (outer_comment != NULL) {
cp = list_merge(list_create(outer_comment), cp);
outer_comment = NULL;
}
if (interblock_comment != NULL) {
(void) list_append(cp, interblock_comment);
interblock_comment = NULL;
}
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 (outer_comment != NULL) {
cp = list_merge(list_create(outer_comment), cp);
outer_comment = NULL;
}
if (interblock_comment != NULL) {
(void) list_append(cp, interblock_comment);
interblock_comment = NULL;
}
(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);
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, bool from_eval)
{
int ret;
called_from_eval = from_eval;
/* 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(rule_block));
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
? _("cannot open source file `%s' for reading: %s")
: _("cannot 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(_("cannot 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(_("cannot 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 bool
include_source(INSTRUCTION *file, void **srcfile_p)
{
SRCFILE *s;
char *src = file->lextok;
int errcode;
bool already_included;
*srcfile_p = NULL;
if (do_traditional || do_posix) {
error_ln(file->source_line, _("@include is a gawk extension"));
return false;
}
if (strlen(src) == 0) {
if (do_lint)
lintwarn_ln(file->source_line, _("empty filename after @include"));
return true;
}
s = add_srcfile(SRC_INC, src, sourcefile, &already_included, &errcode);
if (s == NULL) {
if (already_included)
return true;
error_ln(file->source_line,
_("cannot open source file `%s' for reading: %s"),
src, errcode ? strerror(errcode) : _("reason unknown"));
return false;
}
/* 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;
sourcefile->namespace = current_namespace;
/* included file becomes the current source */
sourcefile = s;
lexptr = NULL;
sourceline = 0;
source = NULL;
lasttok = 0;
lexeof = false;
eof_warned = false;
current_namespace = awk_namespace;
*srcfile_p = (void *) s;
return true;
}
/* load_library --- load a shared library */
static bool
load_library(INSTRUCTION *file, void **srcfile_p)
{
SRCFILE *s;
char *src = file->lextok;
int errcode;
bool already_included;
*srcfile_p = NULL;
if (do_traditional || do_posix) {
error_ln(file->source_line, _("@load is a gawk extension"));
return false;
}
if (strlen(src) == 0) {
if (do_lint)
lintwarn_ln(file->source_line, _("empty filename after @load"));
return true;
}
if (do_pretty_print && ! do_profile) {
// create a fake one, don't try to open the file
s = do_add_srcfile(SRC_EXTLIB, src, src, sourcefile);
} else {
s = add_srcfile(SRC_EXTLIB, src, sourcefile, &already_included, &errcode);
if (s == NULL) {
if (already_included)
return true;
error_ln(file->source_line,
_("cannot open shared library `%s' for reading: %s"),
src, errcode ? strerror(errcode) : _("reason unknown"));
return false;
}
load_ext(s->fullpath);
}
*srcfile_p = (void *) s;
return true;
}
/* 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;
set_current_namespace(sourcefile->namespace);
} else {
lexptr = NULL;
sourceline = 0;
source = NULL;
lasttok = 0;
set_current_namespace(awk_namespace);
}
}
/* 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)(int, void *, size_t) = NULL;
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(*)(int, void *, size_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(_("cannot 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");
memset(sourcefile->buf, '\0', sourcefile->bufsize); // keep valgrind happy
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(_("cannot read source file `%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 size_t 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))
// This is a PEBKAC error, but we'll be nice and not say so.
fatal(_("error: invalid character '\\%03o' in source code"), c & 0xFF);
}
/* nextc --- get the next input character */
// For namespaces, -e chunks must be syntactic units.
#define NO_CONTINUE_SOURCE_STRINGS 1
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;
}
}
#undef NO_CONTINUE_SOURCE_STRINGS
/* 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);
}
/*
* get_comment --- collect comment text.
* Flag = EOL_COMMENT for end-of-line comments.
* Flag = BLOCK_COMMENT for self-contained comments.
*/
static int
get_comment(enum commenttype flag, INSTRUCTION **comment_instruction)
{
int c;
int sl;
char *p1;
char *p2;
tok = tokstart;
tokadd('#');
sl = sourceline;
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 (c != END_FILE && isspace(c));
if (c == END_FILE)
break;
else if (c != '#') {
pushback();
sourceline--;
break;
} else
tokadd(c);
} else
break;
}
/* remove any trailing blank lines (consecutive \n) from comment */
p1 = tok - 1;
p2 = tok - 2;
while (*p1 == '\n' && *p2 == '\n') {
p1--;
p2--;
tok--;
}
(*comment_instruction) = bcalloc(Op_comment, 1, sl);
(*comment_instruction)->source_file = source;
(*comment_instruction)->memory = make_str_node(tokstart, tok - tokstart, 0);
(*comment_instruction)->memory->comment_type = flag;
return c;
}
/* allow_newline --- allow newline after &&, ||, ? and : */
static void
allow_newline(INSTRUCTION **new_comment)
{
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, new_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;
static int qm_col_count = 0;
#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();
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 */
yylval = NULL;
if (do_pretty_print && ! do_profile) {
/*
* Collect comment byte code iff doing pretty print
* but not profiling.
*/
INSTRUCTION *new_comment;
if (lasttok == NEWLINE || lasttok == 0)
c = get_comment(BLOCK_COMMENT, & new_comment);
else
c = get_comment(EOL_COMMENT, & new_comment);
yylval = new_comment;
if (c == END_FILE) {
pushback();
return lasttok = NEWLINE;
}
} 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++;
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.
*/
yylval = NULL;
if (! do_traditional) {
INSTRUCTION *new_comment;
/* 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, & new_comment);
yylval = new_comment;
return lasttok = c;
} 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 '?':
qm_col_count++;
// fall through
case ':':
yylval = GET_INSTRUCTION(Op_cond_exp);
if (qm_col_count > 0) {
if (! do_posix) {
INSTRUCTION *new_comment = NULL;
allow_newline(& new_comment);
yylval->comment = new_comment;
}
if (c == ':')
qm_col_count--;
}
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;
/* fall through */
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_extensions)
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 `%s'"), "**=");
if (do_lint_old)
lintwarn(_("operator `%s' is not supported in old awk"), "**=");
}
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 `%s'"), "**");
if (do_lint_old)
lintwarn(_("operator `%s' is not supported in old awk"), "**");
}
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;
lintwarn(_("operator `%s' 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;
lintwarn(_("operator `%s' 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') {
if (do_posix)
fatal(_("POSIX does not allow physical newlines in string values"));
else if (do_lint)
lintwarn(_("backslash string continuation is not portable"));
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);
// See the comment in the production for @namespace.
if (want_namespace)
change_namespace(yylval->lextok);
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);
INSTRUCTION *new_comment = NULL;
allow_newline(& new_comment);
yylval->comment = new_comment;
return lasttok = LEX_AND;
}
pushback();
yylval = GET_INSTRUCTION(Op_symbol);
return lasttok = '&';
case '|':
if ((c = nextc(true)) == '|') {
yylval = GET_INSTRUCTION(Op_or);
INSTRUCTION *new_comment = NULL;
allow_newline(& new_comment);
yylval->comment = new_comment;
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);
if (! do_traditional && c == ':') {
int peek = nextc(true);
if (peek == ':') { // saw identifier::
tokadd(c);
tokadd(c);
c = nextc(true);
} else
pushback();
// then continue around the loop, c == ':'
}
}
tokadd('\0');
pushback();
(void) validate_qualified_name(tokstart);
/* See if it is a special token. */
if ((mid = check_qualified_special(tokstart)) >= 0) {
static int warntab[sizeof(tokentab) / sizeof(tokentab[0])];
int class = tokentab[mid].class;
switch (class) {
case LEX_EVAL:
case LEX_INCLUDE:
case LEX_LOAD:
case LEX_NAMESPACE:
if (lasttok != '@')
goto out;
default:
break;
}
/* 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("bad value %d for want_param_names", (int) want_param_names);
break;
}
}
if (do_lint) {
if (do_lint_extensions && (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
) {
lintwarn(_("`%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_NAMESPACE:
want_namespace = true;
// fall through
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, 4, 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:
if (want_param_names == FUNC_HEADER)
tokkey = estrdup(tokstart, tok - tokstart - 1);
else
tokkey = qualify_name(tokstart, tok - tokstart - 1);
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
&& tolower(tokkey[0]) == 'g'
&& strcasecmp(tokkey, "goto") == 0) {
goto_warned = true;
lintwarn(_("`goto' considered harmful!"));
}
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 bool do_etoa_init = true;
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 = false;
}
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 argument 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) {
arg = subn->nexti;
if (arg->nexti == arg->lasti && arg->nexti->opcode == Op_push)
arg->nexti->opcode = Op_push_arg_untyped; /* argument may be untyped */
} else if (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 */
if (nexp == 2) { /* 2nd argument there */
arg = subn->nexti->lasti->nexti; /* 2nd arg list */
ip = arg->lasti;
if (ip->opcode == Op_push)
ip->opcode = Op_push_array;
}
#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_extensions && ! 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_extensions && ! 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 || ip->opcode == Op_push_re)
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);
/* add any pre-function comment to start of action for profile.c */
if (interblock_comment != NULL) {
interblock_comment->source_line = 0;
merge_comments(interblock_comment, fi->comment);
fi->comment = interblock_comment;
interblock_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 (trailing_comment != NULL) {
(void) list_append(def, trailing_comment);
trailing_comment = NULL;
}
if (do_pretty_print) {
fi[3].nexti = namespace_chain;
namespace_chain = NULL;
(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);
if (f->vname != fname) {
// DON'T free fname, it's done later
fname = f->vname;
}
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': cannot use function name as parameter name"), fname);
} else if (is_std_var(name)) {
error_ln(p->source_line,
_("function `%s': parameter `%s': POSIX disallows using a special variable as a function parameter"),
fname, name);
} else if (strchr(name, ':') != NULL)
error_ln(p->source_line,
_("function `%s': parameter `%s' cannot contain a namespace"),
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) {
if (do_lint && ! fp->extension) {
/*
* Making this not a lint check and
* incrementing * errcount breaks old code.
* Sigh.
*/
if (fp->defined == 0)
lintwarn(_("function `%s' called but never defined"),
fp->name);
if (fp->used == 0)
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(NODETYPE 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_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;
// Additional opcodes that can be part of an expression
// that has no effect:
case Op_and:
case Op_or:
case Op_push:
case Op_push_i:
case Op_push_array:
case Op_pop:
case Op_lint_plus:
case Op_exec_count:
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;
case Op_field_assign:
// no need to change the opcode, but do need to return
// a non-NULL pointer.
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, *lint_plus;
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->flags & NUMBER) != 0 && 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->flags & NUMBER) != 0 && 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:
if ((ip2->memory->flags & NUMBER) != 0 && ip2->memory->numbr == 0.0) {
/* don't fatalize, allow parsing rest of the input */
error_ln(op->source_line, _("division by zero attempted"));
goto regular;
}
op->opcode = Op_quotient_i;
break;
case Op_mod:
if ((ip2->memory->flags & NUMBER) != 0 && ip2->memory->numbr == 0.0) {
/* don't fatalize, allow parsing rest of the input */
error_ln(op->source_line, _("division by zero attempted in `%%'"));
goto regular;
}
op->opcode = Op_mod_i;
break;
case Op_plus:
if (do_lint)
goto regular;
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);
if (do_lint && op->opcode == Op_plus) {
lint_plus = instruction(Op_lint_plus);
(void) list_append(s1, lint_plus);
}
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) {
rp[3].nexti = namespace_chain;
namespace_chain = NULL;
(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;
ip = list_prepend(action, rp);
if (interblock_comment != NULL) {
ip = list_prepend(ip, interblock_comment);
interblock_comment = NULL;
}
} else {
rp = bcalloc(Op_rule, 4, 0);
rp->in_rule = Rule;
rp->source_file = source;
tp = instruction(Op_no_op);
if (do_pretty_print) {
rp[3].nexti = namespace_chain;
namespace_chain = NULL;
}
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)
action = list_prepend(action, instruction(Op_exec_count));
} else
(rp + 2)->last_line = lastline;
if (interblock_comment != NULL) { // was after previous action
pattern = list_prepend(pattern, interblock_comment);
interblock_comment = NULL;
}
if (do_pretty_print) {
pattern = list_prepend(pattern, instruction(Op_exec_count));
action = 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];
}
/*
* 3/2023:
* mk_assignment() is called when an assignment statement is seen,
* as an expression. optimize_assignment() is called when an expression
* is seen as statement (inside braces).
*
* When a field assignment is seen, it needs to be optizimed into
* Op_store_field_exp or Op_store_field to avoid memory management
* issues. Thus, the Op_field_spec_lhs -> Op_store_field_expr
* change is done in mk_assignment. (Consider foo && $0 = $1, the
* assignment is part of an expression.)
*
* If the assignment is in a statement, then optimize_assignment()
* turn Op_store_field_expr into Op_store_field.
*/
/* 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;
if (tp->opcode != Op_field_spec_lhs || op->opcode != Op_assign)
(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) {
if (op->opcode == Op_assign) {
bcfree(op);
tp->opcode = Op_store_field_exp;
} else {
(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_store_field_exp) {
i1->opcode = Op_store_field;
return exp;
}
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_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;
bool no_effect = true;
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 ...
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;
// And check each opcode for no effect
no_effect = no_effect && isnoeffect(ip->opcode);
}
// check the last one also
no_effect = no_effect && isnoeffect(ip->opcode);
// Only if all the traversed opcodes have no effect do we
// produce a warning. This avoids warnings for things like
// a == b && b = c.
if (do_lint) { /* parse-time warning */
if (no_effect) {
if (ip->source_line != 0)
line = ip->source_line;
lintwarn_ln(line, _("statement has no effect"));
}
}
// We no longer place a run-time warning also. One warning
// at parse time is enough.
}
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("unexpected value %s for opcode", opcode2str(l->opcode));
#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("unexpected value %s for opcode", opcode2str(l->opcode));
#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("unexpected value %s for opcode", opcode2str(l1->opcode));
if (l2->opcode != Op_list)
cant_happen("unexpected value %s for opcode", opcode2str(l2->opcode));
#endif
l1->lasti->nexti = l2->nexti;
l1->lasti = l2->lasti;
bcfree(l2);
return l1;
}
/* 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)
{
if (strncmp(name, "awk::", 5) == 0)
name += 5;
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 && tokentab[mid].ptr2 != NULL)
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 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)
{
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;
}
/* 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;
}
/*
* merge_comments --- merge c2 into c1 and free c2 if successful.
* Allow c2 to be NULL, in which case just merged chained
* comments in c1.
*/
static void
merge_comments(INSTRUCTION *c1, INSTRUCTION *c2)
{
assert(c1->opcode == Op_comment);
if (c1->comment == NULL && c2 == NULL) // nothing to do
return;
size_t total = c1->memory->stlen;
if (c1->comment != NULL)
total += 1 /* \n */ + c1->comment->memory->stlen;
if (c2 != NULL) {
assert(c2->opcode == Op_comment);
total += 1 /* \n */ + c2->memory->stlen;
if (c2->comment != NULL)
total += c2->comment->memory->stlen + 1;
}
char *buffer;
emalloc(buffer, char *, total + 1, "merge_comments");
strcpy(buffer, c1->memory->stptr);
if (c1->comment != NULL) {
strcat(buffer, "\n");
strcat(buffer, c1->comment->memory->stptr);
}
if (c2 != NULL) {
strcat(buffer, c2->memory->stptr);
if (c2->comment != NULL) {
strcat(buffer, "\n");
strcat(buffer, c2->comment->memory->stptr);
}
unref(c2->memory);
if (c2->comment != NULL) {
unref(c2->comment->memory);
bcfree(c2->comment);
c2->comment = NULL;
}
bcfree(c2);
}
c1->memory->comment_type = BLOCK_COMMENT;
free(c1->memory->stptr);
c1->memory->stptr = buffer;
c1->memory->stlen = strlen(buffer);
// now free everything else
if (c1->comment != NULL) {
unref(c1->comment->memory);
bcfree(c1->comment);
c1->comment = NULL;
}
}
/* make_braced_statements --- handle `l_brace statements r_brace' with comments */
static INSTRUCTION *
make_braced_statements(INSTRUCTION *lbrace, INSTRUCTION *stmts, INSTRUCTION *rbrace)
{
INSTRUCTION *ip;
if (stmts == NULL)
ip = list_create(instruction(Op_no_op));
else
ip = stmts;
if (lbrace != NULL) {
INSTRUCTION *comment2 = lbrace->comment;
if (comment2 != NULL) {
ip = list_prepend(ip, comment2);
lbrace->comment = NULL;
}
ip = list_prepend(ip, lbrace);
}
return ip;
}
/* validate_qualified_name --- make sure that a qualified name is built correctly */
/*
* This routine returns upon first error, no need to produce multiple, possibly
* conflicting / confusing error messages.
*/
bool
validate_qualified_name(char *token)
{
char *cp, *cp2;
// no colon, by definition it's well formed
if ((cp = strchr(token, ':')) == NULL)
return true;
if (do_traditional || do_posix) {
error_ln(sourceline, _("identifier %s: qualified names not allowed in traditional / POSIX mode"), token);
return false;
}
if (cp[1] != ':') { // could happen from command line
error_ln(sourceline, _("identifier %s: namespace separator is two colons, not one"), token);
return false;
}
if (! is_letter(cp[2])) {
error_ln(sourceline,
_("qualified identifier `%s' is badly formed"),
token);
return false;
}
if ((cp2 = strchr(cp+2, ':')) != NULL) {
error_ln(sourceline,
_("identifier `%s': namespace separator can only appear once in a qualified name"),
token);
return false;
}
return true;
}
/* check_qualified_special --- decide if a name is special or not */
static int
check_qualified_special(char *token)
{
char *cp;
if ((cp = strchr(token, ':')) == NULL && current_namespace == awk_namespace)
return check_special(token);
/*
* Now it's more complicated. Here are the rules.
*
* 1. Namespace name cannot be a standard awk reserved word or function.
* 2. Subordinate part of the name cannot be a standard awk reserved word or function.
* 3. If the namespace part is explicitly "awk", return the result of check_special().
* 4. Else return -1 (gawk extensions allowed, we check standard awk in step 2).
*/
const struct token *tok;
int i;
if (cp == NULL) { // namespace not awk, but a simple identifier
i = check_special(token);
if (i < 0)
return i;
tok = & tokentab[i];
if ((tok->flags & GAWKX) != 0 && tok->class == LEX_BUILTIN)
return -1;
else
return i;
}
char *ns, *end, *subname;
ns = token;
*(end = cp) = '\0'; // temporarily turn it into standalone string
subname = end + 2;
// First check the namespace part
i = check_special(ns);
if (i >= 0 && (tokentab[i].flags & GAWKX) == 0) {
error_ln(sourceline, _("using reserved identifier `%s' as a namespace is not allowed"), ns);
goto done;
}
// Now check the subordinate part
i = check_special(subname);
if (i >= 0 && (tokentab[i].flags & GAWKX) == 0 && strcmp(ns, awk_namespace) != 0) {
error_ln(sourceline, _("using reserved identifier `%s' as second component of a qualified name is not allowed"), subname);
goto done;
}
if (strcmp(ns, awk_namespace) == 0) {
i = check_special(subname);
if (i >= 0) {
if ((tokentab[i].flags & GAWKX) != 0 && tokentab[i].class == LEX_BUILTIN)
; // gawk additional builtin function, is ok
else
error_ln(sourceline, _("using reserved identifier `%s' as second component of a qualified name is not allowed"), subname);
}
} else
i = -1;
done:
*end = ':';
return i;
}
/* set_namespace --- update namespace data structures */
static void
set_namespace(INSTRUCTION *ns, INSTRUCTION *comment)
{
if (ns == NULL)
return;
if (do_traditional || do_posix) {
error_ln(ns->source_line, _("@namespace is a gawk extension"));
efree(ns->lextok);
bcfree(ns);
return;
}
if (! is_valid_identifier(ns->lextok)) {
error_ln(ns->source_line, _("namespace name `%s' must meet identifier naming rules"), ns->lextok);
efree(ns->lextok);
bcfree(ns);
return;
}
int mid = check_special(ns->lextok);
if (mid >= 0) {
error_ln(ns->source_line, _("using reserved identifier `%s' as a namespace is not allowed"), ns->lextok);
efree(ns->lextok);
bcfree(ns);
return;
}
// Actual changing of namespace is done earlier.
// See comments in the production and in yylex().
efree(ns->lextok);
// save info and push on front of list of namespaces seen
INSTRUCTION *new_ns = instruction(Op_K_namespace);
new_ns->comment = comment;
new_ns->ns_name = estrdup(current_namespace, strlen(current_namespace));
new_ns->nexti = namespace_chain;
namespace_chain = new_ns;
ns->lextok = NULL;
bcfree(ns);
return;
}
/* change_namespace --- change the current namespace */
static void
change_namespace(const char *new_namespace)
{
/* error messages will come from set_namespace(), above */
if (! is_valid_identifier(new_namespace))
return;
int mid = check_special(new_namespace);
if (mid >= 0)
return;
if (strcmp(new_namespace, current_namespace) == 0)
; // nothing to do
else if (strcmp(new_namespace, awk_namespace) == 0) {
set_current_namespace(awk_namespace);
} else {
set_current_namespace(estrdup(new_namespace, strlen(new_namespace)));
}
namespace_changed = true;
}
/* qualify_name --- put name into namespace */
static char *
qualify_name(const char *name, size_t len)
{
if (strchr(name, ':') != NULL) // already qualified
return estrdup(name, len);
NODE *p = lookup(name);
if (p != NULL && p->type == Node_param_list)
return estrdup(name, len);
if (current_namespace != awk_namespace && ! is_all_upper(name)) {
size_t length = strlen(current_namespace) + 2 + len + 1;
char *buf;
emalloc(buf, char *, length, "qualify_name");
sprintf(buf, "%s::%s", current_namespace, name);
return buf;
}
return estrdup(name, len);
}