/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | dummy_procedure_7.f90 | 44 function cost(x) result(y) function in module:tt
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/ |
H A D | pr56294.C | 5 struct comp_cost { int cost; unsigned complexity; }; member in struct:comp_cost
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr42389.c | 23 float cost; member in struct:s_rr_route
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20000815-1.c | 10 int cost; member in struct:table_elt
|
/haiku-buildtools/gcc/gcc/ |
H A D | cfgloopanal.c | 396 unsigned cost; local
|
H A D | ira-conflicts.c | 256 int allocno_preferenced_hard_regno, cost, index, offset1, offset2; local
|
H A D | ira-lives.c | 944 int cost; local
|
H A D | ira-emit.c | 941 int to_regno, from_regno, cost, regno; local [all...] |
H A D | mcf.c | 102 gcov_type cost; member in struct:fixup_edge_d 376 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) argument 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 D | expmed.h | 50 short cost; /* Total rtx_cost of the multiplication sequence. */ member in struct:mult_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 D | lra-assigns.c | 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 D | sel-sched-dump.c | 202 int cost = vi->cost; local
|
H A D | tree-ssa-coalesce.c | 76 int cost; member in struct:coalesce_pair 142 int cost = frequency; local 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 D | bt-load.c | 114 int cost; member in struct:btr_def_s [all...] |
H A D | ira-costs.c | 85 int cost[1]; member in struct:costs 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 D | loop-invariant.c | 160 unsigned cost; member in struct:invariant [all...] |
H A D | targhooks.c | 1104 unsigned *cost = XNEWVEC (unsigned, 3); local 1118 unsigned *cost = (unsigned *) data; local 1142 unsigned *cost = (unsigned *) data; local [all...] |
/haiku-buildtools/legacy/gcc/gcc/config/ns32k/ |
H A D | ns32k.c | 137 int cost = 0; local
|
/haiku-buildtools/gcc/gcc/config/tilepro/ |
H A D | gen-mul-tables.cc | 437 int cost () const function in class:ExpressionTree 439 int cost = 0; local 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/lto/ |
H A D | lto-partition.c | 470 int cost = 0, internal = 0; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 920625-1.c | 34 recurse(opcode_t opcode, int d, int s1, int s2, word v, int cost, insn_t *sequence, int n_insns, word *values, int n_values, const word goal_value, int allowed_cost, int cy, int prune_flags) argument
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | regclass.c | 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 D | expmed.c | 2035 short cost; member in struct:algorithm 2068 int cost; local [all...] |
H A D | sched.c | 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/config/cr16/ |
H A D | cr16.c | 1326 int cost = 2; local [all...] |