Why are function arguments pushed on the stack in right to left order?
To enable the existence of functions with a variable number of arguments, like printf. The function can extract the first one or two arguments and then use their values to deduce the total number of arguments on the stack.
mov reg, immediate
before every call (or every unprototyped or variadic call) to indicate the number of args, or the number of bytes of args; remember they can be different sizes. (x86-64 SysV requires the number of FP args in XMM regs for possibly-variadic function calls, with the upside being many more possible FP/integer args in regs.) –
Lowis The only reason is for variadic functions: the first arguments popped from the stack are the "known" ones for the function, and it can determine from them how many other arguments it should read from the stack.
Notice that, for this to work fine, in such calling conventions the stack cleanup is left to the caller, that knows how many arguments it pushed on the stack. This is slightly less efficient than callee-cleanup, because the cleanup code has to be written after each function call, while in calling conventions that do not allow variadic functions it can be embedded at the end of each function.
Other than this, there's no particular reason, in facts there are several calling conventions (e.g. Pascal, Borland Fastcall) that do not admit variadic functions and push parameters left to right.
© 2022 - 2024 — McMap. All rights reserved.