MB90660A Series
Table 9 Addition and Subtraction Instructions (Byte/Word/Long Word) [42 Instructions]
Mnemonic
# ~ RG B
Operation
LH AH I S T N Z V C RMW
ADD A,#imm8
ADD
A, dir
ADD
A, ear
ADD
A, eam
ADD
ear, A
ADD
eam, A
ADDC A
ADDC A, ear
ADDC A, eam
ADDDC A
SUB A, #imm8
SUB
A, dir
SUB
A, ear
SUB
A, eam
SUB
ear, A
SUB
eam, A
SUBC A
SUBC A, ear
SUBC A, eam
SUBDC A
2
2
0
0 byte (A) ← (A) +imm8
Z––––* * * * –
2
5
0 (b) byte (A) ← (A) +(dir)
Z––––* * * * –
2
3
1
0 byte (A) ← (A) +(ear)
Z––––* * * * –
2+ 4+ (a) 0 (b) byte (A) ← (A) +(eam)
Z––––* * * * –
2
3
2
0 byte (ear) ← (ear) + (A)
–––––* * * * –
2+ 5+ (a) 0 2× (b) byte (eam) ← (eam) + (A)
Z––––* * * * *
1
2
0
0 byte (A) ← (AH) + (AL) + (C)
Z––––* * * * –
2
3
1
0 byte (A) ← (A) + (ear) + (C)
Z––––* * * * –
2+ 4+ (a) 0 (b) byte (A) ← (A) + (eam) + (C)
Z––––* * * * –
1
3
0
0 byte (A) ← (AH) + (AL) + (C) (decimal) Z – – – – * * * * –
2
2
0
0 byte (A) ← (A) –imm8
Z––––* * * * –
2
5
0 (b) byte (A) ← (A) – (dir)
Z––––* * * * –
2
3
1
0 byte (A) ← (A) – (ear)
Z––––* * * * –
2+ 4+ (a) 0 (b) byte (A) ← (A) – (eam)
Z––––* * * * –
2
3
2
0 byte (ear) ← (ear) – (A)
–––––* * * * –
2+ 5+ (a) 0 2× (b) byte (eam) ← (eam) – (A)
–––––* * * * *
1
2
0
0 byte (A) ← (AH) – (AL) – (C)
Z––––* * * * –
2
3
1
0 byte (A) ← (A) – (ear) – (C)
Z––––* * * * –
2+ 4+ (a) 0 (b) byte (A) ← (A) – (eam) – (C)
Z––––* * * * –
1
3
0
0 byte (A) ← (AH) – (AL) – (C) (decimal) Z – – – – * * * * –
ADDW A
1
2
0
0 word (A) ← (AH) + (AL)
ADDW A, ear
2
3
1
0 word (A) ← (A) +(ear)
ADDW A, eam
2+ 4+ (a) 0 (c) word (A) ← (A) +(eam)
ADDW A, #imm16 3
2
0
0 word (A) ← (A) +imm16
ADDW ear, A
2
3
2
0 word (ear) ← (ear) + (A)
ADDW eam, A
2+ 5+ (a) 0 2× (c) word (eam) ← (eam) + (A)
ADDCW A, ear
2
3
1
0 word (A) ← (A) + (ear) + (C)
ADDCW A, eam
2+ 4+ (a) 0 (c) word (A) ← (A) + (eam) + (C)
SUBW A
1
2
0
0 word (A) ← (AH) – (AL)
SUBW A, ear
2
3
1
0 word (A) ← (A) – (ear)
SUBW A, eam
2+ 4+ (a) 0 (c) word (A) ← (A) – (eam)
SUBW A, #imm16 3
2
0
0 word (A) ← (A) –imm16
SUBW ear, A
2
3
2
0 word (ear) ← (ear) – (A)
SUBW eam, A
2+ 5+ (a) 0 2× (c) word (eam) ← (eam) – (A)
SUBCW A, ear
2
3
1
0 word (A) ← (A) – (ear) – (C)
SUBCW A, eam
2+ 4+ (a) 0 (c) word (A) ← (A) – (eam) – (C)
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * *
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * *
–––––* * * * –
–––––* * * * –
ADDL A, ear
2
6
2
ADDL A, eam
2+ 7+ (a) 0
ADDL A, #imm32 5
4
0
SUBL A, ear
2
6
2
SUBL A, eam
2+ 7+ (a) 0
SUBL A, #imm32 5
4
0
0 long (A) ← (A) + (ear)
(d) long (A) ← (A) + (eam)
0 long (A) ← (A) +imm32
0 long (A) ← (A) – (ear)
(d) long (A) ← (A) – (eam)
0 long (A) ← (A) –imm32
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
–––––* * * * –
Note: For an explanation of “(a)” to “(d)”, refer to Table 4, “Number of Execution Cycles for Each Type of Addressing,”
and Table 5, “Correction Values for Number of Cycles Used to Calculate Number of Actual Cycles.”
69