-
- if (reSort)
- /* sort it back by block number */
- qsort (ebbs,saveCount,sizeof(eBBlock *),bbNumCompare);
-
- setToNull ((void **)&graphEdges);
- /* this will put in the */
- /* successor information for each blk */
- eBBSuccessors (ebbs,count);
-
- /* compute the depth first ordering */
- computeDFOrdering (ebbs[0],&count);
-
- /* mark blocks with no paths to them */
- markNoPath (ebbs,saveCount);
-
- /* with the depth first info in place */
- /* add the predecessors for the blocks*/
- eBBPredecessors (ebbs,saveCount);
-
- /* compute the dominance graph */
- computeDominance (ebbs,saveCount);
-
- /* sort it by dfnumber */
- qsort (ebbs,saveCount,sizeof(eBBlock *),dfNumCompare);
-
-}
-