622         for (auto &Jump : Path) {  in joinIsolatedComponents()  local
623           Jump->Flow += 1;  in joinIsolatedComponents()
624           Func.Blocks[Jump->Target].Flow += 1;  in joinIsolatedComponents()
626           findReachable(Jump->Target, Visited);  in joinIsolatedComponents()
643       for (auto Jump : Func.Blocks[Src].SuccJumps) {  in findReachable()  local
644         uint64_t Dst = Jump->Target;  in findReachable()
645         if (Jump->Flow > 0 && !Visited[Dst]) {  in findReachable()
694       for (auto Jump : Func.Blocks[Src].SuccJumps) {  in findShortestPath()  local
695         uint64_t Dst = Jump->Target;  in findShortestPath()
696         int64_t JumpDist = jumpDistance(Jump);  in findShortestPath()
701           Parent[Dst] = Jump;  in findShortestPath()
741   int64_t jumpDistance(FlowJump *Jump) const {  in jumpDistance()
746     if (Jump->IsUnlikely)  in jumpDistance()
748     if (Jump->Flow > 0)  in jumpDistance()
749       return BaseDistance + BaseDistance / Jump->Flow;  in jumpDistance()
798     for (auto Jump : SrcBlock->SuccJumps) {  in canRebalanceAtRoot()  local
799       if (Func.Blocks[Jump->Target].UnknownWeight) {  in canRebalanceAtRoot()
826       for (auto Jump : Block.SuccJumps) {  in findUnknownSubgraph()  local
828         if (ignoreJump(SrcBlock, nullptr, Jump))  in findUnknownSubgraph()
831         uint64_t Dst = Jump->Target;  in findUnknownSubgraph()
871       for (auto Jump : Block->SuccJumps) {  in canRebalanceSubgraph()  local
872         if (ignoreJump(SrcBlock, DstBlock, Jump))  in canRebalanceSubgraph()
887                   const FlowJump *Jump) {  in ignoreJump()  argument
889     if (Jump->IsUnlikely && Jump->Flow == 0)  in ignoreJump()
892     auto JumpSource = &Func.Blocks[Jump->Source];  in ignoreJump()
893     auto JumpTarget = &Func.Blocks[Jump->Target];  in ignoreJump()
917       for (auto Jump : Block->SuccJumps) {  in isAcyclicSubgraph()  local
918         if (ignoreJump(SrcBlock, DstBlock, Jump))  in isAcyclicSubgraph()
920         LocalInDegree[Jump->Target]++;  in isAcyclicSubgraph()
946       for (auto Jump : Block->SuccJumps) {  in isAcyclicSubgraph()  local
947         if (ignoreJump(SrcBlock, DstBlock, Jump))  in isAcyclicSubgraph()
949         uint64_t Dst = Jump->Target;  in isAcyclicSubgraph()
975     for (auto Jump : SrcBlock->SuccJumps) {  in rebalanceUnknownSubgraph()  local
976       if (ignoreJump(SrcBlock, DstBlock, Jump))  in rebalanceUnknownSubgraph()
978       BlockFlow += Jump->Flow;  in rebalanceUnknownSubgraph()
987       for (auto Jump : Block->PredJumps) {  in rebalanceUnknownSubgraph()  local
988         BlockFlow += Jump->Flow;  in rebalanceUnknownSubgraph()
1001     for (auto Jump : Block->SuccJumps) {  in rebalanceBlock()  local
1002       if (ignoreJump(SrcBlock, DstBlock, Jump))  in rebalanceBlock()
1014     for (auto Jump : Block->SuccJumps) {  in rebalanceBlock()  local
1015       if (ignoreJump(SrcBlock, DstBlock, Jump))  in rebalanceBlock()
1018       Jump->Flow = Flow;  in rebalanceBlock()
1116   for (auto &Jump : Func.Jumps) {  in initializeNetwork()  local
1117     uint64_t Src = Jump.Source;  in initializeNetwork()
1118     uint64_t Dst = Jump.Target;  in initializeNetwork()
1122       uint64_t Cost = Jump.IsUnlikely ? MinCostMaxFlow::AuxCostUnlikely : 0;  in initializeNetwork()
1153   for (auto &Jump : Func.Jumps) {  in extractWeights()  local
1154     uint64_t Src = Jump.Source;  in extractWeights()
1155     uint64_t Dst = Jump.Target;  in extractWeights()
1168     Jump.Flow = Flow;  in extractWeights()
1179   for (auto &Jump : Func.Jumps) {  in verifyWeights()  local
1180     InFlow[Jump.Target] += Jump.Flow;  in verifyWeights()
1181     OutFlow[Jump.Source] += Jump.Flow;  in verifyWeights()
1205   for (auto &Jump : Func.Jumps) {  in verifyWeights()  local
1206     if (Jump.Flow > 0) {  in verifyWeights()
1207       PositiveFlowEdges[Jump.Source].push_back(Jump.Target);  in verifyWeights()