OPERATING PROCEDURES - CDC* CYBER 170COMPUTER SYSTEMSMODELS 835 AND 855

Refer to the hardware operator's guide listed in the s y s t e m p u b l i c a t i o n i n d e x . T h e s y s t e m i s i n i t i a l i z e d by setting its control switches, and then by running e i t h e r a l o n g o r s h o r t d e a d s t a r t s e q u e n c e ( d e fi n e d l a t e r i n t h i s s e c t i o n ) . A f t e r i n i t i a l i z a t i o n , t h e k e y b o a r d i s u s e d t o i n s t r u c t t h e s y s t e m f u r t h e r, under program control.

B e f o r e a c t i v a t i n g a l o n g o r s h o r t d e a d s t a r t s e q u e n c e , c h e c k t h e p o s i t i o n s o f d e a d s t a r t p a n e l s w i t c h e s a g a i n s t t h e i r i n t e n d e d u s e . T h e s e c h e c k s can be made by using table 3-1. The normal settings of these switches is as follows:

Switch P o s i t i o n

CLEAR AUTO Down

FREQ MARGIN Center

RECONFIGURATION All down

LONG/SHORT DEAD START SEQUENCE

Down for deadstar

DEAD START Center

A l l e r r o r l i g h t s N o t l i t

Deadstart Sequences

I n r e s p o n s e t o a d e a d s t a r t s i g n a l f r o m e i t h e r t h e deadstart pushbutton on the display console, or from

/■ »«-£v

3-4

_{60469290 A}

y / ^ f e \

t h e D E A D S TA R T s w i t c h o n t h e d e a d s t a r t p a n e l , c i r c u i t s i n t h e I O U p e r f o r m a d e a d s t a r t s e q u e n c e . Depending on the setting of the LONG/SHORT DEAD START SEQUENCE switch on the deadstart panel, either t h e l o n g o r t h e s h o r t d e a d s t a r t s e q u e n c e i s p e r f o r m e d . T h e s h o r t d e a d s t a r t s e q u e n c e i s u s e d when hardware integrity verification is not required.

The long deadstart sequence performs all the tasks performed by the short deadstart sequence and some a d d i t i o n a l t a s k s . T h e m a i n a d d i t i o n a l t a s k i s t h e r u n n i n g o f a d i a g n o s t i c p r o g r a m , f r o m a r e a d - o n l y m e m o r y ( R O M ) i n t h e I O U , o n l o g i c a l P P O . T h e diagnostic program takes approximately one minute to run.

Both deadstart sequences begin with a master clear w h i c h s e t s u p a l l P P s , e x c e p t l o g i c a l P P O , f o r a 4 0 9 6 - w o r d b l o c k i n p u t s t a r t i n g a t P P l o c a t i o n 0 . The input into each PP is from the channel with the s a m e n u m b e r a s t h e l o g i c a l n u m b e r o f t h e P P c o n c e r n e d . T h e m a s t e r c l e a r a l s o r e s e t s a l l e x t e r n a l d e v i c e s a n d s e t s m a i n t e n a n c e c h a n n e l c o n n e c t c o d e b i t 5 2 . T h e i n d i v i d u a l c h a n n e l s a n d registers are set as follows:

Channel

10 (display c o n t r o l l e r ) 14 (real-time c l o c k )

15 (two-port mux)

A c t i v e / F u l l / C h a n n e l I n a c t i v e E m p t y C h a n n e l E r r o r F l a g F l a g F l a g F l a g I n a c t i v e E m p t y C l e a r C l e a r A c t i v e E m p t y C l e a r C l e a r A c t i v e F u l l S e t Set A c t i v e E m p t y C l e a r C l e a r 1 7 ( m a i n t e n a n c e ) A c t i v e E m p t y C l e a r C l e a r A c t i v e E m p t y C l e a r C l e a r O t h e r i n s t a l l e d

channels N o n i n s t a l l e d channels

The flags of channel 14 and of noninstalled channels are fixed by hardware and cannot be changed.

R e g i s t e r I n i t i a l i z a t i o n D e s c r i p t i o n K _0071008 I n s t r u c t i o n d i s p l a y o n

deadstart panel

P _0077778 C a u s e s b l o c k i n p u t t o start from location 0

A _10,0008 Count of 4096 words

Q 0 , 1 , 2 . . . I / O c h a n n e l n u m b e r s ( P P O : 0 , P P 1 : 1 , a n d so on)

I n a c t i v e E m p t y C l e a r C l e a r

A l l r e g i s t e r s i n a l l b a r r e l s a r e s e t t o t h e s e values, except the registers of PPO.

If the l ong d eads tar t seq uen ce i s be i ng performed, h a r d w a r e c l e a r s l o c a t i o n 7 7 7 7 g i n a l l P P m e m o r i e s a n d s e t s t h e P r e g i s t e r o f P P O t o 6 0 0 0 g . P P O s t a r t s p e r f o r m i n g a t e s t p r o g r a m f r o m a r e a d - o n l y memory In IOU and lights the deadstart panel L.D.S.

ERROR-A and L.D.S. ERROR-B indicators. Indicator A remains lit unless the test program reaches location 6 2 0 0 g w i t h i n 1 0 . 2 5 m i c r o s e c o n d s . I n d i c a t o r B r e m a i n s l i t u n t i l t h e t e s t p r o g r a m r e a c h e s l o c a t i o n 7 7 7 6 g . W h e n t h i s h a p p e n s , t h e u n i q u e p a r t o f t h e

long deadstart sequence ends with a master clear.

Next, both deadstart sequences clear PPO location 0, w r i t e t h e s e t t i n g s o f t h e d e a d s t a r t p a n e l m a t r i x s w i t c h e s i n t o P P O m e m o r y l o c a t i o n s 1 t o 2 0 g , a n d clear PPO location 21g. PPO then starts executing the program entered from the matrix switches, which is normally a bootstrap program to Input more data from an assigned external device.

T h e s h o r t d e a d s t a r t s e q u e n c e d o e s n o t d i s t u r b P P m e m o r y o t h e r t h a n P P O l o c a t i o n s 0 t o 2 1 g . B o t h d e a d s t a r t s e q u e n c e s l e a v e a l l P P s , e x c e p t P P O , waiting for a block Input, or for action through the m a i n t e n a n c e c h a n n e l . A f t e r t h e b l o c k i n p u t i s c o m p l e t e , e a c h P P s t a r t s e x e c u t i n g t h e p r o g r a m e n t e r e d f r o m w h a t e v e r a d d r e s s w a s e n t e r e d i n t o location 0 of that PP.

IOU Reconfiguration

The logical PP numbers and hardware are assigned to p h y s i c a l P P s c i r c u l a r l y f r o m t h e s e t t i n g s o f I O U deadstart panel RECONFIGURATION switches, which s p e c i f y w h i c h p h y s i c a l b a r r e l a n d P P M i s P P O . I f the PPM section of these switches is set to a value g r e a t e r t h a n f o u r, t h e v a l u e z e r o i s s u b s t i t u t e d . If the BARREL section of these switches is set to a

v a l u e g r e a t e r t h a n t h e n u m b e r o f i n s t a l l e d b a r r e l s , t h e v a l u e z e r o i s s u b s t i t u t e d . T h u s , p o s s i b l e barrel numbering is as described in table 3-3.

I nqteH

The minimum system option is 10 PPs.

Table 3-3. Barrel Numbering Table

L o g i c a l PPs in Physical Barrel

Barrels Physical with BARREL RECONFIGURATION »

I n s t a l l e d B a r r e l Switch Values

4 Barrels 0-4 25-31 20-24 5-11

(20 PPs) 5-11 0-4 25-31 20-24

2 _20-24 _5-11 0-4 25-31

3 _25-31 _20-24 _5-11 0-4

3 Barrels 0-4 20-24 5-11 ( 0 - 4 )

(15 PPs) 5-11 0-4 20-24 ( 5 - 11 )

2 _20-24 _5-11 0-4 _(20-24)

2 Barrels

(10 PPs) 0-4

5-11

0-4 ( 0 - 4 ) ( 5 - 11 )

( 0 - 4 ) ( 5 - 11 ) 1 Barrel

(5 PPs) 0-4 ( 0 - 4 ) ( 0 - 4 ) ( 0 - 4 )

^Gi?V

/ - * ^ v

s£$%\

^

3-6 60469290 A

INSTRUCTION DESCRIPTIONS

CP INSTRUCTIONS

CP INSTRUCTION FORMATS

NOTE |

C Y B E R 1 7 0 C P I n s t r u c t i o n s u s e t h e r i g h t m o s t 6 0 b i t s i n t h e 6 4 - b i t w o r d . T h e l e f t m o s t 4 b i t s a r e u n d e fi n e d . F o r t h e s e i n s t r u c t i o n s , t h e m o s t s i g n i fi c a n t b i t i s b i t 5 9 a n d t h e l e a s t s i g n i fi c a n t b i t i s b i t 0 .

P r o g r a m i n s t r u c t i o n w o r d s a r e d i v i d e d i n t o 1 5 - b i t fi e l d s c a l l e d p a r c e l s . T h e fi r s t p a r c e l ( p a r c e l 0 ) i s t h e h i g h e s t - o r d e r 1 5 b i t s o f t h e 6 0 - b i t w o r d . The second, third, and fourth parcels (parcels 1, 2, a n d 3 ) f o l l o w i n o r d e r. F i g u r e 4 - 1 s h o w s p o s s i b l e p a r c e l a r r a n g e m e n t s f o r i n s t r u c t i o n s w i t h i n a program instruction word.

A n i n s t r u c t i o n m a y o c c u p y o n e , t w o , o r f o u r p a r cels. This arrangement depends upon the instruction f o r m a t . W h e n a n i n s t r u c t i o n o c c u p i e s t w o p a r c e l s , it must occupy two parcels within the same program w o r d . A p r o g r a m w o r d m a y b e fi l l e d w i t h a o n e -p a r c e l -p a s s i n s t r u c t i o n o r a n i n s t r u c t i o n a c t i n g a s a t w o - p a r c e l p a s s i n s t r u c t i o n . T h e s e i n s t r u c t i o n s are used to fill a program word when necessary to p l a c e a p a r t i c u l a r i n s t r u c t i o n i n t h e fi r s t p a r c e l of a program word or to avoid starting a two-parcel i n s t r u c t i o n i n t h e f o u r t h p a r c e l o f a p r o g r a m w o r d . Pass instructions may also be used for branch entry p o i n t s b e c a u s e a b r a n c h i n s t r u c t i o n d e s t i n a t i o n address must begin with a new word. One-parcel pass I n s t r u c t i o n s a r e 4 6 0 x x t h r o u g h 4 6 3 x x . I n s t r u c t i o n s 60xxx through 62xxx may be used as two-parcel pass i n s t r u c t i o n s b y s e t t i n g t h e i i n s t r u c t i o n d e s i g n a t o r t o z e r o . R e f e r t o t a b l e 4 - 1 f o r C P i n s t r u c t i o n designators.

C P i n s t r u c t i o n s O i l a n d 0 1 2 h a v e s p e c i a l p r o p e r t i e s . T h e y a r e 6 0 - b i t d o u b l e i n s t r u c t i o n s w h i c h m u s t s t a r t a t p a r c e l 0 . T h e p r o g r a m m e r h a s t h e o p t i o n o f p r o v i d i n g a b r a n c h i n s t r u c t i o n a t p a r c e l s

INSTRUCTION 44

COMBINATIONS

2 9 1 4

60 BITS

X

r opcode! i ! j T k 1

1 4 0 5 Z 0

1 6 | 3 | 3 | 3 | l 5 B I T S

\ \ \ > — 2 n d O P E R A N D R E G I S T E R ( 1 o f 9 )

\ \ \ - l i t O P E R A N D R E G I S T E R t i o f 6 )

\ \ - R E S U L T R E G I S T E R ( 1 o f 8 )

»- OPERATION CODE

c

¹⁵ ¹⁵ ¹⁵ ¹⁵

59 PARCEL

parcel 3

c

³⁰ ¹⁵ 14 ¹⁵

59 44 14

c

^IS ³⁰ ¹⁵

59 44 29

c

¹⁵ ¹⁵ ³⁰

59 29 T o p c o o e t i r j r k " 1

c

³⁰ ³⁰

29 2 5 2 0 I T O

L

59 ⁶⁰

6 | 3 | 3 | 1 8 1 3 0 B I T S

\ \ \ 2 m l O P E R A N D

\ \ * - I t t O P E R A N D R E G I S T E R ! ! o l 8 )

\ \ - R E S U LT R E G I S T E R ( 1 o f 8 )

\—OPERATION CODE

Figure 4-1. CP Instruction Parcel Arrangement

2 a n d 3 i n t h e s a m e i n s t r u c t i o n w o r d ( t o a n e r r o r

T h i s i n s t r u c t i o n c a l l s a s u b r o u t i n e a n d i n s e r t s consecutive words from unified extended memory (UEM) to CM. The source UEM address is X0 plus RAE where

F o r f u r t h e r i n f o r m a t i o n , r e f e r t o B l o c k C o p y range condition varies depending on the addressing mode of UEM. In standard addressing mode, 24 bits

T h i s i n s t r u c t i o n b r a n c h e s o n a z e r o r e s u l t f r o m e i t h e r a fi x e d - p o i n t o r a fl o a t i n g - p o i n t o p e r a t i o n .

T h i s i n s t r u c t i o n b r a n c h e s o n a n e g a t i v e r e s u l t f r o m e i t h e r a fi x e d - p o i n t o r a fl o a t i n g - p o i n t o p e r a t i o n .

031jK Branch to K if (Xj) $ 0 2 9 2 1 2 0 1 8 1 7

N Z 0 3 4 j K B r a n c h t o K i f ( X j ) i s i n R a n g e I R

2 9 2 1 2 0 1 8 1 7 0

031

T h i s t w o - p a r c e l i n s t r u c t i o n u s e s t h e l o w e r - o r d e r 1 8 b i t s a s o p e r a n d K . E x e c u t i o n o f t h i s i n s t r u c t i o n c a u s e s t h e p r o g r a m s e q u e n c e t o t e r m i n a t e w i t h a j u m p t o a d d r e s s K i n C M o r t o c o n t i n u e w i t h t h e current program sequence, depending upon the content of Xj. The program sequence continues only on the f o l l o w i n g c o n d i t i o n s . T h e b r a n c h t o a d d r e s s K occurs for all other cases.

Continue if: (Xj) = 0000 0000 0000 0000 0000 ( p o s i t i v e z e r o )

(Xj) = 7777 7777 7777 7777 7777 (negative zero)

T h i s i n s t r u c t i o n b r a n c h e s o n a n o n z e r o r e s u l t f r o m e i t h e r a fi x e d - p o i n t o r a fl o a t i n g - p o i n t o p e r a t i o n . 032jK Branch to K if (Xj) is Positive

2 9 2 1 2 0 1 8 1 7 032

The branch decision for this instruction is based on the value of the sign bit in Xj.

Jump to K if: Bit 59 of Xj = 0 (positive) C o n t i n u e i f : B i t 5 9 o f X j = 1 ( n e g a t i v e ) T h i s i n s t r u c t i o n b r a n c h e s o n a p o s i t i v e r e s u l t f r o m e i t h e r a fi x e d - p o i n t o r a fl o a t i n g - p o i n t o p e r a t i o n .

0 3 3 j K B r a n c h t o K i f ( X j ) i s N e g a t i v e N G

2 9 2 1 2 0 1 8 1 7 0

033

The branch decision for this instruction is based on the value of the sign bit in Xj.

Jump to K if: Bit 59 of Xj = 1 (negative) C o n t i n u e i f : B i t 5 9 o f X j = 0 ( p o s i t i v e )

034

The program sequence continues only on the following c o n d i t i o n s . T h e b r a n c h t o a d d r e s s K o c c u r s f o r a l l other cases.

C o n t i n u e i f : ( X j ) - 3 7 7 7 x x x x x x x x x x x x x x x x ( p o s i t i v e o v e r fl o w ) (Xj) = 4000 xxxx xxxx xxxx xxxx

(negative overflow) T h i s i n s t r u c t i o n b r a n c h e s o n a fl o a t i n g - p o i n t q u a n t i t y w i t h i n t h e fl o a t i n g - p o i n t r a n g e . T h e v a l u e o f t h e c o e f fi c i e n t i s i g n o r e d i n m a k i n g t h i s b r a n c h t e s t . A n u n d e r fl o w q u a n t i t y i s c o n s i d e r e d i n r a n g e for purposes of this test.

0 3 5 j K B r a n c h t o K i f ( X j ) i s O u t o f R a n g e O R

2 9 2 1 2 0 1 8 1 7 0

035

The branch to address K occurs only on the following conditions. The current program sequence continues f o r a l l o t h e r c a s e s .

Jump to K if: (Xj) = 3777 xxxx xxxx xxxx xxxx ( p o s i t i v e o v e r fl o w ) (Xj) = 4000 xxxx xxxx xxxx xxxx

( nega ti v e ov er fl ow)

0 3 6 j K B r a n c h t o K i f ( X j ) i s D e fi n i t e DF

29 21 20 18 17

036

T h i s t w o - p a r c e l I n s t r u c t i o n u s e s t h e l o w e r - o r d e r 1 8 b i t s a s o p e r a n d K . E x e c u t i o n o f t h i s i n s t r u c t i o n causes the program sequence to terminate with a jump to address K in CM or to continue with the current program sequence, depending upon the content of Xj.

The program sequence continues only on the following sequence continues for all other cases.

Jump to K if: (Xj) = 1777 xxxx xxxx xxxx xxxx

/!pp*"\ and includes the four possible bit combinations that may occur. ments bit patterns during data processing.

14ixk Transmit Complement of (Xk) includes the four possible bit combinations that may o c c u r.

operands for this instruction are in Xj and Xk. The includes the four possible bit combinations that may occur. and includes the four possible combinations that may occur.

(Xj) - 0123 7777 0123 4567 1010 (Xk) = 0123 4567 7777 3210 1100 (Xi) - 7777 4567 0123 0000 7667

T h i s i n s t r u c t i o n c o m p a r e s b i t p a t t e r n s o r c o m p l e ments bit patterns during data processing.

2 0 1 j k L e f t S h i f t ( X i ) b y j k

Two sample computations are listed in octal notation t o i l l u s t r a t e t h e o p e r a t i o n p e r f o r m e d . T h e fi r s t

s h i f t e d c i r c u l a r l y t h e n u m b e r o f b i t p o s i t i o n s

Two sample computations are listed in octal notation t o i l l u s t r a t e t h e o p e r a t i o n p e r f o r m e d . T h e fi r s t example contains a positive shift count resulting in a l e f t c i r c u l a r s h i f t , a n d t h e s e c o n d e x a m p l e i l l u s

Two sample computations are listed in octal notation t o I l l u s t r a t e t h e o p e r a t i o n p e r f o r m e d . T h e fi r s t e x a m p l e c o n t a i n s a p o s i t i v e s h i f t c o u n t r e s u l t i n g i n a r i g h t s h i f t w i t h s i g n e x t e n s i o n , a n d t h e s e c o n d example contains a negative shift count resulting in a l e f t c i r c u l a r s h i f t .

Two sample computations are listed in octal notation

Two sample computations are listed in octal notation t o i l l u s t r a t e t h e n o r m a l i z i n g o p e r a t i o n p e r f o r m e d .

0$^\

performed. These examples contain the four combina tions of coefficient sign and exponent sign.

When the difference between the exponents is greater than 128 (decimal), the shifted sign bit is extended format and is not necessarily normalized.

T h e t w o o p e r a n d s a r e u n p a c k e d f r o m fl o a t i n g - p o i n t

shifted one place, and the exponent is increased by

Im Dokument CDC* CYBER 170COMPUTER SYSTEMSMODELS 835 AND 855 (Seite 34-48)