Displaying 3 results from an estimated 3 matches for "backscheduling".
2009 Jul 23
5
[LLVMdev] Two Regalloc Enhancements
...tures modifies linearscan to try to spread register usage out a
bit. Rather than always grabbing the first free register in the allocatable
list, it remembers the last few registers recently assigned and does not reuse
them unless there are no other registers available. This tends to help the
backscheduling code by distributing register usage and providing more
scheduling freedom. It also can induce spilling where none was there before
if the allocator has "just enough" registers. We haven't noticed any serious
performance problems in practice.
With both patches, we have seen perfo...
2009 Jul 24
0
[LLVMdev] Two Regalloc Enhancements[MESSAGE NOT SCANNED]
...rscan to try to spread register usage out a
> bit. Rather than always grabbing the first free register in the allocatable
> list, it remembers the last few registers recently assigned and does not reuse
> them unless there are no other registers available. This tends to help the
> backscheduling code by distributing register usage and providing more
> scheduling freedom. It also can induce spilling where none was there before
> if the allocator has "just enough" registers. We haven't noticed any serious
> performance problems in practice.
>
> With both pa...
2009 Jul 23
0
[LLVMdev] Two Regalloc Enhancements
...egister
> usage out a
> bit. Rather than always grabbing the first free register in the
> allocatable
> list, it remembers the last few registers recently assigned and does
> not reuse
> them unless there are no other registers available. This tends to
> help the
> backscheduling code by distributing register usage and providing more
> scheduling freedom. It also can induce spilling where none was
> there before
> if the allocator has "just enough" registers. We haven't noticed
> any serious
> performance problems in practice.
Ok. As with...