PROGRAMMING AND CODING THE IBM 709-7090-7094 COMPUTERS COM~lUJIElR<S BELL TELEPHONE LABORATORIES MURRAY HILL, NEW JERSEY JOHN WILEY AND SONS, INC. NEW YORK, LONDON AND SYDNEY Copyright © 1963 by John Wiley & Sons, Inc. All Rights Reserved This book or any part thereof must not be reproduced in any form without the written permission of the publisher Printed in the United States of America PREFACE The purpose of this booklet is to explain the differ­ ences that exist between the hypothetical DELTA 63 (in PROGRAMMING AND CODING DIGITAL COMPUTERS) and the IBM 709-7090-7094 digital computers. It is deemed impor­ tant that the reader "go on" a computer early in his studies. This booklet, used in conjunction with the book, attempts to permit him to do just that. The book itself is self-contained; it stands by itself and makes no references to this booklet. The booklet, however, is tied intimately to the book. There are many references to the latter, indicated by the speci­ fic mention of pages. The plan for the joint use of book and booklet is as follows. The reader follows the book with reference to the workplan of this booklet (placed at the start of this booklet). The workplan indicates when material here is to supplement, modify, or replace material in the book. The reader then makes appropriate references as noted. Material here follows the plan of the book and is placed in proper sequence. In general, the book material in small ty)e, which is of a specific nature (specific to the DELTA 63 , is supplemented, modified or replaced. The effect of this joint usage is to yield a textbook that is of general structure, illustrated by coding for the IBM 709-7090-7094 computers. Characteristics of these computers, their repertoires of instructions, and examples of their coding appear in this booklet. A number of additional examples are included to reflect the special features and instructions of the IBM 709-7090-7094 computers. Computer manuals, published by IBM on the three computers, should also be used. Part I of the book is general in its approach and so needs no modification here. Parts II and III, however, are largely specific and so are well represented in this booklet. An index to the 7090 instructions appearing in this booklet follows the regular index. Philip M. Sherman v TABLE OF CONTENTS Workplan ix 5 Basic Operations 1 6 Symbolic Coding 14 7 Program Loops 18 8 Index Registers 28 9 Sequencing in Memory 45 10 Subroutines 51 11 Input-Output Operations 61 12 Program Planning 64 13 Numerical Problems 72 14 Algebraic Languages 74 15 Nonnumerical Problems '75 16 Data Processing 90 17 Macro-instructions 97 18 Interpreters and Simulation 122 19 Program Debugging and Testing 126 Index 133 Index to instructions 136 vii WORKPLAN This workplan indicates where the material in the booklet is to be used to supplement, modify, or replace the corresponding material in the book, PROGRAMMING AND CODING DIGITAL COMPUTERS. (S, M, and R indicate .§..upple­ ment, modify, and replace. These characters appear at each section within the booklet.) -Pages Material CHAPTER 5 R 84.4 - 85.5 General structure of 7090 R 85.8 - 86.3 Addition and subtraction: instructions R 86.7 - 87.2 Example 5.1 R 87.4 - 87.8 Example 5.2 S At 87.10 Comments on overflow R 88.4 - 89.1 Mult. and division: instructions R 89.5 - 91.1 Examples 5.3,5.4,5.5 R 92.1 - 92.6 Example 5.6 R 93.3 - 93.6 Transfer instructions M 93.6 - 94.4 Comments on transfers R 94.5 - 97.10 Examples 5.7,5.8,5.9 CHAPTER 6 R 102.7 - 103.1 Example 6.1 S At 104.4 What FAP is R 106.8 - 107.1 Instruction format M 107.4 - 109.7 Pseudo-operations S At 109.10 Qualifiers R 110.2 - 110.6 Example 6.2 R 111.5 - 112.1 Example 6.3 ix Chapter 5 BASIC OPERATIONS (R)------------------(84.4 - 85.5*)-----------------------­ GENERAL STRUCTURE OF 709/7090/7094 COMPUTERS The three computers are very similar, having the same memory capacity and essentially the same special registers and instructions. The 709 is slower than the 7090 by a factor of approximately 5; the 7094 has a few additional features and instructions. The three will be referred to by reference to the 7090.** The IBM 7090 computer has 32,768 36-bit words, usually addressed octally, 00000 through 77777. Bits in memory words are labeled S, 1, 2, ... , 35. The S-bit holds the sign, so that a signed 35-bit number can be stored in each word; a positive sign is stored as a 0 and a negative sign is stored as a 1. Magnetic tapes are connected to the computer for input-output purposes. Information may be read from magnetic tape or punched cards and may be written on tape, punched 'on cards, or printed on paper. Data transmitted between memory and an input-output unit must pass through a data channel. Each instruction is placed in one word in memory Most instructions have the format shown in Figure 5.1. Bits Sand 1 through 11, the operation field, hold the operation code. Bits 21 through 35, the address field, hold the operand address of the instruction. The octal representation of the instruction shown in Figure 5.1 is +050000015056. The operation code is +05008 and the operand address is 150568 , *Pages given at heads of sections indicate the pages in the text replaced by the material here. The digit after the decimal point indicates position on the page; thus "84.4" indicates a point about 4/10 down the page. **Details on the 7090 and 7094 computers are available in these IBM Manuals: "Reference Manual - IBM 7090 Data Processing System" (Form A22-6528-4, 1962) and "Reference Manual - IBM 7094 Data Processing System" (Form A22-6703, 1962) . 1 Pages Material CHAPTER 7 R 120.1 - 120.4 Example 7.1 R 120.8 - 122.3 Example 7.2 R 123.7 - 124.9 Example 7.3 R 125.6 - 126.4 Example 7.4 S At 129.2 Informa tion on tape S At 129.4 Input-output equipment R 131.7 - 132.7 Example 7.5 R 133.1 - 134.6 Examples 7.6,7.7 R 135.2 - 136.6 Example 7.8 CHAPTER 8 R 141.8 - 142.7 Index Registers R 143.1 - 143.9 Indexing instructions M 143.9 - 144.3 Levels of addressing M 144.4 - 144.10 The variable field R 145.6 - 146.3 Example 8.1 R 146.4 - 146.8 Example 8.2 R 147.2 - 147.8 Example 8.3, indexing instructions R 148.4 - 152.7 Examples 8.4,8.5,8.6 R 153.1 - 153.3 Time-space balance example S At 154.7 Index register pointers R 155.0 - 156.3 Indexing instructions, Ex. 8.7 R 156.7 - 157.8 Example 8.8 M 159.4 - 161.5 Indirect addressing R 162.4 - 164.6 Example 8.9 x Pages Material CHAPTER 9 M 168.2 - 168.6 Compare instruction R 168.7 - 169.8 Example 9.1 S At 170.1 Test instructions R 170.5 - 171.7 Examples 9.2,9.3 R 172.7 - 174.3 Examples 9.4,9.5 R 176.4 - 178.7 Example 9.6 CHAPTER 10 R 182.10 - 183.4 Example 10.1 R 185.4 - 185.9 Example 10.2 S At 186.4 Macro-instructions R 186.5 - 186.7 Macro-instruction example R 188.1 - 188.5 TSX instruction and linkages R 189.7 - 190.2 Transfer of information R 190.7 - 191.6 Example 10.3 R 191.7 - 192.4 Example 10.4 R 192.6 - 192.8 Subroutine call example R 193.0 - 195.3 Examples 10.5,10.6,10.7 R 196.4 - 196.5 Multiple returns CHAPTER 11 S At 206.8 Correction cards R 208.8 - 209.10 BCD codes R 210.7 - 211.1 BCD pseudo-operation M 211.2 - 213.2 Input-output subroutines xi Pages Material CHAPTER 12 R 235.1 - 235.4 Instruction execution times R 235.8 - 236.3 Example 12.2 R 240.3 - 241.6 Example 12.3 R 243.1 - 244.10 Shifting and masking R 245.3 - 246.9 Example 12.4 R 247.2 - 247.9 Example 12.5 CHAPTER 13 R 254.8 - 255.8 Floating pt. oper'ns and instructions M 255.8 - 256.4 Floating-point examples CHAPTER 14 R 267.4 - 267.7 Compiler coding example CHAPTER 15 S At 296.5 Logical instructions R 297.4 - 298.10 Example 15.1 M 299.3 - 299.8 Packing binary information R 299.8 - 300.2 Example 15.2 R 301.2 - 301.7 Example 15.3 S At 302.1 ERA, PBT, and the sense indicators R 307.7 - 311.7 Example 15.4 R 316.1 - 317.3 Word formats, Example 15.5 R 320.1 - 320.4 Example 15.6 R 320.6 - 321.5 Example 15.7 S At 322.0 PAC instruction R 322.1 - 322.7 Example 15.8 xii Pages Material CHAPTER 16 S At 331.10 Convert instruction R 332.2 - 333.10 Examples 16.1, 16.2, 16.3 S At 334.2 CRQ instruction; Example 16.3A R 338.7 - 340.2 TLQ instruction; Example 16.4 M 340.2 - 340.5 Comments on sorting R 341.1 - 341.10 Example 16.5 CHAPTER 17 S At 348.10 Comments on pseudo-operations R 349.0 - 349.9 Example 17.1 R 350.1 - 350.3 Macro-instruction expansion S At 350.4 PMC pseudo-operation R 351.4 - 351.10 Example 17.2 R 352.4 - 352.9 IFF pseudo-operation R 353.0 - 354.7 Example 17.3 M 355.4 - 355.9 IFF variations R 356.0 - 356.4 Example 17.4 R 356.6 - 357.8 IRP pseudo-operation; Ex.