CDP1802AC/3

FN1441 Rev 3.00

Page 22 of 27

October 17, 2008

INPUT 6

INP 6

6E

BUS

 M(R(X)); BUS  D; N LINES = 6

INPUT 7

INP 7

6F

BUS

 M(R(X)); BUS  D; N LINES = 7

NOTES: (For Table 4)

11. The arithmetic operations and the shift instructions are the only instructions that can alter the DF.

After an add instruction:

DF = 1 denotes a carry has occurred

DF = 0 Denotes a carry has not occurred

After a subtract instruction:

DF = 1 denotes no borrow. D is a true positive number

DF = 0 denotes a borrow. D is two’s complement

The syntax “-(not DF)” denotes the subtraction of the borrow.

12. This instruction is associated with more than one mnemonic. Each mnemonic is individually listed.

13. An idle instruction initiates a repeating S1 cycle. The processor will continue to idle until an I/O request (INTERRUPT, DMA-lN, or DMA- OUT)

is activated. When the request is acknowledged, the idle cycle is terminated and the I/O request is serviced, and then normal operation is

resumed.

14. Long-Branch, Long-Skip and No Op instructions require three cycles to complete (1 fetch + 2 execute).

Long-Branch instructions are three bytes long. The first byte specifies the condition to be tested; and the second and third byte, the branching

address.

The long-branch instructions can:

a. Branch unconditionally

b. Test for D = 0 or D

 0

c. Test for DF = 0 or DF = 1

d. Test for Q = 0 or Q = 1

e. Effect an unconditional no branch

If the tested condition is met, then branching takes place; the branching address bytes are loaded in the high-and-low order bytes of the cur-

rent program counter, respectively. This operation effects a branch to any memory location.

If the tested condition is not met, the branching address bytes are skipped over, and the next instruction in sequence is fetched and executed.

This operation is taken for the case of unconditional no branch (NLBR).

15. The short-branch instructions are two bytes long. The first byte specifies the condition to be tested, and the second specifies the branching

address.

The short branch instruction can:

a. Branch unconditionally

b. Test for D = 0 or D

 0

c. Test for DF = 0 or DF = 1

d. Test for Q = 0 or Q = 1

e. Test the status (1 or 0) of the four EF flags

f.

Effect an unconditional no branch

If the tested condition is met, then branching takes place; the branching address byte is loaded into the low-order byte position of the current

program counter. This effects a branch within the current 256-byte page of the memory, i.e., the page which holds the branching address. If the

tested condition is not met, the branching address byte is skipped over, and the next instruction in sequence is fetched and executed. This

same action is taken in the case of unconditional no branch (NBR).

16. The skip instructions are one byte long. There is one Unconditional Short-Skip (SKP) and eight Long-Skip instructions.

The Unconditional Short-Skip instruction takes 2 cycles to complete (1 fetch + 1 execute). Its action is to skip over the byte following it. Then

the next instruction in sequence is fetched and executed. This SKP instruction is identical to the unconditional no-branch instruction (NBR)

except that the skipped-over byte is not considered part of the program.

The Long-Skip instructions take three cycles to complete (1 fetch + 2 execute).

They can:

a. Skip unconditionally

b. Test for D = 0 or D

 0

c. Test for DF = 0 or DF = 1

d. Test for Q = 0 or Q = 1

e. Test for IE = 1

If the tested condition is met, then Long Skip takes place; the current program counter is incremented twice. Thus two bytes are skipped over,

and the next instruction in sequence is fetched and executed. If the tested condition is not met, then no action is taken. Execution is continued

by fetching the next instruction in sequence.

TABLE 4. INSTRUCTION SUMMARY

(See Notes 11 through 16) (Continued)

INSTRUCTION

MNEMONIC

OP

CODE

OPERATION