| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
|
| |
effective in avoiding recomputation of LCSSA form; the widespread
use of instsimplify (which looks through phi nodes) means it was
not preserving LCSSA form anyway; and instcombine is no longer
scheduled in the middle of the loop passes so this doesn't matter
anymore.
llvm-svn: 130301
|
|
|
|
| |
llvm-svn: 129644
|
|
|
|
|
|
| |
found by code inspection.
llvm-svn: 129641
|
|
|
|
|
|
| |
Luis Felipe Strano Moraes!
llvm-svn: 129558
|
|
|
|
|
|
| |
PHINode::Create() giving the (known or expected) number of operands.
llvm-svn: 128537
|
|
|
|
| |
llvm-svn: 128535
|
|
|
|
| |
llvm-svn: 128406
|
|
|
|
|
|
| |
common operations through a phi.
llvm-svn: 125790
|
|
|
|
| |
llvm-svn: 125787
|
|
|
|
|
|
| |
result inbounds if all of the inputs are inbounds.
llvm-svn: 125785
|
|
|
|
|
|
|
|
|
|
| |
offload the work to hasConstantValue rather than do something more
complicated (such handling mutually recursive phis) because (1) it is
not clear it is worth it; and (2) if it is worth it, maybe such logic
would be better placed in hasConstantValue. Adjust some GVN tests
which are now cleaned up much further (eg: all phi nodes are removed).
llvm-svn: 119043
|
|
|
|
| |
llvm-svn: 108147
|
|
|
|
|
|
| |
from different addr spaces.
llvm-svn: 97813
|
|
|
|
|
|
|
| |
and T->isPointerTy(). Convert most instances of the first form to the second form.
Requested by Chris.
llvm-svn: 96344
|
|
|
|
| |
llvm-svn: 92727
|
|
llvm-svn: 92682
|