forked from OSchip/llvm-project
dfa8741c96
Factor out the reachability such that multiple queries to find reachability of values are fast. This is based on finding the ANTIC points in the CFG which do not change during hoisting. The ANTIC points are basically the dominance-frontiers in the inverse graph. So we introduce a data structure (CHI nodes) to keep track of values flowing out of a basic block. We only do this for values with multiple occurrences in the function as they are the potential hoistable candidates. This patch allows us to hoist instructions to a basic block with >2 successors, as well as deal with infinite loops in a trivial way. Relevant test cases are added to show the functionality as well as regression fixes from PR32821. Regression from previous GVNHoist: We do not hoist fully redundant expressions because fully redundant expressions are already handled by NewGVN Differential Revision: https://reviews.llvm.org/D35918 Reviewers: dberlin, sebpop, gberry, llvm-svn: 313116 |
||
|---|---|---|
| .. | ||
| hoist-call.ll | ||
| hoist-convergent.ll | ||
| hoist-inline.ll | ||
| hoist-md.ll | ||
| hoist-more-than-two-branches.ll | ||
| hoist-mssa.ll | ||
| hoist-newgvn.ll | ||
| hoist-pr20242.ll | ||
| hoist-pr22005.ll | ||
| hoist-pr28606.ll | ||
| hoist-pr28933.ll | ||
| hoist-pr31891.ll | ||
| hoist-recursive-geps.ll | ||
| hoist-unsafe-pr31729.ll | ||
| hoist-very-busy.ll | ||
| hoist.ll | ||
| infinite-loop-direct.ll | ||
| infinite-loop-indirect.ll | ||
| ld_hoist1.ll | ||
| ld_hoist_st_sink.ll | ||
| pr28626.ll | ||
| pr29031.ll | ||
| pr29034.ll | ||
| pr30216.ll | ||
| pr30499.ll | ||