/external/llvm/lib/Transforms/Utils/ |
SimplifyInstructions.cpp | 66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
|
LoopSimplify.cpp | 269 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) { 466 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
|
LoopUnroll.cpp | 437 else if (Value *V = SimplifyInstruction(Inst))
|
SSAUpdater.cpp | 188 if (Value *V = SimplifyInstruction(InsertedPHI)) {
|
CloneFunction.cpp | 272 if (Value *V = SimplifyInstruction(NewInst, TD)) {
|
InlineFunction.cpp | [all...] |
PromoteMemoryToRegister.cpp | 596 if (Value *V = SimplifyInstruction(PN, 0, 0, &DT)) { [all...] |
SimplifyCFG.cpp | [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopInstSimplify.cpp | 111 Value *V = SimplifyInstruction(I, TD, TLI, DT);
|
CorrelatedValuePropagation.cpp | 109 if (Value *V = SimplifyInstruction(P)) {
|
LoopRotation.cpp | 358 Value *V = SimplifyInstruction(C);
|
EarlyCSE.cpp | 387 if (Value *V = SimplifyInstruction(Inst, TD, TLI, DT)) {
|
TailRecursionElimination.cpp | 206 if (Value *PNV = SimplifyInstruction(PN)) {
|
CodeGenPrepare.cpp | [all...] |
LoopUnswitch.cpp | [all...] |
JumpThreading.cpp | [all...] |
GVN.cpp | [all...] |
/external/llvm/include/llvm/Analysis/ |
InstructionSimplify.h | 185 /// SimplifyInstruction - See if we can compute a simplified version of this 187 Value *SimplifyInstruction(Instruction *I, const TargetData *TD = 0, 207 /// This routine uses SimplifyInstruction to simplify 'I', and if successful
|
/external/llvm/lib/Analysis/ |
BasicAliasAnalysis.cpp | 288 // If it's not a GEP, hand it off to SimplifyInstruction to see if it 293 SimplifyInstruction(const_cast<Instruction *>(I), TD)) { [all...] |
Lint.cpp | 618 // As a last resort, try SimplifyInstruction or constant folding. 620 if (Value *W = SimplifyInstruction(Inst, TD, TLI, DT))
|
ValueTracking.cpp | [all...] |
InstructionSimplify.cpp | [all...] |
ScalarEvolution.cpp | [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombinePHI.cpp | 795 if (Value *V = SimplifyInstruction(&PN, TD)) [all...] |