Ultrix-3.1/src/cmd/awk/tags
ALLOC parse.c /^node *ALLOC(n)$/
Copyright crt0.s /^\/ Copyright (c) Digital Equipment Corporation 19/
Mmain main.c /^main(argc, argv) int argc; char *argv[]; {$/
Mproc proc.c /^main()$/
PUTS lib.c /^PUTS(s) char *s; {$/
TOLOWER main.c /^#define TOLOWER(c) (isupper(c) ? tolower(c) : c) \//
add b.c /^int *add(n) { \/* remember setvec *\/$/
aprintf run.c /^obj aprintf(a,n) node **a;$/
arith run.c /^obj arith(a,n) node **a;$/
array run.c /^obj array(a,n) node **a;$/
arrayel run.c /^obj arrayel(a,b) node *a; obj b;$/
asprintf run.c /^obj asprintf(a,n) node **a;$/
assign run.c /^obj assign(a,n) node **a;$/
boolop run.c /^obj boolop(a,n) node **a;$/
cantexec awk.def /^#define cantexec(n) (n->ntype == NVALUE)$/
cat run.c /^obj cat(a,q) node **a;$/
cclenter b.c /^char *cclenter(p)$/
cfoll b.c /^cfoll(v) \/* enter follow set of each leaf of vert/
cgotofn b.c /^struct fa *cgotofn()$/
checkval tran.c /^checkval(vp)$/
cmp crt0.s /^cmp (sp)+,(sp)+$/
dopa2 run.c /^obj dopa2(a,n) node **a;$/
dprintf awk.def /^# define dprintf(x1, x2, x3, x4)$/
error lib.c /^error(index, type, a1, a2, a3, a4, a5)$/
execute run.c /^obj execute(u) node *u;$/
exptostat parse.c /^node *exptostat(a) node *a;$/
fieldadr lib.c /^cell *fieldadr(n)$/
first b.c /^first(p) \/* collects initially active leaves of /
fldbld lib.c /^fldbld()$/
fncn run.c /^obj fncn(a,n) node **a;$/
follow b.c /^follow(v)$/
format run.c /^char *format(s,a) char *s; node *a;$/
forstat run.c /^obj forstat(a,n) node **a;$/
freesymtab tran.c /^freesymtab(ap) \/* free symbol table *\/$/
freetr b.c /^freetr(p) \/* free parse tree and follow sets *\/$/
freeze freeze.c /^freeze(s) char *s;$/
genprint parse.c /^node *genprint()$/
getfval tran.c /^awkfloat getfval(vp)$/
getline run.c /^obj getline()$/
getrec lib.c /^getrec()$/
getsval tran.c /^char *getsval(vp)$/
gettemp run.c /^obj gettemp()$/
hash tran.c /^hash(s) \/* form hash value for string s *\/$/
if lib.c /^ if (i >= MAXFLD)$/
ifstat run.c /^obj ifstat(a,n) node **a;$/
incrdecr run.c /^obj incrdecr(a, n) node **a;$/
indirect run.c /^obj indirect(a,n) node **a;$/
input awk.lx.l /^input()$/
instat run.c /^obj instat(a, n) node **a;$/
isbreak awk.def /^#define isbreak(n) (n.otype == OJUMP && n.osub == /
iscont awk.def /^#define iscont(n) (n.otype == OJUMP && n.osub == J/
isexit awk.def /^#define isexit(n) (n.otype == OJUMP && n.osub == J/
isexpr awk.def /^#define isexpr(n) (n->ntype == NEXPR)$/
isfld awk.def /^#define isfld(n) (!donefld && n.osub==CFLD && n.ot/
isjump awk.def /^#define isjump(n) (n.otype == OJUMP)$/
isnext awk.def /^#define isnext(n) (n.otype == OJUMP && n.osub == J/
isnumber lib.c /^isnumber(s)$/
isrec awk.def /^#define isrec(n) (donefld && n.osub==CFLD && n.oty/
isstr awk.def /^#define isstr(n) (n.optr->tval & STR)$/
istemp awk.def /^#define istemp(n) (n.otype == OCELL && n.osub == C/
istrue awk.def /^#define istrue(n) (n.otype == OBOOL && n.osub == B/
jump run.c /^obj jump(a,n) node **a;$/
left b.c /^#define left(v) v->narg[0]$/
linkum parse.c /^node *linkum(a,b) node *a, *b;$/
logit main.c /^logit(n, s) char *s[];$/
lookup tran.c /^cell *lookup(s, tab, flag) \/* look for s in tab, f/
makedfa b.c /^struct fa *makedfa(p) \/* returns dfa for tree poin/
makesymtab tran.c /^cell **makesymtab()$/
match b.c /^match(pfa, p)$/
matchop run.c /^obj matchop(a,n) node **a;$/
member b.c /^member(c, s) \/* is c in s? *\/$/
node0 parse.c /^node *node0(a)$/
node1 parse.c /^node *node1(a,b) node *b;$/
node2 parse.c /^node *node2(a,b,c) node *b, *c;$/
node3 parse.c /^node *node3(a,b,c,d) node *b, *c, *d;$/
node4 parse.c /^node *node4(a,b,c,d,e) node *b, *c, *d, *e;$/
nodetoobj run.c /^obj nodetoobj(a) node *a;$/
notin b.c /^notin(array, n, prev) \/* is setvec in array[0] th/
notlegal awk.def /^#define notlegal(n) (n <= FIRSTTOKEN || n >= LASTT/
nullproc run.c /^obj nullproc() {}$/
op1 parse.c /^node *op1(a,b) node *b;$/
op2 parse.c /^node *op2(a,b,c) node *b, *c;$/
op3 parse.c /^node *op3(a,b,c,d) node *b, *c, *d;$/
overflo b.c /^overflo()$/
pa2stat parse.c /^node *pa2stat(a,b,c) node *a, *b, *c;$/
parent b.c /^#define parent(v) v->nnext$/
pastat run.c /^obj pastat(a,n) node **a;$/
penter b.c /^penter(p) \/* set up parent pointers and leaf indic/
print run.c /^obj print(a,n) node **a;$/
program run.c /^obj program(a, n) node **a;$/
recbld lib.c /^recbld()$/
redirprint run.c /^redirprint(s, a, b) char *s; node *b;$/
relop run.c /^obj relop(a,n) node **a;$/
right b.c /^#define right(v) v->narg[1]$/
run run.c /^run()$/
setclvar lib.c /^setclvar(s) \/* set var=value from s *\/$/
setfval tran.c /^awkfloat setfval(vp, f)$/
setsval tran.c /^char *setsval(vp, s)$/
setsymtab tran.c /^cell *setsymtab(n, s, f, t, tab)$/
sindex run.c /^obj sindex(a, nnn) node **a;$/
split run.c /^obj split(a,nnn) node **a;$/
startreg awk.lx.l /^startreg()$/
stat1 parse.c /^node *stat1(a,b) node *b;$/
stat2 parse.c /^node *stat2(a,b,c) node *b, *c;$/
stat3 parse.c /^node *stat3(a,b,c,d) node *b, *c, *d;$/
stat4 parse.c /^node *stat4(a,b,c,d,e) node *b, *c, *d, *e;$/
substr run.c /^obj substr(a, nnn) node **a;$/
switch awk.lx.l /^ switch (yybgin-yysvec-1) { \/* witchcraft *\/$/
syminit tran.c /^syminit()$/
tempfree run.c /^tempfree(a) obj a;$/
thaw freeze.c /^thaw(s) char *s;$/
tostring tran.c /^char *tostring(s)$/
tst crt0.s /^ tst (r0)+$/
type b.c /^#define type(v) v->nobj$/
valtonode parse.c /^node *valtonode(a, b) cell *a;$/
whilestat run.c /^obj whilestat(a,n) node **a;$/
xfree awk.def /^#define xfree(a) { if(a!=NULL) { yfree(a); a=NULL;/
yfree tran.c /^yfree(a) char *a;$/
ymalloc tran.c /^char *ymalloc(u) unsigned u;$/
yyerror lib.c /^yyerror(s) char *s; {$/
yywrap main.c /^yywrap()$/