llllllillililillil!!I~liliiiil

c

B A

If ~he number of items, or the item-length, is large, these Runout MERGES can be accomplished with a considerable saving in Processor time by using Cutoff MERGE:

If the A-Exit is selected, the MERGE is complete, since runout would only copy the remaining items of B on top of themselves.

- If the B-exit is selected, reset the Instruction to Runout MERGE, set BT equal to BF (B L G B (i.e. - B (!} BT will refer to the non-existent B-item which innnediately follows BF), and repeat the MERGE Instruction to accom-plish the runout of ~.

TV .;..M-5

c

TABLE IV-I: Language Code

NUMERIC NUMERIC BITS

ZONE VALUE OF

BITS ZONE BITS 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101

00 0 1 2 3 4 5 6 7 8 9 ^@ ¢ ^SPACE &

01 A B C D E F G

H

0 A m n

+

^J ^K ^L ^M ^N ^fJ

^P

^Q ^R ^% ^£ ^$ ⁽

*

^# ^S ^T ^U ^V ^W

^X

^Y ^Z ^d

^s ^u

TABLE IV-2: Modification of first word of Instruction by Index Register S-value

4 2 I Sum

A syllable modified N syllable modified J syllable modified Determines combination

of syllables modified.

S-values of syllables

4 2

If S = 0, no Index Register is used, and R is irrelevant.

TABLE IV-3: Interchange of syllables in ¢OO

(¢OO) before operation

p _Q

v

(¢OO) after operation

positive Q @ 2

]

negative p

1110 1111

•

,

e

)

I

W' X

MOVE

This Instruction moves ~ designated number of consecutive full, words from one memo17 area to another.

OVERFLOW~: ~!!21 be set under any circumstances.

IV-N-l

INSTRUCTION

FORV~T: Operation: MOVE (MOVE)

e

7. 6 5 4 3 2 1 0

I opl: ^A: I . >: : : ^{c : I}

Operation Code: N

( V I ^Mis 1 ^R rHi!i!ii!I!f~!Ii[!ii~~ti!~!iji!iii!i~!~!i~~lji!!lllirii?i!fl ^.

DEF IN ITIONS :

Op: operation code.

M: auto-monitor level: 0, 1, 2,

3. s:

designates eyllables for modification by index..;.register OOR. " :

R: designates OOR as index-register.

A:

base of address of first word which is to be moved.

N: as modified by (OOR) ,is an address-type number which~pecifies how many consecutive words are to

be

^moved.

C:' base of address. in which the first word :t;noved is to be stored.

V: variation designator;

. only the sign of V i~ relevant.

IV-N-2

=.

^{N t} ^Z99

DESCRIPTION OF: MOVE

This is not a partial-word operation.

The full word [AJ is transferred to [C] Then the full word [A

e 1J

is transferred to [0 ⁶⁾

JJ.

The operation proceeds _:til the number of words specified by ! has been moved:~;

Note- that the first word. moved is stored in its new location before the second word is looked up, &c. Therefore, if

Q

designates the

eell following the. cell designated by A, then [AJ will be copied into each of the! following cells.

!

specifies that zero words shall be moved, the Instruction moves zero words -- that is, it leaves the contents of the memory

un-changed •.

OVERFLOW ALARM: Will not be set by this Instruction.

TABLE IV-I: Language Code

NUMERIC NUMERIC BITS

ZONE VALUE OF

of syllables modified.

S-values of syllables 4 I" 2

PAC K

This Instruetionpermits the programmer to take advantage of the fact that only four" binary bits are required to specify any numeric digit. With numeric data, therefore, the storage space ordinarily oc-cupied by the zero zone-bits of each digit is, in a sense, nwasted", particularly in magnetic tape files.

PACK takes the thirty 6-bit characters in three consecutive memory-cells, tran~for.ms them into 4-bit digits by discarding their zone-bits, and stores them, fifteen to a word, in two consecutive cells. The order in which the thirty characters appeared is not ^eh~ngedin this transformation. The Instruction performs this operation on as many con-secutive 3-word groups as may be specified. proportionate saving in tape travel time during file processing.

While arithmetic operations cannot be performed on the data in its packed 4-bit form, all binary and logical operations can be per-fonned:

Extract Insert

Add Binary <uNormal" variation) Complement Binar,y

Test Bit

Compare Alpha-numeric Compare Equality

C_ombine

Distribute (tlNormal^tl variation) Merge

INSTRUCTION

FORV~T:

9 8 7 6 5 4 3 2 1 0

lopl : ^{A :} I : ^N: I : ^C: ^I

I

^His

I. [~ii(i~iJ!t@m!mml

I

DEFINITIONS:

o

^p: operation code.

M: auto-monitor level: 0, 1, 2, 3.

s:

designates syllables for modification by index-register OOR.

R: designates OOR as index-register.

A: base of address of first word of first 3-word group to be packed.

Opera t1on: PACK (PACK) Operation Code:

e

N: as modified by (OOR), is an address-type 0 ~ N ~

Z99

number which specifies how many consecutive

3-word groups are to be packed.

C: base of address in which first word of first 2-word packed group is to be stored.

J: address of next InstrUction, if any

character in the data to be packed contains a non-zero zone-bit.

V: variation designator;

only the sign of V is relevant.

IV-e'-2

DESCRIPTION OF: PACK

This is .!:!.Q1 a partial-word operation.

[AJ is transferred to a 30-character-long working register (Ra), left-justified. [A@ jJ is transferred to Ra, left-justified against the right-most character from [A]. [A ^(D ~ is transferred to Ra, left-justified against the right-most character from [A ED

JJ,

com-pleting the 30-character capacity of

Ra.

At this point, we regard the contents of Ra as a "stream" of 180 bits, which flows from the left end of Ra, through a "valve^lt^, toward the left end of a 20-character (120-bit) long working register (Rc).

As the first 2 bits flow from Ra, the valve is closed, and those bits are lost. Then the valve is opened to permit the passage of the next

4

bitis into Re. Then the valve is closed again to discard the next 2 bits, opened for the next

4

bits, and so on, until Ra has been emptied.

The left-most 60-bi ts of. Rc then replace [0], and the right-most 60-bits of Rc replace [0 ^Et) IJ. Then [A ^Et)

3J,

[A ^Et)

llJ,

[A Êt) 5J are packed, and put away into [..c Êt) 2J, [C Êt) 3]. The process is repeated until

~ triplets have been packed. If ^~specifies zero groups to be packed, the Instruction performs no operation, and leaves the contents of the memor,y unchanged.

It will be seen that each pair of bits discarded in the packing process comprises the zone-bits o! one of the original characters in Ra, and that the numeric bits of those characters a.re t~packed tight" into Re.

The

20 characters into which each 3-word group is· packed are upseudo-characters" which have no meaning in themselves, but which arise out of the characteristics of the Processor, which in all other operations re-gards information as being made up of 6-bit characters.

If any of the discarded zone-bits was a I-bit, the next Instruc-tion to be executed will be selected from~. However, the full ~ triplets

·are always packed.

OVERFLOW ALARM: Will not be set by this Instruction.

IV-6'-3

9 4F\

iFI I

#1 4fl6

ILLUSTRATION QE ~

In the followiilg d iagr~'ll, the 30 characters of the 3-word group to be packed are numbered from 1 to 30, in order to illustrate the arrangement of information before and.

after packing.

BEFORE PACKING

,

t 8 7 ^I' 6 5 ^I 4

I , I

:71 ;8 I ~I ^o

r . #2 _#10

, I I ^I

#,12 :/1:13 #L4 15 ^#16 #17 18 ¹¹⁹ ¹¹⁼²⁰

I ^I

AFTER PACKING

I I

8

7

6 5 4 ²

1

0

I I ⁱ _I

41="

2 ¹¹⁼³ ¹¹⁼⁴ #:5 #6 #7 ⁴¹⁼⁸ #9 #10 _{1 I} 1 2 1 3 1 4 *1 5

I ^I I , _I

" ^',1

L 3 ^I I •

1~ 7 #1 8 #1 9 #20 21 #22 #23 #24 #=25 4126 #27 #28 29 :/1:30

Example - PACK Instruction

Pack three words - starting at location 214, into two words, starting with location

327.

9 8 7

6

5 4

214

327

327 !if!if!i!ii,.~.j~fr!i!tt~r{Jl)!ft:4.}~)fi~!ii~mm~:mii!iii!{i!!)!:~4;i!i!i!i!~tfW~!:~ir!~~!)mt~!!;V~?!iim!i!i{i:;:;"

9 8 7 6

The next Instruction will be taken fran the "Branch" add:ress

i,

since a non-zero zo~e bit appears in character-position 60f cell 214.

IV - r:/ - 5

TABLE IV-1: Language Code

NUMERIC NUMERIC BITS

ZONE VALUE OF

BITS ZONE BITS 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101

00 0 1 2 3 4 5 6

7

8 9 ^@ ^¢ ^SPACE &

01 A B C D

E

F G

H

^[] A

m

+

^J ^K ^L

^M

^N ^6'

^P

^Q ^{R %} ^£ $ ⁽

* ^#

^S ^T

^U

^W

^Y

^Z ^d

^s ^u

TABLE IV-2: Modification of first word of Instruction by Index Register S-value

4 2 1 Sum

A syllable modified N syllable modified C syllable modified' Determines combination

of syllables modified.

S-values of syllables

4 ²

If S

=

0, no Index Register is used, and R is irrelevant.

TABLE IV-3: Interchange of syllables in ¢OO

(¢OO) before operation

p Q

v

(¢Ol» after operation positive

negative p

I

1110 1111

•

,

.,

p )

I

'If X

UNPACK

This Instruction operates upon information which has pre-viously been PACKED.

It regards the contents of two consecutive memory cells as a collection of thirty 4-bit digits, adds a pair of zero zone-bits to each of them, and stores the resulting thirty 6-bit characters in three consecutive cells. The Instruetion performs this operation on as many 2-word groups as may be specified.

UNPACK is the converse of PACK, and restores information to precisely the same form as it had before it was packed (except, of

course, that any l-bits in zone-bit positions in the original informa-tion will be replaced by O-bits).

OVERFLOW ALARM: Will not be set under any circtnnstances.

Dl-P-l

Dans le document PROGRAMMING MANUAL for the (Page 176-189)

c

c

c

H

+

P

*

X

s u

v

,

e

I

IV-N-l

INSTRUCTION

e

I opl: A: I . >: : : c : I

( V I Mis 1 R rHi!i!ii!I!f~!Ii[!ii~~ti!~!iji!iii!i~!~!i~~lji!!lllirii?i!fl .

3.

s:

A:

be

=.

e 1J

JJ.

Q

!

INSTRUCTION

lopl : A : I : N: I : C: I

I

I

I.

[~ii(i~iJ!t@m!mml

I

o

s:

e

Z99

JJ,

Ra.

4

4

3J,

llJ,

The

iFI I

#1 4fl6

,

:71 ;8 I ~I o

r . #2 #10

#,12 :/1:13 #L4 *15 #16 #17 *18 119 11=20

8

7

1

0

2 11=3 11=4 #:5 #6 #7 41=8 #9 #10 *1 I *1 2 *1 3 *1 4 *1 5

1~ 7 #1 8 #1 9 #20 *21 #22 #23 #24 #=25 4126 #27 #28 *29 :/1:30

327.

6

i,

7

E

H

m

+

M

P

* #

U

W

Y

s u

=

v

I

,

.,

I

^P

^X

^s ^u

I opl: ^A: I . >: : : ^{c : I}

( V I ^Mis 1 ^R rHi!i!ii!I!f~!Ii[!ii~~ti!~!iji!iii!i~!~!i~~lji!!lllirii?i!fl ^.

lopl : ^{A :} I : ^N: I : ^C: ^I

:71 ;8 I ~I ^o

r . #2 _#10

#,12 :/1:13 #L4 15 ^#16 #17 18 ¹¹⁹ ¹¹⁼²⁰

2 ¹¹⁼³ ¹¹⁼⁴ #:5 #6 #7 ⁴¹⁼⁸ #9 #10 _{1 I} 1 2 1 3 1 4 *1 5

1~ 7 #1 8 #1 9 #20 21 #22 #23 #24 #=25 4126 #27 #28 29 :/1:30

^M

^P

* ^#

^U

^W

^Y

^s ^u