CS356 Unit 6 x86 Procedures Basic Stack Frames 6.2 Review of - PowerPoint PPT Presentation

6.1 CS356 Unit 6 x86 Procedures Basic Stack Frames

6.2 Review of Program Counter (Instruc. Pointer) • PC/IP is used to fetch an instruction – PC/IP contains the address of the next instruction – The value in the PC/IP is placed on the address bus and the memory is told to read – The PC/IP is incremented, and the process is repeated for the next instruction Processor Memory PC = Addr = 0 0 PC/IP Addr 0 inst. 1 op. 1 inst. 2 Data = inst.1 machine code 2 inst. 3 ALU out in1 Data 3 inst. 4 ADD, SUB, AND, OR 4 inst. 5 in2 Control = Read … $0-$31 Control FF

6.3 Procedures (Subroutines) CS:APP 3.7.1 • Procedures (aka subroutines or functions) are reusable sections of code that we can call from some location, execute that procedure, and then return to where we left off C code: int main() { We call the ... procedure to x = 8; calculate the average res = avg(x,4); and when it is printf("%d\n", res); finished it will return } to where we left off A procedure to int avg(int a, int b){ calculate the average return (a+b)/2; of 2 numbers }

6.4 Procedures • Procedure calls are similar to 'jump' instructions where we go to a new location in the code C code: int main() { ... x = 8; Call “ avg ” procedure will 1 res = avg(x,4); require us to jump to that printf("%d\n", res); code } int avg(int a, int b){ return (a+b)/2; }

6.5 Normal Jumps vs. Procedures • Difference between normal jumps and procedure calls is that with procedures we have to return to where we left off • We need to leave a link to the return location before we jump to the procedure…if we wait until we get to the function its too late int main() { C code: ... x = 8; res = avg(x,4); printf("%d\n", res); Call “ avg ” procedure will 1 } require us to jump to After procedure that code int avg(int a, int b){ completes, 2 return (a+b)/2; return to the } statement in the main code where we left off

6.6 Implementing Procedures • To implement procedures in assembly we need to be able to: – Jump to the procedure code, leaving a "return link" (i.e. return address) to know where to return – Find the return address and go back to that location C code: Assembly: ... .text Call res = avg(x,4); ... ... 0x4001b call AVG # save a link Desired return 0x40020 next inst. # to next instruc. location AVG: Definition int avg(int a, int b) 0x40180 movl %edi, %eax { return (a+b)/2; } 0x40183 addl %esi, %eax 0x40186 sarl 1, %eax 0x40188 ret

6.7 Return Addresses • When calling a procedure, the address to jump to is ALWAYS the same • The location where a procedure returns will vary – Always the address of the instruction after the 'call' Assembly: PC 0004 0000 0x40000 call AVG 0x40004 is the return address for this call 0x40004 add ... 0x40028 is the return address for this call 0x40024 call AVG PC 0004 0024 0x40028 sub ... 0x40180 AVG: ... ret

6.8 Return Addresses • A further (very common) Assembly: ... complication is nested procedure calls call SUB1 1 – One procedure calls another 0x4001A ... 4 • Example: Main routine calls SUB1 which calls SUB2 SUB1: movl %edi,%eax • Must store both return addresses call SUB2 but where? 0x40208 ... 3 – Registers? No…very limited number 2 ret – Memory? Yes…usually enough memory for deep levels of nesting SUB2: ... ret

6.9 Return Addresses and Stacks • Note: Return addresses will be Assembly: ... accessed in reverse order as call SUB1 they are stored 1 0x4001A ... 4 – 0x40208 is the second RA to be stored but should be the first one SUB1: movl %edi,%eax used to return call SUB2 • A stack structure is appropriate! 0x40208 ... • The system stack will be a place 3 2 ret where we can store – Return addresses and other saved SUB2: ... register values ret – Local variables of a function – Arguments for procedures

6.10 System Stack • Stack is a data structure where data is accessed in reverse order as it is stored (a.k.a. LIFO = Last-in First- out) • Use a stack to store the return addresses and other data • System stack defined as growing towards smaller Memory / RAM addresses – Usually starts around ½ to ¾ of the way through the 0xfffffffc ... address space (i.e. for a 32-bit somewhere around 0x7ffff… or 0xbffff…) Initial "top" 0x7ffffff8 • Top of stack is accessed and maintained using %rsp 0000 0000 0x7ffffff4 (stack pointer) register Stack 0000 0000 0x7ffffff0 – %rsp points at top occupied location of the stack 0000 0000 0x7fffffec Processor 0000 0000 0x7fffffe8 Stack Pointer 0x7fffffe4 rip 0000 0000 0004 001b 0000 0000 Always points to 0000 0000 0x7fffffe0 top occupied rsp 0000 0000 7fff fff8 Stack grows element of the towards lower rax 0000 0000 0000 0000 stack 0x0 addresses

6.11 Push Operation and Instruction • Push operation adds data to system stack • Format: push[w,q,l] %reg – Decrements %rsp by 2, 4, or 8 (depending on [w,q,l] Memory / RAM – Write %reg to memory at address given by 0xfffffffc ... %rsp – Example: pushq %rax Bottom of Stack 0x7ffffff8 – Equivalent: 1111 2222 0x7ffffff4 • subq $8, %rsp 3333 4444 0x7ffffff0 • movq %rax, (%rsp) Processor 0000 0000 0x7fffffec rsp 0000 0000 7fff fff8 %rsp before 0000 0000 0x7fffffe8 - 8 0x7fffffe4 0000 0000 Stack %rsp after 0000 0000 7fff fff0 0000 0000 0x7fffffe0 pushq %rax rax 1111 2222 3333 4444 rdx 0000 0000 0000 0000 0x0

6.12 Pop Operation and Instruction • Pop operation removes data from system stack • Format: pop[w,q,l] %reg – Reads memory at address given by %rsp and places Memory / RAM value into %reg 0xfffffffc ... – Increments %rsp by 2, 4, or 8 (depending on [w,q,l] – Example: popq %rdx Bottom of Stack 0x7ffffff8 – Equivalent: 1111 2222 0x7ffffff4 • movq (%rsp), %rdx 3333 4444 0x7ffffff0 • addq $8, %rsp Processor 0000 0000 0x7fffffec rsp 0000 0000 7fff fff0 %rsp before 0000 0000 0x7fffffe8 + 8 Stack 0x7fffffe4 0000 0000 %rsp after 0000 0000 7fff fff8 popq %rdx 0000 0000 0x7fffffe0 rax 1111 2222 3333 4444 Note: pop does not erase the data on the stack, it simply moves the %rsp. The rdx 1111 2222 3333 4444 next push will overwrite the old value. 0x0

6.13 Jumping to a Procedure CS:APP 3.7.2 • Format: – call label – call *operand [e.g. call (%rax)] • Operations: – Pushes the address of next instruction (i.e. return address (RA) ) onto the stack • Implicitly performs subq $8, (%rsp) and movq %rip, (%rsp) – Updates the PC to go to the start of the desired procedure [i.e. PC = addr] • addr is the address you want to branch to ( Usually specified as a label )

6.14 Returning From a Procedure • Format: – ret • Operations: – Pops the return address from the stack into %rip [i.e. PC = return-address] – Implicitly performs movq (%rsp), %rip and addq $8, %rsp

6.15 Procedure Call Sequence 1a • Initial conditions – About to execute the 'call' instruction – Current top of stack is at 0x7ffffff8 Memory / RAM 0000 0000 0x7ffffff8 0000 0000 0x7ffffff4 0x7ffffff0 0000 0000 0000 0000 0x7fffffec Processor ... 0000 0000 0x7fffffe8 call AVG rip 0000 0000 0004 001b movl %eax,(%rbp) 0x7fffffe4 0000 0000 Stack ... rsp 0000 0000 7fff fff8 0000 0000 0x7fffffe0 AVG: ... rax 0000 0000 0000 0000 movl %edi,%eax call AVG 0x4001b ... movl 0x40020 rdi 0000 0000 0000 0008 ret AVG: rsi 0000 0000 0000 0004 movl %edi,%eax 0x40180 ... ret 0x40188

6.16 Procedure Call Sequence 1b • call Operation (i.e. push return address) & jump – Decrement stack pointer ($rsp) and push RA (0x40020) onto stack (as 64-bit address) Memory / RAM – Update PC to start of procedure (0x40180) 0000 0000 0x7ffffff8 0000 0000 0x7ffffff4 2 0x7ffffff0 0004 0020 0000 0000 0000 0x7fffffec Processor ... 3 0000 0000 0x7fffffe8 call AVG rip 0000 0000 0004 0180 movl %eax,(%rbp) 0x7fffffe4 0000 0000 Stack 1 ... rsp 0000 0000 7fff fff8 0000 0000 0x7fffffe0 AVG: - 8 ... movl %edi,%eax 0000 0000 7fff fff0 call AVG 0x4001b ... movl 0x40020 rax 0000 0000 0000 0000 ret AVG: rdi 0000 0000 0000 0008 movl %edi,%eax 0x40180 ... ret 0x40188 rsi 0000 0000 0000 0004

6.17 Procedure Call Sequence 1c • Execute the code for the procedure • Return value should be in %rax/%eax Memory / RAM 0000 0000 0x7ffffff8 0000 0000 0x7ffffff4 0x7ffffff0 0004 0020 0000 0000 0000 0x7fffffec Processor ... 0000 0000 0x7fffffe8 call AVG rip 0000 0000 0004 0180 movl %eax,(%rbp) 0x7fffffe4 0000 0000 Stack ... rsp 0000 0000 7fff fff0 0000 0000 0x7fffffe0 AVG: ... rax 0000 0000 0000 0006 movl %edi,%eax call AVG 0x4001b ... movl 0x40020 rdi 0000 0000 0000 0008 ret AVG: rsi 0000 0000 0000 0004 movl %edi,%eax 0x40180 ... ret 0x40188