Course overview Computer Organization and Assembly Languages 2007/11/10.
-
Upload
alyson-wilson -
Category
Documents
-
view
221 -
download
0
Transcript of Course overview Computer Organization and Assembly Languages 2007/11/10.
![Page 1: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/1.jpg)
Course overview
Computer Organization and Assembly Languages 2007/11/10
![Page 2: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/2.jpg)
Prerequisites
• Programming experience with some high-level language such C, C ++,Java …
![Page 3: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/3.jpg)
Books
Textbook Assembly Language for Intel-Based Computers, 4th Edition, Kip Irvine
Reference The Art of Assembly Language, Randy Hyde
Michael Abrash' s Graphics Programming Black Book, chap 1-22
![Page 4: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/4.jpg)
Computer Architecture vs. Computer Organization
Computer architecture deals with the functional behavior of a computer system as viewed by a programmer.
- Architecture refers to attributes visible to a programmer.
Computer organization refers to operational units and their interconnections that realize the architectural specifications.
- Computer organization deals with structural relationships that are not visible to the programmer.
![Page 5: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/5.jpg)
Computer Architecture vs. Computer Organization
Computer architecture deals with the functional behavior of a computer system as viewed by a programmer.
- Architecture refers to attributes visible to a programmer.
Computer organization refers to operational units and their interconnections that realize the architectural specifications.
- Computer organization deals with structural relationships that are not visible to the programmer.
![Page 6: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/6.jpg)
Processor
Computer
Control
Datapath
Memory Devices
Input
Output
Computer Organization is the organization of computer components that are transparent to programmers, such as Processor, Memory, and I/O Devices. • Computer Organization is not the same as Implementation
What is “Computer Organization“ ?
Any part of some implementation can fall into one of these categories.
![Page 7: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/7.jpg)
Why learn assembly?
• It is required.• It is a foundation for computer architecture
and compilers.• 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
![Page 8: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/8.jpg)
Why programming in assembly?
• 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.
![Page 9: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/9.jpg)
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 • BIOS Level Programming • Real Arithmetic • MMX • Code Optimization
![Page 10: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/10.jpg)
What you will learn
• Basic principle of computer architecture• IA-32 modes and memory management• Assembly basics• How high-level language is translated to
assembly• How to communicate with OS• Specific components, FPU/MMX• Code optimization• Interface between assembly to high-level
language
![Page 11: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/11.jpg)
Chapter.1 Overview
• Virtual Machine Concept• Data Representation• Boolean Operations
![Page 12: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/12.jpg)
Assembly programming
editor
assembler
linker loader
debugger
.asm
.obj
.exe
mov eax, Yadd eax, 4mov ebx, 3imul ebxmov X, eax
![Page 13: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/13.jpg)
Virtual machinesAbstractions for computers
![Page 14: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/14.jpg)
High-Level Language
• Level 5• Application-oriented languages• Programs compile into assembly
language (Level 4)
X:=(Y+4)*3
![Page 15: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/15.jpg)
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, Yadd eax, 4mov ebx, 3imul ebxmov X, eax
![Page 16: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/16.jpg)
Operating System
• Level 3• Provides services• Programs translated and run at the
instruction set architecture level (Level 2)
![Page 17: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/17.jpg)
Instruction Set Architecture
• Level 2• Also known as conventional machine languag
e• Executed by Level 1 program (microarchitectu
re, Level 1)
![Page 18: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/18.jpg)
Microarchitecture
• Level 1• Interprets conventional machine
instructions (Level 2)• Executed by digital hardware (Level 0)
![Page 19: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/19.jpg)
Digital Logic
• Level 0• CPU, constructed from digital logic gates• System bus• Memory
![Page 20: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/20.jpg)
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
![Page 21: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/21.jpg)
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:
• A bit string could have different interpretations
015
1 0 1 1 0 0 1 0 1 0 0 1 1 1 0 0
MSB LSB
![Page 22: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/22.jpg)
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
![Page 23: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/23.jpg)
Translating Binary to Decimal
Weighted positional notation shows how to calculate the decimal value of each binary bit:dec = (Dn-1 2n-1) (Dn-2 2n-2) ... (D1 21) (D0 20)
D = binary digit
binary 00001001 = decimal 9:(1 23) + (1 20) = 9
![Page 24: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/24.jpg)
Translating Unsigned Decimal to Binary • Repeatedly divide the decimal integer by 2. Each
remainder is a binary digit in the translated value:
37 = 100101
![Page 25: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/25.jpg)
Binary addition
• Starting with the LSB, add each pair of digits, include the carry if present.
![Page 26: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/26.jpg)
Integer storage sizes
Practice: What is the largest unsigned integer that may be stored in 20 bits?
Standard sizes:
![Page 27: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/27.jpg)
Large measurements
• Kilobyte (KB), 210 bytes• Megabyte (MB), 220 bytes• Gigabyte (GB), 230 bytes• Terabyte (TB), 240 bytes• Petabyte• Exabyte• Zettabyte• Yottabyte
![Page 28: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/28.jpg)
Hexadecimal integers
All values in memory are stored in binary. Because long binary numbers are hard to read, we use hexadecimal representation.
![Page 29: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/29.jpg)
Translating binary to hexadecimal
• Each hexadecimal digit corresponds to 4 binary bits.
• Example: Translate the binary integer 000101101010011110010100 to hexadecimal:
![Page 30: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/30.jpg)
Converting hexadecimal to decimal• Multiply each digit by its corresponding
power of 16:dec = (D3 163) + (D2 162) + (D1 161) + (D0 160)
• Hex 1234 equals (1 163) + (2 162) + (3 161) + (4 160), or decimal 4,660.
• Hex 3BA4 equals (3 163) + (11 * 162) + (10 161) + (4 160), or decimal 15,268.
![Page 31: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/31.jpg)
Powers of 16
Used when calculating hexadecimal values up to 8 digits long:
![Page 32: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/32.jpg)
Converting decimal to hexadecimal
decimal 422 = 1A6 hexadecimal
![Page 33: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/33.jpg)
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.
36 28 28 6A42 45 58 4B78 6D 80 B5
11
Important skill: Programmers frequently add and subtract the addresses of variables and instructions.
![Page 34: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/34.jpg)
Hexadecimal subtraction
When a borrow is required from the digit to the left, add 10h to the current digit's value:
C6 75A2 4724 2E
1
Practice: The address of var1 is 00400020. The address of the next variable after var1 is 0040006A. How many bytes are used by var1?
![Page 35: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/35.jpg)
Signed integers
The highest bit indicates the sign. 1 = negative, 0 = positive
If the highest digit of a hexadecmal integer is > 7, the value is negative. Examples: 8A, C5, A2, 9D
![Page 36: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/36.jpg)
Two's complement notation
Steps:– Complement (reverse) each bit– Add 1
Note that 00000001 + 11111111 = 00000000
![Page 37: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/37.jpg)
Binary subtraction
• When subtracting A – B, convert B to its two's complement
• Add A to (–B)1 1 0 0 1 1 0 0
– 0 0 1 1 1 1 0 11 0 0 1
Advantages for 2’s complement:• No two 0’s• Sign bit• Remove the need for separate circuits for
add and sub
![Page 38: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/38.jpg)
Ranges of signed integers
The highest bit is reserved for the sign. This limits the range:
![Page 39: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/39.jpg)
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
![Page 40: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/40.jpg)
Boolean algebra
• Boolean expressions created from:– NOT, AND, OR
![Page 41: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/41.jpg)
NOT
• Inverts (reverses) a boolean value• Truth table for Boolean NOT operator:
NOT
Digital gate diagram for NOT:
![Page 42: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/42.jpg)
AND
• Truth if both are true• Truth table for Boolean AND operator:
AND
Digital gate diagram for AND:
![Page 43: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/43.jpg)
OR
• True if either is true• Truth table for Boolean OR operator:
OR
Digital gate diagram for OR:
![Page 44: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/44.jpg)
Operator precedence
• NOT > AND > OR• Examples showing the order of
operations:
• Use parentheses to avoid ambiguity
![Page 45: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/45.jpg)
Truth Tables (1 of 3)
• 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
![Page 46: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/46.jpg)
Truth Tables (2 of 3)
• Example: X Y
![Page 47: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/47.jpg)
Truth Tables (3 of 3)
• Example: (Y S) (X S)
Two-input multiplexer
![Page 48: Course overview Computer Organization and Assembly Languages 2007/11/10.](https://reader036.fdocuments.us/reader036/viewer/2022062423/5697bfe11a28abf838cb3e9a/html5/thumbnails/48.jpg)
What is “Computer (Instruction Set) Architecture“ ?
The study of how to co-ordinate between levels of abstraction and how to design the programmer visible components
I/O systemInstr. Set Proc.
CompilerOperating
System
Application
Digital Design
Circuit Design
(Instruction Set) Architecture
• Implementation details are not part of the Architecture (See Ch. 1, page 7)
Visible to Programmers
Not Visible to Programmers