251   SmallVector<RegionNode *, 8> Order;  member in __anon821ac72d0111::StructurizeCFG
380   Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion),  in INITIALIZE_PASS_DEPENDENCY()
382   if (Order.empty())  in INITIALIZE_PASS_DEPENDENCY()
390   unsigned I = 0, E = Order.size();  in INITIALIZE_PASS_DEPENDENCY()
409         Order[I++] = N.first;  in INITIALIZE_PASS_DEPENDENCY()
424     Nodes.insert(Order.begin() + I, Order.begin() + E - 1);  in INITIALIZE_PASS_DEPENDENCY()
427     EntryNode.first = Order[E - 1];  in INITIALIZE_PASS_DEPENDENCY()
534   for (RegionNode *RN : reverse(Order)) {  in collectInfos()
852   BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :  in getNextFlow()
853                        Order.back()->getEntry();  in getNextFlow()
890   if (!Order.empty() || !ExitUseAllowed)  in needPostfix()
940   RegionNode *Node = Order.pop_back_val();  in wireFlow()
965     while (!Order.empty() && !Visited.count(LoopEnd) &&  in wireFlow()
966            dominatesPredicates(Entry, Order.back())) {  in wireFlow()
977   RegionNode *Node = Order.back();  in handleLoops()
1021   while (!Order.empty()) {  in createFlow()
1190   Order.clear();  in run()