On Tuesday 15 August 2006 12:23:34 Vishal Soni wrote: > I should be able to hack up a vanilla register allocation scheme that does > no live variable analysis to find overlapping registers to reduce the > number of registers. Currently I have implemented this scheme in Byte Code > Generator (compilers/bcg/src/bcg_reg_alloc_vanilla.c). All this does is it > makes sure each varaible gets a unique register. The quality of the code > generate might not be good but this should be very fast in compile time > performance compared to Graph Based allocator. This should be simple to do > and we can still keep the graph allocator but only run it when the > optimization flag -Ox is used. > > Let me know your thoughts. I'll try to catch you guys later on IRC.
Rakudo is nearly in a state where this could come in handy. -- c
