242     std::queue<uint64_t> Queue;  in findAugmentingPath()  local
243     Queue.push(Source);  in findAugmentingPath()
246     while (!Queue.empty()) {  in findAugmentingPath()
247       uint64_t Src = Queue.front();  in findAugmentingPath()
248       Queue.pop();  in findAugmentingPath()
282               Queue.push(Dst);  in findAugmentingPath()
649     std::queue<uint64_t> Queue;  in findReachable()  local
650     Queue.push(Src);  in findReachable()
652     while (!Queue.empty()) {  in findReachable()
653       Src = Queue.front();  in findReachable()
654       Queue.pop();  in findReachable()
658           Queue.push(Dst);  in findReachable()
694     std::set<std::pair<uint64_t, uint64_t>> Queue;  in findShortestPath()  local
695     Queue.insert(std::make_pair(Distance[Source], Source));  in findShortestPath()
698     while (!Queue.empty()) {  in findShortestPath()
699       uint64_t Src = Queue.begin()->second;  in findShortestPath()
700       Queue.erase(Queue.begin());  in findShortestPath()
710           Queue.erase(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
715           Queue.insert(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
829     std::queue<uint64_t> Queue;  in findUnknownSubgraph()  local
831     Queue.push(SrcBlock->Index);  in findUnknownSubgraph()
833     while (!Queue.empty()) {  in findUnknownSubgraph()
834       auto &Block = Func.Blocks[Queue.front()];  in findUnknownSubgraph()
835       Queue.pop();  in findUnknownSubgraph()
851           Queue.push(Dst);  in findUnknownSubgraph()
943     std::queue<uint64_t> Queue;  in isAcyclicSubgraph()  local
944     Queue.push(SrcBlock->Index);  in isAcyclicSubgraph()
945     while (!Queue.empty()) {  in isAcyclicSubgraph()
946       FlowBlock *Block = &Func.Blocks[Queue.front()];  in isAcyclicSubgraph()
947       Queue.pop();  in isAcyclicSubgraph()
963           Queue.push(Dst);  in isAcyclicSubgraph()
1295   std::queue<uint64_t> Queue;  in verifyOutput()  local
1297   Queue.push(Func.Entry);  in verifyOutput()
1299   while (!Queue.empty()) {  in verifyOutput()
1300     uint64_t Src = Queue.front();  in verifyOutput()
1301     Queue.pop();  in verifyOutput()
1304         Queue.push(Dst);  in verifyOutput()