/external/llvm/lib/CodeGen/ |
D | EarlyIfConversion.cpp | 120 SmallVector<PHIInfo, 8> PHIs; member in __anonfc1f82480111::SSAIfConv 405 PHIs.clear(); in canConvertIf() 410 PHIs.push_back(&*I); in canConvertIf() 411 PHIInfo &PI = PHIs.back(); in canConvertIf() 460 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) { in replacePHIInstrs() 461 PHIInfo &PI = PHIs[i]; in replacePHIInstrs() 480 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) { in rewritePHIOperands() 481 PHIInfo &PI = PHIs[i]; in rewritePHIOperands() 718 for (unsigned i = 0, e = IfConv.PHIs.size(); i != e; ++i) { in shouldConvertIf() 719 SSAIfConv::PHIInfo &PI = IfConv.PHIs[i]; in shouldConvertIf()
|
D | InlineSpiller.cpp | 547 SmallVector<VNInfo*, 8> PHIs, NonPHIs; in traceSiblingValue() local 559 PHIs.push_back(VNI2); in traceSiblingValue() 563 DEBUG(dbgs() << "split phi value, checking " << PHIs.size() in traceSiblingValue() 569 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) in traceSiblingValue() 570 SibValues.insert(std::make_pair(PHIs[i], SibValueInfo(Reg, PHIs[i]))); in traceSiblingValue() 579 SVI->second.Deps.insert(SVI->second.Deps.end(), PHIs.begin(), in traceSiblingValue() 580 PHIs.end()); in traceSiblingValue()
|
/external/llvm/test/Analysis/BasicAA/ |
D | phi-and-select.ll | 3 ; BasicAA should detect NoAliases in PHIs and Selects. 15 ; Two PHIs in the same block. 44 ; Two PHIs with disjoint sets of inputs.
|
/external/llvm/docs/HistoricalNotes/ |
D | 2003-06-26-Reoptimizer2.txt | 30 It does copy insertions for PHIs, which it infers from the machine 32 the PHIs. 102 along with the PHIs that are inserted. 103 PHIs are followed by the copies that implement them.
|
/external/llvm/test/Transforms/LCSSA/ |
D | indirectbr.ll | 545 ; create PHIs in one of such exits we are also inserting PHIs in L2 header. This 546 ; could break LCSSA form for L2 because these inserted PHIs can also have uses
|
/external/llvm/test/Analysis/CFLAliasAnalysis/ |
D | phi-and-select.ll | 8 ; Two PHIs with disjoint sets of inputs.
|
/external/llvm/lib/Transforms/IPO/ |
D | GlobalOpt.cpp | 619 SmallPtrSetImpl<const PHINode*> &PHIs) { in AllUsesOfValueWillTrapIfNull() argument 639 if (!AllUsesOfValueWillTrapIfNull(CI, PHIs)) return false; in AllUsesOfValueWillTrapIfNull() 641 if (!AllUsesOfValueWillTrapIfNull(GEPI, PHIs)) return false; in AllUsesOfValueWillTrapIfNull() 645 if (PHIs.insert(PN).second && !AllUsesOfValueWillTrapIfNull(PN, PHIs)) in AllUsesOfValueWillTrapIfNull() 664 SmallPtrSet<const PHINode*, 8> PHIs; in AllUsesOfLoadedValueWillTrapIfNull() local 665 if (!AllUsesOfValueWillTrapIfNull(LI, PHIs)) in AllUsesOfLoadedValueWillTrapIfNull() 962 SmallPtrSetImpl<const PHINode*> &PHIs) { in ValueIsOnlyUsedLocallyOrStoredToOneGlobal() argument 978 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(Inst, GV, PHIs)) in ValueIsOnlyUsedLocallyOrStoredToOneGlobal() 986 if (PHIs.insert(PN).second) in ValueIsOnlyUsedLocallyOrStoredToOneGlobal() 987 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(PN, GV, PHIs)) in ValueIsOnlyUsedLocallyOrStoredToOneGlobal() [all …]
|
/external/llvm/lib/Transforms/Utils/ |
D | BasicBlockUtils.cpp | 95 SmallVector<WeakVH, 8> PHIs; in DeleteDeadPHIs() local 98 PHIs.push_back(PN); in DeleteDeadPHIs() 101 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) in DeleteDeadPHIs() 102 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*())) in DeleteDeadPHIs()
|
D | SimplifyCFG.cpp | 2145 SmallVector<PHINode*, 4> PHIs; in FoldBranchToCommonDest() local 2150 !isProfitableToFoldUnconditional(BI, PBI, Cond, PHIs))) in FoldBranchToCommonDest() 2283 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) { in FoldBranchToCommonDest() 2285 PHIs[i]->getIncomingValueForBlock(PBI->getParent())); in FoldBranchToCommonDest() 2323 PHIs[i]->setIncomingValue(PHIs[i]->getBasicBlockIndex(PBI->getParent()), in FoldBranchToCommonDest() 4072 SmallVector<PHINode*, 4> PHIs; in SwitchToLookupTable() local 4093 PHIs.push_back(PHI); in SwitchToLookupTable() 4099 for (PHINode *PHI : PHIs) { in SwitchToLookupTable() 4103 uint64_t NumResults = ResultLists[PHIs[0]].size(); in SwitchToLookupTable() 4192 const ResultListTy &ResultList = ResultLists[PHIs[0]]; in SwitchToLookupTable() [all …]
|
/external/llvm/test/Transforms/SimplifyCFG/X86/ |
D | switch-covered-bug.ll | 7 ; are cached in PHIs.
|
/external/llvm/test/Feature/ |
D | optnone-llc.ll | 47 ; LLC-Ox-DAG: Skipping pass 'Optimize machine instruction PHIs'
|
/external/llvm/test/CodeGen/PowerPC/ |
D | pr20442.ll | 10 ; have as many predecessor entries as the other PHIs.
|
/external/clang/test/CodeGenObjC/ |
D | ns_consume_null_check.m | 32 // Ensure that we build PHIs correctly in the presence of cleanups.
|
/external/llvm/lib/Transforms/Scalar/ |
D | IndVarSimplify.cpp | 451 SmallVector<WeakVH, 8> PHIs; in RewriteNonIntegerIVs() local 454 PHIs.push_back(PN); in RewriteNonIntegerIVs() 456 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) in RewriteNonIntegerIVs() 457 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i])) in RewriteNonIntegerIVs()
|
/external/llvm/lib/Analysis/ |
D | ValueTracking.cpp | 2680 static uint64_t GetStringLengthH(Value *V, SmallPtrSetImpl<PHINode*> &PHIs) { in GetStringLengthH() argument 2687 if (!PHIs.insert(PN).second) in GetStringLengthH() 2693 uint64_t Len = GetStringLengthH(PN->getIncomingValue(i), PHIs); in GetStringLengthH() 2709 uint64_t Len1 = GetStringLengthH(SI->getTrueValue(), PHIs); in GetStringLengthH() 2711 uint64_t Len2 = GetStringLengthH(SI->getFalseValue(), PHIs); in GetStringLengthH() 2732 SmallPtrSet<PHINode*, 32> PHIs; in GetStringLength() local 2733 uint64_t Len = GetStringLengthH(V, PHIs); in GetStringLength()
|
/external/llvm/lib/Transforms/Vectorize/ |
D | LoopVectorize.cpp | 4155 SmallVector<Instruction *, 8> PHIs; in AddReductionVar() local 4185 PHIs.push_back(UI); in AddReductionVar() 4199 Worklist.append(PHIs.begin(), PHIs.end()); in AddReductionVar()
|
/external/llvm/test/Transforms/Scalarizer/ |
D | basic.ll | 417 ; Test combinations of vector and non-vector PHIs.
|
/external/llvm/test/Instrumentation/MemorySanitizer/ |
D | msan_basic.ll | 120 ; Check that we generate PHIs for shadow.
|