--- /internals.mdwn 2010/02/21 17:46:39 1.16 +++ /internals.mdwn 2010/02/28 08:00:32 1.17 @@ -11,7 +11,7 @@ efficient instruction when there are multiple choices. The Sethi-Ullman calculations are pretty much straightforward, can be found -in almost any book [essay editing](http://editing-services.org/index.php) on compilers. Its implementation in the original pcc +in almost any book on compilers. Its implementation in the original pcc were hand-crafted in target-dependent code, now it's only used to find the sub-tree evaluation order (and not to store trees) so the calculations are done based on the instructions generated. @@ -20,7 +20,7 @@ "Iterated Register Coalescing", ACM Transactions, No 3, May 1996. I've tried to keep it close to the pseudo-code. -The addition to the [[register_allocator]] [resume writers](http://cvresumewriters.com/) to handle multiple register classes +The addition to the [[register_allocator]] to handle multiple register classes (with overlapping regs) is mostly done by me. I haven't documented it, but some of the basics comes from the paper
Powered by rcshistory.cgi 0.3