void P() {... y = Q(x); print(y); return; } ... int Q(int t) { int v[10];... return v[t]; } Computer Systems: A Programmer s Perspective
|
|
|
- Clyde Wood
- 5 years ago
- Views:
Transcription
1 void P() { y = Q(x); print(y); return;... int Q(int t) { int v[10]; return v[t]; Computer Systems: A Programmer s Perspective
2
3 %rax %rbx 0x101 0x41 0x7FFFFA8 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x789ABC 0x7FFFFB0 0x2 0x7FFFFA8
4 %rax 0x2 %rbx 0x41 0x7FFFFB0 popq %rax 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x789ABC 0x7FFFFB0 0x2
5 %rax %rbx popq %rax popq %rbx 0x2 0x789ABC 0x7FFFFB8 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x789ABC
6 %rax %rbx popq %rax popq %rbx pushq %rax 0x2 0x789ABC 0x7FFFFB0 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x2 0x7FFFFB0
7 %rax %rbx 0x2 0x789ABC 0x7FFFFA8 popq %rax popq %rbx pushq %rax subq $8, 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x2 0x7FFFFB0??? 0x7FFFFA8
8 %rax %rbx 0x2 0x789ABC 0x7FFFFB0 popq %rax popq %rbx pushq %rax subq $8, addq $8, 0x1 0x7FFFFF8 0xB5A9 0x7FFFFF0 0x789ABC 0x7FFFFE8 0x2 0x7FFFFE0 0x3 0x7FFFFD8 0xFADE 0x7FFFFD0 0x7FFFFE0 0x7FFFFC8 0x1 0x7FFFFC0 0xB5A9 0x7FFFFB8 0x2 0x7FFFFB0
9 %rax %rbx 0x101 0x41 0x7FFFFF5 0x0 0x0 0xFA OxDE 0x0 0x0 0x0 0x0 0x7 0xFF 0xFD 0x7FFFFFF 0x7FFFFFE 0x7FFFFFD 0x7FFFFFC 0x7FFFFFB 0x7FFFFFA 0x7FFFFF9 0x7FFFFF8 0x7FFFFF7 0x7FFFFF6 0x7FFFFF5
10 %rax 0x7FFFD %rbx 0x41 0x7FFFFF9 popl %eax 0x0 0x0 0xFA OxDE 0x0 0x0 0x0 0x0 0x7 0xFF 0xFD 0x7FFFFFF 0x7FFFFFE 0x7FFFFFD 0x7FFFFFC 0x7FFFFFB 0x7FFFFFA 0x7FFFFF9
11 %rax %rbx popl %eax pushw %bx 0x7FFFD 0x41 0x7FFFFF7 0x0 0x0 0xFA OxDE 0x0 0x0 0x0 0x0 0x41 0x7FFFFFF 0x7FFFFFE 0x7FFFFFD 0x7FFFFFC 0x7FFFFFB 0x7FFFFFA 0x7FFFFF9 0x7FFFFF8 0x7FFFFF7
12 #include <stdio.h> void f(); void g(); int main() { int a; printf("&a in m: %p\n", &a); f(); g(); return 0; void f() { double b; printf("&b in f: %p\n", &b); void g() { char c; printf("&c in g: %p\n", &c);
13 $ gdb./a.out (gdb) break f Breakpoint 1 at 0x400530: file main.c, line 13. (gdb) run Starting program: /home/mflatt/cs4400/./a.out Breakpoint 1, f () at main.c:13 13 void f() { (gdb) n 15 printf("&b in f: %p\n", &b); (gdb) p &b $1 = (double *) 0x7fffffffe0b8 (gdb) p $rsp $2 = (void *) 0x7fffffffe0b0 (gdb) disassem f Dump of assembler code for function f: 0x <+0>: sub $0x18, => 0x <+4>: lea 0x8(),%rsi 0x <+9>: mov $0x400630,%edi 0x e <+14>: mov $0x0,%eax 0x <+19>: callq 0x <printf@plt> 0x <+24>: add $0x18, 0x c <+28>: retq
14 #include <stdio.h> int main() { printf("%d\n", fib(2)); main() int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2);
15 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib() n = 2
16 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib() n = 2 fib() n = 1
17 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib(2) main() fib() n = 2 fib() n = 1 fib(1)
18 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib() n = 2 fib() n = 1 main() fib(2) fib(1) fib stack frame
19 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib(2) main() fib() n = 2 fib(1)
20 #include <stdio.h> int main() { printf("%d\n", fib(2)); int fib(int n) { if ((n == 1) (n == 0)) return 1; else return fib(n-1) + fib(n-2); main() fib(2) main() fib() n = 2 fib() n = 0 fib(1) fib(0)
21 void P() { y = Q(x); print(y); return;... int Q(int t) { int v[10]; return v[t];
22 callx source next%rip source%ripsource 0x50300: callq 0x x50305:
23 retx %rip 0x50300: callq 0x x50305: 0x50640: 0x50650: retq
24 int main() { int a; printf(); f(); g(); return 0; 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
25 int main() { int a; printf(); f(); g(); return 0; 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
26 int main() { int a; printf(); f(); g(); return 0; %rip 0x x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
27 int main() { int a; printf(); f(); g(); return 0; %rip 0x x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x40045c void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
28 int main() { int a; printf(); f(); g(); return 0; %rip 0x void f() { double b; printf(); 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq 0x40045c
29 int main() { int a; printf(); f(); g(); return 0; %rip 0x void f() { double b; printf(); 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq 0x40045c
30 int main() { int a; printf(); f(); g(); return 0; %rip 0x310 void f() { double b; printf(); 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq 0x40045c 0x400575
31 int main() { int a; printf(); f(); g(); return 0; %rip 0x350 void f() { double b; printf(); 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq 0x40045c 0x400575
32 int main() { int a; printf(); f(); g(); return 0; %rip 0x void f() { double b; printf(); 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq 0x40045c 0x400575
33 int main() { int a; printf(); f(); g(); return 0; %rip 0x x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x40045c void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
34 int main() { int a; printf(); f(); g(); return 0; %rip 0x40045c 0x400457: callq 0x <f> 0x40045c: xor %eax,%eax printf 0x310:... 0x350: retq 0x40045c void f() { double b; printf(); 0x400560: sub $0x18, 0x400564: 0x400570: callq 0x310 <printf> 0x400575: add $0x18, 0x400579: retq
35 void P() { y = Q(x); print(y); return;... int Q(int t) { int v[10]; return v[t];
36 %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument %rax result... Nth argument... 8th argument 7th argument Computer Systems: A Programmer s Perspective
37 long mult2(long a, long b) { long s = a * b; return s; %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument mov %rdi,%rax # a imul %rsi,%rax # a * b retq # Return Computer Systems: A Programmer s Perspective
38 long mult2(long a, long b); int main() { return mult2(2, 3); %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument subq $0x8, movl $0x3,%esi movl $0x2,%edi callq <mult2> add $0x8, retq
39 void rmultstore(long y, long x, long *dest) { long t = mult2(x, y); *dest = t; %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument movq %rdi,%rax # Save y movq %rsi,%rdi # x as first argument movq %rax,%rsi # y as second argument callq <mult2> # mult2(x,y)
40 void multstore(long x, long y, long *dest) { long t = mult2(x, y); *dest = t; %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument callq <mult2> # mult2(x,y) dest Computer Systems: A Programmer s Perspective
41 void multstore(long x, long y, long *dest) { long t = mult2(x, y); *dest = t; %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument pushq %rbx # Save %rbx mov %rdx,%rbx # Save dest callq <mult2> # mult2(x,y) movq %rax,(%rbx) # Save at dest popq %rbx # Restore %rbx retq %rbxpreserved register Computer Systems: A Programmer s Perspective
42 temporaries caller-saved %r10%rsi preserved callee-saved %rbx application binary interface
43 Caller-saved Callee-saved %rax return value %rdi 1st argument %rsi 2nd argument %rdx 3rd argument %rcx 4th argument %r8 5th argument %r9 6th argument %r10 temporary %r11 temporary %rbx preserved %r12 preserved %r13 preserved %r14 preserved %rbp stack frame stack pointer
44 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; Computer Systems: A Programmer s Perspective
45 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq Computer Systems: A Programmer s Perspective
46 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; %rbx call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq Computer Systems: A Programmer s Perspective
47 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq %rbxx Computer Systems: A Programmer s Perspective
48 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq %rbxx Computer Systems: A Programmer s Perspective
49 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq %rbx Computer Systems: A Programmer s Perspective
50 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq v1 Computer Systems: A Programmer s Perspective
51 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq v1 Computer Systems: A Programmer s Perspective
52 long incr(long *p, long val); long call_incr2(long x) { long v1 = 15213; long v2 = incr(&v1, 3000); return x+v2; call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq v1 Computer Systems: A Programmer s Perspective
53 So far, only integer and address arguments So far, only integer and address results There are more registers... x86-64 Linux: stack aligned on call at 8 mod 16
54 gcc gcc -g gcc && strip -s gcc -fno-asynchronous-unwind-tables gcc -fno-asynchronous-unwind-tables -fno-omit-frame-pointer
55 frame pointer prolog epilog %rbp %rbp
56 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
57 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
58 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
59 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x315 0x7FFFFF8 0x7FFFFF0 0x7FFFFE8 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
60 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
61 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
62 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
63 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x425 0x7FFFFC8 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
64 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x425 0x7FFFFC8 0x7FFFFE0 0x7FFFFC0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
65 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x425 0x7FFFFC8 0x7FFFFE0 0x7FFFFC0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
66 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x425 0x7FFFFC8 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
67 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x7FFFFD8 0x7FFFFD0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
68 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x7FFFFF8 0x7FFFFF0 0x315 0x7FFFFE8 0x x7FFFFE0 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
69 0x310: callq 0x400 0x315: 0x400: pushq %rbp 0x401: movq, %rbp 0x404: x8(%rbp) x420: callq 0x500 0x425: 0x430: popq %rbp 0x431: retq %rbp 0x315 0x7FFFFF8 0x7FFFFF0 0x7FFFFE8 0x500: pushq %rbp 0x501: movq, %rbp... 0x509: popq %rbp 0x510: retq
70 call_incr2: pushq %rbx subq $16, movq %rdi, %rbx movq $15213, 8() movl $3000, %esi leaq 8(), %rdi call incr addq %rbx, %rax addq $16, popq %rbx retq DWARF
71 %rbp arguments 7 and later return address old %rbp saved registers + local variables next call's arguments Computer Systems: A Programmer s Perspective
Machine-level Programs Procedure
Computer Systems Machine-level Programs Procedure Han, Hwansoo Mechanisms in Procedures Passing control To beginning of procedure code Back to return point Passing data Procedure arguments Return value
Machine-Level Programming III: Procedures
Machine-Level Programming III: Procedures CSE 238/2038/2138: Systems Programming Instructor: Fatma CORUT ERGİN Slides adapted from Bryant & O Hallaron s slides Mechanisms in Procedures Passing control
Bryant and O Hallaron, Computer Systems: A Programmer s Perspective, Third Edition. Carnegie Mellon
Carnegie Mellon Machine-Level Programming III: Procedures 15-213/18-213/14-513/15-513: Introduction to Computer Systems 7 th Lecture, September 18, 2018 Today Procedures Mechanisms Stack Structure Calling
Machine-Level Programming (2)
Machine-Level Programming (2) Yanqiao ZHU Introduction to Computer Systems Project Future (Fall 2017) Google Camp, Tongji University Outline Control Condition Codes Conditional Branches and Conditional
Machine- Level Representa2on: Procedure
Machine- Level Representa2on: Procedure CSCI 2021: Machine Architecture and Organiza2on Pen- Chung Yew Department Computer Science and Engineering University of Minnesota With Slides from Bryant, O Hallaron
Procedures and the Call Stack
Procedures and the Call Stack Topics Procedures Call stack Procedure/stack instructions Calling conventions Register-saving conventions Why Procedures? Why functions? Why methods? int contains_char(char*
CS429: Computer Organization and Architecture
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: February 28, 2018 at 06:32 CS429 Slideset 9: 1 Mechanisms in Procedures
Stack Frame Components. Using the Stack (4) Stack Structure. Updated Stack Structure. Caller Frame Arguments 7+ Return Addr Old %rbp
Stack Frame Components Frame pointer %rbp Stack pointer Caller Frame rguments 7+ Return ddr Old %rbp Saved Registers + Local Variables rgument Build 1 Using the Stack (4) Stack Structure long call_incr()
The Stack & Procedures
The Stack & Procedures CSE 351 Autumn 2017 Instructor: Justin Hsia Teaching Assistants: Lucas Wotton Michael Zhang Parker DeWilde Ryan Wong Sam Gehman Sam Wolfson Savanna Yee Vinny Palaniappan http://xkcd.com/648/
The Stack & Procedures
The Stack & Procedures CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis Administrivia Homework 2 due
Assembly III: Procedures. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Assembly III: Procedures Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Mechanisms in Procedures Passing control To beginning of procedure code
Mechanisms in Procedures. CS429: Computer Organization and Architecture. x86-64 Stack. x86-64 Stack Pushing
CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: February 28, 2018 at 06:32 Mechanisms in Procedures Passing Control
Assembly Programming IV
Assembly Programming IV CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis 1 Administrivia Homework 2 due
Machine Program: Procedure. Zhaoguo Wang
Machine Program: Procedure Zhaoguo Wang Requirements of procedure calls? P() { y = Q(x); y++; 1. Passing control int Q(int i) { int t, z; return z; Requirements of procedure calls? P() { y = Q(x); y++;
6.1. CS356 Unit 6. x86 Procedures Basic Stack Frames
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
%r8 %r8d. %r9 %r9d. %r10 %r10d. %r11 %r11d. %r12 %r12d. %r13 %r13d. %r14 %r14d %rbp. %r15 %r15d. Sean Barker
Procedure Call Registers Return %rax %eax %r8 %r8d Arg 5 %rbx %ebx %r9 %r9d Arg 6 Arg 4 %rcx %ecx %r10 %r10d Arg 3 %rdx %edx %r11 %r11d Arg 2 %rsi %esi %r12 %r12d Arg 1 %rdi %edi %r13 %r13d ptr %esp %r14
Foundations of Computer Systems
18-600 Foundations of Computer Systems Lecture 6: Machine-Level Programming III: Loops, Procedures, the Stack, and More September 18, 2017 Required Reading Assignment: Chapter 3 of CS:APP (3 rd edition)
Princeton University Computer Science 217: Introduction to Programming Systems. Assembly Language: Function Calls
Princeton University Computer Science 217: Introduction to Programming Systems Assembly Language: Function Calls 1 Goals of this Lecture Help you learn: Function call problems x86-64 solutions Pertinent
Lecture 4: x86_64 Assembly Language
CSCI-GA.1144-001 PAC II Lecture 4: x86_64 Assembly Language Some slides adapted (and slightly modified) from: Randy Bryant Dave O Hallaron Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com
x86-64 Programming III
x86-64 Programming III CSE 351 Summer 2018 Instructor: Justin Hsia Teaching Assistants: Josie Lee Natalie Andreeva Teagan Horkan http://xkcd.com/1652/ Administrivia Homework 2 due Wednesday (7/11) Lab
Binghamton University. CS-220 Spring X86 Debug. Computer Systems Section 3.11
X86 Debug Computer Systems Section 3.11 GDB is a Source Level debugger We have learned how to debug at the C level But the machine is executing X86 object code! How does GDB play the shell game? Makes
C to Assembly SPEED LIMIT LECTURE Performance Engineering of Software Systems. I-Ting Angelina Lee. September 13, 2012
6.172 Performance Engineering of Software Systems SPEED LIMIT PER ORDER OF 6.172 LECTURE 3 C to Assembly I-Ting Angelina Lee September 13, 2012 2012 Charles E. Leiserson and I-Ting Angelina Lee 1 Bugs
Assembly Programming IV
Assembly Programming IV CSE 410 Winter 2017 Instructor: Justin Hsia Teaching Assistants: Kathryn Chan, Kevin Bi, Ryan Wong, Waylon Huang, Xinyu Sui The Data That Turned the World Upside Down The company
Credits and Disclaimers
Credits and Disclaimers 1 The examples and discussion in the following slides have been adapted from a variety of sources, including: Chapter 3 of Computer Systems 3 nd Edition by Bryant and O'Hallaron
Buffer Overflow. An Introduction
Buffer Overflow An Introduction Workshop Flow-1 Revision (4-10) How a program runs Registers Memory Layout of a Process Layout of a StackFrame Layout of stack frame using GDB and looking at Assembly code
Computer Systems C S Cynthia Lee
Computer Systems C S 1 0 7 Cynthia Lee 2 Today s Topics Function call and return in x86-64 Registers Call stack NEXT TIME: NEW topic: the build process Taking a look at each step of the process Preprocessor,
Systems Programming and Computer Architecture ( )
Systems Group Department of Computer Science ETH Zürich Systems Programming and Computer Architecture (252-0061-00) Timothy Roscoe Herbstsemester 2016 AS 2016 Compiling C Control Flow 1 8: Compiling C
CS 107 Lecture 10: Assembly Part I
CS 107 Lecture 10: Assembly Part I Friday, February 9th, 2018 Computer Systems Winter 2018 Stanford University Computer Science Department Reading: Course Reader: x86-64 Assembly Language, Textbook: Chapter
Assembly Language: Function Calls
Assembly Language: Function Calls 1 Goals of this Lecture Help you learn: Function call problems x86-64 solutions Pertinent instructions and conventions 2 Function Call Problems (1) Calling and returning
Buffer Overflow Attack (AskCypert CLaaS)
Buffer Overflow Attack (AskCypert CLaaS) ---------------------- BufferOverflow.c code 1. int main(int arg c, char** argv) 2. { 3. char name[64]; 4. printf( Addr;%p\n, name); 5. strcpy(name, argv[1]); 6.
CSCI 2021: x86-64 Control Flow
CSCI 2021: x86-64 Control Flow Chris Kauffman Last Updated: Mon Mar 11 11:54:06 CDT 2019 1 Logistics Reading Bryant/O Hallaron Ch 3.6: Control Flow Ch 3.7: Procedure calls Goals Jumps and Control flow
Function Calls and Stack
Function Calls and Stack Philipp Koehn 16 April 2018 1 functions Another Example 2 C code with an undefined function int main(void) { int a = 2; int b = do_something(a); urn b; } This can be successfully
CS356: Discussion #15 Review for Final Exam. Marco Paolieri Illustrations from CS:APP3e textbook
CS356: Discussion #15 Review for Final Exam Marco Paolieri (paolieri@usc.edu) Illustrations from CS:APP3e textbook Processor Organization Pipeline: Computing Throughput and Delay n 1 2 3 4 5 6 clock (ps)
CS 261 Fall Machine and Assembly Code. Data Movement and Arithmetic. Mike Lam, Professor
CS 261 Fall 2018 0000000100000f50 55 48 89 e5 48 83 ec 10 48 8d 3d 3b 00 00 00 c7 0000000100000f60 45 fc 00 00 00 00 b0 00 e8 0d 00 00 00 31 c9 89 0000000100000f70 45 f8 89 c8 48 83 c4 10 5d c3 Mike Lam,
Brief Assembly Refresher
Brief Assembly Refresher 1 Changelog 1 Changes made in this version not seen in first lecture: 23 Jan 2018: if-to-assembly if (...) goto needed b < 42 23 Jan 2018: caller/callee-saved: correct comment
Machine/Assembler Language Putting It All Together
COMP 40: Machine Structure and Assembly Language Programming Fall 2015 Machine/Assembler Language Putting It All Together Noah Mendelsohn Tufts University Email: noah@cs.tufts.edu Web: http://www.cs.tufts.edu/~noah
University of Washington
Roadmap C: car *c = malloc(sizeof(car)); c->miles = 100; c->gals = 17; float mpg = get_mpg(c); free(c); Assembly language: Machine code: Computer system: get_mpg: pushq %rbp movq %rsp, %rbp... popq %rbp
CS356: Discussion #8 Buffer-Overflow Attacks. Marco Paolieri
CS356: Discussion #8 Buffer-Overflow Attacks Marco Paolieri (paolieri@usc.edu) Previous Example #include void unreachable() { printf("impossible.\n"); void hello() { char buffer[6]; scanf("%s",
Buffer Overflows Many of the following slides are based on those from Complete Powerpoint Lecture Notes for Computer Systems: A Programmer's Perspective (CS:APP) Randal E. Bryant and David R. O'Hallaron
Areas for growth: I love feedback
Assembly part 2 1 Areas for growth: I love feedback Speed, I will go slower. Clarity. I will take time to explain everything on the slides. Feedback. I give more Kahoot questions and explain each answer.
Changelog. Brief Assembly Refresher. a logistics note. last time
Changelog Brief Assembly Refresher Changes made in this version not seen in first lecture: 23 Jan 2018: if-to-assembly if (...) goto needed b < 42 23 Jan 2018: caller/callee-saved: correct comment about
1 Number Representation(10 points)
Name: Sp15 Midterm Q1 1 Number Representation(10 points) 1 NUMBER REPRESENTATION(10 POINTS) Let x=0xe and y=0x7 be integers stored on a machine with a word size of 4bits. Show your work with the following
CS 107. Lecture 13: Assembly Part III. Friday, November 10, Stack "bottom".. Earlier Frames. Frame for calling function P. Increasing address
CS 107 Stack "bottom" Earlier Frames Lecture 13: Assembly Part III Argument n Friday, November 10, 2017 Computer Systems Increasing address Argument 7 Frame for calling function P Fall 2017 Stanford University
CS356: Discussion #7 Buffer Overflows. Marco Paolieri
CS356: Discussion #7 Buffer Overflows Marco Paolieri (paolieri@usc.edu) Array Bounds class Bounds { public static void main(string[] args) { int[] x = new int[10]; for (int i = 0; i
CS , Fall 2007 Exam 1
Andrew login ID: Full Name: CS 15-213, Fall 2007 Exam 1 Wednesday October 17, 2007 Instructions: Make sure that your exam is not missing any sheets, then write your full name and Andrew login ID on the
Compiling C Programs Into x86-64 Assembly Programs
CSE 2421: Systems I Low-Level Programming and Computer Organization Compiling C Programs Into x86-64 Assembly Programs Part A: Function Calling Read/Study: Bryant 3.7.1-3.7.6 Presentation K Gojko Babić
CSC 252: Computer Organization Spring 2018: Lecture 6
CSC 252: Computer Organization Spring 2018: Lecture 6 Instructor: Yuhao Zhu Department of Computer Science University of Rochester Action Items: Assignment 2 is out Announcement Programming Assignment
1. A student is testing an implementation of a C function; when compiled with gcc, the following x86-64 assembly code is produced:
This assignment refers to concepts discussed in sections 2.1.1 2.1.3, 2.1.8, 2.2.1 2.2.6, 3.2, 3.4, and 3.7.1of csapp; see that material for discussions of x86 assembly language and its relationship to
Lecture 3 CIS 341: COMPILERS
Lecture 3 CIS 341: COMPILERS HW01: Hellocaml! Announcements is due tomorrow tonight at 11:59:59pm. HW02: X86lite Will be available soon look for an announcement on Piazza Pair-programming project Simulator
Do not turn the page until 5:10.
University of Washington Computer Science & Engineering Autumn 2018 Instructor: Justin Hsia 2018-10-29 Last Name: First Name: Student ID Number: Name of person to your Left Right All work is my own. I
18-600: Recitation #4 Exploits
18-600: Recitation #4 Exploits 20th September 2016 Agenda More x86-64 assembly Buffer Overflow Attack Return Oriented Programming Attack 3 Recap: x86-64: Register Conventions Arguments passed in registers:
CSE351 Autumn 2014 Midterm Exam (29 October 2014)
CSE351 Autumn 2014 Midterm Exam (29 October 2014) Please read through the entire examination first! We designed this exam so that it can be completed in 50 minutes and, hopefully, this estimate will prove
Lab 7 Linux Debugging. EECS 448: Software Engineering I Mark Calnon October 17, 2011
Lab 7 Linux Debugging EECS 448: Software Engineering I Mark Calnon October 17, 2011 GDB Getting Started To start gdb from the command line, first browse to the directory containing the core dump to debug
Machine Level Programming: Basics
Machine Level Programming: Basics Computer Systems Organization (Spring 2017) CSCI-UA 201, Section 2 Instructor: Joanna Klukowska Slides adapted from Randal E. Bryant and David R. O Hallaron (CMU) Mohamed
Changelog. Assembly (part 1) logistics note: lab due times. last time: C hodgepodge
Changelog Assembly (part 1) Corrections made in this version not seen in first lecture: 31 August 2017: slide 34: split out from previous slide; clarify zero/positive/negative 31 August 2017: slide 26:
Corrections made in this version not seen in first lecture:
Assembly (part 1) 1 Changelog 1 Corrections made in this version not seen in first lecture: 31 August 2017: slide 34: split out from previous slide; clarify zero/positive/negative 31 August 2017: slide
Machine Language CS 3330 Samira Khan
Machine Language CS 3330 Samira Khan University of Virginia Feb 2, 2017 AGENDA Logistics Review of Abstractions Machine Language 2 Logistics Feedback Not clear Hard to hear Use microphone Good feedback
CS527 Software Security
Reverse Engineering Purdue University, Spring 2018 Basics: encodings Code is data is code is data Learn to read hex numbers: 0x38 == 0011'1000 Python: hex(int('00111000', 2)) Remember common ASCII characters
+ Machine Level Programming: x86-64 History
+ Machine Level Programming: x86-64 History + Intel x86 Processors Dominate laptop/desktop/server market Evolutionary design Backwards compatible up until 8086, introduced in 1978 Added more features as
CSE 351 Midterm - Winter 2015
CSE 351 Midterm - Winter 2015 February 09, 2015 Please read through the entire examination first! We designed this exam so that it can be completed in 50 minutes and, hopefully, this estimate will prove
IA-32 & AMD64. Crash Dump Analysis 2015/2016. CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics.
IA-32 & AMD64 http://d3s.mff.cuni.cz Crash Dump Analysis 2015/2016 CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics IA-32 Overview 32bit CISC architecture Starts with 80386 Also known as
The Compilation Process
Crash Course in C Lecture 2 Moving from Python to C: The compilation process Differences between Python and C Variable declaration and strong typing The memory model: data vs. address The Compilation Process
Chapter 3 Machine-Level Programming I: Basics. Bryant and O Hallaron, Computer Systems: A Programmer s Perspective, Third Edition
Chapter 3 Machine-Level Programming I: Basics 1 Machine Programming I: Basics History of Intel processors and architectures C, assembly, machine code Assembly Basics: Registers, operands, move Arithmetic
Data Representa/ons: IA32 + x86-64
X86-64 Instruc/on Set Architecture Instructor: Sanjeev Se(a 1 Data Representa/ons: IA32 + x86-64 Sizes of C Objects (in Bytes) C Data Type Typical 32- bit Intel IA32 x86-64 unsigned 4 4 4 int 4 4 4 long
Machine Programming 3: Procedures
Machine Programming 3: Procedures CS61, Lecture 5 Prof. Stephen Chong September 15, 2011 Announcements Assignment 2 (Binary bomb) due next week If you haven t yet please create a VM to make sure the infrastructure
C to Machine Code x86 basics: Registers Data movement instructions Memory addressing modes Arithmetic instructions
C to Machine Code x86 basics: Registers Data movement instructions Memory addressing modes Arithmetic instructions Program, Application Software Hardware next few weeks Programming Language Compiler/Interpreter
CSE 351 Midterm - Winter 2017
CSE 351 Midterm - Winter 2017 February 08, 2017 Please read through the entire examination first, and make sure you write your name and NetID on all pages! We designed this exam so that it can be completed
x86 Programming II CSE 351 Winter
x86 Programming II CSE 351 Winter 2017 http://xkcd.com/1652/ Administrivia 2 Address Computation Instruction v leaq src, dst lea stands for load effective address src is address expression (any of the
Credits and Disclaimers
Credits and Disclaimers 1 The eamples and discussion in the following slides have been adapted from a variet of sources, including: Chapter 3 of Computer Sstems 3 nd Edition b Brant and O'Hallaron 86 Assembl/GAS
CSE P 501 Exam Sample Solution 12/1/11
Question 1. (10 points, 5 each) Regular expressions. Give regular expressions that generate the following sets of strings. You may only use the basic operations of concatenation, choice ( ), and repetition
15-213/18-243, Fall 2010 Exam 1 - Version A
Andrew login ID: Full Name: Section: 15-213/18-243, Fall 2010 Exam 1 - Version A Tuesday, September 28, 2010 Instructions: Make sure that your exam is not missing any sheets, then write your Andrew login
Credits and Disclaimers
Credits and Disclaimers 1 The examples and discussion in the following slides have been adapted from a variety of sources, including: Chapter 3 of Computer Systems 3 nd Edition by Bryant and O'Hallaron
CSE351 Spring 2018, Midterm Exam April 27, 2018
CSE351 Spring 2018, Midterm Exam April 27, 2018 Please do not turn the page until 11:30. Last Name: First Name: Student ID Number: Name of person to your left: Name of person to your right: Signature indicating:
CSE 351 Midterm Exam Spring 2016 May 2, 2015
Name: CSE 351 Midterm Exam Spring 2016 May 2, 2015 UWNetID: Solution Please do not turn the page until 11:30. Instructions The exam is closed book, closed notes (no calculators, no mobile phones, no laptops,
CSE 351 Midterm - Winter 2015 Solutions
CSE 351 Midterm - Winter 2015 Solutions February 09, 2015 Please read through the entire examination first! We designed this exam so that it can be completed in 50 minutes and, hopefully, this estimate
Test I Solutions MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Department of Electrical Engineering and Computer Science
Department of Electrical Engineering and Computer cience MAACHUETT INTITUTE OF TECHNOLOGY 6.035 Fall 2017 Test I olutions Mean 83.63 Median 86 td. dev 12.03 1 I Regular Expressions and Finite-tate Automata
18-600: Recitation #4 Exploits (Attack Lab)
18-600: Recitation #4 Exploits (Attack Lab) September 19th, 2017 Announcements Some students have triggered the bomb multiple times Use breakpoints for explode_bomb() Attack lab will be released on Sep.
C and Programming Basics
Announcements Assignment 1 Will be posted on Wednesday, Jan. 9 Due Wednesday, Jan. 16 Piazza Please sign up if you haven t already https://piazza.com/sfu.ca/spring2019/cmpt125 Lecture notes Posted just
Processor state. Information about currently executing program. %rax, %rdi, ... %r14 %r15. %rsp. %rip CF ZF SF OF. Temporary data
Processor state Information about currently executing program Temporary data %rax, %rdi, current parameters, local variables Location of runtime stack %rsp Location of current instruction %rip Status of
Recitation: Attack Lab
15-213 Recitation: Attack Lab TA 11 Feb 2017 Agenda Reminders Stacks Attack Lab Activities Reminders Bomb lab is due tomorrow (14 Feb, 2017)! But if you wait until the last minute, it only takes a minute!
Machine Level Programming: Basics
Machine Level Programming: Basics Computer Systems Organization (Spring 2017) CSCI-UA 201, Section 2 Instructor: Joanna Klukowska Why do we look at machine code? understanding how the high-level programming
How Software Executes
How Software Executes CS-576 Systems Security Instructor: Georgios Portokalidis Overview Introduction Anatomy of a program Basic assembly Anatomy of function calls (and returns) Memory Safety Intel x86
CSE351 Autumn 2014 Midterm Exam (29 October 2014)
CSE351 Autumn 2014 Midterm Exam (29 October 2014) (Version A) Please read through the entire examination first! We designed this exam so that it can be completed in 50 minutes and, hopefully, this estimate
The von Neumann Machine
The von Neumann Machine 1 1945: John von Neumann Wrote a report on the stored program concept, known as the First Draft of a Report on EDVAC also Alan Turing Konrad Zuse Eckert & Mauchly The basic structure
Instruc(on Set Architecture. Computer Architecture Instruc(on Set Architecture Y86. Y86-64 Processor State. Assembly Programmer s View
Instruc(on Set Architecture Computer Architecture Instruc(on Set Architecture Y86 CSCI 2021: Machine Architecture and Organiza(on Pen- Chung Yew Department Computer Science and Engineering University of
Where We Are. Optimizations. Assembly code. generation. Lexical, Syntax, and Semantic Analysis IR Generation. Low-level IR code.
Where We Are Source code if (b == 0) a = b; Low-level IR code Optimized Low-level IR code Assembly code cmp $0,%rcx cmovz %rax,%rdx Lexical, Syntax, and Semantic Analysis IR Generation Optimizations Assembly
CS-220 Spring 2018 Test 2 Version Practice Apr. 23, Name:
CS-220 Spring 2018 Test 2 Version Practice Apr. 23, 2018 Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a) T F : The main difference between
C++ Named Return Value Optimization
C++ Named Return Value Optimization post. Robert.Schneider@hotmail.de meetup.com/c-user-group-karlsruhe auto create() -> T { T castor /* initialize */; //... return castor; } void use() { T pollux = create();
15-213/18-213, Fall 2011 Exam 1
Andrew ID (print clearly!): Full Name: 15-213/18-213, Fall 2011 Exam 1 Tuesday, October 18, 2011 Instructions: Make sure that your exam is not missing any sheets, then write your Andrew ID and full name
Assembly II: Control Flow. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Assembly II: Control Flow Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Processor State (x86-64) RAX 63 31 EAX 0 RBX EBX RCX RDX ECX EDX General-purpose
Functions. Ray Seyfarth. August 4, Bit Intel Assembly Language c 2011 Ray Seyfarth
Functions Ray Seyfarth August 4, 2011 Functions We will write C compatible function C++ can also call C functions using extern "C" {...} It is generally not sensible to write complete assembly programs
Machine-Level Programming I: Basics
Machine-Level Programming I: Basics CSE 238/2038/2138: Systems Programming Instructor: Fatma CORUT ERGİN Slides adapted from Bryant & O Hallaron s slides 1 Today: Machine Programming I: Basics History
University*of*Washington*
Roadmap* C:* car *c = malloc(sizeof(car)); c->miles = 100; c->gals = 17; float mpg = get_mpg(c); free(c); Assembly* language:* Machine* code:* Computer* system:* get_mpg: pushq movq... popq %rbp %rsp,
15-213/18-243, Summer 2011 Exam 1 Tuesday, June 28, 2011
Andrew login ID: Full Name: Section: 15-213/18-243, Summer 2011 Exam 1 Tuesday, June 28, 2011 Instructions: Make sure that your exam is not missing any sheets, then write your Andrew login ID, full name,
CSE 351 Section 4 GDB and x86-64 Assembly Hi there! Welcome back to section, we re happy that you re here
CSE 351 Section 4 GDB and x86-64 Assembly Hi there! Welcome back to section, we re happy that you re here x86-64 Assembly Language Assembly language is a human-readable representation of machine code instructions
Compiling C Programs Into X86-64 Assembly Programs
CSE 2421: Systems I Low-Level Programming and Computer Organization Compiling C Programs Into X86-64 Assembly Programs Part B: If Else, Loops, Recursion & Switch Presentation L Read/Study: Bryant 3.6 Gojko
X86-64: Data Access and Operations
X86-64: Data Access and Operations 1 Instruction Set Architecture (ISA) 2 2015 State of the Art 3 Instruction Set Architecture (ISA) How is data represented? Previous lectures How are programs represented?
x86 Programming I CSE 351 Winter
x86 Programming I CSE 351 Winter 2017 http://xkcd.com/409/ Administrivia Lab 2 released! Da bomb! Go to section! No Luis OH Later this week 2 Roadmap C: car *c = malloc(sizeof(car)); c->miles = 100; c->gals
x86-64 Programming III & The Stack
x86-64 Programming III & The Stack CSE 351 Winter 2018 Instructor: Mark Wyse Teaching Assistants: Kevin Bi Parker DeWilde Emily Furst Sarah House Waylon Huang Vinny Palaniappan http://xkcd.com/1652/ Administrative
Assembly II: Control Flow
Assembly II: Control Flow Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu SSE2030: Introduction to Computer Systems, Spring 2018, Jinkyu Jeong (jinkyu@skku.edu)