Ch.

3
Jump, Loop, and Call

Yongjun Park
Hanyang University

Hanyang University
Division of Computer Science & Engineering
 Outline
• Loop and Jump Instructions

• Call instructions

• Time delay

Hanyang University
2
Division of Computer Science & Engineering
 Loop: DJNZ
• DJNZ (decrease jump not zero)
– DJNZ reg, label
• Decrement the reg by 1 (‘D’)
• If reg is not zero (‘NZ’), jump (‘J’) to the line specified by label;
otherwise exit the loop
– Example (Demo loop)
MOV A, #0
MOV R2, #4
AGAIN: ADD A, #03
DJNZ R2, AGAIN ; reg: R2, label: AGAIN
MOV R5, A
Loop 1 2 3 4
R2
A
– The Maximum value that can be held in R2:
Hanyang University
Division of Computer Science & Engineering
 Loop: DJNZ
• Loop inside a loop
– More loops can be achieved by embedding one loop inside
another loop
– Example
MOV R1, #0H
MOV A, #55H
MOV R3, #3H
LOOP2: MOV R2, #2H
LOOP1: CPL A ; complement A register
INC R1 ; increment R1 by 1
DJNZ R2, LOOP1 ; jump back to LOOP1 if R2 - 1 is not zero
DJNZ R3, LOOP2 ; jump back to LOOP2 if R3 – 1 is not zero

– There are totally 2 x 3 = 6 loops

Hanyang University
Division of Computer Science & Engineering
 Loop: Conditional Jump Instructions
• JZ (jump if A = 0)
– JZ label
– Example:
MOV A, #0FEH
ADD A, #1H
JZ OVER
ADD A, #1H
JZ OVER
ADD A, #1H
JZ OVER
OVER: MOV R0, #0H

– Note: JZ can only be used to test register A

Hanyang University
Division of Computer Science & Engineering
 Loop: Conditional Jump Instructions
• JNZ (jump if A ≠ 0)
– JNZ label
– Example
Write a program to determine if R5 contains 0:
If so, put 55H in it; otherwise do nothing(NOP)

MOV A, R5
JNZ NEXT
MOV R5, #55H
NEXT: NOP ; no operation

Hanyang University
Division of Computer Science & Engineering
 Loop: Conditional Jump Instructions
• JNC (jump if no carry)
– JNC label
• Jump to label if no carry (CY = 0)
– Example (next slide)

Hanyang University
Division of Computer Science & Engineering
 Loop: Conditional Jump Instructions
• JNC (Cont’d)
– Example
Find the sum of 79H, F5H, and E2H:
Put the sum in register R0(low byte) and R5(high byte)
MOV A, #0
MOV R0, A
MOV R5, A
MOV A, #79H ; A = A + 79H = 79H
ADD A, #0F5H ; A = 79H + F5H
JNC N2 ; if CY = 0, jump to the next summation
INC R5 ; if CY = 1, increment R5 to record the carry
N2: ADD A, #0E2H ; A = A + E2H
JNC N3 ; if CY = 0, increment R5 to record the carry
INC R5
N3: MOV R0, A
NOP

Hanyang University
Division of Computer Science & Engineering
 Loop: Short Jump
• All conditional jumps are short jump
– Short jump: the address of the target must be within
-128 to +127 bytes of the current PC
• E.g.

– Why from -128 to +127?

• Opcode of JZ: 01100000 xxxxxxxx (offset)
• Offset = address of target – PC at JZ (PC + 2, in the example, 4)
• The offset is limited to 8 bits (from -128 to +127)
• The length of short jump instructions is 2 bytes
• If we want to jump further, we need more bits to represent the offset
Hanyang University
Division of Computer Science & Engineering
 Loop: Short Jump
• Example
– Find the offset of the forward jump instructions

Hanyang University
Division of Computer Science & Engineering
 Loop: Unconditional Jump
• LJMP (long jump)
– LJMP label
• Jump to anywhere in the program
– Opcode (3 bytes)
• 00000010 A15-A8 A7-A0
• The 2nd and 3rd bytes represent the absolute address in ROM
• Review: PC has 16 bits → ROM address range is 0000 - FFFFH →
16 bits are enough to label any address in ROM
– Example
ORG 0H
LJMP FARAWAY ; opcode 02F000H
ORG 0F000H
FARAWAY: MOV A, 55H

Hanyang University
Division of Computer Science & Engineering
 Loop: Unconditional Jump
• SJMP (short jump)
– SJMP label
• Jump to an address within -128 - +127 of current PC
– Opcode (2 bytes)
• 10000000 xxxxxxxxx (offset)
• The calculation of offset is the same as conditional jumps (JZ, JNC, …)
– Example (next slide)
ORG 0H
SJMP TAGT1 ; opcode 80xxH
MOV A, #0 ; opcode 7400H
ORG 10
TAGT1: SJMP TAGT2 ; opcode 80yyH
MOV A, #0
ORG 35
TAGT2: MOV A, #55H
Hanyang University
Division of Computer Science & Engineering
 Loop: Unconditional Jump
• SJMP (Cont’d)
– Example
Find the offset of the SJMP instructions (xx, yy in comments)
ORG 0H
SJMP TAGT1 ; opcode 80xxH
MOV A, #0 ; opcode 7400H
ORG 10
TAGT1: SJMP TAGT2 ; opcode 80yyH
MOV A, #0
ORG 35
TAGT2: MOV A, #55H

– What will happen if the target is out of the range of

[-128, 127] of current PC?

Hanyang University
Division of Computer Science & Engineering
 Outline
• Loop and Jump Instructions

• Call instructions

• Time delay

Hanyang University
14
Division of Computer Science & Engineering
 Call Instructions
• Subroutine
– A section of code that can perform a specific task
(E.g. introduce a certain amount of delay)
– If a task needs to be performed frequently, it’s better to
structure the corresponding codes as a subroutine
• Save memory space
• Better program structure
– Subroutines are invoked by call instructions

Hanyang University
Division of Computer Science & Engineering
 Call Instructions
• There are two call instructions in 8051
– LCALL (3-byte instruction)
• 16 bits(2 bytes) are used to represent target address
• Long call, the subroutine can be placed anywhere in the ROM
– ACALL (2-byte instruction)
• Absolute call
• Only 11 bits are used to represent target address
– The target address must be within 2K bytes of ACALL

Hanyang University
Division of Computer Science & Engineering
 Call: LCALL
• LCALL
– Long call, 3-byte instruction
– Opcode: 00010010 A15-A8 A7-A0
• Last 2 bytes are used to represent target address
– Can be used to call subroutines located anywhere within the
64KB of the ROM
– Example

Hanyang University
Division of Computer Science & Engineering
 Call: Call and Stack
• Call instructions and Stack

Hanyang University
Division of Computer Science & Engineering
 Call: Call and Stack
• Call instructions and Stack
– After ‘LCALL’ is executed, the PC is changed to the starting
address of the subroutine
• E.g. after LCALL, PC points to address 0300H
– After the subroutine is done(‘RET’ is executed), the PC goes
back to the instruction that follows ‘LCALL’
• E.g. after RET, PC points back to address 0007H (‘MOV A, #0AAH’)
– How does the CPU know where the PC should point to after
the subroutine?
• Before loading the PC with the address of the subroutine(0300H), the
CPU automatically push the address of the next instruction into stack
• After RET is executed, the CPU automatically pop the address back to PC

Hanyang University
Division of Computer Science & Engineering
 Call: Call and Stack
• Call instructions and Stack (Cont’d)
– Each address is 16 bits (Recall: PC is a 16-bit register)
• Each PUSH can put in 8 bits → 2 PUSH instructions are used
• Similarly, 2 POP instructions are used to restore the address to PC
– If you use stack in a subroutine, you MUST use EQUAL number
of PUSH and POP
• Unequal number of PUSH and POP will result in a wrong value being
restored (Demo LCALL)
• When you exit a subroutine, the SP should always point to the
return address of the subroutine

Hanyang University
Division of Computer Science & Engineering
 Call: Call and Stack
• Example
– Analyze the contents of the stack and PC

Hanyang University
Division of Computer Science & Engineering
 Call: ACALL
• ACALL
– Absolute call, 2-byte instruction
– 11 bits are used to represent address offset
• The target address must be within 2K bytes of the address of ACALL
– The ONLY difference between ACALL and LCALL is the limit on
target address
• LCALL: 16 bits used to represent address offset
– Target can be anywhere within 64K bytes
• ACALL: 11 bits used to represent address offset
– Target needs to be within 2K bytes of the address of ACALL
– Using ACALL will save 1 byte of memory space

Hanyang University
Division of Computer Science & Engineering
 Outline
• Loop and Jump Instructions

• Call instructions

• Time delay

Hanyang University
23
Division of Computer Science & Engineering
 Delay: Clock vs. Machine Cycle
• Terminology
– Clock
• A crystal oscillator is connected to 8051 to provide clock source for 8051
• Typical clock frequency (f): 11.0592MHz, 16MHz, 20MHz
• Oscillator period (T):
– Machine cycle
• A basic operation performed by CPU to execute an instruction
• Original 8051: 1 Machine cycle = 12 oscillator periods
• DS89C450: 1 Machine cycle = 1 oscillator periods
• Different instructions require different number of MC
– E.g. original 8051
» 1 MC: ADD, MOV R3, A 2 MC: MOV 08, A 4 MC: MUL, DIV
• Machine cycle can be found at Table A-1 in Appendix A
• It takes different amount of time to execute different instructions
Hanyang University
Division of Computer Science & Engineering
 Delay
• Example
– For an 8051 system with 1 MC = 12 oscillator periods
– If the clock frequency is 11.0592MHz,
• What is the duration of 1 MC?
• Find how long it takes to execute
each of the following instructions
– MOV R3, #data
– MOV P3, R1
– NOP
– DJNZ R2, AGAIN

Hanyang University
25
Division of Computer Science & Engineering
 Delay: Loop
• Example
– For an 8051 system with 1 MC = 12 oscillator periods
– If the clock frequency is 11.0592MHz, find the delay incurred
by the subroutine

ORG 300H
DELAY: MOV R3, #200 ; 1 MC
HERE: DJNZ R3, HERE ; 2 MC
RET ; 2 MC

Hanyang University
26
Division of Computer Science & Engineering
 Delay: DS89C450
• DS89C450
– 1 MC = 1 oscillator clock period
– The machine cycles for all instructions can be found in the
user guide of DS89C4x0

– Example:
• A 89C450 is connected to an oscillator with frequency 11.0592MHz, find
how long it takes to execute the following instruction
– MOV R3, #55
– DJNZ R2, TARGET

Hanyang University
27
Division of Computer Science & Engineering
 Delay: Embedded Loops
• Example
– A DS89C450 is connected to a 11.0592MHz XTAL,
find the time delay in the following subroutine

DELAY: ; Machine cycle

MOV R2, #200 ;2
AGAIN: MOV R3, #250 ;2
HERE: NOP ;1
NOP ;1
DJNZ R3, HERE ;4
DJNZ R2, AGAIN ;4
RET ;3

Hanyang University
Division of Computer Science & Engineering
 Delay: Loop
• Example
– Write a program to toggle all the bits of P1 every 200ms
(55H → AAH → …) with DS89C450 and 11.0592MHz XTAL

MOV R1, #9
A1: MOV R2, #242
A2: MOV R3, #355
A3: DJNZ R3, A3
DJNZ R2, A2
DJNZ R1, A1

Hanyang University
29
Division of Computer Science & Engineering