(O); External

::(X); • The "X" in the external module heading represents the number of the module, and must be in the range 0 to 15. The default is O. The numbering of modules is used when the compiler options T (trace) and/or E (extended error messages)' are enabled, or when using InterPEST. Both the statement number and the module number (as specified by the "X" in the module heading) in which said statement is contained will be listed when the T and/or E options are enabled. Note -- separate module.s must end Itlith a period ' The compiler is invoked in a manner similar to that for the main module except that the fourth drive letter indicates the drive from which to read the two auxiliary files. 8) Separate modules are assembled with EMAIN.SRC rather than MAIN.SRC. This prevents the duplication of a few common routines and insures that the correct ENTRY and EXT statements are used. The main program module is still assembled with MAIN.SRC. 9) The error message I premature EOF I may occur when using separate compilation. This generally means that the CP/M file names of the modules do not correspond to the internal module names as specified in the module headings. The problem is easily solved by checking to make certain the names correspond. This error message will also occur if the fourth drive letter is not specified when compiling the program modules. Pascal/Z User's Manual Page 72 This example of a main module and two separate help clarify the use of separate compilation. modules- should program test(O); {This is the start of the file TEST.PAS } const max score = 100; min score = 000; type score = min score •• max score; student = (dave,john,bilI,peter,susan,mary,ruth,linda); test = ( math, geography, history, english, science ); var blue book: array[ student] of array( test] of score; i , j , k: in teg er ; 51, s2: st,udent; tl, t2: test; function average( name: student): score; external; function classavg: score; external; procedure hilo( name: student; var high, low: score ); external; begin for sl := dave to linda do for tl := math to science do begin write( 51:1, '1'5 I, tl:l, ' score is t); readln( blue book[ 51, t1 ] ); end; for sl := dave to linda do begin write( 51:1, I ' 's average score is: a v e r ag e ( s 1 ): 3 ); .i := 0; j : = 0; hilo( 51, i, j ); writeln( t with a high of ' i : 3, • and a low 0 f end; writeln; writeln( 'The class average is: classavg:3) ' j : 3 ); end. { This is the start of the file INDIV.PAS } External test::indiv(l); { report on individual student} function average( name: student): score; va r i: i n t eg e r ; j: in teg er i t: test; begin i : = 0; j : = 0; for t := math to science do begin i := i + 1; j := j + blue_book( name, t ] end; average := j div i end; fun c t ion min ( i, j: in t eg e r ): beg in min := i;. if j < i then min := j end; in t eg e r ; Pascal/z User's Manual Page 73 function max ( i,: j: integer.): integer i. begin max := i; if j > i then max := j end; procedure hilo( name: student; var -high, low: score ) ; var t: test; beg in low := 100; { minimum score is <= 100 } } { maximum score is >= 0 high := 0; for t := math to science do beg in low := min( low , blue book [ name, t ] ) ; high := max( high, blue - book[ name, t ] ) ; end; end; - { This is the start of the file CLASS. PAS External test::class(2)i J function classavg: score; var i,j: integer; s: student; t: test; begin i : = 0; j : = 0; for s := dave to linda do for t := math to science do begin i := i + 1; j : = j + blue_book [ s, t ] end; classavg := j div i end; This example has been tested and is KNOWN to work with Pascal/Z 4. O. The main module is called 'TEST' and the two subordinate mod u I e s are c a 11 ed I I ND I V ' and ' C LA sst res pee t i vel y • The following command sequence will compile, assemble and link this program: pasca148 test.aaaa asmbl main,test/rel pasca148 indiv.aaaa asmbl emain,indiv/rel pascal48 class.aaaa asmbl emain,class/rel link /n:test test indiv class /g The sample module 'INDIV' has two local functions, MIN and MAX, which can NOT be accessed anywhere outside of the INDIV module. Had it been desired, any of the routines in INDIV could have called CLASSAVG and CLASSAVG could have called HILO and AVERAGE. Pag'e 74 Pascal/Z User's Manual PASCAL/Z.EXTERNAL ROUTINES EXTERNAL routines are used to communicate with the world outside of Pascal/Z. To Pascal/Z, external' routines look' and behave EXACTLY.LIKE INTERNAL routines; so using an EXTERNAL routine is the same as using a regular Pascal procedure/function. EXTERNAL routines are declared just like FORWARD declared procedures and functions except that instead of using the reserved word FORWARD, the reserved word EXTERNAL is used instead. EXTERNAL modules should be assembled with EMAIN.SRC, while the main program should be assembled as usual with MAIN.SRC. The following conventions must pe followed routines to work properly: alternate 1) The X, Y and maintained. 2) Upon return from contain a zero. 3) If the routine is a function then: a) BOOLEANs return CARRY SET -> TRUE CARRY CLEAR -) FALSE b) Other non-REAL scalars return value in DE register pair c) REALs return in the four bytes above thE~ function parameters on the stack d) Structured types return' in the n, bytes above the parameter list on the stack (where n = size of return value) , 4) Each EXTERNAL routine is responsible for removing all of its parameters from the stack before returning. the BC, DE, in order for EXTERNAL HL registers must be EXTERNAL routine the accumu.lator must All parameters to EXTERNAL routines are passed on the, stack. They are pushed onto the stack in the order that they are declared. The table in Appendix One shows exactly what the stack looks like after they have been pushed. After all of the parameters have been pushed onto the stack the EXTERNAL routine is called (using the Z-80 CALL instruction). In the case of external procedures, variable values to be returned simply replace the variables passed; that is, the external routine accesses the address of the variable provided on the stack, uses this address to get the variable itself, processes it, and places the new value back at the same address. The external routine may alter value parameters passed directly on the stack, but this will have no effect on any var iables in the prog ram. , If we use the following contrived type declaration of COLOR, then the EXTERNAL function declared below it will return the colo r obtained by mixing two primary colors. Page 75 Pascal/Z'User's Manual {' this type was specially_designed "SO that the following is true: 1) :,ord ( red)". + ord (., yellow-) = ord( orange 2) ord( red) + ord( blue ). = 'ord( violet) 3) ord( yellow) + ord( blue) = ord{ green COLOR = ( CLEAR, RED, BLACK, BLUE, VIOLET, YELLOW, ORANGE, WHITE, GREEN ); FUNCTION MIX( PRIMARYI, PRIMARY2: COLOR ): COLOR; EXTERNAL; the assembly language routine will look like this ENTRY MIX ;entry point for the linker MIX: POP H ;get the ~eturn address POP D ;get the two colors MOV A,D ;get primaryl in A ADD E ;add in primary2 MOV E,A iset low half of return value XRA ;clear accumulator A D,A ;set high half of return value MOV PCHL ;return i Note that the ENTRY point of the routine must be declared for the linker (only the first eight letters of the ENTRY point will be significant) • In the file, EMAIN.SRC, which is included on the distribution disk, there are two macro dt=fini tions, ENTR and EXIT. These macros may be assembled with your EXTERNAL routines and used to simplify the writing of your routines. ENTR is used as follows: ENTR D,LVL,VSIZ where D is a dummy argument (that is, any value may be us'ed), LVL is the declaration level of the routine (the global level is level 1, for EXTERNAL routines the value 2 should be used) and VS I i' is the numbe r 0 f bytes 0 f local var i abIes necessary fo r t.he EXTERNAL routine. Assuming n (where n is a nice number) bytes of parameters to the EXTERNAL routine then they may be addressed as n+7 (IX) ifirst byte of parameters n+6(IX) ;second byte of parameters 8 ( IX) ilast byte of parameters = = = 8+n-l(IX) 8+n-2(IX) 8+n-n(IX) Local storage (as requested by VSIZ) may be addressed as O(IX) ;first byte of local storage l-VSIZ (IX) i last byte of local storage, And for non-REAL functions the return value must be stored in 2(IX) ;low byte of return value 3(IX) ihigh byte of return value the return value is initialized to a by ENTR. For real fUnctions the return value must be stored in n+8 (IX) ;least significant byte n+ll(IX) iffiost significant byte (exponent) Pascal/Z User'sManua~ Page 76 For structured functions the return value- must be stored in n+8(IX) ; least significant byte n+size-1JIX) ; most significant byte pictorial representation of ENTR macro is as follows: A the stack after execution of the 11-------------------------1 * 1st parameter I \-------------------------1 1-------------------------1 I last parameter I 1-------------------------1 \ return address I Proc/Fct 1 ••••••••••••••••••••••••• \ activation record-7 bytes total I old IX pointer I .' •••••••••••••••••••• • • • • I I return value I•••••••••••••••••••••••••I I level number (one byte) I \-------------------------lI IX ---) I I local variables I I , I \-------------------------1\ SP ---) I temporary storage I \' EXIT is used as follows: EXIT D,PARMSZ where D is a dummy argument and PARMSZ is the number of bytes of pa rameter s to the EXTERNAL routine. Thi s' routine will remove local storage and parameters, restore the stack and IX registers to their correct values, clear the accumulator, install the correct return value and return to the routine which called the EXTERNAL routine. The EXTERNAL follows: routine MIX can be recoded using ENTR and EXIT as ; the assembly language routine will look like this ENTRY MIX ifor linker PRIMl: EQU iPRIMARYl is 9 bytes above IX 9 iPRIMARY2 is 8 bytes above IX PRIM2: 8 EQU RESULT: EQU ilow byte of result is 2(IX) 2 ;level 2, no local storage MIX: ENTR D,2,0 MOV A,PRIMl(IX) ;get primaryl in A ;add in primary2 PRIM2(IX) ADD MOV RESULT (IX) ,A iset low half of return value ;the high byte is already zero EXIT 0,2 jtwo bytes of parameters Page 77 User's Manual ~ascal/Z These last examples will allow a user program to do direct'I/O. ' PROCEDURE OUTPUT ( PORT, VALUE: INTEGER ); EXTERNAL; , ; assembly language output routine i PORT: VALUE: EQU EQU ENTRY OUTPUT: ENTR MOV MOV OUTP EXIT 10 iLOW BYTE OF PORT NUMBER ;LOW BYTE OF OUTPUT VALUE OUTPUT ;FOR LINKER iNa LOCAL STORAGE D;2,0 C,PORT(IX) iC <- OUTPUT PORT iB <- OUTPUT VALUE B,VALUE(IX) B iOUTPUT THE VALUE TO THE PORT iDONE, FOUR BYTES OF PARAMETERS D,4 8 . TYPE BYTE = 0 •• 255; PROCEDURE INPUT ( PORT: BYTE; VAR VALUE: BYTE . )i EXTERNAL; assembly language input routine I PORT: HADDR: LADDR: LENGTH: INPUT: NOPE: EQU EQU EQU EQU ENTRY ENTR MOV INP MOV MOV MOV CPI JRNZ MVI DCX MOV EXIT iLOW BYTE OF PORT NUMBER iHIGH BYTE OF INPUT VALUE ADDR 9 ;LOW BYTE OF INPUT VALUE ADDR S ;LENGTH OF CALL-BY-REF INTEGER INPUT ;FOR LINKER D,2,0 iNC LOCAL STORAGE C,PORT(IX) ;C <- INPUT PORT B iINPUT THE VALUE FROM THE PORT H,HADDR{IX) iGET HIGH BYTE OF ADDRESS L,LADDR(IX) ;GET LOW BYTE OF ADDRESS A,LENGTH(IX) ;GET SIZE 2 iCHECK FOR 2 BYTE INTEGER NOPE iNO, 1 BYTE INTEGER M,O iYES, CLEAR HIGH BYTE H ;POINT TO LOW BYTE M,S ;STORE LOW (OR ONLY) BYTE D,4 iDONE, FOUR BYTES OF PARAMETERS 11 10 If a Pascal routine is to be used as an EXTERNAL routine for other Pascal programs and you do not wish to use separate compilation, then you must assemble it wi th ·EMAIN. SRC in 0 rdl~r to create a .REL file which can be linked to the main Pascal program. Before assembling the EXTERNAL routine you must edit the .SRC file containing the Z-80 macro code for that routine. You can do this as follows (this example OVERLAY section later in the manual): is taken from the 1) Add an ENTRY statement at the beginning of the . SRC f i 1 e to ide n t i f Y the n am e 0 f the r 0 uti n e ( s ) wit h i nth e file for the linker. E • G• ENTRY MIN, MAX Pascal/Z-User's Manual Page 78 where MIN and MAX are the names of procedures/functions within the module. (No spaces after the comma or the assembler will become v~~y upset.) 2) Delete file. all EXTR' and EXTD macro instructions from the • SRC 3) You must also identify each procedure/function for the linker by placing the name of the procedure/function, followed by a colon, immediately prior to the label indicating the beginning of that procedure/function. (A label which marks the beginning of a procedure or function will always be followed by an ENTR macro ins tr uct ion. In the • SRe f i leo, the code fo r the procedures/functions will be found in the same order in which the routines occur in the Pascal module.) EXAMPLE: MIN: L140 ENTR D,2,O STMT 0,1 MOV L,lO(IX) L148 EXIT 0,4 ENTRY Ll40 MAX: Ll61 ENTR D,2,0 STMT 0,4 MOV L,lO(IX) L169 EXIT 0,4 ENTRY L161 L99 ENTR 0,1,0 STMT 0,7 FINI 4) All code which may have been generated as part of the main program should be removed since you are only concerned with extracting one or more procedures or f-unctions. To do this, delete all code from the L99 label to the end of the file. 5) Assemble and link as follows: A>ASM~L EMAIN,MINMAX/REL A>LINK /N:(com file name>

MINMAX /G Page 79 Pascal/Z User's Manual OVERLAYING Pascal/Z implements overlaying of modules containing procedures and functions, in C?rder; to allow programs to be executed which might not· normally fit in available memory. An overlaying program is comprised of a resident program which remains in memory throughout the execution of the program, and one or more overlay modules, containing procedures and/or functions, which are swapped into an allocated section of memory pri~r to a call of a routine contained within an overlay module. Overlaying is implemented in Pascal/Z as follows: 1) The program is broken into a main module and separate modules in the same manner as a separately compiled program (see section on "SEPARATE COMPILATION). Modules which are to be overlay modules must contain routines which are accessed ONLY from the resident program or from other routines within the overlay module. Overlaying between overlay modules is NOT allowed. Other separate modules are allowed and become a part of the resident program. 2) To call a procedure or function in an overlay module, the Pascal/Z OVERLAY routine must first be called using the command: OVERLAY« name of file containing overlay I?od~l"e »; followed by one or more calls to procedures or functions in the overlay module. The < name of file containing overlay module> may be either a quoted string or an ARRAY ( 1 •• N ] of" CHAR. Note that OVERLAY is a predeclared identifier in Pascal/Z. 3) The main module and all separate modules, both overlay and are compiled and assembled in the same manner as a separately compiled program. non~overlay, 4) Before linking, the resulting .REL files must be processed by QVLYGEN.COM, a program included on the Pascal/Z d;stribution disk. OVLYGEN.COM generates memory maps of the main module (MAINMAP.REL) and the library (LIBMAP.REL), a memory map of the entry points of all routines in overlay modules (OVLYMAP.REL) I allocates an area in memory where overlaying will take place, and generates an output file which contains the commands necessary to link the program and its overlay modules. 5) When the link commrnands generated in step 3 are executed, the results are i) a .COM file which is the main program and all linked library modules, and ii) one or more files with no extension -- each containing an object code overlay module. When the program is run, these overlay files are loaded at the correct location in memory by the OVERLAY routine in the Pascal/Z run time 1 ibra'ry. Pascal/Z User's.Manual Page 80 6) In order to minimi ze the si ze of the resident module, it is advisable to modify LIB.REL, the Pascal/Z run tim~ support library provided on the distribution disk, prior to processing it using OVLYGEN.COM. This· can be easily done using the Query option of the linker. To determine which library modules should be included in the the following library for a specific overlayingl program, procedure may be followed: After all modules have been compiled and assembled, the main module should be linked with the standard LIB.REL, ~sing the /5 (search) option and the IV (verbose) .option of the linker. A list of all modules linked will be generated. Then follow the same procedure wi th each separate module, overlay module, and external module. A.composite list of all library modules linked during these 'pre-links' will determine those librar1 modules which must be included in the program's library. Use the /Q (query) option to generate the new 1 ibrary by loading the standard library as the input file and excluding those modules not included in the composite list generated above. It is important that the relative position of modules within the library be maintained, and this is most easily achieved using the query option.of the linker. If the standard library is not modified prior to processing by QVLYGEN.COM, the .COM file generated after linking will contain all the library modules, whether or not they are needed, and will probably be much larger than necessary, perhaps defeating the purpose of overlaying. The following example should help clarify overlaying and the use of OV~YGEN.COM. The program TEST 1S almost identical to the e-xample in the section describing SEPARATE COMPILATION. But in this case, the program contains a main module, a separate module, a module containing two Pascal external functions, and two overlay modules. { Main module contained in file TEST. PAS } prog ram test (0) ; canst max score =100; min-score =000; type score = min score •• max score; student ~ ( dave,john~bill,peter,susan); test = (rnath,geography,history,english,science); var blue book: array[ student] of array[ test) of score; i , j , k : in teg e r i sl,s2:student; tl,t2:test; Pascal/Z 'User's Manual Page 81 ,- function average( name:student):, score; external;function classav~: score; external; function rnin( i, j: integer ): integer; external; function max( i, j: integer): integer; external; procedure hilo( name: student; var high,low:score ); external; begin for sl := dave to susan do for tl := math to science do begin write( 51:1, " ' s " tl:l, I score is -- , ); readln( blue book( sl,tl ] ); end; overlay ( 'indiv' ) i { first overlay} for 51 := dave to susan do begin write( 51:1, " t S average score is : " average( sl ):3 ); i j := 0; : = 0; hilo(sl, i, j ); writeln( • with a high of '-, i:3, I and a low 0 f ' end; j : 3 ); writeln; overlay( r class' ); { se-::ond overlay} writeln( 'The class average is : " classavg:3 ) end. { separate module contained in file AVE.PAS } external test::ave; function average( name: student): score; va r i, j: in t eg e r ; t: test; beg in -,i := 0; j : = 0; for t i j := := := end; average math to science do begin i + 1; j + blue book[ name, t ] := j div i end; { external functions contained in file MINMAX.PAS } { see section on Pascal/Z External Routines } prog ram minmax; fun c t ion min ( i, j: i n t eg e r ) beg in min := i; if j < i then min := j end; i nteg er; Pascal/Z User's Manual Page 82 function max( i,j: integer): integer; begin max : = i;if j > i then-max := j end; beg in end. { overlay module contained in file INDIV.PAS } external test::indiv; procedure hilo( name: student; var high, low: score ); var t: test; beg in low := 100; high := 0; for t := math to science do begin low := mine low, blue book[ name, t ] ); high := max( high, blue book( name, t ] ); end; end; { overlay module contained in file CLASS~PAS } external test::class; function classavg: score; var i,j:integer; s: student; t: test; begin i := 0i j := 0; for s := dave to susan do for t := math to science do begin i := i + 1; j := j + blue_book[ s,t end; classavg := j div i end; The following command sequence modules of this program: pasca148 test.aaaa asmbl .rna in, test/reI pasca148 ave.aaaa asrnbl ernain,ave/rel pasca148- indiv.aaaa asrnbl emain;indiv/rel will compile and assemble the Pascal/Z User's Manual. Page tij pasca148 class.aaaa asmbl emain,class/rel pasca148 minmax.aaa { see section on Pascal/Z external routines'} { for modifications to MINMAX.SRC prior to } { assembly } asmbl emain,minmax/rel To generate a new library do: link link link libk link test Iv lib/s Ir Ie ave Iv lib/s Ir Ie minmax Iv lib/s Ir Ie indiv Iv lib/s /r Ie class Iv lib/s Ir Ie After each link note the modules that have been linked and then generate a new lib.rary using the command: link /l:newlib lib/q /e OVLYGEN.COM is then executed, prompting the user for: 1) the name of the .REL file containing the Pascal/Z CHAIN routine if chaining - is being done between this program and another program. 2) the name of the .REL file containing the main module. 3) the name of all .REL files containing separate modules. 4 ) the name of all .REL files containing external routines. user~created 5) the name of all libraries. 6) the name of all .REL files containing overlay modules. 7) the name of the Pascal/Z run time support library to be used. (If using the debugger InterPEST with an overlaying program, the debugger should be specified as a user-created library.) At the completion of execution, OVLYGEN.COM will generate a file TEST.SUB which will contain the following commands. link /n:test test ave minmax ovlymap newlib /u /e link /o:0~75 /n:indiv indiv mainprog libmap /u Ie link /0:0675 In:class class majnprog libmap lu /e Not e: A 'I u ' i s 9 en era ted" in e a chI ink e r comma n d lin e • This i s included to flag any library modules which might have been inadvertently left out of the modified library. If any library entry points are listed as unresolved external symbols, the modified library should be regenerated, even if the -'je' option (which loads the library usually LIB.REL) resolves the indicated unresolved externals. Not doing so will result in unpredictable, and often disastrous results. Pascal/Z User's Manual After execution of these· commands, TEST.COM may be run. ,Page 84 Page 85 Pascal/Z User's Manual INCLUDE FILES Pascal/Z provides an INCLUDE facility, with which any file may be included at any-point in a Pascal/Z program. The file or the drive filename. is present, files to be INCLUDEd must be on the default drive or must be specified, followed by a colon and the (The compiler will not check to make certain the file and will generate no error message if it is not.) To use INCLUDE files, type the the file is to be inserted: following at the point at which {$I } The "I" specifies that the file following it should be INCLUDEd. Please note that $I+ or $I- in a comment with no filename "specified indicates that the IMBED compiler option should tie enabled/disabled be careful that there are no spaces or characters between the "I" and the filename. Also, there must be a space between the filename and the closing bracket ( } ). Care must be taken to ensure that there are no conflicting declarations in the various files -- it is very easy to INCLUDE a file which uses variables already declared in another of the files. To" INCLUDE more than one file in the same pl"ace, each fil"ename must be specified in a separate comment. INCLUDE space. files may be nested, limited only by available stack Pascal/Z User's Manual Page 86 CHAINING While we advise against" overlays'and.chaining, we realfze that in some instances ther~ is no choice. Overlays wer~ discussed in an earlier section. In Pascal/Z there is also a'way for one program to chain to another with. the same global declarations (programs must chain at the main program level). In the Pascal program the following is used to do the chain: FTXTIN( ); CHAIN; The may be either a quoted string or an Then each of the programs involved in the chaining must be re-linked with the chain module (shipped in source on the library diskette) as follows: ARRAY [ I .• N ] of char. LINK CHAIN /N:/E For CHAIN to work correctly it is imperative that,it be the first f i 1 e l i n k ed • It is also possible for one different global data areas indicated in CMAIN.SRC. prog ram to cha in by changing the to anothe r wi th ENTR macro as If chained programs are to use the heap then the LAST routine in the 1 ibrary. shou:.d be changed, to set LAST to, the si ze of the largest program being chained. Pascal/Z User's Manuai Page 87 PASCAL/Z POINTERS Pointers, combined with ~heir associated intrinsic routines, NEW, MARK, and RELEASE, .are the means by which a user can dynamically allocate and deallocate variable storage. While the PASCAL REPORT describes NEW and DISPOSE, we have implemented NEW, MARK and RELEASE. These procedures are used as follows: NEW(P) P.may be any pointer variable. NEW allocates storage for P'" from the heap and assigns P the address of this NEWly allocated storage. MARK (P) P RELEASE (P) P is a pointer variable which has been previously "MARKed". RELEASE (P) releases all of the heap which has been allocated since P was "MARKed". must be a pointer variable. MARK sets P equal to the present top of heap (the information stored in P is used by a subsequent RELEASE). The RELEASE of a pointer to a file -variable close the output file pointed to. Note: will variable which has been "MARKed w should not be used for anything other than a RELEASE if you wan t to maintain the "MARK". A The prog ram on the next page wi 11 input a 1 ist 0 f names, sto re them in a linked list, output the list, release the storage and end. Pascal/Z User's Manual PROGRAM POINTERS; TYPE LINK = ANAMEREC; NAMEREC = RECORD NAME: STRING 20; NEXT: LINK END; VAR Ml: LINK; { FOR STORING FIRST: LINK; { FOR FINDING LAST: LINK; { FOR FINDING { FOR CHASING X~ LINK; BEGIN Pag e 88 THE MARK } THE FIRST NAME THE LAST NAME} THROUGH THE LIST MARK ( Ml ); FIRST := NIL; REPEAT = NIL- THEN BEGIN NEW( LAST); {ALLOCATE A NEW RECORD} FIRST := LAST IF FIRST END ELSE BEGIN NEW( LASTA.NEXT ); LAST := LASTA.NEXT END; WRITE ( 'Name ( * = DONE) , ); READLN( LASTA.NAME); {GET PERSONS NAME} LASTA.NEXT := NIL UNTIL LASTA.N~~E = '*'; { PRINT OUT THE NAMES } X :.= FIRST; WHILE XA.NEXT <> NIL DO BEGIN WRITELN( XA.NAME ); X := X.... NEXT END; { RESTORE THE STORAGE } RELEASE ( Ml ); END. Pasca 1/ Z Use r f· S Manual Page 8 9 PASCAL/Z FLOATING POINT NUMBERS In Pascal/Z all floating organized as follows: byte 1 point numbers byte 2 are 4 bytes byte 3 and are byte 4 1------------------------------------------------------------! I II' " 1 r I t ' , , r , r I , " " " " " t 1------------------------------------------------------------1 0 ••• 7 8 9 •.• 15 16 ••. 23 24 ••. 31 2's complement exponent sign mantissa (9 .• 31) There is an implied binary point to the left of bit 9. The value of the mantissa is multiplied by 2'"'(exponent) to achieve the flnal .. value • ~ Float ing po int' prec ision is approx imatel y' 6 1/2 dec imal dig its ( the r e will be a r 0 u nd o·f fer r 0 r in th e s even t h dig i t ) . I f t his is inadequate for your purposes, the' fixed point routines described in Appendix Three might provide sufficient precision (or try Pascal/BZ, the business version of Pascal/Z) . Other floating point formats are possible (i.e. AMD9511 could be used to process floating point); contact InterSystems for details if you need to use another format. Pascal/Z User's Manual Pag egO FORMATTING OUTPUT· When outputting the data types INTEGER, REAL and BOOLEAN, it is often desirable to format the output into columns. This is done by s p e c i f y i ng a fie 1 d wid th s u c h t hat all d a t a i s pro per 1 y al igned • In Pascal/Z, the standard field width for outputting the data types INTEGER, REAL and BOOLEAN is eight. This can be overridden by specifying the minimum field width preceded by a colon, as follows: X := LAURIE \I/RITE{ X : 10 ); X will be written in ten places and aligned to the right: bbbbLAURIE where b indicates a blank place. If the item to be output requires more than the allotted of columns, it will use as many as is necessary. number When outputting a REAL, the us~r may specify not only the field width, but also the number of digits to be printed after the decimal point. This is done by adding another colon followed by an integer specifying the nwnber of digits to be placed aft~r the decimal point. . Jensen & Wirth dictate that floating point output should always be preceded by two spaces--cne blank and one for the sign (which is only actually printed if it i~ negative; otherwise it is left blank) • Example: X := 12.352 WR I TE ( X : 7 : 2 ); This will output X as follows: bb12.35 The number will be rounded to display the prescribed number of places after the decimal point. If the number of places specified to be output is larger than the nUInber of existing digits, it will be padded with zeroes. With the same number as a negative (i.e. -12.352), the following statements will return the following results: WRITE( X 7 2 -----> b-12.35 WRITE ( X 5 2 -----> b-12.35 Note that al·though in the second example a field width of five is specified, since the two preceding spac~s are needed, the field Pascal/Z User's Manual PagE 91 width is automatically expanded to accept the number. Whenever the field width specified is not large enough to output the number as specified, as many places as necessary will be taken. Also note that the number is printed in fixed point notation, rather than exponential/scientific notation. Had X originally been specified in scientific notation, the result would be as follows: X := 1.34E+3 WRITE ( X : 6 Result: 4) ; bb1340.0000 If the number is too large to be represented in fixed point notation (e.g. 1.34E+25), the number will be output in scientific notation, but will still place the proper number of digits after the decimal point. X := 1.34E+25; WRITE( X : 6 ~esul t: 4); b1.3400E+25 as well that the decimal point occupies one place, and must be accounted for when specifying field width. No~e Pascal/Z User's Manual Page 92 ASSEMBLER AND LINKER ERRORS There are a few assembler errors which can occur during the assembly of a Pas9al/~ program. These result from the few program errors which are not caught by the compiler. The first error is an attempted invocation of a FORWARD declared procedure/functi'on which is never actually defined; in this case the error will be: Symbol not found CALL L????? The second error is a GOTO to a label which was declarec but not defined; Ll this case the error will be: Symbol not found JMP L????? The next error is a READ/WRITE to/from a textfile of a parameter which is larger than 255 bytes; in this case the error will be: Arg umen t too big MVI , Page 93 Pascal/Z User's Manual . MEMORY USAGE This section is included to allow users of Pascal/Z. to make efficient use of memory by describing the amount of storaae necessary for certain types of variables and statements. Since in Pascal/Z the reserved word PACKED is implicit in all ARRAY declarations its u~e is unnecessary (but still allowed). BOO LEANs stored 1 byte/variable CHARs stored 1 byte/variable INTEGERs stored 2 bytes/variable REALs stored 4 bytes/variable Enumeration types stored 1 byte/variable Subranges stored in one byte unless the base type is INTEGER and the range doesn't fit in one byte (the lower bound is less than zero or the upper bound is greater than 255). Pointers stored 2 byte/pointer File variables stored 300 bytes/variable ARRAYs & RECORDs require the amount of memory requirements of the individual require storage sufficient to case. equa I to element.s. sto re the the sum Varian~ largest of the RECORDs variant Quoted strings each quoted string takes up three bytes plus one additional byte for each character in the string. Declared constants numerical constants require no memory; string one byte/character plus one byte of overhead. constants use Procedure activation (each call of a procedure) each activation record requires seven bytes of storage plus the memory for the parameters and local variables. This storage is allocated dynamically from the run-time stack and is released when the procedure is exitted. Function activation same' as procedure activation, except which require eleven bytes of memory_ for REAL functions Pascai/z User's Manual Pag e 94 Value parameters each parameter requires storage as defined above. Reference parameters (VAR parameters) all reference parameters require two bytes of storage except for those of base type INTEGER which require three by.tes. SETs All sets are stored in 32 bytes. FOR statements require four bytes of storage for each active FOR loop. WITH statements require two bytes of memory statement. for each active dynamic WITH All of the memory usage described in this section (with the exception of quoted strings and string constants) is allocated dynamically from the run-time stack and is only used when a particular routine or statement is active. Pascal/Z User's Manual page 95 STACK AND HEAP ORGANIZATION This section is intended mainly for those users interested using Pascal/Z programs in a multi-tasking environment. in ALL code generated by the Pascal/Z is completely ROM-able and is also re-entrant as long as separate stacks and heaps are maintained as described in this section. All Pascal/Z programs start by initializing their stacks. The code to do this is in MAIN.SRC. ALL non-dynamic variables are stored on the run-time sta,ck. By changing the stack initializa'tion code, many different processes can run with the same memory image of the Pascal/Z program as long as each one has a different, and non-overlapping, stack. At any given time during program execution the IY register points to the global variable stack frame and the IX register points tp the local stack frame. Although all variC1bles are stored on and accessed through the stack, the stack can not be reloca~ed once program execution has begun. This is because there are often references from one part of the stack to another part of the stack which, in the interest of efficiency, are stored a~3 absolute addresses and not stack rela~ive addresses~ like the stack, is allocated at run-time, not compLle This means 'that the heap too may be initialized at a differen~ point in memory for each ?rocess. The initial value of the he a pis d e t e r-m i ned by t h € LA S T iii 0 d u 1 e ; t his co u 1 d e a s i 1 Y be changed whenever desired.. It is initially set to the first location following the user program. The heap, time. The run-time package is set up to allocate the stack from the top of memory downwards and ,the heap from the bottom of memory upwards and to give an appropriate error if they collide. If you are' allocating many stack-heap pairs for different processes then it is most reasonable to allocate them in contiguous memory to ensure that the stack and heap overflow checking is not defeated. Pascal!Z User's Manual' Page 9~ INSTALLING PASCAL!Z PROGRAMS IN ROM When installing a ~ascal!Z program into a ROM it is NOT necessary to make any changes to the program. However, it is possible to further reduce the 'size of the object code before burning a ROM. This is especially true for programs which are to run in a dedicated environment. When your program is assembled and linked, a certain amount of e r ro r recovery and term ina tion code is i ncl uded. Thi s i ncl udes code to close any open output files, to print error messages and to check for AC. If your program does not use any files for output, then much of this code can be eliminated by replacing the JMP LO instruction in the FINI macro (which is found in MAIN.SRe) with a JMP , ' These options may be in blanks. The options are: S s m p x r any order, I : and seve r al ); can be separated by Print the number with a leading dollar sign. Add commas every three digits to the left of the decimal"" point. Suppress trailing zeros. Print the minus sign after the number (the default is before the number for negative numbers) • Print the negative number in parentheses racher chan with a minus sign. Print x (where x is any integer between 0 and 15) digits to the right of the decimal point (the default is fifteen). Round the number to fit in x places (refers to above option; default is truncate). Note that if any of the specified options conflict (for example specifying both m and p for a negative number), the result at: the statement will be undefined. The FORMAT ($STRING40) I statement. function returns· a string of forty characters which can then be output using a WRITE or WRITELN The FORMAT routines are supplied in source so that they can be requirements. For changed to accommodate differing format European users, for example, the dollar sign can be changed to an appropriate monetary sign and the commas and decimal point can be reversed. HOW TO USE PASCAL/BZ To invoke Pascal/BZ, follow the instructions on HOW TO RUN PASCAL/Z (pages 46-49 of this manual), substituting PASCALBZ for PASCAL48 or PASCAL54. When assembling, use BMAIN.SRC or compilation or EXTERNAL routines} EMAIN. SRC •. BEMAIN.SRC (for separate rather than MAIN.SRC or The library for Pascal/BZ is named BZLIB.REL, and is linked in aut a mat i call y wit h the / E co mm and wh e nus i ng Pascal/BZ (see section on HOW TO RUN PASCAL/Z on pages 46-49). Pascal/Z User's Manual Page 118 Using InterPEST with Pascal/BZ programs If the debugger InterPEST (InterSystems Pascal Error Solving Tool) is to be used with a Pascal/BZ program, it must be compiled as described in the InterPEST Reference Manual, invoking PASCALBZ rather than PASCAL48 or PASCAL54. Then resulting .SRC file should then be assembled with 8XMAIN.SRC or BXEMAIN.SRC (if using externals or separate compilation). The .REL file generated can then be linked with BZBUG.REL as described in the InterPEST Reference Manual. BZBUG.REL contains a version of InterPEST designed to work with Pascal/BZ programs. In this version, all that applies to REAL numbers in the Pascal/Z version of InterPEST now applies to BCD numbers. BCD numbers may be displayed, but may not be modified. When a BCD number is displayed, not only will the value be displayed, but also the declared size of the number will be given. The number will always be displayed as a 15:15 nwnber, regardless of the declared size. * Error messages If the compiler generates any error messages referring numbers, they will in fact refer to BCD numbers. to REAL The $F option to generate an error message if a floating point overflow/underflow is encountered will now refer to a BCD fixed point overflow/underflow. * The Fixed Point Package The Pascal/Z Fixed Point Package is not supplied as a part of Pascal/5Z, since the compiler has intrinsic BCD fixed point numbers. (The Fixed Point Package also requires REALs to perform many of its operations, and REALs have been removed from Pascal/BZ.) * Pascal/BZ EXTERNAL routines When using EXTERNAL routines as described on .pages 74-78, BCD numbers returned by functions will be stored above the function parameters on the stack (see page 74). The least significant byte will be stored at n+8(IX), and the number will occupy space on the stack according to its size (as described in PASC}~.L/BZ STORAGE) • * TRUNC & ROUND The Pascal procedures TRUNC and ROUND will work slightly differently with BCD numbers than they do with REALs. The numbers to be truncated or rounded will be converted to integers, and an overflow/underflow error will be generated if attempting Pascal/Z Userls Manual Page 119 to truncate or round numbers which convert to greater than MAXINT or less than·-MAXINT. * PASCAL FUNCTIONS In Pascal/BZ, none of the standard functions may be passed a BCD number, with the exception of ASS, SQR and SQRT. (See the section on PASCAL STANDARD FUNCTIONS for more information on these routines.) PAS~AL/BZ STORAGE In Pascal/aZ, fixed point numbers are implemented in binary-coded decimal. The numbers may be variable in length, and ar~ stored two digits per byte, organized as follows: byte n I dig i t/ d ig it I • byte 1 byte 2 I sign/digiti Idigit/digitl (for digits to the left of the decimal point) where n may be up to eight bytes to accomodate fifteen digits to the left of the deci~al point. I digit/digiti a number wi th I dig i t/ dig it I (for digits to the right of the decimal point) Thus for a number with an odd number of even, number of digits to the right, wasted sto rag e. Fo r a. number wi th an the left or an odd number of digits to some waste, as shown below: ~ digits to the left and an there will never be any even number 0 f dig its to the right, there will be For a 3:4 BCD number) 2 bytes left, 2 bytes right = 4 bytes (no waste) For a 2:4 BCD number> 2 bytes left, 2 bytes right = 4 bytes (one wasted nibble to the left) For a 1:4 BCD number> 1 byte left, 2 byies right = 3 bytes (no waste) For a 4:5 BCD number> 3 bytes left, 3 bytes right = 6 bytes (one wasted nibble to the left, one wasted nibble to the right) ( Not e t hat an eve n : 0 d d n urn be r total of two wasted nibbles.) is the m0 s t i n e f f i c i en t , with a If there is wasted space on the left side of the decimal point the wasted nibble will be the nibble after the sign; on the right side of the decimal point the wasted nibble .will be the nibble af~er the last digit. The maximum precision allowed in Pascal/BZ is fifteen digits to Pascal/Z User's Manual Page 120 either side of the decimal point, for a total of thirty digits. See USING PASCAL/BZ FIXED POINT NUMBERS for more information on how to make use of BCD numbers. Pascal/Z User's Manual Page 121 PASCAL/Z COMMENTS & BUG REPORTS Please use this sheet (and any -additional sheets if necessary) when sending your comments and bug reports to INTERSYSTEMS. NAME: -------------------------------------------------------------- ADDRESS: ______________________________________ __________________ ~ PHONE: ------------------------------------------------------,------- VERSION: BUGS -----------------------SERIAL (include a listing I NUMBER: -------------------- description of the problem, etc): SUGGESTIONS FOR IMPROVEMENTS TO THE COMPILER: Pascal/Z User's Manual SUGGESTIONS FOR IMPROVEMENTS TO THE MANUAL: EXTENSIONS: WHAT DO YOU THINK OF EXISTING PASCAL/Z EXTENSIONS: Page 122 Pascal/Z User's Manual WHAT EXTENSIONS WOULD YOU LIKE TO SEE: DO YOU HAVE ANY UNANSWERED QUESTIONS ABOUT PASCAL/Z: Page 123 INDEX abs , absolute value ABSSQR. SRC access accumulator activation activation records actual parameter ADD add address ADDSUB.SRC allocation and append appendices one two three four five six seven ARCTAN. SRC a rc tang ent array ascii ASMBL.COM asmble assembler assignments base types 31,119 10,31 10 6,11,36,43,58,62 74,75,76 76,93 76,93 115 101,102,104-107 10,11,36,101,102,104-107 74,75,76,77,87,97-99 10 10,36,79-84,87-88,95 37 11,64,66,68 97-99 100 101-107 108 109 110-113 114-120 10,31 10,31 15,18,22,37,39,40,43,53-54,86,93,98 16,21,37 9,13,48" 2,9,48 2,4,9,13,47-48,70-73,74-78,79-80,92 20,25,39,42,43,64,114-115 93,94,97 10,35,51,101,114-120 beg in 28,37 117 BEMAIN.SRC binary 89 binary-coded decimal 10,35,51,101,114-120 bit 11,16,38,89,99 ·5,30,32,35,54 block 117 BMAIN"SRC 16,25,26,27,34,39,53,54,59,62,74,90,93, boolean 97-98,102 42,93 bound brackets 17,37 10-11,38,54,97 buffer byte 34,36,38,39,40,43,54,67,69,74-77,89,92,93-94, 97-99,101,115-116,119-120 10 BYTIN .. SRC BYTOT.SRC 10 118 BXEMAIN.SRC BXMAIN.SRC 118 SZ 35,51,114-120 BZBUG.REL 118 BZL::B.REL 11 7 BCD - ..-. .:... .. -call call by reference called case case label list case selector CHAIN.SRC chain char character check CHKD.SRC chr CLSOT.SRC CMAIN.SRC CMPCHK.SRC .COM comma command tail comments compare compatibility compatible compilation COMPILE. SUB comp i ler complement compound statement CON: 'concatenate conditional statement CONSOL..SRC console console input console input buffer console output const constant constant folding constant strings construct control C cos cosine cpi CVTFLT.SRC CVTSFP. SRC data data areas data types dcx deal location DEBUG.REL debugger decimal dec i mal po in t declaration ,~,;;,- 1 0 , 2 5 , 4 0 -i~5l , 54 , 7 4 , 7 9 , 9 2 , 9 3 , 96 , 9 7 , 1 0 1 51,77,97 30,48,74,76,101 4,5,27,37,39,41,43,61,69,93 27,39,61 27,159 10,83,86 10r 34 ,80,83,86,100 15,16,22,31,53,69,86,92,97 10,11,15,16,31,37,38,51,67,70,85,92,93 10,15,36,41-42,43,67,69,70,95,86,100 11 31 11,96 11,86 10 48 102-103,117 54 4,17,37,41,85 25,103 40 6,7,15,25 46-49,79-84 9,49 2,3,4,34,36 10,89 28,29 60 66 27 11 10,11,38,46,47,53-54,59,60 60 38,54 60 4,22,32,37,63,104,114-115 4,9,14,15,l6,22,27,32,36,43,51,61,63,93, 94,101-107,114-115 36 67 28 41,47,945 31 11,31 77 11 11 14,15,16,17,18 43,86 16-21,90 77 10,20-21,87-88 9 4,9,48 9,89,90-91,101-104,114-120 90-91,114-120 32,34,40,44-45,47,50,51,66,70,71,86,93,101-107, 114-115,116 declaration level decremen,ts DECS default jeflne definitions DEFLT.SRC delete density d ev ice device input device output digit Digital Research direct file access directory disable dispose div SDIVD DIVD.SRC divide divide by zero dollar sign DONE2.SRC downto DSKFIL.SRC DYNALL. SRC d ynam ic sto rag e ~di tors efficiency element element type EMAIN.SRC enable end end of file end of line enter ENTEXT. SR<; '~ entr entry entry point enumeration type eof EOFLN.SRC ea1n equivalence ERROR.SRC error messages errors EXAMPLE execution execution speed <::xit 2XP EXPFCT.SRC exponent 75-76 36 9,34,46,49,100 10,39,41-42,46,71,85 22,31 9,11,14,15,16,75 11 10,53,59' 100 10,53,60 60 60 16,37,38,71,89,90-91,101-104,114-120 1,2,6 4,6,11,58,62 10,59 41 5,40,87 37,63 101,102 11 10,11,36,42,101,102,115 36 . 41,85,102-103,117 11 26,37 11 11 5 , 10 , 20 - 21 , 87· .. 88 , 93 - 94 , 95 37 3,22,29,43,44-45,66,69,93 18-19,23,25,38,43,64,93,101 18-19 9,71,73,74-78,82-83 41-42 10,28,32-33,37 See, EOF, EOFLN See EOLN,EOFLN 11 11,96 75-78,86 42,69,70-71,75-76,92 70,75-78,79,83,92 4,16,17,42,51,53-54,62,93,97,103 31,51,53-54,58 11 31,53-54 44-45 11 11,41,42,50-51,70,71,100,115,118 7,10-11,17,34,38,39,40,41-42,47,49,50-52,54, 67,70,71,89,92,110-113,115 10 41,42,48-49,76,79,83,95 34,43 10,26,48,54,75-77 31 11 75,89,99 exponential notation expressions ext EXTENS extensions external routines EXTD EXTR FADDSB.SRC FCTMAC. SRe fields field width FILE file 10,91 25,26,30,36,39,61,115 71 10 3,4,9,46-47,61-62,63-85 4,9,37,38,51,61,66,70-73,74-78,79-84,97,118 78 78 11 11 23,38,51,64 90-91,116-117 15,16,19,31,37,62,97 4,6,10-11,15,16,19,21,31,34,37,38,39,53-54,71, 79-84,86,87,115-116 ' 53 file data FILEIO.PAS 10,56 46-47,51,53,54,59,70,71,79 file names 87 file variables 11 FILEXT.SRC 11 FILNAM.SRC 96 fin i 9,101-107 FIXCONST.PAS 9,101-107 FIXED. PAS fixederror 102 fixed point arith. 9-11,35,89,91,101-107,114-120 FIXEDEX.PAS 10,104-107 f ixto real 102 fixtostr 102-107 FIXTYPE.PAS 10,101-107 10,101-107 fIXVAR.PAS flag 102 floating point 10-12,16,35,41,89,90-91,96,99,114 flo a t i ng pt. form at s 89,99 floating point output 90-91 11,96 FLTIN.SRC FMULT.SRC 11 21,26,37,39,41,94 FOR FOR loop 26,39,41,94 115 formal parameter FORMAT 116-117 103 format mode formatting output 90-91,116-117 forward declarations 92 108 foster, charles 11 FOUT.SRC 11 FPDIVD.SRC 11 FPERR.SRC 11 FPINIT.SRC 11 FPMAC.SRC 11 FPRLOP.SRC 11 FPSQR.SRC 11 FPTEN.SRC 86 ftxtin function 4,5,10-11,25,30,31,37,38,39,40,42,47,50,51, 53,54,59,61,64-65,66-68,71,74,75-78,79,92, 93,101-104,116-117,118,119 93 function activation FXDCVT.SRC 11 aet global global alobal global GOTO data areas declarations level variables 5,40,53 43,86 51,86 23,43,70,75 23,95,101,102 5,14,39,41 hardware problems heap HELLO hex HOWTO.RUN 100 86,87,95 9,13 21,48 9 I/O po r ts identifier imbed impl emen ta t ion include files increments INDEX index INDIR.SRC INFO. NEW initialization INPT. SRC INPUT input input files installing in ROM in teg er s 76-77 32,34,37,38,39,63,101 41 4,14,38-40,50,61-62 4,41,61,85,103-107 36 66-67 18,42,43,55 11 interactive intersection intrinsic data types intrinsic procedures in trod uction 4 Jensen & Wirth 9 11,34,95 11,96 39 11,34,38,39,40,42,51,53-54,60,61-62,77 10-11,39,53-57 96 4,10-11,15,16,31,34,38,42,43,51,53,63/90,93, 94,97',115 11,19 16 66,87 2,14 jump table 2,12,20,32,38,40,90 92,96 39,43,50 39,69 keyboard 21 LO.SRC label 1 ang uage LAST.SRe legality 11 27,32,37,78,92 2,4,14,15,34,38,61,66,70,74-77 11,86,95 16,28,32,53,64-65,67,70 11,64,66-68,99 38,51,61,64,66-68 9,10,48,59,79-80,83,103 jrnp jump LENGTH length LIB.REL library library modules limitations line LINK.COM linked lists linker/loader list 2,9,10~11,48,66,70,79~80,83,86,103 9-11,48,79-84,86,95,96 40 10,31,32,38,51,53-54 9,13,49 20-·21,87 2,9,40,48-49,59,70,75-78,79-84,80,92 43,69,74 1 i s t i ng f i 1 e s load local data areas local level local variables log logarithm LOOK.SRe loops .lst .LST: LVL macro-code macros MAIN.SRC i'1AINMAP ma in module main program mantissa MARK max irowns MAXINT maxo ut membership memory memory locations memory requirements memory usage minuend mod MPNORM. SRC $MULT MULT.SRC multiply named equivalence NATLOG.SRC negative numbers nesting nesting levels NEW nibble non-reals null numbers objec t code odd open files operands operations operators OPFILE.SRC optimization optimizer options ord ordinal ordinal vc:lue 9,34,41-42,46-47,50 10, 11· 30,43,76 23,30,43 23,30,40,75,93 11 31 11 26,33,39,41,94 9,34,46-49,50-52 60 75 2,4,6,34,41,46-47,74-78 75-78,86,96 9,10,11,38,47,48,54,70,74,95,96 79 7 a- 7 1 , 7 9'- 8 4 40,51,70,79-84,85,86 11,89,99 5,40,87-88 16,38-39,51,54,66~67,69 16,38.,115,119 38,54 11,19 6,10,40,51,79-80,93-94,95,97,100 10,11,79-84,95,96,97 6,40,51,93,101 40,93-94,95,97-99 102 37 11 101,102 11 11,42,101,102 44-45 11 90 30,38,39,51,85 34,38,50,51 5,20-21,40,87-88 119 36,39 33,66 10-11,16,31,37,38,43,63,89,90,91,99, 101-107 2,9,47,96 31 38,53-54,96 15,103 15,40,61,66,102-103,114-115 4,115 11 . 4,5,36,43,91i 10,47-48 41-42,46,48,50,51,69,71,85,116-117,118 31 31,97 69 .ORG out 0 f r; a ng e OUTPT.SRC OUTPUT output output files overflow overhead OVERLAY.SRC overlays overlay modules OVLYGEN.COM OVLYMAP pack padding page pairing parameters parentheses parity parrnsz .PAS PAS248 PAS254 PASCAL48 PASCAL54 P_~SOPT passing by value passing by reference 47 42 11 39 42,47,51,60,61-62,76,90-91,100,11~-117 6,10-11,34,38,39,41,4n,53-57,87,96 42(50,51,95,102,118 93 10 4,9,10,34,61,79-84,86,100 9,34,46,79-84,100 10,79-80,83 79,83 39 90 5,40 95 30,38,40,42,43,51,53,54,65,67,70,74-77,92,93, 114-115,118 94,97-99,103 25,37 37 .~ 76 34,46 9,34,46,49,100 9,34,46,49 9,34,46,49,100 9,34,46,49,100 ~_ 0,4 i -48 30,65,67,102,115 :~0,43,5i,67 PEEK PFSTAT :~o query option quoted str ings 80,83 37,54,67,79,86,93,94 random access range-checking rang es 4,6,11,58,62 10,42,43,57,69 17,38,93 11 9,34,46,49,100 pointers 20-21,23,40,87-88,93,99 76-77 ports 9,11,16,38,89,101-104,114-120 precision pred 31 PRIMES 10 10 print printer 46-47,60 procedural parameters 5,40 5,10,20,30,31,37,38,39,40,42,47,50,51,54, procedure 66-67,70,71,74-78,79,87,92,93,101-104 procedure activation 93 processor 4,36 32 program structure 11 PSTAT.SRC 5,40,53 PUT RBLOCK. SRC read readln real 10~11,21,40,53-54,58,60,92 11,53-54 15,16,25,31,34,38,41,43,53-54,74,75,90,93,99, 101,102,114,118 realtofix record recurd numbers record zero recursion re-entrancy reference parameters references registers relational operators relative addresses r e 1 at i v e j urn ps relocatab1e modules relocatable object code modules relops RENERA.SRC RENDRV.PAS repeat ..) repeat loop rese rved wo rds reset RESET.SRC resident program restrictions return values rewrite REWRIT.SRC ROM ROTATE.SRC round ROUND.SRC roundoff error S-101 bus SAVREG. SRC scalars scientific notation search option semi-colons separate compilation separate modules separato rs sequential access sets SETCON.SRC SETFTN.SRC setlength shiftleft shiftright sign significance sin SINCOS.SRC sine size source code spaces 102 15,18-19,20-21,23,29,37,38,39,40,43,51,54,58, 62,64,76,93,98 58 58 3,30,52 3,4,95 94,97 22 10,11,36,74-77,92,95 11,25,67,103,115 95 43 9,48 48 See relational operators 10,59 10,59 26,37,39,41 26,39,41 37,114 12,53,58,60 12 79 5 53,74-77,115,118 12,53,60 12 3,4,95,96 12 12,31,89,117,118-119 12 89 100 12 15,17,22,26,30,31,39,64,74 91 80,83 32-33 4,9,51,61,70-73,77 51,61,70-73,79-84 32,37 58 11,15,19,37,38,43,94,99 12 12 11,66-68 101 101 63,89,90,99,101-107 38;70,75,103 30,31 12 11,31 11,21,34,38,40,44,54,69,80,86,96,102,114,115, 119-120 2,4,6,10,41,46,59,86,101 37,41,46,85,90 specifications sqr sqrt 38-40 31,119 12,30,31,119 12 10,11,31 11,31 ·SQRT.SRC square square root .SRC .·9,lO~11,34,46-49,77-78 SRELOP. SRC stack stack overflow standard functions standard language standard procedures statements s to rage 12 11,34,42,51,74-77,85,93-94,95,97-99,118 42,51 31 4,5,14,17,31,37,40,53,66 31 4,14,20-21,25,26,27,28,29,30,32,33,39,41,42, 5,10,20-21?23,36,39,40,75,76,87-88,93-94,103 12 22,43,63,86,93,94 4,lO-11,22,37,38,43,51,53,61,63,66-n8,79,86" 93,94,99,102-103 11 102 STRFCT.SRC s tr i ng cons tan ts . strings strlop strto fix structured equivalence 44-45 101,102,104-107 101 9,49 . 17,43,93 30,48 19 66 11,36,101,102,104-107 31 103 103 SUB subbyte subrni t subranges subroutines subsets substr ing s subtract succ supltzer suplzer InterPEST (InterSysterns Pascal Error Solving Tool) 4,9,48,118 70 21,32,34,37,38,51,52,70-71,83,92 4,42 Also see enumeration types 5,34':'35,50 32,58,71 • SYM symbol symbo1-ic input/output symbol table syntax syntax errors ~O tabs tables TEST.SUB text TEXT. SRC text files threaded code trace transportability trigonometric fcts troubleshooting trunc tr unca te .TYP type ~ 37,52 69 83 12,16,31,53-56,60 12 40,46,61,92 3 11,42,501'71 61 31 100 31 11,31,115,117,118-119 71 10,15,16,17,18,19,20-21,23,26,30,31,32,34-35, 37,40,42,44-45,50,53,54,61-62,65,66-67,70-71, 90,94,97,101-107,114.116 type declarations type table 15-21,32,34,40,44-45,50 6,34-35,44-45,50,67 .. U.C.S.D. JCTRANS 9 underflow union unpack unstructured relops unti 1 updates ___URE LO P • S RC 10 41,118 11,19 39 11 26,37 7 12 -,Jal ue pa rameters values var variable 42,94,97-99 30,31,39,50,51,61,62,64,67,89,95,103 23,37,94,104,114 10,15,16,17,20-21,23-24,25,26,27,30,32,36,39,40, 43,45,53,58,60,65,74-76,93,95,97-99,101,103, 114-116 variable access 24,36,43 variable declarations 23-24,32,40 variable length strings variable storage variant records verbose optic,n vocabulary vsiz warranty wboth wcomma wdollar :,,.rhi Ie ·wh.l.l e loop Wirth with words write writeln 4,10-11,61,66-68,99 20-21,36,87,97-99 14,87 80,83 37 7.5 109· 103,104-107 103 103 26,37,39,41, 26,33,39,41 2,43 29,37,39,43 37 11,40,53-57,58,60,90-91,92 11,54-57 XEMAIN.SRC XMAIN.SRC 9 zero 10,11,36,39,66,74,99,102,103,115,117 9