Displaying 2 results from an estimated 2 matches for "braun10cc".
Did you mean:
braun09cc
2010 Oct 06
0
[LLVMdev] [LLVMDev] Phi elimination: Who does what
...tor tree scan, puzzle-solving, or a modified graph coloring / coalescing heuristic like IRC. The best quality for the least amount of implementation effort is probably a dominator tree scan with register preferences, so I'll try that first:
http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun10cc.pdf
Cameron
On Oct 5, 2010, at 7:43 PM, Jeff Kunkel wrote:
> The allocator you are building, is it the Hack's and Goos's polynomial
> time algorithm?
>
> On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote:
>> There is nothing that curren...
2010 Oct 05
2
[LLVMdev] [LLVMDev] Phi elimination: Who does what
The allocator you are building, is it the Hack's and Goos's polynomial
time algorithm?
On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote:
> There is nothing that currently handles this properly, as far as I know. If you have a phi
>
> c = phi(a, b)
>
> where a, b and c are all assigned distinct stack slots, then copies must be inserted in