Greetings, On Fri, 10 Dec 2010 01:32:38 -0800 (PST), Oliver Seitz wrote
> The only thing I really miss in JAL is something that compiles to a > "computed jump", be it gotos or calls. The problem here is simply the amount of code that must be touched to get this to work -- namely everything -- front end (trivial) both of the code generators, and all of the optimization paths. There are, of course, the standard paging issues which become even more complicated -- let's say each matching element is three statements -- branch bits + goto. If, during an optimization path one of the GOTOs changes banks, its corresponding branch bits would also need to change. Finally, what if the jump table itself crosses a page boundary? So...this is still in the back of my mind, but isn't quite a trivial as one might think. --kyle -- You received this message because you are subscribed to the Google Groups "jallib" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/jallib?hl=en.
