DataMuseum.dk Presents historical artifacts from the history of: Rational R1000/400

This is an automatic "excavation" of a thematic subset of artifacts from Datamuseum.dk's BitArchive. See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software.

top - metrics - download

⟦b1dee4cbb⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package Pragmas, pragma Module_Name 4 3574, pragma Subsystem Design_Facility, seg_028ae3

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─⟦5a81ac88f⟧ »Space Info Vol 1« 
        └─⟦this⟧ 

with Ada_Program;
package Pragmas is

    --
    --    The use of this system is subject to the software license terms and
    --    conditions agreed upon between Rational and the Customer.
    --
    --               Copyright 1987, 1988, 1989, 1990 by Rational.
    --
    --                          RESTRICTED RIGHTS LEGEND
    --
    --    Use, duplication, or disclosure by the Government is subject to
    --    restrictions as set forth in subdivision (b)(3)(ii) of the Rights in
    --    Technical Data and Computer Software clause at 52.227-7013.
    --
    --
    --                Rational
    --                3320 Scott Boulevard
    --                Santa Clara, California 95054
    --
    --   PROPRIETARY AND CONFIDENTIAL INFORMATION OF RATIONAL;
    --   USE OR COPYING WITHOUT EXPRESS WRITTEN AUTHORIZATION
    --   IS STRICTLY PROHIBITED.  THIS MATERIAL IS PROTECTED AS
    --   AN UNPUBLISHED WORK UNDER THE U.S. COPYRIGHT ACT OF
    --   1976.  CREATED 1987, 1988, 1989, 1990.  ALL RIGHTS RESERVED.
    --


    -- LRM 2.8
    -- This package provides operations on pragma elements

    -- Local Renamings:
    subtype Pragma_Usage is Ada_Program.Pragma_Usage;
    subtype Declaration  is Ada_Program.Declaration;

    subtype Association_Iterator is Ada_Program.Association_Iterator;
    -------------------------------------------------------------------

    function Is_Predefined (A_Pragma : Pragma_Usage) return Boolean;

    type Pragma_Kinds is (Controlled,  
                          Elaborate,  
                          Inline,  
                          Interface,  
                          List,  
                          Memory_Size,  
                          Optimize,  
                          Pack,  
                          Page,  
                          Priority,  
                          Shared,  
                          Storage_Unit,  
                          Suppress,  
                          System_Name,  
                          Not_A_Predefined_Pragma);

    Unknown : constant Pragma_Kinds := Not_A_Predefined_Pragma;

    function Kind (A_Pragma : Pragma_Usage) return Pragma_Kinds;
    -- Returns the kind of a pragma.  Returns Not_A_Predefined_Pragma on
    -- implementation-specific pragmas.


    function Name (A_Pragma : Pragma_Usage) return String;
    -- Returns the uppercase simple name of any pragma.  This is the way
    -- to analyze implementation-specific pragmas.

    function Arguments (A_Pragma : Pragma_Usage) return Association_Iterator;
    -- Returns a list of the arguments to a pragma.  Operations from
    -- package ASSOCIATIONS can be used to decompose them.


    pragma Subsystem (Design_Facility, Closed);
    pragma Module_Name (4, 3574);
    pragma Bias_Key (27);
end Pragmas;

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=1a rec1=00 rec2=01 rec3=014
        [0x01] rec0=1c rec1=00 rec2=02 rec3=02a
        [0x02] rec0=18 rec1=00 rec2=03 rec3=000
    tail 0x21521191283c247c46833 0x42a00088462065003