BITMASK	local2.c	/^# define BITMASK(n) ((1L<<n)-1)$/
Boolean	stab.c	35
LCON	optim.c	/^# define LCON(p) (p->in.left->in.op==ICON)$/
LO	optim.c	/^# define LO(p) p->in.left->in.op$/
LV	optim.c	/^# define LV(p) p->in.left->tn.lval$/
Mcode	code.c	/^main( argc, argv ) char *argv[]; {$/
Mlocal2	local2.c	/^main( argc, argv ) char *argv[]; {$/
RCON	optim.c	/^# define RCON(p) (p->in.right->in.op==ICON)$/
RO	optim.c	/^# define RO(p) p->in.right->in.op$/
RV	optim.c	/^# define RV(p) p->in.right->tn.lval$/
SWAP	optim.c	/^# define SWAP(p,q) {sp=p; p=q; q=sp;}$/
Typeid	stab.c	193
acon	local2.c	/^acon( p ) register NODE *p; { \/* print out a const/
addcase	cgram.c	/^addcase(p) NODE *p; { \/* add case to switch *\/$/
adddef	cgram.c	/^adddef(){ \/* add default case to switch *\/$/
adrcon	local2.c	/^adrcon( val ) CONSZ val; {$/
adrput	local2.c	/^adrput( p ) register NODE *p; {$/
allchk	allo.c	/^allchk(){$/
allo	allo.c	/^allo( p, q ) NODE *p; struct optab *q; {$/
allo0	allo.c	/^allo0(){ \/* free everything *\/$/
andable	local.c	/^andable( p ) NODE *p; {$/
aobeg	code.c	/^aobeg(){$/
aocode	code.c	/^aocode(p) struct symtab *p; {$/
aoend	code.c	/^aoend(){$/
argsize	order.c	/^argsize( p ) register NODE *p; {$/
bccode	code.c	/^bccode(){ \/* called just before the first executab/
bcon	trees.c	/^bcon( i ){ \/* make a constant node with value i *\//
bdty	cgram.c	/^bdty( op, p, v ) NODE *p; {$/
beginit	pftn.c	/^beginit(curid){$/
bfcode	code.c	/^bfcode( a, n ) int a[]; {$/
block	trees.c	/^block( o, l, r, t, d, s ) register NODE *l, *r; TW/
bpsize	trees.c	/^bpsize(p) register NODE *p; {$/
branch	code.c	/^branch( n ){$/
bsize	stab.c	/^#define bsize(p) bytes(dimtab[p->sizoff])	\/* size /
bstruct	pftn.c	/^bstruct( idn, soru ){ \/* begining of structure or /
buildtree	trees.c	/^buildtree( o, l, r ) register NODE *l, *r; {$/
builtintype	stab.c	/^#define builtintype(type) entertype(type, NILINDEX/
bycode	code.c	/^bycode( t, i ){$/
bytes	stab.c	/^#define bytes(bits) ((bits) \/ SZCHAR)$/
callreg	local2.c	/^callreg(p) NODE *p; {$/
canon	reader.c	/^canon(p) NODE *p; {$/
cast	local.c	/^cast( p, t ) register NODE *p; TWORD t; {$/
cbgen	local2.c	/^cbgen( o, lab, mode ) { \/*   printf conditional an/
cbranch	reader.c	/^cbranch( p, true, false ) NODE *p; {$/
cendarg	local.c	/^cendarg(){ \/* at the end of the arguments of a ftn/
checkst	pftn.c	/^checkst(lev){$/
chkpun	trees.c	/^chkpun(p) register NODE *p; {$/
chkstr	trees.c	/^chkstr( i, j, type ) TWORD type; {$/
cinit	local.c	/^cinit( p, sz ) NODE *p; {$/
cisreg	local.c	/^cisreg( t ) TWORD t; { \/* is an automatic variable/
clearst	pftn.c	/^clearst( lev ){ \/* clear entries of internal scope/
clocal	local.c	/^clocal(p) NODE *p; {$/
cntbits	local2.c	/^cntbits(i)$/
codgen	reader.c	/^codgen( p, cookie ) NODE *p; {$/
combo	trees.c	/^combo( s, p ) char *s; register NODE *p; {$/
conput	local2.c	/^conput( p ) register NODE *p; {$/
constore	reader.c	/^constore( p ) register NODE *p; {$/
conval	trees.c	/^conval( p, o, q ) register NODE *p, *q; {$/
convert	trees.c	/^convert( p, f )  register NODE *p; {$/
dclargs	pftn.c	/^dclargs(){$/
dclstruct	pftn.c	/^dclstruct( oparam ){$/
defalign	code.c	/^defalign(n) {$/
defid	pftn.c	/^defid( q, class )  NODE *q; {$/
deflab	code.c	/^deflab( n ){$/
defnam	code.c	/^defnam( p ) register struct symtab *p; {$/
delay	reader.c	/^delay( p ) register NODE *p; {$/
delay1	reader.c	/^delay1( p ) register NODE *p; {  \/* look for COMOP/
delay2	reader.c	/^delay2( p ) register NODE *p; {$/
deltest	order.c	/^deltest( p ) register NODE *p; {$/
dexit	code.c	/^dexit( v ) {$/
doinit	pftn.c	/^doinit( p ) register NODE *p; {$/
doszof	trees.c	/^doszof( p )  register NODE *p; {$/
dstash	cgram.c	/^dstash( n ){ \/* put n into the dimension table *\/$/
ecomp	trees.c	/^ecomp( p ) register NODE *p; {$/
econvert	trees.c	/^econvert( p ) register NODE *p; {$/
efcode	code.c	/^efcode(){$/
ejobcode	code.c	/^ejobcode( flag ){$/
endinit	pftn.c	/^endinit(){$/
entertype	stab.c	/^private int entertype(type, arrindex, strindex, st/
eobl2	local2.c	/^eobl2(){$/
eprint	reader.c	/^eprint( p, down, a, b ) NODE *p; int *a, *b; {$/
eread	reader.c	/^eread(){$/
exname	local.c	/^exname( p ) char *p; {$/
expand	match.c	/^expand( p, cookie, cp ) NODE *p;  register char *c/
falloc	pftn.c	/^falloc( p, w, new, pty )  register struct symtab */
ffld	reader.c	/^ffld( p, down, down1, down2 ) NODE *p; int *down1,/
fincode	local.c	/^fincode( d, sz ) double d; {$/
fixarg	stab.c	/^fixarg(p)$/
fixclass	pftn.c	/^fixclass( class, type ) TWORD type; {$/
fixtype	pftn.c	/^fixtype( p, class ) register NODE *p; {$/
fldal	code.c	/^fldal( t ) unsigned t; { \/* return the alignment o/
fldty	code.c	/^fldty( p ) struct symtab *p; { \/* fix up type of f/
floatconv	local2.c	/^floatconv( p )$/
flshape	local2.c	/^flshape( p ) register NODE *p; {$/
fortarg	optim.c	/^fortarg( p ) NODE *p; {$/
freereg	allo.c	/^freereg( p, n ) NODE *p; {$/
freetemp	allo.c	/^freetemp( k ){ \/* allocate k integers worth of tem/
ftnarg	pftn.c	/^ftnarg( idn ) {$/
ftnend	pftn.c	/^ftnend(){ \/* end of function *\/$/
genargs	order.c	/^genargs( p) register NODE *p; {$/
genbinary	code.c	/^genbinary(p,lo,hi,lab)$/
gencall	local2.c	/^gencall( p, cookie ) register NODE *p; {$/
geninfo	stab.c	/^private geninfo(p)$/
genscall	local2.c	/^genscall( p, cookie ) register NODE *p; {$/
genstruct	stab.c	/^private genstruct(t, structid, index, name, size)$/
genswitch	code.c	/^genswitch(p,n) register struct sw *p;{$/
gentype	stab.c	/^private gentype(sym)$/
getlab	code.c	/^getlab(){$/
getlr	match.c	/^getlr( p, c ) NODE *p; {$/
getstr	pftn.c	/^getstr(){ \/* decide if the string is external or a/
gotscal	pftn.c	/^gotscal(){$/
hardconv	local2.c	/^hardconv(p)$/
hardops	local2.c	/^hardops(p)  register NODE *p; {$/
hash	scan.c	/^hash(s)$/
hide	pftn.c	/^hide( p ) register struct symtab *p; {$/
hopcode	local2.c	/^hopcode( f, o ){$/
icons	trees.c	/^icons(p) register NODE *p; {$/
ilbrace	pftn.c	/^ilbrace(){ \/* process an initializer's left brace /
incode	local.c	/^incode( p, sz ) register NODE *p; {$/
indexreg	local2.c	/^indexreg( p ) register NODE *p; {$/
inforce	pftn.c	/^inforce( n ) OFFSZ n; {  \/* force inoff to have th/
inittypes	stab.c	/^private inittypes()$/
insput	local2.c	/^insput( p ) NODE *p; {$/
instk	pftn.c	/^instk( id, t, d, s, off ) OFFSZ off; TWORD t; {$/
irbrace	pftn.c	/^irbrace(){$/
isglobal	stab.c	/^#define isglobal(class) ( \\$/
ispow2	optim.c	/^ispow2( c ) CONSZ c; {$/
lastchance	local2.c	/^lastchance( p, cook ) NODE *p; {$/
lineid	local2.c	/^lineid( l, fn ) char *fn; {$/
locctr	code.c	/^locctr( l ){$/
lookup	pftn.c	/^lookup( name, s) char *name; { $/
lxcom	scan.c	/^lxcom(){$/
lxenter	scan.c	/^lxenter( s, m ) register char *s; register short m/
lxget	scan.c	/^# define lxget(c,m) (lxgcp=yytext,lxmore(c,m))$/
lxinit	scan.c	/^lxinit(){$/
lxmore	scan.c	/^lxmore( c, m )  register c, m; {$/
lxres	scan.c	/^lxres() {$/
lxstr	scan.c	/^lxstr(ct){$/
lxtitle	scan.c	/^lxtitle(){$/
mainp1	scan.c	/^mainp1( argc, argv ) int argc; char *argv[]; {  \/*/
mainp2	reader.c	/^mainp2( argc, argv ) char *argv[]; {$/
makety	trees.c	/^makety( p, t, d, s ) register NODE *p; TWORD t; {$/
maketype	stab.c	/^private maketype(name, tnum, eqtnum, lower, upper)/
markcall	reader.c	/^markcall( p ) register NODE *p; {  \/* mark off cal/
match	match.c	/^match( p, cookie ) NODE *p; {$/
max	order.c	/^# define max(x,y) ((x)<(y)?(y):(x))$/
min	order.c	/^# define min(x,y) ((x)<(y)?(x):(y))$/
mkadrs	order.c	/^mkadrs(p) register NODE *p; {$/
mknonuniq	pftn.c	/^mknonuniq(idindex) int *idindex; {\/* locate a symb/
mkrall	order.c	/^mkrall( p, r ) register NODE *p; {$/
mkty	cgram.c	/^mkty( t, d, s ) unsigned t; {$/
mlinit	match.c	/^mlinit(){$/
mlmatch	match.c	/^mlmatch( subtree, target, subtarget ) NODE * subtr/
moditype	trees.c	/^moditype( ty ) TWORD ty; {$/
moedef	pftn.c	/^moedef( idn ){$/
movestab	pftn.c	/^movestab( p, q ) register struct symtab *p, *q; {$/
myreader	local2.c	/^myreader(p) register NODE *p; {$/
ncopy	allo.c	/^ncopy( q, p ) NODE *p, *q; {$/
nextcook	local2.c	/^nextcook( p, cookie ) NODE *p; {$/
niceuty	order.c	/^niceuty( p ) register NODE *p; {$/
nidcl	pftn.c	/^nidcl( p ) NODE *p; { \/* handle unitialized declar/
nncon	optim.c	/^nncon( p ) NODE *p; {$/
notlval	trees.c	/^notlval(p) register NODE *p; {$/
notoff	order.c	/^notoff( t, r, off, cp) TWORD t; CONSZ off; char *c/
oalloc	pftn.c	/^oalloc( p, poff ) register struct symtab *p; regis/
oconvert	trees.c	/^oconvert(p) register NODE *p; {$/
offcon	local.c	/^offcon( off, t, d, s ) OFFSZ off; TWORD t; {$/
offstar	order.c	/^offstar( p ) register NODE *p; {$/
old_fixarg	stab.c	/^private old_fixarg(p)$/
old_outstab	stab.c	/^private old_outstab(p)$/
old_pfstab	stab.c	/^private old_pfstab(sname) $/
old_plcstab	stab.c	/^private old_plcstab(level) {$/
old_poffs	stab.c	/^private old_poffs(p)$/
old_prcstab	stab.c	/^private old_prcstab(level) {$/
old_psline	stab.c	/^private old_psline() {$/
old_pstab	stab.c	/^private old_pstab(name, type)$/
old_pstabdot	stab.c	/^private old_pstabdot(type, value)$/
opact	trees.c	/^opact( p )  NODE *p; {$/
optim	optim.c	/^optim(p) register NODE *p; {$/
optim2	local2.c	/^optim2( p )$/
order	reader.c	/^order(p,cook) NODE *p; {$/
oreg2	reader.c	/^oreg2( p ) register NODE *p; {$/
outstab	stab.c	/^outstab(sym)$/
outstruct	stab.c	/^outstruct(szindex, paramindex)$/
p2bbeg	reader.c	/^p2bbeg( aoff, myreg ) {$/
p2bend	reader.c	/^p2bend(){$/
p2compile	reader.c	/^p2compile( p ) NODE *p; {$/
p2init	reader.c	/^p2init( argc, argv ) char *argv[];{$/
p2tree	trees.c	/^p2tree(p) register NODE *p; {$/
pconvert	trees.c	/^pconvert( p ) register NODE *p; {$/
pfstab	stab.c	/^pfstab(sname) $/
plcstab	stab.c	/^plcstab(level)$/
popargs	local2.c	/^popargs( size ) register size; {$/
prcook	reader.c	/^prcook( cookie ){$/
prcstab	stab.c	/^prcstab(level)$/
prtdcon	trees.c	/^prtdcon( p ) register NODE *p; {$/
prtree	trees.c	/^prtree(p) register NODE *p; {$/
psave	pftn.c	/^psave( i ){$/
psize	trees.c	/^psize( p ) NODE *p; {$/
psline	stab.c	/^psline()$/
pstab	stab.c	/^pstab(name, type)$/
pstabdot	stab.c	/^pstabdot(type, value)$/
ptmatch	trees.c	/^ptmatch(p)  register NODE *p; {$/
putbyte	pftn.c	/^putbyte( v ){ \/* simulate byte v appearing in a li/
rallo	order.c	/^rallo( p, down ) register NODE *p; {$/
rbusy	allo.c	/^rbusy(r,t) TWORD t; {$/
rcount	reader.c	/^rcount(){ \/* count recursions *\/$/
rdin	reader.c	/^rdin( base ){$/
recl2	allo.c	/^recl2( p ) register NODE *p; {$/
reclaim	allo.c	/^reclaim( p, rw, cookie ) NODE *p; {$/
reentertype	stab.c	/^private reentertype(typeid, type, arrindex, strind/
relook	pftn.c	/^relook(p) register struct symtab *p; {  \/* look up/
resetbc	cgram.c	/^resetbc(mask){$/
rewfld	local2.c	/^rewfld( p ) NODE *p; {$/
rfree	allo.c	/^rfree( r, t ) TWORD t; {$/
rmove	local2.c	/^rmove( rt, rs, t ) TWORD t; {$/
rstruct	pftn.c	/^rstruct( idn, soru ){ \/* reference to a structure /
rwprint	allo.c	/^rwprint( rw ){ \/* print rewriting rule *\/$/
savebc	cgram.c	/^savebc() {$/
savestr	scan.c	/^savestr(cp)$/
scnames	xdefs.c	/^char * scnames( c ) register c; {$/
setasg	order.c	/^setasg( p ) register NODE *p; {$/
setasop	order.c	/^setasop( p ) register NODE *p; {$/
setbin	order.c	/^setbin( p ) register NODE *p; {$/
setincr	order.c	/^setincr( p ) NODE *p; {$/
setregs	local2.c	/^setregs(){ \/* set up temporary registers *\/$/
setrew	match.c	/^setrew(){$/
setstr	order.c	/^setstr( p ) register NODE *p; { \/* structure assig/
shareit	allo.c	/^shareit( p, r, n ) NODE *p; {$/
shltype	local2.c	/^shltype( o, p ) NODE *p; {$/
shortconv	local2.c	/^shortconv( p )$/
shtemp	local2.c	/^shtemp( p ) register NODE *p; {$/
shumul	local2.c	/^shumul( p ) register NODE *p; {$/
special	local2.c	/^special( p, shape ) register NODE *p; {$/
spsz	local2.c	/^spsz( t, v ) TWORD t; CONSZ v; {$/
stoarg	reader.c	/^stoarg( p, calltype ) register NODE *p; {$/
stoasg	order.c	/^stoasg( p, o ) register NODE *p; {$/
store	reader.c	/^store( p ) register NODE *p; {$/
strargs	trees.c	/^strargs( p ) register NODE *p;  { \/* rewrite struc/
stref	trees.c	/^stref( p ) register NODE *p; {$/
sucomp	order.c	/^sucomp( p ) register NODE *p; {$/
sw	local.c	/^#define sw(x) ((x>>16)&0xFFFF | (x<<16) & 0xFFFF00/
swend	cgram.c	/^swend(){ \/* end a switch block *\/$/
swstart	cgram.c	/^swstart(){$/
szty	local2.c	/^szty(t) TWORD t; { \/* size, in words, needed to ho/
talign	pftn.c	/^talign( ty, s) register unsigned ty; register s; {/
tcopy	allo.c	/^tcopy( p ) register NODE *p; {$/
test	test.c	/^private old_pfstab(sname) $$/
test2	test.c	/^short test2(a, b, c)$/
tshape	match.c	/^tshape( p, shape ) NODE *p; {$/
tsize	pftn.c	/^tsize( ty, d, s )  TWORD ty; {$/
ttype	match.c	/^ttype( t, tword ) TWORD t; {$/
tymatch	trees.c	/^tymatch(p)  register NODE *p; {$/
tymerge	pftn.c	/^tymerge( typ, idp ) NODE *typ, *idp; {$/
typelookup	stab.c	/^private Typeid typelookup(type, arrindex, strindex/
types	pftn.c	/^types( t1, t2, t3 ) TWORD t1, t2, t3; {$/
tyreduce	pftn.c	/^tyreduce( p ) register NODE *p; {$/
uclass	pftn.c	/^uclass( class ) register class; {$/
unhide	pftn.c	/^unhide( p ) register struct symtab *p; {$/
upoff	pftn.c	/^upoff( size, alignment, poff ) register alignment,/
upput	local2.c	/^upput( p ) NODE *p; {$/
usable	allo.c	/^usable( p, n, r ) NODE *p; {$/
ushare	allo.c	/^ushare( p, f, r ) NODE *p; {$/
vfdalign	pftn.c	/^vfdalign( n ){ \/* make inoff have the offset the n/
vfdzero	local.c	/^vfdzero( n ){ \/* define n bits of zeros in a vfd */
where	code.c	/^where(c){ \/* print location of error  *\/$/
yyaccpt	pftn.c	/^yyaccpt(){$/
yyerror	pftn.c	/^yyerror( s ) char *s; { \/* error printing routine /
yylex	scan.c	/^yylex(){$/
yyparse	cgram.c	/^yyparse() {$/
zecode	code.c	/^zecode( n ){$/
zero_length_array	stab.c	/^private Boolean zero_length_array(p)$/
zum	order.c	/^zum( p, zap ) register NODE *p; {$/
zzzcode	local2.c	/^zzzcode( p, c ) NODE *p; {$/
