HomeSort by: relevance | last modified time | path
    Searched defs:BB2 (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
PostDominators.cpp 59 const BasicBlock *BB2 = I2->getParent();
61 if (BB1 != BB2)
62 return Base::dominates(BB1, BB2);
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
ThreadSafetyCommon.cpp 917 til::BasicBlock *BB2 = *It ? lookupBlock(*It) : nullptr;
919 auto *Tm = new (Arena) til::Branch(C, BB1, BB2);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 343 BasicBlock *BB, *BB1, *BB2;
345 BB2 = BBs.pop_back_val();
346 BB = DT->findNearestCommonDominator(BB1, BB2);
  /src/external/gpl3/gcc.old/dist/libgcc/config/avr/
lib1funcs.S 1260 #define BB2 BB0+2
1283 wmov B2, BB2
1325 #undef BB2
  /src/external/gpl3/gcc/dist/libgcc/config/avr/
lib1funcs.S 1265 #define BB2 BB0+2
1288 wmov B2, BB2
1330 #undef BB2
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 1379 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2,
1384 Value *BB2V = PN.getIncomingValueForBlock(BB2);
1395 /// Given a conditional branch that goes to BB1 and BB2, hoist any common code
1397 /// guarantees that BI's block dominates BB1 and BB2. If EqTermsOnly is given,
1405 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
1409 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination
1412 BasicBlock::iterator BB2_Itr = BB2->begin();
1426 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)) ||
1489 BB2->getInstList(), I2);
1541 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)
    [all...]

Completed in 146 milliseconds