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

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/
AggressiveInstCombine.cpp 153 BasicBlock *PhiBB = Phi.getParent();
155 m_SpecificBB(PhiBB), m_SpecificBB(FunnelBB))))
161 IRBuilder<> Builder(PhiBB, PhiBB->getFirstInsertionPt());
181 // br i1 %cmp, label %PhiBB, label %FunnelBB
187 // br label %PhiBB
188 // PhiBB:
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp 88 BasicBlock *PhiBB);
314 BasicBlock *PhiBB) {
315 IRBuilder<> Builder(PhiBB, PhiBB->begin());
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SpeculateAroundPHIs.cpp 52 auto *PhiBB = PN.getParent();
65 if (UI->getParent() != PhiBB) {
117 if (ParentBB == PhiBB) {
122 } else if (DT.dominates(ParentBB, PhiBB)) {
134 if (UnsafeSet.count(OpI) || ParentBB != PhiBB ||
MergeICmps.cpp 660 BasicBlock *const PhiBB = Phi.getParent();
662 if (NextCmpBlock == PhiBB) {
664 Builder.CreateBr(PhiBB);
666 DTU.applyUpdates({{DominatorTree::Insert, BB, PhiBB}});
669 Builder.CreateCondBr(IsEqual, NextCmpBlock, PhiBB);
672 {DominatorTree::Insert, BB, PhiBB}});
JumpThreading.cpp 241 BasicBlock *PhiBB) -> std::pair<BasicBlock *, BasicBlock *> {
243 auto *SuccBB = PhiBB;
1954 /// predecessor to the PHIBB block. If it has PHI nodes, add entries for
1956 static void addPHINodeEntriesForMappedBlock(BasicBlock *PHIBB,
1960 for (PHINode &PN : PHIBB->phis()) {
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LazyValueInfo.cpp 720 BasicBlock *PhiBB = PN->getIncomingBlock(i);
726 getEdgeValue(PhiVal, PhiBB, BB, PN);

Completed in 23 milliseconds