Lines Matching refs:cost
4748 /* Compute a (partial) cost for rtx X. Return true if the complete
4749 cost has been computed, and false if subexpressions should be
4750 scanned. In either case, *TOTAL contains the cost result. */
4824 /* Calculate the cost of moving data from a register in class FROM to
6252 /* Adjust the cost of a scheduling dependency.
6253 Return the new cost of a dependency of type DEP_TYPE or INSN on DEP_INSN.
6254 COST is the current cost. */
6257 ia64_adjust_cost_2 (rtx insn, int dep_type1, rtx dep_insn, int cost)
6264 return cost;
6272 return cost;
7229 int cost; /* cost of the state in cycles */
7368 else if (bundle_state->cost < ((struct bundle_state *) *entry_ptr)->cost
7369 || (bundle_state->cost == ((struct bundle_state *) *entry_ptr)->cost
7465 curr_state->cost = originator->cost;
7516 curr_state->cost++;
7789 curr_state->cost = 0;
7888 "// Bundle state %d (orig %d, cost %d, nops %d/%d, insns %d, branch %d, state %d) for %d\n",
7892 curr_state->cost,
7911 bundle. The first we prefer insn sequences with minimal cost
7915 && (best_state == NULL || best_state->cost > curr_state->cost
7916 || (best_state->cost == curr_state->cost
7947 "// Best %d (orig %d, cost %d, nops %d/%d, insns %d, branch %d, state %d) for %d\n",
7951 curr_state->cost,