pass2.c File Reference

#include "c.h"
#include "rcc.h"

Include dependency graph for pass2.c:

Go to the source code of this file.

Data Structures
struct	block
Defines
#define	T(x)   rcc_##x##_enum
#define	VERBOSE(n, arg)   (verbose >= n ? (void)(arg):(void)0)
#define	xx(s)
#define	xx(s)   0,
#define	xx(s)   static void do##s(rcc_interface_ty);
#define	xx(f, n)   p->f = symbol->flags>>n;
Functions
void	doAddress (rcc_interface_ty in)
void	doBlockbeg (rcc_interface_ty in)
void	doBlockend (rcc_interface_ty in)
void	doDefaddress (rcc_interface_ty in)
void	doDefconst (rcc_interface_ty in)
void	doDefconstf (rcc_interface_ty in)
void	doDeflabel (rcc_interface_ty in)
void	doDefstring (rcc_interface_ty in)
void	doExport (rcc_interface_ty in)
void	doForest (rcc_interface_ty in)
void	doFunction (rcc_interface_ty in)
void	doGlobal (rcc_interface_ty in)
void	doImport (rcc_interface_ty in)
void	doLocal (rcc_interface_ty in)
void	doSegment (rcc_interface_ty in)
void	doSpace (rcc_interface_ty in)
void	init (int argc, char *argv[])
void	interface (rcc_interface_ty in)
int	main (int argc, char *argv[])
void	main_init (int argc, char *argv[])
Symbol	uid2symbol (int uid)
void *	uid2type (int uid)
Node	visit (rcc_node_ty node)
	xx (Export)
Variables
int	Aflag
block *	blockstack
int	glevel
Interface *	IR = NULL
void **	itemmap
rcc_item_ty *	items
int	nuids
int	Pflag
int	verbose = 1
int	xref
Symbol	YYcheck
Symbol	YYnull

---

Define Documentation

#define T (  x   )     rcc_##x##_enum

Referenced by BadCond(), EmitBrushPrimitTextureCoordinates(), main(), PtrList::Ptr(), StrPtr::Ptr(), PtrList::Ref(), StrPtr::Ref(), TstCond(), and visit().

#define VERBOSE (  n, arg   )     (verbose >= n ? (void)(arg):(void)0)

Definition at line 18 of file pass2.c.

#define xx (  s   )

Value: assert(rcc_##s##_enum < sizeof doX/sizeof doX[0] && doX[rcc_##s##_enum]==0); \ doX[rcc_##s##_enum] = do##s; Definition at line 181 of file pass2.c.

#define xx (  s   )     0,

Definition at line 181 of file pass2.c.

#define xx (  s   )     static void do##s(rcc_interface_ty);

Definition at line 181 of file pass2.c.

#define xx (  f, n   )     p->f = symbol->flags>>n;

Definition at line 181 of file pass2.c.

---

Function Documentation

void doAddress (  rcc_interface_ty  in  )  [static]

Definition at line 256 of file pass2.c. References code::addr, interface::address, assert, code::base, code(), Code, cp, GLOBAL, in, IR, items, nuids, NULL, code::offset, p, symbol::sclass, symbol::scope, code::sym, Symbol, code::u, uid2symbol(), and symbol::v. { int uid = in->v.rcc_Address.uid; Symbol p = uid2symbol(in->v.rcc_Address.p); assert(uid >= 0 && uid < nuids); assert(items[uid] == NULL); items[uid] = rcc_Symbol(uid, in->v.rcc_Address.q); if (p->scope == GLOBAL || p->sclass == STATIC || p->sclass == EXTERN) (*IR->address)(uid2symbol(uid), p, in->v.rcc_Address.n); else { Code cp = code(Address); cp->u.addr.sym = uid2symbol(uid); cp->u.addr.base = p; cp->u.addr.offset = in->v.rcc_Address.n; } }

Here is the call graph for this function:

void doBlockbeg (  rcc_interface_ty  in  )  [static]

Definition at line 368 of file pass2.c. References b, block::begin, code::block, blockstack, code(), Code, cp, enterscope(), FUNC, code::identifiers, code::level, code::locals, NEW, newarray, block::prev, code::types, and code::u. { struct block *b; Code cp = code(Blockbeg); enterscope(); cp->u.block.level = level; cp->u.block.locals = newarray(1, sizeof *cp->u.block.locals, FUNC); cp->u.block.locals[0] = NULL; cp->u.block.identifiers = NULL; cp->u.block.types = NULL; NEW(b, FUNC); b->begin = cp; b->prev = blockstack; blockstack = b; }

Here is the call graph for this function:

void doBlockend (  rcc_interface_ty  in  )  [static]

Definition at line 384 of file pass2.c. References assert, block::begin, code::begin, blockstack, code(), exitscope(), block::prev, and code::u. { assert(blockstack); code(Blockend)->u.begin = blockstack->begin; blockstack = blockstack->prev; exitscope(); }

Here is the call graph for this function:

void doDefaddress (  rcc_interface_ty  in  )  [static]

Definition at line 277 of file pass2.c. References interface::defaddress, in, IR, and uid2symbol(). { (*IR->defaddress)(uid2symbol(in->v.rcc_Defaddress.p)); }

Here is the call graph for this function:

void doDefconst (  rcc_interface_ty  in  )  [static]

Definition at line 285 of file pass2.c. References interface::defconst, value::i, in, IR, v, and Value. { Value v; v.i = in->v.rcc_Defconst.value; (*IR->defconst)(in->v.rcc_Defconst.suffix, in->v.rcc_Defconst.size, v); }

void doDefconstf (  rcc_interface_ty  in  )  [static]

Definition at line 292 of file pass2.c. References value::d, interface::defconst, free(), in, IR, p, v, and Value. { Value v; unsigned *p = (unsigned *)&v.d; p[swap] = in->v.rcc_Defconstf.value->msb; p[1-swap] = in->v.rcc_Defconstf.value->lsb; (*IR->defconst)(F, in->v.rcc_Defconstf.size, v); free(in->v.rcc_Defconstf.value); }

Here is the call graph for this function:

void doDeflabel (  rcc_interface_ty  in  )  [static]

Definition at line 281 of file pass2.c. References interface::defaddress, findlabel(), in, and IR. { (*IR->defaddress)(findlabel(in->v.rcc_Deflabel.label)); }

Here is the call graph for this function:

void doDefstring (  rcc_interface_ty  in  )  [static]

Definition at line 302 of file pass2.c. References interface::defstring, free(), in, and IR. { (*IR->defstring)(in->v.rcc_Defstring.s.len, (char *)in->v.rcc_Defstring.s.str); free((char *)in->v.rcc_Defstring.s.str); }

Here is the call graph for this function:

void doExport (  rcc_interface_ty  in  )  [static]

Definition at line 227 of file pass2.c. References interface::export, in, IR, and uid2symbol(). { (*IR->export)(uid2symbol(in->v.rcc_Export.p)); }

Here is the call graph for this function:

void doForest (  rcc_interface_ty  in  )  [static]

Definition at line 498 of file pass2.c. References assert, code(), code::forest, i, in, node::link, n, Node, code::u, and visit(). { Node *tail = &code(Gen)->u.forest; int i, n = Seq_length(in->v.rcc_Forest.nodes); for (i = 0; i < n; i++) { *tail = visit(Seq_remlo(in->v.rcc_Forest.nodes)); assert(*tail); tail = &(*tail)->link; } *tail = NULL; Seq_free(&in->v.rcc_Forest.nodes); }

Here is the call graph for this function:

void doFunction (  rcc_interface_ty  in  )  [static]

Definition at line 311 of file pass2.c. References symbol::callee, cfunc, codelist, symbol::defined, enterscope(), exitscope(), symbol::f, free(), FUNC, interface::function, i, in, interface(), IR, LABELS, labels, n, newarray, code::next, NULL, Symbol, table(), symbol::u, and uid2symbol(). { int i, n; Symbol *caller, *callee; /* Initialize: define the function symbol, initialize callee and caller arrays. */ cfunc = uid2symbol(in->v.rcc_Function.f); labels = table(NULL, LABELS); enterscope(); n = Seq_length(in->v.rcc_Function.caller); caller = newarray(n + 1, sizeof *caller, FUNC); for (i = 0; i < n; i++) { int *uid = Seq_remlo(in->v.rcc_Function.caller); caller[i] = uid2symbol(*uid); free(uid); } caller[i] = NULL; Seq_free(&in->v.rcc_Function.caller); callee = newarray(n + 1, sizeof *callee, FUNC); for (i = 0; i < n; i++) { int *uid = Seq_remlo(in->v.rcc_Function.callee); callee[i] = uid2symbol(*uid); free(uid); } callee[i] = NULL; Seq_free(&in->v.rcc_Function.callee); cfunc->u.f.callee = callee; cfunc->defined = 1; /* Initialize the code list, traverse the interfaces inside the function; each call appends code list entries. */ codelist = &codehead; codelist->next = NULL; n = Seq_length(in->v.rcc_Function.codelist); for (i = 0; i < n; i++) interface(Seq_remlo(in->v.rcc_Function.codelist)); Seq_free(&in->v.rcc_Function.codelist); /* Call the back end, Wrap-up. */ exitscope(); (*IR->function)(cfunc, caller, callee, in->v.rcc_Function.ncalls); cfunc = NULL; labels = NULL; }

Here is the call graph for this function:

void doGlobal (  rcc_interface_ty  in  )  [static]

Definition at line 238 of file pass2.c. References symbol::defined, interface::global, in, IR, p, symbol::seg, Symbol, symbol::u, uid2symbol(), and symbol::v. { Symbol p = uid2symbol(in->v.rcc_Global.p); p->u.seg = in->v.rcc_Global.seg; (*IR->global)(p); p->defined = 1; }

Here is the call graph for this function:

void doImport (  rcc_interface_ty  in  )  [static]

Definition at line 231 of file pass2.c. References symbol::defined, interface::import, in, IR, p, Symbol, and uid2symbol(). { Symbol p = uid2symbol(in->v.rcc_Export.p); (*IR->import)(p); p->defined = 1; }

Here is the call graph for this function:

void doLocal (  rcc_interface_ty  in  )  [static]

Definition at line 246 of file pass2.c. References addlocal(), assert, in, items, nuids, NULL, uid2symbol(), and symbol::v. { int uid = in->v.rcc_Local.uid; assert(uid >= 0 && uid < nuids); assert(items[uid] == NULL); items[uid] = rcc_Symbol(uid, in->v.rcc_Local.p); if (in->v.rcc_Local.p->scope >= LOCAL) addlocal(uid2symbol(uid)); }

Here is the call graph for this function:

void doSegment (  rcc_interface_ty  in  )  [static]

Definition at line 273 of file pass2.c. References in, IR, and interface::segment. { (*IR->segment)(in->v.rcc_Segment.seg); }

void doSpace (  rcc_interface_ty  in  )  [static]

Definition at line 307 of file pass2.c. References in, IR, and interface::space. { (*IR->space)(in->v.rcc_Space.n); }

void init (  int  argc, char *  argv[] )

Definition at line 659 of file pass2.c. References argc, argv, main_init(), prof_init(), trace_init(), and type_init(). Referenced by Draw_ClearWindow(), Eclass_ForName(), main(), SV_RankBegin(), SV_RankUserCreate(), SV_RankUserLogin(), SV_RankUserValidate(), and UI_HeadCountByTeam(). { {extern void main_init(int, char *[]); main_init(argc, argv);} {extern void prof_init(int, char *[]); prof_init(argc, argv);} {extern void trace_init(int, char *[]); trace_init(argc, argv);} {extern void type_init(int, char *[]); type_init(argc, argv);} {extern void x86linux_init(int, char *[]); x86linux_init(argc, argv);} }

Here is the call graph for this function:

void interface (  rcc_interface_ty  in  )  [static]

Definition at line 221 of file pass2.c. References assert, free(), and in. Referenced by doFunction(), and main(). { assert(in); (*doX[in->kind])(in); free(in); }

Here is the call graph for this function:

int main (  int  argc, char *  argv[] )

Definition at line 511 of file pass2.c. References argc, argv, assert, bindings, count, deallocate(), errcnt, exit(), EXIT_FAILURE, fprint(), free(), freopen(), genlabel(), i, init(), interface(), IR, binding::ir, itemmap, items, j, level, name, binding::name, newarray, nuids, NULL, PERM, interface::progbeg, interface::progend, rcsid, stderr, stdin, stdout, strcmp(), strncmp(), strstr(), strtod(), interface::wants_dag, and xx. { int i, version; float stamp = (assert(strstr(rcsid, ",v")), strtod(strstr(rcsid, ",v")+2, NULL)) ; char *infile = NULL, *outfile = NULL; rcc_program_ty pickle; for (i = 1; i < argc; i++) if (*argv[i] != '-' || strcmp(argv[i], "-") == 0) { if (infile == NULL) infile = argv[i]; else if (outfile == NULL) outfile = argv[i]; } if (infile != NULL && strcmp(infile, "-") != 0 && freopen(infile, "rb", stdin) == NULL) { fprint(stderr, "%s: can't read `%s'\n", argv[0], infile); exit(EXIT_FAILURE); } #if WIN32 else _setmode(_fileno(stdin), _O_BINARY); #endif if (outfile != NULL && strcmp(outfile, "-") != 0 && freopen(outfile, "w", stdout) == NULL) { fprint(stderr, "%s: can't write `%s'\n", argv[0], outfile); exit(EXIT_FAILURE); } version = read_int(stdin); assert(version/100 == (int)stamp); pickle = rcc_read_program(stdin); argc = pickle->argc; argv = newarray(argc + 1, sizeof *argv, PERM); { for (i = 0; i < argc; i++) { string_ty *arg = Seq_remlo(pickle->argv); argv[i] = (char *)arg->str; free(arg); } argv[i] = NULL; assert(i == argc); Seq_free(&pickle->argv); } for (i = argc - 1; i > 0; i--) if (strncmp(argv[i], "-target=", 8) == 0) break; if (i > 0) { int j; for (j = 0; bindings[j].name && bindings[j].ir; j++) if (strcmp(&argv[i][8], bindings[j].name) == 0) { IR = bindings[j].ir; break; } } if (!IR) { fprint(stderr, "%s: unknown target", argv[0]); if (i > 0) fprint(stderr, " `%s'", &argv[i][8]); fprint(stderr, "; must specify one of\n"); for (i = 0; bindings[i].name; i++) fprint(stderr, "\t-target=%s\n", bindings[i].name); exit(EXIT_FAILURE); } IR->wants_dag = 0; /* pickle's hold trees */ init(argc, argv); genlabel(pickle->nlabels); level = GLOBAL; { int i, count; nuids = pickle->nuids; items = newarray(nuids, sizeof *items, PERM); itemmap = newarray(nuids, sizeof *items, PERM); for (i = 0; i < nuids; i++) { itemmap[i] = NULL; items[i] = NULL; } (*IR->progbeg)(argc, argv); count = Seq_length(pickle->items); for (i = 0; i < count; i++) { rcc_item_ty item = Seq_remlo(pickle->items); int uid = item->uid; assert(uid >= 0 && uid < nuids); assert(items[uid] == NULL); items[uid] = item; } Seq_free(&pickle->items); #define xx(s) assert(rcc_##s##_enum < sizeof doX/sizeof doX[0] && doX[rcc_##s##_enum]==0); \ doX[rcc_##s##_enum] = do##s; xx(Export) xx(Import) xx(Global) xx(Local) xx(Address) xx(Segment) xx(Defaddress) xx(Deflabel) xx(Defconst) xx(Defconstf) xx(Defstring) xx(Space) xx(Function) xx(Blockbeg) xx(Blockend) xx(Forest) #undef xx count = Seq_length(pickle->interfaces); for (i = 0; i < count; i++) interface(Seq_remlo(pickle->interfaces)); Seq_free(&pickle->interfaces); free(pickle); (*IR->progend)(); } deallocate(PERM); return errcnt > 0; }

Here is the call graph for this function:

void main_init (  int  argc, char *  argv[] )

Definition at line 628 of file pass2.c. References argv, assert, errlimit, exit(), EXIT_FAILURE, f, fclose(), fopen(), fprint(), freopen(), glevel, i, NULL, rcsid, stderr, strcmp(), strncmp(), strtol(), verbose, wflag, and x. Referenced by init(), and input_init(). { int i; static int inited; if (inited) return; inited = 1; for (i = 1; i < argc; i++) if (strcmp(argv[i], "-g") == 0 || strcmp(argv[i], "-g2") == 0) glevel = 2; else if (strcmp(argv[i], "-w") == 0) wflag++; else if (strcmp(argv[i], "-v") == 0) { fprint(stderr, "%s %s\n", argv[0], rcsid); verbose++; } else if (strncmp(argv[i], "-errout=", 8) == 0) { FILE *f = fopen(argv[i]+8, "w"); if (f == NULL) { fprint(stderr, "%s: can't write errors to `%s'\n", argv[0], argv[i]+8); exit(EXIT_FAILURE); } fclose(f); f = freopen(argv[i]+8, "w", stderr); assert(f); } else if (strncmp(argv[i], "-e", 2) == 0) { int x; if ((x = strtol(&argv[i][2], NULL, 0)) > 0) errlimit = x; } }

Here is the call graph for this function:

Symbol uid2symbol (  int  uid  )  [static]

Definition at line 147 of file pass2.c. References assert, CONSTANTS, interface::defsymbol, free(), GLOBAL, IR, itemmap, items, kind, LABELS, symbol::name, NEW0, nuids, p, PERM, symbol::ref, symbol::sclass, symbol::scope, Symbol, temporary(), symbol::type, uid2type(), symbol::v, and xx. Referenced by doAddress(), doDefaddress(), doExport(), doFunction(), doGlobal(), doImport(), doLocal(), and visit(). { assert(uid >= 0 && uid < nuids); if (itemmap[uid] == NULL) { Symbol p; rcc_symbol_ty symbol; assert(items[uid]); assert(items[uid]->uid == uid); assert(items[uid]->kind == rcc_Symbol_enum); symbol = items[uid]->v.rcc_Symbol.symbol; assert(symbol); NEW0(p, PERM); p->name = (char *)symbol->id; p->scope = symbol->scope; p->sclass = symbol->sclass; p->type = uid2type(symbol->type); #define xx(f,n) p->f = symbol->flags>>n; xx(structarg,0) xx(addressed,1) xx(computed,2) xx(temporary,3) xx(generated,4) #undef xx p->ref = symbol->ref/10000.0; assert(p->scope != CONSTANTS && p->scope != LABELS); if (p->scope == GLOBAL || p->sclass == STATIC || p->sclass == EXTERN) (*IR->defsymbol)(p); itemmap[uid] = p; free(symbol); free(items[uid]); items[uid] = NULL; } return itemmap[uid]; }

Here is the call graph for this function:

void* uid2type (  int  uid  )  [static]

Definition at line 23 of file pass2.c. References type::align, array(), assert, btot(), symbol::cfields, CONST, e, ENUM, field(), Field, fields, symbol::flist, FLOAT, free(), func(), GLOBAL, i, identifiers, symbol::idlist, install(), INT, isconst, isvolatile, itemmap, items, kind, field::link, n, field::name, NEW0, newarray, newstruct(), nuids, NULL, p, PERM, ptr(), qual(), symbol::s, symbol::sclass, type::size, string(), STRUCT, type::sym, Symbol, tree::type, symbol::type, type::type, type, Type, symbol::u, type::u, UNION, UNSIGNED, symbol::value, symbol::vfields, and VOLATILE. Referenced by uid2symbol(), and visit(). { assert(uid >= 0 && uid < nuids); if (itemmap[uid] == NULL) { Type ty; rcc_type_ty type = (void *)items[uid]; assert(items[uid]); assert(items[uid]->uid == uid); assert(items[uid]->kind == rcc_Type_enum); type = items[uid]->v.rcc_Type.type; assert(type); switch (type->kind) { case rcc_INT_enum: ty = btot(INT, type->size); assert(ty->align == type->align); break; case rcc_UNSIGNED_enum: ty = btot(UNSIGNED, type->size); assert(ty->align == type->align); break; case rcc_FLOAT_enum: ty = btot(FLOAT, type->size); assert(ty->align == type->align); break; case rcc_VOID_enum: ty = voidtype; break; case rcc_POINTER_enum: ty = ptr(uid2type(type->v.rcc_POINTER.type)); break; case rcc_ARRAY_enum: ty = uid2type(type->v.rcc_ARRAY.type); assert(ty->size > 0); ty = array(ty, type->size/ty->size, 0); break; case rcc_CONST_enum: ty = qual(CONST, uid2type(type->v.rcc_CONST.type)); break; case rcc_VOLATILE_enum: ty = qual(VOLATILE, uid2type(type->v.rcc_VOLATILE.type)); break; case rcc_ENUM_enum: { int i, n = Seq_length(type->v.rcc_ENUM.ids); ty = newstruct(ENUM, string(type->v.rcc_ENUM.tag)); ty->type = inttype; ty->size = ty->type->size; ty->align = ty->type->align; ty->u.sym->u.idlist = newarray(n + 1, sizeof *ty->u.sym->u.idlist, PERM); for (i = 0; i < n; i++) { rcc_enum__ty e = Seq_remlo(type->v.rcc_ENUM.ids); Symbol