Displaying 5 results from an estimated 5 matches for "spillcost".
2012 Feb 03
1
[LLVMdev] register allocation
...he register allocators would factor it in with the spillWeight calculation. I suppose this would be fairly simple to implement, given that all the register allocators except -fast use the CalcSpillWeights class, where it could be included. Would this make sense to you as a patch? Maybe CopyCost and SpillCost should be held separate, I don't know, but in this case a new attribute could be introduced.
Jonas
-----Original Message-----
From: Jakob Stoklund Olesen [mailto:stoklund at 2pi.dk]
Sent: Friday, February 03, 2012 2:02 AM
To: Jeroen Dobbelaere
Cc: Jonas Paulsson; Jonas Paulsson; LLVMDEV
Subj...
2012 Feb 03
0
[LLVMdev] register allocation
On 2012 2 2, at 08:40, Jeroen Dobbelaere <Jeroen.Dobbelaere at synopsys.com> wrote:
> I was able to get rid of the 'moves' by setting the copycost to -1.
> For getting rid of the spills, I was forced to introduce custom nodes, that pass the CC register
> through 'glue'.
>
> Having a property to register classes that identifies a 'glue-like' behavior
2012 Feb 02
2
[LLVMdev] register allocation
Hi Jakob, Jonas et al,
Jakob wrote:
[...]
> Jonas wrote:
> [...]
> > What's more, setting the GPR_CR class to 'not-spillable' would probably do the trick here as we
> > basically do not want to do this, and I would not have to pre-allocate. But there is probably a
> > better way, or?
>
> I am sorry, I simply don't understand what you are asking
2012 Sep 29
0
[LLVMdev] LLVM's Pre-allocation Scheduler Tested against a Branch-and-Bound Scheduler
On Sep 29, 2012, at 2:43 AM, Ghassan Shobaki <ghassan_shobaki at yahoo.com> wrote:
> Hi,
>
> We are currently working on revising a journal article that describes our work on pre-allocation scheduling using LLVM and have some questions about LLVM's pre-allocation scheduler. The answers to these question will help us better document and analyze the results of our benchmark
2012 Sep 29
7
[LLVMdev] LLVM's Pre-allocation Scheduler Tested against a Branch-and-Bound Scheduler
Hi,
We are currently working on revising a journal article that describes
our work on pre-allocation scheduling using LLVM and have some questions about LLVM's pre-allocation scheduler. The answers to these question will help us better document and analyze the results of our benchmark tests that compare our algorithm with LLVM's pre-allocation scheduling algorithm.
First, here is a