unit-1-mpmc-mpmc
unit-1-mpmc-mpmc
2
3
BOOK References
Main Book:
1. Microprocessors and Interfacing, Programming and Hardware by
Doughlas V.Hall
Other Authors:
2. Microcomputer Systems: The 8086 / 8088 Family -
Architecture, Programming and Design by Yu-Cheng Liu, Glenn
A.Gibson
3. INTEL Microprocessors 8086/8088, 80186/80188, 80286, 80386,
80486, Pentium, Prentium ProProcessor, Pentium II, III, 4 by Barry B.
Bery
4. Advanced microprocessor and peripherals by A K RAY
LOCAL AUTHOR:
8086 Microprocessor by Nagoor Kani => Unit 1,2,3
4
NPTEL Lecture Materials
References
• Microprocessor and Peripheral Devices by
Dr. Pramod Agarwal , IIT Roorkee
Link: http://nptel.ac.in/courses/108107029/
5
Microprocessor Basics
• Microprocessor (μP) is the “brain” of a computer
that has been implemented on one
semiconductor chip.
• The word comes from the combination micro and
processor.
• Processor means a device that processes
whatever(binary numbers, 0’s and 1’s)
¾ To process means to manipulate. It describes all
manipulation.
¾ Micro - > extremely small
6
Definition of a Microprocessor.
The microprocessor is a
programmable device that takes in numbers,
performs on them arithmetic or logical
operations according to the program stored in
memory and then produces other numbers as
a result.
7
Microprocessor ?
A microprocessor is multi
programmable clock driven
register based semiconductor
device that is used to fetch ,
process & execute a data
within fraction of seconds.
8
Applications
• Calculators
• Accounting system
• Games machine
• Instrumentation
• Traffic light Control
• Multi user, multi-function environments
• Military applications
• Communication systems
9
MICROPROCESSOR HISTORY
10
DIFFERENT PROCESSORS AVAILABLE
Socket
Pinless
Processor
Processor Slot
Processor
ProcessorSl
ot
11
Development of Intel Microprocessors
• 8086 - 1979
• 286 - 1982
• 386 - 1985
• 486 - 1989
• Pentium - 1993
• Pentium Pro - 1995
• Pentium MMX -1997
• Pentium II - 1997
• Pentium II Celeron - 1998
• Pentium II Zeon - 1998
• Pentium III - 1999
• Pentium III Zeon - 1999
• Pentium IV - 2000
• Pentium IV Zeon - 2001
12
GENERATION OF PROCESSORS
Processor Bits Speed
8080 8 2 MHz
8086 16 4.5 – 10
MHz
8088 16 4.5 – 10
MHz
80286 16 10 – 20
MHz
80386 32 20 – 40
MHz
80486 32 40 – 133
MHz
13
GENERATION OF PROCESSORS
Pentium 32 60 – 233
MHz
Pentium 32 150 – 200
Pro MHz
Pentium II, 32 233 – 450
Celeron , MHz
Xeon
Pentium 32 450 MHz –
III, Celeron 1.4 GHz
, Xeon
Pentium IV, 32 1.3 GHz –
Celeron , 3.8 GHz
Xeon
Itanium 64 800 MHz –
3.0 GHz
14
Intel 4004
¾ Introduced in 1971.
15
Intel 4040
¾Introduced in 1971.
¾It was also 4-bit μP.
16
8-bit Microprocessors
17
Intel 8008
¾Introduced in 1972.
¾It was first 8-bit μP.
¾Its clock speed was
500 KHz.
¾Could execute
50,000 instructions
per second.
18
Intel 8080
¾Introduced in 1974.
¾It was also 8-bit μP.
¾Its clock speed was
2 MHz.
¾It had 6,000
transistors.
19
¾Introduced in 1976.
Intel 8085
¾It was also 8-bit μP.
¾Its clock speed was 3 MHz.
¾Its data bus is 8-bit and
address bus is 16-bit.
¾It had 6,500 transistors.
¾Could execute 7,69,230
instructions per second.
¾It could access 64 KB of
memory.
¾It had 246 instructions.
20
16-bit Microprocessors
21
¾ Introduced in 1978.
¾ It was created as a
cheaper version of
Intel’s 8086.
24
INTEL 80286
¾ Introduced in 1982.
¾ It was 16-bit μP.
¾ Its clock speed was 8
MHz.
¾ Its data bus is 16-bit
and address bus is 24-
bit.
¾ It could address 16 MB
of memory.
¾ It had 1,34,000 25
transistors.
32-BIT MICROPROCESSORS
26
¾ Introduced in 1986.
28
¾ Introduced in 1993.
INTEL PENTIUM
¾ It was also 32-bit μP.
29
INTEL PENTIUM PRO
¾ Introduced in 1995.
¾ It was also 32-bit μP.
¾ It had 21 million
transistors.
¾ Cache memory:
¾ 8 KB for instructions.
¾ 8 KB for data.
30
INTEL PENTIUM II
¾ Introduced in 1997.
¾ It was also 32-bit μP.
¾ Its clock speed was 233
MHz to 500 MHz.
¾ Could execute 333
million instructions per
second.
31
INTEL PENTIUM II XEON
¾ Introduced in 1998.
32
INTEL PENTIUM III
¾ Introduced in 1999.
¾ It was also 32-bit μP.
¾ Its clock speed varied
from 500 MHz to 1.4
GHz.
¾ It had 9.5 million
transistors.
33
INTEL PENTIUM IV
¾ Introduced in 2000.
¾ It had 42 million
transistors.
34
¾ Introduced in 2006.
INTEL DUAL CORE
¾ It is 32-bit or 64-bit μP.
35
36
64-BIT MICROPROCESSORS
37
Intel Core 2 Intel Core i3
38
INTEL CORE I5 INTEL CORE I7
39
Basic Terms
• Bit: A digit of the binary number { 0 or 1 }
• Nibble: 4 bit Byte: 8 bit word: 16 bit
• Double word: 32 bit
• Data: binary number/code operated by an
instruction
• Address: Identification number for memory
locations
• Clock: square wave used to synchronize various
devices in μP
• Memory Capacity = 2^n ,
n->no. of address lines
40
BUS CONCEPT
• BUS: Group of conducting lines that carries data ,
address & control signals.
CLASSIFICATION OF BUSES:
1.DATA BUS: group of conducting lines that carries
data.
2. ADDRESS BUS: group of conducting lines that
carries address.
3.CONTROL BUS: group of conducting lines that
carries control signals {RD, WR etc}
CPU BUS: group of conducting lines that directly
connected to μP
SYSTEM BUS: group of conducting lines that carries
data , address & control signals in a μP system
41
TRISTATE LOGIC
3 logic levels are:
• High State (logic 1)
• Low state (logic 0)
• High Impedance state
High Impedance: output is not being driven to any defined logic level
by the output circuit.
42
Basic Microprocessors System
Central Processing Unit
Arithmetic-
Control
Logic
Unit
ProcessinggUnit
Input Data into Output
Devices Information
Primary Storage Devices
Unit
Keyboard, Monitor
Mouse Printer
etc
1
THE 8086 MICROPROCESSOR
44
UNIT 1 Syllabus
• Introduction to 8086
• Microprocessor architecture
• Addressing modes
• Instruction set
• Assembler directives
• Assembly language programming
• Modular Programming
1.Linking and Relocation
2.Stacks , Procedures , Macros
• Interrupts and interrupt service routines
• Byte & String Manipulation. 45
8086 Microprocessor-introduction
¾INTEL launched 8086 in 1978
¾8086 is a 16-bit microprocessor with
• 16-bit Data Bus {D0-D15}
• 20-bit Address Bus {A0-A19} [can access upto
2^20= 1 MB memory locations] .
¾It has multiplexed address and data bus
AD0-AD15 and A16–A19.
¾It can support upto 64K I/O ports
46
8086 Microprocessor
¾It provides 14, 16-bit registers.
¾8086 requires one phase clock with a 33%
duty cycle to provide optimized internal
timing.
– Range of clock:
• 5 MHz for 8086
• 8Mhz for 8086-2
• 10Mhz for 8086-1
47
8086 Internal Architecture
¾ 8086 employs parallel processing
¾ 8086 CPU has two parts which operate at the
same time
• Bus Interface Unit 8086 CPU
• Execution Unit
¾ CPU functions Bus Interface
Unit (BIU)
1. Fetch
48
Bus Interface Unit
¾Sends out addresses for memory locations
¾Fetches Instructions from memory
¾Reads/Writes data to memory
¾Sends out addresses for I/O ports
¾Reads/Writes data to Input/Output ports
49
Execution Unit
¾Tells BIU (addresses) where to fetch
instructions or data
¾Decodes & Executes instructions
50
Architecture Diagram of 8086
51
Memory
Interface
Instruction
Decoder
AH AL
BH BL ARITHMETIC
CH CL LOGIC UNIT
CONTROL
DH DL
SYSTEM
STACK POINTER (SP)
BASE POINTER (BP) OPERANDS
FLAGS
SOURCE INDEX (SI)
DESTINATION INDEX (DI)
EU 52
Execution Unit
¾Main components are
• Instruction Decoder
• Control System
• Arithmetic Logic Unit
• General Purpose Registers
• Flag Register
• Pointer & Index registers
53
Instruction Decoder
¾ Translates instructions fetched from memory
into a series of actions which EU carries out
Control System
¾ Generates timing and control signals to
perform the internal operations of the
microprocessor
56
Flag Register
U U U U OF DF IF TF SF ZF U AF U PF U CF
1. CF CARRY FLAG
Conditional Flags
2. PF PARITY FLAG
(Compatible with 8085,
3. AF AUXILIARY CARRY
except OF)
4. ZF ZERO FLAG
5. SF SIGN FLAG
6. OF OVERFLOW FLAG
7. TF TRAP FLAG
Control Flags
8. IF INTERRUPT FLAG
9. DF DIRECTION FLAG
57
Flag Register
Auxiliary Carry Flag
Carry Flag
This is set, if there is a carry from the
lowest nibble, i.e, bit three during This flag is set, when there is
addition, or borrow for the lowest a carry out of MSB in case of
nibble, i.e, bit three, during addition or a borrow in case
subtraction. of subtraction.
This flag is set, when the This flag is set, if the result of This flag is set to 1, if the lower
result of any computation the computation or comparison byte of the result contains even
is negative performed by an instruction is number of 1’s ; for odd number
zero of 1’s set to zero.
15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
OF DF IF TF SF ZF AF PF CF
Tarp Flag
Over flow Flag If this flag is set, the processor
This flag is set, if an overflow occurs, i.e, if the result of a signed enters the single step execution
operation is large enough to accommodate in a destination
mode by generating internal
register. The result is of more than 7-bits in size in case of 8-bit
signed operation and more than 15-bits in size in case of 16-bit interrupts after the execution of
sign operations, then the overflow will be set. each instruction
8086 registers
15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
categorized
into 4 groups OF DF IF TF SF ZF AF PF CF
61
Instruction Queue
¾ 8086 employs parallel processing
¾ When EU is busy decoding or executing
current instruction, the buses of 8086 may
not be in use.
¾ At that time, BIU can use buses to fetch upto
six instruction bytes for the following
instructions
¾ BIU stores these pre-fetched bytes in a FIFO
register called Instruction Queue
¾ When EU is ready for its next instruction, it
simply reads the instruction from the queue
in BIU
62
Pipelining
¾EU of 8086 does not have to wait in
between for BIU to fetch next
instruction byte from memory
¾So the presence of a queue in 8086
speeds up the processing
¾Fetching the next instruction while the
current instruction executes is called
pipelining
63
Memory Segmentation
¾ 8086 has a 20-bit address bus
¾ So it can address a maximum of 1MB of
memory
¾ 8086 can work with only four 64KB segments
at a time within this 1MB range
¾ These four memory segments are called
• Code segment
• Stack segment
• Data segment
• Extra segment
64
Memory
64KB Memory 1 00000H
Segment 2
3
4
4
5
Only 4 such segments can be 6
addressed at a time 7
8
1MB
9
Address
10 Range
11
12
13
14
15
16 FFFFFH
65
Code Segment
¾ That part of memory from where BIU is
currently fetching instruction code bytes
Stack Segment
¾ A section of memory set aside to store
addresses and data while a subprogram
executes
66
Memory
Code Segment 1 00000H
2
4
Data & Extra 5
Segments 6
8
1MB
9 Address
10 Range
11
12
13
14
15
68
Memory
1 00000H
CS 1000 0H Code Segment
3
Starting Addresses
8
1MB
9
of Segments Address
10
Range
11
12
13
14
15
71
Physical Address Calculation Memory
Start of Code Segment
1 00000H
348A0H Data
Segment
IP = 4214H 3
4
Code Byte 38AB4H MOV AL, BL
Code
Segment
Extra
Segment
7 1MB
8 Address
9 Range
CS 348A0 H 10
11
IP + 4214 H 12
Physical Address 38AB4 H 13
14
15
Stack
72
Segment FFFFFH
Stack Segment (SS) Register
Stack Pointer (SP) Register
¾Upper 16-bits of the starting address of
stack segment is stored in SS register
¾It is located in BIU
¾SP register holds a 16-bit offset from the
start of stack segment to the top of the
stack
¾It is located in EU
73
Other Pointer & Index Registers
¾Base Pointer (BP) register
¾Source Index (SI) register
¾Destination Index (DI) register
¾Can be used for temporary storage of data
¾Main use is to hold a 16-bit offset of a data
word in one of the segments
74
ADDRESSING
MODES OF
8086
75
Various Addressing Modes
1. Immediate Addressing Mode
2. Register Addressing Mode
3. Direct Addressing Mode
4. Register Indirect Addressing Mode
5. Index Addressing Mode
6. Based Addressing Mode
7. Based & Indexed Addressing Mode
8. Based & Indexed with displacement Addressing
Mode
9. Strings Addressing Mode
76
1. IMMEDIATE ADDRESSING MODE
• The instruction will specify the name
of the register which holds the data
to be operated by the instruction.
Î AL=ABH, AH=10H
77
2.REGISTER ADDRESSING MODE
• In immediate addressing mode, an
8-bit or 16-bit data is specified as
part of the instruction
MOV AX,BL H
78
3. DIRECT ADDRESSING MODE
79
4. REGISTER INDIRECT ADDRESSING MODE
80
5.Indexed Addressing Mode
• Memory address is the sum of index
register plus displacement
MOV AX,[SI+2] AL [SI+2]; AH [SI+3]
JMP [DI+2] IP [BX+3:BX+2]
81
6. Based Addressing Mode
• Memory address is the sum of the BX or BP
base register plus a displacement within
instruction
• Ex:
MOV AX,[BP+2] AL [BP+2]; AH [BP+3]
JMP [BX+2] IP [BX+3:BX+2]
82
7.BASED & INDEX ADDRESSING MODES
83
8. BASED & INDEXED WITH DISPLACEMENT ADDRESSING MODE
84
9. Strings Addressing Mode
85
INSTRUCTION
SET of 8086
86
Instruction set basics
• Instruction:- An instruction is a binary pattern designed
inside a microprocessor to perform a specific function.
88
Types of instruction set of 8086
microprocessor
(1). Data Copy/Transfer instructions.
BEFORE AFTER
EXECUTION EXECUTION
A AL A AL
H H
B BL MOV CL,M B BL
H H
40 40
C CL C CL 40
H H
D DL D DL
H H 91
Stack Pointer
y It is a 16-bit register, contains the address of the data
item currently on top of the stack.
92
(2). Push Source
y Source can be register, segment register or
memory.
y This instruction pushes the contents of specified
source on to the stack.
y In this stack pointer is decremented by 2.
y The higher byte data is pushed first (SP-1).
y Then lower byte data is pushed (SP-2).
y E.g.:
y (1). PUSH AX;
y (2). PUSH DS;
y (3). PUSH [5000H];
93
INITIAL POSITION
(1) STACK
POINTER
DECREMENTS SP & STORES HIGHER
BYTE
94
BEFORE EXECUTION
SP 2002H
2000H
BH BL
2001H
CH 10 CL 50
DH DL 2002H
PUSH CX
AFTER EXECUTION
2000H 50
SP 2000H
BH BL
2001H 10
CH 10 CL 50
DH DL 2002H
95
(3) POP Destination
y Destination can be register, segment register or
memory.
y This instruction pops (takes) the contents of
specified destination.
y In this stack pointer is incremented by 2.
y The lower byte data is popped first (SP+1).
y Then higher byte data is popped (SP+2).
y E.g.
y (1). POP AX;
y (2). POP DS;
y (3). POP [5000H];
96
INITIAL POSITION AND READS LOWER
(1) STACK BYTE
POINTER LOWER BYTE
INCREMENTS SP
LOWER BYTE
HIGHER BYTE
(3) STACK
POINTER
97
BEFORE EXECUTION
2000H 30
SP 2000H
2001H 50
BH BL
2002H
POP BX
AFTER EXECUTION
2000H 30
SP 2002H 2001H 50
BH 5 BL 30 2002H
0 98
(4). XCHG Destination, source;
•E.g.
(1). XCHG BX, AX;
(2). XCHG [5000H],AX;
99
BEFORE EXECUTION AFTER EXECUTION
AH 20 AL 40 AH 70 AL 80
BH 70 BL 80 BH 20 BL 40
XCHG AX,BX
100
(5)IN AL/AX, 8-bit/16-bit port address
PORT 10 AL
80H
IN AL,80H
AFTER EXECUTION
PORT 10 AL 10
80H
102
OUT 8-bit/16-bit port address, AL/AX
PORT 10 AL 40
50H
OUT 50H,AL
AFTER EXECUTION
PORT 40 AL 40
50H
104
(7) XLAT
y Also known as translate instruction.
y It is used to find out codes in case of code conversion.
y i.e. it translates code of the key pressed to the
corresponding 7-segment code.
y After execution this instruction contents of AL register
always gets replaced.
y E.g. XLAT;
105
8.LEA 16-bit register (source), address (dest.)
y E.g.
(1). LEA BX,Address;
(2). LEA SI,Address[BX];
106
(9). LDS 16-bit register (source), address (dest.);
(10). LES 16-bit register (source), address (dest.);
y E.g.
(1). LDS BX,5000H;
(2). LES BX,5000H;
107
(1). LDS BX,5000H;
(2). LES BX,5000H;
15 0 7 0
BX 20 10 10 5000H
20
5001H
30 5002H
DS/ES 40 30
40 5003H
108
(11). LAHF:- This instruction loads the AH register
from the contents of lower byte of the flag register.
y This command is used to observe the status of the
all conditional flags of flag register.
E.g. LAHF;
109
PUSH & POP
(13). PUSH F:- This instruction decrements the
stack pointer by 2.
y It copies contents of flag register to the memory
location pointed by stack pointer.
y E.g. PUSH F;
y Addition,
y Subtraction,
y Increment,
y Decrement.
111
(2). Arithmetic Instructions
(1). ADD destination, source;
y This instruction adds the contents of source operand with
the contents of destination operand.
y The source may be immediate data, memory location or
register.
y The destination may be memory location or register.
y The result is stored in destination operand.
y AX is the default destination register.
112
AFTER EXECUTION
BEFORE EXECUTION
AH 30 AL 30
AH 10 AL 10 ADD AX,2020H
1010
+2020
3030
AH 10 AL 10 AH 30 AL 30
ADD AX,BX
BH 20 BL 20 BH 20 BL 20
113
ADC destination, source
y This instruction adds the contents of source
operand with the contents of destination operand
with carry flag bit.
y The source may be immediate data, memory
location or register.
y The destination may be memory location or
register.
y The result is stored in destination operand.
y AX is the default destination register.
114
(3) INC source
y This instruction increases the contents of source
operand by 1.
y The source may be memory location or register.
y The source can not be immediate data.
y The result is stored in the same place.
115
BEFORE EXECUTION AFTER EXECUTION
AH 10 AL 11 INC AX AH 10 AL 12
116
4. DEC source
y This instruction decreases the contents of
source operand by 1.
y The source may be memory location or register.
y The source can not be immediate data.
y The result is stored in the same place.
117
BEFORE EXECUTION AFTER EXECUTION
AH 10 AL 11 DEC AX AH 10 AL 10
118
(5) SUB destination, source;
y This instruction subtracts the contents of source
operand from contents of destination.
y The source may be immediate data, memory
location or register.
y The destination may be memory location or
register.
y The result is stored in the destination place.
AH 20 AL 00 SUB AX,1000H AH 10 AL 00
2000
-1000
1000
=1000
10
000
AH 20 AL 00 AH 10 AL 00
SUB AX,BX
BH 10 BL 00 BH 10 BL 00
120
(6). SBB destination, source;
y Also known as Subtract with Borrow.
y This instruction subtracts the contents of source
operand & borrow from contents of destination
operand.
y The source may be immediate data, memory
location or register.
y The destination may be memory location or
register.
y The result is stored in the destination place.
B 1 SBB AX,1000H
AH 20 AL 20 AH 10 AL 19
2020
- 1000
1020-
BEFORE EXECUTION 1=1019 AFTER EXECUTION
B 1
AH 20 AL 20 AH 10 AL 19
SBB AX,BX
BH 10 BL 10 BH 10 BL 10
2050
122
(7). CMP destination, source
y Also known as Compare.
y This instruction compares the contents of source
operand with the contents of destination operands.
y The source may be immediate data, memory
location or register.
y The destination may be memory location or
register.
y Then resulting carry & zero flag will be set or reset.
AH 10 AL 00
CMP AX,BX CY 0 Z 1
BH 10 BL 00
124
y AAA (ASCII Adjust after Addition):
y The data entered from the terminal is in ASCII format.
y In ASCII, 0 – 9 are represented by 30H – 39H.
y This instruction allows us to add the ASCII codes.
y This instruction does not have any operand.
126
MUL operand
y Unsigned Multiplication.
y Operand contents are positively signed.
y Operand may be general purpose register or memory
location.
y If operand is of 8-bit then multiply it with contents of AL.
y If operand is of 16-bit then multiply it with contents of AX.
y Result is stored in accumulator (AX).
127
IMUL operand
y Signed Multiplication.
y Operand contents are negatively signed.
y Operand may be general purpose register, memory location
or index register.
y If operand is of 8-bit then multiply it with contents of AL.
y If operand is of 16-bit then multiply it with contents of AX.
y Result is stored in accumulator (AX).
128
DIV operand
y Unsigned Division.
y Operand may be register or memory.
y Operand contents are positively signed.
y Operand may be general purpose register or
memory location.
y AL=AX/Operand (8-bit/16-bit) & AH=Remainder.
130
Multiplication and Division Examples
131
BEFORE EXECUTION
AH 00 AL 05
BH 00 BL 03
CH CL
AX=lower 16 bit {000F}
MUL BX DX=Higher 16 bit {0000}
AFTER EXECUTION 0005*0003 = 0000 000F
AH 00 AL 0F
BH BL
CH CL
DH 00 DL 00
132
BEFORE EXECUTION
AH 00 AL 0F
BH 00 BL 02
CH CL AX=Quotient {0007}
DX=Reminder {0001}
DIV BX 000F =7 1
AFTER EXECUTION 0002 2
AH 00 AL 07
BH BL
CH CL
DH 00 DL 01
133
134
135
136
LOGICAL (or) Bit Manipulation
Instructions
y These instructions are used at the bit level.
137
Bit Manipulation Instructions(LOGICAL Instructions)
• AND
– Especially used in clearing certain bits (masking)
xxxx xxxx AND 0000 1111 = 0000 xxxx
(clear the first four bits)
– Examples: AND BL, 0FH
• OR
– Used in setting certain bits
xxxx xxxx OR 0000 1111 = xxxx 1111
(Set the upper four bits)
138
y XOR
– Used in Inverting bits
139
AFTER EXECUTION
BEFORE EXECUTION
AH FF AL FF AH 11 AL 11
AND AX,BXH
BH 11 BL 11 BH 11 BL 11
140
AFTER EXECUTION
BEFORE EXECUTION
AH FF AL FF AH FF AL FF
OR AX,BXH
BH 11 BL 11 BH 11 BL 11
141
AFTER EXECUTION
BEFORE EXECUTION
AH FF AL FF AH EE AL EE
XOR AX,BXH
BH 11 BL 11 BH 11 BL 11
142
AFTER EXECUTION
BEFORE EXECUTION
AH FF AL FF AH 00 AL 00
NOT AXH
143
SHL Instruction
y The SHL (shift left) instruction performs a logical left shift
on the destination operand, filling the lowest bit with 0.
0
CF
mov dl,5d
shl dl,1
144
SHR Instruction
y The SHR (shift right) instruction performs a logical right shift
on the destination operand. The highest bit position is filled
with a zero.
0
CF
MOV DL,80d
SHR DL,1 ; DL = 40
SHR DL,2 ; DL = 10
145
SAR Instruction
y SAR (shift arithmetic right) performs a right
arithmetic shift on the destination operand.
CF
MOV DL,-80
SAR DL,1 ; DL = -40
SAR DL,2 ; DL = -10
146
Shifting left n bits multiplies the operand by 2n
For example, 5 * 22 = 20
For example, 80 / 23 = 10
147
ROL Instruction
y ROL (rotate) shifts each bit to the left
y The highest bit is copied into both the Carry flag
and into the lowest bit
y No bits are lost
CF
MOV Al,11110000b
ROL Al,1 ; AL = 11100001b
MOV Dl,3Fh
ROL Dl,4 ; DL = F3h
148
ROR Instruction
y ROR (rotate right) shifts each bit to the right
y The lowest bit is copied into both the Carry flag and
into the highest bit
y No bits are lost
CF
MOV AL,11110000b
ROR AL,1 ; AL = 01111000b
MOV DL,3Fh
ROR DL,4 ; DL = F3h
149
RCL Instruction
y RCL (rotate carry left) shifts each bit to the left
y Copies the Carry flag to the least significant bit
y Copies the most significant bit to the Carry flag
CF
CLC ; CF = 0
MOV BL,88H ; CF,BL = 0 10001000b
RCL BL,1 ; CF,BL = 1 00010000b
RCL BL,1 ; CF,BL = 0 00100001b
150
RCR Instruction
y RCR (rotate carry right) shifts each bit to the right
y Copies the Carry flag to the most significant bit
y Copies the least significant bit to the Carry flag
CF
STC ; CF = 1
MOV AH,10H ; CF,AH = 00010000 1
RCR AH,1 ; CF,AH = 10001000 0
151
SHL Instruction
y The SHL (shift left) instruction performs a logical left
shift on the destination operand, filling the lowest bit
with 0.
0
CF
BEFORE
EXECUTION
0 0 0 0 0 1 0 1 =05H
CF
=0AH
AFTER 0 0 0 0 0 1 0 1 0
EXECUTION
152
SHR Instruction
0
CF
BEFORE
EXECUTION
0 0 0 0 0 1 0 1 =05H
CF
AFTER 0 0 0 0 0 0 1 0
EXECUTION
1
=02H
153
ROL Instruction
CF
BEFORE
EXECUTION 0 0 0 0 0 1 0 1 =05H
CF
AFTER 0 0 0 0 0 1 0 1 0 =0AH
EXECUTION
154
ROR Instruction
CF
0 0 0 0 0 1 0 1 =05H
BEFORE
EXECUTION
CF
1 0 0 0 0 0 1 0 =82H
AFTER 1
EXECUTION
155
Branching Instructions (or)
Program Execution Transfer
Instructions
y These instructions cause change in the sequence of the execution
of instruction.
y This change can be through a condition or sometimes
unconditional.
y The conditions are represented by flags.
156
y CALL Des:
y RET:
157
SUBROUTINE & SUBROUTINE HANDILING INSTRUCTIONS
Main program
Subroutine A
First Instruction
Call subroutine A
Next instruction
Return
Call subroutine A
Next instruction
158
y JMP Des:
159
Conditional Jump Table
Mnemonic Meaning
JA Jump if Above
JAE Jump if Above or Equal
JB Jump if Below
JBE Jump if Below or Equal
JC Jump if Carry
JE Jump if Equal
JNC Jump if Not Carry
JNE Jump if Not Equal
JNZ Jump if Not Zero
JPE Jump if Parity Even
JPO Jump if Parity Odd
JZ Jump if Zero
160
y Loop Des:
161
String Instructions
y String in assembly language is just a sequentially stored bytes or
words.
y There are very strong set of string instructions in 8086.
162
y CMPS Des, Src:
y SCAS String:
y It scans a string.
163
y MOVS / MOVSB / MOVSW:
164
1. Copying a string (MOV SB)
MOV CX,0003 copy 3 memory locations
MOV SI,1000
MOV DI,2000
L1 CLD
MOV SB
DEC CX decrement CX
JNZ L1
HLT
165
2. Find & Replace
166
y REP (Repeat):
167
Processor Control Instructions
y These instructions control the processor itself.
168
¾STC
y It sets the carry flag to 1.
¾CLC
y It clears the carry flag to 0.
¾CMC
y It complements the carry flag.
169
¾STD:
y It sets the direction flag to 1.
¾CLD:
y It clears the direction flag to 0.
170
¾ HLT instruction – HALT processing
The HLT instruction will cause the 8086 to stop fetching and
executing instructions.
¾NOP instruction
this instruction simply takes up three clock cycles and does no
processing.
¾LOCK instruction
this is a prefix to an instruction. This prefix makes sure that during
execution of the instruction, control of system bus is not taken by other
microprocessor.
¾WAIT instruction
this instruction takes 8086 to an idle condition. The CPU
will not do any processing during this.
171
INSTRUCTION SET-summary
1.DATA TRANSFER INSTRUCTIONS
Mnemonic Meaning Format Operation
ADC Add with carry ADC D,S (S)+(D)+(CF) Æ (D) carry Æ (CF)
174
Shift & Rotate Instructions
Mnemonic Meaning Format
SAL/SHL Shift arithmetic Left/ SAL/SHL D, Count
Shift Logical left
176
5. STRING INSTRUCTIONS
• CMPS Des, Src - compares the string bytes
• SCAS String - scans a string
• MOVS / MOVSB / MOVSW - moving of byte or
word
• REP (Repeat) - repetition of the instruction
177
6. PROCESSOR CONTROL INSTRUCTIONS
• STC – set the carry flag (CF=1)
• CLC – clear the carry flag (CF=0)
• STD – set the direction flag (DF=1)
• CLD – clear the direction flag (DF=0)
• HLT – stop fetching & execution
• NOP – no operation(no processing)
• LOCK - control of system bus is not taken by other μP
• WAIT - CPU will not do any processing
• ESC - μP does NOP or access a data from memory for coprocessor
178
Assembler
Directives
ASSUME,END,ENDP,EQU,EVEN,DD – 8 mark
179
Directives Expansion
180
• ASSUME Directive - The ASSUME directive is
used to tell the assembler that the name of
the logical segment should be used for a
specified segment.
• DB(define byte) - DB directive is used to
declare a byte type variable or to store a byte
in memory location.
• DW(define word) - The DW directive is used
to define a variable of type word or to reserve
storage location of type word in memory.
181
• DD(define double word) :This directive is used
to declare a variable of type double word or
restore memory locations which can be
accessed as type double word.
• DQ (define quadword) :This directive is used
to tell the assembler to declare a variable 4
words in length or to reserve 4 words of
storage in memory .
• DT (define ten bytes):It is used to inform the
assembler to define a variable which is 10
bytes in length or to reserve 10 bytes of
storage in memory.
182
• END- End program .This directive indicates the
assembler that this is the end of the program
module. The assembler ignores any
statements after an END directive.
• ENDP- End procedure: It indicates the end of
the procedure (subroutine) to the assembler.
• ENDS-End Segment: This directive is used with
the name of the segment to indicate the end
of that logical segment.
• EQU - This EQU directive is used to give a
name to some value or to a symbol.
183
• PROC - The PROC directive is used to identify
the start of a procedure.
• PTR -This PTR operator is used to assign a
specific type of a variable or to a label.
• ORG -Originate : The ORG statement
changes the starting offset address of the
data.
184
Directives examples
• ASSUME CS:CODE cs=> code segment
• ORG 3000
• NAME DB ‘THOMAS’
• POINTER DD 12341234H
• FACTOR EQU 03H
185
Assembly Language
Programming(ALP)
8086
186
Program 1: Increment an 8-bit number
187
Program 3: Decrement an 8-bit number
188
Program 5: 1’s complement of an 8-bit number.
189
Program 7: 2’s complement of an 8-bit number.
• MOV AL, 05H Move 8-bit data to AL.
• NOT AL Complement AL.
• INC AL Increment AL
After Execution AX = FAH + 1 = FB
Program 8: 2’s complement of a 16-bit
number.
• MOV AX, 0005H Move 16-bit data to AX.
• NOT AX Complement AX.
• INC AX Increment AX
After Execution AX = FFFAH + 1 = FFFB
190
Program 9: Add two 8-bit numbers
MOV AL, 05H Move 1st 8-bit number to AL.
MOV BL, 03H Move 2nd 8-bit number to BL.
ADD AL, BL Add BL with AL.
After Execution AL = 08H
191
Program 11: subtract two 8-bit numbers
MOV AL, 05H Move 1st 8-bit number to AL.
MOV BL, 03H Move 2nd 8-bit number to BL.
SUB AL, BL subtract BL from AL.
After Execution AL = 02H
193
Program 15: Multiply two 16-bit unsigned
numbers.
MOV AX, 0004H Move 1st 16-bit number to AL.
MOV BX, 0002H Move 2nd 16-bit number to BL.
MUL BX Multiply BX with AX and the result will
be in DX:AX {4*2=0008=> 08=> AX , 00=> DX}
194
Detailed coding
16 BIT ADDITION
195
Detailed coding
16 BIT SUBTRACTION
196
16 BIT MULTIPLICATION
197
16 BIT DIVISION
198
SUM of N numbers
MOV AX,0000
MOV SI,1100
MOV DI,1200
MOV CX,0005 5 NUMBERS TO BE TAKEN SUM
MOV DX,0000
L1: ADD AX,[SI]
INC SI
INC DX
CMP CX,DX
JNZ L1
MOV [1200],AX
HLT 199
Average of N numbers
MOV AX,0000
MOV SI,1100
MOV DI,1200
MOV CX,0005 5 NUMBERS TO BE TAKEN AVERAGE
MOV DX,0000
L1: ADD AX,[SI]
INC SI
INC DX
CMP CX,DX
JNZ L1
DIV CX AX=AX/5(AVERAGE OF 5 NUMBERS)
MOV [1200],AX
HLT
FACTORIAL of N
MOV CX,0005 5 Factorial=5*4*3*2*1=120
MOV DX,0000
MOV AX,0001
L1: MUL CX
DEC DX
CMP CX,DX
JNZ L1
MOV [1200],AX
HLT
201
ASCENDING ORDER
202
203
DECENDING ORDER
205
LARGEST NUMBER
206
SMALLEST NUMBER
207
Modular
Programming
208
• Generally , industry-programming projects consist
of thousands of lines of instructions or operation
code.
• The size of the modules are reduced to a humanly
comprehensible and manageable level.
• Program is composed from several smaller
modules. Modules could be developed by
separate teams concurrently.OBJ modules
(Object modules).
• The .OBJ modules so produced are combined
using a LINK program.
• Modular programming techniques simplify the
software development process
209
CHARACTERISTICS of module:
1. Each module is independent of other modules.
2. Each module has one input and one output.
3. A module is small in size.
4. Programming a single function per module is a goal
Advantages of Modular Programming:
• It is easy to write, test and debug a module.
• Code can be reused.
• The programmer can divide tasks.
• Re-usable Modules can be re-used within a program
DRAWBACKS:
Modular programming requires extra time and memory
210
MODULAR PROGRAMMING:
1.LINKING & RELOCATION
2.STACKS
3.Procedures
4.Interrupts & Interrupt Routines
5.Macros
211
LINKING &
RELOCATION
212
LINKER
• A linker is a program used to join together several
object files into one large object file.
• The linker produces a link file which contains the
binary codes for all the combined modules.
213
• The loader is a part of the operating system
and places codes into the memory after
reading the ‘.exe’ file
• A program called locator reallocates the
linked file and creates a file for permanent
location of codes in a standard format.
214
Creation and execution of a program
215
Loader
->Loader is a utility program which takes object code as
input prepares it for execution and loads the
executable code into the memory .
->Loader is actually responsible for initializing the
process of execution.
Functions of loaders:
1.It allocates the space for program in the memory(Allocation)
2.It resolves the code between the object modules(Linking)
3. some address dependent locations in the program, address constants
must be adjusted according to allocated space(Relocation)
4. It also places all the machine instructions and data of corresponding
programs and subroutines into the memory .(Loading)
216
Relocating loader (BSS Loader)
• When a single subroutine is changed then all
the subroutine needs to be reassembled.
• The binary symbolic subroutine (BSS) loader
used in IBM 7094 machine is relocating loader.
• In BSS loader there are many procedure
segments
• The assembler reads one sourced program
and assembles each procedure segment
independently
217
• The output of the relocating loader is the object program
• The assembler takes the source program as input; this source
program may call some external routines.
SEGMENT COMBINATION:
ASM-86 assembler regulating the way segments with the
same name are concatenated & sometimes they are overlaid.
Form of segment directive:
Segment name SEGEMENT Combine-type
Possible combine-type are:
• PUBLIC
• COMMON
• STACK
• AT
• MEMORY
218
Procedures
CALL & RET instruction
219
• Procedure is a part of code that can be called from
your program in order to make some specific task.
Procedures make program more structural and
easier to understand.
• syntax for procedure declaration:
name PROC
…………. ; here goes the code
…………. ; of the procedure ...
RET
name ENDP
here PROC is the procedure name.(used in top & bottom)
RET - used to return from OS. CALL-call a procedure
PROC & ENDP – complier directives
CALL & RET - instructions 220
EXAMPLE 1 (call a procedure)
ORG 100h
CALL m1
MOV AX, 2
RET ; return to operating system.
m1 PROC
MOV BX, 5
RET ; return to caller.
m1 ENDP
END
• The above example calls procedure m1, does MOV BX, 5 &
returns to the next instruction after CALL: MOV AX, 2.
221
Example 2 : several ways to pass
parameters to procedure
ORG 100h
MOV AL, 1
MOV BL, 2
CALL m2
CALL m2
CALL m2
CALL m2
RET ; return to operating system.
m2 PROC
MUL BL ; AX = AL * BL.
RET ; return to caller.
m2 ENDP
value of AL register is update every time the
END procedure is called.
final result in AX register is 16 (or 10h)
PUSH & POP instruction
223
• Stack is an area of memory for keeping
temporary data.
• STACK is used by CALL & RET instructions.
PUSH -stores 16 bit value in the stack.
POP -gets 16 bit value from the stack.
• PUSH and POP instruction are especially useful
because we don't have too much registers to operate
1. Store original value of the register in stack (using
PUSH).
2. Use the register for any purpose.
3. Restore the original value of the register from stack
(using POP).
224
Example-1 (store value in STACK using
PUSH & POP)
ORG 100h
MOV AX, 1234h
PUSH AX ; store value of AX in stack.
MOV AX, 5678h ; modify the AX value.
POP AX ; restore the original value of AX.
RET
END
225
Example 2: use of the stack is for
exchanging the values
ORG 100h
MOV AX, 1212h ; store 1212h in AX.
MOV BX, 3434h ; store 3434h in BX
PUSH AX ; store value of AX in stack.
PUSH BX ; store value of BX in stack.
POP AX ; set AX to original value of BX.
POP BX ; set BX to original value of AX.
RET
END
push 1212h and then 3434h, on pop we will
first get 3434h and only after it 1212h 226
MACROS
How to pass parameters using macros-6/8 Mark
227
• Macros are just like procedures, but not really.
• Macros exist only until your code is compiled
• After compilation all macros are replaced with
real instructions
• several macros to make coding easier(Reduce
large & complex programs)
Example (Macro definition)
name MACRO [parameters,...]
<instructions>
ENDM
228
Example1 : Macro Definitions
SAVE MACRO definition of MACRO name SAVE
PUSH AX
PUSH BX
PUSH CX
ENDM
229
230
MACROS with Parameters
Example:
COPY MACRO x, y ; macro named COPY with
2 parameters{x, y}
PUSH AX
MOV AX, x
MOV y, AX
POP AX
ENDM
231
INTERRUPTS
&
INTERRUPT SERVICE
ROUTINE(ISR)
232
INTERRUPT & ISR ?
• ‘Interrupts’ is to break the sequence of
operation.
• While the CPU is executing a program, on
‘interrupt’ breaks the normal sequence of
execution of instructions, diverts its execution
to some other program called Interrupt
Service Routine (ISR)
233
234
235
236
• Maskable Interrupt: An Interrupt that can be
disabled or ignored by the instructions of CPU
are called as Maskable Interrupt.
• Non- Maskable Interrupt: An interrupt that
cannot be disabled or ignored by the instructions
of CPU are called as Non- Maskable Interrupt.
• Software interrupts are machine instructions
that amount to a call to the designated interrupt
subroutine, usually identified by interrupt
number. Ex: INT0 - INT255
237
238
239
240
241
242
INTERRUPT VECTOR TABLE
NMI(INT2)
INTR
245
Byte &
String
Manipulation
246
Move, compare, store, load, scan
247
Byte Manipulation
Example 3:
Example 1:
MOV AX,[1000]
MOV AX,[1000]
MOV BX,[1002]
MOV BX,[1002]
AND AX,BX XOR AX,BX
MOV [2000],AX MOV [2000],AX
HLT HLT
Example 2: Example 4:
MOV AX,[1000]
MOV AX,[1000]
MOV BX,[1002]
OR AX,BX
NOT AX
MOV [2000],AX MOV [2000],AX
HLT HLT
248
STRING MANIPULATION
1. Copying a string (MOV SB)
MOV CX,0003 copy 3 memory locations
MOV SI,1000
MOV DI,2000
L1 CLD
MOV SB
DEC CX decrement CX
JNZ L1
HLT
249
2. Find & Replace
250