ECOM 2325 Computer Organization and Assembly Language Instructor: Ruba A.Salamah INTRODUCTION
Overview Welcome to ECOM 2325 Assembly-, Machine-, and High-Level Languages Assembly Language Programming Tools Data Representation
Welcome to ECOM 2325 Course Description: This course covers basic principles about computer architecture, machine language, and low-level programming. You will learn enough assembly language to test your knowledge on today s most widely used microprocessor family. You won t be learning to program a toy computer using a simulated assembler; You will learn the architecture of the x86 processor family from a programmer s point of view, to develop an understanding of how memory, addresses, and instructions work at a low level. Pre-requisites: Any high-level Programming Language, Digital Logic Design.
Textbook Kip Irvine: Assembly Language for Intel-Based Computers 7 th edition (2015) Read the textbook! Key for learning and obtaining a good grade
Grading Policy Labs & Assignments 25% Midterm Exam 25% Final Exam 50%
Some Important Questions to Ask What is Assembly Language? Why Learn Assembly Language? What is Machine Language? How is Assembly related to Machine Language? What is an Assembler? How is Assembly related to High-Level Language? Is Assembly Language portable?
Assembly and Machine Language Machine language Native to a processor: executed directly by hardware Instructions consist of binary code: 1s and 0s Assembly language Slightly higher-level language Readability of instructions is better than machine language One-to-one correspondence with machine language instructions Assemblers translate assembly to machine code Compilers translate high-level programs to machine code Either directly, or Indirectly via an assembler
Translating Languages English: D is assigned the sum of A times B plus 10. High-Level Language: D = A * B + 10 A statement in a high-level language is translated typically into several machine-level instructions Intel Assembly Language: mov eax, A mul B add eax, 10 mov D, eax Intel Machine Language: A1 00404000 F7 25 00404004 83 C0 0A A3 00404008
Advantages of High-Level Languages Program development is faster High-level statements: fewer instructions to code Program maintenance is easier For the same above reasons Programs are portable Contain few machine-dependent details Can be used with little or no modifications on different machines Compiler translates to the target machine language However, Assembly language programs are not portable
Why Learn Assembly Language? Speed. Assembly language programs are generally the fastest programs around. Space. Assembly language programs are often the smallest. Knowledge. Your knowledge of assembly language will help you write better programs, even when using HLLs Sometimes to debug a higher-level language, you have to review the resulting assembly language. Compiler writers must know how to write assembly language in order to have the compiler do code generation. It is an important path to understanding how the machine works.
Assembler Software tools are needed for editing, assembling, linking, and debugging assembly language programs An assembler is a program that converts source-code programs written in assembly language into object files in machine language Popular assemblers have emerged over the years for the Intel family of processors. These include TASM (Turbo Assembler from Borland) NASM (Netwide Assembler for both Windows and Linux), and GNU assembler distributed by the free software foundation You will use MASM (Macro Assembler from Microsoft)
Linker and Link Libraries You need a linker program to produce executable files It combines your program's object file created by the assembler with other object files and link libraries, and produces a single executable program LINK32.EXE is the linker program provided with the MASM distribution for linking 32-bit programs We will also use a link library for input and output called Irvine32.lib developed by Kip Irvine Works in Win32 console mode under MS-Windows
Debugger Allows you to trace the execution of a program Allows you to view code, memory, registers, etc. You will use the 32-bit Windows debugger
Editor Allows you to create assembly language source files Some editors provide syntax highlighting features and can be customized as a programming environment
Data Representation Binary Numbers Hexadecimal Numbers Base Conversions Integer Storage Sizes Binary and Hexadecimal Addition Signed Integers and 2's Complement Notation Binary and Hexadecimal subtraction Carry and Overflow Character Storage
Binary Numbers Digits are 1 and 0 1 = true 0 = false MSB most significant bit LSB least significant bit Bit numbering: MSB LSB 1 0 1 1 0 0 1 0 1 0 0 1 1 1 0 0 15 0
Binary Numbers Each digit (bit) is either 1 or 0 Each bit represents a power of 2: 1 1 1 1 1 1 1 1 2 7 2 6 2 5 2 4 2 3 2 2 2 1 2 0 Every binary number is a sum of powers of 2
Converting Binary to Decimal Weighted positional notation shows how to calculate the decimal value of each binary bit: Decimal = (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
Convert Unsigned Decimal to Binary Repeatedly divide the decimal integer by 2. Each remainder is a binary digit in the translated value: least significant bit most significant bit 37 = 100101 stop when quotient is zero
Hexadecimal Integers Binary values are represented in hexadecimal.
Converting Binary to Hexadecimal Each hexadecimal digit corresponds to 4 binary bits. Example: Translate the binary integer 000101101010011110010100 to hexadecimal:
Converting Hexadecimal to Decimal Multiply each digit by its corresponding power of 16: Decimal = (d 3 16 3 ) + (d 2 16 2 ) + (d 1 16 1 ) + (d 0 16 0 ) d = hexadecimal digit Examples: Hex 1234 = (1 16 3 ) + (2 16 2 ) + (3 16 1 ) + (4 16 0 ) = Decimal 4,660 Hex 3BA4 = (3 16 3 ) + (11 * 16 2 ) + (10 16 1 ) + (4 16 0 ) = Decimal 15,268
Converting Decimal to Hexadecimal Repeatedly divide the decimal integer by 16. Each remainder is a hex digit in the translated value: least significant digit most significant digit stop when quotient is zero Decimal 422 = 1A6 hexadecimal
Integer Storage Sizes byte 8 Standard sizes: word doubleword 16 32 quadword 64 What is the largest unsigned integer that may be stored in 20 bits?
Binary Addition Start with the least significant bit (rightmost bit) Add each pair of bits Include the carry in the addition, if present carry: 1 + 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 1 (4) (7) 0 0 0 0 1 0 1 1 (11) bit position: 7 6 5 4 3 2 1 0
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 1 1 28 6A 42 45 58 4B 78 6D 80 B5 21 / 16 = 1, remainder 5 Important skill: Programmers frequently add and subtract the addresses of variables and instructions.
Signed Integers Several ways to represent a signed number Sign-Magnitude 1's complement 2's complement Divide the range of values into 2 equal parts First part corresponds to the positive numbers ( 0) Second part correspond to the negative numbers (< 0) Focus will be on the 2's complement representation Has many advantages over other representations Used widely in processors to represent signed integers
Two's Complement Representation Positive numbers Signed value = Unsigned value Negative numbers Signed value = 2 n - Unsigned value n = number of bits Negative weight for MSB Another way to obtain the signed value is to assign a negative weight to most-significant bit 1 0 1 1 0 1 0 0-128 64 32 16 8 4 2 1 = -128 + 32 + 16 + 4 = -76 8-bit Binary value Unsigned value Signed value 00000000 0 0 00000001 1 +1 00000010 2 +2......... 01111110 126 +126 01111111 127 +127 10000000 128-128 10000001 129-127......... 11111110 254-2 11111111 255-1 How to convert signed binary into decimal
convert signed decimal into binary starting value 00100100 = +36 step1: reverse the bits (1's complement) 11011011 step 2: add 1 to the value from step 1 + 1 sum = 2's complement representation 11011100 = -36 Sum of an integer and its 2's complement must be zero: 00100100 + 11011100 = 00000000 (8-bit sum) Ignore Carry The easiest way to obtain the 2's complement of a binary number is by starting at the LSB, leaving all the 0s unchanged, look for the first occurrence of a 1. Leave this 1 unchanged and complement all the bits after it.
Sign Bit Highest bit indicates the sign. 1 = negative, 0 = positive sign bit 1 1 1 1 0 1 1 0 Negative 0 0 0 0 1 0 1 0 Positive If highest digit of a hexadecimal is > 7, the value is negative Examples: 8A and C5 are negative bytes A21F and 9D03 are negative words B1C42A00 is a negative double-word
Sign Extension Step 1: Move the number into the lower-significant bits Step 2: Fill all the remaining higher bits with the sign bit This will ensure that both magnitude and sign are correct Examples Sign-Extend 10110011 to 16 bits 10110011 = -77 11111111 10110011 = -77 Sign-Extend 01100010 to 16 bits 01100010 = +98 00000000 01100010 = +98 Infinite 0s can be added to the left of a positive number Infinite 1s can be added to the left of a negative number
Two's Complement of a Hexadecimal To form the two's complement of a hexadecimal Subtract each hexadecimal digit from 15 Add 1 Examples: 2's complement of 6A3D = 95C2 + 1 = 95C3 2's complement of 92F0 = 6D0F + 1 = 6D10 2's complement of FFFF = 0000 + 1 = 0001 No need to convert hexadecimal to binary
Binary Subtraction When subtracting A B, convert B to its 2's complement Add A to ( B) 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 + 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 0 (2's complement) 0 0 0 0 1 0 1 0 0 0 0 0 1 0 1 0 (same result) Practice: Subtract 00100101 from 01101001.
Hexadecimal Subtraction When a borrow is required from the digit to the left, add 16 (decimal) to the current digit's value 16 + 5 = 21 - -1 C675 A247 242E + 1 1 C675 5DB9 (2's complement) 242E (same result) Last Carry is ignored Practice: The address of var1 is 00400B20. The address of the next variable after var1 is 0040A06C. How many bytes are used by var1?
Ranges of Signed Integers The unsigned range is divided into two signed ranges for positive and negative numbers Practice: What is the range of signed values that may be stored in 20 bits?
Carry and Overflow Carry is important when Adding or subtracting unsigned integers Indicates that the unsigned sum is out of range Either < 0 or >maximum unsigned n-bit value Overflow is important when Adding or subtracting signed integers Indicates that the signed sum is out of range Overflow occurs when Adding two positive numbers and the sum is negative Adding two negative numbers and the sum is positive Can happen because of the fixed number of sum bits
Carry and Overflow Examples We can have carry without overflow and vice-versa Four cases are possible 1 1 1 1 1 1 + 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 0 15 8 + 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 15 245 (-8) 0 0 0 1 0 1 1 1 23 0 0 0 0 0 1 1 1 7 Carry = 0 Overflow = 0 Carry = 1 Overflow = 0 1 1 1 1 + 0 1 0 0 1 1 1 1 0 1 0 0 0 0 0 0 79 64 + 1 1 0 1 1 0 1 0 1 0 0 1 1 1 0 1 218 (-38) 157 (-99) 1 0 0 0 1 1 1 1 Carry = 0 Overflow = 1 143 (-113) 0 1 1 1 0 1 1 1 Carry = 1 Overflow = 1 119
Character sets Character Storage Standard ASCII: 7-bit character codes (0 127) Extended ASCII: 8-bit character codes (0 255) Unicode: 16-bit character codes (0 65,535) Unicode standard represents a universal character set Defines codes for characters used in all major languages Used in Windows-XP: each character is encoded as 16 bits UTF-8: variable-length encoding used in HTML Encodes all Unicode characters Uses 1 byte for ASCII, but multiple bytes for other characters Null-terminated String Array of characters followed by a NULL character
Printable ASCII Codes 0 1 2 3 4 5 6 7 8 9 A B C D E F 2 space! " # $ % & ' ( ) * +, -. / 3 0 1 2 3 4 5 6 7 8 9 : ; < = >? 4 @ A B C D E F G H I J K L M N O 5 P Q R S T U V W X Y Z [ \ ] ^ _ 6 ` a b c d e f g h i j k l m n o 7 p q r s t u v w x y z { } ~ DEL Examples: ASCII code for space character = 20 (hex) = 32 (decimal) ASCII code for 'L' = 4C (hex) = 76 (decimal) ASCII code for 'a' = 61 (hex) = 97 (decimal)
Summary Assembly language helps you learn how software is constructed at the lowest levels Assembly language has a one-to-one relationship with machine language An assembler is a program that converts assembly language programs into machine language A linker combines individual files created by an assembler into a single executable file A debugger provides a way for a programmer to trace the execution of a program and examine the contents of memory and registers A computer system can be viewed as consisting of layers. Programs at one layer are translated or interpreted by the next lower-level layer Binary and Hexadecimal numbers are essential for programmers working at the machine level.