Bill~
On Mon, 22 Nov 2004 11:49:59 -0800, Bill Coffman <[EMAIL PROTECTED]> wrote: > > sub1() <---+ <---------+ > > ... | | > > sub2() ----+ <-+ | > > ... | | > > sub3() -----------+-----+ > > In the continuations enhanced control flow graph (the control flow > graph (cfg), after one considers the effects of continuations), it is > possible for any subroutine to jump back to the exit point of any > previous subroutine. Leo has drawn the picture a few times, as above, > showing the complex web of links from any sub to any sub. It is the > control flow graph which provides the register allocator with the > information it nees to determines which variables interfere. They > interfere if they could be active at the same time. If they > interfere, they must be assigned different registers. It is also possible for functions to jump forward to the return continuation of a function called later on (this requires that function to be called, store it continuation somewhere, and then jump back to a function before the one in question, but it can happen.) Matt -- "Computer Science is merely the post-Turing Decline of Formal Systems Theory." -???
