70 Node	*winner = NULL;	/* root of parse tree */
91 Node	*curnode = NULL;	/* the node being executed, for debugging */
128 void run(Node *a)	/* execution of parse tree starts here */  in run()
137 Cell *execute(Node *u)	/* execute a node of the parse tree */  in execute()
139 	Cell *(*proc)(Node **, int);  in execute()
141 	Node *a;  in execute()
174 Cell *program(Node **a, int n)	/* execute an awk program */  in program()
221 Cell *call(Node **a, int n)	/* function call.  very kludgy and fragile */  in call()
226 	Node *x;  in call()
282 	y = execute((Node *)(fcn->sval));	/* execute body */  in call()
336 Cell *arg(Node **a, int n)	/* nth argument of a function */  in arg()
347 Cell *jump(Node **a, int n)	/* break, continue, next, nextfile, return */  in jump()
391 Cell *getline(Node **a, int n)	/* get next line from specific input */  in getline()
444 Cell *getnf(Node **a, int n)	/* get NF */  in getnf()
451 Cell *array(Node **a, int n)	/* a[0] is symtab, a[1] is list of subscripts */  in array()
455 	Node *np;  in array()
491 Cell *awkdelete(Node **a, int n)	/* a[0] is symtab, a[1] is list of subscripts */  in awkdelete()
494 	Node *np;  in awkdelete()
529 Cell *intest(Node **a, int n)	/* a[0] is index (list), a[1] is symtab */  in intest()
532 	Node *p;  in intest()
571 Cell *matchop(Node **a, int n)	/* ~ and match() */  in matchop()
612 Cell *boolop(Node **a, int n)	/* a[0] || a[1], a[0] && a[1], !a[0] */  in boolop()
644 Cell *relop(Node **a, int n)	/* a[0 < a[1], etc. */  in relop()
709 Cell *indirect(Node **a, int n)	/* $( a[0] ) */  in indirect()
731 Cell *substr(Node **a, int nnn)		/* substr(a[0], a[1], a[2]) */  in substr()
779 Cell *sindex(Node **a, int nnn)		/* index(a[0], a[1]) */  in sindex()
807 int format(char **pbuf, int *pbufsize, const char *s, Node *a)	/* printf-like conversions */  in format()
942 Cell *awksprintf(Node **a, int n)		/* sprintf(a[0]) */  in awksprintf()
945 	Node *y;  in awksprintf()
962 Cell *awkprintf(Node **a, int n)		/* printf */  in awkprintf()
967 	Node *y;  in awkprintf()
996 Cell *arith(Node **a, int n)	/* a[0] + a[1], etc.  also -a[0] */  in arith()
1061 Cell *incrdecr(Node **a, int n)		/* a[0]++, etc. */  in incrdecr()
1081 Cell *assign(Node **a, int n)	/* a[0] = a[1], a[0] += a[1], etc. */  in assign()
1144 Cell *cat(Node **a, int q)	/* a[0] cat a[1] */  in cat()
1170 Cell *pastat(Node **a, int n)	/* a[0] { a[1] } */  in pastat()
1186 Cell *dopa2(Node **a, int n)	/* a[0], a[1] { a[2] } */  in dopa2()
1209 Cell *split(Node **a, int nnn)	/* split(a[0], a[1], a[2]); a[3] is type */  in split()
1341 Cell *condexpr(Node **a, int n)	/* a[0] ? a[1] : a[2] */  in condexpr()
1356 Cell *ifstat(Node **a, int n)	/* if (a[0]) a[1]; else a[2] */  in ifstat()
1371 Cell *whilestat(Node **a, int n)	/* while (a[0]) a[1] */  in whilestat()
1391 Cell *dostat(Node **a, int n)	/* do a[0]; while(a[1]) */  in dostat()
1409 Cell *forstat(Node **a, int n)	/* for (a[0]; a[1]; a[2]) a[3] */  in forstat()
1432 Cell *instat(Node **a, int n)	/* for (a[0] in a[1]) a[2] */  in instat()
1464 Cell *bltin(Node **a, int n)	/* builtin functions. a[0] is type, a[1] is arg list */  in bltin()
1470 	Node *nextarg;  in bltin()
1563 Cell *printstat(Node **a, int n)	/* print a[0] */  in printstat()
1565 	Node *x;  in printstat()
1589 Cell *nullproc(Node **a, int n)  in nullproc()
1597 FILE *redirect(int a, Node *b)	/* set up all i/o redirections */  in redirect()
1685 Cell *closefile(Node **a, int n)  in closefile()
1745 Cell *sub(Node **a, int nnn)	/* substitute command */  in sub()
1805 Cell *gsub(Node **a, int nnn)	/* global substitute */  in gsub()