RAD-A248RAD-A248 550RE PAGE MSif.VA2U-3O.bI 10M~ . 070 iD4-01 9.eyMh. m II Final: 18 February 1992 to 01 Jun 19934. TITLE AND SUBTITLE 5. FUNDING NUMBERS Validation Summary Report;

RAD-A248 550RE PAGE 10M~ MSif.VA2U-3O.bI . 070 iD4-01 9.eyMh. m

II Final: 18 February 1992 to 01 Jun 19934. TITLE AND SUBTITLE 5. FUNDING NUMBERS

Validation Summary Report; Verdix Corporation, VADS IBM PS/2, AIX 1.1, Version6. 1, VAda-1 10-3535, IBM PS/2 Model 80 (Host & Target), 910920W1.1 1208

6. AUTHOR(S)

Wright-Patterson AFB, Dayton, OHUSA

7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION

Ada Validation Facility, Language Control Facility ASD/SCEL REPORT NUMBER

Bldg. 676, Rm 135 AVFVSR-498.0292Wright-Patterson AFB, Dayton, OH 45433

9. SPONSORINGR/4ONITORING AGENCY NAME(S) AND ADDRESS(ES) 10. SPONSORINGJMONITORING AGENCY

Ada Joint Program Office REPORT NUMBER

United States Department of DefensePentagon, Rm 3E 14Washington, D.C. 20301 -308111. SUPPLEMENTARY NOTES

12a. DISTRIBUTION/AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE

Approved for public release; distribution unlimited.

13. ABSTRACT (Maximum 200 Mds)

Verdix Corporation. VADS IBM PS/2, AIX 1. 1, Version 6. 1, Wright-Patterson AFB, VAda-1 10-3535, IBM PS/2 Model 80(Host & Target), AC"VC 1. 11.

DTIELECTESAPR 13 19

14. SUBJECT TERMS 15. NU1MER OF PAGES

Ada programming language, Ada Compiler Val. Summary Report, Ada Compiler Val. 16.__PRICE__CODECapability, Val. Testing, Ada Val. Office, Ada Val. Facility, ANSIIMIL-STD-1815A, AJPO. 16PIECE

17. SECURITY CLASSIFICATION 18. SECURITY CLASSIFICATION 19i. SECURITY CLASSIFICATION 20. LIMITATION OF ABSTRACTOF REPORT I OF ABSTRACT

UNCLASSIFIED UNCLASSIFED IUNCLASSIFIED _________

NSN 7540-01-280-55 Standard ForM 298, (Rev. 2-89)Pieated by ANSI Sid 239-128

Certificate Information

The following Ada implementation was tested and determined to pass ACVC1.11. Testing was completed on 20 September 1991.

Compiler Name and Version: VADS IBM PS/2, AIX 1.1, Version 6.1,VAda-l10-3535

Host Computer System: IBM PS/2 Model 80, AIX 1.1

Target Computer System: IBM PS/2 Model 80, AIX 1.1

Customer Agreement Number: 91-07-16-VRX

See section 3.1 for any additional information about the testingenvironment.

As a result of this validation effort, Validation Certificate910920W1.11208 is awarded to VEBDIX Corporation. This certificate expireson 1 June 1993.

This report has been reviewed and is approved.

Ma Validation FacilitySteven P. WilsonTechnical DirectorASD/SCELWright-Patterson AFB OH 45433-6503

AGOOgmion For-M i i -ganization ITIS GRA&IDirelto C mputer and Software Engineering Division D)TIC TABInstitute or Defense Analyses Unannounced 0Alexandria VA 22311 Jutification-

ByyDistribut iOjj

_JA_ Availability Codo

Joint Program Office l and/orDr. John Solomond, Director .ist SPOelaDepartment of DefenseWashington DC 20301

AVF Control Number: AVF-VSR-498.029218 February 1992

91-07-16-VRX

Ada COMPILERVALIDATION SUMMARY REPORT:

Certificate Number: 910920W1.11208VERDIX Corporation

VADS IBM PS/2, AIX 1.1, Version 6.1, VAda-110-3535IBM PS/2 Model 80 -> IBM PS/2 Model 80

Prepared By:AdaValidation Facility

ASD/SCELWright-Patterson AFB OH 45433-6503

92-09337

92 4 10 051

DECLARATION OF CONFORMANCE

The following declaration of conformance was supplied by the customer.

DECLARATION OF CONFORMANCE

Customer: Verdix Corporation

Ada Validation Facility: ASD/SCEL, WPAFB OH 45433-6503

ACVC Version: 1.11

Ada Implementation:

Compiler Name and Version: VADS IBM PS/2, AIX 1.1,Version 6.1, VAda-110-3535

Host Computer System: IBM PS/2 Model 80, AIX 1.1

Target Computer System: IBM PS/2 Model 80, AIX 1.1

Customer's Declaration:

(I/we], the undersigned, declare that (I/we] have noknowledge of deliberate deviations from the Ada LanguageStandard ANSI/MIL-STD-1815A in the implementationlisted above.

Customer Sigau Dafte

TABLE OF CONTENTS

CHAPTER 1 INTRODUCTION

1.1 USE OF THIS VALIDATION SUMMARY REPORT ......... 1-11.2 REFERENCES ....... .................... .1-21.3 ACVC TEST CLASSES ....... ............... .1-21.4 DEFINITION OF TERMS ..... ............... .. 1-3

CHAPTER 2 IMPLEMENTATION DEPENDENCIES

2.1 WITHDRAWN TESTS ....... ................. .2-12.2 INAPPLICABLE TESTS ...... ................ 2-12.3 TEST MODIFICATIONS ...................... .2-4

CHAPTER 3 PROCESSING INFORMATION

3.1 TESTING ENVIRONMENT ...... ............... .3-13.2 SUMMARY OF TEST RESULTS .... ............. .. 3-23.3 TEST EXECUTION ....... .................. 3-2

APPENDIX A MACRO PARAMETERS

APPENDIX B COMPILATION SYSTEM OPTIONS

APPENDIX C APPENDIX F OF THE Ada STANDARD

CHAPTER 1

INTRODUCTION

The Ada implementation described above was tested according to the AdaValidation Procedures [Pro90] against the Ada Standard [Ada83] using thecurrent Ada Compiler Validation Capability (ACVC). This Validation SummaryReport (VSR) gives an account of the testing of this Ada implementation.For any technical terms used in this report, the reader is referred to[Pro90]. A detailed description of the ACVC may be found in the currentACVC User's Guide [UG89].

1.1 USE OF THIS VALIDATION SUMMARY REPORT

Consistent with the national laws of the originating country, the AdaCertification Body may make full and free public disclosure of this report.In the United States, this is provided in accordance with the "Freedom ofInformation Act" (5 U.S.C. #552). The results of this validation applyonly to the computers, operating systems, and compiler versions identifiedin this report.

The organizations represented on the signature page of this report do notrepresent or warrant that all statements set forth in this report areaccurate and complete, or that the subject implementation has nononconformities to the Ada Standard other than those presented. Copies ofthis report- are available to the public from the AVF which performed thisvalidation or from:

National Technical Information Service5285 Port Royal RoadSpringfield VA 22161

Questions regarding this report or the validation test results should bedirected to the AVF which performed this validation or to:

Ada Validation OrganizationComputer and Software Engineering DivisionInstitute for Defense Analyses1801 North Beauregard StreetAlexandria VA 22311-1772

1-1

INTRODUCTION

1.2 REFERENCES

[Ada83] Reference Manual for the Ada Programing Language,ANSI/MIL-STD-1815A, February 1983 and ISO 8652-1987.

[Pro90] Ada Compiler Validation Procedures, Version 2.1, Ada JointProgram Office, August 1990.

[UG89] Ada Compiler Validation Capability User's Guide, 21 June 1989.

1.3 ACVC TEST CLASSES

Compliance of Ada implementations is tested by means of the ACVC. The ACVCcontains a collection of test programs structured into six test classes: A,B, C, D, E, and L. The first letter of a test name identifies the class towhich it belongs. Class A, C, D, and E tests are executable. Class B andclass L tests are expected to produce errors at compile time and link time,respectively.

The executable tests are written in a self-checking manner and produce aPASSED, FAILED, or NOT APPLICABLE message indicating the result when theyare executed. Three Ada library units, the packages REPORT and SPPRT13,and the procedure CHECK FILE are used for this purpose. The package REPORTalso provides a set of Identity functions used to defeat some compileroptimizations allowed by the Ada Standard that would circumvent a testobjective. The package SPPRT13 is used by many tests for Chapter 13 of theAda Standard. The procedure CHECK FILE is used to check the contents oftext files written by some of the Class C tests for Chapter 14 of the AdaStandard. The operation of REPORT and CHECK FILE is checked by a set ofexecutable tests. If these units are not operating correctly, validationtesting is discontinued.

Class B tests check that a compiler detects illegal language usage. ClassB tests are not executable. Each test in this class is compiled and theresulting compilation listing is examined to verify that all violations ofthe Ada Standard are detected. Some of the class B tests contain legal Adacode which must not be flagged illegal by the compiler. This behavior isalso verified.

Class L tests check that an Ada implementation correctly detects violationof the Ada Standard involving multiple, separately compiled units. Errorsare expected at link time, and execution is attempted.

In some tests of the ACVC, certain macro strings have to be replaced byimplementation-specific values - for example, the largest integer. A listof the values used for this implementation is provided in Appendix A. Inaddition to these anticipated test modifications, additional changes may berequired to remove unforeseen conflicts between the tests andimplementation-dependent characteristics. The modifications required forthis implementation are described in section 2.3.

1-2

INTRODUCTION

For each Ada implementation, a customized test suite is produced by theAVF. This customization consists of making the modifications described inthe preceding paragraph, removing withdrawn tests (see section 2.1), andpossibly removing some inapplicable tests (see section 2.2 and (UG891).

In order to pass an ACVC an Ada implementation must process each test ofthe customized test suite according to the Ada Standard.

1.4 DEFINITION OF TERMS

Ada Compiler The software and any needed hardware that have to be addedto a given host and target computer system to allowtransformation of Ada programs into executable form andexecution thereof.

Ada Compiler The means for testing compliance of Ada implementations,Validation consisting of the test suite, the support programs, the ACVCCapability user's guide and the template for the validation summary(ACVC) report.

Ada An Ada compiler with its host computer system and itsImplementation target computer system.

Ada Joint The part of the certification body which provides policy andProgram guidance for the Ada certification system.Office (AJPO)

Ada The part of the certification body which carries out thevalidation procedures required to establish the compliance of an AdaFacility (AVF) implementation.

Ada The part of the certification body that provides technicalValidation guidance for operations of the Ada certification system.Organization(AVO)

Compliance-of The ability of the implementation to pass an ACVC version.an AdaImplementation

Computer A functional unit, consisting of one or more computers andSystem associated software, that uses common storage for all or

part of a program and also for all or part of the datanecessary for the execution of the program; executesuser-written or user-designated programs; performsuser-designated data manipulation, including arithmeticoperations and logic operations; and that can executeprograms that modify themselves during execution. Acomputer system may be a stand-alone unit or may consist ofseveral inter-connected units.

1-3

INTRODUCTION

Conformity Fulfillment by a product, process, or service of allrequirements specified.

Customer An individual or corporate entity who enters into anagreement with an AVF which specifies the terms andconditions for AVF services (of any kind) to be performed.

Declaration of A formal statement from a customer assuring that conformityConformance is realized or attainable on the Ada implementation for

which validation status is realized.

Host Computer A computer system where Ada source programs are transformedSystem into executable form.

Inapplicable A test that contains one or more test objectives found to be

test irrelevant for the given Ada implementation.

ISO International Organization for Standardization.

LRM The Ada standard, or Language Reference Manual, published asANSI/MIL-STD-1815A-1983 and ISO 8652-1987. Citations fromthe LRM take the form "<section>.<subsection>:<paragraph>."

Operating Software that controls the execution of programs and thatSystem provides services such as resource allocation, scheduling,

input/output control, and data management. Usually,operating systems are predominantly software, but partial orcomplete hardware implementations are possible.

Target A computer system where the executable form of Ada programsComputer are executed.System

Validated Ada The compiler of a validated Ada implementation.Compiler

validated Ada An Ada implementation that has been validated successfullyImplementation either by AVF testing or by registration [Pro90].

Validation The process of checking the conformity of an Ada compiler tothe Ada programming language and of issuing a certificatefor this implementation.

Withdrawn A test found to be incorrect and not used in conformitytest testing. A test may be incorrect because it has an invalid

test objective, fails to meet its test objective, orcontains erroneous or illegal use of the Ada programminglanguage.

1-4

CHAPTER 2

IMPLEMENTATION DEPENDENCIES

2.1 WITHDRAWN TESTS

The following tests have been withdrawn by the AVO. The rationale forwithdrawing each test is available from either the AVO or the AVF. Thepublication date for this list of withdrawn tests is 2 August 1991.

E28005C B28006C C32203A C34006D C35508I C35508JC35508M C35508N C35702A C35702B B41308B C43004AC45114A C45346A C45612A C45612B C45612C C45651AC46022A B49008A B49008B A74006A C74308A B83022BB83022H B83025B B83025D C83026A B83026B C83041AB85001L C86001F C94021A C97116A C98003B BA2011ACB7001A CB7001B CB7004A CC1223A BC1226A CC1226BBC3009B BDlB02B BD1BO6A ADIBO8A BD2A02A CD2A21ECD2A23E CD2A32A CD2A41A CD2A41E CD2A87A CD2B15CBD3006A BD4008A CD4022A CD4022D CD4024B CD4024CCD4024D CD4031A CD4051D CD5111A CD7004C ED7005DCD7005E AD7006A CD7006E AD7201A AD7201E CD7204BAD7206A BD8002A BD8004C CD9005A CD9005B CDA201ECE2107I CE2117A CE2117B CE2119B CE2205B CE2405ACE3111C CE3116A CE3118A CE3411B CE3412B CE3607BCE3607C CE3607D CE3812A CE3814A CE3902B

2.2 INAPPLICABLE TESTS

A test is inapplicable if it contains test objectives which are irrelevantfor a given Ada implementation. Reasons for a test's inapplicability maybe supported by documents issued by the ISO and the AJPO known as AdaCommentaries and commonly referenced in the format AI-ddddd. For thisimplementation, the following tests were determined to be inapplicable forthe reasons indicated; references to Ada Commentaries are included asappropriate.

2-1

IMPLMETATION DEPENDENCIES

The following 201 tests have floating-point type declarationsrequiring more digits than SYSTEM.MAXDIGITS:

C24113L..Y (14 tests) C35705L..Y (14 tests)C35706L..Y (14 tests) C35707L..Y (14 tests)C35708L..Y (14 tests) C35802L..Z (15 tests)C45241L..Y (14 tests) C45321L..Y (14 tests)C45421L..Y (14 tests) C45521L..Z (15 tests)C45524L..Z (15 tests) C45621L..Z (15 tests)C45641L..Y (14 tests) C46012L..Z (15 tests)

The following 20 tests check for the predefined type LONG INTEGER; forthis implementation, there is no such type:

C35404C C45231C C45304C C45411C C45412CC45502C C45503C C45504C C45504F C45611CC45613C C45614C C45631C C45632C B52004DC55B07A B55B09C B86001W C86006C CD7101F

C35713C, B86001U, and C86006G check for the predefined typeLONGFLOAT; for this implementation, there is no such type.

C35713D and B86001Z check for a predefined floating-point type with aname other than FLOAT, LONG FLOAT, or SHORT FLOAT; for thisimplementation, there is no such type.

A35801E checks that FLOAT'FIRST..FLOAT'LAST may be used as a rangeconstraint in a floating-point type declaration; for thisimplementation, that range exceeds the range of safe numbers of thelargest predefined floating-point type and must be rejected. (Seesection 2.3.)

C45531M..P and C45532M..P (8 tests) check fixed-point operations fortypes that require a SYSTEM.MAX MANTISSA of 47 or greater; for thisimplementation, MAX MANTISSA is le-ss than 47.

C45624A..B (2 tests) check that the proper exception is raised ifMACHINEOVERFLOWS is FALSE for floating point types and the results ofvarious floating-point operations lie outside the range of the basetype; for this implementation, MACHINEOVERFLOWS is TRUE.

B86001Y uses the name of a predefined fixed-point type other than typeDURATION; for this implementation, there is no such type.

C96005B uses values of type DURATION's base type that are outside therange of type DURATION; for this implementation, the ranges are thesame.

CD1009C checks whether a length clause can specify a non-default sizefor a floating-point type; this implementation does not support suchsizes.

2-2


CD2A84A, CD2A84E, CD2A84I..J (2 tests), and CD2A840 use length clausesto specify non-default sizes for access types; this implementationdoes not support such sizes.

The tests listed in the following table check that USE ERROR is raisedif the given file operations are not supported for the ,iivencombination of mode and access method; this implementation supportsthese operations.

Test File Operation Mode File Access Method

CE2102D CREATE IN FILE SEQUENTIAL 10CE2102E CREATE OUT FILE SEQUENTIALIOCE2102F CREATE INOUT FILE DIRECT 10CE2102I CREATE IN FILE DIRECT IOCE2102J CREATE OUT FILE DIRECT IOCE2102N OPEN IN FILE SEQUENTIAL 10CE21020 RESET IN-FILE SEQUENTIAL--IOCE2102P OPEN OUT FILE SEQUENTIAL-10CE2102Q RESET OUTFFILE SEQUENTIAL 10CE2102R OPEN INOUT FILE DIRECT 10CE2102S RESET INOUT-FILE DIRECT-IOCE2102T OPEN IN FILE DIRECT-IOCE2102U RESET IN FILE DIRECT IOCE2102V OPEN OUT FILE DIRECT IOCE2102W RESET OUT-FILE DIRECT-10CE3102E CREATE IN FILE TEXT 15CE3102F RESET Any Mode TEXT-IOCE3102G DELETE TEXT IOCE3102I CREATE OUT FILE TEXT IOCE3102J OPEN IN FILE TEXT 10CE3102K OPEN OUT FILE TEXTIO

CE2203A checks that WRITE raises USE ERROR if the capacity of anexternal sequential file is exceeded;- this implementation cannotrestrict file capacity.

CE2403A checks that WRITE raises USE ERROR if the capacity of anexternal direct file is exceeded; this implementation cannot restrictfile capacity.

CE3304A checks that SET LINE LENGTH and SET PAGE LENGTH raiseUSE ERROR if they specify an inappropriate value fo the externalfile; there are no inappropriate values for this implementation.

CE3413B checks that PAGE raises LAYOUT ERROR when the value of thepage number exceeds COUNT'LAST; for this implementation, the value ofCOUNT'LAST is greater than 150000, making the checking of thisobjective impractical.

2-3


2.3 TEST MODIFICATIONS

Modifications (see section 1.3) were required for 20 tests.

The following tests were split into two or more tests because thisimplementation did not report the violations of the Ada Standard in theway expected by the original tests.

B24009A B33301B B38003A B38003B B38009A B38009BB85008G B85008H BC1303F BC3005B BD2BO3A BD2DO3ABD4003A

A35801E was graded inapplicable by Evaluation Modification as directed bythe AVO. The compiler rejects the use of the rangeFLQAT'FIRST..FLOAT'LAST as the range constraint of a floating-point typedeclaration because the bounds lie outside of the range of safe numbers(cf. LRM 3.5.7:12).

CD1009A, CD1009I, CD1C03A, CD2A31A..C (3 tests) were graded passed byEvaluation Modification as directed by the AVO. These tests useinstantiations of the support procedure LENGTH CHECK, which usesUnchecked Conversion according to the interpreEtation given in AI-00590.The AVO ruled that this interpretation is not binding under ACVC 1.11; thetests are ruled to be passed if they produce Failed messages only from theinstances of LENGTH CHECK-i.e, the allowed Report.Failed messages havethe general form:

* CHECK ON REPRESENTATION FOR <TYPE ID> FAILED."

2-4

CHAPTER 3

PROCESSING INFORMATION

3.1 TESTING ENVIRONMENT

The Ada implementation tested in this validation effort is described

adequately by the information given in the initial pages of this report.

For technical information about this Ada implementation, contact:

Jean Jaiswal/Sam QuiringVerdix Corporation1600 NW Compton Drive, Suite 357Aloha OR 97006-6905(503) 690-1116

For sales information about this Ada implementation, contact:

Stephen F. ZeiglerVerdix Corporation1600 NW Compton Drive, Suite 357Aloha OR 97006-6905(503) 690-1116

Testing of this Ada implementation was conducted at the customer's site bya validation team from the AVF.

3-1

PROCESSING INFORnATIcN

3.2 SUMMARY OF TEST RESULTS

An Ada Implementation passes a given ACVC version if it processes each testof the customized test suite in accordance with the Ada ProgrammingLanguage Standard, whether the test is applicable or inapplicable;otherwise, the Ada Implementation fails the ACVC [Pro90].

For all processed tests (inapplicable and applicable), a result wasobtained that conforms to the Ada Programmning Language Standard.

The list of items below gives the number of ACVC tests in variouscategories. All tests were processed, except those that were withdrawnbecause of test errors (item b; see section 2.1), those that require afloating-point precision that exceeds the implementation's maximnmprecision (item e; see section 2.2), and those that depend on the supportof a file system - if none is supported (item d). All tests passed,except those that are listed in sections 2.1 and 2.2 (counted in items band f, below).

a) Total Number of Applicable Tests 3805b) Total Number of Withdrawn Tests 95c) Processed Inapplicable Tests 69d) Non-Processed I/O Tests 0e) Non-Processed Floating-Point

Precision Tests 201

f) Total Number of Inapplicable Tests 270

g) Total Number of Tests for ACVC 1.11 4170

3.3 TEST EXECUTICN

A magnetic tape containing the customized test suite (see section 1.3) wastaken on-site by the validation team for processing. The contents of themagnetic tape were loaded onto a Sun Workstation and copied over Ethernetto the host computer.

After the test files were loaded onto the host computer, the full set oftests was processed by the Ada implementation.

Testing was performed using command scripts provided by the customer andreviewed by the validation team. See Appendix B for a complete listing ofthe processing options for this implementation. It also indicates thedefault options. The options invoked explicitly for validation testingduring this test were:

3-2

PROCESSING INFORMATION

Option/Switch Effect

-w suppress generation of warning messages

Test output, compiler and linker listings, and job logs were captured onmagnetic tape and archived at the AVF. The listings examined on-site bythe validation team were also archived.

3-3

APPENDIX A

MACRO PARAMETERS

This appendix contains the macro parameters used for customizing the ACVC.The meaning and purpose of these parameters are explained in [UG891. Theparameter values are presented in two tables. The first table lists thevalues that are defined in terms of the maximum input-line length, which isthe value for SMAX IN LEN-also listed here. These values are expressedhere as Ada string-aggregates, where "V1 represents the maximum input-linelength.

Macro Parameter Macro Value

$MAXINLEN 499

$BIG IDI (l..V-l => 'A', V-> '1')

$BIG ID2 (l..V-l ,> 'A', V -> '2')

$BIG ID3 (l..V/2-> 'A') & '3' &(l..V-l-V/2 -> 'A')

$BIG ID4 (l..V/2-> 'A') & '4' &(i..V-I-V/2 > 'A' )

$BIG INT LIT (l..V-3 -> '0') & "298"

$BIG REALLIT (l..V-5 -> '0') & "690.0"

$BIG STRING1 '"' & (1..V/2 -> 'A') & '"'

$BIGSTRING2 "' & (1..V-I-V/2 -> 'A') & '1' &

$BLANKS (l..V-20 -> '

SMAX LEN INT BASED LITERAL"2:" & (1..V-5-> '0') & "11:"

$MAX LEN REAL BASED LITERAL

"16:" & (1..V-7 -> '0') & "F.E:"

A-i

MACRO PARAMETERS

SMAXSTRINGLITERAL '" & (1..V-2 -> 'A') & ""

The following table lists all of the other macro parameters and theirrespective values.

Macro Parameter Macro Value

SACC SIZE 32

$ALIGMENT 4

$COUNT _LAST 2_147483_647

$DEFAULT MEM SIZE 16_777_216

$DEFAULTSTORUNIT 8

SDEFAULTSYS-NAME IBMPS2_AIX

$DELTADOC 0.0000000004656612873077392578125

SENTRYADDRESS SYSTEM."+"(16#40#)

SENTRYADDRESS1 SYSTEM."+"(16#80#)

SENTRYADDRESS2 SYSTEM."+"(16#100#)

$FIELDLAST 2_147_483_647

$FILETERMINATOR ' '

$FIXED NAME NO SUCHTYPE

S FLOATNAME NOSUCHTYPE

$FORMSTRING ""

$FORMSTRING2 "CANNOT-RESTRICT FILE-CAPACITY"

SGREATERTHANDURATION

1000 00.0

$GREATERTHANDURATION BASE LAST- TO_005 _00

$GREATERTHANFLOAT BASE LAST

- 1.1E+308

$GREATER_THANFLOAT SAFE LARGE- 5.'E307

A-2

MACRO PARAMETERS

$GREATERTHANSHORT FLOAT SAFE LARGE_ _ -9.07E37

$HIGHPRIORITY 99

$ ILLEGALEXTERNAL FILE NAZ4E1V/illegal/file name/2}]%2102c.dat"

$ ILLEGALEXTERNAL FILE NANE2V/illegal/file naxe/CE2102C*.dat"

$ INAPPROPRIATELINELENGTH-1

$ INAPPROPRIATEPAGE -LENGTH-1

$INCLUDEPRAGMAl1 PRAGMA INCLUDE ("A28006D1.TST")

$INCLUDEPRAGMA2 PRAGMA INCLUDE ("B28006D1.TST")

$INTEGERFIRST -2_147_483_648

$INTEGERLAST 2_147_483_647

$INTEGERLASTPLUS_1 2_147_483_648

$ INTERFACELANGUAGE C

SLESSTHANDURATION -100_000.0

SLESSTHANDURATION BASE FIRST_ _ - -0 _000_000.0

$LINE-TERMINATOR ASCII.LF

$LOWPRIORITY 0

-$SMACHINECODE-STATEMENTT

CODE_0'(OP -> NOP);

SMACHINECODETYPE CODE 0

$MANTISSADOC 31

$MAXDIGITS 15

SMAX fINT 2 147_483_647

SMAXINTPLUS_1 2_147_483_648

SMININr -2_147_483_648

$NAME TINY INTEGER

A- 3

MACRO PARAMETERS

$NAMELIST IBM PS2 AIX

$NAME_SPECIFICATIONi /u/acvcjll1/c/e/X2120A

$NAMESPECIFICATION2 AI/acvcl 11/c/e/X212OB

$NAMESPECIFICATION3 /u/acvcl 11/C/e/X3119A

$NEG-BASED INT 16#FOOOOOOE#

$NEWMENSIZE 16_777_216

$NEWSTORUNIT 8

$NEWSYS-NAME IBMPS2_AIX

$PAGETERMINAIOR ASCII .LF & ASCII.FF

$RECORDDEFINITION RECORD SUEP: OPERAND; END RECORD;

$RECORDNAME CODE_0

$TASKSIZE 32

$TASKSTORAGESIZE 1024

$TICK 0.01

$VARIABLEADDRESS VAR_1 'ADDRESS

$VARIABLEADDRESS 1 VAR_2 'ADDRESS

$VARIABLEADDRESS 2 VAR 3 'ADDRESS

$YOURPRAGMA PRAGMA% PASSIVE

A-4

APPENDIX B

COMPILATION SYSTEM OPTIONS

The compiler options of this Ada implementation, as described in thisAppendix, are provided by the customer. Unless specifically notedotherwise, references in this appendix are to compiler documentation andnot to this report.

ada

Ada compiler

Syntax

ada (options] (sourcefile] ... [linkeroptions)[objectfile.o]...

Description

The command ada executes the Ada compiler and compiles thenamed Ada source file, ending with the .a suffix. The filemust reside in a VADS library directory. The ada.lib file inthis directory is modified after each Ada unit is compiled.

The object for each compiled Ada unit is left in a file withthe same name as that of the source with 01, 02, etc.substituted for .a. The -o option can be used to produce anexecutable with a name other than a.out, the default. Forcross compilers, the default name is a.vox.

By default, ada produces only object and net files. If the-M option is used, the compiler automatically invokes a.ldand builds a complete program with the named library unit asthe main program.

Non-Ada object files (.o files produced by a compiler foranother language) may be given as arguments to ada. Thesefiles will be passed on to the linker and will be linkedwith the specified Ada object files.

B-1


Command line options may be specified in any order, but theorder of compilation and the order of the files to be passedto the linker can be significant.

Several VADS compilers may be simultaneously available on asingle system. Because the ada command in anyVADS location/bin on a system will execute the correctcompTler components based upon visible library directives,the option -sh is provided to print the name of thecomponents actually executed.

Program listings with a disassembly of machine codeinstructions are generated by a.db or a.das.

Options

-a file name (archive) Treat file name as an ar file.Since some archive files end with .a, -a is used todistinguish archive files from Ada source files/

-d (dependencies) Analyze for dependencies only. Do not dosemantic analysis or code generation. Update the library,marking any defined units as uncompiled. The -d option isused by a.make to establish dependencies among new files.

-e (error) Process compilation error messages using a.erro

r and send it to standard output. Only the source linescontaining errors are listed. Only one -e or -E optionshould be used.

-E

-E file

-E directory (error output) Without a file or directoryargument, ada processes error messages using a.error anddirects a brief output to standard output; the raw errormessages are left in ada source.err. If a file pathname isgiven, the raw error messages are placed in that file. If adirectory argument is supplied, the raw error output isplaced in dir/source.

err. The file of raw error messages can be used as input toa.error

-el (error listing) Intersperse error messages among sourcelines and direct to standard output.

-El

-El file

-El directory (error listing) Same as the -E option, except that

B-2


source listing with errors is produced.

-ev (error vi(1)) Process syntax error messages usinga.error, embed them in the source file, and call theenvironment editor ERROR EDITOR. (If ERROR EDITOR isdefined, the environmentvariable ERROR PATTERN should alsobe defined." ERROR PATTERN is an editor search coimnand thatlocates the first-occurrence of '###' in the error file.) Ifno editor is specified, call vi(1).

-K (keep) Keep the intermediate language (IL) fileproduced by the compiler front end.

-L libraryname (library) Operate in VADS librarylibraryname (the current working directory is the default).

-ifile abbreviation (library search) This is an optionpassedto the UNIX linker, ld(l) telling it to search thespecified library file. (No space between the -1 and thefile abbreviation.)

For a description of the file abbreviations, see alsoOperating system documentation, ld(l)

-M unit name (main) Produce an executable program usingthe namid unit as the main program. The unit must be eithera parameterless procedure or a parameterless functionreturning an integer. The executable program will be left inthe file a.out unless overridden with the -o option.

-M source file (main) This option is like -M unitname, exceptthat the unit name is assumed to be the rootname of the .a file (for foo.a the unit is foo. Only one .a filemay be preceded by -M.

-o executable file (output) This option is to be used inconjunction with the -M option. executable file is the nameof the executable rather than the default i.out.

-0[0-91 (optimize) Invoke the code optimizer (OPTIM2). Anoptional digit (there is no space before the digit) limitsthe number of passes by the optimizer:

no -0 option, make one pass

-0 no digit, optimize as far as possible

-00 prevents optimization

-01 no hoisting

-09 full optimization

The addition of the INFO directive, OPTIM3:INFO:TRUE, to the

B-3


ada.lib will cause the compiler to use a new optimizer (OPTIM3)that generates faster code.

The default level of optimization for OPTIM3 is 04. Notethat optimization levels for OPTIM3 are more than simplyadditional iterations:

-O full optimization (same as OPTIM2 ada -09)

-00 prevents optimization

-01 no hoisting (same as OPTIM2 ada -01)

-02 no hoisting but more passes

-03 no hoisting but even more passes

-04 hoisting from loops

-05 hoisting from loops but more passes

-06 hoisting from loops with maximum passes

-07 hoisting from loops and branches

-08 hoisting from loops and branches, more passes

-09 hoisting from loops and branches, maximum passes

Hoisting from branches (and cases alternatives) can be slowand does not always provide significant performance gains soit can be suppressed.

For information on linker INFO directives see USER'S GUIDE,INFO Directive Names on page

a.info on page , and for more information aboutoptimization, see USER'S GUIDE, Compiler Optimizations onpage ;

-R VADS library (recompile instantiation) Force analysisof all generic instantiations, causing reinstantiation ofany that are out of date.

-S (suppress) Apply pragma SUPPRESS to the entirecompilation for all suppressible checks.

-sh (show) Display the name of the tool executable but donot execute it.

-T (timing) Print timing information for the compilation.

-v (verbose) Print compiler version number, date and timeof compilation, name of file compiled, command input line,

B-4


total compilation time, and error summary line. Storageusage information about the object file is provided. withOPTIM3 the output format of compression (the size ofoptimized instructions) is as a percentage of input(unoptimized instructions).

-w (warnings) Suppress warning diagnostics.

See also a.das on page ; a.db on page ; a.error cii page ;a.ld on page ; a.mklib on page ; and Operating Systemreference documentation for the ld(l) utility.

Diagnostics

The diagnostics produced by the VADS compiler are intendedto be self-explanatory. Most refer to the RM. Each RM referenceincludes a section number and optionally, a paragraph numberenclosed in parentheses.

LINKER OPTIONS

The linker options of this Ada implementation, as described in thisAppendix, are provided by the customer. Unless specifically notedotherwise, references in this appendix are to linker documentation and notto this report.

a.ld

prelinker

Syntax

a.ld [options] unitname [ld_options]

Options

-DX (debug) Debug memory overflow (use in cases wherelinking a large number of units causes the error messagelocal symbol overflow" to occur).

-E unit name (elaborate) Elaborate unit name as early inthe elaBoration order as possible.

-F (files) Print a list of dependent files in order andsuppress linking.

-L library name (library) Operate in VADS librarylibrary name (the current working directory is the default).

-o executable file (output) Use the specified file name as

B-5


the name of the output rather than the default, a.out.

-sh (show) Display the name of the tool executable but donot execute it.

-U (units) Print a list of dependent units in order and

suppress linking.

-v (verbose) Print the linker command before executing it.

-v (verify) Print the linker command but suppressexecution.

Description

a.ld collects the object files needed to make unit name amain program and calls the UNIX linker ld(l) to linktogether all Ada and other language objects required toproduce an executable image in a.out. unit name is themain program and must name a non-generic suBprogram. Ifunit name is a function, it must return a value of the typeSTANbDAD.INTEGER. This integer result will be passed back tothe UNIX shell as the status code of the execution. The utilityuses the net files produced by the Ada compiler to checkdependency information. a.ld produces an exception mappingtable and a unit elaboration table and passes thisinformation to the linker.

a.ld reads instructions for generating executables from theada.lib file in the VADS libraries on the search list.Besides information generated by the compiler, thesedirectives also include WITHn directives that allow theautomatic linking of object modules compiled from otherlanguages or Ada object modules not named in context clausesin the Ada source. Any number of WITHn directives may beplaced into a library, but they must be numberedcontiguously beginning at WITH1. The directives are recordedin the library's ada.lib file and have the following form.

WITHI :LINK:objectfile:

WITH2:LINK:archive file:

WITHn directives may be placed in the local Ada libraries orin any VADS library on the search list.

A WITHn directive in a local VADS library or earlier on thelibrary search list will hide the same numbered WITHndirective in a library later in the library search list.

Use the tool a.info to change or report library directivesin the current library.

B-6


All arguments after unit name are passed on to the linker.These may be options for-it, archive libraries, libraryabbreviations, or object files.

VADS location/bin/a.ld is a wrapper program that executesthe correct executable based upon directives visible in theada.lib file. This permits multiple VADS compilers to existon the same host. The -sh option prints the name of theactual executable file.

Files

a.out default output fileVADSlocation/standard/* startup and standard library routines

See also Operating system documentation, ld(l).

Diagnostics

Self-explanatory diagnostics are produced for missing files,etc. Additional messages are produced by the UNIX linker ld.

B-7

APPENDIX C

APPENDIX F OF THE Ada STANDARD

The only allowed implementation dependencies correspond toimplementation-dependent pragmas, to certain machine-dependent conventionsas mentioned in Chapter 13 of the Ada Standard, and to certain allowedrestrictions on representation clauses. The implementation-dependentcharacteristics of this Ada implementation, as described in this Appendix,are provided by the customer. Unless specifically noted otherwise,references in this Appendix are to compiler documentation and not to thisreport. Implementation-specific portions of the package STANDARD, whichare not a part of Appendix F, are:

package STANDARD is

type INTEGER is range -2147483648 .. 2147483647;type SHORT INTEGER is range -32768 .. 32767;type TINY _NTEGER is -128 .. 127;

type FLOAT is digits 15 range -1.79769313486232E+3081. 79769313486232E+308;

type SHORTFLOAT is digits 6 range -3.40282E+383.40282E+38;

typeDURATION is delta 0.0001 range -214748.3648214748.3647;

end STANDARD;

C-1


ATTACHMENT I

APPENDIX F. Implementation-Dependent Characteristics

1. Implementation-Dependent Pragmas

1.1. INLINEONLY Pragma

The INLINE ONLY pragma, when used in the same way as pragmaINLINE, indicates to the compiler that the subprogram mustalways be inlined. This pragma also suppresses the genera-tion of a callable version of the routine which saves codespace. If a user erroneously makes an INLINE ONLY subpro-gram recursive a warning message will be emitted and anPROGRAM ERROR will be raised at run time.

1.2. BUILTIN Pragma

The BUILT IN pragma is used in the implementation of somepredefine3 Ada packages, but provides no user access. It isused only to implement code bodies for which no actual Adabody can be provided, for example the MACHINECODE package.

1.3. SHARE CODE Pragma

The SHARECODE pragma takes the name of a generic instantia-tion or a generic unit as the first argument and one of theidentifiers TRUE or FALSE as the second argument. Thispragma is only allowed immediately at the place of adeclarative item in a declarative part or package specifica-tion, or after a library unit in a compilation, but beforeany subsequent compilation unit.

When the first argument is a generic unit the pragma appliesto all instantiations of that generic. When the first argu-ment is the name of a generic instantiation the pragmaapplies only to the specified instantiation, or overloadedinstantiations.

If the second argument is TRUE the compiler will try toshare code generated for a generic instantiation with codegenerated for other instantiations of the same generic.

C-2


When the second argument is FALSE each instantiation willget a unique copy of the generated code. The extent towhich code is shared between instantiations depends on thispragma and the kind of generic formal parameters declaredfor the generic unit.

The name pragma SHARE BODY is also recognized by the imple-mentation and has the same effect as SHARE CODE. It isincluded for compatability with earlier versions of VADS.

1.4. NOIMAGE Pragma

The pragma suppresses the generation of the image array usedfor the IMAGE attribute of enumeration types. This elim-inates the overhead required to store the array in the exe-cutable image. An attempt to use the IMAGE attribute on atype whose image array has been suppressed will result in acompilation warning and PROGRAMERROR raised at run time.

1.5. EXTERNAL NAME Pragma

The EXTERNAL NAME pragma takes the name of a subprogram orvariable defined in Ada and allows the user to specify adifferent external name that may be used to reference theentity from other languages. The pragma is allowed at theplace of a declarative item in a package specification andmust apply to an object declared earlier in the same packagespecification.

1.6. INTERFACE NAME Pragma

The INTERFACE NAME pragma takes the name of a a variable orsubprogram defined in another language and allows it to bereferenced directly in Ada. The pragma will replace alloccurrences of the variable or subprogram name with anexternal reference to the second, link argument. The pragmais allowed at the place of a declarative item in a packagespecification and must apply to an object or subprogramdeclared earlier in the same package specification. Theobject must be declared as a scalar or an access type. Theobject cannot be any of the following:

a loop variable,a constant,an initialized variable,an array, ora record.

1.7. IMPLICIT CODE Pragma

Takes one of the identifiers ON or OFF as the single argu-ment. This pragma is only allowed within a machine codeprocedure. It specifies that implicit code generated by thecompiler be allowed or disallowed. A warning is issued if

C-3


OFF is used and any implicit code needs to be generated.The default is ON.

1.8. OPTIMIZECODE Pragma

Takes one of the identifiers ON or OFF as the single argu-ment. This pragma is only allowed within a machine codeprocedure. It specifies whether the code should be optim-ized by the compiler. The default is ON. When OFF isspecified, the compiler will generate the code as specified.

2. Implementation of Predefined Pragmas

2.1. CONTROLLED

This pragma is recognized by the implementation but has noeffect.

2.2. ELABORATE

This pragma is implemented as described in Appendix B of theAda Rm.

2.3. INLINE

This pragma is implemented as described in Appendix B of theAda RM.

2.4. INTERFACE

This pragma supports calls to 'C' and FORTRAN functions. TheAda subprograms can be either functions or procedures. Thetypes of parameters and the result type for functions mustbe scalar, access or the predefined type ADDRESS in SYSTEM.All parameters must have mode IN. Record and array objectscan be passed by reference using the ADDRESS attribute.

2.5. LIST


2.6. MEMORY SIZE

This pragma is recognized by the implementation. The imple-mentation does not allow SYSTEM to be modified by means ofpragmas, the SYSTEM package must be recompiled.

2.7. NON-REENTRANT

This pragma takes one argument which can be the name ofeither a library subprogram or a subprogram declared immedi-ately within a library package spec or body. It indicates

C-4


to the compiler that the subprogram will not be calledrecursively allowing the compiler to perform specific optim-izations. The pragma can be applied to a subprogram or aset of overloaded subprograms within a package spec or pack-age body.

2.8. NOT ELABORATED

This pragma can only appear in a library package specifica-tion. It indicates that the package will not be elaboratedbecause it is either part of the RTS, a configuration pack-age or an Ada package that is referenced from a languageother than Ada. The presence of this pragma suppresses thegeneratiolA of elaboration code and issues warnings if ela-boration code is required.

2.9. OPTIMIZE


2.10. PACK

This pragma will cause the compiler to choose a non-alignedrepresentation for composite types. It will not causesobjects to be packed at the bit level.

2.11. PAGE

This pragma is implemented as described in Appendix B of theAda Rm.

2.12. PASSIVE

The pragma has three forms

PR.GMA PASSIVE;PRAGMA PASSIVE(SEMAPHORE);-RAGMA PASSIVE( INTERRUPT, <number>);

This pragma Pragma passive can be applied to a task or tasktype declared imediately within a library package spec orbody. The pragma directs the compiler to optimize certaintasking operations. It is possible that the statements in atask body will prevent the intended optimization, in thesecases a warning will be generated at compile time and willraise TASKING ERROR at runtime.

2.13. PRIORITY


C-5


2.14. SHARED


2.15. STORAGE UNIT


2.16. SUPPRESS

This pragma is implemented as described, except thatDIVISION CHECK and in some cases OVERFLOW CHECK cannot besuppressed.

2.17. SYSTEM NAME


3. Implementation-Dependent Attributes

3.1. P'REF

For a prefix that denotes an object, a program unit, alabel, or an entry:

This attribute denotes the effective address of the first ofthe storage units allocated to P. For a subprogram, pack-age, task unit, or label, it refers to the address of themachine code associated with the corresponding body orstatement. For an entry for which an address clause hasbeen given, it refers to the corresponding hardware inter-rupt. The attribute is of the type OPERAND defined in thepackage MACHINE CODE. The attribute is only allowed withina machine code procedure.

See section F.4.8 for more information on the use of thisattribute.

(For a package, task unit, or entry, the 'REF attribute isnot supported.)

3.2. T'TASKID

For a task object or a value T, T'TASK ID yields the uniquetask id associated with a task. The value of this attributeis of the type ADDRESS in the package SYSTEM.

C-6


4. Specification Of Package SYSTEM

with UNSIGNED TYPES;package SYSTEM is

pragma suppress(ALLCHECKS);pragma suppress(EXCEPTIONTABLES);pragma notelaborated;

type NAME is ( ibm_ps2_aix );

SYSTEM NAME : constant NAME := ibmnps2_aix;

STORAGE UNIT : constant :-8;MEMORY_SIZE : constant :-16_777_216;

- System-Dependent Named Numbers

MIN INT : constant :- -2 147 483 648;MAX-INT : constant :- 2 147_ 83_347;MAX-DIGITS : constant := i ;MAX -MANTISSA : constant :-31;FINE DELTA : constant :2.0*(-31);TICK-- : constant := 0.01;

- Other System-dependent Declarations

subtype PRIORITY is INTEGER range 0 .. 99;

MAXRECSIZE : integer :- 64*1024;

type ADDRESS is private;

function ">" (A: ADDRESS; B: ADDRESS) return BOOLEAN;function "<" (A: ADDRESS; B: ADDRESS) return BOOLEAN;function ">-"(A: ADDRESS; B: ADDRESS) return BOOLEAN;function "<-"(A: ADDRESS; B: ADDRESS) return BOOLEAN;

- - function - (A: ADDRESS; B: ADDRESS) return INTEGER;function + (A: ADDRESS; I: INTEGER) return ADDRESS;function "-" (A: ADDRESS; I: INTEGER) return ADDRESS;

function "+" (I: UNSIGNED TYPES.UNSIGNEDINTEGER)return ADDRESS;

function MEMORY ADDRESS(I: UNSIGNED TYPES.UNSIGNED INTEGER) return ADDRESSrenames "+";

NO ADDR : constant ADDRESS;

type TASK ID is private;NO TASK ID : constant TASK ID;

C-7


subtype SIG STATUS T is INTEGER;SIG STATUSSIZE: constant :- 4;

type PROGRAM ID is private;NOPROGRAMID : constant PROGRAM_ID;

type LONG ADDRESS is private;

NO LONG ADDR : constant LONG ADDRESS;

function "+" (A: LONG ADDRESS; I: INTEGER) return LONG ADDRESS;function "-" (A: LONGADDRESS; I: INTEGER) return LONG ADDRESS;

function MAKELONGADDRESS (A: ADDRESS) return LONGADDRESS;

function LOCALIZE(A: LONG ADDRESS ; BYTE SIZE : INTEGER)return ADDRESS;

function STATIONOF(A: LONG ADDRESS) return INTEGER;

private

type ADDRESS is new UNSIGNEDTYPES.UNSIGNEDINTEGER;

NO ADDR : constant ADDRESS :- 0;

pragma BUILT IN(">");pragma BUILT IN( "<");pragma BUILT IN( ">-" );pragma BUILT IN("<-");pragma BUILT IN("-");pragma BUILTIN("+");

type TASK ID is new UNSIGNED TYPES.UNSIGNEDINTEGER;NO TASKID : constant TASKID :- 0;

type PROGRAM ID is new UNSIGNED TYPES.1UNSIGQED INTEGER;NO PROGRAM ID : constant PROGRAM ID :- 0;

type LONGADDRESS is new UNSIGNEDTYPES.UNSIGNED INTEGER;

NOLONG ADDR : constant LONG ADDRESS :- 0;

pragma BUILT IN(MAKE LONG ADDRESS);pragma BUILT-IN(LOCALIZE);pragma BUILT_IN(STATION_OF);

end SYSTEM;

C-8


5. Restrictions On Representation Clauses

5.1. Pragma PACK

In the absence of pragma PACK record components are paddedso as to provide for efficient access by the targethardware, pragma PACK applied to a record eliminates the pad-ding where possible. Pragma PACK has no other effect on thestorage allocated for record components a record representa-tion is required.

5.2. Size Clauses

For scalar types a representation clause will pack to thenumber of bits required to represent the range of the sub-type. A size clause applied to a record type will not causepacking of components; an explicit record representationclause must be given to specify the packing of the com-ponents. A size clause applied to a record type will causepacking of components only when the component type is adiscrete type. An error will be issued if there is insuffi-cient space allocated. The SIZE attribute is not supportedfor task, access, or floating point types.

5.3. Address Clauses

Address clauses are only supported for variables. Sincedefault initialization of a variable requires evaluation ofthe variable address elaboration ordering re4uirementsprohibit initialization of variables which have addressclauses. The specified address indicates the physicaladdress associated with the variable.

5.4. Interrupts

Interrupt entries are not supported.

5.5. -Representation Attributes

The ADDRESS attribute is not supported for the followingentities:

PackagesTasksLabelsEntries

5.6. Machine Code Insertions

Machine code insertions are supported.

C-9


The general definition of the package MACHINE CODE providesan assembly language interface for the target machine. Itprovides the necessary record type(s) needed in the codestatement, an enumeration type of all the opcode mnemonics,a set of register definitions, and a set of addressing modefunctions.

The general syntax of a machine code statement is as fol-

lows:

CODE-n'( opcode, operand f, operand} );

where n indicates the number of operands in the aggregate.

A special case arises for a variable number of operands.The operands are listed within a subaggregate. The formatis as follows:

CODEN'( opcode, (operand {, operandi) );

For those opcodes that require no operands, named notationmust be used (cf. RM 4.3(4)).

CODE 0'( op -> opcode );

The opcode must be an enumeration literal (i.e. it cannot bean object, attribute, or a rename).

An operand can only be an entity defined in MACHINECODE orthe 'REF attribute.

The arguments to any of the functions defined inMACHINE CODE must be static expressions, string literals, orthe functions defined in MACHINE CODE. The 'REF attributemay not be used as an argument in any of these functions.

Inline expansion of machine code procedures is supported.

61° -Conventions for Implementation-generated Names

There are no implementation-generated names.

7. Interpretation of Expressions in Address Clauses

Address expressions in an address clause are interpreted asphysical addresses.

8. Restrictions on Unchecked Conversions

None.

9. Restrictions on Unchecked Deallocatins

C-10


None.

10. Implementation Characteristics of I/O Packages

Instantiations of DIRECT 10 use the value MAX REC SIZE asthe record size (expressed in STORAGE UNITS) when-the sizeof ELEMENT TYPE exceeds that value. For-example for uncon-strained arrays such as string where ELEMENT TYPE'SIZE isvery large, MAX REC SIZE is used instead. MAX RECORD SIZEis defined in SYSTEM and can be changed by a pro-gram beforeinstantiating DIRECT_IO to provide an upper limit on therecord size. In any case the maximum size supported is 1024x 1024 x STORAGE UNIT bits. DIRECT 10 will raise USEERRORif MAX RECSIZE exceeds this absolute limit.

Instantiations of SEQUENTIAL 10 use the value MAX REC SIZEas the record size (expressed in STORAGEUNITS) when thesize of ELEMENT TYPE exceeds that value. For example forunconstrained arrays such as string where ELEMENT TYPE'SIZEis very large, MAX REC SIZE is used instead.MAX RECORD SIZE is defineU in--SYSTEM and can be changed by aprogram be-ore instantiating INTEGER 10 to provide an upperlimit on the record size. SEQUENTIAL_10 imposes no limit onMAX RECSIZE.

11. Implementation Limits

The following limits are actually enforced by the implemen-tation. It is not intended to imply that resources up to oreven near these limits are available to every program.

11.1. Line Length

The implementation supports a maximum line length of 500characters including the end of line character.

11.2. Record and Array Sizes

The maximum size of a statically sized array type is4,000,000 x STORAGE UNITS. The maximum size of a staticallysized record type is 4,000,000 x STORAGE UNITS. A recordtype or array type declaration that exceeds these limitswill generate a warning message.

11.3. Default Stack Size for Tasks

In the absence of an explicit STORAGE-SIZE length specifica-tion every task except the main program is allocated a fixedsize stack of 10,240 STORAGE UNITS. This is the valuereturned by T'STORAGESIZE for a task type T.

11.4. Default Collection Size

C-l1


In the absence of an explicit STORAGE SIZE length attributethe default collection size for an access type is 100 timesthe size of the designated type. This is the value returnedby T'STORAGESIZE for an access type T.

11.5. Limit on Declared Objects

There is an absolute limit of 6,000,000 x STORAGE UNITS forobjects declared statically within a compilation unit. Ifthis value is exceeded the compiler will terminate the com-pilation of the unit with a FATAL error message.

C-12

Documents

RAD-A248RAD-A248 550RE PAGE MSif.VA2U-3O.bI 10M~ . 070 iD4-01 9.eyMh. m II Final: 18 February 1992 to 01 Jun 19934. TITLE AND SUBTITLE 5. FUNDING NUMBERS Validation Summary Report;