Displaying 4 results from an estimated 4 matches for "regallocqueri".
Did you mean:
regallocquery
2009 Jan 12
0
[LLVMdev] Is it possible to use the SimpleRegisterCoalescing pass in an iterative way?
On Friday 09 January 2009 03:36, Roman Levenstein wrote:
> Hi,
>
> I'm implementing some variations of graph-coloring register allocators for
> LLVM. Many of them perform their phases (e.g. coalescing, graph
> simplification, spilling, color selection) in an iterative way. Since
> LLVM provides an implementation of the coalescing in the
> SimpleRegisterCoalescing class
2009 Jan 09
4
[LLVMdev] Is it possible to use the SimpleRegisterCoalescing pass in an iterative way?
Hi,
I'm implementing some variations of graph-coloring register allocators for LLVM.
Many of them perform their phases (e.g. coalescing, graph
simplification, spilling, color selection) in an iterative way. Since
LLVM provides an implementation of the coalescing in the
SimpleRegisterCoalescing class already, I would like to reuse it (even
though I could of course create my own coalescing
2008 Feb 01
0
[LLVMdev] Some questions about live intervals
On Jan 31, 2008, at 5:05 AM, Roman Levenstein wrote:
> Hi,
>
> I'm trying to sketch an LLVM-based implementation of the Extended
> Linear Scan algorithm, described in this Vivek Sarkar's paper:
> http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf
> Sarkar reports that this version of Linear Scan produces better code
> than graph-coloring regallocs and is also much faster (15x
2008 Jan 31
7
[LLVMdev] Some questions about live intervals
Hi,
I'm trying to sketch an LLVM-based implementation of the Extended
Linear Scan algorithm, described in this Vivek Sarkar's paper:
http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf
Sarkar reports that this version of Linear Scan produces better code
than graph-coloring regallocs and is also much faster (15x to 68x).
I already started work on the implementation of this algorithm and have
a few