| /external/swiftshader/third_party/llvm-7.0/llvm/test/MC/AMDGPU/ |
| expressions.s | 48 BB2:
49 s_sub_u32 vcc_lo, vcc_lo, (BB2+4)-BB1
50 // VI: s_sub_u32 vcc_lo, vcc_lo, (BB2+4)-BB1 ; encoding: [0x6a,0xff,0xea,0x80,A,A,A,A]
51 // VI-NEXT: ; fixup A - offset: 4, value: (BB2+4)-BB1, kind: FK_Data_4
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 46 BasicBlock *BB2 = &*FI++;
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, BB3))
[all...] |
| ValueTest.cpp | 197 BasicBlock *BB2 = &*++F->begin();
198 ASSERT_TRUE(BB2);
210 EXPECT_EQ(MST.getLocalSlot(BB2), 2);
230 BasicBlock *BB2 = &*++F->begin();
231 ASSERT_TRUE(BB2);
234 EXPECT_DEATH(MST.getLocalSlot(BB2), "No function incorporated");
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
| DeferredDominanceTest.cpp | 36 " i32 0, label %bb2\n"
37 " i32 1, label %bb2\n"
42 " bb2:\n"
61 BasicBlock *BB2 = &*FI++;
76 // Unnecessary Insert: no edge bb1 -> bb2 after change to bb0.
77 Updates.push_back({DominatorTree::Insert, BB1, BB2});
81 // CFG Change: remove edge bb0 -> bb3 and one duplicate edge bb0 -> bb2.
84 BranchInst::Create(BB1, BB2, ConstantInt::getTrue(F->getContext()), BB0);
114 " i32 0, label %bb2\n"
115 " i32 1, label %bb2\n
[all...] |
| DominatorTreeTest.cpp | 54 " %y3 = invoke i32 @g() to label %bb1 unwind label %bb2\n"
58 "bb2:\n"
67 " %y8 = phi i32 [0, %bb2], [%y4, %bb1]\n"
68 " %y9 = phi i32 [0, %bb2], [%y4, %bb1]\n"
90 BasicBlock *BB2 = &*FI++;
91 BBI = BB2->begin();
107 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
114 EXPECT_TRUE(DT->dominates(BB0, BB2));
120 EXPECT_FALSE(DT->dominates(BB1, BB2));
124 EXPECT_FALSE(DT->dominates(BB2, BB0))
[all...] |
| DomTreeUpdaterTest.cpp | 39 i32 1, label %bb2
44 bb2:
70 BasicBlock *BB2 = &*FI++;
85 // Invalid Insert: no edge bb1 -> bb2 after change to bb0.
86 Updates.push_back({DominatorTree::Insert, BB1, BB2});
108 // Invalid Insert: no edge bb1 -> bb2 after change to bb0.
109 DTU.insertEdgeRelaxed(BB1, BB2);
131 // Remove all case branch to BB2 to test Eager recalculation.
134 if (i->getCaseSuccessor() == BB2) {
136 BB2->removePredecessor(BB0)
[all...] |
| ValueTest.cpp | 210 BasicBlock *BB2 = &*++F->begin();
211 ASSERT_TRUE(BB2);
223 EXPECT_EQ(MST.getLocalSlot(BB2), 2);
243 BasicBlock *BB2 = &*++F->begin();
244 ASSERT_TRUE(BB2);
247 EXPECT_DEATH(MST.getLocalSlot(BB2), "No function incorporated");
|
| BasicBlockTest.cpp | 33 std::unique_ptr<BasicBlock> BB2(BasicBlock::Create(Context));
34 BranchInst::Create(BB.get(), BB2.get());
63 PN.addIncoming(UndefValue::get(Int32Ty), BB2.get());
85 EXPECT_EQ(BB2.get(), PN.getIncomingBlock(2));
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
| BlockFrequencyInfoTest.cpp | 44 " br i1 %y1, label %bb1, label %bb2 \n"
47 "bb2:\n"
50 " %y2 = phi i32 [0, %bb1], [1, %bb2] \n"
66 BasicBlock *BB2 = BB0.getTerminator()->getSuccessor(1);
71 uint64_t BB2Freq = BFI.getBlockFreq(BB2).getFrequency();
81 EXPECT_EQ(BFI.getBlockProfileCount(BB2).getValue(), 100 * BB2Freq / BB0Freq);
83 // Scale the frequencies of BB0, BB1 and BB2 by a factor of two.
84 SmallPtrSet<BasicBlock *, 4> BlocksToScale({BB1, BB2});
88 EXPECT_EQ(BFI.getBlockFreq(BB2).getFrequency(), 2 * BB2Freq);
|
| ProfileSummaryInfoTest.cpp | 58 " br i1 %y1, label %bb1, label %bb2, !prof !23 \n"
62 "bb2:\n"
66 " %y2 = phi i32 [0, %bb1], [1, %bb2] \n"
155 BasicBlock *BB2 = BB0.getTerminator()->getSuccessor(1);
161 EXPECT_FALSE(PSI.isHotBB(BB2, &BFI));
165 auto *CI2 = BB2->getFirstNonPHI();
187 BasicBlock *BB2 = BB0.getTerminator()->getSuccessor(1);
193 EXPECT_FALSE(PSI.isHotBB(BB2, &BFI));
197 auto *CI2 = BB2->getFirstNonPHI();
|
| /external/llvm/unittests/Analysis/ |
| BlockFrequencyInfoTest.cpp | 45 " br i1 %y1, label %bb1, label %bb2 \n"
48 "bb2:\n"
51 " %y2 = phi i32 [0, %bb1], [1, %bb2] \n"
67 BasicBlock *BB2 = BB0.getTerminator()->getSuccessor(1);
72 uint64_t BB2Freq = BFI.getBlockFreq(BB2).getFrequency();
82 EXPECT_EQ(BFI.getBlockProfileCount(BB2).getValue(), 100 * BB2Freq / BB0Freq);
|
| /external/llvm/lib/Target/Mips/ |
| MipsMCInstLower.h | 39 MCOperand createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2,
|
| MipsMCInstLower.cpp | 206 MachineBasicBlock *BB2,
209 const MCSymbolRefExpr *Sym2 = MCSymbolRefExpr::create(BB2->getSymbol(), *Ctx);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Mips/ |
| MipsMCInstLower.h | 44 MCOperand createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2,
|
| MipsMCInstLower.cpp | 206 MachineBasicBlock *BB2,
209 const MCSymbolRefExpr *Sym2 = MCSymbolRefExpr::create(BB2->getSymbol(), *Ctx);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Utils/ |
| Cloning.cpp | 217 BasicBlock *BB2 = BasicBlock::Create(context, "", F);
218 IRBuilder<> Builder2(BB2);
220 Builder1.CreateBr(BB2);
229 auto Split = DuplicateInstructionsInSplitBetween(BB2, BB1, SubInst, Mapping);
264 BasicBlock *BB2 = BasicBlock::Create(context, "", F);
265 IRBuilder<> Builder2(BB2);
267 Builder1.CreateBr(BB2);
272 Builder2.CreateBr(BB2);
276 auto Split = DuplicateInstructionsInSplitBetween(BB2, BB2, BB2->getTerminator(), Mapping)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/FuzzMutate/ |
| OperationsTest.cpp | 202 // moves to BB2.
207 auto *BB2 = CondBr->getSuccessor(1);
208 EXPECT_THAT(AI->getParent(), Eq(BB2));
209 EXPECT_THAT(RI->getParent(), Eq(BB2));
256 auto *BB2 = BasicBlock::Create(Ctx, "BB2", F);
258 BranchInst::Create(BB2, BB3, ConstantInt::getFalse(Ctx), BB1);
259 BranchInst::Create(BB3, BB2);
264 PHI1->addIncoming(ConstantInt::get(Int8Ty, 1), BB2);
267 PHI2->addIncoming(ConstantInt::get(Int8Ty, 0), BB2);
[all...] |
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 122 // 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);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| CFGMST.h | 53 // 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) {
57 BBInfo *BB2G = findAndCompressGroup(&getBBInfo(BB2));
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CFG.cpp | 122 // 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);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| CFGMST.h | 60 // Union BB1 and BB2 into the same group and return true.
61 // Returns false if BB1 and BB2 are already in the same group.
62 bool unionGroups(const BasicBlock *BB1, const BasicBlock *BB2) {
64 BBInfo *BB2G = findAndCompressGroup(&getBBInfo(BB2));
|
| /external/llvm/lib/Transforms/Scalar/ |
| ConstantHoisting.cpp | 157 BasicBlock *BB, *BB1, *BB2;
159 BB2 = *std::next(BBs.begin());
160 BB = DT->findNearestCommonDominator(BB1, BB2);
164 BBs.erase(BB2);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 642 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
644 llvm::sort(BB2.begin(), BB2.end());
645 return BB1 == BB2;
|
| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 153 /// 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, BB1)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 248 /// Two blocks BB1 and BB2 are in the same equivalence class if they
856 /// A block BB2 will be in the same equivalence class as \p BB1 if
859 /// 1- \p BB1 is a descendant of BB2 in the opposite tree. So, if BB2
[all...] |
