1305 // dominator tree of all USES of a value. Pick the block with the least |
1305 // dominator tree of all USES of a value. Pick the block with the least |
1306 // loop nesting depth that is lowest in the dominator tree. |
1306 // loop nesting depth that is lowest in the dominator tree. |
1307 // ( visited.Clear() called in schedule_late()->Node_Backward_Iterator() ) |
1307 // ( visited.Clear() called in schedule_late()->Node_Backward_Iterator() ) |
1308 schedule_late(visited, stack); |
1308 schedule_late(visited, stack); |
1309 if (C->failing()) { |
1309 if (C->failing()) { |
1310 // schedule_late fails only when graph is incorrect. |
|
1311 assert(!VerifyGraphEdges, "verification should have failed"); |
|
1312 return; |
1310 return; |
1313 } |
1311 } |
1314 |
1312 |
1315 #ifndef PRODUCT |
1313 #ifndef PRODUCT |
1316 if (trace_opto_pipelining()) { |
1314 if (trace_opto_pipelining()) { |