/external/llvm/lib/Transforms/Utils/ |
SimplifyInstructions.cpp | 66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
|
LoopSimplify.cpp | 277 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) { 474 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
|
LoopUnroll.cpp | 443 else if (Value *V = SimplifyInstruction(Inst))
|
SSAUpdater.cpp | 159 if (Value *V = SimplifyInstruction(InsertedPHI)) {
|
CloneFunction.cpp | 275 if (Value *V = SimplifyInstruction(NewInst, TD)) {
|
InlineFunction.cpp | [all...] |
PromoteMemoryToRegister.cpp | 757 if (Value *V = SimplifyInstruction(PN, 0, 0, &DT)) { [all...] |
SimplifyCFG.cpp | [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopInstSimplify.cpp | 112 Value *V = SimplifyInstruction(I, TD, TLI, DT);
|
CorrelatedValuePropagation.cpp | 128 if (Value *V = SimplifyInstruction(P)) {
|
LoopRotation.cpp | 384 Value *V = SimplifyInstruction(C);
|
EarlyCSE.cpp | 445 if (Value *V = SimplifyInstruction(Inst, TD, TLI, DT)) {
|
TailRecursionElimination.cpp | 234 if (Value *PNV = SimplifyInstruction(PN)) {
|
LoopUnswitch.cpp | [all...] |
CodeGenPrepare.cpp | [all...] |
JumpThreading.cpp | [all...] |
GVN.cpp | [all...] |
/external/llvm/include/llvm/Analysis/ |
InstructionSimplify.h | 241 /// SimplifyInstruction - See if we can compute a simplified version of this 243 Value *SimplifyInstruction(Instruction *I, const DataLayout *TD = 0, 263 /// This routine uses SimplifyInstruction to simplify 'I', and if successful
|
/external/llvm/lib/Analysis/ |
Lint.cpp | 652 // As a last resort, try SimplifyInstruction or constant folding. 654 if (Value *W = SimplifyInstruction(Inst, TD, TLI, DT))
|
BasicAliasAnalysis.cpp | 302 // If it's not a GEP, hand it off to SimplifyInstruction to see if it 307 SimplifyInstruction(const_cast<Instruction *>(I), TD)) { [all...] |
InstructionSimplify.cpp | [all...] |
ValueTracking.cpp | [all...] |
ScalarEvolution.cpp | [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombinePHI.cpp | 795 if (Value *V = SimplifyInstruction(&PN, TD)) [all...] |