251   SmallVector<RegionNode *, 8> Order;  member in __anon4b9e022b0111::StructurizeCFG
373   Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion),  in INITIALIZE_PASS_DEPENDENCY()
375   if (Order.empty())  in INITIALIZE_PASS_DEPENDENCY()
383   unsigned I = 0, E = Order.size();  in INITIALIZE_PASS_DEPENDENCY()
402         Order[I++] = N.first;  in INITIALIZE_PASS_DEPENDENCY()
417     Nodes.insert(Order.begin() + I, Order.begin() + E - 1);  in INITIALIZE_PASS_DEPENDENCY()
420     EntryNode.first = Order[E - 1];  in INITIALIZE_PASS_DEPENDENCY()
527   for (RegionNode *RN : reverse(Order)) {  in collectInfos()
735   BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :  in getNextFlow()
736                        Order.back()->getEntry();  in getNextFlow()
766   if (!Order.empty() || !ExitUseAllowed)  in needPostfix()
816   RegionNode *Node = Order.pop_back_val();  in wireFlow()
839     while (!Order.empty() && !Visited.count(LoopEnd) &&  in wireFlow()
840            dominatesPredicates(Entry, Order.back())) {  in wireFlow()
851   RegionNode *Node = Order.back();  in handleLoops()
907   while (!Order.empty()) {  in createFlow()
1073   Order.clear();  in run()