U UNIVAC 1218 - Bitsavers
U UNIVAC 1218 - Bitsavers
U UNIVAC 1218 - Bitsavers
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
SEARCH 1219<br />
LLLLL TO UUUUU<br />
MM MMMM 5S S5SS<br />
AAAAA CC CCCC<br />
AAAAA CC ccce<br />
AAAAA CC CCCC<br />
END SEARCH<br />
LLLLL and UUUUU are the lower and upper limits of the search area; MM MMMM is<br />
the mask; 55 5SSS is the searchand; and AAAAA is the address of a word, CC<br />
CCCC, which. satisfies the conditions of the mask and searchand. An example<br />
is given below to demonstrate the capability provided by this routine.<br />
Example:<br />
Assume that the operator wishes to find all I/O instructions in a program<br />
loaded in memory beginning at address 010000 and ending at address 020000.<br />
The typeout below illustrates the limits, mask, and searchand to be specified.<br />
SEARCH 1219<br />
10000 to 20000 }<br />
77 4000 50 0100}<br />
10123 50 1306<br />
12777 50 1106<br />
13011 50 1203<br />
14000 50 3600<br />
16520 50 1305<br />
16540 50 1105<br />
17000 50 1505<br />
17500 50 3200<br />
END SEARCH<br />
2.7 COpy PAPER TAPE<br />
Memory limits<br />
Mask and searchand<br />
Instructions which<br />
satisfy conditions<br />
of mask and searchand<br />
This routine produces on exact copy of a paper tape. It is a faster and more<br />
reliable method than off-line duplication.<br />
2.8 TYPEWRITER DUMP<br />
This routine produces a typed hard copy of the contents of a specified memory<br />
area. The format of the output is shown on the next page.<br />
IV-A-7
Change language