Lines Matching refs:cost
2205 int cost = rtx_cost (gen_rtx_ASHIFT (word_mode, const1_rtx, reg), SET);
2206 cheap = cost < COSTS_N_INSNS (3);
2654 Return 1 if these nodes are suitable for cost estimation, otherwise
2665 /* If we haven't already made the cost table, make it now. Note that the
2731 int cost = 0;
2745 cost += COST_TABLE (TREE_INT_CST_LOW (np->high));
2749 cost += COST_TABLE (TREE_INT_CST_LOW (np->low));
2762 /* Find the place in the list that bisects the list's total cost,
2763 Here I gets half the total cost. */
2765 i = (cost + 1) / 2;
2768 /* Skip nodes while their cost does not reach that amount. */
2794 /* Find the place in the list that bisects the list's total cost,
2796 Here I gets half the total cost. */
2800 /* Skip nodes while their cost does not reach that amount. */
3095 cost too much space to save so little time. */