Quick Search:

Mode

Context

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

Other Diffs

Ignore

Blank Lines Whitespace: Expand:

Diff

1.82
 
1.83
 
MAIN:ragge:20120817205958
 
optim2.c
     
 !
_>710 -                        bb->ch[0] = bb->ch[1] = NULL;
  710+                        SLIST_INIT(&bb->child);
     
 !
<>815 -                        CHADD(bb, cnode);
  815+                        SLIST_INSERT_LAST(&bb->child, cnode, chld);
     
 !
<>827 -                        CHADD(bb, cnode);
  827+                        SLIST_INSERT_LAST(&bb->child, cnode, chld);
     
 !
<>835 -                CHADD(bb, cnode);
  835+                SLIST_INSERT_LAST(&bb->child, cnode, chld);
     
 !
<>842 -        struct cfgnode **cn;
  842+        struct cfgnode *cn;
     
 !
<>850 -        FORCH(cn, bb->ch)
 851 -                cfg_dfs((*cn)->bblock, bb->dfnum, bbinfo);
  850+        SLIST_FOREACH(cn, &bb->child, chld)
  851+                cfg_dfs(cn->bblock, bb->dfnum, bbinfo);
     
 !
<>890 -                struct cfgnode *ccnode, **cn;
  890+                struct cfgnode *ccnode, *cn;
     
 !
<>898 -                        FORCH(cn, bbb->ch)
 899 -                                printf("%d, ", (*cn)->bblock->dfnum);
  898+                        SLIST_FOREACH(cn, &bbb->child, chld)
  899+                                printf("%d, ", cn->bblock->dfnum);
     
 !
<>983 -        struct cfgnode **cn;
  983+        struct cfgnode *cn;
     
 !
<>986 -        FORCH(cn, bblock->ch) {
 987 -                if ((*cn)->bblock->idom != bblock->dfnum)
 988 -                        BITSET(bblock->df, (*cn)->bblock->dfnum);
  986+        SLIST_FOREACH(cn, &bblock->child, chld) {
  987+                if (cn->bblock->idom != bblock->dfnum)
  988+                        BITSET(bblock->df, cn->bblock->dfnum);
     
 !
<>1243 -        struct cfgnode *cfgn2, **cn;
  1243+        struct cfgnode *cfgn2, *cn;
     
 !
<>1278 -        FORCH(cn, bb->ch) {
  1278+        SLIST_FOREACH(cn, &bb->child, chld) {
     
 !
<>1281 -                SLIST_FOREACH(cfgn2, &(*cn)->bblock->parents, cfgelem) {
  1281+                SLIST_FOREACH(cfgn2, &cn->bblock->parents, cfgelem) {
     
 !
<>1288 -                SLIST_FOREACH(phi,&(*cn)->bblock->phi,phielem) {
  1288+                SLIST_FOREACH(phi,&cn->bblock->phi,phielem) {
     
 !
<>1625 -        struct cfgnode **cn;
  1625+        struct cfgnode *cn;
     
 !
<>1698 -                FORCH(cn, bbb->ch) {
  1698+                SLIST_FOREACH(cn, &bbb->child, chld) {
     
 !
<>1705 -                                if ((*cn)->bblock==p2e->labinfo.arr[label - p2e->ipp->ip_lblnum])
  1705+                                if (cn->bblock==p2e->labinfo.arr[label - p2e->ipp->ip_lblnum])
     
 !
<>1709 -                        fprintf(flowdiagramfile,"bb%p -> bb%p [color=%s]\n", bbb,(*cn)->bblock,color);
  1709+                        fprintf(flowdiagramfile,"bb%p -> bb%p [color=%s]\n", bbb,cn->bblock,color);
     
 !
<>1807 -                                struct cfgnode **cn ;
  1807+                                struct cfgnode *cn ;
     
 !
<>1833 -                                                        FORCH(cn, bb->ch) {
 1834 -                                                                block2=(*cn)->bblock ;
  1833+                                                        SLIST_FOREACH(cn, &bb->child, chld) {
  1834+                                                                block2=cn->bblock ;
     
 !
<>2112 -                struct cfgnode **cn;
  2112+                struct cfgnode *cn;
     
 !
<_2119 -                        FORCH(cn, bb->ch) {
 2120 -                                SETSET(bb->out, cn[0]->bblock->in, j, xbits);
  2119+                        SLIST_FOREACH(cn, &bb->child, chld) {
  2120+                                SETSET(bb->out, cn->bblock->in, j, xbits);
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 17:24 +0100