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

  /external/llvm/unittests/IR/
DominatorTreeTest.cpp 37 BasicBlock *BB1 = FI++;
38 BBI = BB1->begin();
57 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
64 EXPECT_TRUE(DT->dominates(BB0, BB1));
69 EXPECT_FALSE(DT->dominates(BB1, BB0));
70 EXPECT_TRUE(DT->dominates(BB1, BB1));
71 EXPECT_FALSE(DT->dominates(BB1, BB2));
72 EXPECT_TRUE(DT->dominates(BB1, BB3));
73 EXPECT_FALSE(DT->dominates(BB1, BB4))
    [all...]
  /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/lib/Analysis/
CFG.cpp 128 // True if there is a loop which contains both BB1 and BB2.
130 const BasicBlock *BB1, const BasicBlock *BB2) {
131 const Loop *L1 = getOutermostLoop(LI, BB1);
  /external/llvm/lib/Transforms/Utils/
IntegerDivision.cpp 152 // | | bb1 |
187 BasicBlock *BB1 = BasicBlock::Create(Builder.getContext(),
188 "udiv-bb1", F, End);
207 // ; br i1 %earlyRet, label %end, label %bb1
220 Builder.CreateCondBr(EarlyRet, End, BB1);
222 // ; bb1: ; preds = %special-cases
228 Builder.SetInsertPoint(BB1);
235 // ; preheader: ; preds = %bb1
281 // ; loop-exit: ; preds = %do-while, %bb1
282 // ; %carry_2 = phi i32 [ 0, %bb1 ], [ %carry, %do-while
    [all...]
SimplifyCFG.cpp     [all...]
  /external/llvm/lib/Transforms/IPO/
MergeFunctions.cpp 176 bool compare(const BasicBlock *BB1, const BasicBlock *BB2);
424 bool FunctionComparator::compare(const BasicBlock *BB1, const BasicBlock *BB2) {
425 BasicBlock::const_iterator F1I = BB1->begin(), F1E = BB1->end();

Completed in 228 milliseconds