diff options
| -rw-r--r-- | src/intel/compiler/brw_fs_reg_allocate.cpp | 14 |
1 files changed, 13 insertions, 1 deletions
diff --git a/src/intel/compiler/brw_fs_reg_allocate.cpp b/src/intel/compiler/brw_fs_reg_allocate.cpp index 94b18153492..d5c4f032182 100644 --- a/src/intel/compiler/brw_fs_reg_allocate.cpp +++ b/src/intel/compiler/brw_fs_reg_allocate.cpp @@ -932,8 +932,20 @@ fs_visitor::choose_spill_reg(struct ra_graph *g) } for (unsigned i = 0; i < this->alloc.count; i++) { + int live_length = virtual_grf_end[i] - virtual_grf_start[i]; + if (live_length <= 0) + continue; + + /* Divide the cost (in number of spills/fills) by the log of the length + * of the live range of the register. This will encourage spill logic + * to spill long-living things before spilling short-lived things where + * spilling is less likely to actually do us any good. We use the log + * of the length because it will fall off very quickly and not cause us + * to spill medium length registers with more uses. + */ + float adjusted_cost = spill_costs[i] / logf(live_length); if (!no_spill[i]) - ra_set_node_spill_cost(g, i, spill_costs[i]); + ra_set_node_spill_cost(g, i, adjusted_cost); } return ra_get_best_spill_node(g); |