/* * builtin.c - Builtin functions and various utility procedures */ /* * Copyright (C) 1986, 1988, 1989, 1991-2005 the Free Software Foundation, Inc. * * This file is part of GAWK, the GNU implementation of the * AWK Programming Language. * * GAWK 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. * * GAWK 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */ #include "awk.h" #if defined(HAVE_FCNTL_H) #include #endif #undef CHARBITS #undef INTBITS #if HAVE_INTTYPES_H # include #endif #if HAVE_STDINT_H # include #endif #include #include "random.h" #ifndef CHAR_BIT # define CHAR_BIT 8 #endif /* The extra casts work around common compiler bugs. */ #define TYPE_SIGNED(t) (! ((t) 0 < (t) -1)) /* The outer cast is needed to work around a bug in Cray C 5.0.3.0. It is necessary at least when t == time_t. */ #define TYPE_MINIMUM(t) ((t) (TYPE_SIGNED (t) \ ? ~ (t) 0 << (sizeof (t) * CHAR_BIT - 1) : (t) 0)) #define TYPE_MAXIMUM(t) ((t) (~ (t) 0 - TYPE_MINIMUM (t))) #ifndef INTMAX_MIN # define INTMAX_MIN TYPE_MINIMUM (intmax_t) #endif #ifndef UINTMAX_MAX # define UINTMAX_MAX TYPE_MAXIMUM (uintmax_t) #endif #ifndef SIZE_MAX /* C99 constant, can't rely on it everywhere */ #define SIZE_MAX ((size_t) -1) #endif /* can declare these, since we always use the random shipped with gawk */ extern char *initstate P((unsigned long seed, char *state, long n)); extern char *setstate P((char *state)); extern long random P((void)); extern void srandom P((unsigned long seed)); extern NODE **fields_arr; extern int output_is_tty; static NODE *sub_common P((NODE *tree, long how_many, int backdigs)); /* Assume IEEE-754 arithmetic on pre-C89 hosts. */ #ifndef FLT_RADIX #define FLT_RADIX 2 #endif #ifndef FLT_MANT_DIG #define FLT_MANT_DIG 24 #endif #ifndef DBL_MANT_DIG #define DBL_MANT_DIG 53 #endif #ifdef _CRAY /* Work around a problem in conversion of doubles to exact integers. */ #define Floor(n) floor((n) * (1.0 + DBL_EPSILON)) #define Ceil(n) ceil((n) * (1.0 + DBL_EPSILON)) /* Force the standard C compiler to use the library math functions. */ extern double exp(double); double (*Exp)() = exp; #define exp(x) (*Exp)(x) extern double log(double); double (*Log)() = log; #define log(x) (*Log)(x) #else #define Floor(n) floor(n) #define Ceil(n) ceil(n) #endif #define DEFAULT_G_PRECISION 6 #ifdef GFMT_WORKAROUND /* semi-temporary hack, mostly to gracefully handle VMS */ static void sgfmt P((char *buf, const char *format, int alt, int fwidth, int precision, double value)); #endif /* GFMT_WORKAROUND */ /* * Since we supply the version of random(), we know what * value to use here. */ #define GAWK_RANDOM_MAX 0x7fffffffL static void efwrite P((const void *ptr, size_t size, size_t count, FILE *fp, const char *from, struct redirect *rp, int flush)); /* efwrite --- like fwrite, but with error checking */ static void efwrite(const void *ptr, size_t size, size_t count, FILE *fp, const char *from, struct redirect *rp, int flush) { errno = 0; if (fwrite(ptr, size, count, fp) != count) goto wrerror; if (flush && ((fp == stdout && output_is_tty) || (rp != NULL && (rp->flag & RED_NOBUF)))) { fflush(fp); if (ferror(fp)) goto wrerror; } return; wrerror: fatal(_("%s to \"%s\" failed (%s)"), from, rp ? rp->value : _("standard output"), errno ? strerror(errno) : _("reason unknown")); } /* do_exp --- exponential function */ NODE * do_exp(NODE *tree) { NODE *tmp; double d, res; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("exp: received non-numeric argument")); d = force_number(tmp); free_temp(tmp); errno = 0; res = exp(d); if (errno == ERANGE) warning(_("exp: argument %g is out of range"), d); return tmp_number((AWKNUM) res); } /* stdfile --- return fp for a standard file */ /* * This function allows `fflush("/dev/stdout")' to work. * The other files will be available via getredirect(). * /dev/stdin is not included, since fflush is only for output. */ static FILE * stdfile(const char *name, size_t len) { if (len == 11) { if (STREQN(name, "/dev/stderr", 11)) return stderr; else if (STREQN(name, "/dev/stdout", 11)) return stdout; } return NULL; } /* do_fflush --- flush output, either named file or pipe or everything */ NODE * do_fflush(NODE *tree) { struct redirect *rp; NODE *tmp; FILE *fp; int status = 0; const char *file; /* fflush() --- flush stdout */ if (tree == NULL) { status = fflush(stdout); return tmp_number((AWKNUM) status); } tmp = tree_eval(tree->lnode); tmp = force_string(tmp); file = tmp->stptr; /* fflush("") --- flush all */ if (tmp->stlen == 0) { status = flush_io(); free_temp(tmp); return tmp_number((AWKNUM) status); } rp = getredirect(tmp->stptr, tmp->stlen); status = -1; if (rp != NULL) { if ((rp->flag & (RED_WRITE|RED_APPEND)) == 0) { if (rp->flag & RED_PIPE) warning(_("fflush: cannot flush: pipe `%s' opened for reading, not writing"), file); else warning(_("fflush: cannot flush: file `%s' opened for reading, not writing"), file); free_temp(tmp); return tmp_number((AWKNUM) status); } fp = rp->fp; if (fp != NULL) status = fflush(fp); } else if ((fp = stdfile(tmp->stptr, tmp->stlen)) != NULL) { status = fflush(fp); } else { status = -1; warning(_("fflush: `%s' is not an open file, pipe or co-process"), file); } free_temp(tmp); return tmp_number((AWKNUM) status); } #ifdef MBS_SUPPORT /* strncasecmpmbs --- like strncasecmp(multibyte string version) */ int strncasecmpmbs(const char *s1, mbstate_t mbs1, const char *s2, mbstate_t mbs2, size_t n) { int i1, i2, mbclen1, mbclen2, gap; wchar_t wc1, wc2; for (i1 = i2 = 0 ; i1 < n && i2 < n ;i1 += mbclen1, i2 += mbclen2) { mbclen1 = mbrtowc(&wc1, s1 + i1, n - i1, &mbs1); if (mbclen1 == (size_t) -1 || mbclen1 == (size_t) -2 || mbclen1 == 0) { /* We treat it as a singlebyte character. */ mbclen1 = 1; wc1 = s1[i1]; } mbclen2 = mbrtowc(&wc2, s2 + i2, n - i2, &mbs2); if (mbclen2 == (size_t) -1 || mbclen2 == (size_t) -2 || mbclen2 == 0) { /* We treat it as a singlebyte character. */ mbclen2 = 1; wc2 = s2[i2]; } if ((gap = towlower(wc1) - towlower(wc2)) != 0) /* s1 and s2 are not equivalent. */ return gap; } /* s1 and s2 are equivalent. */ return 0; } /* Inspect the buffer `src' and write the index of each byte to `dest'. Caller must allocate `dest'. e.g. str = , , a, b, , , , c where mb(i) means the `i'-th byte of a multibyte character. dest = 1, 2, 1, 1, 1, 2, 3. 1 */ static void index_multibyte_buffer(char* src, char* dest, int len) { int idx, prev_idx; mbstate_t mbs, prevs; memset(&prevs, 0, sizeof(mbstate_t)); for (idx = prev_idx = 0 ; idx < len ; idx++) { size_t mbclen; mbs = prevs; mbclen = mbrlen(src + prev_idx, idx - prev_idx + 1, &mbs); if (mbclen == (size_t) -1 || mbclen == 1 || mbclen == 0) { /* singlebyte character. */ mbclen = 1; prev_idx = idx + 1; } else if (mbclen == (size_t) -2) { /* a part of a multibyte character. */ mbclen = idx - prev_idx + 1; } else if (mbclen > 1) { /* the end of a multibyte character. */ prev_idx = idx + 1; prevs = mbs; } else { /* Can't reach. */ } dest[idx] = mbclen; } } #else /* a dummy function */ static void index_multibyte_buffer(char* src ATTRIBUTE_UNUSED, char* dest ATTRIBUTE_UNUSED, int len ATTRIBUTE_UNUSED) { cant_happen(); } #endif /* do_index --- find index of a string */ NODE * do_index(NODE *tree) { NODE *s1, *s2; register const char *p1, *p2; register size_t l1, l2; long ret; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (STRING|STRCUR)) == 0) lintwarn(_("index: received non-string first argument")); if ((s2->flags & (STRING|STRCUR)) == 0) lintwarn(_("index: received non-string second argument")); } force_string(s1); force_string(s2); p1 = s1->stptr; p2 = s2->stptr; l1 = s1->stlen; l2 = s2->stlen; ret = 0; /* * Icky special case, index(foo, "") should return 1, * since both bwk awk and mawk do, and since match("foo", "") * returns 1. This makes index("", "") work, too, fwiw. */ if (l2 == 0) { ret = 1; goto out; } /* IGNORECASE will already be false if posix */ if (IGNORECASE) { while (l1 > 0) { if (l2 > l1) break; #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { const wchar_t *pos; s1 = force_wstring(s1); s2 = force_wstring(s2); pos = wcasestrstr(s1->wstptr, s1->wstlen, s2->wstptr, s2->wstlen); if (pos == NULL) ret = 0; else ret = pos - s1->wstptr + 1; /* 1-based */ goto out; } else { #endif /* * Could use tolower(*p1) == tolower(*p2) here. See discussion * in eval.c as to why not. */ if (casetable[(unsigned char)*p1] == casetable[(unsigned char)*p2] && (l2 == 1 || strncasecmp(p1, p2, l2) == 0)) { ret = 1 + s1->stlen - l1; break; } l1--; p1++; #ifdef MBS_SUPPORT } #endif } } else { while (l1 > 0) { if (l2 > l1) break; if (*p1 == *p2 && (l2 == 1 || (l2 > 0 && memcmp(p1, p2, l2) == 0))) { ret = 1 + s1->stlen - l1; break; } #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { const wchar_t *pos; s1 = force_wstring(s1); s2 = force_wstring(s2); pos = wstrstr(s1->wstptr, s1->wstlen, s2->wstptr, s2->wstlen); if (pos == NULL) ret = 0; else ret = pos - s1->wstptr + 1; /* 1-based */ goto out; } else { l1--; p1++; } #else l1--; p1++; #endif } } out: free_temp(s1); free_temp(s2); return tmp_number((AWKNUM) ret); } /* double_to_int --- convert double to int, used several places */ double double_to_int(double d) { if (d >= 0) d = Floor(d); else d = Ceil(d); return d; } /* do_int --- convert double to int for awk */ NODE * do_int(NODE *tree) { NODE *tmp; double d; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("int: received non-numeric argument")); d = force_number(tmp); d = double_to_int(d); free_temp(tmp); return tmp_number((AWKNUM) d); } /* do_length --- length of a string or $0 */ NODE * do_length(NODE *tree) { NODE *tmp; size_t len; if (tree->lnode->type == Node_var_array || tree->lnode->type == Node_array_ref) { NODE *array_var = tree->lnode; if (array_var->type == Node_array_ref) array_var = array_var->orig_array; if (do_lint) lintwarn(_("`length(array)' is a gawk extension")); if (do_posix) goto normal; /* will die as fatal error */ return tmp_number((AWKNUM) array_var->table_size); } else { normal: tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (STRING|STRCUR)) == 0) lintwarn(_("length: received non-string argument")); tmp = force_string(tmp); #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { tmp = force_wstring(tmp); len = tmp->wstlen; } else #endif len = tmp->stlen; free_temp(tmp); return tmp_number((AWKNUM) len); } } /* do_log --- the log function */ NODE * do_log(NODE *tree) { NODE *tmp; double d, arg; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("log: received non-numeric argument")); arg = (double) force_number(tmp); if (arg < 0.0) warning(_("log: received negative argument %g"), arg); d = log(arg); free_temp(tmp); return tmp_number((AWKNUM) d); } /* * format_tree() formats nodes of a tree, starting with a left node, * and accordingly to a fmt_string providing a format like in * printf family from C library. Returns a string node which value * is a formatted string. Called by sprintf function. * * It is one of the uglier parts of gawk. Thanks to Michal Jaegermann * for taming this beast and making it compatible with ANSI C. */ NODE * format_tree( const char *fmt_string, size_t n0, register NODE *carg, long num_args) { /* copy 'l' bytes from 's' to 'obufout' checking for space in the process */ /* difference of pointers should be of ptrdiff_t type, but let us be kind */ #define bchunk(s, l) if (l) { \ while ((l) > ofre) { \ size_t olen = obufout - obuf; \ erealloc(obuf, char *, osiz * 2, "format_tree"); \ ofre += osiz; \ osiz *= 2; \ obufout = obuf + olen; \ } \ memcpy(obufout, s, (size_t) (l)); \ obufout += (l); \ ofre -= (l); \ } /* copy one byte from 's' to 'obufout' checking for space in the process */ #define bchunk_one(s) { \ if (ofre < 1) { \ size_t olen = obufout - obuf; \ erealloc(obuf, char *, osiz * 2, "format_tree"); \ ofre += osiz; \ osiz *= 2; \ obufout = obuf + olen; \ } \ *obufout++ = *s; \ --ofre; \ } /* Is there space for something L big in the buffer? */ #define chksize(l) if ((l) > ofre) { \ size_t olen = obufout - obuf; \ erealloc(obuf, char *, osiz * 2, "format_tree"); \ obufout = obuf + olen; \ ofre += osiz; \ osiz *= 2; \ } static NODE **the_args = 0; static size_t args_size = 0; size_t cur_arg = 0; auto NODE **save_args = 0; auto size_t save_args_size = 0; static int call_level = 0; NODE *r; int i; int toofew = FALSE; char *obuf, *obufout; size_t osiz, ofre; const char *chbuf; const char *s0, *s1; int cs1; NODE *arg; long fw, prec, argnum; int used_dollar; int lj, alt, big, bigbig, small, have_prec, need_format; long *cur = NULL; #ifdef sun386 /* Can't cast unsigned (int/long) from ptr->value */ long tmp_uval; /* on 386i 4.0.1 C compiler -- it just hangs */ #endif uintmax_t uval; int sgn; int base = 0; char cpbuf[30]; /* if we have numbers bigger than 30 */ char *cend = &cpbuf[30];/* chars, we lose, but seems unlikely */ char *cp; const char *fill; AWKNUM tmpval; char signchar = FALSE; size_t len; int zero_flag = FALSE; int quote_flag = FALSE; int ii, jj; static const char sp[] = " "; static const char zero_string[] = "0"; static const char lchbuf[] = "0123456789abcdef"; static const char Uchbuf[] = "0123456789ABCDEF"; #define INITIAL_OUT_SIZE 512 emalloc(obuf, char *, INITIAL_OUT_SIZE, "format_tree"); obufout = obuf; osiz = INITIAL_OUT_SIZE; ofre = osiz - 2; /* * Icky problem. If the args make a nested call to printf/sprintf, * we end up clobbering the static variable `the_args'. Not good. * We don't just malloc and free the_args each time, since most of the * time there aren't nested calls. But if this is a nested call, * save the memory pointed to by the_args and allocate a fresh * array. Then free it on end. */ if (++call_level > 1) { /* nested */ save_args = the_args; save_args_size = args_size; args_size = 0; /* force fresh allocation */ } if (args_size == 0) { /* allocate array */ emalloc(the_args, NODE **, (num_args+1) * sizeof(NODE *), "format_tree"); args_size = num_args + 1; } else if (num_args + 1 > args_size) { /* grow it */ erealloc(the_args, NODE **, (num_args+1) * sizeof(NODE *), "format_tree"); args_size = num_args + 1; } /* fill it in */ /* * We ignore the_args[0] since format strings use * 1-based numbers to indicate the arguments. It's * easiest to just convert to int and index, without * having to remember to subtract 1. */ memset(the_args, '\0', num_args * sizeof(NODE *)); for (i = 1; carg != NULL; i++, carg = carg->rnode) { NODE *tmp; /* Here lies the wumpus's other brother. R.I.P. */ tmp = tree_eval(carg->lnode); the_args[i] = dupnode(tmp); free_temp(tmp); } assert(i == num_args); cur_arg = 1; /* * Check first for use of `count$'. * If plain argument retrieval was used earlier, choke. * Otherwise, return the requested argument. * If not `count$' now, but it was used earlier, choke. * If this format is more than total number of args, choke. * Otherwise, return the current argument. */ #define parse_next_arg() { \ if (argnum > 0) { \ if (cur_arg > 1) \ fatal(_("must use `count$' on all formats or none")); \ arg = the_args[argnum]; \ } else if (used_dollar) { \ fatal(_("must use `count$' on all formats or none")); \ arg = 0; /* shutup the compiler */ \ } else if (cur_arg >= num_args) { \ arg = 0; /* shutup the compiler */ \ toofew = TRUE; \ break; \ } else { \ arg = the_args[cur_arg]; \ cur_arg++; \ } \ } need_format = FALSE; used_dollar = FALSE; s0 = s1 = fmt_string; while (n0-- > 0) { if (*s1 != '%') { s1++; continue; } need_format = TRUE; bchunk(s0, s1 - s0); s0 = s1; cur = &fw; fw = 0; prec = 0; argnum = 0; have_prec = FALSE; signchar = FALSE; zero_flag = FALSE; lj = alt = big = bigbig = small = FALSE; fill = sp; cp = cend; chbuf = lchbuf; s1++; retry: if (n0-- == 0) /* ran out early! */ break; switch (cs1 = *s1++) { case (-1): /* dummy case to allow for checking */ check_pos: if (cur != &fw) break; /* reject as a valid format */ goto retry; case '%': need_format = FALSE; /* * 29 Oct. 2002: * The C99 standard pages 274 and 279 seem to imply that * since there's no arg converted, the field width doesn't * apply. The code already was that way, but this * comment documents it, at least in the code. */ bchunk_one("%"); s0 = s1; break; case '0': /* * Only turn on zero_flag if we haven't seen * the field width or precision yet. Otherwise, * screws up floating point formatting. */ if (cur == & fw) zero_flag = TRUE; if (lj) goto retry; /* FALL through */ case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (cur == NULL) break; if (prec >= 0) *cur = cs1 - '0'; /* * with a negative precision *cur is already set * to -1, so it will remain negative, but we have * to "eat" precision digits in any case */ while (n0 > 0 && *s1 >= '0' && *s1 <= '9') { --n0; *cur = *cur * 10 + *s1++ - '0'; } if (prec < 0) /* negative precision is discarded */ have_prec = FALSE; if (cur == &prec) cur = NULL; if (n0 == 0) /* badly formatted control string */ continue; goto retry; case '$': if (do_traditional) fatal(_("`$' is not permitted in awk formats")); if (cur == &fw) { argnum = fw; fw = 0; used_dollar = TRUE; if (argnum <= 0) fatal(_("arg count with `$' must be > 0")); if (argnum >= num_args) fatal(_("arg count %ld greater than total number of supplied arguments"), argnum); } else fatal(_("`$' not permitted after period in format")); goto retry; case '*': if (cur == NULL) break; if (! do_traditional && ISDIGIT(*s1)) { int val = 0; for (; n0 > 0 && *s1 && ISDIGIT(*s1); s1++, n0--) { val *= 10; val += *s1 - '0'; } if (*s1 != '$') { fatal(_("no `$' supplied for positional field width or precision")); } else { s1++; n0--; } if (val >= num_args) { toofew = TRUE; break; } arg = the_args[val]; } else { parse_next_arg(); } *cur = force_number(arg); if (*cur < 0 && cur == &fw) { *cur = -*cur; lj++; } if (cur == &prec) { if (*cur >= 0) have_prec = TRUE; else have_prec = FALSE; cur = NULL; } goto retry; case ' ': /* print ' ' or '-' */ /* 'space' flag is ignored */ /* if '+' already present */ if (signchar != FALSE) goto check_pos; /* FALL THROUGH */ case '+': /* print '+' or '-' */ signchar = cs1; goto check_pos; case '-': if (prec < 0) break; if (cur == &prec) { prec = -1; goto retry; } fill = sp; /* if left justified then other */ lj++; /* filling is ignored */ goto check_pos; case '.': if (cur != &fw) break; cur = ≺ have_prec = TRUE; goto retry; case '#': alt = TRUE; goto check_pos; #if defined(HAVE_LOCALE_H) case '\'': quote_flag = TRUE; goto check_pos; #endif case 'l': if (big) break; else { static int warned = FALSE; if (do_lint && ! warned) { lintwarn(_("`l' is meaningless in awk formats; ignored")); warned = TRUE; } if (do_posix) fatal(_("`l' is not permitted in POSIX awk formats")); } big = TRUE; goto retry; case 'L': if (bigbig) break; else { static int warned = FALSE; if (do_lint && ! warned) { lintwarn(_("`L' is meaningless in awk formats; ignored")); warned = TRUE; } if (do_posix) fatal(_("`L' is not permitted in POSIX awk formats")); } bigbig = TRUE; goto retry; case 'h': if (small) break; else { static int warned = FALSE; if (do_lint && ! warned) { lintwarn(_("`h' is meaningless in awk formats; ignored")); warned = TRUE; } if (do_posix) fatal(_("`h' is not permitted in POSIX awk formats")); } small = TRUE; goto retry; case 'c': need_format = FALSE; if (zero_flag && ! lj) fill = zero_string; parse_next_arg(); /* user input that looks numeric is numeric */ if ((arg->flags & (MAYBE_NUM|NUMBER)) == MAYBE_NUM) (void) force_number(arg); if (arg->flags & NUMBER) { #ifdef sun386 tmp_uval = arg->numbr; uval = (unsigned long) tmp_uval; #else uval = (uintmax_t) arg->numbr; #endif cpbuf[0] = uval; prec = 1; cp = cpbuf; goto pr_tail; } /* * As per POSIX, only output first character of a * string value. Thus, we ignore any provided * precision, forcing it to 1. (Didn't this * used to work? 6/2003.) */ prec = 1; cp = arg->stptr; goto pr_tail; case 's': need_format = FALSE; if (zero_flag && ! lj) fill = zero_string; parse_next_arg(); arg = force_string(arg); if (! have_prec || prec > arg->stlen) prec = arg->stlen; cp = arg->stptr; goto pr_tail; case 'd': case 'i': need_format = FALSE; parse_next_arg(); tmpval = force_number(arg); /* * ``The result of converting a zero value with a * precision of zero is no characters.'' */ if (have_prec && prec == 0 && tmpval == 0) goto pr_tail; if (tmpval < 0) { if (tmpval < INTMAX_MIN) goto out_of_range; sgn = TRUE; uval = - (uintmax_t) (intmax_t) tmpval; } else { /* Use !, so that NaNs are out of range. */ if (! (tmpval <= UINTMAX_MAX)) goto out_of_range; sgn = FALSE; uval = (uintmax_t) tmpval; } ii = jj = 0; do { *--cp = (char) ('0' + uval % 10); uval /= 10; #if defined(HAVE_LOCALE_H) if (quote_flag && loc.grouping[ii] && ++jj == loc.grouping[ii]) { if (uval) /* only add if more digits coming */ *--cp = loc.thousands_sep[0]; /* XXX - assumption it's one char */ if (loc.grouping[ii+1] == 0) jj = 0; /* keep using current val in loc.grouping[ii] */ else if (loc.grouping[ii+1] == CHAR_MAX) quote_flag = FALSE; else { ii++; jj = 0; } } #endif } while (uval > 0); /* add more output digits to match the precision */ if (have_prec) { while (cend - cp < prec) *--cp = '0'; } if (sgn) *--cp = '-'; else if (signchar) *--cp = signchar; /* * When to fill with zeroes is of course not simple. * First: No zero fill if left-justifying. * Next: There seem to be two cases: * A '0' without a precision, e.g. %06d * A precision with no field width, e.g. %.10d * Any other case, we don't want to fill with zeroes. */ if (! lj && ((zero_flag && ! have_prec) || (fw == 0 && have_prec))) fill = zero_string; if (prec > fw) fw = prec; prec = cend - cp; if (fw > prec && ! lj && fill != sp && (*cp == '-' || signchar)) { bchunk_one(cp); cp++; prec--; fw--; } goto pr_tail; case 'X': chbuf = Uchbuf; /* FALL THROUGH */ case 'x': base += 6; /* FALL THROUGH */ case 'u': base += 2; /* FALL THROUGH */ case 'o': base += 8; need_format = FALSE; parse_next_arg(); tmpval = force_number(arg); /* * ``The result of converting a zero value with a * precision of zero is no characters.'' * * If I remember the ANSI C standard, though, * it says that for octal conversions * the precision is artificially increased * to add an extra 0 if # is supplied. * Indeed, in C, * printf("%#.0o\n", 0); * prints a single 0. */ if (! alt && have_prec && prec == 0 && tmpval == 0) goto pr_tail; if (tmpval < 0) { if (tmpval < INTMAX_MIN) goto out_of_range; uval = (uintmax_t) (intmax_t) tmpval; } else { /* Use !, so that NaNs are out of range. */ if (! (tmpval <= UINTMAX_MAX)) goto out_of_range; uval = (uintmax_t) tmpval; } /* * When to fill with zeroes is of course not simple. * First: No zero fill if left-justifying. * Next: There seem to be two cases: * A '0' without a precision, e.g. %06d * A precision with no field width, e.g. %.10d * Any other case, we don't want to fill with zeroes. */ if (! lj && ((zero_flag && ! have_prec) || (fw == 0 && have_prec))) fill = zero_string; ii = jj = 0; do { *--cp = chbuf[uval % base]; uval /= base; #if defined(HAVE_LOCALE_H) if (base == 10 && quote_flag && loc.grouping[ii] && ++jj == loc.grouping[ii]) { if (uval) /* only add if more digits coming */ *--cp = loc.thousands_sep[0]; /* XXX --- assumption it's one char */ if (loc.grouping[ii+1] == 0) jj = 0; /* keep using current val in loc.grouping[ii] */ else if (loc.grouping[ii+1] == CHAR_MAX) quote_flag = FALSE; else { ii++; jj = 0; } } #endif } while (uval > 0); /* add more output digits to match the precision */ if (have_prec) { while (cend - cp < prec) *--cp = '0'; } if (alt && tmpval != 0) { if (base == 16) { *--cp = cs1; *--cp = '0'; if (fill != sp) { bchunk(cp, 2); cp += 2; fw -= 2; } } else if (base == 8) *--cp = '0'; } base = 0; if (prec > fw) fw = prec; prec = cend - cp; pr_tail: if (! lj) { while (fw > prec) { bchunk_one(fill); fw--; } } bchunk(cp, (int) prec); while (fw > prec) { bchunk_one(fill); fw--; } s0 = s1; break; out_of_range: /* out of range - emergency use of %g format */ if (do_lint) lintwarn(_("[s]printf: value %g is out of range for `%%%c' format"), tmpval, cs1); cs1 = 'g'; goto format_float; case 'F': #if ! defined(PRINTF_HAS_F_FORMAT) || PRINTF_HAS_F_FORMAT != 1 cs1 = 'f'; /* FALL THROUGH */ #endif case 'g': case 'G': case 'e': case 'f': case 'E': need_format = FALSE; parse_next_arg(); tmpval = force_number(arg); format_float: if (! have_prec) prec = DEFAULT_G_PRECISION; chksize(fw + prec + 9); /* 9 == slop */ #ifdef VAXCRTL /* pre-ANSI library doesn't handle '0' flag correctly in many cases; reject it */ if (zero_flag && (lj || (signchar && signchar != '+'))) zero_flag = FALSE; #endif cp = cpbuf; *cp++ = '%'; if (lj) *cp++ = '-'; if (signchar) *cp++ = signchar; if (alt) *cp++ = '#'; if (zero_flag) *cp++ = '0'; if (quote_flag) *cp++ = '\''; strcpy(cp, "*.*"); cp += 3; *cp++ = cs1; *cp = '\0'; #ifndef GFMT_WORKAROUND (void) sprintf(obufout, cpbuf, (int) fw, (int) prec, (double) tmpval); #else /* GFMT_WORKAROUND */ if (cs1 == 'g' || cs1 == 'G') sgfmt(obufout, cpbuf, (int) alt, (int) fw, (int) prec, (double) tmpval); else (void) sprintf(obufout, cpbuf, (int) fw, (int) prec, (double) tmpval); #endif /* GFMT_WORKAROUND */ len = strlen(obufout); ofre -= len; obufout += len; s0 = s1; break; default: break; } if (toofew) fatal("%s\n\t`%s'\n\t%*s%s", _("not enough arguments to satisfy format string"), fmt_string, (int) (s1 - fmt_string - 1), "", _("^ ran out for this one")); } if (do_lint) { if (need_format) lintwarn( _("[s]printf: format specifier does not have control letter")); if (cur_arg < num_args) lintwarn( _("too many arguments supplied for format string")); } bchunk(s0, s1 - s0); r = make_str_node(obuf, obufout - obuf, ALREADY_MALLOCED); r->flags |= TEMP; for (i = 1; i < num_args; i++) { unref(the_args[i]); } if (call_level-- > 1) { free(the_args); the_args = save_args; args_size = save_args_size; } return r; } /* do_sprintf --- perform sprintf */ NODE * do_sprintf(NODE *tree) { NODE *r; NODE *sfmt = force_string(tree_eval(tree->lnode)); r = format_tree(sfmt->stptr, sfmt->stlen, tree->rnode, tree->printf_count); free_temp(sfmt); return r; } /* * redirect_to_fp --- return fp for redirection, NULL on failure * or stdout if no redirection, used by all print routines */ static inline FILE * redirect_to_fp(NODE *tree, struct redirect **rpp) { int errflg; /* not used, sigh */ struct redirect *rp; if (tree == NULL) return stdout; rp = redirect(tree, &errflg); if (rp != NULL) { *rpp = rp; return rp->fp; } return NULL; } /* do_printf --- perform printf, including redirection */ void do_printf(NODE *tree) { struct redirect *rp = NULL; register FILE *fp; if (tree->lnode == NULL) { if (do_traditional) { if (do_lint) lintwarn(_("printf: no arguments")); return; /* bwk accepts it silently */ } fatal(_("printf: no arguments")); } fp = redirect_to_fp(tree->rnode, & rp); if (fp == NULL) return; tree->lnode->printf_count = tree->printf_count; tree = do_sprintf(tree->lnode); efwrite(tree->stptr, sizeof(char), tree->stlen, fp, "printf", rp, TRUE); if (rp != NULL && (rp->flag & RED_TWOWAY) != 0) fflush(rp->fp); free_temp(tree); } /* do_sqrt --- do the sqrt function */ NODE * do_sqrt(NODE *tree) { NODE *tmp; double arg; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("sqrt: received non-numeric argument")); arg = (double) force_number(tmp); free_temp(tmp); if (arg < 0.0) warning(_("sqrt: called with negative argument %g"), arg); return tmp_number((AWKNUM) sqrt(arg)); } /* do_substr --- do the substr function */ NODE * do_substr(NODE *tree) { NODE *t1, *t2, *t3; NODE *r; register size_t indx; size_t length; double d_index, d_length; size_t src_len; t1 = force_string(tree_eval(tree->lnode)); t2 = tree_eval(tree->rnode->lnode); d_index = force_number(t2); free_temp(t2); /* the weird `! (foo)' tests help catch NaN values. */ if (! (d_index >= 1)) { if (do_lint) lintwarn(_("substr: start index %g is invalid, using 1"), d_index); d_index = 1; } if (do_lint && double_to_int(d_index) != d_index) lintwarn(_("substr: non-integer start index %g will be truncated"), d_index); /* awk indices are from 1, C's are from 0 */ if (d_index <= SIZE_MAX) indx = d_index - 1; else indx = SIZE_MAX; if (tree->rnode->rnode == NULL) { /* third arg. missing */ /* use remainder of string */ length = t1->stlen - indx; d_length = length; /* set here in case used in diagnostics, below */ } else { t3 = tree_eval(tree->rnode->rnode->lnode); d_length = force_number(t3); free_temp(t3); if (! (d_length >= 1)) { if (do_lint == LINT_ALL) lintwarn(_("substr: length %g is not >= 1"), d_length); else if (do_lint == LINT_INVALID && ! (d_length >= 0)) lintwarn(_("substr: length %g is not >= 0"), d_length); free_temp(t1); return Nnull_string; } if (do_lint) { if (double_to_int(d_length) != d_length) lintwarn( _("substr: non-integer length %g will be truncated"), d_length); if (d_length > SIZE_MAX) lintwarn( _("substr: length %g too big for string indexing, truncating to %g"), d_length, (double) SIZE_MAX); } if (d_length < SIZE_MAX) length = d_length; else length = SIZE_MAX; } if (t1->stlen == 0) { /* substr("", 1, 0) produces a warning only if LINT_ALL */ if (do_lint && (do_lint == LINT_ALL || ((indx | length) != 0))) lintwarn(_("substr: source string is zero length")); free_temp(t1); return Nnull_string; } /* get total len of input string, for following checks */ #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { t1 = force_wstring(t1); src_len = t1->wstlen; } else #endif src_len = t1->stlen; if (indx >= src_len) { if (do_lint) lintwarn(_("substr: start index %g is past end of string"), d_index); free_temp(t1); return Nnull_string; } if (length > src_len - indx) { if (do_lint) lintwarn( _("substr: length %g at start index %g exceeds length of first argument (%lu)"), d_length, d_index, (unsigned long int) src_len); length = src_len - indx; } #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { /* multibyte case, more work */ size_t result; wchar_t *wp; mbstate_t mbs; char *substr, *cp; /* force_wstring() already called */ if (t1->stlen == t1->wstlen) goto single_byte_case; /* * Convert the wide chars in t1->wstptr back into m.b. chars. * This is pretty grotty, but it's the most straightforward * way to do things. */ memset(& mbs, 0, sizeof(mbs)); emalloc(substr, char *, (length * gawk_mb_cur_max) + 2, "do_substr"); wp = t1->wstptr + indx; for (cp = substr; length > 0; length--) { result = wcrtomb(cp, *wp, & mbs); if (result == (size_t) -1) /* what to do? break seems best */ break; cp += result; wp++; } *cp = '\0'; r = make_str_node(substr, cp - substr, ALREADY_MALLOCED); r->flags |= TEMP; } else { /* single byte case, easy */ single_byte_case: r = tmp_string(t1->stptr + indx, length); } #else r = tmp_string(t1->stptr + indx, length); #endif free_temp(t1); return r; } /* do_strftime --- format a time stamp */ NODE * do_strftime(NODE *tree) { NODE *t1, *t2, *ret; struct tm *tm; time_t fclock; char *bufp; size_t buflen, bufsize; char buf[BUFSIZ]; /* FIXME: One day make %d be %e, after C 99 is common. */ static const char def_format[] = "%a %b %d %H:%M:%S %Z %Y"; const char *format; int formatlen; /* set defaults first */ format = def_format; /* traditional date format */ formatlen = strlen(format); (void) time(&fclock); /* current time of day */ t1 = t2 = NULL; if (tree != NULL) { /* have args */ if (tree->lnode != NULL) { NODE *tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (STRING|STRCUR)) == 0) lintwarn(_("strftime: received non-string first argument")); t1 = force_string(tmp); format = t1->stptr; formatlen = t1->stlen; if (formatlen == 0) { if (do_lint) lintwarn(_("strftime: received empty format string")); free_temp(t1); return tmp_string("", 0); } } if (tree->rnode != NULL) { t2 = tree_eval(tree->rnode->lnode); if (do_lint && (t2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("strftime: received non-numeric second argument")); fclock = (time_t) force_number(t2); free_temp(t2); } } tm = localtime(&fclock); bufp = buf; bufsize = sizeof(buf); for (;;) { *bufp = '\0'; buflen = strftime(bufp, bufsize, format, tm); /* * buflen can be zero EITHER because there's not enough * room in the string, or because the control command * goes to the empty string. Make a reasonable guess that * if the buffer is 1024 times bigger than the length of the * format string, it's not failing for lack of room. * Thanks to Paul Eggert for pointing out this issue. */ if (buflen > 0 || bufsize >= 1024 * formatlen) break; bufsize *= 2; if (bufp == buf) emalloc(bufp, char *, bufsize, "do_strftime"); else erealloc(bufp, char *, bufsize, "do_strftime"); } ret = tmp_string(bufp, buflen); if (bufp != buf) free(bufp); if (t1) free_temp(t1); return ret; } /* do_systime --- get the time of day */ NODE * do_systime(NODE *tree ATTRIBUTE_UNUSED) { time_t lclock; (void) time(&lclock); return tmp_number((AWKNUM) lclock); } /* do_mktime --- turn a time string into a timestamp */ NODE * do_mktime(NODE *tree) { NODE *t1; struct tm then; long year; int month, day, hour, minute, second, count; int dst = -1; /* default is unknown */ time_t then_stamp; char save; t1 = tree_eval(tree->lnode); if (do_lint && (t1->flags & (STRING|STRCUR)) == 0) lintwarn(_("mktime: received non-string argument")); t1 = force_string(t1); save = t1->stptr[t1->stlen]; t1->stptr[t1->stlen] = '\0'; count = sscanf(t1->stptr, "%ld %d %d %d %d %d %d", & year, & month, & day, & hour, & minute, & second, & dst); t1->stptr[t1->stlen] = save; free_temp(t1); if (count < 6 || month < month - 1 || year < year - 1900 || year - 1900 != (int) (year - 1900)) return tmp_number((AWKNUM) -1); memset(& then, '\0', sizeof(then)); then.tm_sec = second; then.tm_min = minute; then.tm_hour = hour; then.tm_mday = day; then.tm_mon = month - 1; then.tm_year = year - 1900; then.tm_isdst = dst; then_stamp = mktime(& then); return tmp_number((AWKNUM) then_stamp); } /* do_system --- run an external command */ NODE * do_system(NODE *tree) { NODE *tmp; int ret = 0; char *cmd; char save; (void) flush_io(); /* so output is synchronous with gawk's */ tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (STRING|STRCUR)) == 0) lintwarn(_("system: received non-string argument")); cmd = force_string(tmp)->stptr; if (cmd && *cmd) { /* insure arg to system is zero-terminated */ /* * From: David Trueman * To: arnold@cc.gatech.edu (Arnold Robbins) * Date: Wed, 3 Nov 1993 12:49:41 -0400 * * It may not be necessary to save the character, but * I'm not sure. It would normally be the field * separator. If the parse has not yet gone beyond * that, it could mess up (although I doubt it). If * FIELDWIDTHS is being used, it might be the first * character of the next field. Unless someone wants * to check it out exhaustively, I suggest saving it * for now... */ save = cmd[tmp->stlen]; cmd[tmp->stlen] = '\0'; os_restore_mode(fileno(stdin)); ret = system(cmd); if (ret != -1) ret = WEXITSTATUS(ret); if ((BINMODE & 1) != 0) os_setbinmode(fileno(stdin), O_BINARY); cmd[tmp->stlen] = save; } free_temp(tmp); return tmp_number((AWKNUM) ret); } extern NODE **fmt_list; /* declared in eval.c */ /* do_print --- print items, separated by OFS, terminated with ORS */ void do_print(register NODE *tree) { register NODE **t; struct redirect *rp = NULL; register FILE *fp; int numnodes, i; NODE *save; NODE *tval; fp = redirect_to_fp(tree->rnode, & rp); if (fp == NULL) return; /* * General idea is to evaluate all the expressions first and * then print them, otherwise you get suprising behavior. * See test/prtoeval.awk for an example program. */ save = tree = tree->lnode; for (numnodes = 0; tree != NULL; tree = tree->rnode) numnodes++; emalloc(t, NODE **, numnodes * sizeof(NODE *), "do_print"); tree = save; for (i = 0; tree != NULL; i++, tree = tree->rnode) { NODE *n; /* Here lies the wumpus. R.I.P. */ n = tree_eval(tree->lnode); t[i] = dupnode(n); free_temp(n); if ((t[i]->flags & (NUMBER|STRING)) == NUMBER) { if (OFMTidx == CONVFMTidx) (void) force_string(t[i]); else { tval = tmp_number(t[i]->numbr); unref(t[i]); t[i] = format_val(OFMT, OFMTidx, tval); } } } for (i = 0; i < numnodes; i++) { efwrite(t[i]->stptr, sizeof(char), t[i]->stlen, fp, "print", rp, FALSE); unref(t[i]); if (i != numnodes - 1 && OFSlen > 0) efwrite(OFS, sizeof(char), (size_t) OFSlen, fp, "print", rp, FALSE); } if (ORSlen > 0) efwrite(ORS, sizeof(char), (size_t) ORSlen, fp, "print", rp, TRUE); if (rp != NULL && (rp->flag & RED_TWOWAY) != 0) fflush(rp->fp); free(t); } /* do_print_rec --- special case printing of $0, for speed */ void do_print_rec(register NODE *tree) { struct redirect *rp = NULL; register FILE *fp; register NODE *f0; fp = redirect_to_fp(tree->rnode, & rp); if (fp == NULL) return; if (! field0_valid) (void) get_field(0L, NULL); /* rebuild record */ f0 = fields_arr[0]; if (do_lint && f0 == Nnull_string) lintwarn(_("reference to uninitialized field `$%d'"), 0); efwrite(f0->stptr, sizeof(char), f0->stlen, fp, "print", rp, FALSE); if (ORSlen > 0) efwrite(ORS, sizeof(char), (size_t) ORSlen, fp, "print", rp, TRUE); if (rp != NULL && (rp->flag & RED_TWOWAY) != 0) fflush(rp->fp); } #ifdef MBS_SUPPORT /* wide_tolower_toupper --- lower- or uppercase a multibute string */ typedef int (*isw_func)(wint_t); typedef wint_t (*tow_func)(wint_t); static NODE * wide_tolower_toupper(NODE *t1, isw_func iswu, tow_func towl) { register unsigned char *cp, *cpe; register unsigned char *cp2; size_t mbclen; mbstate_t mbs, prev_mbs; wchar_t wc; NODE *t2; /* * Since the lowercase char and its uppercase equivalent may occupy * different number of bytes (Turkish `i'), we cannot say the length * of the output string. * This approach is adapted from format_tree(). */ unsigned char *obuf; size_t osiz, ofre; /* * Better 2 spare bytes than 1, consistently with make_str_node(). * And we need gawk_mb_cur_max free bytes before we convert the last * char, so we add (gawk_mb_cur_max - 1). */ osiz = t1->stlen + 2 + (gawk_mb_cur_max - 1); ofre = osiz - 2; emalloc(obuf, char *, osiz, "wide_tolower_toupper"); memset(&mbs, 0, sizeof(mbstate_t)); cp = (unsigned char *)t1->stptr; cpe = (unsigned char *)(t1->stptr + t1->stlen); cp2 = obuf; while (cp < cpe) { if (ofre < gawk_mb_cur_max) { size_t olen = cp2 - obuf; ofre += osiz; osiz *= 2; erealloc(obuf, char *, osiz, "wide_tolower_toupper"); cp2 = obuf + olen; } prev_mbs = mbs; mbclen = (size_t) mbrtowc(&wc, (char *) cp, cpe - cp, &mbs); if (mbclen == 0 || mbclen == (size_t) -1 || mbclen == (size_t) -2) { /* Null wide char, or a problem appeared. */ *cp2++ = *cp++; ofre--; continue; } /* If the character doesn't need change, copy it. */ if (!(*iswu)(wc)) { ofre -= mbclen; while (mbclen--) *cp2++ = *cp++; continue; } /* Increment the input pointer. */ cp += mbclen; /* Write the modified wide character. */ mbclen = wcrtomb((char *) cp2, (*towl)(wc), &prev_mbs); if (mbclen > 0 && mbclen < (size_t) -2) { /* Increment the output pointer. */ cp2 += mbclen; ofre -= mbclen; } else { /* A problem appeared. */ cp2++; ofre--; } } t2 = make_str_node(obuf, cp2 - obuf, ALREADY_MALLOCED); t2->flags |= TEMP; return t2; } #endif /* do_tolower --- lower case a string */ NODE * do_tolower(NODE *tree) { NODE *t1, *t2; t1 = tree_eval(tree->lnode); if (do_lint && (t1->flags & (STRING|STRCUR)) == 0) lintwarn(_("tolower: received non-string argument")); t1 = force_string(t1); #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) t2 = wide_tolower_toupper(t1, iswupper, towlower); else #endif { register unsigned char *cp, *cpe; t2 = tmp_string(t1->stptr, t1->stlen); for (cp = (unsigned char *)t2->stptr, cpe = (unsigned char *)(t2->stptr + t2->stlen); cp < cpe; cp++) if (ISUPPER(*cp)) *cp = TOLOWER(*cp); } free_temp(t1); return t2; } /* do_toupper --- upper case a string */ NODE * do_toupper(NODE *tree) { NODE *t1, *t2; t1 = tree_eval(tree->lnode); if (do_lint && (t1->flags & (STRING|STRCUR)) == 0) lintwarn(_("toupper: received non-string argument")); t1 = force_string(t1); #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) t2 = wide_tolower_toupper(t1, iswlower, towupper); else #endif { register unsigned char *cp, *cpe; t2 = tmp_string(t1->stptr, t1->stlen); for (cp = (unsigned char *)t2->stptr, cpe = (unsigned char *)(t2->stptr + t2->stlen); cp < cpe; cp++) if (ISLOWER(*cp)) *cp = TOUPPER(*cp); } free_temp(t1); return t2; } /* do_atan2 --- do the atan2 function */ NODE * do_atan2(NODE *tree) { NODE *t1, *t2; double d1, d2; t1 = tree_eval(tree->lnode); t2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((t1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("atan2: received non-numeric first argument")); if ((t2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("atan2: received non-numeric second argument")); } d1 = force_number(t1); d2 = force_number(t2); free_temp(t1); free_temp(t2); return tmp_number((AWKNUM) atan2(d1, d2)); } /* do_sin --- do the sin function */ NODE * do_sin(NODE *tree) { NODE *tmp; double d; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("sin: received non-numeric argument")); d = sin((double) force_number(tmp)); free_temp(tmp); return tmp_number((AWKNUM) d); } /* do_cos --- do the cos function */ NODE * do_cos(NODE *tree) { NODE *tmp; double d; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("cos: received non-numeric argument")); d = cos((double) force_number(tmp)); free_temp(tmp); return tmp_number((AWKNUM) d); } /* do_rand --- do the rand function */ static int firstrand = TRUE; static char state[256]; /* ARGSUSED */ NODE * do_rand(NODE *tree ATTRIBUTE_UNUSED) { if (firstrand) { (void) initstate((unsigned) 1, state, sizeof state); /* don't need to srandom(1), initstate() does it for us. */ firstrand = FALSE; setstate(state); } /* * Per historical practice and POSIX, return value N is * * 0 <= n < 1 */ return tmp_number((AWKNUM) (random() % GAWK_RANDOM_MAX) / GAWK_RANDOM_MAX); } /* do_srand --- seed the random number generator */ NODE * do_srand(NODE *tree) { NODE *tmp; static long save_seed = 1; long ret = save_seed; /* SVR4 awk srand returns previous seed */ if (firstrand) { (void) initstate((unsigned) 1, state, sizeof state); /* don't need to srandom(1), we're changing the seed below */ firstrand = FALSE; (void) setstate(state); } if (tree == NULL) srandom((unsigned int) (save_seed = (long) time((time_t *) 0))); else { tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("srand: received non-numeric argument")); srandom((unsigned int) (save_seed = (long) force_number(tmp))); free_temp(tmp); } return tmp_number((AWKNUM) ret); } /* do_match --- match a regexp, set RSTART and RLENGTH, * optional third arg is array filled with text of * subpatterns enclosed in parens and start and len info. */ NODE * do_match(NODE *tree) { NODE *t1, *dest, *it; int rstart, len, ii; int rlength; Regexp *rp; regoff_t s; char *start; char *buf = NULL; char buff[100]; size_t amt, oldamt = 0, ilen, slen; char *subsepstr; size_t subseplen; t1 = force_string(tree_eval(tree->lnode)); tree = tree->rnode; rp = re_update(tree->lnode); dest = NULL; if (tree->rnode != NULL) { /* 3rd optional arg for the subpatterns */ dest = get_param(tree->rnode->lnode); if (dest->type != Node_var_array) fatal(_("match: third argument is not an array")); assoc_clear(dest); } rstart = research(rp, t1->stptr, 0, t1->stlen, RE_NEED_START); if (rstart >= 0) { /* match succeded */ size_t *wc_indices = NULL; rlength = REEND(rp, t1->stptr) - RESTART(rp, t1->stptr); /* byte length */ #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { t1 = str2wstr(t1, & wc_indices); rlength = wc_indices[rstart + rlength - 1] - wc_indices[rstart] + 1; rstart = wc_indices[rstart]; } #endif rstart++; /* now it's 1-based indexing */ /* Build the array only if the caller wants the optional subpatterns */ if (dest != NULL) { subsepstr = SUBSEP_node->var_value->stptr; subseplen = SUBSEP_node->var_value->stlen; for (ii = 0; ii < NUMSUBPATS(rp, t1->stptr); ii++) { /* * Loop over all the subpats; some of them may have * matched even if all of them did not. */ if ((s = SUBPATSTART(rp, t1->stptr, ii)) != -1) { size_t subpat_start; size_t subpat_len; start = t1->stptr + s; subpat_start = s; subpat_len = len = SUBPATEND(rp, t1->stptr, ii) - s; #ifdef MBS_SUPPORT if (gawk_mb_cur_max > 1) { subpat_start = wc_indices[s]; subpat_len = wc_indices[s + len - 1] - subpat_start + 1; } #endif it = make_string(start, len); /* * assoc_lookup() does free_temp() on 2nd arg. */ *assoc_lookup(dest, tmp_number((AWKNUM) (ii)), FALSE) = it; sprintf(buff, "%d", ii); ilen = strlen(buff); amt = ilen + subseplen + strlen("length") + 2; if (oldamt == 0) { emalloc(buf, char *, amt, "do_match"); } else if (amt > oldamt) { erealloc(buf, char *, amt, "do_match"); } oldamt = amt; memcpy(buf, buff, ilen); memcpy(buf + ilen, subsepstr, subseplen); memcpy(buf + ilen + subseplen, "start", 6); slen = ilen + subseplen + 5; it = make_number((AWKNUM) subpat_start + 1); *assoc_lookup(dest, tmp_string(buf, slen), FALSE) = it; memcpy(buf, buff, ilen); memcpy(buf + ilen, subsepstr, subseplen); memcpy(buf + ilen + subseplen, "length", 7); slen = ilen + subseplen + 6; it = make_number((AWKNUM) subpat_len); *assoc_lookup(dest, tmp_string(buf, slen), FALSE) = it; } } free(buf); if (wc_indices != NULL) free(wc_indices); } } else { /* match failed */ rstart = 0; rlength = -1; } free_temp(t1); unref(RSTART_node->var_value); RSTART_node->var_value = make_number((AWKNUM) rstart); unref(RLENGTH_node->var_value); RLENGTH_node->var_value = make_number((AWKNUM) rlength); return tmp_number((AWKNUM) rstart); } /* sub_common --- the common code (does the work) for sub, gsub, and gensub */ /* * Gsub can be tricksy; particularly when handling the case of null strings. * The following awk code was useful in debugging problems. It is too bad * that it does not readily translate directly into the C code, below. * * #! /usr/local/bin/mawk -f * * BEGIN { * TRUE = 1; FALSE = 0 * print "--->", mygsub("abc", "b+", "FOO") * print "--->", mygsub("abc", "x*", "X") * print "--->", mygsub("abc", "b*", "X") * print "--->", mygsub("abc", "c", "X") * print "--->", mygsub("abc", "c+", "X") * print "--->", mygsub("abc", "x*$", "X") * } * * function mygsub(str, regex, replace, origstr, newstr, eosflag, nonzeroflag) * { * origstr = str; * eosflag = nonzeroflag = FALSE * while (match(str, regex)) { * if (RLENGTH > 0) { # easy case * nonzeroflag = TRUE * if (RSTART == 1) { # match at front of string * newstr = newstr replace * } else { * newstr = newstr substr(str, 1, RSTART-1) replace * } * str = substr(str, RSTART+RLENGTH) * } else if (nonzeroflag) { * # last match was non-zero in length, and at the * # current character, we get a zero length match, * # which we don't really want, so skip over it * newstr = newstr substr(str, 1, 1) * str = substr(str, 2) * nonzeroflag = FALSE * } else { * # 0-length match * if (RSTART == 1) { * newstr = newstr replace substr(str, 1, 1) * str = substr(str, 2) * } else { * return newstr str replace * } * } * if (length(str) == 0) * if (eosflag) * break * else * eosflag = TRUE * } * if (length(str) > 0) * newstr = newstr str # rest of string * * return newstr * } */ /* * 1/2004: The gawk sub/gsub behavior dates from 1996, when we proposed it * for POSIX. The proposal fell through the cracks, and the 2001 POSIX * standard chose a more simple behavior. * * The relevant text is to be found on lines 6394-6407 (pages 166, 167) of the * 2001 standard: * * sub(ere, repl[, in ]) * Substitute the string repl in place of the first instance of the extended regular * expression ERE in string in and return the number of substitutions. An ampersand * ('&') appearing in the string repl shall be replaced by the string from in that * matches the ERE. An ampersand preceded with a backslash ('\') shall be * interpreted as the literal ampersand character. An occurrence of two consecutive * backslashes shall be interpreted as just a single literal backslash character. Any * other occurrence of a backslash (for example, preceding any other character) shall * be treated as a literal backslash character. Note that if repl is a string literal (the * lexical token STRING; see Grammar (on page 170)), the handling of the * ampersand character occurs after any lexical processing, including any lexical * backslash escape sequence processing. If in is specified and it is not an lvalue (see * Expressions in awk (on page 156)), the behavior is undefined. If in is omitted, awk * shall use the current record ($0) in its place. * * Because gawk has had its behavior for 7+ years, that behavior is remaining as * the default, with the POSIX behavior available for do_posix. Fun, fun, fun. */ /* * NB: `howmany' conflicts with a SunOS 4.x macro in . */ static NODE * sub_common(NODE *tree, long how_many, int backdigs) { register char *scan; register char *bp, *cp; char *buf; size_t buflen; register char *matchend; register size_t len; char *matchstart; char *text; size_t textlen; char *repl; char *replend; size_t repllen; int sofar; int ampersands; int matches = 0; Regexp *rp; NODE *s; /* subst. pattern */ NODE *t; /* string to make sub. in; $0 if none given */ NODE *tmp; NODE **lhs = &tree; /* value not used -- just different from NULL */ int priv = FALSE; Func_ptr after_assign = NULL; int global = (how_many == -1); long current; int lastmatchnonzero; char *mb_indices = NULL; tmp = tree->lnode; /* regexp */ rp = re_update(tmp); tree = tree->rnode; /* replacement text */ s = tree->lnode; s = force_string(tree_eval(s)); tree = tree->rnode; /* original string */ tmp = tree->lnode; t = force_string(tree_eval(tmp)); /* do the search early to avoid work on non-match */ if (research(rp, t->stptr, 0, t->stlen, RE_NEED_START) == -1 || RESTART(rp, t->stptr) > t->stlen) { free_temp(t); free_temp(s); return tmp_number((AWKNUM) 0.0); } if (tmp->type == Node_val) lhs = NULL; else lhs = get_lhs(tmp, &after_assign, FALSE); t->flags |= STRING; /* * create a private copy of the string */ if (t->stref > 1 || (t->flags & (PERM|FIELD)) != 0) { tmp = copynode(t); t = tmp; priv = TRUE; } text = t->stptr; textlen = t->stlen; buflen = textlen + 2; repl = s->stptr; replend = repl + s->stlen; repllen = replend - repl; emalloc(buf, char *, buflen + 2, "sub_common"); buf[buflen] = '\0'; buf[buflen + 1] = '\0'; ampersands = 0; /* * Some systems' malloc() can't handle being called with an * argument of zero. Thus we have to have some special case * code to check for `repllen == 0'. This can occur for * something like: * sub(/foo/, "", mystring) * for example. */ if (gawk_mb_cur_max > 1 && repllen > 0) { emalloc(mb_indices, char *, repllen * sizeof(char), "sub_common"); index_multibyte_buffer(repl, mb_indices, repllen); } for (scan = repl; scan < replend; scan++) { if ((gawk_mb_cur_max == 1 || (repllen > 0 && mb_indices[scan - repl] == 1)) && (*scan == '&')) { repllen--; ampersands++; } else if (*scan == '\\') { if (backdigs) { /* gensub, behave sanely */ if (ISDIGIT(scan[1])) { ampersands++; scan++; } else { /* \q for any q --> q */ repllen--; scan++; } } else if (do_posix) { /* \& --> &, \\ --> \ */ if (scan[1] == '&' || scan[1] == '\\') { repllen--; scan++; } /* else leave alone, it goes into the output */ } else { /* gawk default behavior since 1996 */ if (strncmp(scan, "\\\\\\&", 4) == 0) { /* \\\& --> \& */ repllen -= 2; scan += 3; } else if (strncmp(scan, "\\\\&", 3) == 0) { /* \\& --> \ */ ampersands++; repllen--; scan += 2; } else if (scan[1] == '&') { /* \& --> & */ repllen--; scan++; } /* else leave alone, it goes into the output */ } } } lastmatchnonzero = FALSE; bp = buf; for (current = 1;; current++) { matches++; matchstart = t->stptr + RESTART(rp, t->stptr); matchend = t->stptr + REEND(rp, t->stptr); /* * create the result, copying in parts of the original * string */ len = matchstart - text + repllen + ampersands * (matchend - matchstart); sofar = bp - buf; while (buflen < (sofar + len + 1)) { buflen *= 2; erealloc(buf, char *, buflen, "sub_common"); bp = buf + sofar; } for (scan = text; scan < matchstart; scan++) *bp++ = *scan; if (global || current == how_many) { /* * If the current match matched the null string, * and the last match didn't and did a replacement, * and the match of the null string is at the front of * the text (meaning right after end of the previous * replacement), then skip this one. */ if (matchstart == matchend && lastmatchnonzero && matchstart == text) { lastmatchnonzero = FALSE; matches--; goto empty; } /* * If replacing all occurrences, or this is the * match we want, copy in the replacement text, * making substitutions as we go. */ for (scan = repl; scan < replend; scan++) if (*scan == '&' /* * Don't test repllen here. A simple "&" could * end up with repllen == 0. */ && (gawk_mb_cur_max == 1 || mb_indices[scan - repl] == 1) ) { for (cp = matchstart; cp < matchend; cp++) *bp++ = *cp; } else if (*scan == '\\' && (gawk_mb_cur_max == 1 || (repllen > 0 && mb_indices[scan - repl] == 1)) ) { if (backdigs) { /* gensub, behave sanely */ if (ISDIGIT(scan[1])) { int dig = scan[1] - '0'; char *start, *end; start = t->stptr + SUBPATSTART(rp, t->stptr, dig); end = t->stptr + SUBPATEND(rp, t->stptr, dig); for (cp = start; cp < end; cp++) *bp++ = *cp; scan++; } else /* \q for any q --> q */ *bp++ = *++scan; } else if (do_posix) { /* \& --> &, \\ --> \ */ if (scan[1] == '&' || scan[1] == '\\') scan++; *bp++ = *scan; } else { /* gawk default behavior since 1996 */ if (strncmp(scan, "\\\\\\&", 4) == 0) { /* \\\& --> \& */ *bp++ = '\\'; *bp++ = '&'; scan += 3; } else if (strncmp(scan, "\\\\&", 3) == 0) { /* \\& --> \ */ *bp++ = '\\'; for (cp = matchstart; cp < matchend; cp++) *bp++ = *cp; scan += 2; } else if (scan[1] == '&') { /* \& --> & */ *bp++ = '&'; scan++; } else *bp++ = *scan; } } else *bp++ = *scan; if (matchstart != matchend) lastmatchnonzero = TRUE; } else { /* * don't want this match, skip over it by copying * in current text. */ for (cp = matchstart; cp < matchend; cp++) *bp++ = *cp; } empty: /* catch the case of gsub(//, "blah", whatever), i.e. empty regexp */ if (matchstart == matchend && matchend < text + textlen) { *bp++ = *matchend; matchend++; } textlen = text + textlen - matchend; text = matchend; if ((current >= how_many && !global) || ((long) textlen <= 0 && matchstart == matchend) || research(rp, t->stptr, text - t->stptr, textlen, RE_NEED_START) == -1) break; } sofar = bp - buf; if (buflen - sofar - textlen - 1) { buflen = sofar + textlen + 2; erealloc(buf, char *, buflen, "sub_common"); bp = buf + sofar; } for (scan = matchend; scan < text + textlen; scan++) *bp++ = *scan; *bp = '\0'; textlen = bp - buf; free(t->stptr); t->stptr = buf; t->stlen = textlen; free_temp(s); if (matches > 0 && lhs) { if (priv) { unref(*lhs); *lhs = t; } if (after_assign != NULL) (*after_assign)(); t->flags &= ~(NUMCUR|NUMBER); } if (mb_indices != NULL) free(mb_indices); return tmp_number((AWKNUM) matches); } /* do_gsub --- global substitution */ NODE * do_gsub(NODE *tree) { return sub_common(tree, -1, FALSE); } /* do_sub --- single substitution */ NODE * do_sub(NODE *tree) { return sub_common(tree, 1, FALSE); } /* do_gensub --- fix up the tree for sub_common for the gensub function */ NODE * do_gensub(NODE *tree) { NODE n1, n2, n3, *t, *tmp, *target, *ret; long how_many = 1; /* default is one substitution */ double d; /* * We have to pull out the value of the global flag, and * build up a tree without the flag in it, turning it into the * kind of tree that sub_common() expects. It helps to draw * a picture of this ... */ n1 = *tree; n2 = *(tree->rnode); n1.rnode = & n2; t = tree_eval(n2.rnode->lnode); /* value of global flag */ tmp = force_string(tree_eval(n2.rnode->rnode->lnode)); /* target */ /* * We make copy of the original target string, and pass that * in to sub_common() as the target to make the substitution in. * We will then return the result string as the return value of * this function. */ target = make_string(tmp->stptr, tmp->stlen); free_temp(tmp); n3 = *(n2.rnode->rnode); n3.lnode = target; n2.rnode = & n3; if ((t->flags & (STRCUR|STRING)) != 0) { if (t->stlen > 0 && (t->stptr[0] == 'g' || t->stptr[0] == 'G')) how_many = -1; else { d = force_number(t); if ((t->flags & NUMCUR) != 0) goto set_how_many; how_many = 1; } } else { d = force_number(t); set_how_many: if (d < 1) how_many = 1; else if (d < LONG_MAX) how_many = d; else how_many = LONG_MAX; if (d == 0) warning(_("gensub: third argument of 0 treated as 1")); } free_temp(t); ret = sub_common(&n1, how_many, TRUE); free_temp(ret); /* * Note that we don't care what sub_common() returns, since the * easiest thing for the programmer is to return the string, even * if no substitutions were done. */ target->flags |= TEMP; return target; } #ifdef GFMT_WORKAROUND /* * printf's %g format [can't rely on gcvt()] * caveat: don't use as argument to *printf()! * 'format' string HAS to be of "*.*g" kind, or we bomb! */ static void sgfmt(char *buf, /* return buffer; assumed big enough to hold result */ const char *format, int alt, /* use alternate form flag */ int fwidth, /* field width in a format */ int prec, /* indicates desired significant digits, not decimal places */ double g) /* value to format */ { char dform[40]; register char *gpos; register char *d, *e, *p; int again = FALSE; strncpy(dform, format, sizeof dform - 1); dform[sizeof dform - 1] = '\0'; gpos = strrchr(dform, '.'); if (g == 0.0 && ! alt) { /* easy special case */ *gpos++ = 'd'; *gpos = '\0'; (void) sprintf(buf, dform, fwidth, 0); return; } /* advance to location of 'g' in the format */ while (*gpos && *gpos != 'g' && *gpos != 'G') gpos++; if (prec <= 0) /* negative precision is ignored */ prec = (prec < 0 ? DEFAULT_G_PRECISION : 1); if (*gpos == 'G') again = TRUE; /* start with 'e' format (it'll provide nice exponent) */ *gpos = 'e'; prec--; (void) sprintf(buf, dform, fwidth, prec, g); if ((e = strrchr(buf, 'e')) != NULL) { /* find exponent */ int expn = atoi(e+1); /* fetch exponent */ if (expn >= -4 && expn <= prec) { /* per K&R2, B1.2 */ /* switch to 'f' format and re-do */ *gpos = 'f'; prec -= expn; /* decimal precision */ (void) sprintf(buf, dform, fwidth, prec, g); e = buf + strlen(buf); while (*--e == ' ') continue; e++; } else if (again) *gpos = 'E'; /* if 'alt' in force, then trailing zeros are not removed */ if (! alt && (d = strrchr(buf, '.')) != NULL) { /* throw away an excess of precision */ for (p = e; p > d && *--p == '0'; ) prec--; if (d == p) prec--; if (prec < 0) prec = 0; /* and do that once again */ again = TRUE; } if (again) (void) sprintf(buf, dform, fwidth, prec, g); } } #endif /* GFMT_WORKAROUND */ /* * The number of base-FLT_RADIX digits in an AWKNUM fraction, assuming * that AWKNUM is not long double. */ #define AWKSMALL_MANT_DIG \ (sizeof (AWKNUM) == sizeof (double) ? DBL_MANT_DIG : FLT_MANT_DIG) /* * The number of base-FLT_DIGIT digits in an AWKNUM fraction, even if * AWKNUM is long double. Don't mention 'long double' unless * LDBL_MANT_DIG is defined, for the sake of ancient compilers that * lack 'long double'. */ #ifdef LDBL_MANT_DIG #define AWKNUM_MANT_DIG \ (sizeof (AWKNUM) == sizeof (long double) ? LDBL_MANT_DIG : AWKSMALL_MANT_DIG) #else #define AWKNUM_MANT_DIG AWKSMALL_MANT_DIG #endif /* * The number of bits in an AWKNUM fraction, assuming FLT_RADIX is * either 2 or 16. IEEE and VAX formats use radix 2, and IBM * mainframe format uses radix 16; we know of no other radices in * practical use. */ #if FLT_RADIX != 2 && FLT_RADIX != 16 Please port the following code to your weird host; #endif #define AWKNUM_FRACTION_BITS (AWKNUM_MANT_DIG * (FLT_RADIX == 2 ? 1 : 4)) /* tmp_integer - Convert an integer to a temporary number node. */ static NODE * tmp_integer(uintmax_t n) { #ifdef HAVE_UINTMAX_T /* #ifndef LDBL_MANT_DIG */ /* * If uintmax_t is so wide that AWKNUM cannot represent all its * values, strip leading nonzero bits of integers that are so large * that they cannot be represented exactly as AWKNUMs, so that their * low order bits are represented exactly, without rounding errors. * This is more desirable in practice, since it means the user sees * integers that are the same width as the AWKNUM fractions. */ if (AWKNUM_FRACTION_BITS < CHAR_BIT * sizeof n) n &= ((uintmax_t) 1 << AWKNUM_FRACTION_BITS) - 1; /* #endif */ /* LDBL_MANT_DIG */ #endif /* HAVE_UINTMAX_T */ return tmp_number((AWKNUM) n); } /* do_lshift --- perform a << operation */ NODE * do_lshift(NODE *tree) { NODE *s1, *s2; uintmax_t uval, ushift, res; AWKNUM val, shift; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("lshift: received non-numeric first argument")); if ((s2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("lshift: received non-numeric second argument")); } val = force_number(s1); shift = force_number(s2); if (do_lint) { if (val < 0 || shift < 0) lintwarn(_("lshift(%lf, %lf): negative values will give strange results"), val, shift); if (double_to_int(val) != val || double_to_int(shift) != shift) lintwarn(_("lshift(%lf, %lf): fractional values will be truncated"), val, shift); if (shift >= sizeof(uintmax_t) * CHAR_BIT) lintwarn(_("lshift(%lf, %lf): too large shift value will give strange results"), val, shift); } free_temp(s1); free_temp(s2); uval = (uintmax_t) val; ushift = (uintmax_t) shift; res = uval << ushift; return tmp_integer(res); } /* do_rshift --- perform a >> operation */ NODE * do_rshift(NODE *tree) { NODE *s1, *s2; uintmax_t uval, ushift, res; AWKNUM val, shift; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("rshift: received non-numeric first argument")); if ((s2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("rshift: received non-numeric second argument")); } val = force_number(s1); shift = force_number(s2); if (do_lint) { if (val < 0 || shift < 0) lintwarn(_("rshift(%lf, %lf): negative values will give strange results"), val, shift); if (double_to_int(val) != val || double_to_int(shift) != shift) lintwarn(_("rshift(%lf, %lf): fractional values will be truncated"), val, shift); if (shift >= sizeof(uintmax_t) * CHAR_BIT) lintwarn(_("rshift(%lf, %lf): too large shift value will give strange results"), val, shift); } free_temp(s1); free_temp(s2); uval = (uintmax_t) val; ushift = (uintmax_t) shift; res = uval >> ushift; return tmp_integer(res); } /* do_and --- perform an & operation */ NODE * do_and(NODE *tree) { NODE *s1, *s2; uintmax_t uleft, uright, res; AWKNUM left, right; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("and: received non-numeric first argument")); if ((s2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("and: received non-numeric second argument")); } left = force_number(s1); right = force_number(s2); if (do_lint) { if (left < 0 || right < 0) lintwarn(_("and(%lf, %lf): negative values will give strange results"), left, right); if (double_to_int(left) != left || double_to_int(right) != right) lintwarn(_("and(%lf, %lf): fractional values will be truncated"), left, right); } free_temp(s1); free_temp(s2); uleft = (uintmax_t) left; uright = (uintmax_t) right; res = uleft & uright; return tmp_integer(res); } /* do_or --- perform an | operation */ NODE * do_or(NODE *tree) { NODE *s1, *s2; uintmax_t uleft, uright, res; AWKNUM left, right; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("or: received non-numeric first argument")); if ((s2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("or: received non-numeric second argument")); } left = force_number(s1); right = force_number(s2); if (do_lint) { if (left < 0 || right < 0) lintwarn(_("or(%lf, %lf): negative values will give strange results"), left, right); if (double_to_int(left) != left || double_to_int(right) != right) lintwarn(_("or(%lf, %lf): fractional values will be truncated"), left, right); } free_temp(s1); free_temp(s2); uleft = (uintmax_t) left; uright = (uintmax_t) right; res = uleft | uright; return tmp_integer(res); } /* do_xor --- perform an ^ operation */ NODE * do_xor(NODE *tree) { NODE *s1, *s2; uintmax_t uleft, uright, res; AWKNUM left, right; s1 = tree_eval(tree->lnode); s2 = tree_eval(tree->rnode->lnode); if (do_lint) { if ((s1->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("xor: received non-numeric first argument")); if ((s2->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("xor: received non-numeric second argument")); } left = force_number(s1); right = force_number(s2); if (do_lint) { if (left < 0 || right < 0) lintwarn(_("xor(%lf, %lf): negative values will give strange results"), left, right); if (double_to_int(left) != left || double_to_int(right) != right) lintwarn(_("xor(%lf, %lf): fractional values will be truncated"), left, right); } free_temp(s1); free_temp(s2); uleft = (uintmax_t) left; uright = (uintmax_t) right; res = uleft ^ uright; return tmp_integer(res); } /* do_compl --- perform a ~ operation */ NODE * do_compl(NODE *tree) { NODE *tmp; double d; uintmax_t uval; tmp = tree_eval(tree->lnode); if (do_lint && (tmp->flags & (NUMCUR|NUMBER)) == 0) lintwarn(_("compl: received non-numeric argument")); d = force_number(tmp); free_temp(tmp); if (do_lint) { if (d < 0) lintwarn(_("compl(%lf): negative value will give strange results"), d); if (double_to_int(d) != d) lintwarn(_("compl(%lf): fractional value will be truncated"), d); } uval = (uintmax_t) d; uval = ~ uval; return tmp_integer(uval); } /* do_strtonum --- the strtonum function */ NODE * do_strtonum(NODE *tree) { NODE *tmp; AWKNUM d; tmp = tree_eval(tree->lnode); if ((tmp->flags & (NUMBER|NUMCUR)) != 0) d = (AWKNUM) force_number(tmp); else if (isnondecimal(tmp->stptr, TRUE)) d = nondec2awknum(tmp->stptr, tmp->stlen); else d = (AWKNUM) force_number(tmp); free_temp(tmp); return tmp_number((AWKNUM) d); } /* nondec2awknum --- convert octal or hex value to double */ /* * Because of awk's concatenation rules and the way awk.y:yylex() * collects a number, this routine has to be willing to stop on the * first invalid character. */ AWKNUM nondec2awknum(char *str, size_t len) { AWKNUM retval = 0.0; char save; short val; char *start = str; if (*str == '0' && (str[1] == 'x' || str[1] == 'X')) { /* * User called strtonum("0x") or some such, * so just quit early. */ if (len <= 2) return (AWKNUM) 0.0; for (str += 2, len -= 2; len > 0; len--, str++) { switch (*str) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': val = *str - '0'; break; case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': val = *str - 'a' + 10; break; case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': val = *str - 'A' + 10; break; default: goto done; } retval = (retval * 16) + val; } } else if (*str == '0') { for (; len > 0; len--) { if (! ISDIGIT(*str)) goto done; else if (*str == '8' || *str == '9') { str = start; goto decimal; } retval = (retval * 8) + (*str - '0'); str++; } } else { decimal: save = str[len]; retval = strtod(str, NULL); str[len] = save; } done: return retval; } /* do_dcgettext, do_dcngettext --- handle i18n translations */ #if ENABLE_NLS && HAVE_LC_MESSAGES && HAVE_DCGETTEXT static int localecategory_from_argument(NODE *tree) { static const struct category_table { int val; const char *name; } cat_tab[] = { #ifdef LC_ALL { LC_ALL, "LC_ALL" }, #endif /* LC_ALL */ #ifdef LC_COLLATE { LC_COLLATE, "LC_COLLATE" }, #endif /* LC_COLLATE */ #ifdef LC_CTYPE { LC_CTYPE, "LC_CTYPE" }, #endif /* LC_CTYPE */ #ifdef LC_MESSAGES { LC_MESSAGES, "LC_MESSAGES" }, #endif /* LC_MESSAGES */ #ifdef LC_MONETARY { LC_MONETARY, "LC_MONETARY" }, #endif /* LC_MONETARY */ #ifdef LC_NUMERIC { LC_NUMERIC, "LC_NUMERIC" }, #endif /* LC_NUMERIC */ #ifdef LC_RESPONSE { LC_RESPONSE, "LC_RESPONSE" }, #endif /* LC_RESPONSE */ #ifdef LC_TIME { LC_TIME, "LC_TIME" }, #endif /* LC_TIME */ }; if (tree != NULL) { int low, high, i, mid; NODE *tmp, *t; char *category; int lc_cat = -1; tmp = tree->lnode; t = force_string(tree_eval(tmp)); category = t->stptr; /* binary search the table */ low = 0; high = (sizeof(cat_tab) / sizeof(cat_tab[0])) - 1; while (low <= high) { mid = (low + high) / 2; i = strcmp(category, cat_tab[mid].name); if (i < 0) /* category < mid */ high = mid - 1; else if (i > 0) /* category > mid */ low = mid + 1; else { lc_cat = cat_tab[mid].val; break; } } if (lc_cat == -1) /* not there */ fatal(_("dcgettext: `%s' is not a valid locale category"), category); free_temp(t); return lc_cat; } else return LC_MESSAGES; } #endif /* * awk usage is * * str = dcgettext(string [, domain [, category]]) * str = dcngettext(string1, string2, number [, domain [, category]]) * * Default domain is TEXTDOMAIN, default category is LC_MESSAGES. */ NODE * do_dcgettext(NODE *tree) { NODE *tmp, *t1, *t2; char *string; char *the_result; #if ENABLE_NLS && HAVE_LC_MESSAGES && HAVE_DCGETTEXT int lc_cat; char *domain; #endif /* ENABLE_NLS */ tmp = tree->lnode; /* first argument */ t1 = force_string(tree_eval(tmp)); string = t1->stptr; t2 = NULL; #if ENABLE_NLS && HAVE_LC_MESSAGES && HAVE_DCGETTEXT tree = tree->rnode; /* second argument */ if (tree != NULL) { tmp = tree->lnode; t2 = force_string(tree_eval(tmp)); domain = t2->stptr; } else domain = TEXTDOMAIN; if (tree && tree->rnode != NULL) { /* third argument */ lc_cat = localecategory_from_argument(tree->rnode); } else lc_cat = LC_MESSAGES; the_result = dcgettext(domain, string, lc_cat); #else the_result = string; #endif free_temp(t1); if (t2 != NULL) free_temp(t2); return tmp_string(the_result, strlen(the_result)); } NODE * do_dcngettext(NODE *tree) { NODE *tmp, *t1, *t2, *t3; char *string1, *string2; unsigned long number; char *the_result; #if ENABLE_NLS && HAVE_LC_MESSAGES && HAVE_DCGETTEXT int lc_cat; char *domain; #endif /* ENABLE_NLS */ tmp = tree->lnode; /* first argument */ t1 = force_string(tree_eval(tmp)); string1 = t1->stptr; tmp = tree->rnode->lnode; /* second argument */ t2 = force_string(tree_eval(tmp)); string2 = t2->stptr; tmp = tree->rnode->rnode->lnode; /* third argument */ number = (unsigned long) double_to_int(force_number(tree_eval(tmp))); t3 = NULL; #if ENABLE_NLS && HAVE_LC_MESSAGES && HAVE_DCGETTEXT tree = tree->rnode->rnode->rnode; /* fourth argument */ if (tree != NULL) { tmp = tree->lnode; t3 = force_string(tree_eval(tmp)); domain = t3->stptr; } else domain = TEXTDOMAIN; if (tree && tree->rnode != NULL) { /* fifth argument */ lc_cat = localecategory_from_argument(tree->rnode); } else lc_cat = LC_MESSAGES; the_result = dcngettext(domain, string1, string2, number, lc_cat); #else the_result = (number == 1 ? string1 : string2); #endif free_temp(t1); free_temp(t2); if (t3 != NULL) free_temp(t3); return tmp_string(the_result, strlen(the_result)); } /* do_bindtextdomain --- set the directory for a text domain */ /* * awk usage is * * binding = bindtextdomain(dir [, domain]) * * If dir is "", pass NULL to C version. * Default domain is TEXTDOMAIN. */ NODE * do_bindtextdomain(NODE *tree) { NODE *tmp, *t1, *t2; char *directory, *domain; char *the_result; t1 = t2 = NULL; /* set defaults */ directory = NULL; domain = TEXTDOMAIN; tmp = tree->lnode; /* first argument */ t1 = force_string(tree_eval(tmp)); if (t1->stlen > 0) directory = t1->stptr; tree = tree->rnode; /* second argument */ if (tree != NULL) { tmp = tree->lnode; t2 = force_string(tree_eval(tmp)); domain = t2->stptr; } the_result = bindtextdomain(domain, directory); free_temp(t1); if (t2 != NULL) free_temp(t2); return tmp_string(the_result, strlen(the_result)); }