Lines Matching refs:Dst

120   void addEdge(uint64_t Src, uint64_t Dst, int64_t Capacity, int64_t Cost) {  in addEdge()  argument
122 assert(Src != Dst && "loop edge are not supported"); in addEdge()
125 SrcEdge.Dst = Dst; in addEdge()
129 SrcEdge.RevEdgeIndex = Edges[Dst].size(); in addEdge()
132 DstEdge.Dst = Src; in addEdge()
139 Edges[Dst].push_back(DstEdge); in addEdge()
143 void addEdge(uint64_t Src, uint64_t Dst, int64_t Cost) { in addEdge() argument
144 addEdge(Src, Dst, INF, Cost); in addEdge()
153 Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow)); in getFlow()
159 int64_t getFlow(uint64_t Src, uint64_t Dst) const { in getFlow()
162 if (Edge.Dst == Dst) { in getFlow()
265 uint64_t Dst = Edge.Dst; in findAugmentingPath() local
267 if (Nodes[Dst].Distance > NewDistance) { in findAugmentingPath()
269 Nodes[Dst].Distance = NewDistance; in findAugmentingPath()
270 Nodes[Dst].ParentNode = Src; in findAugmentingPath()
271 Nodes[Dst].ParentEdgeIndex = EdgeIdx; in findAugmentingPath()
273 if (!Nodes[Dst].Taken) { in findAugmentingPath()
274 Queue.push(Dst); in findAugmentingPath()
275 Nodes[Dst].Taken = true; in findAugmentingPath()
340 auto &Dst = Nodes[Edge.Dst]; in findAugmentingDAG() local
345 if (Dst.Discovery == 0 && Dst.NumCalls < SampleProfileMaxDfsCalls) { in findAugmentingDAG()
346 Dst.Discovery = ++Time; in findAugmentingDAG()
347 Stack.emplace(Edge.Dst, 0); in findAugmentingDAG()
348 Dst.NumCalls++; in findAugmentingDAG()
349 } else if (Dst.Taken && Dst.Finish != 0) { in findAugmentingDAG()
380 uint64_t Dst = Edge.Dst; in findAugmentingDAG() local
381 if (Edge.OnShortestPath && Nodes[Src].Taken && Nodes[Dst].Taken && in findAugmentingDAG()
382 Nodes[Dst].Finish < Nodes[Src].Finish) { in findAugmentingDAG()
417 Nodes[Edge->Dst].FracFlow += EdgeFlow; in augmentFlowAlongDAG()
439 uint64_t Dst = Edge->Dst; in augmentFlowAlongDAG() local
442 Nodes[Dst].IntFlow += EdgeFlow; in augmentFlowAlongDAG()
458 uint64_t Dst = Edge->Dst; in augmentFlowAlongDAG() local
459 if (Nodes[Dst].IntFlow == 0) in augmentFlowAlongDAG()
461 uint64_t EdgeFlow = std::min(Nodes[Dst].IntFlow, Edge->AugmentedFlow); in augmentFlowAlongDAG()
462 Nodes[Dst].IntFlow -= EdgeFlow; in augmentFlowAlongDAG()
476 auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex]; in augmentFlowAlongDAG()
504 uint64_t Dst = Edge.Dst; in identifyShortestEdges() local
506 Src != Target && Dst != Source && in identifyShortestEdges()
507 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges()
508 Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost && in identifyShortestEdges()
548 uint64_t Dst; member
644 uint64_t Dst = Jump->Target; in findReachable() local
645 if (Jump->Flow > 0 && !Visited[Dst]) { in findReachable()
646 Queue.push(Dst); in findReachable()
647 Visited[Dst] = true; in findReachable()
695 uint64_t Dst = Jump->Target; in findShortestPath() local
697 if (Distance[Dst] > Distance[Src] + JumpDist) { in findShortestPath()
698 Queue.erase(std::make_pair(Distance[Dst], Dst)); in findShortestPath()
700 Distance[Dst] = Distance[Src] + JumpDist; in findShortestPath()
701 Parent[Dst] = Jump; in findShortestPath()
703 Queue.insert(std::make_pair(Distance[Dst], Dst)); in findShortestPath()
831 uint64_t Dst = Jump->Target; in findUnknownSubgraph() local
833 if (Visited[Dst]) in findUnknownSubgraph()
836 Visited[Dst] = true; in findUnknownSubgraph()
837 if (!Func.Blocks[Dst].UnknownWeight) { in findUnknownSubgraph()
838 KnownDstBlocks.push_back(&Func.Blocks[Dst]); in findUnknownSubgraph()
840 Queue.push(Dst); in findUnknownSubgraph()
841 UnknownBlocks.push_back(&Func.Blocks[Dst]); in findUnknownSubgraph()
949 uint64_t Dst = Jump->Target; in isAcyclicSubgraph() local
950 LocalInDegree[Dst]--; in isAcyclicSubgraph()
951 if (LocalInDegree[Dst] == 0) { in isAcyclicSubgraph()
952 Queue.push(Dst); in isAcyclicSubgraph()
1118 uint64_t Dst = Jump.Target; in initializeNetwork() local
1119 if (Src != Dst) { in initializeNetwork()
1121 uint64_t DstIn = 3 * Dst; in initializeNetwork()
1155 uint64_t Dst = Jump.Target; in extractWeights() local
1157 if (Src != Dst) { in extractWeights()
1159 uint64_t DstIn = 3 * Dst; in extractWeights()
1219 for (uint64_t Dst : PositiveFlowEdges[Src]) { in verifyWeights() local
1220 if (!Visited[Dst]) { in verifyWeights()
1221 Queue.push(Dst); in verifyWeights()
1222 Visited[Dst] = true; in verifyWeights()