HomeSort by relevance Sort by last modified time
    Searched defs:BB1 (Results 1 - 10 of 10) sorted by null

  /external/clang/test/SemaCXX/
warn-reorder-ctor-initialization.cpp 5 struct BB1 {};
7 class complex : public BB, BB1 {
12 s3(3), // expected-warning {{field 's3' will be initialized after base 'BB1'}}
13 BB1(), // expected-warning {{base class 'BB1' will be initialized after base 'BB'}}
  /external/llvm/unittests/IR/
DominatorTreeTest.cpp 41 BasicBlock *BB1 = &*FI++;
42 BBI = BB1->begin();
61 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
68 EXPECT_TRUE(DT->dominates(BB0, BB1));
73 EXPECT_FALSE(DT->dominates(BB1, BB0));
74 EXPECT_TRUE(DT->dominates(BB1, BB1));
75 EXPECT_FALSE(DT->dominates(BB1, BB2));
76 EXPECT_TRUE(DT->dominates(BB1, BB3));
77 EXPECT_FALSE(DT->dominates(BB1, BB4))
    [all...]
InstructionsTest.cpp 88 BasicBlock *BB1 = BasicBlock::Create(Ctx, "", F);
94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
110 BasicBlock* bb1 = BasicBlock::Create(C); local
131 BranchInst* b1 = BranchInst::Create(bb0, bb1, One);
150 EXPECT_EQ(bb1, *b);
151 EXPECT_EQ(bb1, b1->getOperand(1));
152 EXPECT_EQ(bb1, b1->getSuccessor(1));
168 delete bb1;
MetadataTest.cpp 350 auto *BB1 = BasicBlock::Create(Context, "entry", F1);
352 auto *R1 = ReturnInst::Create(Context, BB1);
378 auto *BB1 = BasicBlock::Create(Context, "entry", F1);
384 CallInst::Create(Intrinsic, MAV1, "", BB1);
    [all...]
  /external/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 253 BasicBlock *BB, *BB1, *BB2;
254 BB1 = *BBs.begin();
256 BB = DT->findNearestCommonDominator(BB1, BB2);
259 BBs.erase(BB1);
  /external/clang/lib/Analysis/
ThreadSafetyCommon.cpp 893 til::BasicBlock *BB1 = *It ? lookupBlock(*It) : nullptr;
897 auto *Tm = new (Arena) til::Branch(C, BB1, BB2);
    [all...]
  /external/llvm/lib/Transforms/Utils/
IntegerDivision.cpp 193 // | | bb1 |
228 BasicBlock *BB1 = BasicBlock::Create(Builder.getContext(),
229 "udiv-bb1", F, End);
250 // ; br i1 %earlyRet, label %end, label %bb1
263 Builder.CreateCondBr(EarlyRet, End, BB1);
265 // ; bb1: ; preds = %special-cases
271 Builder.SetInsertPoint(BB1);
278 // ; preheader: ; preds = %bb1
324 // ; loop-exit: ; preds = %do-while, %bb1
325 // ; %carry_2 = phi i32 [ 0, %bb1 ], [ %carry, %do-while
    [all...]
SimplifyCFG.cpp     [all...]
  /external/llvm/lib/Transforms/IPO/
SampleProfile.cpp 142 void findEquivalencesFor(BasicBlock *BB1,
173 /// Two blocks BB1 and BB2 are in the same equivalence class if they
713 /// number of times as \p BB1. To do this, it traverses all the
714 /// descendants of \p BB1 in the dominator or post-dominator tree.
716 /// A block BB2 will be in the same equivalence class as \p BB1 if
719 /// 1- \p BB1 is a descendant of BB2 in the opposite tree. So, if BB2
720 /// is a descendant of \p BB1 in the dominator tree, then BB2 should
721 /// dominate BB1 in the post-dominator tree.
723 /// 2- Both BB2 and \p BB1 must be in the same loop.
726 /// equivalence class to \p BB1
    [all...]
  /toolchain/binutils/binutils-2.25/include/opcode/
m88k.h 300 #define BB1 STD+5

Completed in 3838 milliseconds