1947               const BBSetVector &Outgoing) {  in redirectToHub()  argument
1955   Succ0 = Outgoing.count(Succ0) ? Succ0 : nullptr;  in redirectToHub()
1962     Succ1 = Outgoing.count(Succ1) ? Succ1 : nullptr;  in redirectToHub()
1986                                 const BBSetVector &Outgoing,  in setupBranchForGuard()  argument
1990   GuardBlocks.push_back(Outgoing.back());  in setupBranchForGuard()
1993     auto Out = Outgoing[i];  in setupBranchForGuard()
2006     const BBSetVector &Incoming, const BBSetVector &Outgoing,  in calcPredicateUsingInteger()  argument
2019         redirectToHub(In, FirstGuardBlock, Outgoing);  in calcPredicateUsingInteger()
2023       auto Succ0Iter = find(Outgoing, Succ0);  in calcPredicateUsingInteger()
2024       auto Succ1Iter = find(Outgoing, Succ1);  in calcPredicateUsingInteger()
2026                                     std::distance(Outgoing.begin(), Succ0Iter));  in calcPredicateUsingInteger()
2028                                     std::distance(Outgoing.begin(), Succ1Iter));  in calcPredicateUsingInteger()
2033       auto SuccIter = Succ0 ? find(Outgoing, Succ0) : find(Outgoing, Succ1);  in calcPredicateUsingInteger()
2035                                     std::distance(Outgoing.begin(), SuccIter));  in calcPredicateUsingInteger()
2040   for (int i = 0, e = Outgoing.size() - 1; i != e; ++i) {  in calcPredicateUsingInteger()
2041     auto Out = Outgoing[i];  in calcPredicateUsingInteger()
2051     const BBSetVector &Incoming, const BBSetVector &Outgoing,  in calcPredicateUsingBooleans()  argument
2061   for (int i = 0, e = Outgoing.size() - 1; i != e; ++i) {  in calcPredicateUsingBooleans()
2062     auto Out = Outgoing[i];  in calcPredicateUsingBooleans()
2076         redirectToHub(In, FirstGuardBlock, Outgoing);  in calcPredicateUsingBooleans()
2086     for (int i = 0, e = Outgoing.size() - 1; i != e; ++i) {  in calcPredicateUsingBooleans()
2087       auto Out = Outgoing[i];  in calcPredicateUsingBooleans()
2123                          const BBSetVector &Outgoing, const StringRef Prefix,  in convertToGuardPredicates()  argument
2128   for (int i = 0, e = Outgoing.size() - 1; i != e; ++i)  in convertToGuardPredicates()
2137   if (!MaxControlFlowBooleans || Outgoing.size() <= *MaxControlFlowBooleans)  in convertToGuardPredicates()
2138     calcPredicateUsingBooleans(Incoming, Outgoing, GuardBlocks, GuardPredicates,  in convertToGuardPredicates()
2141     calcPredicateUsingInteger(Incoming, Outgoing, GuardBlocks, GuardPredicates);  in convertToGuardPredicates()
2143   setupBranchForGuard(GuardBlocks, Outgoing, GuardPredicates);  in convertToGuardPredicates()
2148     const BBSetVector &Incoming, const BBSetVector &Outgoing,  in CreateControlFlowHub()  argument
2150   if (Outgoing.size() < 2)  in CreateControlFlowHub()
2151     return Outgoing.front();  in CreateControlFlowHub()
2157         if (Outgoing.count(Succ))  in CreateControlFlowHub()
2163   convertToGuardPredicates(GuardBlocks, DeletionCandidates, Incoming, Outgoing,  in CreateControlFlowHub()
2169     reconnectPhis(Outgoing[i], GuardBlocks[i], Incoming, FirstGuardBlock);  in CreateControlFlowHub()
2171   reconnectPhis(Outgoing.back(), GuardBlocks.back(), Incoming, FirstGuardBlock);  in CreateControlFlowHub()
2175     assert((int)Outgoing.size() == NumGuards + 1);  in CreateControlFlowHub()
2181       Updates.push_back({DominatorTree::Insert, GuardBlocks[i], Outgoing[i]});  in CreateControlFlowHub()
2186                        Outgoing[NumGuards - 1]});  in CreateControlFlowHub()
2188                        Outgoing[NumGuards]});  in CreateControlFlowHub()