Re: How do typical Ada calling conventions work ?

["Randy Brukardt" <randy@rrsoftware.com>]

"Hadrien Grasland" <hadrien.grasland@gmail.com> wrote in message 
news:2541f7b7-b728-421b-96cf-e0d656e984a2@googlegroups.com...
...
>Thanks for your answers ! These are some pretty nice ways to do it instead 
>indeed.
>
>I'm glad the secondary stack approach won in the end for GNAT, it sounds 
>more
> efficient, clean and scalable than what they were attempting in the 
> beginning.

I doubt that. The scheme Janus/Ada uses is much simpler: the memory is 
allocated off of a special storage pool and it is then freed using the same 
mechanism that does other finalization (indeed, the memory management [which 
we used in Ada 83] was repurposed to do finalization, rather than the other 
way around).

This is probably not as efficient as the secondary stack approach, but I 
find that irrelevant in 99.9% of programs. All functions that return 
non-elementary types are somewhat more expensive than the similar parameter 
passing, so if efficiency is a primary concern, one must use procedures 
rather than functions. The cases where function return by secondary stack 
would be efficient enough but function return by heap is not efficient 
enough are going to be quite rare [in the vast majority of cases either both 
are good enough or neither are] -- thus there are better things to spend 
effort on.

                                                    Randy.