Lines Matching refs:BB1
1037 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2,
1039 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) {
1043 Value *BB1V = PN->getIncomingValueForBlock(BB1);
1053 /// HoistThenElseCodeToIf - Given a conditional branch that goes to BB1 and
1055 /// caller of this function guarantees that BI's block dominates BB1 and BB2.
1059 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
1062 BasicBlock *BB1 = BI->getSuccessor(0); // The true destination.
1065 BasicBlock::iterator BB1_Itr = BB1->begin();
1079 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1094 BIParent->getInstList().splice(BI, BB1->getInstList(), I1);
1117 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
1132 // them. If they do, all PHI entries for BB1/BB2 must agree for all PHI
1135 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) {
1139 Value *BB1V = PN->getIncomingValueForBlock(BB1);
1151 // Make the PHI node use the select for all incoming values for BB1/BB2
1153 if (PN->getIncomingBlock(i) == BB1 || PN->getIncomingBlock(i) == BB2)
1159 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI)
1160 AddPredecessorToBlock(*SI, BIParent, BB1);
1172 BasicBlock *BB1 = BI1->getParent();
1184 BasicBlock *BB2 = (Pred0 == BB1) ? Pred1 : Pred0;
1195 Value *BB1V = PN->getIncomingValueForBlock(BB1);
1210 BasicBlock::InstListType::reverse_iterator RI1 = BB1->getInstList().rbegin(),
1211 RE1 = BB1->getInstList().rend(), RI2 = BB2->getInstList().rbegin(),
1301 NewPN->addIncoming(DifferentOp1, BB1);
1312 bool UpdateRE1 = (I1 == BB1->begin()), UpdateRE2 = (I2 == BB2->begin());
1314 BBEnd->getInstList().splice(FirstNonPhiInBBEnd, BB1->getInstList(), I1);
1325 RE1 = BB1->getInstList().rend();
