Lines Matching refs:cost
398 /* Return true if we should account reference from N1 to N2 in cost
419 cost. Those are added into units only to enable possible constant
484 int64_t cost = 0, internal = 0;
578 At the same time we compute size of the boundary into COST. Every
580 COST. Every edge inside partition was earlier computed as one leaving
581 it and thus we need to subtract it from COST. */
599 /* Compute boundary cost of callgraph edges. */
615 cost -= edge_cost, internal += edge_cost;
617 cost += edge_cost;
634 cost -= edge_cost, internal += edge_cost;
636 cost += edge_cost;
642 /* Compute boundary cost of IPA REF edges and at the same time look into
660 cost--, internal++;
662 cost++;
673 cost--, internal++;
675 cost++;
699 cost--, internal++;
701 cost++;
713 cost--, internal++;
715 cost++;
719 gcc_assert (cost >= 0 && internal >= 0);
721 /* If the partition is large enough, start looking for smallest boundary cost.
723 any cost. If partition has right size, optimize for highest internal/cost.
727 || (!cost
728 || ((sreal)best_internal * (sreal) cost
731 best_cost = cost;
741 "cost %" PRId64 "/%" PRId64 " "
744 partition->insns, cost, internal,
746 /* Partition is too large, unwind into step when best cost was reached and
774 cost = 0;
812 /* For one partition the cost of boundary should be 0 unless we added final
Indexes created Sat Apr 18 00:22:28 UTC 2026