ISLONG	../../../libexec/pcc/mip/trees.c	/^#define	ISLONG(t)	((t) == LONG || (t) == ULONG)$/
Mlint	lint.c	/^main(argc, argv)$/
POP	../../../libexec/pcc/mip/common.c	/^#define	POP() \\$/
PUSH	../../../libexec/pcc/mip/common.c	/^#define	PUSH(dir, state) \\$/
addcase	cgram.c	/^addcase(p) NODE *p; { \/* add case to switch *\/$/
adddef	cgram.c	/^adddef(){ \/* add default case to switch *\/$/
andable	lint.c	/^andable( p ) NODE *p; {  \/* p is a NAME node; can/
aocode	lint.c	/^aocode(p) struct symtab *p; {$/
astype	lint.c	/^astype( t, i ) ATYPE *t; {$/
bcon	../../../libexec/pcc/mip/trees.c	/^bcon( i ){ \/* make a constant node with value i */
bdty	cgram.c	/^bdty( op, p, v ) NODE *p; {$/
beginit	../../../libexec/pcc/mip/pftn.c	/^beginit(curid){$/
bfcode	lint.c	/^bfcode( a, n ) int a[]; {$/
block	../../../libexec/pcc/mip/trees.c	/^block( o, l, r, t, d, s ) register NODE *l, *r; TW/
bpsize	../../../libexec/pcc/mip/trees.c	/^bpsize(p) register NODE *p; {$/
branch	lint.c	/^branch(n){;}$/
bstruct	../../../libexec/pcc/mip/pftn.c	/^bstruct( idn, soru ){ \/* begining of structure or/
buildtree	../../../libexec/pcc/mip/trees.c	/^buildtree( o, l, r ) register NODE *l, *r; {$/
bycode	lint.c	/^bycode(t, i)$/
caloff	../../../libexec/pcc/mip/common.c	/^unsigned caloff(){$/
cerror	../../../libexec/pcc/mip/common.c	/^cerror( s, a, b, c ) char *s; { \/* compiler error/
checkst	../../../libexec/pcc/mip/pftn.c	/^checkst(lev){$/
chkpun	../../../libexec/pcc/mip/trees.c	/^chkpun(p) register NODE *p; {$/
chkstr	../../../libexec/pcc/mip/trees.c	/^chkstr( i, j, type ) TWORD type; {$/
cinit	lint.c	/^cinit( p, sz ) NODE *p; { \/* initialize p into si/
cisreg	lint.c	/^cisreg(t) TWORD t; {return(1);}  \/* everyting is /
clearst	../../../libexec/pcc/mip/pftn.c	/^clearst( lev ) register int lev; {$/
clocal	lint.c	/^clocal(p) NODE *p; {$/
commdec	lint.c	/^commdec( i ){$/
contx	lint.c	/^contx( p, down, pl, pr ) register NODE *p; registe/
conval	../../../libexec/pcc/mip/trees.c	/^conval( p, o, q ) register NODE *p, *q; {$/
convert	../../../libexec/pcc/mip/trees.c	/^convert( p, f )  register NODE *p; {$/
ctargs	lint.c	/^ctargs( p ) NODE *p; {$/
ctype	lint.c	/^ctype( type ) unsigned type; { \/* are there any f/
dclargs	../../../libexec/pcc/mip/pftn.c	/^dclargs(){$/
dclstruct	../../../libexec/pcc/mip/pftn.c	/^dclstruct( oparam ){$/
defalign	lint.c	/^defalign(n){;}$/
defid	../../../libexec/pcc/mip/pftn.c	/^defid( q, class ) register NODE *q; register int c/
deflab	lint.c	/^deflab(n){;}$/
defnam	lint.c	/^defnam( p ) register struct symtab *p; {$/
doform	lint.c	/^doform(p, sp, acount)$/
doinit	../../../libexec/pcc/mip/pftn.c	/^doinit( p ) register NODE *p; {$/
doszof	../../../libexec/pcc/mip/trees.c	/^doszof( p )  register NODE *p; {$/
dstash	cgram.c	/^dstash( n ){ \/* put n into the dimension table */
ecode	lint.c	/^ecode( p ) NODE *p; {$/
ecomp	../../../libexec/pcc/mip/trees.c	/^ecomp( p ) register NODE *p; {$/
econvert	../../../libexec/pcc/mip/trees.c	/^econvert( p ) register NODE *p; {$/
efcode	lint.c	/^efcode(){$/
ejobcode	lint.c	/^ejobcode( flag ){$/
endinit	../../../libexec/pcc/mip/pftn.c	/^endinit(){$/
eprint	../../../libexec/pcc/mip/trees.c	/^eprint( p, down, a, b ) register NODE *p; int *a, /
exname	lint.c	/^exname( p ) char *p; {$/
falloc	../../../libexec/pcc/mip/pftn.c	/^falloc( p, w, new, pty )  register struct symtab */
findlc	lint.c	/^findlc(ep, lchar, cchar)$/
fixargs	../../../libexec/pcc/mip/trees.c	/^fixargs( p ) register NODE *p;  {$/
fixclass	../../../libexec/pcc/mip/pftn.c	/^fixclass( class, type ) TWORD type; {$/
fixinit	../../../libexec/pcc/mip/pftn.c	/^fixinit(){$/
fixtype	../../../libexec/pcc/mip/pftn.c	/^fixtype( p, class ) register NODE *p; {$/
fldal	lint.c	/^fldal(t) unsigned t; { \/* field alignment... *\/$/
fldcon	lint.c	/^fldcon( p ) register NODE *p; {$/
fldty	lint.c	/^fldty(p) struct symtab *p; {$/
fortarg	../../../libexec/pcc/mip/optim.c	/^fortarg( p ) NODE *p; {$/
fpe	../../../libexec/pcc/mip/trees.c	/^fpe() {$/
fsave	lint.c	/^fsave( s ) char *s; {$/
ftnarg	../../../libexec/pcc/mip/pftn.c	/^ftnarg( idn ) {$/
ftnend	../../../libexec/pcc/mip/pftn.c	/^ftnend(){ \/* end of function *\/$/
fwalk	../../../libexec/pcc/mip/common.c	/^fwalk( t, f, down ) register NODE *t; int (*f)(); /
getstr	../../../libexec/pcc/mip/pftn.c	/^getstr(){ \/* decide if the string is external or /
gotscal	../../../libexec/pcc/mip/pftn.c	/^gotscal(){$/
hash	../../../libexec/pcc/mip/scan.c	/^hash(s)$/
hashstr	hash.c	/^hashstr(s, n)$/
hide	../../../libexec/pcc/mip/pftn.c	/^hide( p ) register struct symtab *p; {$/
icons	../../../libexec/pcc/mip/trees.c	/^icons(p) register NODE *p; {$/
ilbrace	../../../libexec/pcc/mip/pftn.c	/^ilbrace(){ \/* process an initializer's left brace/
inforce	../../../libexec/pcc/mip/pftn.c	/^inforce( n ) OFFSZ n; {  \/* force inoff to have t/
instk	../../../libexec/pcc/mip/pftn.c	/^instk( id, t, d, s, off ) OFFSZ off; TWORD t; {$/
irbrace	../../../libexec/pcc/mip/pftn.c	/^irbrace(){$/
isitfloat	lint.c	/^isitfloat ( s ) char *s; {$/
ispow2	../../../libexec/pcc/mip/optim.c	/^ispow2( c ) CONSZ c; {$/
lmerge	lint.c	/^lmerge( np1, np2, flag ) struct lnm *np1, *np2; {$/
lookup	../../../libexec/pcc/mip/pftn.c	/^lookup( name, s) char *name; { $/
lprt	lint.c	/^lprt( p, down, uses ) register NODE *p; {$/
lpta	lint.c	/^lpta( p ) NODE *p; {$/
lxcom	../../../libexec/pcc/mip/scan.c	/^lxcom(){$/
lxenter	../../../libexec/pcc/mip/scan.c	/^lxenter( s, m ) register char *s; register short m/
lxinit	../../../libexec/pcc/mip/scan.c	/^lxinit(){$/
lxmore	../../../libexec/pcc/mip/scan.c	/^lxmore( c, m )  register c, m; {$/
lxres	../../../libexec/pcc/mip/scan.c	/^lxres() {$/
lxstr	../../../libexec/pcc/mip/scan.c	/^lxstr(ct){$/
lxtitle	../../../libexec/pcc/mip/scan.c	/^lxtitle(){$/
mainp1	../../../libexec/pcc/mip/scan.c	/^mainp1( argc, argv ) int argc; char *argv[]; {  \//
makety	../../../libexec/pcc/mip/trees.c	/^makety( p, t, d, s ) register NODE *p; TWORD t; {$/
mkdope	../../../libexec/pcc/mip/common.c	/^mkdope(){$/
mknonuniq	../../../libexec/pcc/mip/pftn.c	/^mknonuniq(idindex) int *idindex; {\/* locate a sym/
mkty	cgram.c	/^mkty( t, d, s ) unsigned t; {$/
moditype	../../../libexec/pcc/mip/trees.c	/^moditype( ty ) TWORD ty; {$/
moedef	../../../libexec/pcc/mip/pftn.c	/^moedef( idn ){$/
nidcl	../../../libexec/pcc/mip/pftn.c	/^nidcl( p ) NODE *p; { \/* handle unitialized decla/
noinit	lint.c	/^noinit(){$/
notlval	../../../libexec/pcc/mip/trees.c	/^notlval(p) register NODE *p; {$/
ntharg	lint.c	/^ntharg(p, n, acount)$/
oalloc	../../../libexec/pcc/mip/pftn.c	/^oalloc( p, poff ) register struct symtab *p; regis/
oconvert	../../../libexec/pcc/mip/trees.c	/^oconvert(p) register NODE *p; {$/
offcon	lint.c	/^offcon( off, t, d, s ) OFFSZ off; TWORD t;{  \/* m/
opact	../../../libexec/pcc/mip/trees.c	/^opact( p )  NODE *p; {$/
optim	../../../libexec/pcc/mip/optim.c	/^optim(p) register NODE *p; {$/
outdef	lint.c	/^outdef( p, lty, mode ) struct symtab *p; {$/
p2tree	../../../libexec/pcc/mip/trees.c	/^p2tree(p) register NODE *p; {$/
pconvert	../../../libexec/pcc/mip/trees.c	/^pconvert( p ) register NODE *p; {$/
printact	../../../libexec/pcc/mip/trees.c	/^printact(t, acts)$/
prtdcon	../../../libexec/pcc/mip/trees.c	/^prtdcon( p ) register NODE *p; {$/
prtree	../../../libexec/pcc/mip/trees.c	/^prtree(p) register NODE *p; {$/
psave	../../../libexec/pcc/mip/pftn.c	/^psave( i ){$/
psize	../../../libexec/pcc/mip/trees.c	/^psize( p ) NODE *p; {$/
ptmatch	../../../libexec/pcc/mip/trees.c	/^ptmatch(p)  register NODE *p; {$/
putbyte	../../../libexec/pcc/mip/pftn.c	/^putbyte( v ){ \/* simulate byte v appearing in a l/
relook	../../../libexec/pcc/mip/pftn.c	/^relook(p) register struct symtab *p; {  \/* look u/
resetbc	cgram.c	/^resetbc(mask){$/
rstruct	../../../libexec/pcc/mip/pftn.c	/^rstruct( idn, soru ){ \/* reference to a structure/
savebc	cgram.c	/^savebc() {$/
savestr	../../../libexec/pcc/mip/scan.c	/^savestr(cp)$/
scnames	../../../libexec/pcc/mip/xdefs.c	/^char * scnames( c ) register c; {$/
stref	../../../libexec/pcc/mip/trees.c	/^stref( p ) register NODE *p; {$/
strforget	lint.c	/^strforget()$/
strip	lint.c	/^strip(s) char *s; {$/
subform	lint.c	/^subform(p, sp, acount)$/
swend	cgram.c	/^swend(){ \/* end a switch block *\/$/
swstart	cgram.c	/^swstart(){$/
talign	../../../libexec/pcc/mip/pftn.c	/^talign( ty, s) register unsigned ty; register s; {/
talloc	../../../libexec/pcc/mip/common.c	/^talloc(){$/
tcheck	../../../libexec/pcc/mip/common.c	/^tcheck(){ \/* ensure that all nodes have been free/
tfree	../../../libexec/pcc/mip/common.c	/^tfree( p )  NODE *p; {$/
tfree1	../../../libexec/pcc/mip/common.c	/^tfree1(p)  NODE *p; {$/
tinit	../../../libexec/pcc/mip/common.c	/^tinit(){ \/* initialize expression tree search *\//
tprint	../../../libexec/pcc/mip/common.c	/^tprint( t )  TWORD t; { \/* output a nice descript/
tsize	../../../libexec/pcc/mip/pftn.c	/^tsize( ty, d, s )  TWORD ty; {$/
tstr	../../../libexec/pcc/mip/common.c	/^tstr(cp)$/
tymatch	../../../libexec/pcc/mip/trees.c	/^tymatch(p)  register NODE *p; {$/
tymerge	../../../libexec/pcc/mip/pftn.c	/^tymerge( typ, idp ) NODE *typ, *idp; {$/
types	../../../libexec/pcc/mip/pftn.c	/^types( t1, t2, t3 ) TWORD t1, t2, t3; {$/
typestr	lint.c	/^typestr(t)$/
tyreduce	../../../libexec/pcc/mip/pftn.c	/^tyreduce( p ) register NODE *p; {$/
uclass	../../../libexec/pcc/mip/pftn.c	/^uclass( class ) register class; {$/
uerror	../../../libexec/pcc/mip/common.c	/^uerror( s, a ) char *s; { \/* nonfatal error messa/
unhide	../../../libexec/pcc/mip/pftn.c	/^unhide( p ) register struct symtab *p; {$/
upoff	../../../libexec/pcc/mip/pftn.c	/^upoff( size, alignment, poff ) register alignment,/
vfdalign	../../../libexec/pcc/mip/pftn.c	/^vfdalign( n ){ \/* make inoff have the offset the /
walkf	../../../libexec/pcc/mip/common.c	/^walkf( t, f ) register NODE *t;  int (*f)(); {$/
werror	../../../libexec/pcc/mip/common.c	/^werror( s, a, b ) char *s; {  \/* warning *\/$/
where	lint.c	/^where(f){ \/* print true location of error *\/$/
yyaccpt	../../../libexec/pcc/mip/pftn.c	/^yyaccpt(){$/
yyerror	../../../libexec/pcc/mip/pftn.c	/^yyerror( s ) char *s; { \/* error printing routine/
yylex	../../../libexec/pcc/mip/scan.c	/^yylex(){$/
yyparse	cgram.c	/^yyparse()$/
zecode	lint.c	/^zecode( n ){$/
