Lines Matching defs:latency

2353    The "latency" field holds the minimum possible latency of the
2357 any leaf to the root. Hence latency(a op b) is defined as zero for
2358 leaves and rtx_cost(op) + max(latency(a), latency(b)) otherwise. */
2362 short latency; /* The latency of the multiplication sequence. */
2369 || ((X)->cost == (Y) && (X)->latency < (Y)))
2374 lower "cost". If "cost"s are tied, the lower latency is cheaper. */
2377 && (X)->latency < (Y)->latency))
2483 alg_out->cost.latency = cost_limit->latency + 1;
2486 || (cost_limit->cost == 0 && cost_limit->latency <= 0))
2497 alg_out->cost.latency = 0;
2512 alg_out->cost.latency = zero_cost;
2603 new_limit.latency = best_cost.latency - op_cost;
2607 alg_in->cost.latency += op_cost;
2640 new_limit.latency = best_cost.latency - op_cost;
2644 alg_in->cost.latency += op_cost;
2660 new_limit.latency = best_cost.latency - op_cost;
2664 alg_in->cost.latency += op_cost;
2699 Assume that the shift-and-add is "atomic" with a latency
2713 new_limit.latency = best_cost.latency - op_latency;
2717 alg_in->cost.latency += op_latency;
2718 if (alg_in->cost.latency < op_cost)
2719 alg_in->cost.latency = op_cost;
2738 Assume that the shift-and-sub is "atomic" with a latency
2752 new_limit.latency = best_cost.latency - op_latency;
2756 alg_in->cost.latency += op_latency;
2757 if (alg_in->cost.latency < op_cost)
2758 alg_in->cost.latency = op_cost;
2785 new_limit.latency = best_cost.latency - op_cost;
2789 alg_in->cost.latency += op_cost;
2810 new_limit.latency = best_cost.latency - op_cost;
2814 alg_in->cost.latency += op_cost;
2851 alg_hash[hash_index].cost.latency = best_cost.latency;
2903 limit.latency = mult_cost;
2914 limit.latency = alg->cost.latency - op_cost;
2919 limit.latency = mult_cost - op_cost;
2924 alg2.cost.latency += op_cost;
2934 limit.latency = alg->cost.latency - op_cost;
2939 limit.latency = mult_cost - op_cost;
2944 alg2.cost.latency += op_cost;