| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | expmed.h | 59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
98 struct mult_cost cost; member
123 struct mult_cost cost; member
144 int cost[2][NUM_MODE_IPV_INT]; member
331 set_zero_cost (bool speed, int cost) in set_zero_cost()
355 set_add_cost (bool speed, machine_mode mode, int cost) in set_add_cost()
379 set_neg_cost (bool speed, machine_mode mode, int cost) in set_neg_cost()
405 set_shift_cost (bool speed, machine_mode mode, int bits, int cost) in set_shift_cost()
432 set_shiftadd_cost (bool speed, machine_mode mode, int bits, int cost) in set_shiftadd_cost()
459 set_shiftsub0_cost (bool speed, machine_mode mode, int bits, int cost) in set_shiftsub0_cost()
[all …]
|
| H A D | lra-assigns.cc | 478 find_hard_regno_for_1 (int regno, int *cost, int try_only_hard_regno, in find_hard_regno_for_1()
690 find_hard_regno_for (int regno, int *cost, int try_only_hard_regno, bool first_p) in find_hard_regno_for()
730 int another_regno, cost; in update_hard_regno_preference() local
926 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; in spill_for() local
1271 int regno, another_regno, hard_regno, another_hard_regno, cost, i, n; in improve_inheritance() local
1384 int i, n, nfails, iter, regno, regno2, hard_regno, cost; in assign_by_spills() local
|
| H A D | tree-ssa-coalesce.cc | 54 int cost; member
151 int cost = frequency; in coalesce_cost() local
1041 int v1, v2, cost; in create_coalesce_list_for_region() local
1078 int cost = coalesce_cost_edge (e); in create_coalesce_list_for_region() local
1232 int v1, v2, cost; in populate_coalesce_list_for_outofssa() local
1300 const int cost in populate_coalesce_list_for_outofssa() local
1390 int cost; in coalesce_partitions() local
|
| H A D | ira-color.cc | 58 int64_t cost; member
265 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost) in add_allocno_hard_regs()
1409 int cost, update_cost, update_conflict_cost; in update_costs_from_allocno() local
1590 int i, cost, class_size, freq, mult, div, divisor; in update_conflict_hard_regno_costs() local
1943 int cost, mem_cost, min_cost, full_cost, min_full_cost, nwords, word; in assign_hard_reg() local
2052 auto cost = border_costs.spill_inside_loop_cost (); in assign_hard_reg() local
2813 int regno, cost; in calculate_allocno_spill_cost() local
2877 int cost; in push_allocnos_to_stack() local
3102 int cost = 0; in allocno_copy_cost_saving() local
3591 int cost; in color_pass() local
[all …]
|
| H A D | tree-ssa-loop-ivopts.cc | 211 comp_cost (int64_t cost, unsigned complexity, int64_t scratch = 0) in comp_cost()
251 int64_t cost; /* The runtime cost. */ member in comp_cost
297 comp_cost::operator+= (comp_cost cost) in operator +=()
355 comp_cost::operator-= (comp_cost cost) in operator -=()
390 comp_cost cost; /* The cost. */ member in cost_pair
466 unsigned cost; /* Cost of the candidate. */ member
700 comp_cost cost; member in iv_ca
3677 comp_cost cost, bitmap inv_vars, tree value, in set_group_iv_cost()
3911 unsigned cost; in computation_cost() local
4239 adjust_setup_cost (struct ivopts_data *data, int64_t cost, in adjust_setup_cost()
[all …]
|
| H A D | mcf.cc | 90 gcov_type cost; member
364 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) in add_edge()
384 edge_type type, gcov_type weight, gcov_type cost, in add_fixup_edge()
399 gcov_type rflow, gcov_type cost) in add_rfixup_edge()
|
| H A D | ira-costs.cc | 57 int cost[1]; member
1377 int cost_factor = 1, cost, k; in record_operand_costs() local
2206 int cost; in process_bb_node_for_hard_reg_moves() local
2416 int cost, min_cost, *reg_costs; in ira_tune_allocno_costs() local
2511 ira_adjust_equiv_reg_cost (unsigned regno, int cost) in ira_adjust_equiv_reg_cost()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | expmed.h | 59 short cost; /* Total rtx_cost of the multiplication sequence. */ member
98 struct mult_cost cost; member
123 struct mult_cost cost; member
153 int cost[2][NUM_MODE_IPV_INT]; member
340 set_zero_cost (bool speed, int cost) in set_zero_cost()
364 set_add_cost (bool speed, machine_mode mode, int cost) in set_add_cost()
388 set_neg_cost (bool speed, machine_mode mode, int cost) in set_neg_cost()
414 set_shift_cost (bool speed, machine_mode mode, int bits, int cost) in set_shift_cost()
441 set_shiftadd_cost (bool speed, machine_mode mode, int bits, int cost) in set_shiftadd_cost()
468 set_shiftsub0_cost (bool speed, machine_mode mode, int bits, int cost) in set_shiftsub0_cost()
[all …]
|
| H A D | lra-assigns.c | 478 find_hard_regno_for_1 (int regno, int *cost, int try_only_hard_regno, in find_hard_regno_for_1()
690 find_hard_regno_for (int regno, int *cost, int try_only_hard_regno, bool first_p) in find_hard_regno_for()
730 int another_regno, cost; in update_hard_regno_preference() local
926 int i, j, n, p, hard_regno, best_hard_regno, cost, best_cost, rclass_size; in spill_for() local
1271 int regno, another_regno, hard_regno, another_hard_regno, cost, i, n; in improve_inheritance() local
1384 int i, n, nfails, iter, regno, regno2, hard_regno, cost; in assign_by_spills() local
|
| H A D | tree-ssa-coalesce.c | 54 int cost; member
151 int cost = frequency; in coalesce_cost() local
1041 int v1, v2, cost; in create_coalesce_list_for_region() local
1078 int cost = coalesce_cost_edge (e); in create_coalesce_list_for_region() local
1232 int v1, v2, cost; in populate_coalesce_list_for_outofssa() local
1300 const int cost in populate_coalesce_list_for_outofssa() local
1390 int cost; in coalesce_partitions() local
|
| H A D | ira-color.c | 53 int64_t cost; member
260 add_allocno_hard_regs (HARD_REG_SET set, int64_t cost) in add_allocno_hard_regs()
1367 int cost, update_cost, update_conflict_cost; in update_costs_from_allocno() local
1537 int i, cost, class_size, freq, mult, div, divisor; in update_conflict_hard_regno_costs() local
1729 int cost, mem_cost, min_cost, full_cost, min_full_cost, nwords, word; in assign_hard_reg() local
2556 int regno, cost; in calculate_allocno_spill_cost() local
2634 int cost; in push_allocnos_to_stack() local
2840 int cost = 0; in allocno_copy_cost_saving() local
3309 int cost, exit_freq, enter_freq; in color_pass() local
3515 int cost, regno, hard_regno, hard_regno2, index; in move_spill_restore() local
[all …]
|
| H A D | tree-ssa-loop-ivopts.c | 212 : cost (cost), complexity (complexity), scratch (scratch) in cost() argument
251 int64_t cost; /* The runtime cost. */ variable
390 comp_cost cost; /* The cost. */ variable
465 unsigned cost; /* Cost of the candidate. */ member
699 comp_cost cost; variable
3646 comp_cost cost, bitmap inv_vars, tree value, in set_group_iv_cost()
3880 unsigned cost; in computation_cost() local
4229 comp_cost cost1, tree mult, bool speed, comp_cost *cost) in get_shiftadd_cost()
4277 comp_cost cost0, cost1, cost; in force_expr_to_var_cost() local
4655 comp_cost var_cost = no_cost, cost = no_cost; in get_address_cost() local
[all …]
|
| H A D | mcf.c | 90 gcov_type cost; member
364 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) in add_edge()
384 edge_type type, gcov_type weight, gcov_type cost, in add_fixup_edge()
399 gcov_type rflow, gcov_type cost) in add_rfixup_edge()
|
| H A D | ira-costs.c | 56 int cost[1]; member
1313 int cost, k; in record_operand_costs() local
2118 int cost; in process_bb_node_for_hard_reg_moves() local
2328 int cost, min_cost, *reg_costs; in ira_tune_allocno_costs() local
2423 ira_adjust_equiv_reg_cost (unsigned regno, int cost) in ira_adjust_equiv_reg_cost()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/ |
| H A D | speller.c | 28 bool combineSpellerResult(void*& p, int& cost, void* np, int ncost) in combineSpellerResult()
41 const char *charset, size_t index, int* cost) in spellerY()
125 int cost = INT_MAX, ncost = 0; in spellerX() local
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/d/dmd/root/ |
| H A D | speller.d | 70 int cost = int.max; in spellerX() local
266 string speller_test(const(char)[] s, ref int cost) in speller_test()
|
| /netbsd-src/external/bsd/tre/dist/lib/ |
| H A D | tre-match-approx.c | 391 int cost, cost0; in tre_tnfa_run_approx() local
489 int cost, cost0; in tre_tnfa_run_approx() local
665 int cost, cost0, err; in tre_tnfa_run_approx() local
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/tilepro/ |
| H A D | gen-mul-tables.cc | 110 int cost) in Operator()
119 int rhs_if_unary, int cost) in Operator()
437 int cost () const in cost() function in ExpressionTree
439 int cost = 0; in cost() local
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/tilepro/ |
| H A D | gen-mul-tables.cc | 110 int cost) in Operator()
119 int rhs_if_unary, int cost) in Operator()
437 int cost () const in cost() function in ExpressionTree
439 int cost = 0; in cost() local
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| H A D | fractional-cost.h | 175 fractional_cost::scale (uint32_t cost, fractional_cost a, fractional_cost b) in scale()
|
| /netbsd-src/games/trek/ |
| H A D | computer.c | 117 int cost; in computer() local
|
| /netbsd-src/external/zlib/pigz/dist/zopfli/ |
| H A D | squeeze.c | 129 double cost = 0; in GetCostFixed() local
436 double cost = GetBestLengths( in LZ77OptimalRun() local
459 double cost; in ZopfliLZ77Optimal() local
|
| /netbsd-src/external/apache2/llvm/dist/clang/utils/ |
| H A D | CmpDriver | 41 def cost(a, b): function
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/nds32/ |
| H A D | nds32-cost.c | 64 int cost = COSTS_N_INSNS (GET_MODE_SIZE (mode) / GET_MODE_SIZE (SImode)); in nds32_rtx_costs_speed_prefer() local
|
| /netbsd-src/external/bsd/ntp/dist/util/ |
| H A D | ntptime.c | 112 int cost = 0; in main() local
|