Lines Matching refs:NumBlocks
621 auto Visited = BitVector(NumBlocks(), false); in joinIsolatedComponents()
625 for (uint64_t I = 0; I < NumBlocks(); I++) { in joinIsolatedComponents()
691 auto Distance = std::vector<int64_t>(NumBlocks(), INF); in findShortestPath()
692 auto Parent = std::vector<FlowJump *>(NumBlocks(), nullptr); in findShortestPath()
721 for (uint64_t I = 0; I < NumBlocks(); I++) { in findShortestPath()
759 Params.CostUnlikely / (2 * (NumBlocks() + 1)))); in jumpDistance()
762 return 2 * BaseDistance * (NumBlocks() + 1); in jumpDistance()
765 uint64_t NumBlocks() const { return Func.Blocks.size(); } in NumBlocks() function in __anon5aecd1f00111::FlowAdjuster
828 auto Visited = BitVector(NumBlocks(), false); in findUnknownSubgraph()
926 auto LocalInDegree = std::vector<uint64_t>(NumBlocks(), 0); in isAcyclicSubgraph()
1058 uint64_t NumBlocks = Func.Blocks.size(); in initializeNetwork() local
1059 assert(NumBlocks > 1 && "Too few blocks in a function"); in initializeNetwork()
1067 uint64_t S = 2 * NumBlocks; in initializeNetwork()
1072 Network.initialize(2 * NumBlocks + 4, S1, T1); in initializeNetwork()
1075 for (uint64_t B = 0; B < NumBlocks; B++) { in initializeNetwork()
1186 uint64_t NumBlocks = Func.Blocks.size(); in extractWeights() local
1207 auto InFlow = std::vector<uint64_t>(NumBlocks, 0); in extractWeights()
1208 auto OutFlow = std::vector<uint64_t>(NumBlocks, 0); in extractWeights()
1213 for (uint64_t B = 0; B < NumBlocks; B++) { in extractWeights()
1259 const uint64_t NumBlocks = Func.Blocks.size(); in verifyOutput() local
1260 auto InFlow = std::vector<uint64_t>(NumBlocks, 0); in verifyOutput()
1261 auto OutFlow = std::vector<uint64_t>(NumBlocks, 0); in verifyOutput()
1269 for (uint64_t I = 0; I < NumBlocks; I++) { in verifyOutput()
1287 auto PositiveFlowEdges = std::vector<std::vector<uint64_t>>(NumBlocks); in verifyOutput()
1296 auto Visited = BitVector(NumBlocks, false); in verifyOutput()
1312 for (uint64_t I = 0; I < NumBlocks; I++) { in verifyOutput()