Functions and stack frame, C/C++ Programming

Assignment Help:

Each function has its own stack frame between %fp and %sp. Let Caller calls Callee. Then Caller's %sp becomes callee's %fp, and callee's %sp set to be a new value (a smaller one because stack grows from large address to small address). You can think that Callee's stack frame is on top of Caller's stack frame.

In Caller: put arguments in %o0 to %o5 registers or if number of arguments more than 6, prepare values in call linkage of the current stack frame. Then "call" address_of_callee; %o7 stored the returned address. (This %o7 will becomes %i7 in callee after the callee executes save instruction.)

In Callee: it executes "save" instruction:

  • 0. Caller's %i (input registers) and %l (local registers) are reserved in its own stack frame. They are put in the top portion of the caller's stack frame. Implication: the return address of Caller (NOT CALLEE), %i7, is stored there.
  • 1. set callee's %i (input registers) by callers %o (output registers). The implication: pass parameters and return address now is in %i7. And now callee's fp (%i6) <-- caller's sp (%o6).
  • 2. Allocate space for new frame pointers. Caller's sp (%o6) is now set to be the new value.

So at this point in callee, %i6 (%fp was caller's %o6) is set, and %o6 (%sp is set to be a new value). Question: where is the old %fp? It is stored somewhere in the top portion of the previous stack frame (see step 0.) The return address of Callee is stored in %i7. Is it possible to write a program to overflow this %i7? What return address that you really can overflow? Question: how to access that return address.

The "restore" instruction is the inverse function of save. Then the "ret" instruction should branch to %i7+8. The normal address should be %i7+4 as the next instruction address after call. The extra 4 is because sparc has a "branch delay" instruction that is executed BEFORE the call is made even it is put just after CALL. Is it strange. Not really. This is because modern CPU is a pipeline machine. It loads instruction every clock cycle, and branch (or jump or call) somewhat cannot be really done until the later stage the pipeline. And then it is already too late because the one JUST after this branch has already been executed. If you want to know more, you should take a look at computer architecture textbook which I think every graduate should know.

You should be very clear what return address in server.c is overflowed? Is it the return address of main() or the return address of copy()?


Related Discussions:- Functions and stack frame

M - algorithm corrections, Of course it is C[i] = A[i] + B[i].It was a typi...

Of course it is C[i] = A[i] + B[i].It was a typing mistake,never mind. You just understand the concept. 27-1 b. for grain-size=1 n=A.length grain-size=1 r=n for

What is an explicit constructor, A conversion constructor declared with the...

A conversion constructor declared with the explicit keyword. The compiler does not use an explicit constructor to execute an implied conversion of types. Its purpose is reserved ex

Explain redirection in c++?, Question 1 . Write a brief note on Aggregation...

Question 1 . Write a brief note on Aggregation Question 2 . Discuss briefly on constructors Question 3 . What are the important advantages of Inheritance? Question 4 .

Program of swapping in c++, Program of swapping two varibales: void sw...

Program of swapping two varibales: void swap(int *, int *);   // This is swap's prototype int main() {                 int x = 5, y = 7;                 swap(&x, &

Sums a sequence of integers, assume that the first integer read with cin sp...

assume that the first integer read with cin specifies the number of values remaining to be entered. that program should read only one value each time cin is executed .a typical inp

Circle queue, countSpaceAvailbility function that counts and returns the sp...

countSpaceAvailbility function that counts and returns the space availability in the circle queue there are two elemnts at the circle queue and should return 5 space if size 7 .

Algorithm , write an algorithm to swap values without using third variable

write an algorithm to swap values without using third variable

C program for find even & odd no.s in the array , C Program for FIND EVEN &...

C Program for FIND EVEN & ODD NO.S IN THE ARRAY #include stdio.h> #include string.h> #include conio.h> void main() {           int i=0,j=0, l_e[100],l_o[100];

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd