Lines Matching refs:Flow
115 if (Edge.Flow > 0) { in run()
116 TotalCost += Edge.Cost * Edge.Flow; in run()
118 TotalFlow += Edge.Flow; in run()
141 SrcEdge.Flow = 0; in addEdge()
148 DstEdge.Flow = 0; in addEdge()
163 std::vector<std::pair<uint64_t, int64_t>> Flow; in getFlow() local
165 if (Edge.Flow > 0) in getFlow()
166 Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow)); in getFlow()
168 return Flow; in getFlow()
173 int64_t Flow = 0; in getFlow() local
176 Flow += Edge.Flow; in getFlow()
179 return Flow; in getFlow()
223 assert(Edge.Capacity >= Edge.Flow && "incorrect edge flow"); in computeAugmentingPathCapacity()
224 uint64_t EdgeCapacity = uint64_t(Edge.Capacity - Edge.Flow); in computeAugmentingPathCapacity()
272 if (Edge.Flow < Edge.Capacity) { in findAugmentingPath()
302 Edge.Flow += PathCapacity; in augmentFlowAlongPath()
303 RevEdge.Flow -= PathCapacity; in augmentFlowAlongPath()
428 uint64_t MaxIntFlow = double(Edge->Capacity - Edge->Flow) / EdgeFlow; in augmentFlowAlongDAG()
449 EdgeFlow = std::min(EdgeFlow, uint64_t(Edge->Capacity - Edge->Flow)); in augmentFlowAlongDAG()
482 assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow); in augmentFlowAlongDAG()
485 Edge->Flow += Edge->AugmentedFlow; in augmentFlowAlongDAG()
486 RevEdge.Flow -= Edge->AugmentedFlow; in augmentFlowAlongDAG()
487 if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0) in augmentFlowAlongDAG()
517 Edge.Capacity > Edge.Flow && in identifyShortestEdges()
518 uint64_t(Edge.Capacity - Edge.Flow) >= MinCapacity; in identifyShortestEdges()
557 int64_t Flow; member
627 if (Block.Flow > 0 && !Visited[I]) { in joinIsolatedComponents()
633 Func.Blocks[Func.Entry].Flow += 1; in joinIsolatedComponents()
635 Jump->Flow += 1; in joinIsolatedComponents()
636 Func.Blocks[Jump->Target].Flow += 1; in joinIsolatedComponents()
657 if (Jump->Flow > 0 && !Visited[Dst]) { in findReachable()
758 std::min(Func.Blocks[Func.Entry].Flow, in jumpDistance()
760 if (Jump->Flow > 0) in jumpDistance()
761 return BaseDistance + BaseDistance / Jump->Flow; in jumpDistance()
804 if (SrcBlock->HasUnknownWeight || SrcBlock->Flow == 0) in canRebalanceAtRoot()
900 if (Jump->IsUnlikely && Jump->Flow == 0) in ignoreJump()
915 if (!JumpTarget->HasUnknownWeight && JumpTarget->Flow == 0) in ignoreJump()
981 assert(SrcBlock->Flow > 0 && "zero-flow block in unknown subgraph"); in rebalanceUnknownSubgraph()
989 BlockFlow += Jump->Flow; in rebalanceUnknownSubgraph()
999 BlockFlow += Jump->Flow; in rebalanceUnknownSubgraph()
1001 Block->Flow = BlockFlow; in rebalanceUnknownSubgraph()
1028 uint64_t Flow = std::min(SuccFlow, BlockFlow); in rebalanceBlock() local
1029 Jump->Flow = Flow; in rebalanceBlock()
1030 BlockFlow -= Flow; in rebalanceBlock()
1195 int64_t Flow = 0; in extractWeights() local
1198 Flow = int64_t(Jump.Weight) + AuxFlow; in extractWeights()
1200 Flow = int64_t(Jump.Weight) + (AuxFlow > 0 ? AuxFlow : 0); in extractWeights()
1202 Jump.Flow = Flow; in extractWeights()
1203 assert(Flow >= 0 && "negative jump flow"); in extractWeights()
1210 InFlow[Jump.Target] += Jump.Flow; in extractWeights()
1211 OutFlow[Jump.Source] += Jump.Flow; in extractWeights()
1215 Block.Flow = std::max(OutFlow[B], InFlow[B]); in extractWeights()
1263 InFlow[Jump.Target] += Jump.Flow; in verifyOutput()
1264 OutFlow[Jump.Source] += Jump.Flow; in verifyOutput()
1272 TotalInFlow += Block.Flow; in verifyOutput()
1273 assert(Block.Flow == OutFlow[I] && "incorrectly computed control flow"); in verifyOutput()
1275 TotalOutFlow += Block.Flow; in verifyOutput()
1276 assert(Block.Flow == InFlow[I] && "incorrectly computed control flow"); in verifyOutput()
1278 assert(Block.Flow == OutFlow[I] && "incorrectly computed control flow"); in verifyOutput()
1279 assert(Block.Flow == InFlow[I] && "incorrectly computed control flow"); in verifyOutput()
1289 if (Jump.Flow > 0) { in verifyOutput()
1314 assert((Visited[I] || Block.Flow == 0) && "an isolated flow component"); in verifyOutput()
1329 Block.Flow = Block.Weight; in applyFlowInference()
1334 Jump.Flow = Jump.Weight; in applyFlowInference()