234     std::queue<uint64_t> Queue;  in findAugmentingPath()  local
235     Queue.push(Source);  in findAugmentingPath()
238     while (!Queue.empty()) {  in findAugmentingPath()
239       uint64_t Src = Queue.front();  in findAugmentingPath()
240       Queue.pop();  in findAugmentingPath()
274               Queue.push(Dst);  in findAugmentingPath()
637     std::queue<uint64_t> Queue;  in findReachable()  local
638     Queue.push(Src);  in findReachable()
640     while (!Queue.empty()) {  in findReachable()
641       Src = Queue.front();  in findReachable()
642       Queue.pop();  in findReachable()
646           Queue.push(Dst);  in findReachable()
682     std::set<std::pair<uint64_t, uint64_t>> Queue;  in findShortestPath()  local
683     Queue.insert(std::make_pair(Distance[Source], Source));  in findShortestPath()
686     while (!Queue.empty()) {  in findShortestPath()
687       uint64_t Src = Queue.begin()->second;  in findShortestPath()
688       Queue.erase(Queue.begin());  in findShortestPath()
698           Queue.erase(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
703           Queue.insert(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
818     std::queue<uint64_t> Queue;  in findUnknownSubgraph()  local
820     Queue.push(SrcBlock->Index);  in findUnknownSubgraph()
822     while (!Queue.empty()) {  in findUnknownSubgraph()
823       auto &Block = Func.Blocks[Queue.front()];  in findUnknownSubgraph()
824       Queue.pop();  in findUnknownSubgraph()
840           Queue.push(Dst);  in findUnknownSubgraph()
932     std::queue<uint64_t> Queue;  in isAcyclicSubgraph()  local
933     Queue.push(SrcBlock->Index);  in isAcyclicSubgraph()
934     while (!Queue.empty()) {  in isAcyclicSubgraph()
935       FlowBlock *Block = &Func.Blocks[Queue.front()];  in isAcyclicSubgraph()
936       Queue.pop();  in isAcyclicSubgraph()
952           Queue.push(Dst);  in isAcyclicSubgraph()
1212   std::queue<uint64_t> Queue;  in verifyWeights()  local
1214   Queue.push(Func.Entry);  in verifyWeights()
1216   while (!Queue.empty()) {  in verifyWeights()
1217     uint64_t Src = Queue.front();  in verifyWeights()
1218     Queue.pop();  in verifyWeights()
1221         Queue.push(Dst);  in verifyWeights()