⟦0e77ba708⟧

TextFile


*pl 297,40,210,25,10*  *pn 5,135*  *lw 135*  *ld15*
*ps 40*  *rh 1,EXECUTION TIMES*
*qr*  Appendix H
*ct*

    Executions times in microseconds
*rj*  *np*
The times given below represent the total physical times for
execution of algorithmic constituents. The total time to exe-
cute a program part is the sum of the

       times for the constituents.
 The times are only valid under
thefolluwning assumpti *ro*  the following  assumptions:
*sj*
   1.   The time for transfer of segments is
        negligible.
   2.   The program is not waiting for peripheral
        devices.
   3.   The time interval is 25.6 ms or more.
   4.   The program is the only internal proces in
        the computer.
*nl**rj*

When the computer is time shared, assumption 4 is not   fulfilled,
but then the time represent the CPU time used by the program.

*nl*  *ta 5,122*
H.1. Operand referances
	Referances to local identifier and constants	  0
*cm place the number up to a right edge*
	Referances to non-local identifiers	0-4
*rj*  *lm 10*  *ld 9*  *lw 85*
If a sequence of identifiers from the same non-local block area
referenced without intervening references to other non-local
blocks, the first reference costs 4 microseconds and the later
ones usally 0.
*ld 15*  *lm 0*  *lw 135*  *ta 5,122*
	Referance to name parameter, actual is simple	  9
	Reference to name parameter, actual is composite	150

*rj*
H.2 The compiler *np*
The compiler occupies about 13000 instructions divided into 12
passes, either on backing storage or on magnetic tape. In the first
case, it may be used for simultaneous translation in several job
processes. *np*  *sl3*
The 12 passes   of the compiler perform the following tasks: Pass
0 is a common administration routine. Pass 1 to 8 perform the trans-
lation into binary code by means of 8 scans of the source program
*ds !* !u
*fn 1,The program is stored in the place later occupied by the
      binary program*!d. 
Pass 9 rearranges the binary program, inserts referances to stan-
dard procedures used in the program. Pass 10 includes the run time

administrative system (RS). *fn 1,When an external procedure is
translated, pass 9 only rearranges the binary procedure and RS
is not included.* Pass 11 is only active when the branch 
test mode is specified.
*ds*

*ns 1,2,H.3 Semantics**lm 33* 
*mt 1,bs file*  A file descriptor describing a backing storage
area. It is used as working area for the compilation and the object
code ends here and is described in the file descriptor. If
bs file initially is an empty note, the computer creates a
working area of 100 segments, translates       the program
and cuts the length the segments necessary. *nl* 
If translation is successful, bs file will contain a complete
object program or an external procedure ( a standard procedure).
*nl2*

*mt 1,source*      The list of sources specifies the input 
files to the compiler (see 2.0.3). If no source is specified
the compiler reads the source from current input.
*nl2*  
*mt 1,branch.yes*The algol program is modified so that 
the running program prints a list of all the branch points passed
(if then , for do , case , and switch)
A survey of branches not passed is printed when the program exits
through the final end. A set of the line interval to which
the branch test is restricted may be specified.
 Details of the branch-test
ideas area published separately.  *nl*
The initial setting is branch.no.
*nl2*  *fg40*

*mt 1,details.yes*
Intermediate output from all passes of the compiler is printed on
current output. The meaning of the output will be explained in
the Maintenance Manual. The output may be restricted
to an interval of pass numbers and to an interval of line numbers.
*nl* The initial setting is details.no
*nl2*

*mt1,survey.yes*A summery is printed on current output after
the completion of each pass of the translation. The meaning
will be explained in the Maintenance Manual.

*ef*
▶EOF◀
DataMuseum.dk

RC4000/8000/9000

⟦0e77ba708⟧ TextFile

Derivation

TextFile
