G
Good Guy
hey there
regarding following info at this address(http://en.wikipedia.org/wiki/Call_stack#Overlap):
For some purposes, the stack frame of a subroutine and that of its caller can be considered to overlap, the overlap consisting of the area where the parameters are passed from the caller to the callee. In some environments, the caller pushes each argument onto the stack, thus extending its stack frame, then invokes the callee. In other environments, the caller has a preallocated area at the top of its stack frame to hold the arguments it suppliesto other subroutines it calls. This area is sometimes termed the outgoing arguments area or callout area. Under this approach, the size of the area is calculated by the compiler to be the largest needed by any called subroutine.
may a C++ compiler ever do that? I think of following case for example assuming it's not inlined and only variables in local scopes of its callers arepassed to this function:
void bar(int & in){in++;}
regarding following info at this address(http://en.wikipedia.org/wiki/Call_stack#Overlap):
For some purposes, the stack frame of a subroutine and that of its caller can be considered to overlap, the overlap consisting of the area where the parameters are passed from the caller to the callee. In some environments, the caller pushes each argument onto the stack, thus extending its stack frame, then invokes the callee. In other environments, the caller has a preallocated area at the top of its stack frame to hold the arguments it suppliesto other subroutines it calls. This area is sometimes termed the outgoing arguments area or callout area. Under this approach, the size of the area is calculated by the compiler to be the largest needed by any called subroutine.
may a C++ compiler ever do that? I think of following case for example assuming it's not inlined and only variables in local scopes of its callers arepassed to this function:
void bar(int & in){in++;}