HomeSort by: relevance | last modified time | path
    Searched refs:PHIs (Results 1 - 12 of 12) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
EarlyIfConversion.cpp 80 // Head block, and phis in the Tail block are converted to select instructions.
92 /// The block containing phis after the if-then-else.
122 SmallVector<PHIInfo, 8> PHIs;
224 // There shouldn't normally be any phis in a single-predecessor block.
320 // There shouldn't normally be any phis in a single-predecessor block.
475 // Skip if we cannot predicate and there are no phis skip as there must be
478 LLVM_DEBUG(dbgs() << "No phis in tail.\n");
506 // Any phis in the tail block must be convertible to selects.
507 PHIs.clear();
512 PHIs.push_back(&*I)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCMIPeephole.cpp 280 SmallVectorImpl<MachineInstr *> &PHIs) {
281 PHIs.push_back(RootPHI);
283 while (VisitedIndex < PHIs.size()) {
284 MachineInstr *VisitedPHI = PHIs[VisitedIndex];
307 if (llvm::is_contained(PHIs, Instr))
309 PHIs.push_back(Instr);
316 // This function changes the unprimed accumulator PHI nodes in the PHIs list to
322 SmallVectorImpl<MachineInstr *> &PHIs,
325 for (auto It = PHIs.rbegin(), End = PHIs.rend(); It != End; ++It)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUMachineCFGStructurizer.cpp 1400 SmallPtrSet<MachineInstr *, 2> PHIs;
1409 PHIs.insert(&Instr);
1415 for (auto PI : PHIs) {
1636 SmallVector<MachineInstr *, 2> &PHIs) {
1639 PHIs.push_back(&BBI);
1647 SmallVector<MachineInstr *, 2> PHIs;
1652 collectPHIs(Exit, PHIs);
1654 for (auto PHII : PHIs) {
1661 SmallVector<MachineInstr *, 2> PHIs;
1664 collectPHIs(Entry, PHIs);
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGNonTrivialStruct.cpp 379 llvm::PHINode *PHIs[N];
382 PHIs[I] = CGF.Builder.CreatePHI(CGF.CGM.Int8PtrPtrTy, 2, "addr.cur");
383 PHIs[I]->addIncoming(StartAddrs[I].getPointer(), PreheaderBB);
393 CGF.Builder.CreateICmpEQ(PHIs[DstIdx], DstArrayEnd, "done");
404 PHIs[I], StartAddrs[I].getAlignment().alignmentAtOffset(EltSize));
416 PHIs[I]->addIncoming(NewAddrs[I].getPointer(), LoopBB);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
IVDescriptors.cpp 384 SmallVector<Instruction *, 8> PHIs;
419 PHIs.push_back(UI);
433 Worklist.append(PHIs.begin(), PHIs.end());
748 // phis with multiple users.
815 // nodes where possible, and 2) PHIs with the nsz flag + -0.0 use 0.0. This would
1204 // don't currently know how to handled uniform PHIs.
ValueTracking.cpp 2676 // Check two PHIs are in same block.
3069 // Don't analyze large in-degree PHIs.
4187 SmallPtrSetImpl<const PHINode*> &PHIs,
4195 if (!PHIs.insert(PN).second)
4201 uint64_t Len = GetStringLengthH(IncValue, PHIs, CharSize);
4217 uint64_t Len1 = GetStringLengthH(SI->getTrueValue(), PHIs, CharSize);
4219 uint64_t Len2 = GetStringLengthH(SI->getFalseValue(), PHIs, CharSize);
4251 SmallPtrSet<const PHINode*, 32> PHIs;
4252 uint64_t Len = GetStringLengthH(V, PHIs, CharSize);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
GlobalOpt.cpp 665 /// dynamically null. PHIs keeps track of any phi nodes we've seen to avoid
668 SmallPtrSetImpl<const PHINode*> &PHIs) {
694 if (!AllUsesOfValueWillTrapIfNull(CI, PHIs)) return false;
696 if (!AllUsesOfValueWillTrapIfNull(GEPI, PHIs)) return false;
700 if (PHIs.insert(PN).second && !AllUsesOfValueWillTrapIfNull(PN, PHIs))
716 SmallPtrSet<const PHINode*, 8> PHIs;
717 if (!AllUsesOfValueWillTrapIfNull(LI, PHIs))
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
IndVarSimplify.cpp 412 SmallVector<WeakTrackingVH, 8> PHIs;
413 for (PHINode &PN : Header->phis())
414 PHIs.push_back(&PN);
417 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
418 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i]))
449 for (PHINode &PN : ExitBB->phis()) {
481 // Only deal with PHIs in the loop header.
609 // for all current phis, then determines whether any IVs can be
610 // widened. Widening adds new phis to LoopPhis, inducing another round of
924 // We explicitly allow unknown phis as long as they are already used b
    [all...]
GVNSink.cpp 192 /// the number of predecessors sunk from and the number of PHIs
207 NumExtraPHIs) // PHIs are expensive, so make sure they're worth it.
219 << " #Insts=" << C.NumInstructions << " #PHIs=" << C.NumPHIs << ">";
226 /// Describes a PHI node that may or may not exist. These track the PHIs
597 /// Create a ModelledPHI for each PHI in BB, adding to PHIs.
598 void analyzeInitialPHIs(BasicBlock *BB, ModelledPHISet &PHIs,
600 for (PHINode &PN : BB->phis()) {
602 PHIs.insert(MPHI);
616 /// Remove PHIs that all have the same incoming value.
677 // If we've restricted the incoming blocks, restrict all needed PHIs als
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 159 // Recursively deleting a PHI may cause multiple PHIs to be deleted
160 // or RAUW'd undef, so use an array of WeakTrackingVH for the PHIs to delete.
161 SmallVector<WeakTrackingVH, 8> PHIs;
162 for (PHINode &PN : BB->phis())
163 PHIs.push_back(&PN);
166 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
167 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
210 for (PHINode &PN : BB->phis())
217 // Begin by getting rid of unneeded PHIs.
220 for (PHINode &PN : BB->phis())
    [all...]
SimplifyCFG.cpp 331 for (PHINode &PN : Succ->phis())
1382 for (const PHINode &PN : Succ->phis()) {
1399 /// case, only the original BI will be replaced and selects for PHIs are added.
1549 for (PHINode &PN : Succ->phis()) {
1583 // PHIs created below will adopt NT's merged DebugLoc.
1592 for (PHINode &PN : Succ->phis()) {
1827 // completed - it takes into account PHIs that become trivially
2081 // Too many PHIs would be created.
2083 dbgs() << "SINK: stopping here, too many PHIs would be created!\n");
2169 // and never actually sink it which means we produce more PHIs than intended
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 497 SetVector<PHINode *> PHIs;
544 // We cannot transform PHIs on unsplittable basic blocks.
548 PHIs.insert(PN);
553 for (auto *PN : PHIs)
765 /// We can look through PHIs, GEPs and casts in order to determine a common base
921 // PHIs/casts.
982 // Try convert this to an indexed compare by looking through PHIs/casts as a

Completed in 35 milliseconds