Searched refs:benefit (Results 1 - 9 of 9) sorted by relevance
| /third_party/mesa3d/src/intel/compiler/ |
| H A D | brw_nir_analyze_ubo_ranges.c | 42 * of registers required) and "benefit" (number of pull loads eliminated
44 * ranges (most benefit for the least cost).
50 int benefit; member
56 return 2 * entry->benefit - entry->range.length; in score()
174 /* TODO: should we count uses in loops as higher benefit? */ in analyze_ubos_block()
192 "benefit %2d, cost %2d, score = %2d\n", in print_ubo_entry()
194 info->offsets, entry->benefit, entry->range.length, score(entry)); in print_ubo_entry()
284 entry->benefit = 0; in brw_nir_analyze_ubo_ranges()
287 entry->benefit += info->uses[first_bit + i]; in brw_nir_analyze_ubo_ranges()
304 * benefit o in brw_nir_analyze_ubo_ranges()
[all...] |
| H A D | brw_fs_bank_conflicts.cpp | 720 * (partial) cycle-count benefit from moving an atom r from bank p to n.
864 const int benefit = in optimize_reg_permutation() local
868 if (benefit > best_benefit) { in optimize_reg_permutation()
870 best_benefit = benefit; in optimize_reg_permutation()
|
| H A D | brw_schedule_instructions.cpp | 884 int benefit = 0; in get_register_pressure_benefit() local
889 benefit -= v->alloc.sizes[inst->dst.nr]; in get_register_pressure_benefit()
899 benefit += v->alloc.sizes[inst->src[i].nr]; in get_register_pressure_benefit()
907 benefit++; in get_register_pressure_benefit()
913 return benefit; in get_register_pressure_benefit()
|
| /third_party/mesa3d/src/panfrost/util/ |
| H A D | lcra.c | 200 /* Register spilling is implemented with a cost-benefit system. Costs are set
238 float benefit = constraints / cost; in lcra_get_best_spill_node() local
240 if (benefit > best_benefit) { in lcra_get_best_spill_node()
241 best_benefit = benefit; in lcra_get_best_spill_node()
|
| /third_party/mesa3d/src/panfrost/bifrost/ |
| H A D | bi_ra.c | 188 /* Register spilling is implemented with a cost-benefit system. Costs are set
581 unsigned benefit = lcra_count_constraints(l, i); in bi_choose_spill_node() local
583 if (benefit > best_benefit) { in bi_choose_spill_node()
584 best_benefit = benefit; in bi_choose_spill_node()
598 unsigned benefit = lcra_count_constraints(l, i); in bi_choose_spill_node() local
600 if (benefit > best_benefit) { in bi_choose_spill_node()
601 best_benefit = benefit; in bi_choose_spill_node()
|
| /third_party/mesa3d/src/util/ |
| H A D | register_allocate.c | 1016 float benefit = 0; in ra_get_spill_benefit() local
1019 /* Define the benefit of eliminating an interference between n, n2 in ra_get_spill_benefit()
1027 benefit += ((float)g->regs->classes[n_class]->q[n2_class] / in ra_get_spill_benefit()
1031 return benefit; in ra_get_spill_benefit()
1035 * Returns a node number to be spilled according to the cost/benefit using
1052 float benefit; in ra_get_best_spill_node() local
1060 benefit = ra_get_spill_benefit(g, n); in ra_get_best_spill_node()
1062 if (benefit / cost > best_benefit) { in ra_get_best_spill_node()
1063 best_benefit = benefit / cost; in ra_get_best_spill_node()
|
| /third_party/mesa3d/src/compiler/nir/ |
| H A D | nir_opt_preamble.c | 68 /* Overall benefit, i.e. the value minus any cost to inserting
71 float benefit; member
463 state->benefit = state->value - in nir_opt_preamble()
466 if (state->benefit > 0) { in nir_opt_preamble()
|
| /third_party/libunwind/libunwind/doc/ |
| H A D | libunwind-dynamic.tex | 317 overhead of explicit sorting is only paid when there is a real benefit
|
| /third_party/skia/third_party/externals/microhttpd/doc/ |
| H A D | texinfo.tex | 5001 % A bit of stretch before each entry for the benefit of balancing
|
Completed in 24 milliseconds