commit | 309db7c947de7f0f9730dff5f95bc1cc5bd1db7d | [log] [tgz] |
---|---|---|
author | Evan Cheng <evan.cheng@apple.com> | Wed Apr 27 19:32:43 2011 +0000 |
committer | Evan Cheng <evan.cheng@apple.com> | Wed Apr 27 19:32:43 2011 +0000 |
tree | f274f3ca9e79981b0157f28c874da2f367347c34 | |
parent | bddc1ca18a8ca23f6f145d2f5d006fa07e72a870 [diff] |
If converter was being too cute. It look for root BBs (which don't have successors) and use inverse depth first search to traverse the BBs. However that doesn't work when the CFG has infinite loops. Simply do a linear traversal of all BBs work just fine. rdar://9344645 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@130324 91177308-0d34-0410-b5e6-96231b3b80d8