DATA 620/i SYSTEM REFERENCE MANUAL . - Al Kossow's Bitsavers
DATA 620/i SYSTEM REFERENCE MANUAL . - Al Kossow's Bitsavers
DATA 620/i SYSTEM REFERENCE MANUAL . - Al Kossow's Bitsavers
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The contents of the effective memory location are subtracted from<br />
the A register and the difference is placed in the A register.<br />
After execution, if (A) ~215 (217) or < _2 15 (-2 17 ), the overflow<br />
indicator (OF) is set.<br />
Indexing: Yes<br />
Indirect Addressing: Yes<br />
Registers <strong>Al</strong>tered: A, OF<br />
Multiply (optional)<br />
17 16 15 14 13 12 11 10 9 8<br />
1-'-!<br />
L_..L<br />
16 M<br />
I la-bit I<br />
option<br />
7 6<br />
Timing: 10 cycles<br />
(16 bits)<br />
11 cycles<br />
(18 bits)<br />
5 4 3 210<br />
The contents of the B register are multiplied by the contents of<br />
the effective memory location. The original contents of the A<br />
register are added to the final product. The product is placed<br />
in the A and B registers, with the most-significant half of the<br />
product in the A register and the least-significant half in the<br />
B register. The sign of the product is contained in the sign<br />
position of the A register. The sign position of the B register<br />
is reset to zero.<br />
The algorithm is in the form R . B + A.<br />
Indexing: Yes<br />
Indirect Addressing: Yes<br />
Registers <strong>Al</strong>tered: A, B, OF<br />
A<br />
Divide (optional)<br />
Timing: 10-14 cycles<br />
(16 bits)<br />
11-15 cycles<br />
(18 bits)<br />
17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0<br />
r-r-! 17 M A<br />
L _.L _..L._____----IL--__----IL--________........<br />
IIS-bitl<br />
option<br />
3-11