|Implementation and Optimization of exceptions ( static analysis possi firstname.lastname@example.org (Steven D. Majewski) (1995-07-21)|
|Re: Implementation and Optimization of exceptions ( static analysis p email@example.com (1995-07-26)|
|Re: exceptions ( static analysis possible? ) firstname.lastname@example.org (steve (s.s.) simmons) (1995-07-31)|
|Re: exceptions ( static analysis possible? ) email@example.com (1995-08-13)|
|From:||"steve (s.s.) simmons" <firstname.lastname@example.org>|
|Organization:||Bell-Northern Research Ltd.|
|Date:||Mon, 31 Jul 1995 13:30:15 GMT|
> The usual technique in Ada compilers has near-zero overhead for entering
> a procedure/block with a handler, and lots of overhead for actually
> raising an exception. This is good if exceptions are used for truly
> exceptional situations. The technique is to keep a static table for
> each procedure, which maps ranges of code addresses to the corresponding
> exception handler.
Certainly, you are right in the case with no optimizations. However,
Ada's exception blocks do have a subtle. That is, you can't optimize
across a exception block boundary in Ada when doing any global
optimizations. It is a subtle, but important issue...
Return to the
Search the comp.compilers archives again.