CC
Call Conditionally
7-60
Syntax
CC
pma, cond
Ă
1 [,
cond
Ă
2] [,...]
Operands
pma:
16-bit program-memory address
cond
Condition
EQ
ACC = 0
NEQ
ACC
≠
0
LT
ACC < 0
LEQ
ACC
≤
0
GT
ACC > 0
GEQ
ACC
≥
0
NC
C = 0
C
C = 1
NOV
OV = 0
OV
OV = 1
BIO
BIO low
NTC
TC = 0
TC
TC = 1
UNC
Unconditionally
Opcode
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
ZLVC
ZLVC
TP
0
1
0
1
1
1
pma
Note:
The TP and ZLVC fields are defined on pages 7-3 and 7-4.
Execution
If
cond
Ă
1
AND cond
Ă
2
AND ...
Then
PC + 2
→
TOS
pma
→
PC
Else
Increment PC
Status Bits
None
Description
Control is passed to the specified program-memory address (pma) if the speci-
fied conditions are met. Not all combinations of conditions are meaningful. For
example, testing for LT and GT is contradictory. In addition, testing BIO is mu-
tually exclusive to testing TC. The CC instruction operates like the CALL in-
struction if all conditions are true.
Words
2
Cycles for a Single CC Instruction
Condition
ROM
DARAM
SARAM
External
True
4
4
4
4+4p
†
False
2
2
2
2+2p
† The processor performs speculative fetching by reading two additional instruction words. If the
PC discontinuity is taken these two instruction words are discarded.
Cycles