1. Chapter 1: Basic Concepts (c) Pearson Education, 2006-2007. All rights reserved. You may modify and copy this slide show for your personal use, or for use in the classroom, as long as this copyright statement, the author's name, and the title are not changed. Kip Irvine

2.  Welcome to Assembly Language  Virtual Machine Concept  Data Representation  Boolean Operations Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.2

3.  Assembly language is the oldest programming language.  Of all languages, it bears the closest resemblance to the native language of a computer.  Direct access to a computer’s hardware  To understand a great deal about your computer’s architecture and operating system Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.3

4.  What background should I have?  Computer programming (C++, C#, JAVA, VB…)  What is an assembler?  A program that converts source-code programs from assembly language into machine language  MASM (Microsoft Assembler), TASM (Borland Turbo Assembler)  Linker (a companion program of Assembler) combines individual files created by an assembler into a single executable program.  Debugger provides a way for a programmer to trace the execution of a program and examine the contents of memory. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.4

5.  What types of programs will I create?  16-Bit Real-Address Mode: MS-DOS, DOS emulator  32-Bit Protected Mode: Microsoft Windows  How does assembly language (AL) relate to machine language?  One-to-one relationship  How do C++ and Java relate to AL? E.g., X=(Y+4) *3 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.5 mov eax, Y add eax, 4 mov ebx, 3 imul ebx mov X, eax

6.  What will I learn?  Basic principles of computer architecture  Basic Boolean logic  How IA-32 processors manage memory, using real mode, protected mode and virtual mode  How high-level language compilers (such as C++) translate statements into assembly language and native machine code  Improvement of the machine-level debugging skills (e.g., errors due to memory allocation)  How application programs communicate with the computer’s operating system via interrupt handlers, system calls, and common memory areas Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.6

7.  Is AL portable?  A language whose source program can be compiled and run on a wide variety of computer systems is said to be portable.  AL makes no attempt to be portable. ▪ It is tied to a specific processor family.  Why learn AL?  Embedded system programs  Programs to be highly optimized for both space and runtime speed  To gain an overall understanding of the interaction between the hardware, OS and application programs  Device driver: programs that translate general operating system commands into specific references to hardware details Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.7

8.  Some representative types of applications:  Business application for single platform  Hardware device driver  Business application for multiple platforms  Embedded systems & computer games Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.8 (see next panel)

9. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 9

10.  Welcome to Assembly Language  Virtual Machine Concept  Data Representation  Boolean Operations Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.10

11.  Virtual Machines  Specific Machine Levels Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.11

12.  Virtual machine concept  A most effective way to explain how a computer’s hardware and software are related  In terms of programming languages  Each computer has a native machine language (language L0) that runs directly on its hardware  A more human-friendly language is usually constructed above machine language, called Language L1 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.12 Programs written in L1 can run two different ways: Interpretation – L0 program interprets and executes L1 instructions one by one Translation – L1 program is completely translated into an L0 program, which then runs on the computer hardware

13.  In terms of a hypothetical computer  VM1 can execute commands written in language L1.  VM2 can execute commands written in language L2.  The process can repeat until a virtual machine VMn can be designed that supports a powerful, easy-to-use language.  The Java programming language is based on the virtual machine concept.  A program written in the Java language is translated by a Java compiler into Java byte code.  Java byte code: a low-level language that is quickly executed at run time by Java virtual machine (JVM).  The JVM has been implemented on many different computer systems, making Java programs relatively system-independent. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.13

14. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 14 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: A1 00000000 F7 25 00000004 03 05 00000008 E8 00500000

15. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.15 (descriptions of individual levels follow... )

16.  Level 5  Application-oriented languages  C++, Java, Pascal, Visual Basic...  Programs compile into assembly language (Level 4) Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.16

17.  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) Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.17

18.  Level 3  Provides services to Level 4 programs  Translated and run at the instruction set architecture level (Level 2) Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.18

19.  Level 2  Also known as conventional machine language  Executed by Level 1 (microarchitecture) program Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.19

20.  Level 1  Interprets conventional machine instructions (Level 2)  Executed by digital hardware (Level 0) Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.20

21.  Level 0  CPU, constructed from digital logic gates  System bus  Memory  Implemented using bipolar transistors Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.21 next: Data Representation

22.  Welcome to Assembly Language  Virtual Machine Concept  Data Representation  Boolean Operations Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.22

23.  Binary Numbers  Translating between binary and decimal  Binary Addition  Integer Storage Sizes  Hexadecimal Integers  Translating between decimal and hexadecimal  Hexadecimal subtraction  Signed Integers  Binary subtraction  Character Storage Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.23

24.  Digits are 1 and 0  1 = true  0 = false  MSB – most significant bit  LSB – least significant bit  Bit numbering: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.24

25.  Each digit (bit) is either 1 or 0  Each bit represents a power of 2: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.25 Every binary number is a sum of powers of 2

26. 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 1  2 1 )  (D 0  2 0 ) D = binary digit binary 00001001 = decimal 9: (1  2 3 ) + (1  2 0 ) = 9 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.26

27.  Repeatedly divide the decimal integer by 2. Each remainder is a binary digit in the translated value: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.27 37 = 100101

28.  Starting with the LSB, add each pair of digits, include the carry if present. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.28

29. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.29 What is the largest unsigned integer that may be stored in 20 bits? Standard sizes:

30. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 30 Binary values are represented in hexadecimal.

31. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 31 Each hexadecimal digit corresponds to 4 binary bits. Example: Translate the binary integer 000101101010011110010100 to hexadecimal:

32.  Multiply each digit by its corresponding power of 16: dec = (D 3  16 3 ) + (D 2  16 2 ) + (D 1  16 1 ) + (D 0  16 0 )  Hex 1234 equals (1  16 3 ) + (2  16 2 ) + (3  16 1 ) + (4  16 0 ), or decimal 4,660.  Hex 3BA4 equals (3  16 3 ) + (11 * 16 2 ) + (10  16 1 ) + (4  16 0 ), or decimal 15,268. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.32

33. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 33 Used when calculating hexadecimal values up to 8 digits long:

34. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 34 decimal 422 = 1A6 hexadecimal

35.  Divide the sum of two digits by the number base (16). The quotient becomes the carry value, and the remainder is the sum digit. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.35 3628286A 4245584B 786D80B5 1 1 21 / 16 = 1, rem 5 Important skill: Programmers frequently add and subtract the addresses of variables and instructions.

36.  When a borrow is required from the digit to the left, add 16 (decimal) to the current digit's value: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.36 C675 A247 242E 11 16 + 5 = 21 Practice: The address of var1 is 00400020. The address of the next variable after var1 is 0040006A. How many bytes are used by var1?

37. The highest bit indicates the sign. 1 = negative, 0 = positive Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.37 If the highest digit of a hexadecimal integer is > 7, the value is negative. Examples: 8A, C5, A2, 9D

38.  Negative numbers are stored in two's complement notation  Represents the additive Inverse Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.38 Note that 00000001 + 11111111 = 00000000

39.  When subtracting A – B, convert B to its two's complement  Add A to (–B)0 0 0 0 1 1 0 0 –0 0 0 0 0 0 1 11 1 1 1 1 1 0 1 0 0 0 0 1 0 0 1 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.39 Practice: Subtract 0101 from 1001.

40.  Form the two's complement of a hexadecimal integer  Convert signed binary to decimal  Convert signed decimal to binary  Convert signed decimal to hexadecimal  Convert signed hexadecimal to decimal Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.40

41. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 41 The highest bit is reserved for the sign. This limits the range: Practice: What is the largest positive value that may be stored in 20 bits?

42.  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 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.42

43.  pure binary  can be calculated directly  ASCII binary  string of digits: "01010101"  ASCII decimal  string of digits: "65"  ASCII hexadecimal  string of digits: “41" Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.43 next: Boolean Operations

44.  Welcome to Assembly Language  Virtual Machine Concept  Data Representation  Boolean Operations Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.44

45.  NOT  AND  OR  Operator Precedence  Truth Tables Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.45

46.  Based on symbolic logic, designed by George Boole  Boolean expressions created from:  NOT, AND, OR Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.46

47.  Inverts (reverses) a boolean value  Truth table for Boolean NOT operator: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.47 Digital gate diagram for NOT:

48.  Truth table for Boolean AND operator: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.48 Digital gate diagram for AND:

49.  Truth table for Boolean OR operator: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.49 Digital gate diagram for OR:

50.  Examples showing the order of operations: Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.50

51.  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 Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.51 Example:  X  Y

52.  Example: X   Y Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.52

53.  Example: (Y  S)  (X   S) Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.53 Two-input multiplexer

54.  Assembly language helps you learn how software is constructed at the lowest levels  Assembly language has a one-to-one relationship with machine language  Each layer in a computer's architecture is an abstraction of a machine  layers can be hardware or software  Boolean expressions are essential to the design of computer hardware and software Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007.54

55. Irvine, Kip R. Assembly Language for Intel-Based Computers 5/e, 2007. 55 What do these numbers represent?