Searched refs:cost (Results 1 - 25 of 101) sorted by relevance

12345

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Ddummy_procedure_7.f9013 subroutine sol(cost)
16 function cost(p) result(y)
19 end function cost
22 if (any (cost([1d0,2d0]) /= [2.d0, 4.d0])) call abort ()
44 function cost(x) result(y) function in module:tt
49 end function cost
59 if (any (cost([3.d0,7.d0]) /= [6.d0, 14.d0])) call abort ()
61 call sol(cost)
/haiku-buildtools/gcc/gcc/
H A Dexpmed.h38 /* This structure holds the "cost" of a multiply sequence. The
39 "cost" field holds the total rtx_cost of every operator in the
40 synthetic multiplication sequence, hence cost(a op b) is defined
41 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero.
50 short cost; /* Total rtx_cost of the multiplication sequence. */ member in struct:mult_cost
57 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \
58 || ((X)->cost == (Y) && (X)->latency < (Y)))
63 lower "cost"
89 struct mult_cost cost; member in struct:algorithm
114 struct mult_cost cost; member in struct:alg_hash_entry
144 int cost[2][NUM_MODE_IPV_INT]; member in struct:expmed_op_costs
331 set_zero_cost(bool speed, int cost) argument
355 set_add_cost(bool speed, machine_mode mode, int cost) argument
379 set_neg_cost(bool speed, machine_mode mode, int cost) argument
405 set_shift_cost(bool speed, machine_mode mode, int bits, int cost) argument
432 set_shiftadd_cost(bool speed, machine_mode mode, int bits, int cost) argument
459 set_shiftsub0_cost(bool speed, machine_mode mode, int bits, int cost) argument
486 set_shiftsub1_cost(bool speed, machine_mode mode, int bits, int cost) argument
512 set_mul_cost(bool speed, machine_mode mode, int cost) argument
538 set_sdiv_cost(bool speed, machine_mode mode, int cost) argument
564 set_udiv_cost(bool speed, machine_mode mode, int cost) argument
592 set_mul_widen_cost(bool speed, machine_mode mode, int cost) argument
620 set_mul_highpart_cost(bool speed, machine_mode mode, int cost) argument
653 set_convert_cost(machine_mode to_mode, machine_mode from_mode, bool speed, int cost) argument
[all...]
H A Dtree-ssa-loop-ivopts.c39 3) The optimal (w.r. to a cost function) set of variables is chosen. The
40 cost function assigns a cost to sets of induction variables and consists
44 variable in the set and adds its cost to the sum. The cost reflects
47 -- The variable costs. Each of the variables has a cost assigned that
50 -- The set cost. Depending on the size of the set, extra cost may be
144 cost of different addressing modes. This should be moved to a TBD
148 /* The infinite cost
201 int cost; /* The runtime cost. */ member in struct:__anon1919
215 comp_cost cost; /* The cost. */ member in struct:cost_pair
269 unsigned cost; /* Cost of the candidate. */ member in struct:iv_cand
417 comp_cost cost; member in struct:iv_ca
2780 comp_cost cost; local
2824 infinite_cost_p(comp_cost cost) argument
2834 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, comp_cost cost, bitmap depends_on, tree value, enum tree_code comp, int inv_expr_id) argument
3012 unsigned cost; local
3212 adjust_setup_cost(struct ivopts_data *data, unsigned cost) argument
3323 unsigned cost, acost, complexity; local
3632 get_shiftadd_cost(tree expr, machine_mode mode, comp_cost cost0, comp_cost cost1, tree mult, bool speed, comp_cost *cost) argument
3680 comp_cost cost0, cost1, cost; local
3986 comp_cost cost = force_var_cost (data, e2, depends_on); local
4167 comp_cost cost; local
4399 comp_cost cost; local
4432 comp_cost cost = get_computation_cost (data, use, cand, true, &depends_on, local
4863 comp_cost elim_cost, express_cost, cost, bound_cost; local
4995 comp_cost cost; local
5156 unsigned cost, cost_step; local
5336 comp_cost cost = ivs->cand_use_cost; local
5707 comp_cost cost = iv_ca_cost (ivs); local
5745 comp_cost cost; local
5795 comp_cost cost, best_cost, acost; local
6277 comp_cost cost, origcost; local
[all...]
H A Dtree-ssa-coalesce.c76 int cost; member in struct:coalesce_pair
129 cost_one_pair_p cost_one_list;/* Single use coalesces with cost 1. */
136 /* Return cost of execution of copy instruction with FREQUENCY. */
142 int cost = frequency; local
144 if (!cost)
145 cost = 1;
148 cost = 1;
150 return cost;
154 /* Return the cost of executing a copy instruction in basic block BB. */
163 /* Return the cost o
944 int v1, v2, cost; local
984 int cost = coalesce_cost_edge (e); local
1197 int cost; local
1320 const int cost local
[all...]
H A Dexpmed.c160 /* Assume cost of zero-extend and sign-extend is the same. */
206 int cost = add_cost (speed, mode); local
207 set_shiftadd_cost (speed, mode, 0, cost);
208 set_shiftsub0_cost (speed, mode, 0, cost);
209 set_shiftsub1_cost (speed, mode, 0, cost);
1782 If a TARGET is specified and we can store in it at no extra cost,
2412 The algorithm must cost less than cost_limit
2413 If retval.cost >= COST_LIMIT, no algorithm was found and all
2437 alg_out->cost.cost
[all...]
H A Dira-color.c81 /* Overall (spilling) cost of all allocnos with given register
83 int64_t cost; member in struct:allocno_hard_regs
121 /* Hard regno for which we changed the cost. */
123 /* Divisor used when we changed the cost of HARD_REGNO. */
286 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost)
294 hv->cost += cost;
300 hv->cost = cost;
330 if (hv2->cost > hv
285 add_allocno_hard_regs(HARD_REG_SET set, int64_t cost) argument
1365 int cost, update_cost; local
1481 int i, cost, class_size, freq, mult, div, divisor; local
1677 int cost, mem_cost, min_cost, full_cost, min_full_cost, nwords, word; local
2463 int regno, cost; local
2535 int cost; local
3171 int cost, exit_freq, enter_freq; local
3377 int cost, regno, hard_regno, hard_regno2, index; local
3492 int i, hard_regno, cost; local
3907 int i, num, regno, cost; local
4216 int old_hard_regno, hard_regno, cost; local
4452 int cost, best_cost; local
4608 int i, cost, regno, hard_regno, j, count, saved_cost, nregs; local
4667 int cost, other_cost; local
[all...]
H A Dmcf.c1 /* Routines to implement minimum-cost maximal flow algorithm used to smooth
36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
39 5. Form the minimal cost flow
102 gcov_type cost; member in struct:fixup_edge_d
233 fprintf (file, " cost=%"PRId64 ".", fedge->cost);
372 (SRC->DEST) to the edge_list maintained in FIXUP_GRAPH with cost of the edge
376 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) argument
382 curr_edge->cost = cost;
395 add_fixup_edge(fixup_graph_type *fixup_graph, int src, int dest, edge_type type, gcov_type weight, gcov_type cost, gcov_type max_capacity) argument
410 add_rfixup_edge(fixup_graph_type *fixup_graph, int src, int dest, gcov_type rflow, gcov_type cost) argument
[all...]
H A Dlra-assigns.c35 use a cost model to determine the most profitable choice of hard
48 When we assign a hard register to a pseudo, we decrease the cost of
52 If two hard registers have the same frequency-derived cost, we
461 /* The value used to check that cost of given hard reg is really
464 /* Array used to check that cost of the corresponding hard reg (the
472 /* Adjust cost of HARD_REGNO by INCR. Reset the cost first if it is
484 hard register on success and set *COST to the cost of using
485 that register. (If several registers have equal cost, the one with
489 criteria, e.g. allocation cost
499 find_hard_regno_for_1(int regno, int *cost, int try_only_hard_regno, bool first_p, HARD_REG_SET regno_set) argument
696 find_hard_regno_for(int regno, int *cost, int try_only_hard_regno, bool first_p) argument
736 int another_regno, cost; local
907 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; local
1211 int regno, another_regno, hard_regno, another_hard_regno, cost, i, n; local
1314 int i, n, nfails, iter, regno, hard_regno, cost, restore_regno; local
[all...]
H A Dcfgloopanal.c386 /* Estimates cost of increased register pressure caused by making N_NEW new
396 unsigned cost; local
413 cost = target_reg_cost [speed] * n_new;
417 cost = target_spill_cost [speed] * n_new;
423 better. So decrease the cost (to do more accurate the cost
426 cost /= 2;
428 return cost;
H A Dira-costs.c1 /* IRA hard register and memory cost calculation for allocnos or pseudos.
77 /* The `costs' struct records the cost of using hard registers of each
85 int cost[1]; member in struct:costs
120 cost calculation. */
129 /* Record cost gains for not allocating a register with an invariant
142 /* Number of the cost classes in the subsequent array. */
144 /* Container of the cost classes. */
147 -1 if it is not a cost class. */
158 /* Info about cost classes for each pseudo. */
172 /* Returns hash value for cost classe
2053 int cost; local
2263 int cost, min_cost, *reg_costs; local
2365 ira_adjust_equiv_reg_cost(unsigned regno, int cost) argument
[all...]
H A Dgimple-ssa-strength-reduction.c347 of the cost of initializers. The absolute value of the increment
360 int cost;
695 /* Determine the target cost of statement GS when compiling according
1901 fprintf (dump_file, "\n cost: %d", incr_vec[i].cost);
2377 candidate C with phi-definition PHI. The cost of inserting
2386 int cost = 0;
2391 returning an unreasonably high cost. It's not easy to detect
2410 cost += phi_add_costs (arg_def, c, one_add_cost);
2416 cost
359 int cost; member in struct:incr_info_d
2378 int cost = 0; local
2441 int cost = add_costs - mult_savings - c->dead_savings; local
2659 int cost = 0; local
2907 int cost = mult_by_coeff_cost (incr, mode, speed); local
2926 int cost = 0; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/
H A Dpr56294.C5 struct comp_cost { int cost; unsigned complexity; }; member in struct:comp_cost
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr42389.c23 float cost; member in struct:s_rr_route
69 rr_route[inode].cost = rr_cost[inode].base_cost + rr_cost[inode].acc_cost;
/haiku-buildtools/binutils/gas/testsuite/gas/cris/
H A Dregreg.s7 ; is less expensive than any other time and still falling in cost.
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/cris/
H A Dregreg.s7 ; is less expensive than any other time and still falling in cost.
/haiku-buildtools/legacy/gcc/gcc/
H A Dregclass.c168 /* Maximum cost of moving from a register in one class to a register in
174 of the second so in that case the cost is zero. */
387 /* Initialize the move cost table. Find every subset of each class
388 and take the maximum cost of moving any subset to any other. */
393 int cost = i == j ? 2 : REGISTER_MOVE_COST (i, j);
398 cost = MAX (cost, REGISTER_MOVE_COST (i, *p2));
403 cost = MAX (cost, REGISTER_MOVE_COST (*p1, j));
408 cost
392 int cost = i == j ? 2 : REGISTER_MOVE_COST (i, j); local
646 int cost[N_REG_CLASSES]; member in struct:costs
[all...]
H A Dexpmed.c945 If a TARGET is specified and we can store in it at no extra cost,
2026 `cost' is their total cost.
2045 short cost;
2066 The algorithm must cost less than cost_limit
2067 If retval.cost >= COST_LIMIT, no algorithm was found and all
2078 int cost;
2083 alg_out->cost = cost_limit;
2088 /* t == 1 can be done in zero cost. */
2092 alg_out->cost
2035 short cost; member in struct:algorithm
2068 int cost; local
[all...]
H A Dsched.c70 1. choose insn with lowest conflict cost, ties broken by
633 the unit will unblock based on the maximum blockage cost. */
666 /* Return the actual hazard cost of executing INSN on the unit UNIT,
667 instance INSTANCE at time CLOCK if the previous actual hazard cost
671 actual_hazard_this_instance (unit, instance, insn, clock, cost)
672 int unit, instance, clock, cost;
677 if (tick - clock > cost)
698 if (tick - clock > cost)
699 cost = tick - clock;
701 return cost;
833 register int cost = INSN_COST (insn); local
2035 int cost = insn_cost (prev, link, insn); local
2076 int i, j, k, q, cost, best_cost, best_insn = 0, new_ready = n_ready; local
[all...]
/haiku-buildtools/gcc/gcc/lto/
H A Dlto-partition.c470 int cost = 0, internal = 0; local
585 /* Compute boundary cost of callgraph edges. */
599 cost -= edge_cost, internal += edge_cost;
601 cost += edge_cost;
616 cost -= edge_cost;
618 cost += edge_cost;
627 /* Compute boundary cost of IPA REF edges and at the same time look into
645 cost--, internal++;
647 cost++;
660 cost
[all...]
/haiku-buildtools/gcc/gcc/config/arm/
H A Darm.c970 /* Cost tables for AArch32 + AArch64 cores should go in aarch-cost-tables.h */
971 #include "aarch-cost-tables.h"
1692 NULL, /* Sched adj cost. */
1713 NULL, /* Sched adj cost. */
1737 NULL, /* Sched adj cost. */
1779 NULL, /* Sched adj cost. */
1800 NULL, /* Sched adj cost. */
1822 NULL, /* Sched adj cost. */
1843 NULL, /* Sched adj cost. */
1885 NULL, /* Sched adj cost
9399 arm_unspec_cost(rtx x, enum rtx_code , bool speed_p, int *cost) argument
9493 arm_new_rtx_costs(rtx x, enum rtx_code code, enum rtx_code outer_code, const struct cpu_cost_table *extra_cost, int *cost, bool speed_p) argument
11253 int cost, const_ok = const_ok_for_arm (i); local
11319 int cost, const_ok = const_ok_for_arm (i); local
11416 int cost = 1; local
11575 xscale_sched_adjust_cost(rtx_insn *insn, rtx link, rtx_insn *dep, int * cost) argument
11636 cortex_a9_sched_adjust_cost(rtx_insn *insn, rtx link, rtx_insn *dep, int * cost) argument
11709 fa726te_sched_adjust_cost(rtx_insn *insn, rtx link, rtx_insn *dep, int * cost) argument
11855 unsigned *cost = (unsigned *) data; local
12057 arm_adjust_cost(rtx_insn *insn, rtx link, rtx_insn *dep, int cost) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20000815-1.c10 int cost; member in struct:table_elt
/haiku-buildtools/gcc/gcc/config/tilepro/
H A Dgen-mul-tables.cc110 int cost)
112 m_unary_func (0), m_binary_func (func), m_cost (cost),
119 int rhs_if_unary, int cost)
121 m_unary_func (func), m_binary_func (0), m_cost (cost),
430 cost. We update this ExpressionTree object because some int is
437 int cost () const function in class:ExpressionTree
439 int cost = 0; local
441 cost += m_exprs[j].m_op->m_cost;
442 return cost + m_exprs[m_num_vals - 1].m_critical_path_length * 1000000;
540 || (*best).second->cost () >
109 Operator(const char *pattern, const char *name, binary_op_func func, int cost) argument
118 Operator(const char *pattern, const char *name, unary_op_func func, int rhs_if_unary, int cost) argument
[all...]
/haiku-buildtools/gcc/gcc/config/aarch64/
H A Daarch64.c92 #include "aarch64-cost-tables.h"
240 their cost higher than memmov_cost. */
250 their cost higher than memmov_cost. */
260 their cost higher than memmov_cost. */
278 their cost higher than memmov_cost. */
5115 /* Helper function for rtx cost calculation. Strip a shift expression
5141 /* Helper function for rtx cost calculation. Strip an extend
5185 /* Helper function for rtx cost calculation. Calculate the cost of
5187 the calculated cost o
5196 int cost = 0; local
5309 int cost = 0; local
5447 aarch64_if_then_else_costs(rtx op0, rtx op1, rtx op2, int *cost, bool speed) argument
5520 aarch64_rtx_costs(rtx x, int code, int outer ATTRIBUTE_UNUSED, int param ATTRIBUTE_UNUSED, int *cost, bool speed) argument
6452 aarch64_rtx_costs_wrapper(rtx x, int code, int outer, int param, int *cost, bool speed) argument
6615 unsigned *cost = (unsigned *) data; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/
H A Dpr58673-1.c54 int cost; member in struct:conversion_recipe
72 int i, besti, cost, bestcost; local
/haiku-buildtools/legacy/gcc/gcc/config/sh/
H A Dsh.c921 /* Return the cost of a shift. */
933 /* Otherwise, return the true cost in instructions. */
936 int cost = ashiftrt_insns[value];
938 if (cost > 1 + SH_DYNAMIC_SHIFT_COST)
939 cost = 1 + SH_DYNAMIC_SHIFT_COST;
940 return cost;
946 /* Return the cost of an AND operation. */
975 /* Return the cost of a multiply. */
1269 int cost, best_cost = 10000;
1304 cost
931 int cost = ashiftrt_insns[value]; local
1264 int cost, best_cost = 10000; local
1549 int cost, best_cost; local
1644 int cost; local
1660 int left, size, insize, cost; local
[all...]

Completed in 384 milliseconds

12345