}
else
{
- int j=i;
- while (j--) {
- if (ebbs[j]->ech && ebbs[j]->ech->op==IFX &&
- (isSymbolEqual(IC_TRUE(ebbs[j]->ech), ebbs[i]->entryLabel) ||
- isSymbolEqual(IC_FALSE(ebbs[j]->ech), ebbs[i]->entryLabel))) {
- ebbs[i]->hasConditionalExit=1;
- }
+ if (i && ebbs[i-1]->ech && ebbs[i-1]->ech->op==IFX) {
+ ebbs[i]->isConditionalExitFrom=ebbs[i-1];
}
}
} /* no instructions in the block */
if (loop->dfnum > idom->dfnum)
idom = loop;
- setToNull ((void **) &iset);
+ setToNull ((void *) &iset);
return idom;
}
for (i = 0; i < count; i++)
{
- setToNull ((void **) &ebbs[i]->predList);
- setToNull ((void **) &ebbs[i]->domVect);
- setToNull ((void **) &ebbs[i]->succList);
- setToNull ((void **) &ebbs[i]->succVect);
+ setToNull ((void *) &ebbs[i]->predList);
+ setToNull ((void *) &ebbs[i]->domVect);
+ setToNull ((void *) &ebbs[i]->succList);
+ setToNull ((void *) &ebbs[i]->succVect);
ebbs[i]->visited = 0;
ebbs[i]->dfnum = 0;
}
/* sort it back by block number */
qsort (ebbs, saveCount, sizeof (eBBlock *), bbNumCompare);
- setToNull ((void **) &graphEdges);
+ setToNull ((void *) &graphEdges);
/* this will put in the */
/* successor information for each blk */
eBBSuccessors (ebbs, count);