the dominators algorithm leaves us knowing who the immediate dominator is for each node . this sweeps the node list and builds the proper dominance tree . concode_field_sep DomInfo[] domInfos concode_elem_sep ArrayList<SsaBasicBlock> nodes concode_elem_sep IntSet dominanceFrontiers concode_elem_sep boolean DEBUG concode_elem_sep int idom concode_elem_sep SsaMethod meth concode_field_sep void debugPrintDomChildren concode_elem_sep void calcDomFronts concode_elem_sep DomInfo[] run
void function ( ) { int loc0 = nodes . size ( ) ; for ( int loc1 = 0 ; loc1 < loc0 ; loc1 ++ ) { DomInfo loc2 = domInfos [ loc1 ] ; if ( loc2 . idom == - 1 ) continue ; SsaBasicBlock loc3 = nodes . get ( loc2 . idom ) ; loc3 . addDomChild ( nodes . get ( loc1 ) ) ; } }