Re: Argument passing conventions and optimization

# In general whenever a function calls another function, it passes
# arguments by pushing the values onto the stack. Similarly, when a


Stacks are only necessary for recursive functions; if the language
does not permit recursion, or if the compiler can determine there is
none, variables can be allocated statickally and return addresses can
be stored in fixed locations. This is how some Fortran compilers
worked in the good old days of 24 bit computers.


# My question is: Does any of the known compiler (inter procedural)
# optimizations which are in usage modify the standard argument passing
# mechanism? Do I get a situation where I get two different argument
# passing/ return mechanisms when I compile a program with no
# optimization and Full optimization?


Many have been proposed, but I don't know how many are implemented. Things
like merging caller and callee register allocations. Special cased branch
and link that to minimise memory traffic during the call and return.


--
Derk Gwen http://derkgwen.250free.com/html/index.html

Return to the comp.compilers page.
Search the comp.compilers archives again.