blob: e0ae9f653e2f1fa8c4262a7d9bf18c7a565db64a [file] [log] [blame]
Brian Kernighan87b94932012-12-22 10:35:39 -05001/****************************************************************
2Copyright (C) Lucent Technologies 1997
3All Rights Reserved
4
5Permission to use, copy, modify, and distribute this software and
6its documentation for any purpose and without fee is hereby
7granted, provided that the above copyright notice appear in all
8copies and that both that the copyright notice and this
9permission notice and warranty disclaimer appear in supporting
10documentation, and that the name Lucent Technologies or any of
11its entities not be used in advertising or publicity pertaining
12to distribution of the software without specific, written prior
13permission.
14
15LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
16INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
17IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
18SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
19WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
20IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
21ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
22THIS SOFTWARE.
23****************************************************************/
24
25#include <assert.h>
26
27typedef double Awkfloat;
28
29/* unsigned char is more trouble than it's worth */
30
31typedef unsigned char uschar;
32
33#define xfree(a) { if ((a) != NULL) { free((void *) (a)); (a) = NULL; } }
34
35#define NN(p) ((p) ? (p) : "(null)") /* guaranteed non-null for dprintf
36*/
37#define DEBUG
38#ifdef DEBUG
39 /* uses have to be doubly parenthesized */
40# define dprintf(x) if (dbg) printf x
41#else
42# define dprintf(x)
43#endif
44
45extern int compile_time; /* 1 if compiling, 0 if running */
46extern int safe; /* 0 => unsafe, 1 => safe */
47
48#define RECSIZE (8 * 1024) /* sets limit on records, fields, etc., etc. */
49extern int recsize; /* size of current record, orig RECSIZE */
50
51extern char **FS;
52extern char **RS;
53extern char **ORS;
54extern char **OFS;
55extern char **OFMT;
56extern Awkfloat *NR;
57extern Awkfloat *FNR;
58extern Awkfloat *NF;
59extern char **FILENAME;
60extern char **SUBSEP;
61extern Awkfloat *RSTART;
62extern Awkfloat *RLENGTH;
63
64extern char *record; /* points to $0 */
65extern int lineno; /* line number in awk program */
66extern int errorflag; /* 1 if error has occurred */
67extern int donefld; /* 1 if record broken into fields */
68extern int donerec; /* 1 if record is valid (no fld has changed */
69extern char inputFS[]; /* FS at time of input, for field splitting */
70
71extern int dbg;
72
73extern char *patbeg; /* beginning of pattern matched */
74extern int patlen; /* length of pattern matched. set in b.c */
75
76/* Cell: all information about a variable or constant */
77
78typedef struct Cell {
79 uschar ctype; /* OCELL, OBOOL, OJUMP, etc. */
80 uschar csub; /* CCON, CTEMP, CFLD, etc. */
81 char *nval; /* name, for variables only */
82 char *sval; /* string value */
83 Awkfloat fval; /* value as number */
Arnold D. Robbins32093f52018-08-22 20:40:26 +030084 int tval; /* type info: STR|NUM|ARR|FCN|FLD|CON|DONTFREE|CONVC|CONVO */
85 char *fmt; /* CONVFMT/OFMT value used to convert from number */
Brian Kernighan87b94932012-12-22 10:35:39 -050086 struct Cell *cnext; /* ptr to next if chained */
87} Cell;
88
89typedef struct Array { /* symbol table array */
90 int nelem; /* elements in table right now */
91 int size; /* size of tab */
92 Cell **tab; /* hash table pointers */
93} Array;
94
95#define NSYMTAB 50 /* initial size of a symbol table */
96extern Array *symtab;
97
98extern Cell *nrloc; /* NR */
99extern Cell *fnrloc; /* FNR */
100extern Cell *nfloc; /* NF */
101extern Cell *rstartloc; /* RSTART */
102extern Cell *rlengthloc; /* RLENGTH */
Cody Peter Mello97a4b7e2018-09-17 11:59:04 -0700103extern Cell *subseploc; /* SUBSEP */
Brian Kernighan87b94932012-12-22 10:35:39 -0500104
105/* Cell.tval values: */
106#define NUM 01 /* number value is valid */
107#define STR 02 /* string value is valid */
108#define DONTFREE 04 /* string space is not freeable */
109#define CON 010 /* this is a constant */
110#define ARR 020 /* this is an array */
111#define FCN 040 /* this is a function name */
112#define FLD 0100 /* this is a field $1, $2, ... */
113#define REC 0200 /* this is $0 */
Arnold D. Robbins32093f52018-08-22 20:40:26 +0300114#define CONVC 0400 /* string was converted from number via CONVFMT */
115#define CONVO 01000 /* string was converted from number via OFMT */
Brian Kernighan87b94932012-12-22 10:35:39 -0500116
117
118/* function types */
119#define FLENGTH 1
120#define FSQRT 2
121#define FEXP 3
122#define FLOG 4
123#define FINT 5
124#define FSYSTEM 6
125#define FRAND 7
126#define FSRAND 8
127#define FSIN 9
128#define FCOS 10
129#define FATAN 11
130#define FTOUPPER 12
131#define FTOLOWER 13
132#define FFLUSH 14
133
134/* Node: parse tree is made of nodes, with Cell's at bottom */
135
136typedef struct Node {
137 int ntype;
138 struct Node *nnext;
139 int lineno;
140 int nobj;
141 struct Node *narg[1]; /* variable: actual size set by calling malloc */
142} Node;
143
144#define NIL ((Node *) 0)
145
146extern Node *winner;
147extern Node *nullstat;
148extern Node *nullnode;
149
150/* ctypes */
151#define OCELL 1
152#define OBOOL 2
153#define OJUMP 3
154
155/* Cell subtypes: csub */
156#define CFREE 7
157#define CCOPY 6
158#define CCON 5
159#define CTEMP 4
160#define CNAME 3
161#define CVAR 2
162#define CFLD 1
163#define CUNK 0
164
165/* bool subtypes */
166#define BTRUE 11
167#define BFALSE 12
168
169/* jump subtypes */
170#define JEXIT 21
171#define JNEXT 22
172#define JBREAK 23
173#define JCONT 24
174#define JRET 25
175#define JNEXTFILE 26
176
177/* node types */
178#define NVALUE 1
179#define NSTAT 2
180#define NEXPR 3
181
182
183extern int pairstack[], paircnt;
184
185#define notlegal(n) (n <= FIRSTTOKEN || n >= LASTTOKEN || proctab[n-FIRSTTOKEN] == nullproc)
186#define isvalue(n) ((n)->ntype == NVALUE)
187#define isexpr(n) ((n)->ntype == NEXPR)
188#define isjump(n) ((n)->ctype == OJUMP)
189#define isexit(n) ((n)->csub == JEXIT)
190#define isbreak(n) ((n)->csub == JBREAK)
191#define iscont(n) ((n)->csub == JCONT)
192#define isnext(n) ((n)->csub == JNEXT || (n)->csub == JNEXTFILE)
193#define isret(n) ((n)->csub == JRET)
194#define isrec(n) ((n)->tval & REC)
195#define isfld(n) ((n)->tval & FLD)
196#define isstr(n) ((n)->tval & STR)
197#define isnum(n) ((n)->tval & NUM)
198#define isarr(n) ((n)->tval & ARR)
199#define isfcn(n) ((n)->tval & FCN)
200#define istrue(n) ((n)->csub == BTRUE)
201#define istemp(n) ((n)->csub == CTEMP)
202#define isargument(n) ((n)->nobj == ARG)
203/* #define freeable(p) (!((p)->tval & DONTFREE)) */
204#define freeable(p) ( ((p)->tval & (STR|DONTFREE)) == STR )
205
206/* structures used by regular expression matching machinery, mostly b.c: */
207
208#define NCHARS (256+3) /* 256 handles 8-bit chars; 128 does 7-bit */
209 /* watch out in match(), etc. */
210#define NSTATES 32
211
212typedef struct rrow {
213 long ltype; /* long avoids pointer warnings on 64-bit */
214 union {
215 int i;
216 Node *np;
217 uschar *up;
218 } lval; /* because Al stores a pointer in it! */
219 int *lfollow;
220} rrow;
221
222typedef struct fa {
223 uschar gototab[NSTATES][NCHARS];
224 uschar out[NSTATES];
225 uschar *restr;
226 int *posns[NSTATES];
227 int anchor;
228 int use;
229 int initstat;
230 int curstat;
231 int accept;
232 int reset;
233 struct rrow re[1]; /* variable: actual size set by calling malloc */
234} fa;
235
236
237#include "proto.h"