forked from OSchip/llvm-project
5f9154618e
Summary: StructurizeCFG::orderNodes basically uses a reverse post-order (RPO) traversal of the region list to get the order. The only problem with it is that sometimes backedges for outer loops will be visited before backedges for inner loops. To solve this problem, a loop depth based approach has been used to make sure all blocks in this loop has been visited before moving on to outer loop. However, we found a problem for a SubRegion which is a loop itself: --> BB1 --> BB2 --> BB3 --> In this case, BB2 is a SubRegion (loop), and thus its loopdepth is different than that of BB1 and BB3. This fact will lead BB2 to be placed in the wrong order. In this work, we treat the SubRegion as a special case and use its exit block to determine the loop and its depth to guard the sorting. Reviewers: arsenm, jlebar Differential Revision: https://reviews.llvm.org/D46912 llvm-svn: 333111 |
||
|---|---|---|
| .. | ||
| AMDGPU | ||
| branch-on-argument.ll | ||
| bug36015.ll | ||
| invert-condition.ll | ||
| invert-constantexpr.ll | ||
| loop-multiple-exits.ll | ||
| nested-loop-order.ll | ||
| no-branch-to-entry.ll | ||
| one-loop-multiple-backedges.ll | ||
| post-order-traversal-bug.ll | ||
| rebuild-ssa-infinite-loop.ll | ||
| switch.ll | ||