MB90610A Series
Table 18 Branch 1 Instructions [31 Instructions]
Mnemonic
#
~
RG
B
Operation
LH AH
I
S
T
N
Z
V
C RMW
1
BZ/BEQ
rel
rel
rel
rel
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Branch when (Z) = 1
Branch when (Z) = 0
Branch when (C) = 1
Branch when (C) = 0
Branch when (N) = 1
Branch when (N) = 0
Branch when (V) = 1
Branch when (V) = 0
Branch when (T) = 1
Branch when (T) = 0
Branch when (V) xor (N) = 1
Branch when (V) xor (N) = 0
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
*
1
BNZ/BNE
BC/BLO
*
1
*
1
BNC/BHS
*
1
BN
rel
*
1
BP
rel
rel
rel
rel
rel
rel
rel
rel
rel
rel
rel
rel
*
1
BV
*
1
BNV
BT
*
1
*
BNT
BLT
BGE
BLE
BGT
BLS
BHI
BRA
1
*
1
*
1
*
Branch when ((V) xor (N)) or (Z) = 1 –
Branch when ((V) xor (N)) or (Z) = 0 –
1
*
1
*
Branch when (C) or (Z) = 1
Branch when (C) or (Z) = 0
Branch unconditionally
–
–
–
1
*
1
*
1
*
JMP
JMP
JMP
JMP
@A
1
3
0
0
1
0
2
0
0
0
0
0
word (PC) ← (A)
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
2
addr16
@ear
word (PC) ← addr16
word (PC) ← (ear)
3
3
2
@eam
2+
2
2+
4
(c) word (PC) ← (eam)
4+(a)
5
6+(a)
4
JMPP @ear *3
JMPP @eam *3
JMPP addr24
0
word (PC) ← (ear), (PCB) ← (ear +2)
(d) word (PC) ←(eam), (PCB) ←(eam +2)
0
word (PC) ← ad24 0 to 15,
(PCB) ← ad24 16 to 23
@ear *4
2
2+
3
1
2
1
0
0
0
2
(c) word (PC) ← (ear)
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
CALL
CALL
CALL
6
7+(a)
6
7
10
@eam *4
addr16 *5
2×(c) word (PC) ← (eam)
(c) word (PC) ← addr16
2×(c) Vector call instruction
2×(c) word (PC) ← (ear) 0 to 15
CALLV #vct4 *5
CALLP @ear *6
(PCB) ← (ear) 16 to 23
2
CALLP @eam *6
CALLP addr24 *7
2+
4
0
0
word (PC) ← (eam) 0 to 15
(PCB) ← (eam) 16 to 23
word (PC) ← addr0 to 15,
(PCB) ← addr16 to 23
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
–
*
11+(a)
10
2×(c)
*1: 4 when branching, 3 when not branching.
*2: (b) + 3 × (c)
*3: Read (word) branch address.
*4: W: Save (word) to stack; R: read (word) branch address.
*5: Save (word) to stack.
*6: W: Save (long word) to W stack; R: read (long word) R branch address.
*7: Save (long word) to stack.
Note: Foranexplanationof“(a)”to“(d)”, refertoTable4, “NumberofExecutionCyclesforEachTypeofAddressing,”
and Table 5, “Correction Values for Number of Cycles Used to Calculate Number of Actual Cycles.”
84
FUJITSU [ FUJITSU ]
