CS 3330 Introduction 1
|
|
|
- Giles Hodge
- 5 years ago
- Views:
Transcription
1 CS 3330 Introduction 1
2 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
3 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
4 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
5 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
6 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
7 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
8 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
9 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
10 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
11 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
12 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
13 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
14 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
15 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
16 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
17 layers of abstraction 3 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
18 why C? 4 almost a subset of C++ notably removes classes, new/delete, iostreams other changes, too, so C code often not valid C++ code direct correspondence to assembly
19 why C? 4 almost a subset of C++ notably removes classes, new/delete, iostreams other changes, too, so C code often not valid C++ code direct correspondence to assembly Should help you understand machine! Manual translation to assembly
20 why C? 4 almost a subset of C++ notably removes classes, new/delete, iostreams other changes, too, so C code often not valid C++ code direct correspondence to assembly But clever (optimizing) compiler might be confusingly indirect instead
21 homework: C environment 5 get Unix environment with a C compiler options: lab accounts + SSH Linux (native or VM) 2150 VM image should work online IDE (e.g. Cloud9, Koding)
22 assignment compatibility 6 supported platform: lab machines many use laptops trouble? we ll say to use lab machines most assignments: C and Unix-like environment also: tool written in Rust but we ll provide binaries previously written in D + needed D compiler
23 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
24 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
25 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
26 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
27 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
28 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
29 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
30 layers of abstraction 7 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
31 X86-64 assembly 8 in theory, you know this (CS 2150) in reality,
32 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
33 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
34 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
35 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
36 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
37 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
38 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
39 layers of abstraction 9 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
40 Y86-64?? 10 Y86: our textbook s X86-64 subset much simpler than real X86-64 encoding (which we will not cover) not as simple as 2150 s IBCM variable-length encoding mostly full register set full conditional jumps stack-manipulation instructions
41 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
42 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
43 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
44 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
45 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
46 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
47 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
48 layers of abstraction 11 x += y Higher-level language: C add %rbx, %rax! SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
49 goals/other topics 12 understand how hardware works for program performance what compilers are/do weird program behaviors (segfaults, etc.)
50 goals/other topics 13 understand how hardware works for program performance what compilers are/do weird program behaviors (segfaults, etc.)
51 program performance 14 naive model: one instruction = one time unit number of instructions matters, but
52 program performance: issues 15 parallelism fast hardware is parallel needs multiple things to do caching accessing things recently accessed is faster need reuse of data/code (more in other classes: algorithmic efficiency)
53 goals/other topics 16 understand how hardware works for program performance what compilers are/do weird program behaviors (segfaults, etc.)
54 what compilers are/do 17 understanding weird compiler/linker rrors if you want to make compilers debugging applications
55 goals/other topics 18 understand how hardware works for program performance what compilers are/do weird program behaviors (segfaults, etc.)
56 weird program behaviors 19 what is a segmentation fault really? how does the operating system interact with programs? if you want to handle them writing OSs
57 interlude: powers of two K (or Ki) M (or Mi) G (or Gi)
58 powers of two: forward
59 powers of two: forward = = 32G (30 = G)
60 powers of two: forward = = 32G (30 = G)
61 powers of two: forward = = 32G (30 = G) 2 21 = = 2M (20 = M)
62 powers of two: forward = = 32G (30 = G) 2 21 = = 2M (20 = M) 2 9 =
63 powers of two: forward = = 32G (30 = G) 2 21 = = 2M (20 = M) 2 9 = = = 16K
64 powers of two: backward 22 16G 128K 4M 256T
65 powers of two: backward 22 16G = = = K 4M 256T
66 powers of two: backward 22 16G = = = K = = = M 256T
67 powers of two: backward 22 16G = = = K = = = M = = = T = = = 2 48
68 processors and memory processor memory Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
69 processors and memory memory bus send address + send or get data processor memory Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
70 processors and memory I/O Bridge processor memory to I/O devices keyboard, mouse, wifi, Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
71 processors and memory system bus send address + send or get data (machinei/o code/text/number ) Bridge processor memory to I/O devices keyboard, mouse, wifi, Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
72 processors and memory CPU: send PC: 0x04000 I/O Bridge processor memory MEM: send machine code: pushq %rbp to I/O devices keyboard, mouse, wifi, Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
73 processors and memory CPU: send PC: 0x04000 CPU: next I/OPC: 0x04001 Bridge processor memory MEM: send machine code: pushq %rbp to I/O devices keyboard, mouse, wifi, Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
74 processors and memory CPU: send I/O request address: 0xf I/O Bridge processor I/O: send keystoke: memory a to I/O devices keyboard, mouse, wifi, Images: Single core Opteron 8xx die: Dg2fer at the German language Wikipedia, via Wikimedia Commons SDRAM by Arnaud 25, via Wikimedia Commons 23
75 memory address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 0x xA0 24
76 memory address 0xFFFFFFFF 0xFFFFFFFE 0xFFFFFFFD 0x x x x x x x x00041FFF 0x00041FFE 0x x x value 0x14 0x45 0xDE 0x06 0x05 0x04 0x03 0x02 0x01 0x00 0x03 0x60 0xFE 0xE0 0xA0 array of bytes (byte = 8 bits) CPU interprets based on how accessed 24
77 memory address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 0x xA0 address value 0x xA0 0x xE0 0x xFE 0x00041FFE 0x60 0x00041FFF 0x03 0x x00 0x x01 0x x02 0x x03 0x x04 0x x05 0x x06 0xFFFFFFFD 0xDE 0xFFFFFFFE 0x45 0xFFFFFFFF 0x14 24
78 endianness address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 int *x = (int*)0x42000; cout << *x << endl; 25
79 endianness address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 int *x = (int*)0x42000; cout << *x << endl; 25
80 endianness address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 int *x = (int*)0x42000; cout << *x << endl; 0x = x =
81 endianness address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 int *x = (int*)0x42000; cout << *x << endl; 0x = little endian (least significant byte has lowest address) 0x = big endian (most significant byte has lowest address) 25
82 endianness address value 0xFFFFFFFF 0x14 0xFFFFFFFE 0x45 0xFFFFFFFD 0xDE 0x x06 0x x05 0x x04 0x x03 0x x02 0x x01 0x x00 0x00041FFF 0x03 0x00041FFE 0x60 0x xFE 0x xE0 int *x = (int*)0x42000; cout << *x << endl; 0x = little endian (least significant byte has lowest address) 0x = big endian (most significant byte has lowest address) 25
83 program memory (x86-64 Linux) 26 Used by OS 0xFFFF FFFF FFFF FFFF 0xFFFF Stack 0x7F Heap / other dynamic Writable data Code + Constants 0x
84 program memory (x86-64 Linux) 26 Used by OS 0xFFFF FFFF FFFF FFFF 0xFFFF Stack Heap / other dynamic Writable data Code + Constants 0x7F stack grows down top has smallest address 0x
85 program memory (x86-64 Linux) 26 Used by OS Stack Heap / other dynamic Writable data Code + Constants 0xFFFF FFFF FFFF FFFF 0xFFFF x7F argument 6 argument 7 return address callee saved registers local variables (next thing on stack) 0x
86 program memory (x86-64 Linux) 26 Used by OS 0xFFFF FFFF FFFF FFFF 0xFFFF Stack 0x7F Heap / other dynamic Writable data Code + Constants 0x
87 compilation pipeline 27 main.c (C code) compile main.s (assembly) assemble main.o (object file) (machine code) linking main.exe (executable) (machine code)
88 compilation pipeline 27 main.c (C code) compile main.c: #include <stdio.h> int main(void) { printf("hello, World!\n"); } main.s (assembly) assemble main.o (object file) (machine code) linking main.exe (executable) (machine code)
89 compilation pipeline 27 main.c (C code) compile main.c: #include <stdio.h> int main(void) { printf("hello, World!\n"); } main.s (assembly) printf.o (object file) assemble main.o (object file) (machine code) linking main.exe (executable) (machine code)
90 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
91 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
92 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
93 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
94 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
95 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
96 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
97 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
98 what s in those files? hello.c #include <stdio.h> int main(void) { puts("hello, World!"); return 0; } hello.o text (code) segment: EC 08 BF E C C4 08 C3 data segment: C 6C 6F 2C F 72 6C 00 relocations: take 0s at and replace with text, byte 6 ( ) data segment, byte 0 text, byte 10 ( ) address of puts symbol table: main text byte 0 hello.s.text main: sub $8, %rsp mov $.Lstr, %rdi call puts xor %eax, %eax add $8, %rsp ret.data.lstr:.string "Hello, World!" + stdio.o hello.exe (actually binary, but shown as hexadecimal) EC 08 BF A E8 08 4A C C4 08 C3 (code from stdio.o) C 6C 6F 2C F 72 6C 00 (data from stdio.o) 28
99 hello.s 29.LC0: main:.section.string "Hello, World!".text.globl main subq movl call movl addq ret $8, %rsp $.LC0, %edi puts $0, %eax $8,
100 lecturers 30 Samira and I will be splitting lectures same(ish) lecutre in each section
101 coursework 31 quizzes pre/post week of lecture you will need to read labs grading: did you make reasonable progress? collaboration permitted homework assignments introduced by lab (mostly) due at noon on the next lab day (mostly) complete individually exams multiple choice/short answer 2 + final
102 on lecture/lab/hw synchronization 32 labs/hws not quite synchronized with lectures main problem: want to cover material before you need it in lab/hw
103 quizzes? linked off course website (demo) pre-quiz, on reading released by Saturday evening, due Tuesdays, 12:15 PM post-quiz, on lecture topics released Thursday evening, due following Saturday, 11:59PM each quiz 90 minute time limit (+ adjustments if SDAC says) lowest 10% (approx. 2 quizzes) will be dropped first quiz Thursday short mainly to get you used to it 33
104 attendance? 34 lecture: strongly recommended but not required. lectures are recorded to help you review lab: electronic, remote-possible submission, usually. one exception.
105 late policy 35 exceptional circumstance? contact us. otherwise, for homeworks only: -10% 0 to 48 hours late -15% 48 to 72 hours late -100% otherwise late quizzes, labs: no we release answers talk to us if illness, etc.
106 TAs/Office Hours 36 office hours will be posted on calendar on the website should be plenty use them
107 your TODO list 37 Quizzes! post-quiz after Thursday lecture pre-quiz before Tuesday lecture lab account and/or C environment working lab accounts should happen by this weekend before lab next week
108 grading 38 Quizzes: 10% (10% dropped) Midterms (2): 30% Final Exam (cumulative): 20% Homework + Labs: 40%
109 39
CS 3330 Introduction. Daniel and Charles. CS 3330 Computer Architecture 1
CS 3330 Introduction Daniel and Charles CS 3330 Computer Architecture 1 lecturers Charles and I will be splitting lectures same(ish) lecture in each section Grading Take Home Quizzes: 10% (10% dropped)
last time Exam Review on the homework on office hour locations hardware description language programming language that compiles to circuits
last time Exam Review hardware description language programming language that compiles to circuits stages as conceptual division not the order things happen easier to figure out wiring stage-by-stage?
layers of abstraction
Exam Review 1 layers of abstraction 2 x += y Higher-level language: C add %rbx, %rax 60 03 SIXTEEN Assembly: X86-64 Machine code: Y86 Hardware Design Language: HCLRS Gates / Transistors / Wires / Registers
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
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
Layers of Abstraction CS 3330: C. Compilation Steps. What s in those files? Higher-level language: C. Assembly: X86-64.
Layers of Abstraction CS 3330: C 25 August 2016 x += y add %rbx, %rax 60 03 Higher-level language: C Assembly: X86-64 Machine code: Y86 (we ll talk later) Logic and Registers 1 2 Compilation Steps compile:
Layers of Abstraction. CS 3330: More C. printf. Last time
Layers of Abstraction CS 3330: More C 30 August 2016 x += y add %rbx, %rax 60 03 Higher-level language: C Assembly: X86-64 Machine code: Y86 (we ll talk later) Logic and Registers 1 2 Last time printf
Layers of Abstraction
More C 1 Layers of Abstraction 2 x += y Higher-level language: C add %rbx, %rax 60 03 Assembly: X86-64 Machine code: Y86 (we ll talk later) Logic and Registers selected anonymous feedback (1) 3 If I finish
last time more C / assembly intro anonymous feedback (2) anonymous feedback (1)
last time more C / assembly intro program memory layout stack versus heap versus code/globals at fixed locations (by convention only) compile/assemble/link object file machine code + data (from assembly)
Chris Riesbeck, Fall Introduction to Computer Systems
Chris Riesbeck, Fall 2011 Introduction to Computer Systems Welcome to Intro. to Computer Systems Everything you need to know http://www.cs.northwestern.edu/academics/courses/213/ Instructor: Chris Riesbeck
Introduction to Computer Systems
CS-213 Introduction to Computer Systems Yan Chen Topics: Staff, text, and policies Lecture topics and assignments Lab rationale CS 213 F 06 Teaching staff Instructor TA Prof. Yan Chen (Thu 2-4pm, Tech
Introduction to Computer Systems
Introduction to Computer Systems Today: Welcome to EECS 213 Lecture topics and assignments Next time: Bits & bytes and some Boolean algebra Fabián E. Bustamante, Spring 2010 Welcome to Intro. to Computer
selected anonymous feedback: VM
Exam Review 1 selected anonymous feedback: VM 2 too few concrete examples of translation in lecture students were poorly prepared for memory HW holy hell, dont be giving us this memory hw and not give
selected anonymous feedback: VM Exam Review final format/content logistics
selected anonymous feedback: VM Exam Review too few concrete examples of translation in lecture students were poorly prepared for memory HW holy hell, dont be giving us this memory hw and not give us the
Introduction to Computer Systems
Introduction to Computer Systems Today:! Welcome to EECS 213! Lecture topics and assignments Next time:! Bits & bytes! and some Boolean algebra Fabián E. Bustamante, 2007 Welcome to Intro. to Computer
Introduction Presentation A
CSE 2421/5042: Systems I Low-Level Programming and Computer Organization Introduction Presentation A Read carefully: Bryant Chapter 1 Study: Reek Chapter 2 Skim: Reek Chapter 1 08/22/2018 Gojko Babić Some
Memory, Data, & Addressing I
Memory, Data, & Addressing I 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/953/
an infinite loop Processes and Exceptions doing nothing on a busy system timing nothing
an infinite loop Processes and Exceptions int main(void) { while (1) { /* waste CPU time */ If I run this on a lab machine, can you still use it? even if the machine only has one core? 1 2 timing nothing
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
Representation of Information
Representation of Information CS61, Lecture 2 Prof. Stephen Chong September 6, 2011 Announcements Assignment 1 released Posted on http://cs61.seas.harvard.edu/ Due one week from today, Tuesday 13 Sept
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
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 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++;
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
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/
Instruction Set Architectures
Instruction Set Architectures! ISAs! Brief history of processors and architectures! C, assembly, machine code! Assembly basics: registers, operands, move instructions 1 What should the HW/SW interface
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
Few reminders and demos
15-123 Effective Programming in C and Unix Learning Objectives At the end of this lecture, you should be able to Understand how data is represented Understand how integers are represented Understand how
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,
CSE351: Memory, Data, & Addressing I
CSE351: Memory, Data, & Addressing I CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis http://xkcd.com/138/
Changelog. Performance (finish) / Exceptions. other vector instructions. alternate vector interfaces
Changelog Performance (finish) / Exceptions Changes made in this version not seen in first lecture: 9 November 2017: an infinite loop: correct infinite loop code 9 November 2017: move sync versus async
Handling of Interrupts & Exceptions
CSE 2421: Systems I Low-Level Programming and Computer Organization Handling of Interrupts & Exceptions Read/Study: Bryant 8.1 11-30-2018 Presentation O Gojko Babić Computer Architecture (repeat) A modern
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
C++ to assembly to machine code
IBCM 1 C++ to assembly to machine code hello.cpp #include int main() { std::cout
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
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
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
Roadmap. Java: Assembly language: OS: Machine code: Computer system:
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 ret %rbp %rsp, %rbp
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!
Lecture 4 CIS 341: COMPILERS
Lecture 4 CIS 341: COMPILERS CIS 341 Announcements HW2: X86lite Available on the course web pages. Due: Weds. Feb. 7 th at midnight Pair-programming project Zdancewic CIS 341: Compilers 2 X86 Schematic
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",
CS 3330 Exam 1 Fall 2017 Computing ID:
S 3330 Fall 2017 xam 1 Variant page 1 of 8 mail I: S 3330 xam 1 Fall 2017 Name: omputing I: Letters go in the boxes unless otherwise specified (e.g., for 8 write not 8 ). Write Letters clearly: if we are
CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2018 Lecture 4
CS24: INTRODUCTION TO COMPUTING SYSTEMS Spring 2018 Lecture 4 LAST TIME Enhanced our processor design in several ways Added branching support Allows programs where work is proportional to the input values
Course Information and Introduction
August 22, 2017 Course Information 1 Instructors : Email : arash.rafiey@indstate.edu Office : Root Hall A-127 Office Hours : Tuesdays 11:30 pm 12:30 pm. Root Hall, A127. 2 Course Home Page : http://cs.indstate.edu/~arash/cs256.html
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
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 Programming
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
Intel x86-64 and Y86-64 Instruction Set Architecture
CSE 2421: Systems I Low-Level Programming and Computer Organization Intel x86-64 and Y86-64 Instruction Set Architecture Presentation J Read/Study: Bryant 3.1 3.5, 4.1 Gojko Babić 03-07-2018 Intel x86
Changelog. Changes made in this version not seen in first lecture: 12 September 2017: slide 28, 33: quote solution that uses z correctly
1 Changelog 1 Changes made in this version not seen in first lecture: 12 September 2017: slide 28, 33: quote solution that uses z correctly last time 2 Y86 choices, encoding and decoding shift operators
CS241 Computer Organization Spring Introduction to Assembly
CS241 Computer Organization Spring 2015 Introduction to Assembly 2-05 2015 Outline! Rounding floats: round-to-even! Introduction to Assembly (IA32) move instruction (mov) memory address computation arithmetic
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
Programming with Arrays Intro to Pointers CS 16: Solving Problems with Computers I Lecture #11
Programming with Arrays Intro to Pointers CS 16: Solving Problems with Computers I Lecture #11 Ziad Matni Dept. of Computer Science, UCSB Thursday, 5/17 in this classroom Starts at 2:00 PM **SHARP** Please
EE251: Thursday November 15
EE251: Thursday November 15 Major new topic: MEMORY A KEY topic HW #7 due today; HW #8 due Thursday, Nov. 29 Lab #8 finishes this week; due week of Nov. 26 All labs MUST be completed/handed-in by Dec.
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
CS 33. Linkers. CS33 Intro to Computer Systems XXV 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.
CS 33 Linkers CS33 Intro to Computer Systems XXV 1 Copyright 2017 Thomas W. Doeppner. All rights reserved. gcc Steps 1) Compile to start here, supply.c file to stop here: gcc -S (produces.s file) if not
CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2017 Lecture 12
CS24: INTRODUCTION TO COMPUTING SYSTEMS Spring 2017 Lecture 12 CS24 MIDTERM Midterm format: 6 hour overall time limit, multiple sittings (If you are focused on midterm, clock should be running.) Open book
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
(0) introduction to the course. how to learn a programming language. (0) course structure
topics: (0) introduction to the course (1) what is a computer? instructor: cis1.5 introduction to computing using c++ (robotics applications) spring 2008 lecture # I.1 introduction Prof Azhar, mqazhar@sci.brooklyn.cuny.edu
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
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
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:
(the bubble footer is automatically inserted into this space)
CS 2150 Exam 2, fall 2016 Page 1 of 6 UVa userid: CS 2150 Exam 2, fall 2016 Name You MUST write your e-mail ID on EACH page and bubble in your userid at the bottom of this first page. And put your name
Introduction to Machine/Assembler Language
COMP 40: Machine Structure and Assembly Language Programming Fall 2017 Introduction to Machine/Assembler Language Noah Mendelsohn Tufts University Email: noah@cs.tufts.edu Web: http://www.cs.tufts.edu/~noah
Changelog. Virtual Memory (2) exercise: 64-bit system. exercise: 64-bit system
Changelog Virtual Memory (2) Changes made in this version not seen in first lecture: 21 November 2017: 1-level example: added final answer of memory value, not just location 21 November 2017: two-level
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
CS 3330 Exam 3 Fall 2017 Computing ID:
S 3330 Fall 2017 Exam 3 Variant E page 1 of 16 Email I: S 3330 Exam 3 Fall 2017 Name: omputing I: Letters go in the boxes unless otherwise specified (e.g., for 8 write not 8 ). Write Letters clearly: if
CS 2150 Exam 2, Spring 2018 Page 1 of 6 UVa userid:
CS 2150 Exam 2, Spring 2018 Page 1 of 6 UVa userid: CS 2150 Exam 2 Name You MUST write your e-mail ID on EACH page and put your name on the top of this page, too. If you are still writing when pens down
CSC 252: Computer Organization Spring 2018: Lecture 5
CSC 252: Computer Organization Spring 2018: Lecture 5 Instructor: Yuhao Zhu Department of Computer Science University of Rochester Action Items: Assignment 1 is due tomorrow, midnight Assignment 2 is out
CS 241 Data Organization. August 21, 2018
CS 241 Data Organization August 21, 2018 Contact Info Instructor: Dr. Marie Vasek Contact: Private message me on the course Piazza page. Office: Room 2120 of Farris Web site: www.cs.unm.edu/~vasek/cs241/
Hardware: Logical View
Hardware: Logical View CPU Memory Bus Disks Net USB Etc. 1 Hardware: Physical View USB I/O controller Storage connections CPU Memory 2 Hardware: 351 View (version 0) instructions? Memory CPU data CPU executes
x86 64 Programming I CSE 351 Autumn 2018 Instructor: Justin Hsia
x86 64 Programming I CSE 351 Autumn 2018 Instructor: Justin Hsia Teaching Assistants: Akshat Aggarwal An Wang Andrew Hu Brian Dai Britt Henderson James Shin Kevin Bi Kory Watson Riley Germundson Sophie
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 211 Programming I for Engineers
CS 211 Programming I for Engineers Instructor: Tom Bartenstein Course Web Page: http://www.cs.binghamton.edu/~tbartens/cs211_fall_2018/ 1 Catalog Description Introduction to computer programming with engineering
Virtual Memory. 11/8/16 (election day) Vote!
Virtual Memory 11/8/16 (election day) Vote! Recall: the job of the OS The OS is an interface layer between a user s programs and hardware. Program Operating System Computer Hardware It provides an abstract
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. 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
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
last time SIMD (single instruction multiple data) hardware idea: wider ALUs and registers Intel s interface _mm
1 last time 2 SIMD (single instruction multiple data) hardware idea: wider ALUs and registers Intel s interface _mm sharing the CPU: context switching context = visible CPU state (registers, condition
CPSC 213. Introduction to Computer Systems. Numbers and Memory. Unit 1a
CPSC 213 Introduction to Computer Systems Unit 1a Numbers and Memory 1 The Big Picture Build machine model of execution for Java and C programs by examining language features and deciding how they are
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
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
x86 assembly CS449 Fall 2017
x86 assembly CS449 Fall 2017 x86 is a CISC CISC (Complex Instruction Set Computer) e.g. x86 Hundreds of (complex) instructions Only a handful of registers RISC (Reduced Instruction Set Computer) e.g. MIPS
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
Instructions and Instruction Set Architecture
Chapter 2 Instructions and Instruction Set Architecture In this lecture, we study computer instructions and instruction set architecture by using assembly language programming. We will study x86-64 architecture
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
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
bitwise (finish) / SEQ part 1
bitwise (finish) / SEQ part 1 1 Changelog 1 Changes made in this version not seen in first lecture: 14 September 2017: slide 16-17: the x86 arithmetic shift instruction is sar, not sra last time 2 bitwise
What is concurrency? Concurrency. What is parallelism? concurrency vs parallelism. Concurrency: (the illusion of) happening at the same time.
What is concurrency? Concurrency Johan Montelius KTH 2017 Concurrency: (the illusion of) happening at the same time. A property of the programing model. Why would we want to do things concurrently? What
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
Assembly I: Basic Operations. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Assembly I: Basic Operations Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Basic Execution Environment RAX RBX RCX RDX RSI RDI RBP RSP R8 R9 R10
ECE2049 E17 Lecture 4 MSP430 Architecture & Intro to Digital I/O
ECE2049-E17 Lecture 4 1 ECE2049 E17 Lecture 4 MSP430 Architecture & Intro to Digital I/O Administrivia Homework 1: Due today by 7pm o Either place in box in ECE office or give to me o Office hours tonight!
Changelog. Changes made in this version not seen in first lecture: 13 Feb 2018: add slide on constants and width
HCL 1 Changelog 1 Changes made in this version not seen in first lecture: 13 Feb 2018: add slide on constants and width simple ISA 4: mov-to-register 2 irmovq $constant, %ryy rrmovq %rxx, %ryy mrmovq 10(%rXX),
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*
CS241 Computer Organization Spring 2015 IA
CS241 Computer Organization Spring 2015 IA-32 2-10 2015 Outline! Review HW#3 and Quiz#1! More on Assembly (IA32) move instruction (mov) memory address computation arithmetic & logic instructions (add,
x86 Programming I CSE 351 Autumn 2016 Instructor: Justin Hsia
x86 Programming I CSE 351 Autumn 2016 Instructor: Justin Hsia Teaching Assistants: Chris Ma Hunter Zahn John Kaltenbach Kevin Bi Sachin Mehta Suraj Bhat Thomas Neuman Waylon Huang Xi Liu Yufang Sun http://xkcd.com/409/
CS 31: Intro to Systems Virtual Memory. Kevin Webb Swarthmore College November 15, 2018
CS 31: Intro to Systems Virtual Memory Kevin Webb Swarthmore College November 15, 2018 Reading Quiz Memory Abstraction goal: make every process think it has the same memory layout. MUCH simpler for compiler
CSCI 192 Engineering Programming 2. Subject Overview
CSCI 192 Engineering Programming 2 Week 1 Subject Overview Lecturer: Dr. Markus Hagenbuchner Slides by: Igor Kharitonenko and Markus Hagenbuchner Room 3.220 markus@uow.edu.au UOW 2010 27/07/2010 1 Lecture
CS 31: Intro to Systems Functions and the Stack. Martin Gagne Swarthmore College February 23, 2016
CS 31: Intro to Systems Functions and the Stack Martin Gagne Swarthmore College February 23, 2016 Reminders Late policy: you do not have to send me an email to inform me of a late submission before the
Introduction to Computer Systems
Introduction to Computer Systems Syllabus Web Page http://www.cs.northwestern.edu/~pdinda/icsclass Instructor Peter A. Dinda 1890 Maple Avenue, Room 338 847-467-7859 pdinda@cs.northwestern.edu Office hours: