*R4 AD-A285 110 'ATION PAGE Formn Approved

rI Iil>.11 1'1 flI.1111 average 1 h0.r Per reswonse. including 1,re time for reviewirg inistructionis. seardrhng existing dataeourse! 111111 ciiii 11 hecttiri o! intorm~iason. Send comnments regadig M-s bjdIen. to WaShi'g~o'i HeadojartersService ý'son Davis Highway. Suite9 1204, A~rlington. VA 22202-4302. and to Me 1tfico of Iniormaton anaRegula 0503

1. AGENCY USE (Leave 2. REPORT 3. REPORT TYPE AND DATES

4. TITLE AND Compiler: VADS PowerPC => PowerPC, Product #2100-01445, 5. FUNDINGVersion 6.2Host. IBM RS/6000 Mo,,el 250 (under AIX 3.2.5)Target: Motorola MVME1601 (PowerPC, 501) (bare machine) ~

6. AUTHORS: ~i9

Wright- Patterson AFB, Dayton, OH

7. PERFORMING ORGANIZATION NAME (S) AND 8. PERFORMINGAda Validating Facility, Language Control Facility ASC./SCEL, Building 676, Rm. ORGANIZATION135Wright-Patterson AFB, Dayton, OH- 45433

9. SPONSORING/MONITORING AGENCY NAME(S) AND 10. SPONSOR ING/MONITORINGAdA- Joint Pirog-ramn Offtce, Defaen Infonrmation Sysztem AOPency 1AGENCY

Coe- -T.X-EA., 7-01 S.- .C-o.u-rth-ou s-e- Rd.-,- A-rl i-n g-t-on-, VAW22204-2199

11. SUPPLEMENTARY

12a. DISTRIBUTION/AVAILABILITY: Approved for public release; distribution 12b. DRISTRIBUTIONunlimited

13. (Maximum 200 -- ___

Rational Software Corporation, 94 0630W1 .11363

14. SUBJECT: , da Programming Language, Ada Compiler Validation Summary '15. NUMBER OFReport, Ada Compiler Val. Capability Val. Testing, Ada Val. Office, Ada Val. Facility____________ANSIIMiI-STD-1 81 SA 16. PRICE

17 SECURITY 18. SECURITY 19. SECURITY I20. LIMITATION OF

CLASSIFICATION CLASSIFICATIONUNCLASSIFIED UNCLASSIFIED UNCLASSIFIED UNCLASSIFIEDNSN

AVF Control Number: AVF-VSR-591.0694Date VSR Completed: July 21, 1994

94-05-12-RAT

Ada COMPILERV'ALIDATION SUMMARY REPORT:

Certificate Number: 940630W1.11363Rational Software Corporation

VADS PowerPC -> PowerPC, Product Number: 2100-01445, Version 6.2IBM RS/6000 Model 250 under AIX 3.2.5 ->

Motorola MVME1601 (PowerPC 601 bare machine)

(Final)

Prepared By:Ada Validation Facility

645 CCSG/SCSLWright-Patterson AFB OH 45433-5707

94i3C 10A51l 1IZECTE3

@-• 94-31051

Certificate Information

The following Ada implementation was tested and determined to pass ACVC 1.11.Testing was completed on 30 June 1994.

Compiler Niame and Version: VADS PowerPC -> PowerPC,Product Number: 2100-01445, Version 6.2

Host Computer System: IBM RS/6000 Model 250under AIX 3.2.5

Target CcDputer System: Motorola MVME1601(PowerPC 601 bare machine)

Customer Agreement Number: 94-05-12-RAT

See section 3.1 for any additional information about the testing environment.

As a result of this validation effort, Validation Certificate 940630W1.11363is awarded to Rational Software Corporation. This certificate expires twoyears after MIL-STD-1815B is approved by ANSI.

This report has been reviewed and is approved.

Dale E. LangeTechnical Director645 CCSG/SCSLWright-Patterson AFB OH 45433-5*07

SAda yal~d~tion organization _._.

Dire toAcmputer and Software Engineering DivisionInstitute for Defense AnalysesAlexandý<ia VA 22311

Aooeission ForA4Koin P• fam Off~lce " .,i

oiUui:. "( r

Defense Information Systems Agency, j '

Center for Information Management -

DI .- -1. •.

I I1 iI

DBCLARATION OF CONFORMANCE

V

DECLARATION OF CONFORMANCE

Customer: Rational Software Corporation

Ada Validation Facility: 645 CCSG/SCSL

Wright-Patterson AFB OH 45433-5707

ACVC Version: 1.11

Ada implementation:

Ada Compiler Name and Version: VADS PowerPC->PowerPC, Version 6.2Product # 2100 01445

host Computer System: ILM RS/6000 Model 250 (AIX 3.2.5)

Target Computer System: Motorola MVME160i (PowerPC 601 bare machine)

Declaration:

I, the undersigned, declare that I have no knowledge of celiberatedeviations from the Ada Language Standard ANSI/MIL-STD-1815A,ISO 8652-1987, FIPS 119 as tested in this validation and documented

_ _ _ _ _ Dat e:__Stephen leigler1600 N W Compton DriveSuite 357Beaverton, Oregon 97006

TABLE OF CONTENTS

SCHAPTER I INTRODUCTION

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

CHAPTER 2 IMPLEZ4ENTATION DEPENDENCIES

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

CHAPTER 3 PROCESSING INFORMATION

3.1 TESTING ENVIRONMT= ......... ................ 3-13.2 SUMMARY OF TEST RESULTS .......... .............. .. 3-13.3 TEST EXECUTION ............. ................... ....- 2

APPENDIX A MACRO PARAMETERS

APPENDIX B COMPILATION SYSTE4 OPTIONS

U ~ ~ ~ ~ ~ ~ ~ n &Anr'vr l~NrT (

it

CHAPTrER 1

INTFRODW'rION

The Ada implementation described above was tested according to the AdaValidation Procedures [Pro92) 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. Forany technical terms used in this report, the reader is referred to IPro921.A detailed description of the ACVC may be found in the current ACVC User'sGuide [UG89].

1.1 USE OF THIS VALIDATION SUMMARY FEPORT

Consistent with the national Ilaws of the oriqiu&Linr country, t.r 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 apply onlyto the computers, operating systems, and compiler versions identified in thisreport.

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 ofth 4 s report are available to the public from the AVF which performed thisvalidation or from:

National Technical Information Service5285 Port Royal RoadSpringfield ,A 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

1m

1.2 REFERENCES

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

tPro92] Ada Compiler Validation Procedures, Version 3.1, Il a JointProgram Office, August 1992.

rUG891 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,F, 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 they areexecuted. ihree Ada library units, the packages REPORT and SPPRTl3, and theprocedure CHECK FILE are used for this purpose. The package REPORT also

3 provides a set of identity functions used to defeat some compileroptimizations all•.-ed 1b.y te Ada Standad that woul.d cir--_urent 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 of textfiles 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. Class Btests are not executable. Each test in this class is compiled and theresulting compilation listing is examined to verify that .iil 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 violation "ofthe Ada Standard involving multiple, separately compiled units. Errors areexpected 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 the AVF.This customization consists of making the modifications described in thepreceding paragraph, removing withdrawn tests (see section 2.1), and possiblyremoving some inapplicable tests (see section 2.2 and [UG891).

In order to pass an ACVC an Ada inr, .mentation must process each test of thecustomized test suite according to the Ada Standard.

1.4 DEFINITION OF TERMS

Ada Compiler The software and any needed hardware that have to be added toa 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 sunmary(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 tAJk-'O)

ALua 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 coon storage for all or part

of a program and also for all or part of the data necessaryfor the execution of the program; executes user-written oruser-designated programs; performs user-designated datamanipulation, including arithmetic operations and logicoperations; and that can execute programs that modifythemselves during execution. A computer system may be astand-alone unit or may consist of several inter-connectedunits.

1-3

S INTWODUCTION

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

Customer An individual or corporate entity who enters into an agreementwith an AVF which specities the terms and conditions for AVFservices (of any kind) to be performed.

Declaration of A forma) -1t1atement from a customer assuring that conformityConformance is realized or attai nable on the Ada implemcntation 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 from theLEM 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, operatingsystems are predominantly softvare, but partial or completehardware imulerientations arc p ile.

Target A computer system where the executable form of Ada piogramsComputer 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 [Pro32].

validation The process of checking the conformity of an Ada compiler tothe Ada programming language and of issuing a certificate forthis implementation. k

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, or containserroneous or illegal use of the Ada programming language.

1-4

CHAPTER 2

IMPLEMTATIChN DEPENDEICIES

2.1 WITYMRAWN TESTS

The following tests have been withdrawn by the AVO. The rationale forwithdrawing each test is available from either the AV) or the AVF. Thepublication date for this list of withdrawn tests is 22 November 1993.

B27005A E28005C B28006C C32203A C34006D C35507KC35507L C35507N C355070 C35507P C35508I C35508JC35508M C35508N C35702A C35702B C37310A B41308BC43004A C45114A C45346A C45612A C45612B C45612C

SC45651_A C46022A B49008A B49008B A54BO2A C55BO6AA74006A C74308A B83022B B83022H B8302bB B83025DC83026A B83026B C83041A B85001L C86001F C94021AC97116A C98003B BA2011A CB7001A CB7001B CB7004ACC1223A BC1226A CC1226B BC3009B BDIB02B BDlB06AADlBO8A BD2A02A CD2A21E CD2A23E CD2A32A CD2A41ACD2A41E CD2A87A CD2Bl5C BD3006A BD4008A CD4022ACD4022D CD4024B CD4024C CD4024D CD4031A CD4051DCD511LA CD7004C ED7005D CD7005E AD7006A CD7006EAD7201A AD7201E CD7204B AD7206A BD8002A BD8004CCD9005A CD9005B CDA201E CE2107I CE2117A, CE2117BCE21193 CE2205B CE2405A CE3111C CE3116A- CE3118ACE3411B CE3412B CE3607B CE3607C CE3607D CE3812ACE3814A 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 may besupported by documents issued by the ISO and the AJPO known as AdaComnentaries and commonly referenced in the format AI-ddddd. For this

implementation, the following tests were determined to be inapplicable for

the reasons indicated; references to Ada Commentaries are included asappropriate.

2-1

IMPLEMENTATION DEPENDENCIESaiThe following 201 tests have floating-point type declarations requiringmore 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 LONXG INTEGER; forLhis implementation, there is no such type:

C35404C C45231C C45304C C45411C C45412CC45502C C45r*03C C45504C C45504F C45611CC45613C C45614C C45631C C45632C B52004UC55B07A B55B09C B86001W C86006C CD7101F

C35713C, B86001U, and C86006G check fur the predefined type LONGFLGAT;for this ianplementation, there is no such type.

C35713D and B86001Z check for a predefined floating-point type with aname other than FLOAT, LONG FLOAT, or SHORTFLOAT; 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, MmXxMANTISSA is less than 47.

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

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

C960055 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

IMr'LEMENTATION DEPENDENCIES

CD2A84A, CD2A84E, CD2A841..J (2 tests), and CD2A84O use length clausesto specify non-default sizes for access types; this implementation doesnot support such sizes.

rhe tests listed in the following table check that USE ERROR iG raisedif the given file operations are no'L supporttd for the gTiven combinationof mode and access method; this implementation supports theseoperations.

Test File Operation Mode File Access Method

CE2102D CREATE IN FILE SEQUENTIAL 10CE2102E CREATE O(UT FTLE SEQITIAL-IOCE2102F CREATE INOrUT FILE DIRECT 10CE2102I CREATE IN FILE DIRECT-IOCE2102J CREATE CUT FILE DIRECT-IOCE2102N OPEN IN FILE SEQUENTIAL 10CE21020 RESET IN-FILE SEQUENTIAL 10CE2102P OPEN OUT FILE SEQUENTIAL-IOCE2102Q RESET OUT-FILE SEQUENITIAL_10CE2102R OPEN INOJU FILE DIRECT 10CE2102S RESET INOUT-FILE DIRECT-IOCE2102T OPEN IN FILE DIRECT0IOCE2102U RESET IN FILE DIRECTIOCE2102V OPEN OUT FILE DIRECT_-IOC,.IA•,.. nLsCr CWIT_ V"TTF. DIRECT 10CE3102E CREATE IN FILE war 10CE3102F RESET Any Mode TET--IOCE3102G DELETE TEXT IOCE31021 CREATE OUT FILE Tmc•I0CE3102J OPEN IN FILE TEXTIOCE3102K OPEN OUT_FILE TEXT_1O.

CE2203A checks that WRITE raises USE ERROR if the capacity of anexternal sequential file is exceeded7 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 raise USE ERRbRif they specify an inapproprTiate value for t]he eiternal file; there areno inappropriate values for this implementation.

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

2-3

IMPLEMNTTION DEPENDENCIES

2.3 TEST MODIFICATIONS

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

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

B24009A B33301B B38003A B38003B B38009A B38009BEB85008G B85008H BCI303F SC3005B BD2BO3A BD2D03ABD4003A

A35801E was graded inapplicable by Evaluation Modification as directed by theAVO. The compiler rejects the use of the range FLOAT'FIRST..FLOI•T'LAST asthe range constraint of a floating-point type declaration because the boundslie outside of the range of safe numbers (cf. LRM 3.5.7:12).

CDI009A, CD009I, CDIC03A, and CD2A31A..C were graded passed by EvaluationModification as directed by the AVG. These tests use instantiations of thesupport procedure LENGTH CHECK, which uses Unchecked Conversion according tothe interpretation given -n AI-00590. The AVO ruled that this interpretationis not binding under ACVC 1.11; the tests are ruled to be passed if theyproduce Failed messages only from the instances of LENGTHCHECK-i.e, theallowed Report.Failed messages have the general form:

* CHECK ON REPRESENTATION FOR <T'fPEID> FAILED."

AD9001H was graded passed by Test Modification as directed bry the V.Titest checks that no bodies are required for interfaced subprograms; among theprocedures that it uses is one with a parameter of mode OUT (line 36). Thisimplemenation does not support pragma INTERFACE for procedures withparameters of mode OUT. The test was niodified by conmenting out line 36 and40; the modified test was passed.

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 and sales information about this Ada implementation, contact:

Sam QuiringRational Software Corporation1600 1,T Compton Dr., Suite 35/Aloha, OR 97006-1992(503) 690-1116

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

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 Programming LanguageStandard, whether the test is applicable or inapplicable; otherwise, the AdaImplementation fails the ACVC [Pro92]. k

For all processed tests (inapplicable and applicable), a result was obtainedthat conforms to the Ada Programming Language Standard.

The list of items below gives the number of ACVC tests in various categories.All tests were processed, except those that were withdrawn because of testerrors (item b; see section 2.1), those that require a floating-pointprecision that exceeds the implementation's maximum precision (item e; seesection 2.2), and those that depend on the suppoct of a file system - ifnone is supported (item d). All tests passed, except those that are listedin sections 2.1 and 2.2 (counted in items b and f, below).

3-1

PROCESSING INFORMATION

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

Precision Tests 201

f) Total Number of Inapplicable Tests 270 (c+d+e)

g) Total Number of Tests for ACVC 1.11 4170 (a+b+f)

3.3 TEST EXECuTION

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 SPARCcenter 2000 and then copied to thehost computer system.

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

The tests were compiled and linked on the host computer system. Theexecutable iicages were then downloaded via a serial port to the target boardand then executed. The results were captured on the host computer system viaS-eial PoULL.

Testing was performed using comnand 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:

Option/Switch Effect

-w Suppress warning diagnostics.

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

3-2

APPENDIX A

MACRO PARAMETERS

This appendi,' contains the macro parameters used for customizing the ACVC.The meaning and purpose of these Varameters are explained in (UG89]. Theparameter values are presented in two tables. The first table lists thevalues that are defined in terms of the naximum input-line length, which isthe value for $MAX IN LENI-also listed here. These values are expressed hereas Ada strinS aggregaltes, where "V" represents the maximum input-line length.

Macro Parameter Macro Value

SHAXIN LE~i 49 - Value of V

$BIGIDI (l..V-l -> 'A', V -> 'I')

$BIGID2 (i..V-l -> 'A', V -> '2')

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

$BIGID4 (l..V/2-> 'A') & '4' &(l..V-l-V/2 -> 'A')

$BIGINTLIT (l..V-3 => '0') & "298"

$BIGREAL LIT (l..V-5 -> '0') & "690.0"

$BIGSTRINGI '"' & (l..V/2 -> 'A') & '"'

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

$BLANKS (I..V-20 -

$MAX LE24_INTBASED LITERALI"2:" & (l..V-5-> '0') & "11:"

$MAXLENREALBASED LITERAL"16:" & (l..V-7 -1 '0') & "F.E:"

A-i

MACRO PARAMETERS

SMAXSTRINGLITEPAL ''& (l..V-2 -> WA) &'"

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

Macro Parameter Mazcro Value

SACCSIZE 32

$ALIGNMENDT 4

$COUNTrL"AST 2147483647

$DEFAULT MEM SIZE 16777216

$DEFAULTSI'ORUNIT 8

SDEFAULTSYSNAME POWERCROSSNEW7_PPC601

$DELTA-DOC 0.000000000456661287307739257812S

$ENTRYADDRESS SYSTEM."+"(16#40#)

$ENTRYADDRESSI SYSTEM."-i"(16#80#)

$ENTRYADDRESS2 SYSTEM."+"(16#100#)

$FIEL.D LAST 2147483647

$FILE TERMINATOR

$FIXEr, NAME NOSUCHTYPE

$FuOATNAME NOSUCH_-TYPE

$ FORM-STRING fl

$F=RMSTRING2 "CANNOT RESTRICTFILECAPACITY"

$GRFILTERTH-ANDURATION 100.

$GREATEZRTHANDURATION BASE LAST*Io0000-o00.0

$ GREATERTHANFLOATBASE LAST1 'SE+306

$GREAkTER THAN-FLOAT SAFE LARGE- -. 5.'OUE307

A-2

MACRO PARAMETERS

$GREATER THAN SHORTFLoOAT SPlt LARGE- 9.0f37

SHIGHPRIORITY 99

$ILLEGALEXTERNAL FILE NAM~E1

7illegal/file-nax1w/2flS%FILE1.DAT

siLLEGAL EXTERNAL FILE NAME2

7il'Legal/file riaxi/2)]$%FILE2.DAT

$INAPPROPRIATELINELDNGTli-1

$ INAPPROPRIATE PAGELE3,1GTH-1

$INCLUDE-PRAGMAl1 PRAGJ4A INCLUDE ("A28006D1.TST")

$INCLUDEPRAGMA,2 PRAGMA INCLUDE ("B28006DI.TST")

$INTEGERFIRST -2147483648

$INTEGERLAST 2147483647

$INTEGERLASTPLUS_1 2147483648

5 INTERFACE LANGUAGE C

$LESSTHANDURATION -100000.0

SLESSTHANDURATION BASE FIRST

-1-6oooooo.o$LINETERI'INA7IOR ASCII.LF

$LOWPRIORITY 0

SMACHINECODESTATEMENTCODE_0'(OP -'> NOP);

$ MACH INECODETlYPE CODE -0

$MANTISSA._DOC 31

$MAXDIGITS 1

$MAxINT 2147483647

$MAXINT -PLUS 1 2147483648

$MININT -2147483648

$NAME TINYIlTrEGER

A-3

MACRO PARAMETERS

SNAklE_-LIST POWJERCROSSNEWPPC601

$NAM'E SPECIFICATION~1 /usr/acvcl 11/c/e/X2120A

SNAMESPECIrICATIO142 /usr/acvcl 11/c/e/X2120B

SNAZ4ESPECIFICATION3 /usr/acvcl 11/c,'e/X3119A

S,-NEG BASED INTr 16*FOOOOOOE#

$NEWMDE¶_SIZE 16777216

$NEWSTORUJN-IT 8

$NEWSYSNAME POJERCROSSNEWP?C601

SPACETERMINATIOR ASCII.LF & ASCII.FF

$RECORD-DEFINITION RECORD SUBP: OPERAND; END RECORD;

$ RECORDNAME CODE_0

$TASKSIZE 32

$TAhSKS¶ORAGESIZE 2048

$TICK 0.01

$VARIABLEADDRESS VAR_1 'ADDRESS

$VARIABLEADDRESS1 VAR-2'ADDRESS

$VARIABLEADDRESS2 VAR_3'.ADDRESS

$YQUR-PRAGMA PPAGMA 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 noted otherwise,"references in this appendix are to compiler documentation and not to thisreport.

B-ii

COMPILATION SYSTEM OPTIONS

ada Coumand Reference ada

ada - invoke the Ada compiler

Syntax

ada [options] (source-file]... (object file.o]...

Arguments

object-file.o non-Ada object file names. These files will be passedon to the linker and will be linked with the specifiedAda object files.

options options to the compiler. These are:

-A (disassemble) Disassemble the units in the source file aftercompiling them. -A can be followed by arguments that furtherdefine the disassembly display (e.g., -Aa, -Ab, -Ad, -Af,-Al, -As).

a Add hexadecimal display of instruction bytes todisassembly listing.

b Disassemble the unit body [default].d Print the data section (if present) as well.f Use the alternative format for output.1 Put the disassembly output in file "filename.das"s Disassemble the unit spec.

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

-Bstatic/dynamic (SPARCompiler Ada only)(static) If static is indicated, the Ada program is compiledand linked statically. The default is dynamic.

-c suppress the control messages generated when pragma PAGEand/or pragma LIST are encountered.

-D identifier type value(define) Define an identifier of a specified type and value.

-DA1.0-DAI. 1-DA2.0

(architecture) Specify the architecture version the compilershould generate code for. These options override the ARCHITECTUREINFO directive [Default: -DAI.1] (HP PA-RISC only)

-d (dependencies) Analyze for dependencies only. Do not do

B-2

COMPILATION SYSTEM OPTIONS

semantic analysis or code geneiation. Ludate the library,marking any defined units as uncompiled. The -d option isused by a.make to establish dependencies among new files.This option will attempt to do imports for any unitsreferenced from outer libraries. This should reducerelocation and reduce user disk space usage.

-E--E directory

(error output) Without a directory argument, ada processeserror messages using a.error and directs a brief message tostandard output; the raw error messages are Left insource file.err. If a directory name is given, the raw erroroutput-is placed in directory/source file.err. The file ofraw error messages can be used as in-put to a.error. Onlyone -e or -E option should be used.

-e (error) Process compilation error messages using a.error andsend it to standard output. Only the source lines containingerrors are listed. Only one -e or -E option should be used.

-Eferror file source file(error) Process source file and place any error messagesin the file indicated By error file. Note that there isno space between the -Ef 3nd 6eror file.

-El-El directory

(error listing) Same as the -E option, except that a sourcelisting with errors is produced. Note that the source listing isdirected to standard out while the raw errors are placed insource file.err.

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

-Elferror file source file(erro? listing) Same as the -Ef option, except that J sourcelisting with errors is produced and directed to standard output.The raw errors are written to error file.

-ev (error vi(l)) Process syntax error messages using a.error,embed them in the source file and call the environment editorERROR EDITOR. If ERROR EDITOR is defined, the environmentvariable ERROR PATrERNF-should also be defined. ERROR PATTERNis an editor search command that locates tM! first occurrenceof '###' in the error file. If no editor is specified, vi(l)is invoked.

The value of the environment variable ERROR TABS, if set,is used instead of the default tab settings-(8).

-F (full DIANA) Do not trim the DIANA tree before output tonet files. To save disk space, the DIANA tree will be

B-3

COMPILATION SYSIM OPTIONS

trimmed so that all pointers to nodes that did not involvea subtree that define a symbol table will be nulled(unless those nodes are part of the body of an inline orgeneric or certain other values needing to be retained forthe debugging or compilation information). The trimminggenerally removes initial values of variables and allstatements.

-G (GVAS) Display suggested values for the MIN_GVASADDRand MAXGVAS ADDR INFO directives.

-K (keep) Keep the intermediate language (IL) file producedby the compiler front end. The IL file will be placed inthe .objects directory with the file name Ada-source.

-L library name(library) Operate in VADS library libraryname.(Default: current working directory]

-if ile abbreviation (VADSself only)(library search) This is an option passed to the ld(l)linker, telling it to search the specified library file.(No space between the -1 and the file abbreviation.)

-M unit name(main) Produce an executable program by linking the namedunit as the main program. unit name must already becor•ipiled. =a-st 1---i-t-hr a ----- n-A terless procedure ora parameterless function returning an integer. Theexecutable program will be named a.out unless overriddenwith the -o option.

-M source file(mainT Produce an executable program by compiling andlinking source file. The main unit of the program isassumed to be Dhe root name of the file (for foo.a theunit is foo). Only one file may be preceded by -M. Theexecutable program will be named a.out unless overriddenwith the -o option.

-N (no code sharing) Compile all generic instantiationswithout sharing code for their bodies. This optitonoverrides the SHAREBODY INFO directive and the SHARECODEor SHAREBODY pragiras.

-NX (NX) Link with NX startup code and with the NX archive libraries.This option is valid only it the -M option has also been invoked.

(Sun SPARC -> Paragon only)

-010-9](optimize) Invoke the code optimizer. An optional digit(there is no space before the digit) provides the level ofoptimization. The default is -04.

B-4

COMPILATICN SYSTE-M 0PTIONS

-O full optimization-00 no optimization-01 copy propagation, constant folding, removing

dead variables, subsuming moves between scalarvariables

-02 add common subexpression elimination withinbasic blocks

-03 add global co,.mn subexpression elimination-04 add hoisting invariants from loops and address

optimizations-05 add range optimizations, instruction scheduling

and one pass of reducing induction expressions-06 no change-07 add one more pass of induction expression reduction-08 add one more pass of induction expression reduction-09 add one more pass of induction expression

reduction and add hoisting expressions common tothe then and the else parts of if statements

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

Note that using the -00 option can alleviate some problems whendebugging. For example, using a higher level of optimization,you may receive a message that a variable is no longer active oris not yet active. -f you cxpcri.ence 4h .. problems. set theoptimization level to 0 using the -00 option.

-o executable file(output) This option is to be used in conjunction withthe -M option. executable file is the name of the executablerather than the default, i.out (self) or a.vox (cross).

-P Invoke the Ada Preprocessor.

-R VADS library(recompile instantiation) Force analysis of all genericinstantiations, causing reinstantiation of any that are outof date. VADS library is the library in which therecompilation is to occur. If it is not specified, therecompilation occurs in the current working directory.

-r (recreate) Recreate the library's GV-AS TABLE file. This optionreinitializes the file and exits. This allows recovery from"GVAS exhausted" without recompiling all the files in the library.

-S (suppress) Apply pragma SUPPRESS to the entire compilationfor all suppressible checks.

-sh (show) Display the name of the tool executable but do notexecute it.

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

B-5

COMPILATION SYSTEM OPTIONS

-trb(trace block) Generate code to trace entry into basic blocks andcalls and returns (for use with a.trace only)

-v (verbose) Print compiler version number, date and time ofcompilation, name of file compiled, command input line,total compilation time and error summary line. Storage usageinformation about the object file is provided.

-w (warnings) Suppress warning diagnostics.

source-file name of the source file to be compiled.

Description

The ada command executes the Ada compiler and compiles the named Adasource file. The file must reside in a VADS libr~iry directory. Theada.lib file in this directory is modified after each Ada unit iscompiled.

By default, ada produces only object and net files. if the -M optionis used, the compiler automatically invokes a.ld and builds a completeprogram with the named library unit as the main program.

For cross systems, the conpiler generates object files compatible withthe host linker in VOX format. The VaX format is discussed inAppendix A of the Progr-r&Lr's Guide.

Non-Ada object files (.o files produced by a compiler for anotherlanguage) may be given as arguments to ada. These files will be passedon to the linker and will be linked with the specified Ada object files.

Command line options may be specified in any order but the order ofcompilation and the order of the files to be passed to the linker canbe significant.

Several VADS compilers may be simultaneously available on a singlesystem. Because the ada cowand in any VADS location/bin on a systemwill execute the correct compiler components based upon visiblelibvary dicectives, the optinn -sh is provided to print the name ofthe components actually executed.

Program listings with a disassembly of machine code instructionsare generated by a.db o0 a.das.

NOTE: If two files of the same name from different directories arecompiled in the same ada library using the -L option (even if thecontents ana unit names are different), the second compilation willoverwrite the first. For example, the compilation of/usr/directory2/foo.a-L - usr/vads/test will overwrite thecompilation of /usr/directoryl/foo.a -L /usr/vads/test in theVADS library /usr/vads/test.

B-6

COMPILATION SYSTEM OPTIONS

NOTE: It is possible to specify the directory for temporary files bysetting the environment variable TMPDIR to the desired path. If TEMPDIRis not set, /tmp is used. If the path specified by TMPDIR does not existor is not writeable, the program exits with an error message to that effcct.

Diagnostics

The diagnostics produced by the VADS compiler are intended to beself-explanatory. Most refer to the RM. Each RM reference includes asection number and optionally, a paragraph number enclosed inparentheses.

See Also

a.app, a.das, a.db, a.error, a.info, a.ld, a.make, a.mklib, appendixf

LINKER OPTIONS

The linker options of this Ada implementation, as described in tl.ic Appendix,are provided by the customer. Unless specifically noted otherwise,references in this appendix are to linker documentation and not to thisreport.

B-7

B-7

COMPILATION SYSTEM OPTIONS

a.ld Cormand Reference a.ld

a.ld - build an executable program from previously compiled units

Syntax

a.ld [options] unit_name [linkeroptions]

Arguments

linr6er optionsK11 argu-ents after unit name are passed to the linker.library abbreviations or-object files.

options options to the a.ld command. These are:

-DAI.0-DAl .1-DA2.0

(architecture) Specify the architecture version the compilershould generate code for. These options override the ARCHITECTUqREINFO directive [Default: -DAl.l] (HP PA-RISC only)

-DO (objects) Use partially linked objects instead of archivesas an intermediate file if the entire list of objects cannotbe passed to thp linker in ofe invocaticn. This option. isuseful because of limitations in the archiver on some hosts(including ULTRIX, HP-UX and System V), (VADSself only)

--DT (time) Displays how long each phase of the prelinking p~ocesstakes

-DU unit list(units) Traces the addition of indirect dependencies to the namedunits.

-Dx (dependencies) Displays the elaboration dependencies-used eachtime a unit is arbitrarily chosen for elaboration.

-DX (debug) Debug memory overf!ow (use in cases where linkinga large number of units causes the error message "localsymbol overflow" to occur).

-E unit name(eliborate) Elaborate unit name as early in the elaborationorder as possible.

-F (files) Pcint a list of dependent files in order and suppresslinking.

-K (keep) Do not delete the termorary file containing the list ofobject files to link. This file is only present when many object

B- 8

CO3MPILATION SYSTEM OPTIONS

files are being linked.

-L libraryjname(library) Collect information for linking in library name insteadof the current directory. However, place the executable in thecurrent directory.

-NX (NX) Link with NX startup copde and with the NX archive libraries.(Sun SPARC -> Paragon only)

-o executable file(output) Use the specified fielname as the name of the outputrather than the default a.out (self) or a.vox (cross).

-sh (show) Display the name of the tool executable but do notexecute it.

-T (table) List the symbols in the elaboration table to standardoutput.

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

suppress linking.

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

-V (verify) Print the linker conmand but stppress execution.

-w (warninqZ) Suppress warning messages.

unit-namename of an Ada unit. It must name a non.-generic subprogram.If unit name is a function, it must return a value of thetype STMNDARD.INTEGER. This integer result will be passed backto the shell as the status code of the execution.

Description

a.ld collects the object files needed to make unit name a i~ainprogram and calls the ld(1) lizýker to link together all Ada andother language objects required to produce an executable image ina.out (self) or a.vox (cross). The utility uses the not files producedby the Ada corpiler to check dependency information. a&.ld producesan exceptio-4 mapping table and a unit elaboration table and passesthis infonration to the linker. The elaboration list generated bya.ld will not include library level packages that do not needelaboration. Similarly, packages that contain no code that can raisean exception will no longer have exception tables.

a.ld reads instructions f(%r geneurting executables from the ada.libfile in the VADS libraries on the search list. Besides informationgenerated by the compaler, these directives also include WITHndirectives that allow the automatic linking of object modulescompiled from other languages or Ada object smodules not namedin context clauses in the Ada source. Any nrnaber of WITHn

B-9

COMPILATION SYSTEM OPTIONS

directives may be placed into a library but they must benumbered contiguously beginning at WITHI. The directives arerecorded in the library's ada.lib file and have the following form.

WITHi :LINK:object file:WITH2:LINK:archive file:

WITHn directives may be placed in the local Ada libraries or inany 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 WITHn direc.tivein a library later in the library search list.

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

For VADSself on Silicon Graphics Computer Systems, theUSE LAST LINK INFO directive speeds relinking by retaining a listof units, theIr types, seals and dependencies.

VADS location/bin/a.ld is a wrapper program that executes thecorrect executable based upon directives visible in the ada.libfile. This permits multiple VADS compilers to exist on the samehost. The *-sh option prints the name of the actual executable file.

NOTE: It is possible to specify the directory for temporary files bysetting the enviuonment variable TMPO-D!R to the desired oath. If ThPDIRis not set, /tmp is used. If the path specified by TMPDIR does not existor is not writeable, the program exits with an error message to that effect.

Files

a.out (self), a.vox (cross) default output file.nets Ada DIANA net files directory.objects/* Ada object files

VADS location/standard/* startup and standard library routines

Diagnostics

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

B--1 0

APPENDIX C

APPENDIX F OF THE Ada STANDARI

The only allowed implementation dependencies correspond toimplementation-dependent pragmas, to certain machine-dependent conventions asmentioned 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 ;ppendix are to compiler documentation and not to thisreport. Implementation-specific portions of the package STANDARD, which arenot a part of Appendix F, are:

package STANDARD is

type INTEGER is range -2147483648 2147483647,type TINY INTEGER is range -128 .. 127;type SHORT INTEGE? is range -32768 .. 32767;

type FLOAT is digits 15range -1.797693134B6231E+308 .. 1.79769313486231E+308;

type SHORT FLOAT is digits 6 range -3.40282E+38 3.40282E+38;type DURATION is delta 0.0001 range -214748.3648 214748.3647;

end sTANDARD

4.

C-I

APPENDIX F OF THE Ada STANDARD

APPENDIX F. Implementation-Dependent Characteristics

1. Implementation-Dependent Pragmas

1.1. INITIALIZE Pragma

Takes one of the identifiers STATIC or DYNAMIC as the singleargument. This pragma is only allowed within a library-level package spec or body. It specifies that all objectsin the package be. initialized as requested by the pragma(i.e. statically or dynamically). only library-levelobjects are subject to static initialization; all objectswithin procedures are always (by definition) dynamic. Ifpragma INITIALIZE(STATIC) is used, and an object cannot beinitialized statically, code will be generated to initializethe object and a warning message will be generated.

1.2. INLINE ONLY Pragma

The 11LINE _iNY pragma, whttu used in the sa•-c ... as pra,-,.INLINTE, 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 erronecusly makes an INLINE ONLY subpro-gram recursive a warning message will be -mitted and an-Pi•OGRAMERROR will be raised at run time.

1.3. BUILTIN Pragma

The BUILT IN pragma is used in the implementation of somepredefine• Ada packages, but provides no user access. It iL'used only to implement code bodies for which no actual Ada"body can be provided, for example the MACHINE_CODE package.

1.4. SHARECODE Pragma k I

The SHARE CODE pragma takes the name of a generic instantia-tion or a generic unit as the first arguxent and cne of theidentifiers TRUE or FALSE as the second argumeiit. Thispragma is only allowed immediately at the place of adeclarative item in a declarative part oz package specifica-tion, or after a library unit in a compilation, brat beforeany subsequent compilation unit.

When the first argument is a generic unit the pragma appliesto all instantiations of that generic. When the first argu-

C-2

APPENDIX F OF THE Ada STANDARD

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 foL other instantiations of the same generic.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 nare 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.5. NO-IMAGE 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.

The EXTERNAL NAME pragma takes the name of a subprogram orvariable def'ined 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.7. INITERFACENAME 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.

C-3

APPENDIX F OF THE Ada STANDARD

1 .8. 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 ifOFF is used and any implicit code needs to be generated.The default is ON.

1.9. OPTIMIZE-CODE Pragma

Takes one of the identifiers ON or OFF as the single argu-went. 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•. EUGGOKATIEThis pragma is implemented as described in Appendix B of the

Ada RM.

2.3. INLINE

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

2.4. IN 7RFACE

This pragma supports calls to 'C' and FORTRAN functions. The'Ada 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 SYCJTEM.All parameters must have mode IN. Record and array objectscan be passed by reference using the ADDRESS attribute.

2.5. LIST

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

2.6. NtMORYSIZE

This pragira is recognized by the implementation. The imple-

C-4

APPENDIX F OF THE Ada STANDARD

mentation does not allow SYSTEM to be modified by means ofpragmas, the SYSTEM package must be recompiled.

2.7. NONREENTRANT

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 indicatesto 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 subprograsm within a package spec or pack-age body.

2.8. NOTELABORATED

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 preserice of this pragma suppresses thegeneration of elaboration code and issues warnings if ela-boration code is required.

2.9. OPTIMIZE

This pragma is recognized by the implementation but has noeffect.

2.10. PACK

s pragma will cause the compiler to choose a non-aligned" :esentation for composite types. It will not causesc cts to be packed at the bit level.

2.±L±. PAGE

This 1ragma is implemented as described in Appendix B of theAda ..

2.1, PASSIVE

The pragma has three forms

PBAGMA PASSIVE;PRAGMA PASSIVE( SEMAPHORE);PRAGMA PASSIVE( INTERRUIPT, <number>);

This pragma Pracna passive can be applied to a task or tasktype declared immediately within a library package spec orbody. The pragma directs the compiler to optimize certaintasking operations. It is possible that the statements in a

C-5

* APPENDIX F OF THE Ada STANDARD

task body will prevent the intended optimization, in thesecases 4 warning will be generated at compile time and willraise TASKINGERROR at runtime.

2.13. PRIORITY

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

2.14. SHARED

This pragma is recognized by the implementation but has noeffect.

2.1S. STORAGEUNIT

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.16. SUPPRESS

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

217 SYSTEMNAME

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.

3. Implementation-Dependent Atttibutes

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 correcponding 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 is

C-6

APPENDIX F OF THE Ada STANDARD

not 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.

4. Specification of Package SYSTEM

with UNSIGNED TYPES;package SYSTEM is

pragma suppress(ALL CHECKS);pragma suppress (EXCEPTIONTABLES);pragma notelaborated;

type NAME is ( power crossnewyppc601 );

SYSTEMNAME : constant NAME :- power_cross-new_ppc60l;

STORAGE UNIT' : constant :- 8;MEMORY-SIZE : constant :- 16_777_216;

- System-Dependent Named Numbers

MIN INT : constant :- -2 147 483 648;MAXC-INT : constant :- 2 147 -83 647;MAX-DIGITS : constant :-'1;MAXMANTISSA constant :- 31;FINE DFLTA : 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: UNSIGNEDTYPES.UNSIRED IUTEGER) return ADDRESS;

C-7

APPENDIX F OF THE Ada STANDARD

function MEMORY ADDRESS(I: UNSIGNED_TYPES.UNSqIGNED_INTEGER) return ADDRESS renames "

NOADDR : constant ADDRESS;

type TASK ID is private;NOTASKID : constant TASKID;

type PASSIVE TASK ID is private;NOPASSIVETSK ID : constant PASSIVETASKID;

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

type PROGRAM ID is private;NOPROGRAM ID : constant PROGRAMID;

type BYTEORDER T is (LITTLE ENDIAN,BIG ENDIAN

BYTEORDER: constant BYTEORDER T :- BIG ENDIAN;

type LONG ADDRESS is private;

NOLONGADDR constant L4G ADDRESS;

-c+tn- -r,, ('lA TL= _ADDRESS! I: INTEGER) return LO3G ADDRESS;fxuiction "-" (A. LONG-ADDRESS; I: INTEGER) return LONG-ADDRESS;

function MAKELONGADDRESS (A: ADDRESS) return L)GADDRESS;

function LOCALIZE(A: LONGADDRESS ; BYTESIZE : INTEGER) return ADDRESS;

function STATIONOF(A: LONG ADDRESS) return INTEGER;

- Internal RTS representation for day. If the calendar package is used,- then, this is the julian day.subtype DAY T is INTEGER;

- Constants describing the configuration of the CIFO add-on product.SUPPORTS INVOCATION BY ADDRESS : constant BOOLEAN. :- TRUE;SUPPORTS-PREELABORA-TION : constant BOOLEAN :- TRUE;MAKE ACCESSSUPPORTED : constant BOOLEAN : TRUE;3

- Arguments to the CIFO pragma INTERRUPT TASK.type INTERRUPTTASKKIND is ( SIMPLE, &I.GNALLING );

function EETtRNADDRESS return ADDRESS;

private

type ADDRESS is new UNSIWED TYPES.UNSIGNED INTEGER;

C-8

UI

APPENDIX F OF THE Ada STANDARD

NOADDR : constant ADDRESS :- 0;

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

type TASK ID is new UNSIG•'ED TYPES.UNSIGNED_INTEGER;NO TASKID : constant TASKID :- 0;

type PASSIVE TASK ID is new UNSIGNMED TYPES.UNSIGED INTEGER;NO PASSIVETSKID : constant PASSIVE TASK ID :- 0;-

type PROGRAM ID is new UNSIGTED TYPES.UNSIGNEDINTEGER;NOPROGRAM tD : constant PROGRAM ID :_ 0;

type LONG ADDRESS isRECORD

station : UNSIGTED_-TYPES.UNSIGNEDINTEGER;addr : ADDRESS;

END RECORD;

NO LONG ADDR : constant LONG ADDRESS :- (0, 0);

pragma BUILT IN(MAKE LONG ADDRESS);pragma BUILT-IN(LOCALIZE);pragma BUILT-IN(STATIONOF);

pragma BUILTIN(RETURN ADDRESS);

end SYSTEM;

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 tacgethardware, pragma PACK applied to a record eliminate 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 representation

C-9

APPENDIX F OF THE Ada STANnARD

clause 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 requirementsprohibit inititalization of a variables which have address-clauses. The specified address indicates the physicaladd-css associated with the variable.

5.4. Interrupts

Interrupt entries are supported with the following interpre-tation and restrictions:

An interrupt entry may not have any parameters.

A passive task that contains one or more interrupt entriesmust always be trying tc, accept each interrupt entry, unlessit is handling the imiueL.:.upL. .'-L •s =--t.,,xe. ..- "_ ....either an accept for the entry (if there is only one) or aselect statement where the interrupt entry accept alterna-tive is open as defined by Ada RM 9.7.1(4). This is not arestriction on normal tasks (i.e., signal ISRs).

An interrupt acts as a conditional entry call in that inter-rupts are not queued (see the last sentence of Ada RM13.5.1(2) and 13.5.1(6)).

No additional requirements are imposed for a select state-ment containing both a terminate alternative and an accept-alternative for an interrupt entry (see Ada RM 13.5.1(3)).

Direct calls to an interrupt entry from another task areallowed and are treated as a normal task rendezvous. _

Interrupts are not queued.

The address clause for an interrupt entry does not specifythe priority of the interrupt. It simply specifies theinterrupt vector number. For passive ISRs, the nnn of thepassive(interrupt,nnn) pragma specifies the interrupt prior-ity of the task.

5.5. Representation Attributes

C-1i

APPE24DIX F OF THE Ada STAND'RD

The ADDRESS attribute is not supported for the followingentities:

PackagesTasksLabelsEntries

5.6. Machine Code Insertions

Machine code insertions are supported.

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 tyie of all the opcode mneumonics,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 {, 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:

CODE_N'( opcode, (operand {, operand)) );

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

CODEO'( 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 MACHINE C.ODE,. 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.

6. Conventions for Implementation-generated Names

C-I1

4

APPENDIX F OF THE Ada STANDARD

There aLe 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 Deallocations

None.

10. Implementation Characteristics of I/O Packages

Instantiations of DIRECT 10 use the value MAX EEC SIZE asthe record size (expressed in STORAGE UNITS) When-the sizeof ELEMENr TYPE exceeds that value. For-example for uncon-strained arrays such as string where ELENT TYPE'SIZE isvery large, MAX REC SIZE is used instead. MAX RECORD SIZEis defined in SYSTt.M and can be changed by a erogram be'foreinstantiating 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 MAXEECSIZE ixceeds this absolute limit.

Instantiations of SEQUUJTIAL 10 use the value MAX EEC SIZEas the record size (expriessed in STORAGE UNITS) when thesize of ELEMENT TYPE exceeds that value. Fr example forunconstrained irrays such as string where ZLEM04 TYPE'SIZEis very large, MAX REC SIZE is used instead.MAX RECORD SIZE is defined in--SYSTEM and can be changed by aprogram before instantiating INTEGER 10 to provide an upperlimit on the record size. SEQUENTIA 10 imposes no limit onMAXRECSIZE.

11. Implementation Limits

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

11.1. Line Length

ThQ 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 statically

C-12

APPENDIX F OF THE Ada STANDARD

sized 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

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 compilatiEn unit. Ifthis value is exceeded the coi-Aler will terminate the com-pilation of the unit with a FATAL error message.

C-1 3