BUSY	allo.c	?^#define BUSY(i)  (busy[i].areg | busy[i].dreg | bu?
CCTEST	cost.c	?^# define CCTEST(q) 1$?
CCTRANS	scan.c	?^# define CCTRANS(x) (x)$?
CLOAD	cost.c	?^# define CLOAD(q) 2$?
CSTORE	cost.c	?^# define CSTORE(q) 2$?
ENUMSIZE	pftn.c	?^# define ENUMSIZE(h,l) INT$?
FLOATCVT	scan.c	?^# define FLOATCVT(x) atof(x)$?
GETS	cost.c	?^# define GETS(x,y) if( e2debug>1) printf( "	" #x "?
GETSN	cost.c	?^# define GETSN(x,y) if( e2debug>1) printf( "	cst[%?
GETSTR	cost.c	?^# define GETSTR(x,y) if( e2debug>1) printf( "	strb?
ISCON	optim.c	?^# define ISCON(p) (p->in.op==ICON)$?
LEG1	grey.c	?^#define LEG1(p)		(RTOL(p->in.op) ? p->in.right : p?
LEG2	grey.c	?^#define LEG2(p)		(RTOL(p->in.op) ? p->in.left : p-?
MAX	cost.c	?^#define MAX(a)  (a[0]>a[1]?(a[0]>a[2]?a[0]:a[2]):(?
MIN	cost.c	?^#define MIN(a)  (a[0]<a[1]?(a[0]<a[2]?a[0]:a[2]):(?
OUTPUT	iconmul.c	?^#define OUTPUT(x) {if(costing) icount++; else outp?
REPORT	optim.c	?^# define REPORT(x) if(opdebug)printf( "optim turns?
RTOL	grey.c	?^#define	RTOL(op)	(op==CALL)$?
YYBACKUP	cgram.c	?^#define YYBACKUP( newtoken, newvalue )\\$?
YYRECOVERING	cgram.c	?^#define YYRECOVERING()	(!!yyerrflag)$?
aadjust	optim.c	?^aadjust( p, adj )$?
addcase	cgram.c	?^addcase(p) NODE *p; { /* add case to switch */$?
adddef	cgram.c	?^adddef(){ /* add default case to switch */$?
adjust	optim.c	?^adjust( p, adj )$?
allchk	allo.c	?^allchk()$?
allo	allo.c	?^allo( p, q )$?
allo0	allo.c	?^allo0()$?
andeff	reader.c	?^andeff(p)$?
arg_install	inline.c	?^arg_install(name, p, class)$?
argsize	allo.c	?^argsize( p )$?
ary_strbyte	pftn.c	?^ary_strbyte( v )$?
asave	pftn.c	?^asave( i )$?
asmout	scan.c	?^asmout()$?
bccode	optim.c	?^bccode()$?
bcon	trees.c	?^bcon( i )$?
bcost	cost.c	?^bcost( p, q )$?
bdty	cgram.c	?^bdty( op, p, v ) NODE *p; {$?
beginit	pftn.c	?^beginit(curid)$?
bg_file	scan.c	?^bg_file()$?
bigsize	trees.c	?^bigsize( t )$?
block	trees.c	?^block( o, l, r, t, d, s, tq )$?
bprt	cost.c	?^bprt( p, q, i )$?
bpsize	trees.c	?^bpsize(p)$?
bstruct	pftn.c	?^bstruct( idn, soru )$?
buildtree	trees.c	?^buildtree( o, l, r )$?
bump_enum	pftn.c	?^int $?
c2bigger	cgen.c	?^c2bigger( p ) NODE *p; {$?
cbigger	trees.c	?^cbigger( p )$?
ccast	trees.c	?^ccast( v, t )$?
cfix	cgen.c	?^cfix( p, goal )$?
checkst	pftn.c	?^checkst(lev)$?
chkpun	trees.c	?^chkpun(p)$?
chkstr	trees.c	?^chkstr( i, j, type )$?
clearst	pftn.c	?^clearst( lev )$?
clmacst	inline.c	?^clmacst()$?
codgen	cgen.c	?^codgen( p )$?
combo	trees.c	?^combo( s, p )$?
commute	cost.c	?^commute( p ) NODE *p; {$?
compatible_types	trees.c	?^compatible_types(t1, t2)$?
condit	reader.c	?^condit( p, goal, t, f )$?
conval	trees.c	?^conval( p )$?
convert	trees.c	?^convert( p, f )$?
costs	cost.c	?^costs( p ) register NODE *p; {$?
cprt	reader.c	?^cprt( c, s )$?
ctype	pftn.c	?^ctype( t )$?
dclargs	pftn.c	?^dclargs()$?
dclstruct	pftn.c	?^dclstruct( oparam )$?
decomp_type	cgram.c	?^int $?
defid	pftn.c	?^defid( q, class )$?
dlabel	reader.c	?^dlabel( p, l )$?
do_argty	trees.c	?^do_argty( p )$?
do_pragma	scan.c	?^do_pragma()$?
doinit	pftn.c	?^doinit( p )$?
doptim	optim.c	?^doptim(p)$?
doszof	trees.c	?^doszof( p )$?
dstash	cgram.c	?^dstash( n ){ /* put n into the dimension table */$?
e1print	trees.c	?^e1print( p ,s)$?
e222print	reader.c	?^e222print( down, p, s )$?
e22print	reader.c	?^e22print( p ,s)$?
e2print	reader.c	?^e2print( p )$?
eatline	scan.c	?^eatline()$?
ecode	trees.c	?^ecode( p )$?
ecomp	trees.c	?^ecomp( p )$?
econvert	trees.c	?^econvert( p )$?
endinit	pftn.c	?^endinit()$?
eprint	trees.c	?^eprint(p)$?
equ_struct	pftn.c	?^equ_struct( st1, st2 )$?
eread	reader.c	?^eread()$?
exceptn	iconmul.c	?^exceptn( temp2, mask )$?
expand	match.c	?^expand( p, goal, cp, q )$?
expmac	inline.c	?^expmac()$?
falloc	pftn.c	?^falloc( p, w, new, pty )$?
fcond	reader.c	?^fcond( p )$?
findsub	cost.c	?^findsub( p, s )$?
fixclass	pftn.c	?^fixclass( class, type, regflag )$?
fixtype	pftn.c	?^fixtype( p, class )$?
force	reader.c	?^force(p)$?
fortarg	optim.c	?^fortarg( p )$?
freepair	allo.c	?^freepair( p, n )$?
freereg	allo.c	?^freereg( p, n )$?
freetemp	allo.c	?^freetemp( k )$?
ftnarg	pftn.c	?^ftnarg( idn ) $?
ftnend	pftn.c	?^ftnend()$?
genbr	reader.c	?^genbr( o, l, p )$?
genfargs	inline.c	?^genfargs(p)$?
genicall	inline.c	?^genicall(p, goal)$?
getadr	match.c	?^getadr( p, pc )$?
getchar	scan.c	?^#define	getchar()	(*linecp ? *linecp++ : eatline()?
getlab	trees.c	?^getlab()$?
getlr	match.c	?^getlr( p, c )$?
getnth	inline.c	?^getnth(p, n)$?
getstr	pftn.c	?^getstr()$?
gettok	inline.c	?^gettok(ps)$?
gotscal	pftn.c	?^gotscal()$?
grey	grey.c	?^grey( p )$?
gtb	reader.c	?^gtb( p, l )$?
hash	scan.c	?^hash( s )	/* look for s in seg. hash tables.  Not ?
hiddengen	pftn.c	?^hiddengen(do_sdb)$?
hide	pftn.c	?^hide( p )$?
iargmatch	inline.c	?^iargmatch(s, p)$?
icon_overflow	trees.c	?^icon_overflow(p, dfltmsg )$?
icongen	iconmul.c	?^icongen()$?
iconmulg	iconmul.c	?^iconmulg( value, sz, sn, tn)$?
iconmult	iconmul.c	?^iconmult(value)$?
icons	trees.c	?^icons(p)$?
ilbrace	pftn.c	?^ilbrace()$?
ind2type	cgen.c	?^ind2type( h, p )$?
indtype	trees.c	?^indtype( t )$?
inforce	pftn.c	?^inforce( n )$?
inlexpand	inline.c	?^inlexpand(p, goal)$?
inscope	pftn.c	?^inscope(chksym,lvl)$?
insout	cost.c	?^insout( p, i )$?
insprt	cgen.c	?^insprt()$?
instk	pftn.c	?^instk( id, t, tq, d, s, off )$?
irbrace	pftn.c	?^irbrace()$?
is_ary	pftn.c	?^is_ary(t)$?
is_const	pftn.c	?^is_const(q)$?
is_ftn	pftn.c	?^is_ftn(t)$?
is_ptr	pftn.c	?^is_ptr(t)$?
is_volatile	reader.c	?^is_volatile(q)$?
iseff	cgen.c	?^iseff( p )$?
ispow2	optim.c	?^ispow2( c ) $?
istnode	cgen.c	?^# define istnode(p) (p->in.op==REG && istreg(p->tn?
lhsok	cost.c	?^lhsok( p )$?
lhsto	cgen.c	?^lhsto( p )$?
locctr	trees.c	?^locctr(l)$?
lookup	pftn.c	?^lookup( name, s)$?
loseval_chk	trees.c	?^loseval_chk( p )$?
lvalcmp	grey.c	?^lvalcmp( one, two )$?
lvalsrch	grey.c	?^static int $?
lxcom	scan.c	?^lxcom()$?
lxenter	scan.c	?^lxenter( s, m )$?
lxget	scan.c	?^# define lxget(c,m) (lxgcp=yytext,lxmore(c,m))$?
lxinit	scan.c	?^lxinit()$?
lxmore	scan.c	?^lxmore( c, m )$?
lxres	scan.c	?^lxres()$?
lxstr	scan.c	?^lxstr(ct)$?
lxtitle	scan.c	?^lxtitle()$?
mac_lookup	inline.c	?^mac_lookup(name)$?
mainp1	scan.c	?^mainp1( argc, argv )$?
mainp2	reader.c	?^mainp2( argc, argv ) char *argv[]; $?
makety	trees.c	?^makety( p, t, d, s )$?
markbusy	allo.c	?^markbusy( i, t)$?
match	match.c	?^match( p, q )$?
mklabnode	inline.c	?^mklabnode()$?
mknonuniq	pftn.c	?^mknonuniq(idindex)$?
mkspace	pftn.c	?^mkspace( p )$?
mkty	cgram.c	?^mkty( t, d, s, tq ) unsigned t; {$?
mode_init	scan.c	?^mode_init(mode)$?
moditype	trees.c	?^moditype( ty )$?
moedef	pftn.c	?^moedef( idn )$?
movestab	pftn.c	?^movestab( p, q )$?
mspine	match.c	?^mspine( ps, p, flag, ppls )$?
nidcl	pftn.c	?^nidcl( p )$?
nncon	optim.c	?^nncon( p )$?
nonest	cgen.c	?^nonest( p )$?
noresult	match.c	?^noresult( s )$?
not_intval	trees.c	?^int $?
notlval	trees.c	?^notlval(p)$?
oalloc	pftn.c	?^oalloc( p, poff, spec_align )$?
oconvert	trees.c	?^oconvert(p)$?
offcon	optim.c	?^offcon( off, t, d, s )$?
opact	trees.c	?^opact( p )$?
optim	optim.c	?^optim( p )$?
oreff	reader.c	?^oreff(p)$?
output	iconmul.c	?^output(str)$?
outshp	cgen.c	?^outshp( pp )$?
p2bbeg	reader.c	?^p2bbeg( aoff, myreg ) $?
p2bend	reader.c	?^p2bend()$?
p2compile	reader.c	?^p2compile( p )$?
p2init	reader.c	?^p2init( argc, argv )$?
p2tree	trees.c	?^p2tree(p)$?
pcllist	inline.c	?^pcllist(s, p, pcurarg)$?
pconvert	trees.c	?^pconvert( p, ftnarg )$?
pfargs	inline.c	?^pfargs(s, p, pcurarg )$?
pop	grey.c	?^pop( subtree )$?
ppcontrol	scan.c	?^ppcontrol( c )$?
preff	cgen.c	?^preff(c)$?
prgoal	reader.c	?^prgoal( goal ) $?
protect	cgen.c	?^protect(on)$?
prototypes	proto.c	?^function prototypes. Doing that we achieve that "c?
prtdcon	trees.c	?^prtdcon( p )$?
prtree	trees.c	?^prtree(p) register NODE *p; {$?
psave	pftn.c	?^psave( i )$?
psize	trees.c	?^psize( p )$?
pstrat	cost.c	?^pstrat( s ) {$?
ptmatch	trees.c	?^ptmatch(p)$?
push_lval	grey.c	?^push_lval( p )$?
push_sideff	grey.c	?^push_sideff( p )$?
putbyte	pftn.c	?^putbyte( v )$?
pvconvert	optim.c	?^pvconvert( p )$?
qprint	pftn.c	?^qprint( tq )$?
rbusy	allo.c	?^rbusy( r, t )$?
rcomma	reader.c	?^rcomma( p )$?
rdin	reader.c	?^rdin( base )$?
reclaim	allo.c	?^reclaim( p, rw, goal )$?
regargs	pftn.c	?^regargs()$?
regrcl	allo.c	?^regrcl( p )$?
relook	pftn.c	?^relook(p)$?
resetbc	cgram.c	?^resetbc(mask){$?
restrip	match.c	?^restrip( pls )$?
rewass	cgen.c	?^rewass( p )$?
rewcom	cgen.c	?^rewcom( p, goal )$?
reweop	cgen.c	?^reweop( p )$?
rewlhs	cgen.c	?^rewlhs(p)$?
rewsto	cgen.c	?^rewsto(p)$?
rfree	allo.c	?^rfree( r, t )$?
rmside	match.c	?^rmside( p )$?
rscost	cost.c	?^rscost( ureg, pp )$?
rstruct	pftn.c	?^rstruct( idn, soru )$?
rtspine	match.c	?^rtspine( ps, p )$?
rwprint	allo.c	?^rwprint( rw )$?
salign	pftn.c	?^salign( ty, s)$?
sameregtype	allo.c	?^sameregtype(x,y)$?
savebc	cgram.c	?^savebc() {$?
savestr	scan.c	?^savestr( cp )			/* place string into permanent str?
scnames	xdefs.c	?^scnames( c )$?
sconvert	optim.c	?^sconvert( p )$?
seq	reader.c	?^seq( p1, p2 )$?
sequence_point	grey.c	?^sequence_point( op )$?
setregtype	cost.c	?^setregtype( t )$?
shared	allo.c	?^shared( p )$?
shareit	allo.c	?^shareit( p, r, n )$?
shiftl	iconmul.c	?^shiftl( siz )$?
shpr	cost.c	?^shpr(sp) register SHAPE *sp; {$?
side_eff	grey.c	?^side_eff( op )$?
simpstr	optim.c	?^simpstr( d, s ) $?
smspine	match.c	?^smspine( s, p, flag )$?
spitline	scan.c	?^spitline(l)$?
spshape	match.c	?^spshape( sh, p )$?
squirrelmacro	inline.c	?^squirrelmacro(name) 	/* called from grammar to put?
stocm	cgen.c	?^stocm( p )$?
str_expr	trees.c	?^str_expr( p )$?
strargs	trees.c	?^strargs( p, off )$?
stref	trees.c	?^stref( p )$?
sub0s	iconmul.c	?^sub0s( num )$?
subcall	cgen.c	?^subcall( p )$?
subregs	cost.c	?^subregs( ureg, t )$?
subtree_restore	grey.c	?^subtree_restore( array, save, low, high, max )$?
subtree_save	grey.c	?^subtree_save( array, save, low, high )$?
sumreg	cost.c	?^sumreg( i, regs )$?
swend	cgram.c	?^swend(){ /* end a switch block */$?
swstart	cgram.c	?^swstart(){$?
t2print	reader.c	?^t2print( t )$?
tabpr	cgen.c	?^tabpr()$?
talign	pftn.c	?^talign( ty, s)$?
tcond	reader.c	?^tcond( p )$?
tcopy	allo.c	?^tcopy( p )$?
tdef_look	scan.c	?^tdef_look()$?
tempok	match.c	?^tempok( p )$?
tprint	trees.c	?^tprint( out, t )$?
traverse	grey.c	?^traverse( p, lhs )$?
tsize	pftn.c	?^tsize( ty, d, s )$?
ttype	match.c	?^ttype( t )$?
tydown	optim.c	?^tydown( p )$?
tymatch	trees.c	?^tymatch(p)$?
tymerge	pftn.c	?^tymerge( typ, idp )$?
type_category	pftn.c	?^int $?
type_quals	pftn.c	?^type_quals( tq, newtq, tqshift )$?
types	pftn.c	?^types()$?
tyreduce	pftn.c	?^tyreduce( p )$?
uclass	pftn.c	?^uclass( class ) $?
unconvert	trees.c	?^unconvert( p, q )$?
ungetc	scan.c	?^#define	ungetc(c, ioptr)	*--linecp=(c)$?
unhide	pftn.c	?^unhide( p )$?
unlong	optim.c	?^unlong(p)$?
upoff	pftn.c	?^upoff( size, alignment, poff )$?
usable	allo.c	?^usable( p, n, r )$?
user_need	match.c	?^user_need( p,q )$?
ushare	allo.c	?^ushare( p, r ,t )$?
ustrip	match.c	?^ustrip( o )$?
vfdalign	pftn.c	?^vfdalign( n )$?
volatile_chk	cgen.c	?^volatile_chk( p )$?
whatn	inline.c	?^whatn( argname )$?
xicolon	trees.c	?^xicolon( l, r1, r2 ) register NODE *l, *r1, *r2;$?
yyaccpt	pftn.c	?^yyaccpt()$?
yyerror	pftn.c	?^yyerror( s ) char *s; $?
yylex	scan.c	?^yylex()$?
yyparse	cgram.c	?^yyparse()$?
