Quick Search:

Mode

Context

Displaying 6 lines of context. None | Less | More | Full

Other Diffs

Ignore

Blank Lines Whitespace: Expand:

Diff

1.85
 
1.86
 
MAIN:plunky:20121107100717
 
optim2.c
_>6767 void cfg_build(struct p2env *);
 6868 void cfg_dfs(struct basicblock *bb, unsigned int parent,
 6969              struct bblockinfo *bbinfo);
 7070 void dominators(struct p2env *);
 7171 struct basicblock *
 7272 ancestorwithlowestsemi(struct basicblock *bblock, struct bblockinfo *bbinfo);
<>73 -void link(struct basicblock *parent, struct basicblock *child);
7473 void computeDF(struct p2env *, struct basicblock *bblock);
 7574 void printDF(struct p2env *p2e);
 7675 void findTemps(struct interpass *ip);
 7776 void placePhiFunctions(struct p2env *);
 7877 void renamevar(struct p2env *p2e,struct basicblock *bblock);
 7978 void removephi(struct p2env *p2e);
     
 !
975974                                               (cnode->bblock, &p2e->bbinfo)->semi];
 976975                         if (sprime->dfnum < s->dfnum)
 977976                                 s = sprime;
 978977                 }
 979978                 bb->semi = s->dfnum;
 980979                 BITSET(s->bucket, bb->dfnum);
<>981 -                link(p, bb);
  980+                bb->ancestor = p->dfnum;
982981                 for (i = 1; i < p2e->bbinfo.size; i++) {
 983982                         if(TESTBIT(p->bucket, i)) {
 984983                                 v = p2e->bbinfo.arr[i];
 985984                                 y = ancestorwithlowestsemi(v, &p2e->bbinfo);
 986985                                 if (y->semi == v->semi)
 987986                                         v->idom = p->dfnum;
     
 !
10291028                 v = bbinfo->arr[v->ancestor];
 10301029         }
 10311030         return u;
 10321031 }
 10331032 
 10341033 void
<>1035 -link(struct basicblock *parent, struct basicblock *child)
 1036 -{
 1037 -        child->ancestor = parent->dfnum;
 1038 -}
 1039 -
 1040 -void
<_10411034 computeDF(struct p2env *p2e, struct basicblock *bblock)
 10421035 {
 10431036         struct cfgnode *cn;
 10441037         int h, i;
 10451038         
 10461039         SLIST_FOREACH(cn, &bblock->child, chld) {
FishEye: Open Source License registered to PCC.
Atlassian FishEye, CVS analysis. (Version:1.6.3 Build:build-336 2008-11-04) - Administration - Page generated 2014-12-18 18:25 +0100