-- C64005D0M.ADA
|
-- C64005D0M.ADA
|
|
|
-- Grant of Unlimited Rights
|
-- Grant of Unlimited Rights
|
--
|
--
|
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
|
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
|
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
|
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
|
-- unlimited rights in the software and documentation contained herein.
|
-- unlimited rights in the software and documentation contained herein.
|
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
|
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
|
-- this public release, the Government intends to confer upon all
|
-- this public release, the Government intends to confer upon all
|
-- recipients unlimited rights equal to those held by the Government.
|
-- recipients unlimited rights equal to those held by the Government.
|
-- These rights include rights to use, duplicate, release or disclose the
|
-- These rights include rights to use, duplicate, release or disclose the
|
-- released technical data and computer software in whole or in part, in
|
-- released technical data and computer software in whole or in part, in
|
-- any manner and for any purpose whatsoever, and to have or permit others
|
-- any manner and for any purpose whatsoever, and to have or permit others
|
-- to do so.
|
-- to do so.
|
--
|
--
|
-- DISCLAIMER
|
-- DISCLAIMER
|
--
|
--
|
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
|
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
|
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
|
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
|
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
|
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
|
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
|
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
|
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
|
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
|
-- PARTICULAR PURPOSE OF SAID MATERIAL.
|
-- PARTICULAR PURPOSE OF SAID MATERIAL.
|
--*
|
--*
|
-- CHECK THAT NESTED SUBPROGRAMS CAN BE CALLED RECURSIVELY AND THAT
|
-- CHECK THAT NESTED SUBPROGRAMS CAN BE CALLED RECURSIVELY AND THAT
|
-- NON-LOCAL VARIABLES AND FORMAL PARAMETERS ARE PROPERLY ACCESSED FROM
|
-- NON-LOCAL VARIABLES AND FORMAL PARAMETERS ARE PROPERLY ACCESSED FROM
|
-- WITHIN RECURSIVE INVOCATIONS. THIS TEST CHECKS THAT EVERY DISPLAY OR
|
-- WITHIN RECURSIVE INVOCATIONS. THIS TEST CHECKS THAT EVERY DISPLAY OR
|
-- STATIC CHAIN LEVEL CAN BE ACCESSED.
|
-- STATIC CHAIN LEVEL CAN BE ACCESSED.
|
|
|
-- THIS TEST USES 3 LEVELS OF NESTED RECURSIVE PROCEDURES (SEPARATELY
|
-- THIS TEST USES 3 LEVELS OF NESTED RECURSIVE PROCEDURES (SEPARATELY
|
-- COMPILED AS SUBUNITS).
|
-- COMPILED AS SUBUNITS).
|
|
|
-- SEPARATE FILES ARE:
|
-- SEPARATE FILES ARE:
|
-- C64005D0M THE MAIN PROCEDURE.
|
-- C64005D0M THE MAIN PROCEDURE.
|
-- C64005DA A RECURSIVE PROCEDURE SUBUNIT OF C64005D0M.
|
-- C64005DA A RECURSIVE PROCEDURE SUBUNIT OF C64005D0M.
|
-- C64005DB A RECURSIVE PROCEDURE SUBUNIT OF C64005DA.
|
-- C64005DB A RECURSIVE PROCEDURE SUBUNIT OF C64005DA.
|
-- C64005DC A RECURSIVE PROCEDURE SUBUNIT OF C64005DB.
|
-- C64005DC A RECURSIVE PROCEDURE SUBUNIT OF C64005DB.
|
|
|
-- JRK 7/30/84
|
-- JRK 7/30/84
|
|
|
WITH REPORT; USE REPORT;
|
WITH REPORT; USE REPORT;
|
|
|
PROCEDURE C64005D0M IS
|
PROCEDURE C64005D0M IS
|
|
|
SUBTYPE LEVEL IS CHARACTER RANGE 'A' .. 'C';
|
SUBTYPE LEVEL IS CHARACTER RANGE 'A' .. 'C';
|
SUBTYPE CALL IS CHARACTER RANGE '1' .. '3';
|
SUBTYPE CALL IS CHARACTER RANGE '1' .. '3';
|
|
|
MAX_LEV : CONSTANT := LEVEL'POS (LEVEL'LAST) -
|
MAX_LEV : CONSTANT := LEVEL'POS (LEVEL'LAST) -
|
LEVEL'POS (LEVEL'FIRST) + 1;
|
LEVEL'POS (LEVEL'FIRST) + 1;
|
T_LEN : CONSTANT := 2 * (1 + 3 * (MAX_LEV +
|
T_LEN : CONSTANT := 2 * (1 + 3 * (MAX_LEV +
|
MAX_LEV*(MAX_LEV+1)/2*2)) + 1;
|
MAX_LEV*(MAX_LEV+1)/2*2)) + 1;
|
G_LEN : CONSTANT := 2 + 4 * MAX_LEV;
|
G_LEN : CONSTANT := 2 + 4 * MAX_LEV;
|
|
|
TYPE TRACE IS
|
TYPE TRACE IS
|
RECORD
|
RECORD
|
E : NATURAL := 0;
|
E : NATURAL := 0;
|
S : STRING (1 .. T_LEN);
|
S : STRING (1 .. T_LEN);
|
END RECORD;
|
END RECORD;
|
|
|
V : CHARACTER := IDENT_CHAR ('<');
|
V : CHARACTER := IDENT_CHAR ('<');
|
L : CHARACTER := IDENT_CHAR ('>');
|
L : CHARACTER := IDENT_CHAR ('>');
|
T : TRACE;
|
T : TRACE;
|
G : STRING (1 .. G_LEN);
|
G : STRING (1 .. G_LEN);
|
|
|
PROCEDURE C64005DA (L : LEVEL; C : CALL; T : IN OUT TRACE) IS
|
PROCEDURE C64005DA (L : LEVEL; C : CALL; T : IN OUT TRACE) IS
|
SEPARATE;
|
SEPARATE;
|
|
|
BEGIN
|
BEGIN
|
TEST ("C64005D", "CHECK THAT NON-LOCAL VARIABLES AND FORMAL " &
|
TEST ("C64005D", "CHECK THAT NON-LOCAL VARIABLES AND FORMAL " &
|
"PARAMETERS AT ALL LEVELS OF NESTED " &
|
"PARAMETERS AT ALL LEVELS OF NESTED " &
|
"RECURSIVE PROCEDURES ARE ACCESSIBLE (FOR " &
|
"RECURSIVE PROCEDURES ARE ACCESSIBLE (FOR " &
|
"3 LEVELS OF SEPARATELY COMPILED SUBUNITS)");
|
"3 LEVELS OF SEPARATELY COMPILED SUBUNITS)");
|
|
|
-- APPEND V TO T.
|
-- APPEND V TO T.
|
T.S (T.E+1) := V;
|
T.S (T.E+1) := V;
|
T.E := T.E + 1;
|
T.E := T.E + 1;
|
|
|
C64005DA (IDENT_CHAR(LEVEL'FIRST), IDENT_CHAR('1'), T);
|
C64005DA (IDENT_CHAR(LEVEL'FIRST), IDENT_CHAR('1'), T);
|
|
|
-- APPEND L TO T.
|
-- APPEND L TO T.
|
T.S (T.E+1) := L;
|
T.S (T.E+1) := L;
|
T.E := T.E + 1;
|
T.E := T.E + 1;
|
|
|
COMMENT ("FINAL CALL TRACE LENGTH IS: " & INTEGER'IMAGE(T.E));
|
COMMENT ("FINAL CALL TRACE LENGTH IS: " & INTEGER'IMAGE(T.E));
|
COMMENT ("FINAL CALL TRACE IS: " & T.S(1..T.E));
|
COMMENT ("FINAL CALL TRACE IS: " & T.S(1..T.E));
|
COMMENT ("GLOBAL SNAPSHOT IS: " & G);
|
COMMENT ("GLOBAL SNAPSHOT IS: " & G);
|
|
|
-- CHECK THAT T AND G ARE CORRECT BY COMPUTING THEM ITERATIVELY.
|
-- CHECK THAT T AND G ARE CORRECT BY COMPUTING THEM ITERATIVELY.
|
|
|
DECLARE
|
DECLARE
|
SUBTYPE LC_LEVEL IS CHARACTER RANGE ASCII.LC_A ..
|
SUBTYPE LC_LEVEL IS CHARACTER RANGE ASCII.LC_A ..
|
CHARACTER'VAL (CHARACTER'POS(ASCII.LC_A) + MAX_LEV - 1);
|
CHARACTER'VAL (CHARACTER'POS(ASCII.LC_A) + MAX_LEV - 1);
|
|
|
CT : TRACE;
|
CT : TRACE;
|
CG : STRING (1 .. G_LEN);
|
CG : STRING (1 .. G_LEN);
|
BEGIN
|
BEGIN
|
COMMENT ("CORRECT FINAL CALL TRACE LENGTH IS: " &
|
COMMENT ("CORRECT FINAL CALL TRACE LENGTH IS: " &
|
INTEGER'IMAGE(T_LEN));
|
INTEGER'IMAGE(T_LEN));
|
|
|
IF T.E /= IDENT_INT (T_LEN) THEN
|
IF T.E /= IDENT_INT (T_LEN) THEN
|
FAILED ("WRONG FINAL CALL TRACE LENGTH");
|
FAILED ("WRONG FINAL CALL TRACE LENGTH");
|
|
|
ELSE CT.S (CT.E+1) := '<';
|
ELSE CT.S (CT.E+1) := '<';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
FOR I IN LC_LEVEL LOOP
|
FOR I IN LC_LEVEL LOOP
|
CT.S (CT.E+1) := '<';
|
CT.S (CT.E+1) := '<';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
FOR J IN LC_LEVEL'FIRST .. I LOOP
|
FOR J IN LC_LEVEL'FIRST .. I LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '1';
|
CT.S (CT.E+2) := '1';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
END LOOP;
|
END LOOP;
|
|
|
FOR I IN LC_LEVEL LOOP
|
FOR I IN LC_LEVEL LOOP
|
CT.S (CT.E+1) := '<';
|
CT.S (CT.E+1) := '<';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
FOR J IN LC_LEVEL'FIRST .. LC_LEVEL'PRED(I) LOOP
|
FOR J IN LC_LEVEL'FIRST .. LC_LEVEL'PRED(I) LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '3';
|
CT.S (CT.E+2) := '3';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := I;
|
CT.S (CT.E+1) := I;
|
CT.S (CT.E+2) := '2';
|
CT.S (CT.E+2) := '2';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
|
|
CT.S (CT.E+1) := '<';
|
CT.S (CT.E+1) := '<';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
FOR J IN LC_LEVEL'FIRST .. I LOOP
|
FOR J IN LC_LEVEL'FIRST .. I LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '3';
|
CT.S (CT.E+2) := '3';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := '=';
|
CT.S (CT.E+1) := '=';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
FOR I IN REVERSE LEVEL LOOP
|
FOR I IN REVERSE LEVEL LOOP
|
FOR J IN REVERSE LEVEL'FIRST .. I LOOP
|
FOR J IN REVERSE LEVEL'FIRST .. I LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '3';
|
CT.S (CT.E+2) := '3';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := '>';
|
CT.S (CT.E+1) := '>';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
CT.S (CT.E+1) := I;
|
CT.S (CT.E+1) := I;
|
CT.S (CT.E+2) := '2';
|
CT.S (CT.E+2) := '2';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
|
|
FOR J IN REVERSE LEVEL'FIRST .. LEVEL'PRED(I) LOOP
|
FOR J IN REVERSE LEVEL'FIRST .. LEVEL'PRED(I) LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '3';
|
CT.S (CT.E+2) := '3';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := '>';
|
CT.S (CT.E+1) := '>';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
END LOOP;
|
END LOOP;
|
|
|
FOR I IN REVERSE LEVEL LOOP
|
FOR I IN REVERSE LEVEL LOOP
|
FOR J IN REVERSE LEVEL'FIRST .. I LOOP
|
FOR J IN REVERSE LEVEL'FIRST .. I LOOP
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+1) := J;
|
CT.S (CT.E+2) := '1';
|
CT.S (CT.E+2) := '1';
|
CT.E := CT.E + 2;
|
CT.E := CT.E + 2;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := '>';
|
CT.S (CT.E+1) := '>';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
END LOOP;
|
END LOOP;
|
|
|
CT.S (CT.E+1) := '>';
|
CT.S (CT.E+1) := '>';
|
CT.E := CT.E + 1;
|
CT.E := CT.E + 1;
|
|
|
IF CT.E /= IDENT_INT (T_LEN) THEN
|
IF CT.E /= IDENT_INT (T_LEN) THEN
|
FAILED ("WRONG ITERATIVE TRACE LENGTH");
|
FAILED ("WRONG ITERATIVE TRACE LENGTH");
|
|
|
ELSE COMMENT ("CORRECT FINAL CALL TRACE IS: " & CT.S);
|
ELSE COMMENT ("CORRECT FINAL CALL TRACE IS: " & CT.S);
|
|
|
IF T.S /= CT.S THEN
|
IF T.S /= CT.S THEN
|
FAILED ("WRONG FINAL CALL TRACE");
|
FAILED ("WRONG FINAL CALL TRACE");
|
END IF;
|
END IF;
|
END IF;
|
END IF;
|
END IF;
|
END IF;
|
|
|
DECLARE
|
DECLARE
|
E : NATURAL := 0;
|
E : NATURAL := 0;
|
BEGIN
|
BEGIN
|
CG (1..2) := "<>";
|
CG (1..2) := "<>";
|
E := E + 2;
|
E := E + 2;
|
|
|
FOR I IN LEVEL LOOP
|
FOR I IN LEVEL LOOP
|
CG (E+1) := LC_LEVEL'VAL (LEVEL'POS(I) -
|
CG (E+1) := LC_LEVEL'VAL (LEVEL'POS(I) -
|
LEVEL'POS(LEVEL'FIRST) +
|
LEVEL'POS(LEVEL'FIRST) +
|
LC_LEVEL'POS
|
LC_LEVEL'POS
|
(LC_LEVEL'FIRST));
|
(LC_LEVEL'FIRST));
|
CG (E+2) := '3';
|
CG (E+2) := '3';
|
CG (E+3) := I;
|
CG (E+3) := I;
|
CG (E+4) := '3';
|
CG (E+4) := '3';
|
E := E + 4;
|
E := E + 4;
|
END LOOP;
|
END LOOP;
|
|
|
COMMENT ("CORRECT GLOBAL SNAPSHOT IS: " & CG);
|
COMMENT ("CORRECT GLOBAL SNAPSHOT IS: " & CG);
|
|
|
IF G /= CG THEN
|
IF G /= CG THEN
|
FAILED ("WRONG GLOBAL SNAPSHOT");
|
FAILED ("WRONG GLOBAL SNAPSHOT");
|
END IF;
|
END IF;
|
END;
|
END;
|
END;
|
END;
|
|
|
RESULT;
|
RESULT;
|
END C64005D0M;
|
END C64005D0M;
|
|
|