Lines Matching refs:cost
2194 int cost = rtx_cost (gen_rtx_ASHIFT (word_mode, const1_rtx, reg), SET);
2195 cheap = cost < COSTS_N_INSNS (3);
2643 Return 1 if these nodes are suitable for cost estimation, otherwise
2654 /* If we haven't already made the cost table, make it now. Note that the
2720 int cost = 0;
2734 cost += COST_TABLE (TREE_INT_CST_LOW (np->high));
2738 cost += COST_TABLE (TREE_INT_CST_LOW (np->low));
2751 /* Find the place in the list that bisects the list's total cost,
2752 Here I gets half the total cost. */
2754 i = (cost + 1) / 2;
2757 /* Skip nodes while their cost does not reach that amount. */
2783 /* Find the place in the list that bisects the list's total cost,
2785 Here I gets half the total cost. */
2789 /* Skip nodes while their cost does not reach that amount. */
3084 cost too much space to save so little time. */