|
From: Julian S. <js...@ac...> - 2005-05-19 10:17:45
|
> > I guess Ada-interoperability is a dark corner, then :) You're only the > > second person I recall being stung by this. > > The pain is real though... Person number two humbly asks if anything > can be done. Ok, I'll think about what's needed to implement this. Let me see if I understand the landscape correctly. The problem is that ada (and nested C/C++ fns, with gcc) create small bits of code on the stack and then run them. V fails to notice when on of these small bits of code gets re-made, and so may wind up using out of date translations. So we can easily enough generate self-checking translations. A problem is, since self-checking translations are expensive to run, we want to make as few as possible. That means having a good heuristic for deciding when to do so. The currently postulated heuristic is to make a self- checking translation for code within some small offset of the stack pointer. Ideally the heuristic should say "yes" as infrequently as possible, but it should also never miss any such cases either. Is that correct? Any other things I need to take into account? J |