Course overview. Computer Organization and Assembly Languages Yung-Yu Chuang 2007/09/17. with slides by Kip Irvine

Transcription

1 Course overview Computer Organization and Assembly Languages Yung-Yu Chuang 2007/09/17 with slides by Kip Irvine

2 Logistics Meeting time: 2:20pm-5:20pm, Monday Classroom: CSIE Room 102 Instructor: Yung-Yu Chuang Teaching assistants: 李根逸 / 謝昌晏 Webpage: id / password Forum: Mailing list: assembly@cmlab.csie.ntu.edu.tw Please subscribe via

3 Logistics When to take a break? One break or two? Next week, the class is on Saturday (9/29).

4 Prerequisites Programming experience with some high-level language such C, C ++,Java

5 Textbook Assembly Language for Intel-Based Computers, 5th Edition, Kip Irvine

6 References Computer Systems: A Programmer's Perspective, Randal E. Bryant and David R. O'Hallaron The Art of Assembly Language, Randy Hyde Michael Abrash' s Graphics Programming Black Book

7 References Princeton s Introduction to CS, cs/50machine/ cs/60circuits/ ARM Assembly Language Programming, Peter Knaggs and Stephen Welsh

8 Grading (subject to change) Assignments (50%) Class participation (5%) Midterm exam (20%) Final project (25%)

9 Computer Organization and Assembly language It is not only about assembly. I hope to cover Basic concept of computer systems and architecture x86 assembly language ARM assembly language

10 TOY machine

11 TOY machine Starting from a simple construct

12 TOY machine Build several components and connect them together

13 TOY machine Almost as good as any computers

14 TOY machine int A[32]; A DUP 32 10: C020 i=0; Do { RD=stdin; if (RD==0) break; A[i]=RD; i=i+1; } while (1); lda R1, 1 lda RA, A lda RC, 0 read ld RD, 0xFF bz RD, exit add R2, RA, RC sti RD, R2 add RC, RC, R1 bz R0, read 20: : 7A00 22: 7C00 23: 8DFF 24: CD29 25: 12AC 26: BD02 27: 1CC1 28: C023 printr(); exit jl RF, printr hlt 29: FF2B 2A: 0000

15 Syllabus (topics we might cover) IA-32 Processor Architecture Assembly Language Fundamentals Data Transfers, Addressing, and Arithmetic Procedures Conditional Processing Integer Arithmetic Advanced Procedures Strings and Arrays Structures and Macros High-Level Language Interface Real Arithmetic (FPU) SIMD Code Optimization

16 What you will learn Basic principle of computer architecture ARM assembly programming IA-32 modes and memory management Assembly basics How high-level language is translated to assembly Specific components, FPU/MMX Code optimization Interface between assembly to high-level language

17 Early computers

18 Early programming tools

19 First popular PCs

20 Early PCs Intel 8086 processor 768KB memory 20MB disk Dot-Matrix printer (9-pin)

21 GUI/IDE

22 More advanced architectures Pipeline SIMD Multi-core Cache

23 More advanced software

24 More computers around us

25 Why taking this course? It is required. It is foundation for computer architecture and compilers. It is related to electronics, logic design and Operating system. At times, you do need to write assembly code. I really don t think that you can write a book for serious computer programmers unless you are able to discuss low-level details. Donald Knuth

26 Reasons for not using assembly Development time: it takes much longer to develop in assembly. Harder to debug, no type checking, side effects Maintainability: unstructured, dirty tricks Portability: platform-dependent

27 Reasons for using assembly Educational reasons: to understand how CPUs and compilers work. Better understanding to efficiency issues of various constructs. Developing compilers, debuggers and other development tools. Hardware drivers and system code Embedded systems Developing libraries. Accessing instructions that are not available through high-level languages. Optimizing for speed or space

28 To sum up It is all about lack of smart compilers Faster code, compiler is not good enough Smaller code, compiler is not good enough, e.g. mobile devices, embedded devices, also Smaller code better cache performance faster code Unusual architecture, there isn t even a compiler or compiler quality is bad, eg GPU, DSP chips, even MMX.

29 Chapter.1 Overview Virtual Machine Concept Data Representation Boolean Operations

30 Translating Languages English: Display the sum of A times B plus C. C++: cout << (A * B + C); Assembly Language: mov eax,a mul B add eax,c call WriteInt Intel Machine Language: A F E

31 Virtual machines Abstractions for computers High-Level Language Level 5 Assembly Language Level 4 Operating System Instruction Set Architecture Level 3 Level 2 Microarchitecture Level 1 Digital Logic Level 0

32 High-Level Language Level 5 Application-oriented languages Programs compile into assembly language (Level 4) cout << (A * B + C);

33 Assembly Language Level 4 Instruction mnemonics that have a one-to-one correspondence to machine language Calls functions written at the operating system level (Level 3) Programs are translated into machine language (Level 2) mov eax, A mul B add eax, C call WriteInt

34 Operating System Level 3 Provides services Programs translated and run at the instruction set architecture level (Level 2)

35 Instruction Set Architecture Level 2 Also known as conventional machine language Executed by Level 1 program (microarchitecture, Level 1) A F E

36 Microarchitecture Level 1 Interprets conventional machine instructions (Level 2) Executed by digital hardware (Level 0)

37 Digital Logic Level 0 CPU, constructed from digital logic gates System bus Memory

38 Data representation Computer is a construction of digital circuits with two states: on and off You need to have the ability to translate between different representations to examine the content of the machine Common number systems: binary, octal, decimal and hexadecimal

39 Binary Representations Electronic Implementation Easy to store with bistable elements Reliably transmitted on noisy and inaccurate wires 3.3V 2.8V V 0.0V

40 Binary numbers Digits are 1 and 0 (a binary digit is called a bit) 1 = true 0 = false MSB most significant bit LSB least significant bit Bit numbering: MSB LSB A bit string could have different interpretations

41 Unsigned binary integers Each digit (bit) is either 1 or 0 Each bit represents a power of 2: Every binary number is a sum of powers of 2

42 Translating Binary to Decimal Weighted positional notation shows how to calculate the decimal value of each binary bit: dec = (D n-1 2 n-1 ) + (D n-2 2 n-2 ) (D ) + (D ) D = binary digit binary = decimal 9: (1 2 3 ) + (1 2 0 ) = 9

43 Translating Unsigned Decimal to Binary Repeatedly divide the decimal integer by 2. Each remainder is a binary digit in the translated value: 37 =

44 Binary addition Starting with the LSB, add each pair of digits, include the carry if present. carry: (4) (7) (11) bit position:

45 Integer storage sizes Standard sizes: byte word doubleword quadword 64 Practice: What is the largest unsigned integer that may be stored in 20 bits?

46 Large measurements Kilobyte(KB),2 10 bytes Megabyte (MB), 2 20 bytes Gigabyte (GB), 2 30 bytes Terabyte (TB), 2 40 bytes Petabyte Exabyte Zettabyte Yottabyte

47 Hexadecimal integers All values in memory are stored in binary. Because long binary numbers are hard to read, we use hexadecimal representation.

48 Translating binary to hexadecimal Each hexadecimal digit corresponds to 4 binary bits. Example: Translate the binary integer to hexadecimal:

49 Converting hexadecimal to decimal Multiply each digit by its corresponding power of 16: dec = (D ) + (D ) + (D ) + (D ) Hex 1234 equals ( ) + ( ) + ( ) + ( ), or decimal 4,660. Hex 3BA4 equals ( ) + (11 * 16 2 ) + ( ) + ( ), or decimal 15,268.

50 Powers of 16 Used when calculating hexadecimal values up to 8 digits long:

51 Converting decimal to hexadecimal decimal 422 = 1A6 hexadecimal

52 Hexadecimal addition Divide the sum of two digits by the number base (16). The quotient becomes the carry value, and the remainder is the sum digit A B 78 6D 80 B5 Important skill: Programmers frequently add and subtract the addresses of variables and instructions.

53 Hexadecimal subtraction When a borrow is required from the digit to the left, add 10h to the current digit's value: 1 C6 75 A E Practice: The address of var1 is The address of the next variable after var1 is A. How many bytes are used by var1?

54 Signed integers The highest bit indicates the sign. 1 = negative, 0 = positive sign bit Negative Positive If the highest digit of a hexadecmal integer is > 7, the value is negative. Examples: 8A, C5, A2, 9D

55 Two's complement notation Steps: Complement (reverse) each bit Add 1 Note that =

56 Binary subtraction When subtracting A B, convert B to its two's complement Add A to ( B) Advantages for 2 s complement: No two 0 s Sign bit Remove the need for separate circuits for add and sub

57 Ranges of signed integers The highest bit is reserved for the sign. This limits the range:

58 Character Character sets Standard ASCII(0 127) Extended ASCII (0 255) ANSI (0 255) Unicode (0 65,535) Null-terminated String Array of characters followed by a null byte Using the ASCII table back inside cover of book

59 Representing Instructions int sum(int x, int y) { return x+y; } For this example, Alpha & Sun use two 4-byte instructions Use differing numbers of instructions in other cases PC uses 7 instructions with lengths 1, 2, and 3 bytes Same for NT and for Linux NT / Linux not fully binary compatible Alpha sum FA 6B Sun sum 81 C3 E PC sum E5 8B 45 0C EC 5D C3 Different machines use totally different instructions and encodings

60 Machine Words Machine Has Word Size Nominal size of integer-valued data Including addresses Most current machines use 32 bits (4 bytes) words Limits addresses to 4GB Becoming too small for memory-intensive applications High-end systems use 64 bits (8 bytes) words Potential address space 1.8 X bytes Machines support multiple data formats Fractions or multiples of word size Always integral number of bytes

61 Word-Oriented Memory Organization Addresses Specify Byte Locations Address of first byte in word Addresses of successive words differ by 4 (32- bit) or 8 (64-bit) 32-bit Words Addr = 0000?? Addr = 0004?? Addr = 0008?? Addr = 0012?? 64-bit Words Addr = 0000?? Addr = 0008?? Bytes Addr

62 Data Representations Sizes of C Objects (in Bytes) C Data Type Alpha (RIP) Typical 32-bit Intel IA32 unsigned int long int char short float double long double 8/ /12 char* Or any other pointer ( : Depends on compiler&os, 128bit FP is done in software)

63 Byte Ordering How should bytes within multi-byte word be ordered in memory? Conventions Sun s, Mac s are Big Endian machines Least significant byte has highest address Alphas, PC s are Little Endian machines Least significant byte has lowest address

64 Byte Ordering Example Big Endian Least significant byte has highest address Little Endian Least significant byte has lowest address Example Variable x has 4-byte representation 0x Address given by &x is 0x100 Big Endian Little Endian 0x100 0x101 0x102 0x x100 0x101 0x102 0x

65 Boolean algebra Boolean expressions created from: NOT, AND, OR

66 NOT Inverts (reverses) a boolean value Truth table for Boolean NOT operator: Digital gate diagram for NOT: NOT

67 AND Truth if both are true Truth table for Boolean AND operator: Digital gate diagram for AND: AND

68 OR True if either is true Truth table for Boolean OR operator: Digital gate diagram for OR: OR

69 Operator precedence NOT > AND > OR Examples showing the order of operations: Use parentheses to avoid ambiguity

70 Implementation of gates Fluid switch (

71 Implementation of gates

72 Implementation of gates

73 Truth Tables (1 of 2) A Boolean function has one or more Boolean inputs, and returns a single Boolean output. A truth table shows all the inputs and outputs of a Boolean function Example: X Y

74 Truth Tables (2 of 2) Example: X Y