stmt.c File Reference

#include "c.h"

Include dependency graph for stmt.c:

Go to the source code of this file.

Defines
#define	den(i, j)   ((j-buckets[i]+1.0)/(v[j]-v[buckets[i]]+1))
#define	SWSIZE   512
Functions
void	addlocal (Symbol p)
void	branch (int lab)
void	caselabel (Swtch, long, int)
void	cmp (int, Symbol, long, int)
Code	code (int kind)
Tree	conditional (int)
void	definelab (int lab)
void	definept (Coordinate *p)
void	dostmt (int, Swtch, int)
int	equal (Symbol, Symbol)
void	equatelab (Symbol old, Symbol new)
int	foldcond (Tree e1, Tree e2)
void	forstmt (int, Swtch, int)
void	ifstmt (int, int, Swtch, int)
Node	jump (int lab)
Symbol	localaddr (Tree)
int	reachable (int kind)
void	retcode (Tree p)
void	statement (int loop, Swtch swp, int lev)
void	stmtlabel (void)
void	swcode (Swtch swp, int b[], int lb, int ub)
void	swgen (Swtch swp)
void	swstmt (int, int, int)
void	whilestmt (int, Swtch, int)
Variables
code	codehead = { Start }
Code	codelist = &codehead
float	density = 0.5
Table	stmtlabs

---

Define Documentation

#define den (  i, j   )     ((j-buckets[i]+1.0)/(v[j]-v[buckets[i]]+1))

Definition at line 6 of file stmt.c. Referenced by PM_CrashLand(), and swgen().

#define SWSIZE   512

Definition at line 4 of file stmt.c. Referenced by swstmt().

---

Function Documentation

void addlocal (  Symbol  p  )

Definition at line 51 of file stmt.c. References code(), symbol::defined, p, symbol::scope, Symbol, code::u, and code::var. Referenced by addrtree(), doLocal(), listnodes(), retcode(), swstmt(), tracecall(), and undag(). { if (!p->defined) { code(Local)->u.var = p; p->defined = 1; p->scope = level; } }

Here is the call graph for this function:

void branch (  int  lab  )

Definition at line 565 of file stmt.c. References assert, code(), Code, codelist, cp, equal(), equatelab(), findlabel(), code::forest, jump(), code::kind, LABEL, code::next, NULL, node::op, p, code::prev, symbol::ref, Symbol, node::syms, code::u, V, walk(), and warning(). Referenced by forstmt(), ifstmt(), statement(), swcode(), swstmt(), and whilestmt(). { Code cp; Symbol p = findlabel(lab); assert(lab); walk(NULL, 0, 0); code(Label)->u.forest = jump(lab); for (cp = codelist->prev; cp->kind < Label; ) cp = cp->prev; while ( cp->kind == Label && cp->u.forest->op == LABEL+V && !equal(cp->u.forest->syms[0], p)) { equatelab(cp->u.forest->syms[0], p); assert(cp->next); assert(cp->prev); cp->prev->next = cp->next; cp->next->prev = cp->prev; cp = cp->prev; while (cp->kind < Label) cp = cp->prev; } if (cp->kind == Jump || cp->kind == Switch) { p->ref--; codelist->prev->next = NULL; codelist = codelist->prev; } else { codelist->kind = Jump; if (cp->kind == Label && cp->u.forest->op == LABEL+V && equal(cp->u.forest->syms[0], p)) warning("source code specifies an infinite loop"); } }

Here is the call graph for this function:

void caselabel (  Swtch  , long  , int  )  [static]

Definition at line 363 of file stmt.c. References Aflag, error(), findlabel(), FUNC, k, swtch::labels, labs(), swtch::ncases, newarray, swtch::size, Swtch, Symbol, vals, swtch::values, and warning(). { int k; if (swp->ncases >= swp->size) { long *vals = swp->values; Symbol *labs = swp->labels; swp->size *= 2; swp->values = newarray(swp->size, sizeof *swp->values, FUNC); swp->labels = newarray(swp->size, sizeof *swp->labels, FUNC); for (k = 0; k < swp->ncases; k++) { swp->values[k] = vals[k]; swp->labels[k] = labs[k]; } } k = swp->ncases; for ( ; k > 0 && swp->values[k-1] >= val; k--) { swp->values[k] = swp->values[k-1]; swp->labels[k] = swp->labels[k-1]; } if (k < swp->ncases && swp->values[k] == val) error("duplicate case label `%d'\n", val); swp->values[k] = val; swp->labels[k] = findlabel(lab); ++swp->ncases; if (Aflag >= 2 && swp->ncases == 258) warning("more than 257 cases in a switch\n"); }

Here is the call graph for this function:

void cmp (  int  , Symbol  , long  , int  )  [static]

Definition at line 474 of file stmt.c. References cast(), cnsttree(), eqtree(), idtree(), listnodes(), n, op, p, signedint(), Symbol, symbol::type, and Type. { Type ty = signedint(p->type); listnodes(eqtree(op, cast(idtree(p), ty), cnsttree(ty, n)), lab, 0); }

Here is the call graph for this function:

Code code (  int  kind  )

Definition at line 25 of file stmt.c. References Code, codelist, cp, FUNC, code::kind, kind, NEW, code::next, code::prev, reachable(), and warning(). Referenced by addlocal(), addrtree(), branch(), compound(), definelab(), definept(), doAddress(), doBlockbeg(), doBlockend(), doForest(), swcode(), swstmt(), and walk(). { Code cp; if (!reachable(kind)) warning("unreachable code\n"); NEW(cp, FUNC); cp->kind = kind; cp->prev = codelist; cp->next = NULL; codelist->next = cp; codelist = cp; return cp; }

Here is the call graph for this function:

Tree conditional (  int   )  [static]

Definition at line 237 of file stmt.c. References Aflag, cond(), expr(), funcname(), isfunc, p, Tree, tree::type, and warning(). Referenced by dostmt(), forstmt(), ifstmt(), and whilestmt(). { Tree p = expr(tok); if (Aflag > 1 && isfunc(p->type)) warning("%s used in a conditional expression\n", funcname(p)); return cond(p); }

Here is the call graph for this function:

void definelab (  int  lab  )

Definition at line 534 of file stmt.c. References ADDRG, assert, code(), Code, codelist, cp, findlabel(), code::forest, node::kids, code::kind, symbol::l, symbol::label, LABEL, newnode(), code::next, NULL, node::op, P, p, code::prev, symbol::ref, specific, Symbol, node::syms, symbol::u, code::u, V, and walk(). Referenced by dostmt(), forstmt(), funcdefn(), ifstmt(), statement(), stmtlabel(), swcode(), swstmt(), and whilestmt(). { Code cp; Symbol p = findlabel(lab); assert(lab); walk(NULL, 0, 0); code(Label)->u.forest = newnode(LABEL+V, NULL, NULL, p); for (cp = codelist->prev; cp->kind <= Label; ) cp = cp->prev; while ( cp->kind == Jump && cp->u.forest->kids[0] && specific(cp->u.forest->kids[0]->op) == ADDRG+P && cp->u.forest->kids[0]->syms[0] == p) { assert(cp->u.forest->kids[0]->syms[0]->u.l.label == lab); p->ref--; assert(cp->next); assert(cp->prev); cp->prev->next = cp->next; cp->next->prev = cp->prev; cp = cp->prev; while (cp->kind <= Label) cp = cp->prev; } }

Here is the call graph for this function:

void definept (  Coordinate *  p  )

Definition at line 58 of file stmt.c. References apply(), code(), Code, Coordinate, cp, e, events, coord::file, findcount(), glevel, identifiers, listnodes(), locus(), n, ncalled, p, code::point, Events::points, reachable(), refinc, code::src, Tree, code::u, coord::x, and coord::y. Referenced by compound(), dcllocal(), dostmt(), forstmt(), ifstmt(), statement(), swstmt(), and whilestmt(). { Code cp = code(Defpoint); cp->u.point.src = p ? *p : src; cp->u.point.point = npoints; if (ncalled > 0) { int n = findcount(cp->u.point.src.file, cp->u.point.src.x, cp->u.point.src.y); if (n > 0) refinc = (float)n/ncalled; } if (glevel > 2) locus(identifiers, &cp->u.point.src); if (events.points && reachable(Gen)) { Tree e = NULL; apply(events.points, &cp->u.point.src, &e); if (e) listnodes(e, 0, 0); } }

Here is the call graph for this function:

void dostmt (  int  , Swtch  , int  )  [static]

Definition at line 611 of file stmt.c. References conditional(), definelab(), definept(), expect(), findlabel(), gettok(), NULL, symbol::ref, refinc, statement(), Swtch, t, and walk(). Referenced by statement(). { refinc *= 10.0; t = gettok(); definelab(lab); statement(lab, swp, lev); definelab(lab + 1); expect(WHILE); expect('('); definept(NULL); walk(conditional(')'), lab, 0); if (findlabel(lab + 2)->ref) definelab(lab + 2); }

Here is the call graph for this function:

int equal (  Symbol  , Symbol  )  [static]

Definition at line 603 of file stmt.c. References assert, symbol::equatedto, symbol::l, Symbol, and symbol::u. Referenced by branch(). { assert(dst && lprime); for ( ; dst; dst = dst->u.l.equatedto) if (lprime == dst) return 1; return 0; }

void equatelab (  Symbol  old, Symbol  new )

Definition at line 598 of file stmt.c. References assert, symbol::equatedto, symbol::l, NULL, symbol::ref, Symbol, and symbol::u. Referenced by branch(), labelnode(), and listnodes(). { assert(old->u.l.equatedto == NULL); old->u.l.equatedto = new; new->ref++; }

int foldcond (  Tree  e1, Tree  e2 )  [static]

Definition at line 626 of file stmt.c. References ASGN, CNST, EQ, generic, GT, value::i, INDIR, isaddrop, tree::kids, LE, LT, NE, tree::op, op, simplify(), tree::sym, Symbol, Tree, tree::type, tree::u, tree::v, and v. Referenced by forstmt(). { int op = generic(e2->op); Symbol v; if (e1 == 0 || e2 == 0) return 0; if (generic(e1->op) == ASGN && isaddrop(e1->kids[0]->op) && generic(e1->kids[1]->op) == CNST) { v = e1->kids[0]->u.sym; e1 = e1->kids[1]; } else return 0; if ((op==LE || op==LT || op==EQ || op==NE || op==GT || op==GE) && generic(e2->kids[0]->op) == INDIR && e2->kids[0]->kids[0]->u.sym == v && e2->kids[1]->op == e1->op) { e1 = simplify(op, e2->type, e1, e2->kids[1]); if (e1->op == CNST+I) return e1->u.v.i; } return 0; }

Here is the call graph for this function:

void forstmt (  int  , Swtch  , int  )  [static]

Definition at line 262 of file stmt.c. References branch(), conditional(), Coordinate, definelab(), definept(), expect(), expr0(), findlabel(), foldcond(), FUNC, gettok(), kind, NULL, symbol::ref, refinc, statement(), Swtch, t, test(), texpr(), Tree, and walk(). Referenced by statement(). { int once = 0; Tree e1 = NULL, e2 = NULL, e3 = NULL; Coordinate pt2, pt3; t = gettok(); expect('('); definept(NULL); if (kind[t] == ID) e1 = texpr(expr0, ';', FUNC); else expect(';'); walk(e1, 0, 0); pt2 = src; refinc *= 10.0; if (kind[t] == ID) e2 = texpr(conditional, ';', FUNC); else expect(';'); pt3 = src; if (kind[t] == ID) e3 = texpr(expr0, ')', FUNC); else { static char stop[] = { IF, ID, '}', 0 }; test(')', stop); } if (e2) { once = foldcond(e1, e2); if (!once) branch(lab + 3); } definelab(lab); statement(lab, swp, lev); definelab(lab + 1); definept(&pt3); if (e3) walk(e3, 0, 0); if (e2) { if (!once) definelab(lab + 3); definept(&pt2); walk(e2, lab, 0); } else { definept(&pt2); branch(lab); } if (findlabel(lab + 2)->ref) definelab(lab + 2); }

Here is the call graph for this function:

void ifstmt (  int  , int  , Swtch  , int  )  [static]

Definition at line 220 of file stmt.c. References branch(), conditional(), definelab(), definept(), expect(), findlabel(), gettok(), NULL, symbol::ref, refinc, statement(), Swtch, t, and walk(). Referenced by statement(). { t = gettok(); expect('('); definept(NULL); walk(conditional(')'), 0, lab); refinc /= 2.0; statement(loop, swp, lev); if (t == ELSE) { branch(lab + 1); t = gettok(); definelab(lab); statement(loop, swp, lev); if (findlabel(lab + 1)->ref) definelab(lab + 1); } else definelab(lab); }

Here is the call graph for this function:

Node jump (  int  lab  )

Definition at line 558 of file stmt.c. References ADDRG, findlabel(), JUMP, newnode(), Node, NULL, p, symbol::ref, Symbol, ttob(), V, and voidptype. Referenced by branch(), and listnodes(). { Symbol p = findlabel(lab); p->ref++; return newnode(JUMP+V, newnode(ADDRG+ttob(voidptype), NULL, NULL, p), NULL, NULL); }

Here is the call graph for this function:

Symbol localaddr (  Tree   )  [static]

Definition at line 650 of file stmt.c. References ADDRF, ADDRL, ARG, ASGN, assert, CALL, COND, generic, INDIR, tree::kids, tree::op, p, q, RIGHT, tree::sym, Symbol, Tree, and tree::u. Referenced by retcode(). { if (p == NULL) return NULL; switch (generic(p->op)) { case INDIR: case CALL: case ARG: return NULL; case ADDRL: case ADDRF: return p->u.sym; case RIGHT: case ASGN: if (p->kids[1]) return localaddr(p->kids[1]); return localaddr(p->kids[0]); case COND: { Symbol q; assert(p->kids[1] && p->kids[1]->op == RIGHT); if ((q = localaddr(p->kids[1]->kids[0])) != NULL) return q; return localaddr(p->kids[1]->kids[1]); } default: { Symbol q; if (p->kids[0] && (q = localaddr(p->kids[0])) != NULL) return q; return localaddr(p->kids[1]); } } }

int reachable (  int  kind  )

Definition at line 39 of file stmt.c. References Code, cp, code::kind, kind, and code::prev. Referenced by code(), compound(), and definept(). { Code cp; if (kind > Start) { Code cp; for (cp = codelist; cp->kind < Label; ) cp = cp->prev; if (cp->kind == Jump || cp->kind == Switch) return 0; } return 1; }

void retcode (  Tree  p  )

Definition at line 482 of file stmt.c. References addlocal(), apply(), asgn(), ASGN, asgntree(), assign(), B, CALL, cast(), cfunc, symbol::computed, error(), events, freturn(), symbol::generated, genident(), idtree(), iscallb(), isfloat, isptr, tree::kids, level, localaddr(), mkop, symbol::name, NULL, p, PARAM, pointer(), promote(), q, RET, Events::returns, retv, RIGHT, rvalue(), symbol::scope, Symbol, tree(), Tree, tree::type, symbol::type, Type, walk(), and warning(). Referenced by funcdefn(), jpeg_consume_input(), jpeg_read_coefficients(), jpeg_read_header(), jpeg_start_decompress(), and statement(). { Type ty; if (p == NULL) { if (events.returns) apply(events.returns, cfunc, NULL); return; } p = pointer(p); ty = assign(freturn(cfunc->type), p); if (ty == NULL) { error("illegal return type; found `%t' expected `%t'\n", p->type, freturn(cfunc->type)); return; } p = cast(p, ty); if (retv) { if (iscallb(p)) p = tree(RIGHT, p->type, tree(CALL+B, p->type, p->kids[0]->kids[0], idtree(retv)), rvalue(idtree(retv))); else p = asgntree(ASGN, rvalue(idtree(retv)), p); walk(p, 0, 0); if (events.returns) apply(events.returns, cfunc, rvalue(idtree(retv))); return; } if (events.returns) { Symbol t1 = genident(AUTO, p->type, level); addlocal(t1); walk(asgn(t1, p), 0, 0); apply(events.returns, cfunc, idtree(t1)); p = idtree(t1); } if (!isfloat(p->type)) p = cast(p, promote(p->type)); if (isptr(p->type)) { Symbol q = localaddr(p); if (q && (q->computed || q->generated)) warning("pointer to a %s is an illegal return value\n", q->scope == PARAM ? "parameter" : "local"); else if (q) warning("pointer to %s `%s' is an illegal return value\n", q->scope == PARAM ? "parameter" : "local", q->name); } walk(tree(mkop(RET,p->type), p->type, p, NULL), 0, 0); }

Here is the call graph for this function:

void statement (  int  loop, Swtch  swp, int  lev )

Definition at line 78 of file stmt.c. References Aflag, branch(), caselabel, cast(), cfunc, CNST, compound(), constexpr(), deallocate(), definelab(), definept(), swtch::deflab, DO, dostmt(), e, error(), expect(), expr(), expr0(), extend, symbol::f, findlabel(), forstmt(), freturn(), FUNC, generic, genlabel(), getchr(), gettok(), value::i, ID, ifstmt(), install(), isint, kind, symbol::l, swtch::lab, symbol::label, listnodes(), lookup(), needconst, nodecount, NULL, type::op, tree::op, p, ref, refinc, retcode(), symbol::scope, skipto(), src, symbol::src, STMT, stmtlabel(), stmtlabs, swstmt(), Swtch, swtch::sym, Symbol, t, test(), Tree, Type, symbol::type, tree::type, symbol::u, value::u, tree::u, use(), tree::v, walk(), warning(), and whilestmt(). Referenced by compound(), dostmt(), forstmt(), ifstmt(), swstmt(), and whilestmt(). { float ref = refinc; if (Aflag >= 2 && lev == 15) warning("more than 15 levels of nested statements\n"); switch (t) { case IF: ifstmt(genlabel(2), loop, swp, lev + 1); break; case WHILE: whilestmt(genlabel(3), swp, lev + 1); break; case DO: dostmt(genlabel(3), swp, lev + 1); expect(';'); break; case FOR: forstmt(genlabel(4), swp, lev + 1); break; case BREAK: walk(NULL, 0, 0); definept(NULL); if (swp && swp->lab > loop) branch(swp->lab + 1); else if (loop) branch(loop + 2); else error("illegal break statement\n"); t = gettok(); expect(';'); break; case CONTINUE: walk(NULL, 0, 0); definept(NULL); if (loop) branch(loop + 1); else error("illegal continue statement\n"); t = gettok(); expect(';'); break; case SWITCH: swstmt(loop, genlabel(2), lev + 1); break; case CASE: { int lab = genlabel(1); if (swp == NULL) error("illegal case label\n"); definelab(lab); while (t == CASE) { static char stop[] = { IF, ID, 0 }; Tree p; t = gettok(); p = constexpr(0); if (generic(p->op) == CNST && isint(p->type)) { if (swp) { needconst++; p = cast(p, swp->sym->type); if (p->type->op == UNSIGNED) p->u.v.i = extend(p->u.v.u, p->type); needconst--; caselabel(swp, p->u.v.i, lab); } } else error("case label must be a constant integer expression\n"); test(':', stop); } statement(loop, swp, lev); } break; case DEFAULT: if (swp == NULL) error("illegal default label\n"); else if (swp->deflab) error("extra default label\n"); else { swp->deflab = findlabel(swp->lab); definelab(swp->deflab->u.l.label); } t = gettok(); expect(':'); statement(loop, swp, lev); break; case RETURN: { Type rty = freturn(cfunc->type); t = gettok(); definept(NULL); if (t != ';') if (rty == voidtype) { error("extraneous return value\n"); expr(0); ret