mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-24 21:42:54 +02:00
9ede5a39dd
This change teaches LazyValueInfo to use the @llvm.assume intrinsic. Like with
the known-bits change (r217342), this requires feeding a "context" instruction
pointer through many functions. Aside from a little refactoring to reuse the
logic that turns predicates into constant ranges in LVI, the only new code is
that which can 'merge' the range from an assumption into that otherwise
computed. There is also a small addition to JumpThreading so that it can have
LVI use assumptions in the same block as the comparison feeding a conditional
branch.
With this patch, we can now simplify this as expected:
int foo(int a) {
__builtin_assume(a > 5);
if (a > 3) {
bar();
return 1;
}
return 0;
}
llvm-svn: 217345
|
||
|---|---|---|
| .. | ||
| 2008-11-27-EntryMunge.ll | ||
| 2010-08-26-and.ll | ||
| 2011-04-02-SimplifyDeadBlock.ll | ||
| 2011-04-14-InfLoop.ll | ||
| 2012-07-19-NoSuccessorIndirectBr.ll | ||
| and-and-cond.ll | ||
| and-cond.ll | ||
| assume.ll | ||
| basic.ll | ||
| branch-no-const.ll | ||
| compare.ll | ||
| crash.ll | ||
| degenerate-phi.ll | ||
| indirectbr.ll | ||
| jump_threading.ll | ||
| landing-pad.ll | ||
| lvi-load.ll | ||
| no-irreducible-loops.ll | ||
| or-undef.ll | ||
| phi-eq.ll | ||
| pr9331.ll | ||
| pr15851_hang.ll | ||
| select.ll | ||
| thread-loads.ll | ||