*
* Copyright (C) 2002 by Dmitry Zakharov <dmit@crp.bank.gov.ua>
*
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
- *
+ * Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
*/
#include <stdio.h>
double number;
char *string;
union {
- int aidx; /* func arg index (on compilation stage) */
+ int aidx; /* func arg idx (for compilation stage) */
struct xhash_s *array; /* array ptr */
struct var_s *parent; /* for func args, ptr to actual parameter */
char **walker; /* list of array elements (for..in) */
/* Tree node */
typedef struct node_s {
- unsigned long info;
+ uint32_t info;
unsigned short lineno;
union {
struct node_s *n;
"\3END" "\0"
;
-static unsigned long tokeninfo[] = {
+static const uint32_t tokeninfo[] = {
0,
0,
/* hash size may grow to these values */
#define FIRST_PRIME 61;
static const unsigned int PRIMES[] = { 251, 1021, 4093, 16381, 65521 };
-static const unsigned int NPRIMES = sizeof(PRIMES) / sizeof(unsigned int);
+enum { NPRIMES = sizeof(PRIMES) / sizeof(unsigned int) };
/* globals */
static char *programname;
static short lineno;
static int is_f0_split;
-static int nfields = 0;
-static var *Fields = NULL;
+static int nfields;
+static var *Fields;
static tsplitter fsplitter, rsplitter;
-static nvblock *cb = NULL;
+static nvblock *cb;
static char *pos;
static char *buf;
-static int icase = FALSE;
-static int exiting = FALSE;
+static int icase;
+static int exiting;
static struct {
- unsigned long tclass;
- unsigned long info;
+ uint32_t tclass;
+ uint32_t info;
char *string;
double number;
short lineno;
/* function prototypes */
static void handle_special(var *);
-static node *parse_expr(unsigned long);
+static node *parse_expr(uint32_t);
static void chain_group(void);
static var *evaluate(node *, var *);
static rstream *next_input_file(void);
-static int fmt_num(char *, int, char *, double, int);
-static int awk_exit(int);
+static int fmt_num(char *, int, const char *, double, int);
+static int awk_exit(int) ATTRIBUTE_NORETURN;
/* ---- error handling ---- */
static const char EMSG_NO_MATH[] = "Math support is not compiled in";
#endif
+static void syntax_error(const char * const message) ATTRIBUTE_NORETURN;
static void syntax_error(const char * const message)
{
- bb_error_msg("%s:%i: %s", programname, lineno, message);
- exit(1);
+ bb_error_msg_and_die("%s:%i: %s", programname, lineno, message);
}
#define runtime_error(x) syntax_error(x)
/* ---- hash stuff ---- */
-static unsigned int hashidx(char *name)
+static unsigned int hashidx(const char *name)
{
register unsigned int idx=0;
}
/* find item in hash, return ptr to data, NULL if not found */
-static void *hash_search(xhash *hash, char *name)
+static void *hash_search(xhash *hash, const char *name)
{
hash_item *hi;
}
/* find item in hash, add it if necessary. Return ptr to data */
-static void *hash_find(xhash *hash, char *name)
+static void *hash_find(xhash *hash, const char *name)
{
hash_item *hi;
unsigned int idx;
#define newfile(name) (rstream *) hash_find ( fdhash , (name) )
#define newfunc(name) (func *) hash_find ( fnhash , (name) )
-static void hash_remove(xhash *hash, char *name)
+static void hash_remove(xhash *hash, const char *name)
{
hash_item *hi, **phi;
register char *p = *s;
while(*p == ' ' || *p == '\t' ||
- (*p == '\\' && *(p+1) == '\n' && (++p, ++t.lineno))) {
- p++;
+ (*p == '\\' && *(p+1) == '\n' && (++p, ++t.lineno))) {
+ p++;
}
*s = p;
}
}
/* same as setvar_p but make a copy of string */
-static var *setvar_s(var *v, char *value)
+static var *setvar_s(var *v, const char *value)
{
return setvar_p(v, (value && *value) ? bb_xstrdup(value) : NULL);
}
/* same as setvar_s but set USER flag */
-static var *setvar_u(var *v, char *value)
+static var *setvar_u(var *v, const char *value)
{
setvar_s(v, value);
v->type |= VF_USER;
}
/* set array element to user string */
-static void setari_u(var *a, int idx, char *s)
+static void setari_u(var *a, int idx, const char *s)
{
register var *v;
static char sidx[12];
return v->number;
}
-static var *copyvar(var *dest, var *src)
+static var *copyvar(var *dest, const var *src)
{
if (dest != src) {
clrvar(dest);
/* Parse next token pointed by global pos, place results into global t.
* If token isn't expected, give away. Return token class
*/
-static unsigned long next_token(unsigned long expected)
+static uint32_t next_token(uint32_t expected)
{
char *p, *pp, *s;
char *tl;
- unsigned long tc, *ti;
+ uint32_t tc;
+ const uint32_t *ti;
int l;
- static int concat_inserted = FALSE;
- static unsigned long save_tclass, save_info;
- static unsigned long ltclass = TC_OPTERM;
+ static int concat_inserted;
+ static uint32_t save_tclass, save_info;
+ static uint32_t ltclass = TC_OPTERM;
if (t.rollback) {
}
*(p-1) = '\0';
tc = TC_VARIABLE;
+ /* also consume whitespace between functionname and bracket */
+ if (! (expected & TC_VARIABLE)) skip_spaces(&p);
if (*p == '(') {
tc = TC_FUNCTION;
} else {
- skip_spaces(&p);
if (*p == '[') {
p++;
tc = TC_ARRAY;
static void rollback_token(void) { t.rollback = TRUE; }
-static node *new_node(unsigned long info)
+static node *new_node(uint32_t info)
{
register node *n;
/* parse expression terminated by given argument, return ptr
* to built subtree. Terminator is eaten by parse_expr */
-static node *parse_expr(unsigned long iexp)
+static node *parse_expr(uint32_t iexp)
{
node sn;
node *cn = &sn;
node *vn, *glptr;
- unsigned long tc, xtc;
+ uint32_t tc, xtc;
var *v;
sn.info = PRIMASK;
/* for operands and prefix-unary operators, attach them
* to last node */
vn = cn;
- cn = vn->r.n = new_node(t.info);
+ cn = vn->r.n = new_node(t.info);
cn->a.n = vn;
xtc = TC_OPERAND | TC_UOPPRE | TC_REGEXP;
if (tc & (TC_OPERAND | TC_REGEXP)) {
case TC_VARIABLE:
case TC_ARRAY:
cn->info = OC_VAR;
- if ((v = hash_search(ahash, t.string)) != NULL) {
+ if ((v = hash_search(ahash, t.string)) != NULL) {
cn->info = OC_FNARG;
cn->l.i = v->x.aidx;
} else {
- cn->l.v = newvar(t.string);
+ cn->l.v = newvar(t.string);
}
if (tc & TC_ARRAY) {
cn->info |= xS;
cn->r.n = parse_expr(TC_ARRTERM);
}
break;
-
+
case TC_NUMBER:
case TC_STRING:
cn->info = OC_VAR;
break;
case TC_FUNCTION:
- cn->info = OC_FUNC;
+ cn->info = OC_FUNC;
cn->r.f = newfunc(t.string);
cn->l.n = condition();
break;
}
/* add node to chain. Return ptr to alloc'd node */
-static node *chain_node(unsigned long info)
+static node *chain_node(uint32_t info)
{
register node *n;
return n;
}
-static void chain_expr(unsigned long info)
+static void chain_expr(uint32_t info)
{
node *n;
/* parse group and attach it to chain */
static void chain_group(void)
{
- unsigned long c;
+ uint32_t c;
node *n, *n2, *n3;
do {
if (c & TC_GRPSTART) {
while(next_token(TC_GRPSEQ | TC_GRPTERM) != TC_GRPTERM) {
- if (t.tclass & TC_NEWLINE) continue;
+ if (t.tclass & TC_NEWLINE) continue;
rollback_token();
chain_group();
}
static void parse_program(char *p)
{
- unsigned long tclass;
+ uint32_t tclass;
node *cn;
func *f;
var *v;
if (bb_strlen(s) > 1) {
mk_re_node(s, n, re);
} else {
- n->info = (unsigned long) *s;
+ n->info = (uint32_t) *s;
}
return n;
}
} else if (c != '\0') {
s = strchr(b+pp, c);
+ if (! s) s = memchr(b+pp, '\0', p - pp);
if (s) {
so = eo = s-b;
eo++;
return r;
}
-static int fmt_num(char *b, int size, char *format, double n, int int_as_int)
+static int fmt_num(char *b, int size, const char *format, double n, int int_as_int)
{
int r=0;
- char c, *s=format;
+ char c;
+ const char *s=format;
if (int_as_int && n == (int)n) {
r = snprintf(b, size, "%d", (int)n);
regex_t sreg, *re;
static tsplitter tspl;
node *spl;
- unsigned long isr, info;
+ uint32_t isr, info;
int nargs;
time_t tt;
char *s, *s1;
static var *evaluate(node *op, var *res)
{
- /* This procedure is recursive so we should count every byte */
+ /* This procedure is recursive so we should count every byte */
static var *fnargs = NULL;
static unsigned int seed = 1;
static regex_t sreg;
double d;
int i;
} L, R;
- unsigned long opinfo;
+ uint32_t opinfo;
short opn;
union {
char *s;
FILE *F;
var *v;
regex_t *re;
- unsigned long info;
+ uint32_t info;
} X;
if (! op)
opn = (short)(opinfo & OPNMASK);
lineno = op->lineno;
- /* execute inevitable things */
+ /* execute inevitable things */
op1 = op->l.n;
if (opinfo & OF_RES1) X.v = L.v = evaluate(op1, v1);
if (opinfo & OF_RES2) R.v = evaluate(op->r.n, v1+1);
/* just evaluate an expression, also used as unconditional jump */
case XC( OC_EXEC ):
- break;
+ break;
/* branch, used in if-else and various loops */
case XC( OC_BR ):
- op = istrue(L.v) ? op->a.n : op->r.n;
+ op = istrue(L.v) ? op->a.n : op->r.n;
break;
/* initialize for-in loop */
case XC( OC_WALKINIT ):
- hashwalk_init(L.v, iamarray(R.v));
+ hashwalk_init(L.v, iamarray(R.v));
break;
/* get next array item */
case XC( OC_PRINT ):
case XC( OC_PRINTF ):
X.F = stdout;
- if (op->r.n) {
+ if (op->r.n) {
X.rsm = newfile(R.s);
if (! X.rsm->F) {
if (opn == '|') {
}
if ((opinfo & OPCLSMASK) == OC_PRINT) {
- if (! op1) {
+ if (! op1) {
fputs(getvar_s(V[F0]), X.F);
} else {
while (op1) {
break;
case XC( OC_DELETE ):
- X.info = op1->info & OPCLSMASK;
- if (X.info == OC_VAR) {
+ X.info = op1->info & OPCLSMASK;
+ if (X.info == OC_VAR) {
R.v = op1->l.v;
} else if (X.info == OC_FNARG) {
R.v = &fnargs[op1->l.i];
runtime_error(EMSG_NOT_ARRAY);
}
- if (op1->r.n) {
+ if (op1->r.n) {
clrvar(L.v);
L.s = getvar_s(evaluate(op1->r.n, v1));
hash_remove(iamarray(R.v), L.s);
break;
case XC( OC_NEWSOURCE ):
- programname = op->l.s;
+ programname = op->l.s;
break;
case XC( OC_RETURN ):
break;
case XC( OC_NEXTFILE ):
- nextfile = TRUE;
+ nextfile = TRUE;
case XC( OC_NEXT ):
- nextrec = TRUE;
+ nextrec = TRUE;
case XC( OC_DONE ):
clrvar(res);
break;
case XC( OC_EXIT ):
- awk_exit(L.d);
+ awk_exit(L.d);
/* -- recursive node type -- */
case XC( OC_VAR ):
- L.v = op->l.v;
+ L.v = op->l.v;
if (L.v == V[NF])
split_f0();
goto v_cont;
case XC( OC_FNARG ):
- L.v = &fnargs[op->l.i];
+ L.v = &fnargs[op->l.i];
v_cont:
- res = (op->r.n) ? findvar(iamarray(L.v), R.s) : L.v;
+ res = (op->r.n) ? findvar(iamarray(L.v), R.s) : L.v;
break;
case XC( OC_IN ):
break;
case XC( OC_REGEXP ):
- op1 = op;
+ op1 = op;
L.s = getvar_s(V[F0]);
goto re_cont;
case XC( OC_MATCH ):
- op1 = op->r.n;
+ op1 = op->r.n;
re_cont:
X.re = as_regex(op1, &sreg);
R.i = regexec(X.re, L.s, 0, NULL, 0);
break;
case XC( OC_MOVE ):
- /* if source is a temporary string, jusk relink it to dest */
+ /* if source is a temporary string, jusk relink it to dest */
if (R.v == v1+1 && R.v->string) {
res = setvar_p(L.v, R.v->string);
R.v->string = NULL;
} else {
- res = copyvar(L.v, R.v);
+ res = copyvar(L.v, R.v);
}
break;
case XC( OC_TERNARY ):
- if ((op->r.n->info & OPCLSMASK) != OC_COLON)
+ if ((op->r.n->info & OPCLSMASK) != OC_COLON)
runtime_error(EMSG_POSSIBLE_ERROR);
res = evaluate(istrue(L.v) ? op->r.n->l.n : op->r.n->r.n, res);
break;
case XC( OC_FUNC ):
- if (! op->r.f->body.first)
+ if (! op->r.f->body.first)
runtime_error(EMSG_UNDEF_FUNC);
X.v = R.v = nvalloc(op->r.f->nargs+1);
case XC( OC_GETLINE ):
case XC( OC_PGETLINE ):
- if (op1) {
+ if (op1) {
X.rsm = newfile(L.s);
if (! X.rsm->F) {
if ((opinfo & OPCLSMASK) == OC_PGETLINE) {
setvar_i(res, L.i);
break;
- /* simple builtins */
+ /* simple builtins */
case XC( OC_FBLTIN ):
- switch (opn) {
+ switch (opn) {
case F_in:
- R.d = (int)L.d;
+ R.d = (int)L.d;
break;
case F_rn:
- R.d = (double)rand() / (double)RAND_MAX;
+ R.d = (double)rand() / (double)RAND_MAX;
break;
#ifdef CONFIG_FEATURE_AWK_MATH
case F_co:
- R.d = cos(L.d);
+ R.d = cos(L.d);
break;
case F_ex:
- R.d = exp(L.d);
+ R.d = exp(L.d);
break;
case F_lg:
- R.d = log(L.d);
+ R.d = log(L.d);
break;
case F_si:
- R.d = sin(L.d);
+ R.d = sin(L.d);
break;
case F_sq:
- R.d = sqrt(L.d);
+ R.d = sqrt(L.d);
break;
#else
case F_co:
break;
case F_le:
- if (! op1)
+ if (! op1)
L.s = getvar_s(V[F0]);
R.d = bb_strlen(L.s);
break;
case F_sy:
fflush(NULL);
- R.d = (L.s && *L.s) ? system(L.s) : 0;
+ R.d = (L.s && *L.s) ? (system(L.s) >> 8) : 0;
break;
case F_ff:
break;
case XC( OC_SPRINTF ):
- setvar_p(res, awk_printf(op1));
+ setvar_p(res, awk_printf(op1));
break;
case XC( OC_UNARY ):
- X.v = R.v;
- L.d = R.d = getvar_i(R.v);
- switch (opn) {
+ X.v = R.v;
+ L.d = R.d = getvar_i(R.v);
+ switch (opn) {
case 'P':
- L.d = ++R.d;
+ L.d = ++R.d;
goto r_op_change;
case 'p':
- R.d++;
+ R.d++;
goto r_op_change;
case 'M':
- L.d = --R.d;
+ L.d = --R.d;
goto r_op_change;
case 'm':
- R.d--;
+ R.d--;
goto r_op_change;
case '!':
L.d = istrue(X.v) ? 0 : 1;
break;
case '-':
- L.d = -R.d;
+ L.d = -R.d;
break;
r_op_change:
setvar_i(X.v, R.d);
break;
case XC( OC_FIELD ):
- R.i = (int)getvar_i(R.v);
- if (R.i == 0) {
+ R.i = (int)getvar_i(R.v);
+ if (R.i == 0) {
res = V[F0];
} else {
split_f0();
case XC( OC_CONCAT ):
case XC( OC_COMMA ):
opn = bb_strlen(L.s) + bb_strlen(R.s) + 2;
- X.s = (char *)xmalloc(opn);
+ X.s = (char *)xmalloc(opn);
strcpy(X.s, L.s);
if ((opinfo & OPCLSMASK) == OC_COMMA) {
L.s = getvar_s(V[SUBSEP]);
case XC( OC_BINARY ):
case XC( OC_REPLACE ):
- R.d = getvar_i(R.v);
+ R.d = getvar_i(R.v);
switch (opn) {
case '+':
- L.d += R.d;
+ L.d += R.d;
break;
case '-':
- L.d -= R.d;
+ L.d -= R.d;
break;
case '*':
- L.d *= R.d;
+ L.d *= R.d;
break;
case '/':
- if (R.d == 0) runtime_error(EMSG_DIV_BY_ZERO);
- L.d /= R.d;
+ if (R.d == 0) runtime_error(EMSG_DIV_BY_ZERO);
+ L.d /= R.d;
break;
case '&':
#ifdef CONFIG_FEATURE_AWK_MATH
- L.d = pow(L.d, R.d);
+ L.d = pow(L.d, R.d);
#else
runtime_error(EMSG_NO_MATH);
#endif
break;
case '%':
- if (R.d == 0) runtime_error(EMSG_DIV_BY_ZERO);
- L.d -= (int)(L.d / R.d) * R.d;
+ if (R.d == 0) runtime_error(EMSG_DIV_BY_ZERO);
+ L.d -= (int)(L.d / R.d) * R.d;
break;
}
res = setvar_i(((opinfo&OPCLSMASK) == OC_BINARY) ? res : X.v, L.d);
}
switch (opn & 0xfe) {
case 0:
- R.i = (L.d > 0);
+ R.i = (L.d > 0);
break;
case 2:
- R.i = (L.d >= 0);
+ R.i = (L.d >= 0);
break;
case 4:
- R.i = (L.d == 0);
+ R.i = (L.d == 0);
break;
}
setvar_i(res, (opn & 0x1 ? R.i : !R.i) ? 1 : 0);
break;
default:
- runtime_error(EMSG_POSSIBLE_ERROR);
+ runtime_error(EMSG_POSSIBLE_ERROR);
}
if ((opinfo & OPCLSMASK) <= SHIFT_TIL_THIS)
op = op->a.n;
/* if expr looks like "var=value", perform assignment and return 1,
* otherwise return 0 */
-static int is_assignment(char *expr)
+static int is_assignment(const char *expr)
{
char *exprc, *s, *s0, *s1;
return &rsm;
}
-extern int awk_main(int argc, char **argv)
+int awk_main(int argc, char **argv)
{
char *s, *s1;
- int i, j, c;
+ int i, j, c, flen;
var *v;
static var tv;
char **envp;
F = afopen(programname = optarg, "r");
s = NULL;
/* one byte is reserved for some trick in next_token */
- for (i=j=1; j>0; i+=j) {
- s = (char *)xrealloc(s, i+4096);
- j = fread(s+i, 1, 4094, F);
+ if (fseek(F, 0, SEEK_END) == 0) {
+ flen = ftell(F);
+ s = (char *)xmalloc(flen+4);
+ fseek(F, 0, SEEK_SET);
+ i = 1 + fread(s+1, 1, flen, F);
+ } else {
+ for (i=j=1; j>0; i+=j) {
+ s = (char *)xrealloc(s, i+4096);
+ j = fread(s+i, 1, 4094, F);
+ }
}
s[i] = '\0';
fclose(F);
projects / oweals / busybox.git / blobdiff