Searched refs:BB2 (Results 1 - 17 of 17) sorted by relevance

/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp46 BasicBlock *BB2 = &*FI++; variable
47 BBI = BB2->begin();
63 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
70 EXPECT_TRUE(DT->dominates(BB0, BB2));
76 EXPECT_FALSE(DT->dominates(BB1, BB2));
80 EXPECT_FALSE(DT->dominates(BB2, BB0));
81 EXPECT_FALSE(DT->dominates(BB2, BB1));
82 EXPECT_TRUE(DT->dominates(BB2, BB2));
83 EXPECT_TRUE(DT->dominates(BB2, BB
[all...]
H A DValueTest.cpp197 BasicBlock *BB2 = &*++F->begin(); local
198 ASSERT_TRUE(BB2);
210 EXPECT_EQ(MST.getLocalSlot(BB2), 2);
230 BasicBlock *BB2 = &*++F->begin(); local
231 ASSERT_TRUE(BB2);
234 EXPECT_DEATH(MST.getLocalSlot(BB2), "No function incorporated");
H A DIRBuilderTest.cpp403 auto BB2 = BasicBlock::Create(Ctx, "bb2", F); local
404 auto Br = BranchInst::Create(BB2, BB);
H A DInstructionsTest.cpp89 BasicBlock *BB2 = BasicBlock::Create(Ctx, "", F); local
94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
/external/llvm/unittests/Analysis/
H A DBlockFrequencyInfoTest.cpp67 BasicBlock *BB2 = BB0.getTerminator()->getSuccessor(1); local
72 uint64_t BB2Freq = BFI.getBlockFreq(BB2).getFrequency();
82 EXPECT_EQ(BFI.getBlockProfileCount(BB2).getValue(), 100 * BB2Freq / BB0Freq);
/external/llvm/lib/Target/Mips/
H A DMipsMCInstLower.h39 MCOperand createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2,
H A DMipsMCInstLower.cpp206 MachineBasicBlock *BB2,
209 const MCSymbolRefExpr *Sym2 = MCSymbolRefExpr::create(BB2->getSymbol(), *Ctx);
205 createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2, MipsMCExpr::MipsExprKind Kind) const argument
/external/llvm/lib/Analysis/
H A DCFG.cpp122 // True if there is a loop which contains both BB1 and BB2.
124 const BasicBlock *BB1, const BasicBlock *BB2) {
126 const Loop *L2 = getOutermostLoop(LI, BB2);
123 loopContainsBoth(const LoopInfo *LI, const BasicBlock *BB1, const BasicBlock *BB2) argument
/external/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h53 // Union BB1 and BB2 into the same group and return true.
54 // Returns false if BB1 and BB2 are already in the same group.
55 bool unionGroups(const BasicBlock *BB1, const BasicBlock *BB2) { argument
57 BBInfo *BB2G = findAndCompressGroup(&getBBInfo(BB2));
/external/llvm/lib/Transforms/Scalar/
H A DConstantHoisting.cpp157 BasicBlock *BB, *BB1, *BB2; local
159 BB2 = *std::next(BBs.begin());
160 BB = DT->findNearestCommonDominator(BB1, BB2);
164 BBs.erase(BB2);
/external/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp153 /// Two blocks BB1 and BB2 are in the same equivalence class if they
669 /// A block BB2 will be in the same equivalence class as \p BB1 if
672 /// 1- \p BB1 is a descendant of BB2 in the opposite tree. So, if BB2
673 /// is a descendant of \p BB1 in the dominator tree, then BB2 should
676 /// 2- Both BB2 and \p BB1 must be in the same loop.
678 /// For every block BB2 that meets those two requirements, we set BB2's
691 for (const auto *BB2 : Descendants) {
692 bool IsDomParent = DomTree->dominates(BB2, BB
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/IPO/
H A DMergeFunctions.cpp167 bool compare(const BasicBlock *BB1, const BasicBlock *BB2);
418 bool FunctionComparator::compare(const BasicBlock *BB1, const BasicBlock *BB2) { argument
420 BasicBlock::const_iterator F2I = BB2->begin(), F2E = BB2->end();
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1152 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument
1159 Value *BB2V = PN->getIncomingValueForBlock(BB2);
1170 /// Given a conditional branch that goes to BB1 and BB2, hoist any common code
1172 /// guarantees that BI's block dominates BB1 and BB2.
1177 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
1181 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination local
1184 BasicBlock::iterator BB2_Itr = BB2->begin();
1197 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1250 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
1258 Value *BB2V = PN->getIncomingValueForBlock(BB2);
2476 findUniqueStoreInBlocks(BasicBlock *BB1, BasicBlock *BB2) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
H A DSimplifyCFG.cpp821 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument
828 Value *BB2V = PN->getIncomingValueForBlock(BB2);
838 /// BB2, hoist any common code in the two blocks up into the branch block. The
839 /// caller of this function guarantees that BI's block dominates BB1 and BB2.
843 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
847 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination local
850 BasicBlock::iterator BB2_Itr = BB2->begin();
863 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
901 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
916 // them. If they do, all PHI entries for BB1/BB2 mus
1033 BasicBlock *BB2 = BB1->getTerminator()->getSuccessor(0); local
[all...]
H A DPromoteMemoryToRegister.cpp255 /// dominates - Return true if BB1 dominates BB2 using the DominatorTree.
257 bool dominates(BasicBlock *BB1, BasicBlock *BB2) const {
258 return DT.dominates(BB1, BB2);
/external/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp374 MachineBasicBlock *BB2, MachineBasicBlock *KernelBB,
379 MachineBasicBlock *BB2, MachineBasicBlock *KernelBB,
2472 MachineBasicBlock *NewBB, MachineBasicBlock *BB1, MachineBasicBlock *BB2,
2663 NewPhi.addReg(PhiOp2).addMBB(BB2);
2712 MachineBasicBlock *NewBB, MachineBasicBlock *BB1, MachineBasicBlock *BB2,
2755 PhiOp2 = getLoopPhiReg(*InstOp2, BB2);
2780 NewPhi.addReg(PhiOp2).addMBB(BB2);
2471 generateExistingPhis( MachineBasicBlock *NewBB, MachineBasicBlock *BB1, MachineBasicBlock *BB2, MachineBasicBlock *KernelBB, SMSchedule &Schedule, ValueMapTy *VRMap, InstrMapTy &InstrMap, unsigned LastStageNum, unsigned CurStageNum, bool IsLast) argument
2711 generatePhis( MachineBasicBlock *NewBB, MachineBasicBlock *BB1, MachineBasicBlock *BB2, MachineBasicBlock *KernelBB, SMSchedule &Schedule, ValueMapTy *VRMap, InstrMapTy &InstrMap, unsigned LastStageNum, unsigned CurStageNum, bool IsLast) argument
/external/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp895 til::BasicBlock *BB2 = *It ? lookupBlock(*It) : nullptr; local
897 auto *Tm = new (Arena) til::Branch(C, BB1, BB2);

Completed in 1550 milliseconds