| /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");
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/crypto/chacha20poly1305/ |
| chacha20poly1305_amd64.s | 70 #define BB2 Y10
850 VMOVDQA state1StoreAVX2, BB0; VMOVDQA BB0, BB1; VMOVDQA BB0, BB2; VMOVDQA BB0, BB3
860 VPADDD BB0, AA0, AA0; VPADDD BB1, AA1, AA1; VPADDD BB2, AA2, AA2; VPADDD BB3, AA3, AA3
866 VPXOR CC0, BB0, BB0; VPXOR CC1, BB1, BB1; VPXOR CC2, BB2, BB2; VPXOR CC3, BB3, BB3
871 VPSLLD $12, BB2, CC3; VPSRLD $20, BB2, BB2; VPXOR CC3, BB2, BB2
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/crypto/chacha20poly1305/ |
| chacha20poly1305_amd64.s | 70 #define BB2 Y10
850 VMOVDQA state1StoreAVX2, BB0; VMOVDQA BB0, BB1; VMOVDQA BB0, BB2; VMOVDQA BB0, BB3
860 VPADDD BB0, AA0, AA0; VPADDD BB1, AA1, AA1; VPADDD BB2, AA2, AA2; VPADDD BB3, AA3, AA3
866 VPXOR CC0, BB0, BB0; VPXOR CC1, BB1, BB1; VPXOR CC2, BB2, BB2; VPXOR CC3, BB3, BB3
871 VPSLLD $12, BB2, CC3; VPSRLD $20, BB2, BB2; VPXOR CC3, BB2, BB2
[all...] |
| /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/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/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);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 573 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
575 std::sort(BB2.begin(), BB2.end());
576 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LoopInfoImpl.h | 554 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
556 std::sort(BB2.begin(), BB2.end());
557 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LoopInfoImpl.h | 554 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
556 std::sort(BB2.begin(), BB2.end());
557 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 573 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
575 std::sort(BB2.begin(), BB2.end());
576 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LoopInfoImpl.h | 554 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
556 std::sort(BB2.begin(), BB2.end());
557 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LoopInfoImpl.h | 554 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
556 std::sort(BB2.begin(), BB2.end());
557 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 return BB1 == BB2;
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LoopInfoImpl.h | 574 bool compareVectors(std::vector<T> &BB1, std::vector<T> &BB2) {
576 std::sort(BB2.begin(), BB2.end());
577 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...] |
