Displaying 3 results from an estimated 3 matches for "20coloring".
2017 Dec 15
0
Register Allocation Graph Coloring algorithm and Others
...ach: a lot of tiny transformations directed by a cost function and
using metaheuristics (I also used tabu search as HEA). Nothing good came
out of this.
If you are interesting in RA algorithms and architectures, I'd recommend
Michael Matz article
ftp://gcc.gnu.org/pub/gcc/summit/2003/Graph%20Coloring%20Register%20Allocation.pdf
as a start point.
>
> [1] https://reviews.llvm.org/D39712
>
> [2] http://lists.llvm.org/pipermail/llvm-dev/2008-March/012940.html
>
> [3] https://github.com/joaotavio/llvm-register-allocator
>
> [4] https://github.com/xiangzhai/llvm/tree/avr/incl...
2007 Apr 12
8
[LLVMdev] Regalloc Refactoring
Chris Lattner wrote:
> On Thu, 12 Apr 2007, David Greene wrote:
>> As I work toward improving LLVM register allocation, I've
>> come across the need to do some refactoring.
>
> cool. :) One request: Evan is currently out on vacation until Monday.
> This is an area that he is very interested in and will want to chime in
> on. Please don't start anything
2017 Dec 15
8
Register Allocation Graph Coloring algorithm and Others
Hi GCC and LLVM developers,
I am learning Register Allocation algorithms and I am clear that:
* Unlimited VirtReg (pseudo) -> limited or fixed or alias[1] PhysReg (hard)
* Memory (20 - 100 cycles) is expensive than Register (1 cycle), but it
has to spill code when PhysReg is unavailable
* Folding spill code into instructions, handling register coallescing,
splitting live ranges, doing