69                                 ArrayRef<BasicBlock *> Outgoing,  in setupBranchForGuard()  argument
71   assert(Outgoing.size() > 1);  in setupBranchForGuard()
72   assert(GuardBlocks.size() == Outgoing.size() - 1);  in setupBranchForGuard()
75     BasicBlock *Out = Outgoing[I];  in setupBranchForGuard()
79   BasicBlock *Out = Outgoing[I];  in setupBranchForGuard()
80   BranchInst::Create(Out, Outgoing[I + 1], GuardPredicates[Out],  in setupBranchForGuard()
87                                       ArrayRef<BasicBlock *> Outgoing,  in calcPredicateUsingInteger()  argument
101       auto Succ0Iter = find(Outgoing, Succ0);  in calcPredicateUsingInteger()
102       auto Succ1Iter = find(Outgoing, Succ1);  in calcPredicateUsingInteger()
104           ConstantInt::get(Int32Ty, std::distance(Outgoing.begin(), Succ0Iter));  in calcPredicateUsingInteger()
106           ConstantInt::get(Int32Ty, std::distance(Outgoing.begin(), Succ1Iter));  in calcPredicateUsingInteger()
111       auto SuccIter = Succ0 ? find(Outgoing, Succ0) : find(Outgoing, Succ1);  in calcPredicateUsingInteger()
113           ConstantInt::get(Int32Ty, std::distance(Outgoing.begin(), SuccIter));  in calcPredicateUsingInteger()
118   for (int I = 0, E = Outgoing.size() - 1; I != E; ++I) {  in calcPredicateUsingInteger()
119     BasicBlock *Out = Outgoing[I];  in calcPredicateUsingInteger()
132     ArrayRef<EdgeDescriptor> Branches, ArrayRef<BasicBlock *> Outgoing,  in calcPredicateUsingBooleans()  argument
142   for (int I = 0, E = Outgoing.size() - 1; I != E; ++I) {  in calcPredicateUsingBooleans()
143     BasicBlock *Out = Outgoing[I];  in calcPredicateUsingBooleans()
164     for (int I = 0, E = Outgoing.size() - 1; I != E; ++I) {  in calcPredicateUsingBooleans()
165       BasicBlock *Out = Outgoing[I];  in calcPredicateUsingBooleans()
203     ArrayRef<EdgeDescriptor> Branches, ArrayRef<BasicBlock *> Outgoing,  in convertToGuardPredicates()  argument
208   Function *F = Outgoing.front()->getParent();  in convertToGuardPredicates()
210   for (int I = 0, E = Outgoing.size() - 1; I != E; ++I)  in convertToGuardPredicates()
219   if (!MaxControlFlowBooleans || Outgoing.size() <= *MaxControlFlowBooleans)  in convertToGuardPredicates()
220     calcPredicateUsingBooleans(Branches, Outgoing, GuardBlocks, GuardPredicates,  in convertToGuardPredicates()
223     calcPredicateUsingInteger(Branches, Outgoing, GuardBlocks, GuardPredicates);  in convertToGuardPredicates()
225   setupBranchForGuard(GuardBlocks, Outgoing, GuardPredicates);  in convertToGuardPredicates()
281   SetVector<BasicBlock *> Outgoing;  in finalize()  local
288       Outgoing.insert(Succ0);  in finalize()
290       Outgoing.insert(Succ1);  in finalize()
293   if (Outgoing.size() < 2)  in finalize()
294     return {Outgoing.front(), false};  in finalize()
307   convertToGuardPredicates(Branches, Outgoing.getArrayRef(), GuardBlocks,  in finalize()
313     reconnectPhis(Outgoing[I], GuardBlocks[I], Branches, FirstGuardBlock);  in finalize()
315   reconnectPhis(Outgoing.back(), GuardBlocks.back(), Branches, FirstGuardBlock);  in finalize()
324       Updates.push_back({DominatorTree::Insert, GuardBlocks[I], Outgoing[I]});  in finalize()
331                        Outgoing[NumGuards - 1]});  in finalize()
333                        Outgoing[NumGuards]});  in finalize()