editors/awk.c

   1 /* vi: set sw=4 ts=4: */
   2 /*
   3  * awk implementation for busybox
   4  *
   5  * Copyright (C) 2002 by Dmitry Zakharov <dmit@crp.bank.gov.ua>
   6  *
   7  * Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
   8  */
   9
  10 #include "libbb.h"
  11 #include "xregex.h"
  12 #include <math.h>
  13
  14 /* This is a NOEXEC applet. Be very careful! */
  15
  16
  17 #define MAXVARFMT       240
  18 #define MINNVBLOCK      64
  19
  20 /* variable flags */
  21 #define VF_NUMBER       0x0001  /* 1 = primary type is number */
  22 #define VF_ARRAY        0x0002  /* 1 = it's an array */
  23
  24 #define VF_CACHED       0x0100  /* 1 = num/str value has cached str/num eq */
  25 #define VF_USER         0x0200  /* 1 = user input (may be numeric string) */
  26 #define VF_SPECIAL      0x0400  /* 1 = requires extra handling when changed */
  27 #define VF_WALK         0x0800  /* 1 = variable has alloc'd x.walker list */
  28 #define VF_FSTR         0x1000  /* 1 = var::string points to fstring buffer */
  29 #define VF_CHILD        0x2000  /* 1 = function arg; x.parent points to source */
  30 #define VF_DIRTY        0x4000  /* 1 = variable was set explicitly */
  31
  32 /* these flags are static, don't change them when value is changed */
  33 #define VF_DONTTOUCH    (VF_ARRAY | VF_SPECIAL | VF_WALK | VF_CHILD | VF_DIRTY)
  34
  35 /* Variable */
  36 typedef struct var_s {
  37         unsigned type;            /* flags */
  38         double number;
  39         char *string;
  40         union {
  41                 int aidx;               /* func arg idx (for compilation stage) */
  42                 struct xhash_s *array;  /* array ptr */
  43                 struct var_s *parent;   /* for func args, ptr to actual parameter */
  44                 char **walker;          /* list of array elements (for..in) */
  45         } x;
  46 } var;
  47
  48 /* Node chain (pattern-action chain, BEGIN, END, function bodies) */
  49 typedef struct chain_s {
  50         struct node_s *first;
  51         struct node_s *last;
  52         const char *programname;
  53 } chain;
  54
  55 /* Function */
  56 typedef struct func_s {
  57         unsigned nargs;
  58         struct chain_s body;
  59 } func;
  60
  61 /* I/O stream */
  62 typedef struct rstream_s {
  63         FILE *F;
  64         char *buffer;
  65         int adv;
  66         int size;
  67         int pos;
  68         smallint is_pipe;
  69 } rstream;
  70
  71 typedef struct hash_item_s {
  72         union {
  73                 struct var_s v;         /* variable/array hash */
  74                 struct rstream_s rs;    /* redirect streams hash */
  75                 struct func_s f;        /* functions hash */
  76         } data;
  77         struct hash_item_s *next;       /* next in chain */
  78         char name[1];                   /* really it's longer */
  79 } hash_item;
  80
  81 typedef struct xhash_s {
  82         unsigned nel;           /* num of elements */
  83         unsigned csize;         /* current hash size */
  84         unsigned nprime;        /* next hash size in PRIMES[] */
  85         unsigned glen;          /* summary length of item names */
  86         struct hash_item_s **items;
  87 } xhash;
  88
  89 /* Tree node */
  90 typedef struct node_s {
  91         uint32_t info;
  92         unsigned lineno;
  93         union {
  94                 struct node_s *n;
  95                 var *v;
  96                 int i;
  97                 char *s;
  98                 regex_t *re;
  99         } l;
 100         union {
 101                 struct node_s *n;
 102                 regex_t *ire;
 103                 func *f;
 104                 int argno;
 105         } r;
 106         union {
 107                 struct node_s *n;
 108         } a;
 109 } node;
 110
 111 /* Block of temporary variables */
 112 typedef struct nvblock_s {
 113         int size;
 114         var *pos;
 115         struct nvblock_s *prev;
 116         struct nvblock_s *next;
 117         var nv[0];
 118 } nvblock;
 119
 120 typedef struct tsplitter_s {
 121         node n;
 122         regex_t re[2];
 123 } tsplitter;
 124
 125 /* simple token classes */
 126 /* Order and hex values are very important!!!  See next_token() */
 127 #define TC_SEQSTART      1                              /* ( */
 128 #define TC_SEQTERM      (1 << 1)                /* ) */
 129 #define TC_REGEXP       (1 << 2)                /* /.../ */
 130 #define TC_OUTRDR       (1 << 3)                /* | > >> */
 131 #define TC_UOPPOST      (1 << 4)                /* unary postfix operator */
 132 #define TC_UOPPRE1      (1 << 5)                /* unary prefix operator */
 133 #define TC_BINOPX       (1 << 6)                /* two-opnd operator */
 134 #define TC_IN           (1 << 7)
 135 #define TC_COMMA        (1 << 8)
 136 #define TC_PIPE         (1 << 9)                /* input redirection pipe */
 137 #define TC_UOPPRE2      (1 << 10)               /* unary prefix operator */
 138 #define TC_ARRTERM      (1 << 11)               /* ] */
 139 #define TC_GRPSTART     (1 << 12)               /* { */
 140 #define TC_GRPTERM      (1 << 13)               /* } */
 141 #define TC_SEMICOL      (1 << 14)
 142 #define TC_NEWLINE      (1 << 15)
 143 #define TC_STATX        (1 << 16)               /* ctl statement (for, next...) */
 144 #define TC_WHILE        (1 << 17)
 145 #define TC_ELSE         (1 << 18)
 146 #define TC_BUILTIN      (1 << 19)
 147 #define TC_GETLINE      (1 << 20)
 148 #define TC_FUNCDECL     (1 << 21)               /* `function' `func' */
 149 #define TC_BEGIN        (1 << 22)
 150 #define TC_END          (1 << 23)
 151 #define TC_EOF          (1 << 24)
 152 #define TC_VARIABLE     (1 << 25)
 153 #define TC_ARRAY        (1 << 26)
 154 #define TC_FUNCTION     (1 << 27)
 155 #define TC_STRING       (1 << 28)
 156 #define TC_NUMBER       (1 << 29)
 157
 158 #define TC_UOPPRE  (TC_UOPPRE1 | TC_UOPPRE2)
 159
 160 /* combined token classes */
 161 #define TC_BINOP   (TC_BINOPX | TC_COMMA | TC_PIPE | TC_IN)
 162 #define TC_UNARYOP (TC_UOPPRE | TC_UOPPOST)
 163 #define TC_OPERAND (TC_VARIABLE | TC_ARRAY | TC_FUNCTION \
 164                    | TC_BUILTIN | TC_GETLINE | TC_SEQSTART | TC_STRING | TC_NUMBER)
 165
 166 #define TC_STATEMNT (TC_STATX | TC_WHILE)
 167 #define TC_OPTERM  (TC_SEMICOL | TC_NEWLINE)
 168
 169 /* word tokens, cannot mean something else if not expected */
 170 #define TC_WORD    (TC_IN | TC_STATEMNT | TC_ELSE | TC_BUILTIN \
 171                    | TC_GETLINE | TC_FUNCDECL | TC_BEGIN | TC_END)
 172
 173 /* discard newlines after these */
 174 #define TC_NOTERM  (TC_COMMA | TC_GRPSTART | TC_GRPTERM \
 175                    | TC_BINOP | TC_OPTERM)
 176
 177 /* what can expression begin with */
 178 #define TC_OPSEQ   (TC_OPERAND | TC_UOPPRE | TC_REGEXP)
 179 /* what can group begin with */
 180 #define TC_GRPSEQ  (TC_OPSEQ | TC_OPTERM | TC_STATEMNT | TC_GRPSTART)
 181
 182 /* if previous token class is CONCAT1 and next is CONCAT2, concatenation */
 183 /* operator is inserted between them */
 184 #define TC_CONCAT1 (TC_VARIABLE | TC_ARRTERM | TC_SEQTERM \
 185                    | TC_STRING | TC_NUMBER | TC_UOPPOST)
 186 #define TC_CONCAT2 (TC_OPERAND | TC_UOPPRE)
 187
 188 #define OF_RES1    0x010000
 189 #define OF_RES2    0x020000
 190 #define OF_STR1    0x040000
 191 #define OF_STR2    0x080000
 192 #define OF_NUM1    0x100000
 193 #define OF_CHECKED 0x200000
 194
 195 /* combined operator flags */
 196 #define xx      0
 197 #define xV      OF_RES2
 198 #define xS      (OF_RES2 | OF_STR2)
 199 #define Vx      OF_RES1
 200 #define VV      (OF_RES1 | OF_RES2)
 201 #define Nx      (OF_RES1 | OF_NUM1)
 202 #define NV      (OF_RES1 | OF_NUM1 | OF_RES2)
 203 #define Sx      (OF_RES1 | OF_STR1)
 204 #define SV      (OF_RES1 | OF_STR1 | OF_RES2)
 205 #define SS      (OF_RES1 | OF_STR1 | OF_RES2 | OF_STR2)
 206
 207 #define OPCLSMASK 0xFF00
 208 #define OPNMASK   0x007F
 209
 210 /* operator priority is a highest byte (even: r->l, odd: l->r grouping)
 211  * For builtins it has different meaning: n n s3 s2 s1 v3 v2 v1,
 212  * n - min. number of args, vN - resolve Nth arg to var, sN - resolve to string
 213  */
 214 #define P(x)      (x << 24)
 215 #define PRIMASK   0x7F000000
 216 #define PRIMASK2  0x7E000000
 217
 218 /* Operation classes */
 219
 220 #define SHIFT_TIL_THIS  0x0600
 221 #define RECUR_FROM_THIS 0x1000
 222
 223 enum {
 224         OC_DELETE = 0x0100,     OC_EXEC = 0x0200,       OC_NEWSOURCE = 0x0300,
 225         OC_PRINT = 0x0400,      OC_PRINTF = 0x0500,     OC_WALKINIT = 0x0600,
 226
 227         OC_BR = 0x0700,         OC_BREAK = 0x0800,      OC_CONTINUE = 0x0900,
 228         OC_EXIT = 0x0a00,       OC_NEXT = 0x0b00,       OC_NEXTFILE = 0x0c00,
 229         OC_TEST = 0x0d00,       OC_WALKNEXT = 0x0e00,
 230
 231         OC_BINARY = 0x1000,     OC_BUILTIN = 0x1100,    OC_COLON = 0x1200,
 232         OC_COMMA = 0x1300,      OC_COMPARE = 0x1400,    OC_CONCAT = 0x1500,
 233         OC_FBLTIN = 0x1600,     OC_FIELD = 0x1700,      OC_FNARG = 0x1800,
 234         OC_FUNC = 0x1900,       OC_GETLINE = 0x1a00,    OC_IN = 0x1b00,
 235         OC_LAND = 0x1c00,       OC_LOR = 0x1d00,        OC_MATCH = 0x1e00,
 236         OC_MOVE = 0x1f00,       OC_PGETLINE = 0x2000,   OC_REGEXP = 0x2100,
 237         OC_REPLACE = 0x2200,    OC_RETURN = 0x2300,     OC_SPRINTF = 0x2400,
 238         OC_TERNARY = 0x2500,    OC_UNARY = 0x2600,      OC_VAR = 0x2700,
 239         OC_DONE = 0x2800,
 240
 241         ST_IF = 0x3000,         ST_DO = 0x3100,         ST_FOR = 0x3200,
 242         ST_WHILE = 0x3300
 243 };
 244
 245 /* simple builtins */
 246 enum {
 247         F_in,   F_rn,   F_co,   F_ex,   F_lg,   F_si,   F_sq,   F_sr,
 248         F_ti,   F_le,   F_sy,   F_ff,   F_cl
 249 };
 250
 251 /* builtins */
 252 enum {
 253         B_a2,   B_ix,   B_ma,   B_sp,   B_ss,   B_ti,   B_lo,   B_up,
 254         B_ge,   B_gs,   B_su,
 255         B_an,   B_co,   B_ls,   B_or,   B_rs,   B_xo,
 256 };
 257
 258 /* tokens and their corresponding info values */
 259
 260 #define NTC     "\377"  /* switch to next token class (tc<<1) */
 261 #define NTCC    '\377'
 262
 263 #define OC_B    OC_BUILTIN
 264
 265 static const char tokenlist[] ALIGN1 =
 266         "\1("       NTC
 267         "\1)"       NTC
 268         "\1/"       NTC                                 /* REGEXP */
 269         "\2>>"      "\1>"       "\1|"       NTC         /* OUTRDR */
 270         "\2++"      "\2--"      NTC                     /* UOPPOST */
 271         "\2++"      "\2--"      "\1$"       NTC         /* UOPPRE1 */
 272         "\2=="      "\1="       "\2+="      "\2-="      /* BINOPX */
 273         "\2*="      "\2/="      "\2%="      "\2^="
 274         "\1+"       "\1-"       "\3**="     "\2**"
 275         "\1/"       "\1%"       "\1^"       "\1*"
 276         "\2!="      "\2>="      "\2<="      "\1>"
 277         "\1<"       "\2!~"      "\1~"       "\2&&"
 278         "\2||"      "\1?"       "\1:"       NTC
 279         "\2in"      NTC
 280         "\1,"       NTC
 281         "\1|"       NTC
 282         "\1+"       "\1-"       "\1!"       NTC         /* UOPPRE2 */
 283         "\1]"       NTC
 284         "\1{"       NTC
 285         "\1}"       NTC
 286         "\1;"       NTC
 287         "\1\n"      NTC
 288         "\2if"      "\2do"      "\3for"     "\5break"   /* STATX */
 289         "\10continue"           "\6delete"  "\5print"
 290         "\6printf"  "\4next"    "\10nextfile"
 291         "\6return"  "\4exit"    NTC
 292         "\5while"   NTC
 293         "\4else"    NTC
 294
 295         "\3and"     "\5compl"   "\6lshift"  "\2or"
 296         "\6rshift"  "\3xor"
 297         "\5close"   "\6system"  "\6fflush"  "\5atan2"   /* BUILTIN */
 298         "\3cos"     "\3exp"     "\3int"     "\3log"
 299         "\4rand"    "\3sin"     "\4sqrt"    "\5srand"
 300         "\6gensub"  "\4gsub"    "\5index"   "\6length"
 301         "\5match"   "\5split"   "\7sprintf" "\3sub"
 302         "\6substr"  "\7systime" "\10strftime"
 303         "\7tolower" "\7toupper" NTC
 304         "\7getline" NTC
 305         "\4func"    "\10function"   NTC
 306         "\5BEGIN"   NTC
 307         "\3END"     "\0"
 308         ;
 309
 310 static const uint32_t tokeninfo[] = {
 311         0,
 312         0,
 313         OC_REGEXP,
 314         xS|'a',     xS|'w',     xS|'|',
 315         OC_UNARY|xV|P(9)|'p',       OC_UNARY|xV|P(9)|'m',
 316         OC_UNARY|xV|P(9)|'P',       OC_UNARY|xV|P(9)|'M',
 317             OC_FIELD|xV|P(5),
 318         OC_COMPARE|VV|P(39)|5,      OC_MOVE|VV|P(74),
 319             OC_REPLACE|NV|P(74)|'+',    OC_REPLACE|NV|P(74)|'-',
 320         OC_REPLACE|NV|P(74)|'*',    OC_REPLACE|NV|P(74)|'/',
 321             OC_REPLACE|NV|P(74)|'%',    OC_REPLACE|NV|P(74)|'&',
 322         OC_BINARY|NV|P(29)|'+',     OC_BINARY|NV|P(29)|'-',
 323             OC_REPLACE|NV|P(74)|'&',    OC_BINARY|NV|P(15)|'&',
 324         OC_BINARY|NV|P(25)|'/',     OC_BINARY|NV|P(25)|'%',
 325             OC_BINARY|NV|P(15)|'&',     OC_BINARY|NV|P(25)|'*',
 326         OC_COMPARE|VV|P(39)|4,      OC_COMPARE|VV|P(39)|3,
 327             OC_COMPARE|VV|P(39)|0,      OC_COMPARE|VV|P(39)|1,
 328         OC_COMPARE|VV|P(39)|2,      OC_MATCH|Sx|P(45)|'!',
 329             OC_MATCH|Sx|P(45)|'~',      OC_LAND|Vx|P(55),
 330         OC_LOR|Vx|P(59),            OC_TERNARY|Vx|P(64)|'?',
 331             OC_COLON|xx|P(67)|':',
 332         OC_IN|SV|P(49),
 333         OC_COMMA|SS|P(80),
 334         OC_PGETLINE|SV|P(37),
 335         OC_UNARY|xV|P(19)|'+',      OC_UNARY|xV|P(19)|'-',
 336             OC_UNARY|xV|P(19)|'!',
 337         0,
 338         0,
 339         0,
 340         0,
 341         0,
 342         ST_IF,          ST_DO,          ST_FOR,         OC_BREAK,
 343         OC_CONTINUE,                    OC_DELETE|Vx,   OC_PRINT,
 344         OC_PRINTF,      OC_NEXT,        OC_NEXTFILE,
 345         OC_RETURN|Vx,   OC_EXIT|Nx,
 346         ST_WHILE,
 347         0,
 348
 349         OC_B|B_an|P(0x83), OC_B|B_co|P(0x41), OC_B|B_ls|P(0x83), OC_B|B_or|P(0x83),
 350         OC_B|B_rs|P(0x83), OC_B|B_xo|P(0x83),
 351         OC_FBLTIN|Sx|F_cl, OC_FBLTIN|Sx|F_sy, OC_FBLTIN|Sx|F_ff, OC_B|B_a2|P(0x83),
 352         OC_FBLTIN|Nx|F_co, OC_FBLTIN|Nx|F_ex, OC_FBLTIN|Nx|F_in, OC_FBLTIN|Nx|F_lg,
 353         OC_FBLTIN|F_rn,    OC_FBLTIN|Nx|F_si, OC_FBLTIN|Nx|F_sq, OC_FBLTIN|Nx|F_sr,
 354         OC_B|B_ge|P(0xd6), OC_B|B_gs|P(0xb6), OC_B|B_ix|P(0x9b), OC_FBLTIN|Sx|F_le,
 355         OC_B|B_ma|P(0x89), OC_B|B_sp|P(0x8b), OC_SPRINTF,        OC_B|B_su|P(0xb6),
 356         OC_B|B_ss|P(0x8f), OC_FBLTIN|F_ti,    OC_B|B_ti|P(0x0b),
 357         OC_B|B_lo|P(0x49), OC_B|B_up|P(0x49),
 358         OC_GETLINE|SV|P(0),
 359         0,      0,
 360         0,
 361         0
 362 };
 363
 364 /* internal variable names and their initial values       */
 365 /* asterisk marks SPECIAL vars; $ is just no-named Field0 */
 366 enum {
 367         CONVFMT,    OFMT,       FS,         OFS,
 368         ORS,        RS,         RT,         FILENAME,
 369         SUBSEP,     F0,         ARGIND,     ARGC,
 370         ARGV,       ERRNO,      FNR,        NR,
 371         NF,         IGNORECASE, ENVIRON,    NUM_INTERNAL_VARS
 372 };
 373
 374 static const char vNames[] ALIGN1 =
 375         "CONVFMT\0" "OFMT\0"    "FS\0*"     "OFS\0"
 376         "ORS\0"     "RS\0*"     "RT\0"      "FILENAME\0"
 377         "SUBSEP\0"  "$\0*"      "ARGIND\0"  "ARGC\0"
 378         "ARGV\0"    "ERRNO\0"   "FNR\0"     "NR\0"
 379         "NF\0*"     "IGNORECASE\0*" "ENVIRON\0" "\0";
 380
 381 static const char vValues[] ALIGN1 =
 382         "%.6g\0"    "%.6g\0"    " \0"       " \0"
 383         "\n\0"      "\n\0"      "\0"        "\0"
 384         "\034\0"    "\0"        "\377";
 385
 386 /* hash size may grow to these values */
 387 #define FIRST_PRIME 61
 388 static const uint16_t PRIMES[] ALIGN2 = { 251, 1021, 4093, 16381, 65521 };
 389
 390
 391 /* Globals. Split in two parts so that first one is addressed
 392  * with (mostly short) negative offsets.
 393  * NB: it's unsafe to put members of type "double"
 394  * into globals2 (gcc may fail to align them).
 395  */
 396 struct globals {
 397         double t_double;
 398         chain beginseq, mainseq, endseq;
 399         chain *seq;
 400         node *break_ptr, *continue_ptr;
 401         rstream *iF;
 402         xhash *vhash, *ahash, *fdhash, *fnhash;
 403         const char *g_progname;
 404         int g_lineno;
 405         int nfields;
 406         int maxfields; /* used in fsrealloc() only */
 407         var *Fields;
 408         nvblock *g_cb;
 409         char *g_pos;
 410         char *g_buf;
 411         smallint icase;
 412         smallint exiting;
 413         smallint nextrec;
 414         smallint nextfile;
 415         smallint is_f0_split;
 416 };
 417 struct globals2 {
 418         uint32_t t_info; /* often used */
 419         uint32_t t_tclass;
 420         char *t_string;
 421         int t_lineno;
 422         int t_rollback;
 423
 424         var *intvar[NUM_INTERNAL_VARS]; /* often used */
 425
 426         /* former statics from various functions */
 427         char *split_f0__fstrings;
 428
 429         uint32_t next_token__save_tclass;
 430         uint32_t next_token__save_info;
 431         uint32_t next_token__ltclass;
 432         smallint next_token__concat_inserted;
 433
 434         smallint next_input_file__files_happen;
 435         rstream next_input_file__rsm;
 436
 437         var *evaluate__fnargs;
 438         unsigned evaluate__seed;
 439         regex_t evaluate__sreg;
 440
 441         var ptest__v;
 442
 443         tsplitter exec_builtin__tspl;
 444
 445         /* biggest and least used members go last */
 446         tsplitter fsplitter, rsplitter;
 447 };
 448 #define G1 (ptr_to_globals[-1])
 449 #define G (*(struct globals2 *)ptr_to_globals)
 450 /* For debug. nm --size-sort awk.o | grep -vi ' [tr] ' */
 451 /*char G1size[sizeof(G1)]; - 0x74 */
 452 /*char Gsize[sizeof(G)]; - 0x1c4 */
 453 /* Trying to keep most of members accessible with short offsets: */
 454 /*char Gofs_seed[offsetof(struct globals2, evaluate__seed)]; - 0x90 */
 455 #define t_double     (G1.t_double    )
 456 #define beginseq     (G1.beginseq    )
 457 #define mainseq      (G1.mainseq     )
 458 #define endseq       (G1.endseq      )
 459 #define seq          (G1.seq         )
 460 #define break_ptr    (G1.break_ptr   )
 461 #define continue_ptr (G1.continue_ptr)
 462 #define iF           (G1.iF          )
 463 #define vhash        (G1.vhash       )
 464 #define ahash        (G1.ahash       )
 465 #define fdhash       (G1.fdhash      )
 466 #define fnhash       (G1.fnhash      )
 467 #define g_progname   (G1.g_progname  )
 468 #define g_lineno     (G1.g_lineno    )
 469 #define nfields      (G1.nfields     )
 470 #define maxfields    (G1.maxfields   )
 471 #define Fields       (G1.Fields      )
 472 #define g_cb         (G1.g_cb        )
 473 #define g_pos        (G1.g_pos       )
 474 #define g_buf        (G1.g_buf       )
 475 #define icase        (G1.icase       )
 476 #define exiting      (G1.exiting     )
 477 #define nextrec      (G1.nextrec     )
 478 #define nextfile     (G1.nextfile    )
 479 #define is_f0_split  (G1.is_f0_split )
 480 #define t_info       (G.t_info      )
 481 #define t_tclass     (G.t_tclass    )
 482 #define t_string     (G.t_string    )
 483 #define t_lineno     (G.t_lineno    )
 484 #define t_rollback   (G.t_rollback  )
 485 #define intvar       (G.intvar      )
 486 #define fsplitter    (G.fsplitter   )
 487 #define rsplitter    (G.rsplitter   )
 488 #define INIT_G() do { \
 489         SET_PTR_TO_GLOBALS(xzalloc(sizeof(G1) + sizeof(G)) + sizeof(G1)); \
 490         G.next_token__ltclass = TC_OPTERM; \
 491         G.evaluate__seed = 1; \
 492 } while (0)
 493
 494
 495 /* function prototypes */
 496 static void handle_special(var *);
 497 static node *parse_expr(uint32_t);
 498 static void chain_group(void);
 499 static var *evaluate(node *, var *);
 500 static rstream *next_input_file(void);
 501 static int fmt_num(char *, int, const char *, double, int);
 502 static int awk_exit(int) NORETURN;
 503
 504 /* ---- error handling ---- */
 505
 506 static const char EMSG_INTERNAL_ERROR[] ALIGN1 = "Internal error";
 507 static const char EMSG_UNEXP_EOS[] ALIGN1 = "Unexpected end of string";
 508 static const char EMSG_UNEXP_TOKEN[] ALIGN1 = "Unexpected token";
 509 static const char EMSG_DIV_BY_ZERO[] ALIGN1 = "Division by zero";
 510 static const char EMSG_INV_FMT[] ALIGN1 = "Invalid format specifier";
 511 static const char EMSG_TOO_FEW_ARGS[] ALIGN1 = "Too few arguments for builtin";
 512 static const char EMSG_NOT_ARRAY[] ALIGN1 = "Not an array";
 513 static const char EMSG_POSSIBLE_ERROR[] ALIGN1 = "Possible syntax error";
 514 static const char EMSG_UNDEF_FUNC[] ALIGN1 = "Call to undefined function";
 515 #if !ENABLE_FEATURE_AWK_LIBM
 516 static const char EMSG_NO_MATH[] ALIGN1 = "Math support is not compiled in";
 517 #endif
 518
 519 static void zero_out_var(var * vp)
 520 {
 521         memset(vp, 0, sizeof(*vp));
 522 }
 523
 524 static void syntax_error(const char *const message) NORETURN;
 525 static void syntax_error(const char *const message)
 526 {
 527         bb_error_msg_and_die("%s:%i: %s", g_progname, g_lineno, message);
 528 }
 529
 530 /* ---- hash stuff ---- */
 531
 532 static unsigned hashidx(const char *name)
 533 {
 534         unsigned idx = 0;
 535
 536         while (*name) idx = *name++ + (idx << 6) - idx;
 537         return idx;
 538 }
 539
 540 /* create new hash */
 541 static xhash *hash_init(void)
 542 {
 543         xhash *newhash;
 544
 545         newhash = xzalloc(sizeof(xhash));
 546         newhash->csize = FIRST_PRIME;
 547         newhash->items = xzalloc(newhash->csize * sizeof(hash_item *));
 548
 549         return newhash;
 550 }
 551
 552 /* find item in hash, return ptr to data, NULL if not found */
 553 static void *hash_search(xhash *hash, const char *name)
 554 {
 555         hash_item *hi;
 556
 557         hi = hash->items [ hashidx(name) % hash->csize ];
 558         while (hi) {
 559                 if (strcmp(hi->name, name) == 0)
 560                         return &(hi->data);
 561                 hi = hi->next;
 562         }
 563         return NULL;
 564 }
 565
 566 /* grow hash if it becomes too big */
 567 static void hash_rebuild(xhash *hash)
 568 {
 569         unsigned newsize, i, idx;
 570         hash_item **newitems, *hi, *thi;
 571
 572         if (hash->nprime == ARRAY_SIZE(PRIMES))
 573                 return;
 574
 575         newsize = PRIMES[hash->nprime++];
 576         newitems = xzalloc(newsize * sizeof(hash_item *));
 577
 578         for (i = 0; i < hash->csize; i++) {
 579                 hi = hash->items[i];
 580                 while (hi) {
 581                         thi = hi;
 582                         hi = thi->next;
 583                         idx = hashidx(thi->name) % newsize;
 584                         thi->next = newitems[idx];
 585                         newitems[idx] = thi;
 586                 }
 587         }
 588
 589         free(hash->items);
 590         hash->csize = newsize;
 591         hash->items = newitems;
 592 }
 593
 594 /* find item in hash, add it if necessary. Return ptr to data */
 595 static void *hash_find(xhash *hash, const char *name)
 596 {
 597         hash_item *hi;
 598         unsigned idx;
 599         int l;
 600
 601         hi = hash_search(hash, name);
 602         if (!hi) {
 603                 if (++hash->nel / hash->csize > 10)
 604                         hash_rebuild(hash);
 605
 606                 l = strlen(name) + 1;
 607                 hi = xzalloc(sizeof(hash_item) + l);
 608                 memcpy(hi->name, name, l);
 609
 610                 idx = hashidx(name) % hash->csize;
 611                 hi->next = hash->items[idx];
 612                 hash->items[idx] = hi;
 613                 hash->glen += l;
 614         }
 615         return &(hi->data);
 616 }
 617
 618 #define findvar(hash, name) ((var*)    hash_find((hash), (name)))
 619 #define newvar(name)        ((var*)    hash_find(vhash, (name)))
 620 #define newfile(name)       ((rstream*)hash_find(fdhash, (name)))
 621 #define newfunc(name)       ((func*)   hash_find(fnhash, (name)))
 622
 623 static void hash_remove(xhash *hash, const char *name)
 624 {
 625         hash_item *hi, **phi;
 626
 627         phi = &(hash->items[hashidx(name) % hash->csize]);
 628         while (*phi) {
 629                 hi = *phi;
 630                 if (strcmp(hi->name, name) == 0) {
 631                         hash->glen -= (strlen(name) + 1);
 632                         hash->nel--;
 633                         *phi = hi->next;
 634                         free(hi);
 635                         break;
 636                 }
 637                 phi = &(hi->next);
 638         }
 639 }
 640
 641 /* ------ some useful functions ------ */
 642
 643 static void skip_spaces(char **s)
 644 {
 645         char *p = *s;
 646
 647         while (1) {
 648                 if (*p == '\\' && p[1] == '\n') {
 649                         p++;
 650                         t_lineno++;
 651                 } else if (*p != ' ' && *p != '\t') {
 652                         break;
 653                 }
 654                 p++;
 655         }
 656         *s = p;
 657 }
 658
 659 static char *nextword(char **s)
 660 {
 661         char *p = *s;
 662
 663         while (*(*s)++) /* */;
 664
 665         return p;
 666 }
 667
 668 static char nextchar(char **s)
 669 {
 670         char c, *pps;
 671
 672         c = *((*s)++);
 673         pps = *s;
 674         if (c == '\\') c = bb_process_escape_sequence((const char**)s);
 675         if (c == '\\' && *s == pps) c = *((*s)++);
 676         return c;
 677 }
 678
 679 static ALWAYS_INLINE int isalnum_(int c)
 680 {
 681         return (isalnum(c) || c == '_');
 682 }
 683
 684 static double my_strtod(char **pp)
 685 {
 686 #if ENABLE_DESKTOP
 687         if ((*pp)[0] == '0'
 688          && ((((*pp)[1] | 0x20) == 'x') || isdigit((*pp)[1]))
 689         ) {
 690                 return strtoull(*pp, pp, 0);
 691         }
 692 #endif
 693         return strtod(*pp, pp);
 694 }
 695
 696 /* -------- working with variables (set/get/copy/etc) -------- */
 697
 698 static xhash *iamarray(var *v)
 699 {
 700         var *a = v;
 701
 702         while (a->type & VF_CHILD)
 703                 a = a->x.parent;
 704
 705         if (!(a->type & VF_ARRAY)) {
 706                 a->type |= VF_ARRAY;
 707                 a->x.array = hash_init();
 708         }
 709         return a->x.array;
 710 }
 711
 712 static void clear_array(xhash *array)
 713 {
 714         unsigned i;
 715         hash_item *hi, *thi;
 716
 717         for (i = 0; i < array->csize; i++) {
 718                 hi = array->items[i];
 719                 while (hi) {
 720                         thi = hi;
 721                         hi = hi->next;
 722                         free(thi->data.v.string);
 723                         free(thi);
 724                 }
 725                 array->items[i] = NULL;
 726         }
 727         array->glen = array->nel = 0;
 728 }
 729
 730 /* clear a variable */
 731 static var *clrvar(var *v)
 732 {
 733         if (!(v->type & VF_FSTR))
 734                 free(v->string);
 735
 736         v->type &= VF_DONTTOUCH;
 737         v->type |= VF_DIRTY;
 738         v->string = NULL;
 739         return v;
 740 }
 741
 742 /* assign string value to variable */
 743 static var *setvar_p(var *v, char *value)
 744 {
 745         clrvar(v);
 746         v->string = value;
 747         handle_special(v);
 748         return v;
 749 }
 750
 751 /* same as setvar_p but make a copy of string */
 752 static var *setvar_s(var *v, const char *value)
 753 {
 754         return setvar_p(v, (value && *value) ? xstrdup(value) : NULL);
 755 }
 756
 757 /* same as setvar_s but set USER flag */
 758 static var *setvar_u(var *v, const char *value)
 759 {
 760         setvar_s(v, value);
 761         v->type |= VF_USER;
 762         return v;
 763 }
 764
 765 /* set array element to user string */
 766 static void setari_u(var *a, int idx, const char *s)
 767 {
 768         char sidx[sizeof(int)*3 + 1];
 769         var *v;
 770
 771         sprintf(sidx, "%d", idx);
 772         v = findvar(iamarray(a), sidx);
 773         setvar_u(v, s);
 774 }
 775
 776 /* assign numeric value to variable */
 777 static var *setvar_i(var *v, double value)
 778 {
 779         clrvar(v);
 780         v->type |= VF_NUMBER;
 781         v->number = value;
 782         handle_special(v);
 783         return v;
 784 }
 785
 786 static const char *getvar_s(var *v)
 787 {
 788         /* if v is numeric and has no cached string, convert it to string */
 789         if ((v->type & (VF_NUMBER | VF_CACHED)) == VF_NUMBER) {
 790                 fmt_num(g_buf, MAXVARFMT, getvar_s(intvar[CONVFMT]), v->number, TRUE);
 791                 v->string = xstrdup(g_buf);
 792                 v->type |= VF_CACHED;
 793         }
 794         return (v->string == NULL) ? "" : v->string;
 795 }
 796
 797 static double getvar_i(var *v)
 798 {
 799         char *s;
 800
 801         if ((v->type & (VF_NUMBER | VF_CACHED)) == 0) {
 802                 v->number = 0;
 803                 s = v->string;
 804                 if (s && *s) {
 805                         v->number = my_strtod(&s);
 806                         if (v->type & VF_USER) {
 807                                 skip_spaces(&s);
 808                                 if (*s != '\0')
 809                                         v->type &= ~VF_USER;
 810                         }
 811                 } else {
 812                         v->type &= ~VF_USER;
 813                 }
 814                 v->type |= VF_CACHED;
 815         }
 816         return v->number;
 817 }
 818
 819 /* Used for operands of bitwise ops */
 820 static unsigned long getvar_i_int(var *v)
 821 {
 822         double d = getvar_i(v);
 823
 824         /* Casting doubles to longs is undefined for values outside
 825          * of target type range. Try to widen it as much as possible */
 826         if (d >= 0)
 827                 return (unsigned long)d;
 828         /* Why? Think about d == -4294967295.0 (assuming 32bit longs) */
 829         return - (long) (unsigned long) (-d);
 830 }
 831
 832 static var *copyvar(var *dest, const var *src)
 833 {
 834         if (dest != src) {
 835                 clrvar(dest);
 836                 dest->type |= (src->type & ~(VF_DONTTOUCH | VF_FSTR));
 837                 dest->number = src->number;
 838                 if (src->string)
 839                         dest->string = xstrdup(src->string);
 840         }
 841         handle_special(dest);
 842         return dest;
 843 }
 844
 845 static var *incvar(var *v)
 846 {
 847         return setvar_i(v, getvar_i(v) + 1.);
 848 }
 849
 850 /* return true if v is number or numeric string */
 851 static int is_numeric(var *v)
 852 {
 853         getvar_i(v);
 854         return ((v->type ^ VF_DIRTY) & (VF_NUMBER | VF_USER | VF_DIRTY));
 855 }
 856
 857 /* return 1 when value of v corresponds to true, 0 otherwise */
 858 static int istrue(var *v)
 859 {
 860         if (is_numeric(v))
 861                 return (v->number == 0) ? 0 : 1;
 862         return (v->string && *(v->string)) ? 1 : 0;
 863 }
 864
 865 /* temporary variables allocator. Last allocated should be first freed */
 866 static var *nvalloc(int n)
 867 {
 868         nvblock *pb = NULL;
 869         var *v, *r;
 870         int size;
 871
 872         while (g_cb) {
 873                 pb = g_cb;
 874                 if ((g_cb->pos - g_cb->nv) + n <= g_cb->size) break;
 875                 g_cb = g_cb->next;
 876         }
 877
 878         if (!g_cb) {
 879                 size = (n <= MINNVBLOCK) ? MINNVBLOCK : n;
 880                 g_cb = xzalloc(sizeof(nvblock) + size * sizeof(var));
 881                 g_cb->size = size;
 882                 g_cb->pos = g_cb->nv;
 883                 g_cb->prev = pb;
 884                 /*g_cb->next = NULL; - xzalloc did it */
 885                 if (pb) pb->next = g_cb;
 886         }
 887
 888         v = r = g_cb->pos;
 889         g_cb->pos += n;
 890
 891         while (v < g_cb->pos) {
 892                 v->type = 0;
 893                 v->string = NULL;
 894                 v++;
 895         }
 896
 897         return r;
 898 }
 899
 900 static void nvfree(var *v)
 901 {
 902         var *p;
 903
 904         if (v < g_cb->nv || v >= g_cb->pos)
 905                 syntax_error(EMSG_INTERNAL_ERROR);
 906
 907         for (p = v; p < g_cb->pos; p++) {
 908                 if ((p->type & (VF_ARRAY | VF_CHILD)) == VF_ARRAY) {
 909                         clear_array(iamarray(p));
 910                         free(p->x.array->items);
 911                         free(p->x.array);
 912                 }
 913                 if (p->type & VF_WALK)
 914                         free(p->x.walker);
 915
 916                 clrvar(p);
 917         }
 918
 919         g_cb->pos = v;
 920         while (g_cb->prev && g_cb->pos == g_cb->nv) {
 921                 g_cb = g_cb->prev;
 922         }
 923 }
 924
 925 /* ------- awk program text parsing ------- */
 926
 927 /* Parse next token pointed by global pos, place results into global ttt.
 928  * If token isn't expected, give away. Return token class
 929  */
 930 static uint32_t next_token(uint32_t expected)
 931 {
 932 #define concat_inserted (G.next_token__concat_inserted)
 933 #define save_tclass     (G.next_token__save_tclass)
 934 #define save_info       (G.next_token__save_info)
 935 /* Initialized to TC_OPTERM: */
 936 #define ltclass         (G.next_token__ltclass)
 937
 938         char *p, *pp, *s;
 939         const char *tl;
 940         uint32_t tc;
 941         const uint32_t *ti;
 942         int l;
 943
 944         if (t_rollback) {
 945                 t_rollback = FALSE;
 946
 947         } else if (concat_inserted) {
 948                 concat_inserted = FALSE;
 949                 t_tclass = save_tclass;
 950                 t_info = save_info;
 951
 952         } else {
 953                 p = g_pos;
 954  readnext:
 955                 skip_spaces(&p);
 956                 g_lineno = t_lineno;
 957                 if (*p == '#')
 958                         while (*p != '\n' && *p != '\0')
 959                                 p++;
 960
 961                 if (*p == '\n')
 962                         t_lineno++;
 963
 964                 if (*p == '\0') {
 965                         tc = TC_EOF;
 966
 967                 } else if (*p == '\"') {
 968                         /* it's a string */
 969                         t_string = s = ++p;
 970                         while (*p != '\"') {
 971                                 if (*p == '\0' || *p == '\n')
 972                                         syntax_error(EMSG_UNEXP_EOS);
 973                                 *(s++) = nextchar(&p);
 974                         }
 975                         p++;
 976                         *s = '\0';
 977                         tc = TC_STRING;
 978
 979                 } else if ((expected & TC_REGEXP) && *p == '/') {
 980                         /* it's regexp */
 981                         t_string = s = ++p;
 982                         while (*p != '/') {
 983                                 if (*p == '\0' || *p == '\n')
 984                                         syntax_error(EMSG_UNEXP_EOS);
 985                                 *s = *p++;
 986                                 if (*s++ == '\\') {
 987                                         pp = p;
 988                                         *(s-1) = bb_process_escape_sequence((const char **)&p);
 989                                         if (*pp == '\\')
 990                                                 *s++ = '\\';
 991                                         if (p == pp)
 992                                                 *s++ = *p++;
 993                                 }
 994                         }
 995                         p++;
 996                         *s = '\0';
 997                         tc = TC_REGEXP;
 998
 999                 } else if (*p == '.' || isdigit(*p)) {
1000                         /* it's a number */
1001                         t_double = my_strtod(&p);
1002                         if (*p == '.')
1003                                 syntax_error(EMSG_UNEXP_TOKEN);
1004                         tc = TC_NUMBER;
1005
1006                 } else {
1007                         /* search for something known */
1008                         tl = tokenlist;
1009                         tc = 0x00000001;
1010                         ti = tokeninfo;
1011                         while (*tl) {
1012                                 l = *(tl++);
1013                                 if (l == NTCC) {
1014                                         tc <<= 1;
1015                                         continue;
1016                                 }
1017                                 /* if token class is expected, token
1018                                  * matches and it's not a longer word,
1019                                  * then this is what we are looking for
1020                                  */
1021                                 if ((tc & (expected | TC_WORD | TC_NEWLINE))
1022                                  && *tl == *p && strncmp(p, tl, l) == 0
1023                                  && !((tc & TC_WORD) && isalnum_(p[l]))
1024                                 ) {
1025                                         t_info = *ti;
1026                                         p += l;
1027                                         break;
1028                                 }
1029                                 ti++;
1030                                 tl += l;
1031                         }
1032
1033                         if (!*tl) {
1034                                 /* it's a name (var/array/function),
1035                                  * otherwise it's something wrong
1036                                  */
1037                                 if (!isalnum_(*p))
1038                                         syntax_error(EMSG_UNEXP_TOKEN);
1039
1040                                 t_string = --p;
1041                                 while (isalnum_(*(++p))) {
1042                                         *(p-1) = *p;
1043                                 }
1044                                 *(p-1) = '\0';
1045                                 tc = TC_VARIABLE;
1046                                 /* also consume whitespace between functionname and bracket */
1047                                 if (!(expected & TC_VARIABLE))
1048                                         skip_spaces(&p);
1049                                 if (*p == '(') {
1050                                         tc = TC_FUNCTION;
1051                                 } else {
1052                                         if (*p == '[') {
1053                                                 p++;
1054                                                 tc = TC_ARRAY;
1055                                         }
1056                                 }
1057                         }
1058                 }
1059                 g_pos = p;
1060
1061                 /* skipping newlines in some cases */
1062                 if ((ltclass & TC_NOTERM) && (tc & TC_NEWLINE))
1063                         goto readnext;
1064
1065                 /* insert concatenation operator when needed */
1066                 if ((ltclass & TC_CONCAT1) && (tc & TC_CONCAT2) && (expected & TC_BINOP)) {
1067                         concat_inserted = TRUE;
1068                         save_tclass = tc;
1069                         save_info = t_info;
1070                         tc = TC_BINOP;
1071                         t_info = OC_CONCAT | SS | P(35);
1072                 }
1073
1074                 t_tclass = tc;
1075         }
1076         ltclass = t_tclass;
1077
1078         /* Are we ready for this? */
1079         if (!(ltclass & expected))
1080                 syntax_error((ltclass & (TC_NEWLINE | TC_EOF)) ?
1081                                 EMSG_UNEXP_EOS : EMSG_UNEXP_TOKEN);
1082
1083         return ltclass;
1084 #undef concat_inserted
1085 #undef save_tclass
1086 #undef save_info
1087 #undef ltclass
1088 }
1089
1090 static void rollback_token(void)
1091 {
1092         t_rollback = TRUE;
1093 }
1094
1095 static node *new_node(uint32_t info)
1096 {
1097         node *n;
1098
1099         n = xzalloc(sizeof(node));
1100         n->info = info;
1101         n->lineno = g_lineno;
1102         return n;
1103 }
1104
1105 static node *mk_re_node(const char *s, node *n, regex_t *re)
1106 {
1107         n->info = OC_REGEXP;
1108         n->l.re = re;
1109         n->r.ire = re + 1;
1110         xregcomp(re, s, REG_EXTENDED);
1111         xregcomp(re + 1, s, REG_EXTENDED | REG_ICASE);
1112
1113         return n;
1114 }
1115
1116 static node *condition(void)
1117 {
1118         next_token(TC_SEQSTART);
1119         return parse_expr(TC_SEQTERM);
1120 }
1121
1122 /* parse expression terminated by given argument, return ptr
1123  * to built subtree. Terminator is eaten by parse_expr */
1124 static node *parse_expr(uint32_t iexp)
1125 {
1126         node sn;
1127         node *cn = &sn;
1128         node *vn, *glptr;
1129         uint32_t tc, xtc;
1130         var *v;
1131
1132         sn.info = PRIMASK;
1133         sn.r.n = glptr = NULL;
1134         xtc = TC_OPERAND | TC_UOPPRE | TC_REGEXP | iexp;
1135
1136         while (!((tc = next_token(xtc)) & iexp)) {
1137                 if (glptr && (t_info == (OC_COMPARE | VV | P(39) | 2))) {
1138                         /* input redirection (<) attached to glptr node */
1139                         cn = glptr->l.n = new_node(OC_CONCAT | SS | P(37));
1140                         cn->a.n = glptr;
1141                         xtc = TC_OPERAND | TC_UOPPRE;
1142                         glptr = NULL;
1143
1144                 } else if (tc & (TC_BINOP | TC_UOPPOST)) {
1145                         /* for binary and postfix-unary operators, jump back over
1146                          * previous operators with higher priority */
1147                         vn = cn;
1148                         while ( ((t_info & PRIMASK) > (vn->a.n->info & PRIMASK2))
1149                          || ((t_info == vn->info) && ((t_info & OPCLSMASK) == OC_COLON)) )
1150                                 vn = vn->a.n;
1151                         if ((t_info & OPCLSMASK) == OC_TERNARY)
1152                                 t_info += P(6);
1153                         cn = vn->a.n->r.n = new_node(t_info);
1154                         cn->a.n = vn->a.n;
1155                         if (tc & TC_BINOP) {
1156                                 cn->l.n = vn;
1157                                 xtc = TC_OPERAND | TC_UOPPRE | TC_REGEXP;
1158                                 if ((t_info & OPCLSMASK) == OC_PGETLINE) {
1159                                         /* it's a pipe */
1160                                         next_token(TC_GETLINE);
1161                                         /* give maximum priority to this pipe */
1162                                         cn->info &= ~PRIMASK;
1163                                         xtc = TC_OPERAND | TC_UOPPRE | TC_BINOP | iexp;
1164                                 }
1165                         } else {
1166                                 cn->r.n = vn;
1167                                 xtc = TC_OPERAND | TC_UOPPRE | TC_BINOP | iexp;
1168                         }
1169                         vn->a.n = cn;
1170
1171                 } else {
1172                         /* for operands and prefix-unary operators, attach them
1173                          * to last node */
1174                         vn = cn;
1175                         cn = vn->r.n = new_node(t_info);
1176                         cn->a.n = vn;
1177                         xtc = TC_OPERAND | TC_UOPPRE | TC_REGEXP;
1178                         if (tc & (TC_OPERAND | TC_REGEXP)) {
1179                                 xtc = TC_UOPPRE | TC_UOPPOST | TC_BINOP | TC_OPERAND | iexp;
1180                                 /* one should be very careful with switch on tclass -
1181                                  * only simple tclasses should be used! */
1182                                 switch (tc) {
1183                                 case TC_VARIABLE:
1184                                 case TC_ARRAY:
1185                                         cn->info = OC_VAR;
1186                                         v = hash_search(ahash, t_string);
1187                                         if (v != NULL) {
1188                                                 cn->info = OC_FNARG;
1189                                                 cn->l.i = v->x.aidx;
1190                                         } else {
1191                                                 cn->l.v = newvar(t_string);
1192                                         }
1193                                         if (tc & TC_ARRAY) {
1194                                                 cn->info |= xS;
1195                                                 cn->r.n = parse_expr(TC_ARRTERM);
1196                                         }
1197                                         break;
1198
1199                                 case TC_NUMBER:
1200                                 case TC_STRING:
1201                                         cn->info = OC_VAR;
1202                                         v = cn->l.v = xzalloc(sizeof(var));
1203                                         if (tc & TC_NUMBER)
1204                                                 setvar_i(v, t_double);
1205                                         else
1206                                                 setvar_s(v, t_string);
1207                                         break;
1208
1209                                 case TC_REGEXP:
1210                                         mk_re_node(t_string, cn, xzalloc(sizeof(regex_t)*2));
1211                                         break;
1212
1213                                 case TC_FUNCTION:
1214                                         cn->info = OC_FUNC;
1215                                         cn->r.f = newfunc(t_string);
1216                                         cn->l.n = condition();
1217                                         break;
1218
1219                                 case TC_SEQSTART:
1220                                         cn = vn->r.n = parse_expr(TC_SEQTERM);
1221                                         cn->a.n = vn;
1222                                         break;
1223
1224                                 case TC_GETLINE:
1225                                         glptr = cn;
1226                                         xtc = TC_OPERAND | TC_UOPPRE | TC_BINOP | iexp;
1227                                         break;
1228
1229                                 case TC_BUILTIN:
1230                                         cn->l.n = condition();
1231                                         break;
1232                                 }
1233                         }
1234                 }
1235         }
1236         return sn.r.n;
1237 }
1238
1239 /* add node to chain. Return ptr to alloc'd node */
1240 static node *chain_node(uint32_t info)
1241 {
1242         node *n;
1243
1244         if (!seq->first)
1245                 seq->first = seq->last = new_node(0);
1246
1247         if (seq->programname != g_progname) {
1248                 seq->programname = g_progname;
1249                 n = chain_node(OC_NEWSOURCE);
1250                 n->l.s = xstrdup(g_progname);
1251         }
1252
1253         n = seq->last;
1254         n->info = info;
1255         seq->last = n->a.n = new_node(OC_DONE);
1256
1257         return n;
1258 }
1259
1260 static void chain_expr(uint32_t info)
1261 {
1262         node *n;
1263
1264         n = chain_node(info);
1265         n->l.n = parse_expr(TC_OPTERM | TC_GRPTERM);
1266         if (t_tclass & TC_GRPTERM)
1267                 rollback_token();
1268 }
1269
1270 static node *chain_loop(node *nn)
1271 {
1272         node *n, *n2, *save_brk, *save_cont;
1273
1274         save_brk = break_ptr;
1275         save_cont = continue_ptr;
1276
1277         n = chain_node(OC_BR | Vx);
1278         continue_ptr = new_node(OC_EXEC);
1279         break_ptr = new_node(OC_EXEC);
1280         chain_group();
1281         n2 = chain_node(OC_EXEC | Vx);
1282         n2->l.n = nn;
1283         n2->a.n = n;
1284         continue_ptr->a.n = n2;
1285         break_ptr->a.n = n->r.n = seq->last;
1286
1287         continue_ptr = save_cont;
1288         break_ptr = save_brk;
1289
1290         return n;
1291 }
1292
1293 /* parse group and attach it to chain */
1294 static void chain_group(void)
1295 {
1296         uint32_t c;
1297         node *n, *n2, *n3;
1298
1299         do {
1300                 c = next_token(TC_GRPSEQ);
1301         } while (c & TC_NEWLINE);
1302
1303         if (c & TC_GRPSTART) {
1304                 while (next_token(TC_GRPSEQ | TC_GRPTERM) != TC_GRPTERM) {
1305                         if (t_tclass & TC_NEWLINE) continue;
1306                         rollback_token();
1307                         chain_group();
1308                 }
1309         } else if (c & (TC_OPSEQ | TC_OPTERM)) {
1310                 rollback_token();
1311                 chain_expr(OC_EXEC | Vx);
1312         } else {                                                /* TC_STATEMNT */
1313                 switch (t_info & OPCLSMASK) {
1314                 case ST_IF:
1315                         n = chain_node(OC_BR | Vx);
1316                         n->l.n = condition();
1317                         chain_group();
1318                         n2 = chain_node(OC_EXEC);
1319                         n->r.n = seq->last;
1320                         if (next_token(TC_GRPSEQ | TC_GRPTERM | TC_ELSE) == TC_ELSE) {
1321                                 chain_group();
1322                                 n2->a.n = seq->last;
1323                         } else {
1324                                 rollback_token();
1325                         }
1326                         break;
1327
1328                 case ST_WHILE:
1329                         n2 = condition();
1330                         n = chain_loop(NULL);
1331                         n->l.n = n2;
1332                         break;
1333
1334                 case ST_DO:
1335                         n2 = chain_node(OC_EXEC);
1336                         n = chain_loop(NULL);
1337                         n2->a.n = n->a.n;
1338                         next_token(TC_WHILE);
1339                         n->l.n = condition();
1340                         break;
1341
1342                 case ST_FOR:
1343                         next_token(TC_SEQSTART);
1344                         n2 = parse_expr(TC_SEMICOL | TC_SEQTERM);
1345                         if (t_tclass & TC_SEQTERM) {    /* for-in */
1346                                 if ((n2->info & OPCLSMASK) != OC_IN)
1347                                         syntax_error(EMSG_UNEXP_TOKEN);
1348                                 n = chain_node(OC_WALKINIT | VV);
1349                                 n->l.n = n2->l.n;
1350                                 n->r.n = n2->r.n;
1351                                 n = chain_loop(NULL);
1352                                 n->info = OC_WALKNEXT | Vx;
1353                                 n->l.n = n2->l.n;
1354                         } else {                        /* for (;;) */
1355                                 n = chain_node(OC_EXEC | Vx);
1356                                 n->l.n = n2;
1357                                 n2 = parse_expr(TC_SEMICOL);
1358                                 n3 = parse_expr(TC_SEQTERM);
1359                                 n = chain_loop(n3);
1360                                 n->l.n = n2;
1361                                 if (!n2)
1362                                         n->info = OC_EXEC;
1363                         }
1364                         break;
1365
1366                 case OC_PRINT:
1367                 case OC_PRINTF:
1368                         n = chain_node(t_info);
1369                         n->l.n = parse_expr(TC_OPTERM | TC_OUTRDR | TC_GRPTERM);
1370                         if (t_tclass & TC_OUTRDR) {
1371                                 n->info |= t_info;
1372                                 n->r.n = parse_expr(TC_OPTERM | TC_GRPTERM);
1373                         }
1374                         if (t_tclass & TC_GRPTERM)
1375                                 rollback_token();
1376                         break;
1377
1378                 case OC_BREAK:
1379                         n = chain_node(OC_EXEC);
1380                         n->a.n = break_ptr;
1381                         break;
1382
1383                 case OC_CONTINUE:
1384                         n = chain_node(OC_EXEC);
1385                         n->a.n = continue_ptr;
1386                         break;
1387
1388                 /* delete, next, nextfile, return, exit */
1389                 default:
1390                         chain_expr(t_info);
1391                 }
1392         }
1393 }
1394
1395 static void parse_program(char *p)
1396 {
1397         uint32_t tclass;
1398         node *cn;
1399         func *f;
1400         var *v;
1401
1402         g_pos = p;
1403         t_lineno = 1;
1404         while ((tclass = next_token(TC_EOF | TC_OPSEQ | TC_GRPSTART |
1405                         TC_OPTERM | TC_BEGIN | TC_END | TC_FUNCDECL)) != TC_EOF) {
1406
1407                 if (tclass & TC_OPTERM)
1408                         continue;
1409
1410                 seq = &mainseq;
1411                 if (tclass & TC_BEGIN) {
1412                         seq = &beginseq;
1413                         chain_group();
1414
1415                 } else if (tclass & TC_END) {
1416                         seq = &endseq;
1417                         chain_group();
1418
1419                 } else if (tclass & TC_FUNCDECL) {
1420                         next_token(TC_FUNCTION);
1421                         g_pos++;
1422                         f = newfunc(t_string);
1423                         f->body.first = NULL;
1424                         f->nargs = 0;
1425                         while (next_token(TC_VARIABLE | TC_SEQTERM) & TC_VARIABLE) {
1426                                 v = findvar(ahash, t_string);
1427                                 v->x.aidx = (f->nargs)++;
1428
1429                                 if (next_token(TC_COMMA | TC_SEQTERM) & TC_SEQTERM)
1430                                         break;
1431                         }
1432                         seq = &(f->body);
1433                         chain_group();
1434                         clear_array(ahash);
1435
1436                 } else if (tclass & TC_OPSEQ) {
1437                         rollback_token();
1438                         cn = chain_node(OC_TEST);
1439                         cn->l.n = parse_expr(TC_OPTERM | TC_EOF | TC_GRPSTART);
1440                         if (t_tclass & TC_GRPSTART) {
1441                                 rollback_token();
1442                                 chain_group();
1443                         } else {
1444                                 chain_node(OC_PRINT);
1445                         }
1446                         cn->r.n = mainseq.last;
1447
1448                 } else /* if (tclass & TC_GRPSTART) */ {
1449                         rollback_token();
1450                         chain_group();
1451                 }
1452         }
1453 }
1454
1455
1456 /* -------- program execution part -------- */
1457
1458 static node *mk_splitter(const char *s, tsplitter *spl)
1459 {
1460         regex_t *re, *ire;
1461         node *n;
1462
1463         re = &spl->re[0];
1464         ire = &spl->re[1];
1465         n = &spl->n;
1466         if ((n->info & OPCLSMASK) == OC_REGEXP) {
1467                 regfree(re);
1468                 regfree(ire); // TODO: nuke ire, use re+1?
1469         }
1470         if (strlen(s) > 1) {
1471                 mk_re_node(s, n, re);
1472         } else {
1473                 n->info = (uint32_t) *s;
1474         }
1475
1476         return n;
1477 }
1478
1479 /* use node as a regular expression. Supplied with node ptr and regex_t
1480  * storage space. Return ptr to regex (if result points to preg, it should
1481  * be later regfree'd manually
1482  */
1483 static regex_t *as_regex(node *op, regex_t *preg)
1484 {
1485         var *v;
1486         const char *s;
1487
1488         if ((op->info & OPCLSMASK) == OC_REGEXP) {
1489                 return icase ? op->r.ire : op->l.re;
1490         }
1491         v = nvalloc(1);
1492         s = getvar_s(evaluate(op, v));
1493         xregcomp(preg, s, icase ? REG_EXTENDED | REG_ICASE : REG_EXTENDED);
1494         nvfree(v);
1495         return preg;
1496 }
1497
1498 /* gradually increasing buffer */
1499 static void qrealloc(char **b, int n, int *size)
1500 {
1501         if (!*b || n >= *size) {
1502                 *size = n + (n>>1) + 80;
1503                 *b = xrealloc(*b, *size);
1504         }
1505 }
1506
1507 /* resize field storage space */
1508 static void fsrealloc(int size)
1509 {
1510         int i;
1511
1512         if (size >= maxfields) {
1513                 i = maxfields;
1514                 maxfields = size + 16;
1515                 Fields = xrealloc(Fields, maxfields * sizeof(var));
1516                 for (; i < maxfields; i++) {
1517                         Fields[i].type = VF_SPECIAL;
1518                         Fields[i].string = NULL;
1519                 }
1520         }
1521
1522         if (size < nfields) {
1523                 for (i = size; i < nfields; i++) {
1524                         clrvar(Fields + i);
1525                 }
1526         }
1527         nfields = size;
1528 }
1529
1530 static int awk_split(const char *s, node *spl, char **slist)
1531 {
1532         int l, n = 0;
1533         char c[4];
1534         char *s1;
1535         regmatch_t pmatch[2]; // TODO: why [2]? [1] is enough...
1536
1537         /* in worst case, each char would be a separate field */
1538         *slist = s1 = xzalloc(strlen(s) * 2 + 3);
1539         strcpy(s1, s);
1540
1541         c[0] = c[1] = (char)spl->info;
1542         c[2] = c[3] = '\0';
1543         if (*getvar_s(intvar[RS]) == '\0')
1544                 c[2] = '\n';
1545
1546         if ((spl->info & OPCLSMASK) == OC_REGEXP) {  /* regex split */
1547                 if (!*s)
1548                         return n; /* "": zero fields */
1549                 n++; /* at least one field will be there */
1550                 do {
1551                         l = strcspn(s, c+2); /* len till next NUL or \n */
1552                         if (regexec(icase ? spl->r.ire : spl->l.re, s, 1, pmatch, 0) == 0
1553                          && pmatch[0].rm_so <= l
1554                         ) {
1555                                 l = pmatch[0].rm_so;
1556                                 if (pmatch[0].rm_eo == 0) {
1557                                         l++;
1558                                         pmatch[0].rm_eo++;
1559                                 }
1560                                 n++; /* we saw yet another delimiter */
1561                         } else {
1562                                 pmatch[0].rm_eo = l;
1563                                 if (s[l]) pmatch[0].rm_eo++;
1564                         }
1565                         memcpy(s1, s, l);
1566                         s1[l] = '\0';
1567                         nextword(&s1);
1568                         s += pmatch[0].rm_eo;
1569                 } while (*s);
1570                 return n;
1571         }
1572         if (c[0] == '\0') {  /* null split */
1573                 while (*s) {
1574                         *s1++ = *s++;
1575                         *s1++ = '\0';
1576                         n++;
1577                 }
1578                 return n;
1579         }
1580         if (c[0] != ' ') {  /* single-character split */
1581                 if (icase) {
1582                         c[0] = toupper(c[0]);
1583                         c[1] = tolower(c[1]);
1584                 }
1585                 if (*s1) n++;
1586                 while ((s1 = strpbrk(s1, c))) {
1587                         *s1++ = '\0';
1588                         n++;
1589                 }
1590                 return n;
1591         }
1592         /* space split */
1593         while (*s) {
1594                 s = skip_whitespace(s);
1595                 if (!*s) break;
1596                 n++;
1597                 while (*s && !isspace(*s))
1598                         *s1++ = *s++;
1599                 *s1++ = '\0';
1600         }
1601         return n;
1602 }
1603
1604 static void split_f0(void)
1605 {
1606 /* static char *fstrings; */
1607 #define fstrings (G.split_f0__fstrings)
1608
1609         int i, n;
1610         char *s;
1611
1612         if (is_f0_split)
1613                 return;
1614
1615         is_f0_split = TRUE;
1616         free(fstrings);
1617         fsrealloc(0);
1618         n = awk_split(getvar_s(intvar[F0]), &fsplitter.n, &fstrings);
1619         fsrealloc(n);
1620         s = fstrings;
1621         for (i = 0; i < n; i++) {
1622                 Fields[i].string = nextword(&s);
1623                 Fields[i].type |= (VF_FSTR | VF_USER | VF_DIRTY);
1624         }
1625
1626         /* set NF manually to avoid side effects */
1627         clrvar(intvar[NF]);
1628         intvar[NF]->type = VF_NUMBER | VF_SPECIAL;
1629         intvar[NF]->number = nfields;
1630 #undef fstrings
1631 }
1632
1633 /* perform additional actions when some internal variables changed */
1634 static void handle_special(var *v)
1635 {
1636         int n;
1637         char *b;
1638         const char *sep, *s;
1639         int sl, l, len, i, bsize;
1640
1641         if (!(v->type & VF_SPECIAL))
1642                 return;
1643
1644         if (v == intvar[NF]) {
1645                 n = (int)getvar_i(v);
1646                 fsrealloc(n);
1647
1648                 /* recalculate $0 */
1649                 sep = getvar_s(intvar[OFS]);
1650                 sl = strlen(sep);
1651                 b = NULL;
1652                 len = 0;
1653                 for (i = 0; i < n; i++) {
1654                         s = getvar_s(&Fields[i]);
1655                         l = strlen(s);
1656                         if (b) {
1657                                 memcpy(b+len, sep, sl);
1658                                 len += sl;
1659                         }
1660                         qrealloc(&b, len+l+sl, &bsize);
1661                         memcpy(b+len, s, l);
1662                         len += l;
1663                 }
1664                 if (b)
1665                         b[len] = '\0';
1666                 setvar_p(intvar[F0], b);
1667                 is_f0_split = TRUE;
1668
1669         } else if (v == intvar[F0]) {
1670                 is_f0_split = FALSE;
1671
1672         } else if (v == intvar[FS]) {
1673                 mk_splitter(getvar_s(v), &fsplitter);
1674
1675         } else if (v == intvar[RS]) {
1676                 mk_splitter(getvar_s(v), &rsplitter);
1677
1678         } else if (v == intvar[IGNORECASE]) {
1679                 icase = istrue(v);
1680
1681         } else {                                /* $n */
1682                 n = getvar_i(intvar[NF]);
1683                 setvar_i(intvar[NF], n > v-Fields ? n : v-Fields+1);
1684                 /* right here v is invalid. Just to note... */
1685         }
1686 }
1687
1688 /* step through func/builtin/etc arguments */
1689 static node *nextarg(node **pn)
1690 {
1691         node *n;
1692
1693         n = *pn;
1694         if (n && (n->info & OPCLSMASK) == OC_COMMA) {
1695                 *pn = n->r.n;
1696                 n = n->l.n;
1697         } else {
1698                 *pn = NULL;
1699         }
1700         return n;
1701 }
1702
1703 static void hashwalk_init(var *v, xhash *array)
1704 {
1705         char **w;
1706         hash_item *hi;
1707         unsigned i;
1708
1709         if (v->type & VF_WALK)
1710                 free(v->x.walker);
1711
1712         v->type |= VF_WALK;
1713         w = v->x.walker = xzalloc(2 + 2*sizeof(char *) + array->glen);
1714         w[0] = w[1] = (char *)(w + 2);
1715         for (i = 0; i < array->csize; i++) {
1716                 hi = array->items[i];
1717                 while (hi) {
1718                         strcpy(*w, hi->name);
1719                         nextword(w);
1720                         hi = hi->next;
1721                 }
1722         }
1723 }
1724
1725 static int hashwalk_next(var *v)
1726 {
1727         char **w;
1728
1729         w = v->x.walker;
1730         if (w[1] == w[0])
1731                 return FALSE;
1732
1733         setvar_s(v, nextword(w+1));
1734         return TRUE;
1735 }
1736
1737 /* evaluate node, return 1 when result is true, 0 otherwise */
1738 static int ptest(node *pattern)
1739 {
1740         /* ptest__v is "static": to save stack space? */
1741         return istrue(evaluate(pattern, &G.ptest__v));
1742 }
1743
1744 /* read next record from stream rsm into a variable v */
1745 static int awk_getline(rstream *rsm, var *v)
1746 {
1747         char *b;
1748         regmatch_t pmatch[2];
1749         int a, p, pp=0, size;
1750         int fd, so, eo, r, rp;
1751         char c, *m, *s;
1752
1753         /* we're using our own buffer since we need access to accumulating
1754          * characters
1755          */
1756         fd = fileno(rsm->F);
1757         m = rsm->buffer;
1758         a = rsm->adv;
1759         p = rsm->pos;
1760         size = rsm->size;
1761         c = (char) rsplitter.n.info;
1762         rp = 0;
1763
1764         if (!m) qrealloc(&m, 256, &size);
1765         do {
1766                 b = m + a;
1767                 so = eo = p;
1768                 r = 1;
1769                 if (p > 0) {
1770                         if ((rsplitter.n.info & OPCLSMASK) == OC_REGEXP) {
1771                                 if (regexec(icase ? rsplitter.n.r.ire : rsplitter.n.l.re,
1772                                                         b, 1, pmatch, 0) == 0) {
1773                                         so = pmatch[0].rm_so;
1774                                         eo = pmatch[0].rm_eo;
1775                                         if (b[eo] != '\0')
1776                                                 break;
1777                                 }
1778                         } else if (c != '\0') {
1779                                 s = strchr(b+pp, c);
1780                                 if (!s) s = memchr(b+pp, '\0', p - pp);
1781                                 if (s) {
1782                                         so = eo = s-b;
1783                                         eo++;
1784                                         break;
1785                                 }
1786                         } else {
1787                                 while (b[rp] == '\n')
1788                                         rp++;
1789                                 s = strstr(b+rp, "\n\n");
1790                                 if (s) {
1791                                         so = eo = s-b;
1792                                         while (b[eo] == '\n') eo++;
1793                                         if (b[eo] != '\0')
1794                                                 break;
1795                                 }
1796                         }
1797                 }
1798
1799                 if (a > 0) {
1800                         memmove(m, (const void *)(m+a), p+1);
1801                         b = m;
1802                         a = 0;
1803                 }
1804
1805                 qrealloc(&m, a+p+128, &size);
1806                 b = m + a;
1807                 pp = p;
1808                 p += safe_read(fd, b+p, size-p-1);
1809                 if (p < pp) {
1810                         p = 0;
1811                         r = 0;
1812                         setvar_i(intvar[ERRNO], errno);
1813                 }
1814                 b[p] = '\0';
1815
1816         } while (p > pp);
1817
1818         if (p == 0) {
1819                 r--;
1820         } else {
1821                 c = b[so]; b[so] = '\0';
1822                 setvar_s(v, b+rp);
1823                 v->type |= VF_USER;
1824                 b[so] = c;
1825                 c = b[eo]; b[eo] = '\0';
1826                 setvar_s(intvar[RT], b+so);
1827                 b[eo] = c;
1828         }
1829
1830         rsm->buffer = m;
1831         rsm->adv = a + eo;
1832         rsm->pos = p - eo;
1833         rsm->size = size;
1834
1835         return r;
1836 }
1837
1838 static int fmt_num(char *b, int size, const char *format, double n, int int_as_int)
1839 {
1840         int r = 0;
1841         char c;
1842         const char *s = format;
1843
1844         if (int_as_int && n == (int)n) {
1845                 r = snprintf(b, size, "%d", (int)n);
1846         } else {
1847                 do { c = *s; } while (c && *++s);
1848                 if (strchr("diouxX", c)) {
1849                         r = snprintf(b, size, format, (int)n);
1850                 } else if (strchr("eEfgG", c)) {
1851                         r = snprintf(b, size, format, n);
1852                 } else {
1853                         syntax_error(EMSG_INV_FMT);
1854                 }
1855         }
1856         return r;
1857 }
1858
1859 /* formatted output into an allocated buffer, return ptr to buffer */
1860 static char *awk_printf(node *n)
1861 {
1862         char *b = NULL;
1863         char *fmt, *s, *f;
1864         const char *s1;
1865         int i, j, incr, bsize;
1866         char c, c1;
1867         var *v, *arg;
1868
1869         v = nvalloc(1);
1870         fmt = f = xstrdup(getvar_s(evaluate(nextarg(&n), v)));
1871
1872         i = 0;
1873         while (*f) {
1874                 s = f;
1875                 while (*f && (*f != '%' || *(++f) == '%'))
1876                         f++;
1877                 while (*f && !isalpha(*f)) {
1878                         if (*f == '*')
1879                                 syntax_error("%*x formats are not supported");
1880                         f++;
1881                 }
1882
1883                 incr = (f - s) + MAXVARFMT;
1884                 qrealloc(&b, incr + i, &bsize);
1885                 c = *f;
1886                 if (c != '\0') f++;
1887                 c1 = *f;
1888                 *f = '\0';
1889                 arg = evaluate(nextarg(&n), v);
1890
1891                 j = i;
1892                 if (c == 'c' || !c) {
1893                         i += sprintf(b+i, s, is_numeric(arg) ?
1894                                         (char)getvar_i(arg) : *getvar_s(arg));
1895                 } else if (c == 's') {
1896                         s1 = getvar_s(arg);
1897                         qrealloc(&b, incr+i+strlen(s1), &bsize);
1898                         i += sprintf(b+i, s, s1);
1899                 } else {
1900                         i += fmt_num(b+i, incr, s, getvar_i(arg), FALSE);
1901                 }
1902                 *f = c1;
1903
1904                 /* if there was an error while sprintf, return value is negative */
1905                 if (i < j) i = j;
1906         }
1907
1908         b = xrealloc(b, i + 1);
1909         free(fmt);
1910         nvfree(v);
1911         b[i] = '\0';
1912         return b;
1913 }
1914
1915 /* common substitution routine
1916  * replace (nm) substring of (src) that match (n) with (repl), store
1917  * result into (dest), return number of substitutions. If nm=0, replace
1918  * all matches. If src or dst is NULL, use $0. If ex=TRUE, enable
1919  * subexpression matching (\1-\9)
1920  */
1921 static int awk_sub(node *rn, const char *repl, int nm, var *src, var *dest, int ex)
1922 {
1923         char *ds = NULL;
1924         const char *s;
1925         const char *sp;
1926         int c, i, j, di, rl, so, eo, nbs, n, dssize;
1927         regmatch_t pmatch[10];
1928         regex_t sreg, *re;
1929
1930         re = as_regex(rn, &sreg);
1931         if (!src) src = intvar[F0];
1932         if (!dest) dest = intvar[F0];
1933
1934         i = di = 0;
1935         sp = getvar_s(src);
1936         rl = strlen(repl);
1937         while (regexec(re, sp, 10, pmatch, sp==getvar_s(src) ? 0 : REG_NOTBOL) == 0) {
1938                 so = pmatch[0].rm_so;
1939                 eo = pmatch[0].rm_eo;
1940
1941                 qrealloc(&ds, di + eo + rl, &dssize);
1942                 memcpy(ds + di, sp, eo);
1943                 di += eo;
1944                 if (++i >= nm) {
1945                         /* replace */
1946                         di -= (eo - so);
1947                         nbs = 0;
1948                         for (s = repl; *s; s++) {
1949                                 ds[di++] = c = *s;
1950                                 if (c == '\\') {
1951                                         nbs++;
1952                                         continue;
1953                                 }
1954                                 if (c == '&' || (ex && c >= '0' && c <= '9')) {
1955                                         di -= ((nbs + 3) >> 1);
1956                                         j = 0;
1957                                         if (c != '&') {
1958                                                 j = c - '0';
1959                                                 nbs++;
1960                                         }
1961                                         if (nbs % 2) {
1962                                                 ds[di++] = c;
1963                                         } else {
1964                                                 n = pmatch[j].rm_eo - pmatch[j].rm_so;
1965                                                 qrealloc(&ds, di + rl + n, &dssize);
1966                                                 memcpy(ds + di, sp + pmatch[j].rm_so, n);
1967                                                 di += n;
1968                                         }
1969                                 }
1970                                 nbs = 0;
1971                         }
1972                 }
1973
1974                 sp += eo;
1975                 if (i == nm) break;
1976                 if (eo == so) {
1977                         ds[di] = *sp++;
1978                         if (!ds[di++]) break;
1979                 }
1980         }
1981
1982         qrealloc(&ds, di + strlen(sp), &dssize);
1983         strcpy(ds + di, sp);
1984         setvar_p(dest, ds);
1985         if (re == &sreg) regfree(re);
1986         return i;
1987 }
1988
1989 static var *exec_builtin(node *op, var *res)
1990 {
1991 #define tspl (G.exec_builtin__tspl)
1992
1993         int (*to_xxx)(int);
1994         var *tv;
1995         node *an[4];
1996         var *av[4];
1997         const char *as[4];
1998         regmatch_t pmatch[2];
1999         regex_t sreg, *re;
2000         node *spl;
2001         uint32_t isr, info;
2002         int nargs;
2003         time_t tt;
2004         char *s, *s1;
2005         int i, l, ll, n;
2006
2007         tv = nvalloc(4);
2008         isr = info = op->info;
2009         op = op->l.n;
2010
2011         av[2] = av[3] = NULL;
2012         for (i = 0; i < 4 && op; i++) {
2013                 an[i] = nextarg(&op);
2014                 if (isr & 0x09000000) av[i] = evaluate(an[i], &tv[i]);
2015                 if (isr & 0x08000000) as[i] = getvar_s(av[i]);
2016                 isr >>= 1;
2017         }
2018
2019         nargs = i;
2020         if ((uint32_t)nargs < (info >> 30))
2021                 syntax_error(EMSG_TOO_FEW_ARGS);
2022
2023         switch (info & OPNMASK) {
2024
2025         case B_a2:
2026 #if ENABLE_FEATURE_AWK_LIBM
2027                 setvar_i(res, atan2(getvar_i(av[0]), getvar_i(av[1])));
2028 #else
2029                 syntax_error(EMSG_NO_MATH);
2030 #endif
2031                 break;
2032
2033         case B_sp:
2034                 if (nargs > 2) {
2035                         spl = (an[2]->info & OPCLSMASK) == OC_REGEXP ?
2036                                 an[2] : mk_splitter(getvar_s(evaluate(an[2], &tv[2])), &tspl);
2037                 } else {
2038                         spl = &fsplitter.n;
2039                 }
2040
2041                 n = awk_split(as[0], spl, &s);
2042                 s1 = s;
2043                 clear_array(iamarray(av[1]));
2044                 for (i = 1; i <= n; i++)
2045                         setari_u(av[1], i, nextword(&s1));
2046                 free(s);
2047                 setvar_i(res, n);
2048                 break;
2049
2050         case B_ss:
2051                 l = strlen(as[0]);
2052                 i = getvar_i(av[1]) - 1;
2053                 if (i > l) i = l;
2054                 if (i < 0) i = 0;
2055                 n = (nargs > 2) ? getvar_i(av[2]) : l-i;
2056                 if (n < 0) n = 0;
2057                 s = xstrndup(as[0]+i, n);
2058                 setvar_p(res, s);
2059                 break;
2060
2061         /* Bitwise ops must assume that operands are unsigned. GNU Awk 3.1.5:
2062          * awk '{ print or(-1,1) }' gives "4.29497e+09", not "-2.xxxe+09" */
2063         case B_an:
2064                 setvar_i(res, getvar_i_int(av[0]) & getvar_i_int(av[1]));
2065                 break;
2066
2067         case B_co:
2068                 setvar_i(res, ~getvar_i_int(av[0]));
2069                 break;
2070
2071         case B_ls:
2072                 setvar_i(res, getvar_i_int(av[0]) << getvar_i_int(av[1]));
2073                 break;
2074
2075         case B_or:
2076                 setvar_i(res, getvar_i_int(av[0]) | getvar_i_int(av[1]));
2077                 break;
2078
2079         case B_rs:
2080                 setvar_i(res, getvar_i_int(av[0]) >> getvar_i_int(av[1]));
2081                 break;
2082
2083         case B_xo:
2084                 setvar_i(res, getvar_i_int(av[0]) ^ getvar_i_int(av[1]));
2085                 break;
2086
2087         case B_lo:
2088                 to_xxx = tolower;
2089                 goto lo_cont;
2090
2091         case B_up:
2092                 to_xxx = toupper;
2093  lo_cont:
2094                 s1 = s = xstrdup(as[0]);
2095                 while (*s1) {
2096                         *s1 = (*to_xxx)(*s1);
2097                         s1++;
2098                 }
2099                 setvar_p(res, s);
2100                 break;
2101
2102         case B_ix:
2103                 n = 0;
2104                 ll = strlen(as[1]);
2105                 l = strlen(as[0]) - ll;
2106                 if (ll > 0 && l >= 0) {
2107                         if (!icase) {
2108                                 s = strstr(as[0], as[1]);
2109                                 if (s) n = (s - as[0]) + 1;
2110                         } else {
2111                                 /* this piece of code is terribly slow and
2112                                  * really should be rewritten
2113                                  */
2114                                 for (i=0; i<=l; i++) {
2115                                         if (strncasecmp(as[0]+i, as[1], ll) == 0) {
2116                                                 n = i+1;
2117                                                 break;
2118                                         }
2119                                 }
2120                         }
2121                 }
2122                 setvar_i(res, n);
2123                 break;
2124
2125         case B_ti:
2126                 if (nargs > 1)
2127                         tt = getvar_i(av[1]);
2128                 else
2129                         time(&tt);
2130                 //s = (nargs > 0) ? as[0] : "%a %b %d %H:%M:%S %Z %Y";
2131                 i = strftime(g_buf, MAXVARFMT,
2132                         ((nargs > 0) ? as[0] : "%a %b %d %H:%M:%S %Z %Y"),
2133                         localtime(&tt));
2134                 g_buf[i] = '\0';
2135                 setvar_s(res, g_buf);
2136                 break;
2137
2138         case B_ma:
2139                 re = as_regex(an[1], &sreg);
2140                 n = regexec(re, as[0], 1, pmatch, 0);
2141                 if (n == 0) {
2142                         pmatch[0].rm_so++;
2143                         pmatch[0].rm_eo++;
2144                 } else {
2145                         pmatch[0].rm_so = 0;
2146                         pmatch[0].rm_eo = -1;
2147                 }
2148                 setvar_i(newvar("RSTART"), pmatch[0].rm_so);
2149                 setvar_i(newvar("RLENGTH"), pmatch[0].rm_eo - pmatch[0].rm_so);
2150                 setvar_i(res, pmatch[0].rm_so);
2151                 if (re == &sreg) regfree(re);
2152                 break;
2153
2154         case B_ge:
2155                 awk_sub(an[0], as[1], getvar_i(av[2]), av[3], res, TRUE);
2156                 break;
2157
2158         case B_gs:
2159                 setvar_i(res, awk_sub(an[0], as[1], 0, av[2], av[2], FALSE));
2160                 break;
2161
2162         case B_su:
2163                 setvar_i(res, awk_sub(an[0], as[1], 1, av[2], av[2], FALSE));
2164                 break;
2165         }
2166
2167         nvfree(tv);
2168         return res;
2169 #undef tspl
2170 }
2171
2172 /*
2173  * Evaluate node - the heart of the program. Supplied with subtree
2174  * and place where to store result. returns ptr to result.
2175  */
2176 #define XC(n) ((n) >> 8)
2177
2178 static var *evaluate(node *op, var *res)
2179 {
2180 /* This procedure is recursive so we should count every byte */
2181 #define fnargs (G.evaluate__fnargs)
2182 /* seed is initialized to 1 */
2183 #define seed   (G.evaluate__seed)
2184 #define sreg   (G.evaluate__sreg)
2185
2186         node *op1;
2187         var *v1;
2188         union {
2189                 var *v;
2190                 const char *s;
2191                 double d;
2192                 int i;
2193         } L, R;
2194         uint32_t opinfo;
2195         int opn;
2196         union {
2197                 char *s;
2198                 rstream *rsm;
2199                 FILE *F;
2200                 var *v;
2201                 regex_t *re;
2202                 uint32_t info;
2203         } X;
2204
2205         if (!op)
2206                 return setvar_s(res, NULL);
2207
2208         v1 = nvalloc(2);
2209
2210         while (op) {
2211                 opinfo = op->info;
2212                 opn = (opinfo & OPNMASK);
2213                 g_lineno = op->lineno;
2214
2215                 /* execute inevitable things */
2216                 op1 = op->l.n;
2217                 if (opinfo & OF_RES1) X.v = L.v = evaluate(op1, v1);
2218                 if (opinfo & OF_RES2) R.v = evaluate(op->r.n, v1+1);
2219                 if (opinfo & OF_STR1) L.s = getvar_s(L.v);
2220                 if (opinfo & OF_STR2) R.s = getvar_s(R.v);
2221                 if (opinfo & OF_NUM1) L.d = getvar_i(L.v);
2222
2223                 switch (XC(opinfo & OPCLSMASK)) {
2224
2225                 /* -- iterative node type -- */
2226
2227                 /* test pattern */
2228                 case XC( OC_TEST ):
2229                         if ((op1->info & OPCLSMASK) == OC_COMMA) {
2230                                 /* it's range pattern */
2231                                 if ((opinfo & OF_CHECKED) || ptest(op1->l.n)) {
2232                                         op->info |= OF_CHECKED;
2233                                         if (ptest(op1->r.n))
2234                                                 op->info &= ~OF_CHECKED;
2235
2236                                         op = op->a.n;
2237                                 } else {
2238                                         op = op->r.n;
2239                                 }
2240                         } else {
2241                                 op = (ptest(op1)) ? op->a.n : op->r.n;
2242                         }
2243                         break;
2244
2245                 /* just evaluate an expression, also used as unconditional jump */
2246                 case XC( OC_EXEC ):
2247                         break;
2248
2249                 /* branch, used in if-else and various loops */
2250                 case XC( OC_BR ):
2251                         op = istrue(L.v) ? op->a.n : op->r.n;
2252                         break;
2253
2254                 /* initialize for-in loop */
2255                 case XC( OC_WALKINIT ):
2256                         hashwalk_init(L.v, iamarray(R.v));
2257                         break;
2258
2259                 /* get next array item */
2260                 case XC( OC_WALKNEXT ):
2261                         op = hashwalk_next(L.v) ? op->a.n : op->r.n;
2262                         break;
2263
2264                 case XC( OC_PRINT ):
2265                 case XC( OC_PRINTF ):
2266                         X.F = stdout;
2267                         if (op->r.n) {
2268                                 X.rsm = newfile(R.s);
2269                                 if (!X.rsm->F) {
2270                                         if (opn == '|') {
2271                                                 X.rsm->F = popen(R.s, "w");
2272                                                 if (X.rsm->F == NULL)
2273                                                         bb_perror_msg_and_die("popen");
2274                                                 X.rsm->is_pipe = 1;
2275                                         } else {
2276                                                 X.rsm->F = xfopen(R.s, opn=='w' ? "w" : "a");
2277                                         }
2278                                 }
2279                                 X.F = X.rsm->F;
2280                         }
2281
2282                         if ((opinfo & OPCLSMASK) == OC_PRINT) {
2283                                 if (!op1) {
2284                                         fputs(getvar_s(intvar[F0]), X.F);
2285                                 } else {
2286                                         while (op1) {
2287                                                 L.v = evaluate(nextarg(&op1), v1);
2288                                                 if (L.v->type & VF_NUMBER) {
2289                                                         fmt_num(g_buf, MAXVARFMT, getvar_s(intvar[OFMT]),
2290                                                                         getvar_i(L.v), TRUE);
2291                                                         fputs(g_buf, X.F);
2292                                                 } else {
2293                                                         fputs(getvar_s(L.v), X.F);
2294                                                 }
2295
2296                                                 if (op1) fputs(getvar_s(intvar[OFS]), X.F);
2297                                         }
2298                                 }
2299                                 fputs(getvar_s(intvar[ORS]), X.F);
2300
2301                         } else {        /* OC_PRINTF */
2302                                 L.s = awk_printf(op1);
2303                                 fputs(L.s, X.F);
2304                                 free((char*)L.s);
2305                         }
2306                         fflush(X.F);
2307                         break;
2308
2309                 case XC( OC_DELETE ):
2310                         X.info = op1->info & OPCLSMASK;
2311                         if (X.info == OC_VAR) {
2312                                 R.v = op1->l.v;
2313                         } else if (X.info == OC_FNARG) {
2314                                 R.v = &fnargs[op1->l.i];
2315                         } else {
2316                                 syntax_error(EMSG_NOT_ARRAY);
2317                         }
2318
2319                         if (op1->r.n) {
2320                                 clrvar(L.v);
2321                                 L.s = getvar_s(evaluate(op1->r.n, v1));
2322                                 hash_remove(iamarray(R.v), L.s);
2323                         } else {
2324                                 clear_array(iamarray(R.v));
2325                         }
2326                         break;
2327
2328                 case XC( OC_NEWSOURCE ):
2329                         g_progname = op->l.s;
2330                         break;
2331
2332                 case XC( OC_RETURN ):
2333                         copyvar(res, L.v);
2334                         break;
2335
2336                 case XC( OC_NEXTFILE ):
2337                         nextfile = TRUE;
2338                 case XC( OC_NEXT ):
2339                         nextrec = TRUE;
2340                 case XC( OC_DONE ):
2341                         clrvar(res);
2342                         break;
2343
2344                 case XC( OC_EXIT ):
2345                         awk_exit(L.d);
2346
2347                 /* -- recursive node type -- */
2348
2349                 case XC( OC_VAR ):
2350                         L.v = op->l.v;
2351                         if (L.v == intvar[NF])
2352                                 split_f0();
2353                         goto v_cont;
2354
2355                 case XC( OC_FNARG ):
2356                         L.v = &fnargs[op->l.i];
2357  v_cont:
2358                         res = op->r.n ? findvar(iamarray(L.v), R.s) : L.v;
2359                         break;
2360
2361                 case XC( OC_IN ):
2362                         setvar_i(res, hash_search(iamarray(R.v), L.s) ? 1 : 0);
2363                         break;
2364
2365                 case XC( OC_REGEXP ):
2366                         op1 = op;
2367                         L.s = getvar_s(intvar[F0]);
2368                         goto re_cont;
2369
2370                 case XC( OC_MATCH ):
2371                         op1 = op->r.n;
2372  re_cont:
2373                         X.re = as_regex(op1, &sreg);
2374                         R.i = regexec(X.re, L.s, 0, NULL, 0);
2375                         if (X.re == &sreg) regfree(X.re);
2376                         setvar_i(res, (R.i == 0 ? 1 : 0) ^ (opn == '!' ? 1 : 0));
2377                         break;
2378
2379                 case XC( OC_MOVE ):
2380                         /* if source is a temporary string, jusk relink it to dest */
2381                         if (R.v == v1+1 && R.v->string) {
2382                                 res = setvar_p(L.v, R.v->string);
2383                                 R.v->string = NULL;
2384                         } else {
2385                                 res = copyvar(L.v, R.v);
2386                         }
2387                         break;
2388
2389                 case XC( OC_TERNARY ):
2390                         if ((op->r.n->info & OPCLSMASK) != OC_COLON)
2391                                 syntax_error(EMSG_POSSIBLE_ERROR);
2392                         res = evaluate(istrue(L.v) ? op->r.n->l.n : op->r.n->r.n, res);
2393                         break;
2394
2395                 case XC( OC_FUNC ):
2396                         if (!op->r.f->body.first)
2397                                 syntax_error(EMSG_UNDEF_FUNC);
2398
2399                         X.v = R.v = nvalloc(op->r.f->nargs+1);
2400                         while (op1) {
2401                                 L.v = evaluate(nextarg(&op1), v1);
2402                                 copyvar(R.v, L.v);
2403                                 R.v->type |= VF_CHILD;
2404                                 R.v->x.parent = L.v;
2405                                 if (++R.v - X.v >= op->r.f->nargs)
2406                                         break;
2407                         }
2408
2409                         R.v = fnargs;
2410                         fnargs = X.v;
2411
2412                         L.s = g_progname;
2413                         res = evaluate(op->r.f->body.first, res);
2414                         g_progname = L.s;
2415
2416                         nvfree(fnargs);
2417                         fnargs = R.v;
2418                         break;
2419
2420                 case XC( OC_GETLINE ):
2421                 case XC( OC_PGETLINE ):
2422                         if (op1) {
2423                                 X.rsm = newfile(L.s);
2424                                 if (!X.rsm->F) {
2425                                         if ((opinfo & OPCLSMASK) == OC_PGETLINE) {
2426                                                 X.rsm->F = popen(L.s, "r");
2427                                                 X.rsm->is_pipe = TRUE;
2428                                         } else {
2429                                                 X.rsm->F = fopen_for_read(L.s);         /* not xfopen! */
2430                                         }
2431                                 }
2432                         } else {
2433                                 if (!iF) iF = next_input_file();
2434                                 X.rsm = iF;
2435                         }
2436
2437                         if (!X.rsm->F) {
2438                                 setvar_i(intvar[ERRNO], errno);
2439                                 setvar_i(res, -1);
2440                                 break;
2441                         }
2442
2443                         if (!op->r.n)
2444                                 R.v = intvar[F0];
2445
2446                         L.i = awk_getline(X.rsm, R.v);
2447                         if (L.i > 0) {
2448                                 if (!op1) {
2449                                         incvar(intvar[FNR]);
2450                                         incvar(intvar[NR]);
2451                                 }
2452                         }
2453                         setvar_i(res, L.i);
2454                         break;
2455
2456                 /* simple builtins */
2457                 case XC( OC_FBLTIN ):
2458                         switch (opn) {
2459
2460                         case F_in:
2461                                 R.d = (int)L.d;
2462                                 break;
2463
2464                         case F_rn:
2465                                 R.d = (double)rand() / (double)RAND_MAX;
2466                                 break;
2467 #if ENABLE_FEATURE_AWK_LIBM
2468                         case F_co:
2469                                 R.d = cos(L.d);
2470                                 break;
2471
2472                         case F_ex:
2473                                 R.d = exp(L.d);
2474                                 break;
2475
2476                         case F_lg:
2477                                 R.d = log(L.d);
2478                                 break;
2479
2480                         case F_si:
2481                                 R.d = sin(L.d);
2482                                 break;
2483
2484                         case F_sq:
2485                                 R.d = sqrt(L.d);
2486                                 break;
2487 #else
2488                         case F_co:
2489                         case F_ex:
2490                         case F_lg:
2491                         case F_si:
2492                         case F_sq:
2493                                 syntax_error(EMSG_NO_MATH);
2494                                 break;
2495 #endif
2496                         case F_sr:
2497                                 R.d = (double)seed;
2498                                 seed = op1 ? (unsigned)L.d : (unsigned)time(NULL);
2499                                 srand(seed);
2500                                 break;
2501
2502                         case F_ti:
2503                                 R.d = time(NULL);
2504                                 break;
2505
2506                         case F_le:
2507                                 if (!op1)
2508                                         L.s = getvar_s(intvar[F0]);
2509                                 R.d = strlen(L.s);
2510                                 break;
2511
2512                         case F_sy:
2513                                 fflush(NULL);
2514                                 R.d = (ENABLE_FEATURE_ALLOW_EXEC && L.s && *L.s)
2515                                                 ? (system(L.s) >> 8) : 0;
2516                                 break;
2517
2518                         case F_ff:
2519                                 if (!op1)
2520                                         fflush(stdout);
2521                                 else {
2522                                         if (L.s && *L.s) {
2523                                                 X.rsm = newfile(L.s);
2524                                                 fflush(X.rsm->F);
2525                                         } else {
2526                                                 fflush(NULL);
2527                                         }
2528                                 }
2529                                 break;
2530
2531                         case F_cl:
2532                                 X.rsm = (rstream *)hash_search(fdhash, L.s);
2533                                 if (X.rsm) {
2534                                         R.i = X.rsm->is_pipe ? pclose(X.rsm->F) : fclose(X.rsm->F);
2535                                         free(X.rsm->buffer);
2536                                         hash_remove(fdhash, L.s);
2537                                 }
2538                                 if (R.i != 0)
2539                                         setvar_i(intvar[ERRNO], errno);
2540                                 R.d = (double)R.i;
2541                                 break;
2542                         }
2543                         setvar_i(res, R.d);
2544                         break;
2545
2546                 case XC( OC_BUILTIN ):
2547                         res = exec_builtin(op, res);
2548                         break;
2549
2550                 case XC( OC_SPRINTF ):
2551                         setvar_p(res, awk_printf(op1));
2552                         break;
2553
2554                 case XC( OC_UNARY ):
2555                         X.v = R.v;
2556                         L.d = R.d = getvar_i(R.v);
2557                         switch (opn) {
2558                         case 'P':
2559                                 L.d = ++R.d;
2560                                 goto r_op_change;
2561                         case 'p':
2562                                 R.d++;
2563                                 goto r_op_change;
2564                         case 'M':
2565                                 L.d = --R.d;
2566                                 goto r_op_change;
2567                         case 'm':
2568                                 R.d--;
2569                                 goto r_op_change;
2570                         case '!':
2571                                 L.d = istrue(X.v) ? 0 : 1;
2572                                 break;
2573                         case '-':
2574                                 L.d = -R.d;
2575                                 break;
2576  r_op_change:
2577                                 setvar_i(X.v, R.d);
2578                         }
2579                         setvar_i(res, L.d);
2580                         break;
2581
2582                 case XC( OC_FIELD ):
2583                         R.i = (int)getvar_i(R.v);
2584                         if (R.i == 0) {
2585                                 res = intvar[F0];
2586                         } else {
2587                                 split_f0();
2588                                 if (R.i > nfields)
2589                                         fsrealloc(R.i);
2590                                 res = &Fields[R.i - 1];
2591                         }
2592                         break;
2593
2594                 /* concatenation (" ") and index joining (",") */
2595                 case XC( OC_CONCAT ):
2596                 case XC( OC_COMMA ):
2597                         opn = strlen(L.s) + strlen(R.s) + 2;
2598                         X.s = xmalloc(opn);
2599                         strcpy(X.s, L.s);
2600                         if ((opinfo & OPCLSMASK) == OC_COMMA) {
2601                                 L.s = getvar_s(intvar[SUBSEP]);
2602                                 X.s = xrealloc(X.s, opn + strlen(L.s));
2603                                 strcat(X.s, L.s);
2604                         }
2605                         strcat(X.s, R.s);
2606                         setvar_p(res, X.s);
2607                         break;
2608
2609                 case XC( OC_LAND ):
2610                         setvar_i(res, istrue(L.v) ? ptest(op->r.n) : 0);
2611                         break;
2612
2613                 case XC( OC_LOR ):
2614                         setvar_i(res, istrue(L.v) ? 1 : ptest(op->r.n));
2615                         break;
2616
2617                 case XC( OC_BINARY ):
2618                 case XC( OC_REPLACE ):
2619                         R.d = getvar_i(R.v);
2620                         switch (opn) {
2621                         case '+':
2622                                 L.d += R.d;
2623                                 break;
2624                         case '-':
2625                                 L.d -= R.d;
2626                                 break;
2627                         case '*':
2628                                 L.d *= R.d;
2629                                 break;
2630                         case '/':
2631                                 if (R.d == 0) syntax_error(EMSG_DIV_BY_ZERO);
2632                                 L.d /= R.d;
2633                                 break;
2634                         case '&':
2635 #if ENABLE_FEATURE_AWK_LIBM
2636                                 L.d = pow(L.d, R.d);
2637 #else
2638                                 syntax_error(EMSG_NO_MATH);
2639 #endif
2640                                 break;
2641                         case '%':
2642                                 if (R.d == 0) syntax_error(EMSG_DIV_BY_ZERO);
2643                                 L.d -= (int)(L.d / R.d) * R.d;
2644                                 break;
2645                         }
2646                         res = setvar_i(((opinfo & OPCLSMASK) == OC_BINARY) ? res : X.v, L.d);
2647                         break;
2648
2649                 case XC( OC_COMPARE ):
2650                         if (is_numeric(L.v) && is_numeric(R.v)) {
2651                                 L.d = getvar_i(L.v) - getvar_i(R.v);
2652                         } else {
2653                                 L.s = getvar_s(L.v);
2654                                 R.s = getvar_s(R.v);
2655                                 L.d = icase ? strcasecmp(L.s, R.s) : strcmp(L.s, R.s);
2656                         }
2657                         switch (opn & 0xfe) {
2658                         case 0:
2659                                 R.i = (L.d > 0);
2660                                 break;
2661                         case 2:
2662                                 R.i = (L.d >= 0);
2663                                 break;
2664                         case 4:
2665                                 R.i = (L.d == 0);
2666                                 break;
2667                         }
2668                         setvar_i(res, (opn & 0x1 ? R.i : !R.i) ? 1 : 0);
2669                         break;
2670
2671                 default:
2672                         syntax_error(EMSG_POSSIBLE_ERROR);
2673                 }
2674                 if ((opinfo & OPCLSMASK) <= SHIFT_TIL_THIS)
2675                         op = op->a.n;
2676                 if ((opinfo & OPCLSMASK) >= RECUR_FROM_THIS)
2677                         break;
2678                 if (nextrec)
2679                         break;
2680         }
2681         nvfree(v1);
2682         return res;
2683 #undef fnargs
2684 #undef seed
2685 #undef sreg
2686 }
2687
2688
2689 /* -------- main & co. -------- */
2690
2691 static int awk_exit(int r)
2692 {
2693         var tv;
2694         unsigned i;
2695         hash_item *hi;
2696
2697         zero_out_var(&tv);
2698
2699         if (!exiting) {
2700                 exiting = TRUE;
2701                 nextrec = FALSE;
2702                 evaluate(endseq.first, &tv);
2703         }
2704
2705         /* waiting for children */
2706         for (i = 0; i < fdhash->csize; i++) {
2707                 hi = fdhash->items[i];
2708                 while (hi) {
2709                         if (hi->data.rs.F && hi->data.rs.is_pipe)
2710                                 pclose(hi->data.rs.F);
2711                         hi = hi->next;
2712                 }
2713         }
2714
2715         exit(r);
2716 }
2717
2718 /* if expr looks like "var=value", perform assignment and return 1,
2719  * otherwise return 0 */
2720 static int is_assignment(const char *expr)
2721 {
2722         char *exprc, *s, *s0, *s1;
2723
2724         exprc = xstrdup(expr);
2725         if (!isalnum_(*exprc) || (s = strchr(exprc, '=')) == NULL) {
2726                 free(exprc);
2727                 return FALSE;
2728         }
2729
2730         *(s++) = '\0';
2731         s0 = s1 = s;
2732         while (*s)
2733                 *(s1++) = nextchar(&s);
2734
2735         *s1 = '\0';
2736         setvar_u(newvar(exprc), s0);
2737         free(exprc);
2738         return TRUE;
2739 }
2740
2741 /* switch to next input file */
2742 static rstream *next_input_file(void)
2743 {
2744 #define rsm          (G.next_input_file__rsm)
2745 #define files_happen (G.next_input_file__files_happen)
2746
2747         FILE *F = NULL;
2748         const char *fname, *ind;
2749
2750         if (rsm.F) fclose(rsm.F);
2751         rsm.F = NULL;
2752         rsm.pos = rsm.adv = 0;
2753
2754         do {
2755                 if (getvar_i(intvar[ARGIND])+1 >= getvar_i(intvar[ARGC])) {
2756                         if (files_happen)
2757                                 return NULL;
2758                         fname = "-";
2759                         F = stdin;
2760                 } else {
2761                         ind = getvar_s(incvar(intvar[ARGIND]));
2762                         fname = getvar_s(findvar(iamarray(intvar[ARGV]), ind));
2763                         if (fname && *fname && !is_assignment(fname))
2764                                 F = xfopen_stdin(fname);
2765                 }
2766         } while (!F);
2767
2768         files_happen = TRUE;
2769         setvar_s(intvar[FILENAME], fname);
2770         rsm.F = F;
2771         return &rsm;
2772 #undef rsm
2773 #undef files_happen
2774 }
2775
2776 int awk_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
2777 int awk_main(int argc, char **argv)
2778 {
2779         unsigned opt;
2780         char *opt_F, *opt_W;
2781         llist_t *list_v = NULL;
2782         llist_t *list_f = NULL;
2783         int i, j;
2784         var *v;
2785         var tv;
2786         char **envp;
2787         char *vnames = (char *)vNames; /* cheat */
2788         char *vvalues = (char *)vValues;
2789
2790         INIT_G();
2791
2792         /* Undo busybox.c, or else strtod may eat ','! This breaks parsing:
2793          * $1,$2 == '$1,' '$2', NOT '$1' ',' '$2' */
2794         if (ENABLE_LOCALE_SUPPORT)
2795                 setlocale(LC_NUMERIC, "C");
2796
2797         zero_out_var(&tv);
2798
2799         /* allocate global buffer */
2800         g_buf = xmalloc(MAXVARFMT + 1);
2801
2802         vhash = hash_init();
2803         ahash = hash_init();
2804         fdhash = hash_init();
2805         fnhash = hash_init();
2806
2807         /* initialize variables */
2808         for (i = 0; *vnames; i++) {
2809                 intvar[i] = v = newvar(nextword(&vnames));
2810                 if (*vvalues != '\377')
2811                         setvar_s(v, nextword(&vvalues));
2812                 else
2813                         setvar_i(v, 0);
2814
2815                 if (*vnames == '*') {
2816                         v->type |= VF_SPECIAL;
2817                         vnames++;
2818                 }
2819         }
2820
2821         handle_special(intvar[FS]);
2822         handle_special(intvar[RS]);
2823
2824         newfile("/dev/stdin")->F = stdin;
2825         newfile("/dev/stdout")->F = stdout;
2826         newfile("/dev/stderr")->F = stderr;
2827
2828         /* Huh, people report that sometimes environ is NULL. Oh well. */
2829         if (environ) for (envp = environ; *envp; envp++) {
2830                 /* environ is writable, thus we don't strdup it needlessly */
2831                 char *s = *envp;
2832                 char *s1 = strchr(s, '=');
2833                 if (s1) {
2834                         *s1 = '\0';
2835                         /* Both findvar and setvar_u take const char*
2836                          * as 2nd arg -> environment is not trashed */
2837                         setvar_u(findvar(iamarray(intvar[ENVIRON]), s), s1 + 1);
2838                         *s1 = '=';
2839                 }
2840         }
2841         opt_complementary = "v::f::"; /* -v and -f can occur multiple times */
2842         opt = getopt32(argv, "F:v:f:W:", &opt_F, &list_v, &list_f, &opt_W);
2843         argv += optind;
2844         argc -= optind;
2845         if (opt & 0x1)
2846                 setvar_s(intvar[FS], opt_F); // -F
2847         while (list_v) { /* -v */
2848                 if (!is_assignment(llist_pop(&list_v)))
2849                         bb_show_usage();
2850         }
2851         if (list_f) { /* -f */
2852                 do {
2853                         char *s = NULL;
2854                         FILE *from_file;
2855
2856                         g_progname = llist_pop(&list_f);
2857                         from_file = xfopen_stdin(g_progname);
2858                         /* one byte is reserved for some trick in next_token */
2859                         for (i = j = 1; j > 0; i += j) {
2860                                 s = xrealloc(s, i + 4096);
2861                                 j = fread(s + i, 1, 4094, from_file);
2862                         }
2863                         s[i] = '\0';
2864                         fclose(from_file);
2865                         parse_program(s + 1);
2866                         free(s);
2867                 } while (list_f);
2868                 argc++;
2869         } else { // no -f: take program from 1st parameter
2870                 if (!argc)
2871                         bb_show_usage();
2872                 g_progname = "cmd. line";
2873                 parse_program(*argv++);
2874         }
2875         if (opt & 0x8) // -W
2876                 bb_error_msg("warning: unrecognized option '-W %s' ignored", opt_W);
2877
2878         /* fill in ARGV array */
2879         setvar_i(intvar[ARGC], argc);
2880         setari_u(intvar[ARGV], 0, "awk");
2881         i = 0;
2882         while (*argv)
2883                 setari_u(intvar[ARGV], ++i, *argv++);
2884
2885         evaluate(beginseq.first, &tv);
2886         if (!mainseq.first && !endseq.first)
2887                 awk_exit(EXIT_SUCCESS);
2888
2889         /* input file could already be opened in BEGIN block */
2890         if (!iF) iF = next_input_file();
2891
2892         /* passing through input files */
2893         while (iF) {
2894                 nextfile = FALSE;
2895                 setvar_i(intvar[FNR], 0);
2896
2897                 while ((i = awk_getline(iF, intvar[F0])) > 0) {
2898                         nextrec = FALSE;
2899                         incvar(intvar[NR]);
2900                         incvar(intvar[FNR]);
2901                         evaluate(mainseq.first, &tv);
2902
2903                         if (nextfile)
2904                                 break;
2905                 }
2906
2907                 if (i < 0)
2908                         syntax_error(strerror(errno));
2909
2910                 iF = next_input_file();
2911         }
2912
2913         awk_exit(EXIT_SUCCESS);
2914         /*return 0;*/
2915 }