Lines Matching defs:cost

415 /// Given a list of candidate roots, builds the cost graph for connecting them.
500   // Now build the cost graph.
507     // any edges in the cost graph (a perf optimization).
517         if (!entry.connector /* new edge */ || entry.cost.first > q.depth) {
519             entry.cost.second = nextID++;
520           entry.cost.first = q.depth;
631         llvm::dbgs() << "      <- " << source.first << ": " << entry.cost.first
632                      << ":" << entry.cost.second << " via "
647       unsigned cost = solver.solve();
648       LLVM_DEBUG(llvm::dbgs() << "  * " << root << ": " << cost << "\n");
649       if (!bestRoot || bestCost > cost) {
650         bestCost = cost;
724 /// frequence sum and ordering predicates based on a cost model.
756   /// Returns true if this predicate is ordered before `rhs`, based on the cost
1011   // Sort the set of predicates now that the cost primary and secondary sums