better compile times for throughput scheduling

fix failing no-plan throughput ablation runs
update results

test/PIM/SpatialSchedulingTargetTest.cpp

@@ -1642,14 +1642,14 @@ static void testOrderedPackCostCurve() {
         if (fits && packs <= cores) optimum = std::min(optimum, std::max(maximum, work));
       }
       std::vector<size_t> assignment;
-      Cost cost = estimateOrderedPackCost(costs, weights, 3, tasks, capacity, cores, &assignment);
+      auto cost = estimateOrderedPackCost(costs, weights, 3, tasks, capacity, cores, &assignment);
       if (optimum == std::numeric_limits<Cost>::max()) {
-        assert(assignment.empty());
+        assert(!cost && assignment.empty());
         continue;
       }
-      assert(cost == optimum && cost <= previous && assignment.size() == tasks.size());
-      plateau |= cost == previous;
-      previous = cost;
+      assert(cost && *cost == optimum && *cost <= previous && assignment.size() == tasks.size());
+      plateau |= *cost == previous;
+      previous = *cost;
       std::vector<Cost> loads(cores);
       std::vector<llvm::SmallBitVector> resident(cores, llvm::SmallBitVector(3));
       for (size_t task : tasks) {
@@ -1658,7 +1658,7 @@ static void testOrderedPackCostCurve() {
         for (size_t weight : weights[task]) resident[assignment[task]].set(weight);
       }
       for (size_t core = 0; core < cores; ++core) {
-        assert(loads[core] <= cost && resident[core].count() <= capacity);
+        assert(loads[core] <= *cost && resident[core].count() <= capacity);
       }
     }
     assert(plateau && previous == 11);