15 213 The course that gives CMU its Zip Machine Level Programming III Procedures Sept 15 2006 IA32 x86 64 stack discipline Register saving conventions Creating pointers to local variables class06 ppt Argument passing in registers Minimizing stack usage Using stack pointer as only reference 15 213 F 06 IA32 Stack Region of memory managed with stack discipline Grows toward lower addresses Register esp indicates lowest stack address Stack Bottom Increasing Addresses z address of top element Stack Pointer esp Stack Grows Down Stack Top 2 15 213 F 06 IA32 Stack Pushing Pushing pushl Src Fetch operand at Src Decrement esp by 4 Stack Bottom Increasing Addresses Write operand at address given by esp Stack Pointer esp Stack Grows Down 4 Stack Top 3 15 213 F 06 IA32 Stack Popping Popping popl Dest Read operand at address given by esp Increment esp by 4 Write to Dest Stack Bottom Increasing Addresses Stack Pointer esp Stack Grows Down 4 Stack Top 4 15 213 F 06 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 z Return address 0x8048553 Procedure return 5 ret Pop address from stack Jump to address 15 213 F 06 Procedure Call Example 804854e 8048553 e8 3d 06 00 00 50 call 0x110 0x110 0x10c 0x10c 0x108 0x108 123 call pushl 8048b90 main eax 8048b90 123 0x104 0x8048553 esp esp 0x108 eip 0x804854e 0x108 0x104 eip 0x8048b90 0x804854e eip is program counter 6 15 213 F 06 Procedure Return Example 8048591 c3 ret ret 0x110 0x110 0x10c 0x10c 0x108 123 0x108 0x104 0x8048553 esp 0x104 eip 0x8048591 123 0x8048553 esp 0x104 0x108 eip 0x8048553 0x8048591 eip is program counter 7 15 213 F 06 Stack Based Languages Languages that Support Recursion e g C Pascal Java Code must be Reentrant z Multiple simultaneous instantiations of single procedure Need some place to store state of each instantiation z Arguments z Local variables z Return pointer Stack Discipline State for given procedure needed for limited time z From when called to when return Callee returns before caller does Stack Allocated in Frames 8 state for single procedure instantiation 15 213 F 06 Call Chain Example Code Structure yoo who 9 Call Chain yoo who amI amI Procedure amI recursive who amI amI amI amI amI amI 15 213 F 06 Stack Frames Contents Local variables Return information Temporary space yoo who amI Management Space allocated when enter procedure z Set up code Deallocated when return z Finish code Pointers 10 Stack pointer esp indicates stack top Frame pointer ebp indicates start of current frame Frame Pointer ebp proc Stack Pointer esp Stack Top 15 213 F 06 Stack Operation yoo who 11 Call Chain yoo Frame Pointer ebp yoo Stack Pointer esp 15 213 F 06 Stack Operation who amI amI 12 Call Chain yoo Frame Pointer ebp yoo who who Stack Pointer esp 15 213 F 06 Stack Operation amI amI 13 Call Chain yoo yoo who amI Frame Pointer ebp who amI Stack Pointer esp 15 213 F 06 Stack Operation amI amI Call Chain yoo yoo who who amI amI Frame Pointer ebp amI amI Stack Pointer esp 14 15 213 F 06 Stack Operation amI amI Call Chain yoo yoo who who amI amI amI amI Frame Pointer ebp amI amI Stack Pointer esp 15 15 213 F 06 Stack Operation amI amI Call Chain yoo yoo who who amI amI Frame Pointer ebp amI amI amI 16 Stack Pointer esp 15 213 F 06 Stack Operation amI amI Call Chain yoo yoo who amI amI Frame Pointer ebp who amI Stack Pointer esp amI 17 15 213 F 06 Stack Operation who amI amI Call Chain yoo Frame Pointer ebp yoo who who amI Stack Pointer esp amI amI 18 15 213 F 06 Stack Operation amI Call Chain yoo yoo Frame Pointer ebp who amI amI amI who amI Stack Pointer esp amI 19 15 213 F 06 Stack Operation who amI amI Call Chain Frame Pointer ebp yoo yoo who who amI amI Stack Pointer esp amI amI 20 15 213 F 06 Stack Operation Call Chain yoo who Frame Pointer ebp yoo Stack Pointer esp yoo who amI amI amI amI 21 15 213 F 06 IA32 Linux Stack Frame Current Stack Frame Top to Bottom Parameters for function about to call Caller Frame z Argument build Local variables z If can t keep in registers Saved register context Old frame pointer Arguments Frame Pointer ebp Saved Registers Local Variables Caller Stack Frame Return address z Pushed by call instruction 22 Arguments for this call Return Addr Old ebp Stack Pointer esp Argument Build 15 213 F 06 Revisiting swap Calling swap from call swap int zip1 15213 int zip2 91125 void call swap swap zip1 zip2 void swap int xp int yp int t0 xp int t1 yp xp t1 yp t0 23 call swap pushl zip2 pushl zip1 call swap Global Var Global Var Resulting Stack zip2 zip1 Rtn adr esp 15 213 F 06 Revisiting swap void swap int xp int yp int t0 xp int t1 yp xp t1 yp t0 swap pushl ebp movl esp ebp pushl ebx movl movl movl movl movl movl Set Up 12 ebp ecx 8 ebp edx ecx eax edx ebx eax edx ebx ecx movl 4 ebp ebx movl ebp esp popl ebp ret 24 Body Finish 15 213 F 06 swap Setup 1 Resulting Stack Entering Stack ebp ebp zip2 yp zip1 xp Rtn adr esp Rtn adr Old ebp esp swap pushl ebp movl esp ebp pushl ebx 25 15 213 F 06 swap Setup 2 Resulting Stack Entering Stack ebp zip2 yp zip1 xp Rtn adr esp Rtn adr Old ebp ebp esp swap pushl ebp movl esp ebp pushl ebx 26 15 213 F 06 swap Setup 3 Resulting Stack Entering Stack ebp zip2 yp zip1 xp Rtn adr esp Rtn adr Old ebp ebp Old ebx esp swap pushl ebp movl esp ebp pushl ebx 27 15 213 F 06 Effect of swap Setup Entering Stack Resulting Stack ebp Offset relative to ebp zip2 12 yp zip1 8 xp 4 Rtn adr Rtn adr esp movl 12 ebp ecx get yp movl 8 ebp edx get xp 28 0 Old ebp ebp Old ebx esp Body 15 213 F 06 swap Finish 1 swap s Stack Offset Offset 12 yp 12 yp 8 xp 8 xp 4 Rtn adr 4 Rtn adr 0 Old ebp ebp 0 Old ebp ebp 4 Old ebx esp 4 Old ebx esp Observation 29 Saved restored register ebx movl 4 ebp ebx movl ebp esp popl ebp ret 15 213 F 06 swap Finish 2 swap s Stack Offset swap s Stack Offset 12 yp 12 yp 8 xp 8 xp 4 Rtn adr 4 Rtn adr 0 Old ebp ebp 4 Old ebx esp 0 Old ebp ebp esp movl 4 ebp ebx movl ebp esp popl ebp …
View Full Document
Unlocking...