fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-01-05 02:30:18 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

aco/scheduler: keep track of RegisterDemand at UpwardsCursor::insert_idx

Browse source 
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/33644>
This commit is contained in:
Daniel Schürmann 2024-04-18 16:58:11 +02:00 • committed by Marge Bot
parent 52253da783
commit f58654e98f
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
src/amd/compiler/aco_scheduler.cpp
View file

@ -71,6 +71,8 @@ struct UpwardsCursor {
/* Maximum demand of instructions from insert_idx (inclusive) to source_idx (exclusive) */
RegisterDemand total_demand;
/* Register demand immediately before the first use instruction. */
RegisterDemand insert_demand;
UpwardsCursor(int source_idx_) : source_idx(source_idx_)
{
@ -335,6 +337,8 @@ MoveState::upwards_update_insert_idx(UpwardsCursor& cursor)
{
cursor.insert_idx = cursor.source_idx;
cursor.total_demand = block->instructions[cursor.insert_idx]->register_demand;
const RegisterDemand temp = get_temp_registers(block->instructions[cursor.insert_idx - 1].get());
cursor.insert_demand = block->instructions[cursor.insert_idx - 1]->register_demand - temp;
}
MoveResult
@ -360,10 +364,7 @@ MoveState::upwards_move(UpwardsCursor& cursor)
const RegisterDemand temp = get_temp_registers(instr.get());
if (RegisterDemand(cursor.total_demand + candidate_diff).exceeds(max_registers))
return move_fail_pressure;
const RegisterDemand temp2 =
get_temp_registers(block->instructions[cursor.insert_idx - 1].get());
const RegisterDemand new_demand =
block->instructions[cursor.insert_idx - 1]->register_demand - temp2 + candidate_diff + temp;
const RegisterDemand new_demand = cursor.insert_demand + candidate_diff + temp;
if (new_demand.exceeds(max_registers))
return move_fail_pressure;
@ -375,8 +376,7 @@ MoveState::upwards_move(UpwardsCursor& cursor)
for (int i = cursor.insert_idx + 1; i <= cursor.source_idx; i++)
block->instructions[i]->register_demand += candidate_diff;
cursor.total_demand += candidate_diff;
cursor.total_demand.update(block->instructions[cursor.source_idx]->register_demand);
cursor.insert_demand += candidate_diff;
cursor.insert_idx++;
cursor.source_idx++;