Assembly Language For x86 Processors

Assembly Language for x86 Processors
7th Edition
Kip Irvine
Chapter 1: Basic Concepts
Slides prepared by the author

Revised by Zuoliu Ding at Fullerton College, 07/2014
(c) Pearson Education, 2015. 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.
Chapter Overview
• Welcome to Assembly Language

• Virtual Machine Concept
• Data Representation
• Boolean Operations
Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 2

Welcome to Assembly Language
• Some Good Questions to Ask

• Assembly Language Applications

Questions to Ask
• Why am I learning Assembly Language:
• What background should I have?
• What is an assembler?
• What hardware/software do I need?
• What types of programs will I create?
• What do I get with this book?
• What will I learn?
• IA-32 architecture, memory modes, Boolean logic
• Create AL apps, debug, trace, data representations
• Interface AL to C++, How C++ code works
• Windows apps in protected mode
• Hardware, OS system call, and interrupts

Welcome to Assembly Language (cont)
• How does assembly language (AL) relate to machine
language?
• How do C++ and Java relate to AL?
• Is AL portable?
• Why learn AL?
• Device drive and embedded programming
• Simulation/Monitoring
• Game and real-time apps
• Understanding Hardware, OS, and Apps
• Mixed language programming

Assembly Language Applications
• Some representative types of applications:

• Business application for single platform
• Hardware device driver
• Business application for multiple platforms
• Embedded systems & computer games
(see next panel)

Comparing ASM to High-Level Languages

What's Next


Virtual Machine Concept
• Virtual Machines
• Specific Machine Levels

Virtual Machine Example: JVM
• JVM, the main component of Java architecture and the part of
JRE. Provides the cross platform functionality to java.
• A software process that converts the compiled Java byte code
to machine code.
• Byte code is an intermediary language between Java source
and the host system.
http://en.wikipedia.org/wiki/Java_virtual_machine
Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. Added by Zuoliu Ding 10
Virtual Machine Example: .NET CLR
• Common Language Runtime (CLR) is the virtual machine of Microsoft's
.NET framework, responsible for managing the execution of .NET
programs.
• A process known as just-in-time (JIT) compilation, the CLR compiles the
intermediate language code (CIL) into the machine instructions executed
by the computer's CPU.
http://en.wikipedia.org/wiki/.NET_Framework
Virtual Machines
• Tanenbaum: Virtual machine concept

• Programming Language analogy:
• 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
• 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

Translating Languages
English: Display the sum of A times B plus C.
C++: cout << (A * B + C);
one to many
Assembly Language: Intel Machine Language:

mov eax,A A1 00000000
mul B F7 25 00000004
add eax,C one to one
03 05 00000008
call WriteInt
E8 00500000

Specific Machine Levels
(descriptions of individual levels

follow . . . )

High-Level Language
• Level 4
• Application-oriented languages
• C++, Java, Pascal, Visual Basic . . .
• Programs compile into assembly language
(Level 4)

Assembly Language
• Level 3
• Instruction mnemonics that have a one-to-
one correspondence to machine language
• Programs are translated into Instruction Set
Architecture Level - machine language
(Level 2)

Instruction Set Architecture (ISA)
• Level 2
• Also known as conventional machine
language
• Executed by Level 1 (Digital Logic)

Digital Logic
• Level 1
• CPU, constructed from digital logic gates
• System bus
• Memory
• Implemented using bipolar transistors
next: Data Representation

What's Next


Data Representation
• 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

Binary Numbers
• Digits are 1 and 0
• 1 = true
• 0 = false
• MSB – most significant bit
• LSB – least significant bit
MSB LSB
• Bit numbering:
1011001010011100
15 0
• Reference:
• Binary numeral system at Wikipedia

Binary Numbers
• 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

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, 0 or 1
binary 00001001 = decimal 9:

w =1; dec =0;
(1  23) + (1  20) = 9
Loop, i: 0 ~ n-1 {
• How to implement with Dec += Di * w
multiplication complexity of w *=2
O(n)? }

Translating Binary to Decimal
• Horner's rule: http://en.wikipedia.org/wiki/Horner’s_rule
dec = ((…( (Dn-1 2)  Dn-2) 2)  ...  D1) 2  D0
10001001b = 128 +8 +1 = 137d
dec = ((…( (D7 2)  D6) 2)  ...  D1) 2  D0
= ((…( (1 2)  0) 2)  ...  0) 2  1
• Good for code implementation
• Example: 10010101101b  1197d
• http://en.wikipedia.org/wiki/Binary-to-
decimal_conversion#Conversion_to_and_from_other_numeral
_systems
Translating Unsigned Decimal to Binary
• Repeatedly divide the decimal integer by 2. Each
remainder is a binary digit in the translated value:
37 = 100101

Binary Addition
• Starting with the LSB, add each pair of digits, include
the carry if present.

Integer Storage Sizes
Standard sizes:
What is the largest unsigned integer that may be stored in 20 bits? 1048475

Hexadecimal Integers
Binary values are represented in hexadecimal.

Translating Binary to Hexadecimal
• Each hexadecimal digit corresponds to 4 binary bits.

• Example: Translate the binary integer
101101010011110010100 to hexadecimal:
Try to separate: 0001,0110,1010,0111,1001,0100

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.
• Horner's rule: (((3  16) + 11)  16) + 10 ) 16) + 4

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

long:

Converting Decimal to Hexadecimal
decimal 422 = 1A6 hexadecimal
Verify the value of 1A6 by Horner's rule?

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.
1 1
36 28 28 6A
42 45 58 4B
78 6D 80 B5
21 / 16 = 1, rem 5
Important skill: Programmers frequently add and subtract the

addresses of variables and instructions.

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
C6 75
A2 47
24 2E
Practice: The address of var1 is 00400020. The address of the next

variable after var1 is 0040006A. How many bytes are used by var1?

Signed Integers
The highest bit indicates the sign. 1 = negative,
0 = positive
What’s this? -10
+10
If the highest digit of a hexadecimal integer is > 7, the value is

negative. Examples: 8A, C5, A29D, B1234567

Forming the Two's Complement
• Negative numbers are stored in two's complement
notation
• Represents the additive Inverse
• Note that 00000001 + 11111111 = 00000000

• Two's Complement operation is reversible. Two's Complement of
11111111 is 00000001

Binary Subtraction
• When subtracting A – B, convert B to its two's
complement
• Add A to (–B)
00001100 00001100
– 00000011 +1 1 1 1 1 1 0 1
00001001 00001001
Practice: Subtract 0101 from 1001.

Learn How To Do the Following:
• Form 2's complement of a hexadecimal WORD: (-27197d)
• 6A3Dh  95C2h+1 95C3h
• Convert signed byte to decimal
• 11110000b  -16d What if unsigned?
• Convert signed decimal to binary, byte
• -43d: (43d  00101011b, 11010100b+1) 11010101b
• Convert signed decimal to hexadecimal byte
• -43d  D5h
• Convert signed hexadecimal byte to decimal

(2Ah+1 = 2Bh) -43d
• D5h:
Ranges of Signed Integers
The highest bit is reserved for the sign. This limits the range:
10000000
Why? -
01111111
Practice: What is the largest positive value that may be stored in 20 bits?

Character Storage
• 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
• Control characters, Front inside cover of book
• http://en.wikipedia.org/wiki/ASCII

Numeric Data Representation
• Pure binary: binary integer
• can be calculated directly, 01000001b, 41h, 65, 101o
• ASCII binary
• string of digits: "01000001"
• ASCII decimal
• string of digits: "65"
• ASCII hexadecimal
• string of digits: “41“
• ASCII octal
• string of digits: “101"
next: Boolean Operations

What's Next


Boolean Operations
• NOT
• AND
• OR
• Operator Precedence
• Truth Tables

Boolean Algebra
• Based on symbolic logic, designed by George Boole
• http://en.wikipedia.org/wiki/George_Boole
• Boolean expressions created from:
• NOT, AND, OR

NOT
• Inverts (reverses) a boolean value

• Truth table for Boolean NOT operator:
Digital gate diagram for NOT:
NOT

AND
• Truth table for Boolean AND operator:
Digital gate diagram for AND:
AND

OR
• Truth table for Boolean OR operator:
Digital gate diagram for OR:
OR

Operator Precedence
• Examples showing the order of operations:

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

• Example: X  Y

• Example: (Y  S)  (X  S)
Two-input multiplexer
http://en.wikipedia.org/wiki/Multiplexer
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
• 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

54 68 65 20 45 6E 64
What do these numbers represent?

Assembly Language For x86 Processors

Uploaded by

Copyright:

Available Formats

Assembly Language For x86 Processors

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assembly Language For x86 Processors

Uploaded by

Copyright:

Available Formats

Assembly Language for x86 Processors

Chapter 1: Basic Concepts

Slides prepared by the author

• Welcome to Assembly Language

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 2

• Some Good Questions to Ask

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 3

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 4

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 5

• Some representative types of applications:

(see next panel)

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 6

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 7

• Welcome to Assembly Language

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 8

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 9

• Tanenbaum: Virtual machine concept

• Programs written in L1 can run two different ways:

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 12

English: Display the sum of A times B plus C.

C++: cout << (A * B + C);

Assembly Language: Intel Machine Language:

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 13

(descriptions of individual levels

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 14

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 15

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 16

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 17

next: Data Representation

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 18

• Welcome to Assembly Language

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 19

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 20

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 21

• Each digit (bit) is either 1 or 0

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 22

Weighted positional notation shows how to calculate the

binary 00001001 = decimal 9:

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 23

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 25

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 26

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 27

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 28

• Each hexadecimal digit corresponds to 4 binary bits.

Try to separate: 0001,0110,1010,0111,1001,0100

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 29

• Multiply each digit by its corresponding power of 16:

• Hex 1234 equals (1  163) + (2  162) + (3  161) + (4  160), or

• Hex 3BA4 equals (3  163) + (11  162) + (10  161) + (4  160), or

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 30

Used when calculating hexadecimal values up to 8 digits

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 31

decimal 422 = 1A6 hexadecimal

Verify the value of 1A6 by Horner's rule?

Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, 2010. 32

Important skill: Programmers frequently add and subtract the

Irvine, Kip R. Assembly Language for Intel-Based Computers 7/e, 2015. 33

• When a borrow is required from the digit to the left, add

Practice: The address of var1 is 00400020. The address of the next