计算机系统详解lec03c-Machine Language-Procedure课件.pptVIP

Computer Systems:A Programmer’s Perspective计算机系统详解Lecture 3c Machine-Level ProgrammingIII April 12, 2010 Wu junmin (jmwu@ustc.edu.cn) Overview IA32 stack discipline Register saving conventions Creating pointers to local variables IA32 Stack Region of memory managed with stack discipline Grows toward lower addresses Register %esp indicates lowest stack address address of top element IA32 Stack Pushing Pushing pushl Src Fetch operand at Src Decrement %esp by 4 Write operand at address given by %esp IA32 Stack Popping Popping popl Dest Read operand at address given by %esp Increment %esp by 4 Write to Dest Stack Operation Examples Procedure Control Flow Use stack to support procedure call and return Procedure call: call label Push return address on stack; Jump to label Return address value Address of instruction beyond call Example from disassembly 804854e: e8 3d 06 00 00 call 8048b90 main 8048553: 50 pushl %eax Return address = 0x8048553 Procedure return: ret Pop address from stack; Jump to address Procedure Call Example Procedure Return Example Stack-Based Languages Languages that Support Recursion e.g., C, Pascal, Java Code must be “Reentrant” Multiple simultaneous instantiations of single procedure Need some place to store state of each instantiation Arguments Local variables Return pointer Stack Discipline State for given procedure needed for limited time From when called to when return Callee returns before caller does Stack Allocated in Frames state for single procedure instantiation Call Chain Example Code Structure Stack Frames Contents Local variables Return information Temporary space Management Space allocated when enter procedure “Set-up” code Deallocated when return “Finish” code Pointers Stack pointer %esp indicates stack top Frame pointer %ebp indicates start of current frame Stack Operation Stack Operation Stack Operation Stack Operation Stack Operation Stack Operation Stack Operation Stack Operation Stack Operation Stack Op