Lines Matching defs:NumBlocks

621     auto Visited = BitVector(NumBlocks(), false);
625     for (uint64_t I = 0; I < NumBlocks(); I++) {
691     auto Distance = std::vector<int64_t>(NumBlocks(), INF);
692     auto Parent = std::vector<FlowJump *>(NumBlocks(), nullptr);
721       for (uint64_t I = 0; I < NumBlocks(); I++) {
759                           Params.CostUnlikely / (2 * (NumBlocks() + 1))));
762     return 2 * BaseDistance * (NumBlocks() + 1);
765   uint64_t NumBlocks() const { return Func.Blocks.size(); }
828     auto Visited = BitVector(NumBlocks(), false);
926     auto LocalInDegree = std::vector<uint64_t>(NumBlocks(), 0);
1058   uint64_t NumBlocks = Func.Blocks.size();
1059   assert(NumBlocks > 1 && "Too few blocks in a function");
1065   // the range [0 .. 2 * NumBlocks); the dummy sources/sinks are indexed by the
1067   uint64_t S = 2 * NumBlocks;
1072   Network.initialize(2 * NumBlocks + 4, S1, T1);
1075   for (uint64_t B = 0; B < NumBlocks; B++) {
1186   uint64_t NumBlocks = Func.Blocks.size();
1207   auto InFlow = std::vector<uint64_t>(NumBlocks, 0);
1208   auto OutFlow = std::vector<uint64_t>(NumBlocks, 0);
1213   for (uint64_t B = 0; B < NumBlocks; B++) {
1259   const uint64_t NumBlocks = Func.Blocks.size();
1260   auto InFlow = std::vector<uint64_t>(NumBlocks, 0);
1261   auto OutFlow = std::vector<uint64_t>(NumBlocks, 0);
1269   for (uint64_t I = 0; I < NumBlocks; I++) {
1287   auto PositiveFlowEdges = std::vector<std::vector<uint64_t>>(NumBlocks);
1296   auto Visited = BitVector(NumBlocks, false);
1312   for (uint64_t I = 0; I < NumBlocks; I++) {