Datasets:
QueenieFi
/
CodeText_dataset

Dataset card Data Studio Files
xet
 Community
1
CombinedText
stringlengths
4
3.42M
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G . P R O T E C T E D _ O B J E C T S . -- -- E N T R I E S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1998-2005, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains all the simple primitives related to protected -- objects with entries (i.e init, lock, unlock). -- The handling of protected objects with no entries is done in -- System.Tasking.Protected_Objects, the complex routines for protected -- objects with entries in System.Tasking.Protected_Objects.Operations. -- The split between Entries and Operations is needed to break circular -- dependencies inside the run time. -- Note: the compiler generates direct calls to this interface, via Rtsfind with Ada.Exceptions; -- Used for Exception_Occurrence_Access -- Raise_Exception with System.Task_Primitives.Operations; -- Used for Initialize_Lock -- Write_Lock -- Unlock -- Get_Priority -- Wakeup with System.Tasking.Initialization; -- Used for Defer_Abort, -- Undefer_Abort, -- Change_Base_Priority pragma Elaborate_All (System.Tasking.Initialization); -- This insures that tasking is initialized if any protected objects are -- created. with System.Parameters; -- Used for Single_Lock package body System.Tasking.Protected_Objects.Entries is package STPO renames System.Task_Primitives.Operations; use Parameters; use Task_Primitives.Operations; use Ada.Exceptions; ---------------- -- Local Data -- ---------------- Locking_Policy : Character; pragma Import (C, Locking_Policy, "__gl_locking_policy"); -------------- -- Finalize -- -------------- procedure Finalize (Object : in out Protection_Entries) is Entry_Call : Entry_Call_Link; Caller : Task_Id; Ceiling_Violation : Boolean; Self_ID : constant Task_Id := STPO.Self; Old_Base_Priority : System.Any_Priority; begin if Object.Finalized then return; end if; STPO.Write_Lock (Object.L'Unrestricted_Access, Ceiling_Violation); if Single_Lock then Lock_RTS; end if; if Ceiling_Violation then -- Dip our own priority down to ceiling of lock. See similar code in -- Tasking.Entry_Calls.Lock_Server. STPO.Write_Lock (Self_ID); Old_Base_Priority := Self_ID.Common.Base_Priority; Self_ID.New_Base_Priority := Object.Ceiling; Initialization.Change_Base_Priority (Self_ID); STPO.Unlock (Self_ID); if Single_Lock then Unlock_RTS; end if; STPO.Write_Lock (Object.L'Unrestricted_Access, Ceiling_Violation); if Ceiling_Violation then Raise_Exception (Program_Error'Identity, "Ceiling Violation"); end if; if Single_Lock then Lock_RTS; end if; Object.Old_Base_Priority := Old_Base_Priority; Object.Pending_Action := True; end if; -- Send program_error to all tasks still queued on this object for E in Object.Entry_Queues'Range loop Entry_Call := Object.Entry_Queues (E).Head; while Entry_Call /= null loop Caller := Entry_Call.Self; Entry_Call.Exception_To_Raise := Program_Error'Identity; STPO.Write_Lock (Caller); Initialization.Wakeup_Entry_Caller (Self_ID, Entry_Call, Done); STPO.Unlock (Caller); exit when Entry_Call = Object.Entry_Queues (E).Tail; Entry_Call := Entry_Call.Next; end loop; end loop; Object.Finalized := True; if Single_Lock then Unlock_RTS; end if; STPO.Unlock (Object.L'Unrestricted_Access); STPO.Finalize_Lock (Object.L'Unrestricted_Access); end Finalize; ------------------------------------- -- Has_Interrupt_Or_Attach_Handler -- ------------------------------------- function Has_Interrupt_Or_Attach_Handler (Object : Protection_Entries_Access) return Boolean is pragma Warnings (Off, Object); begin return False; end Has_Interrupt_Or_Attach_Handler; ----------------------------------- -- Initialize_Protection_Entries -- ----------------------------------- procedure Initialize_Protection_Entries (Object : Protection_Entries_Access; Ceiling_Priority : Integer; Compiler_Info : System.Address; Entry_Bodies : Protected_Entry_Body_Access; Find_Body_Index : Find_Body_Index_Access) is Init_Priority : Integer := Ceiling_Priority; Self_ID : constant Task_Id := STPO.Self; begin if Init_Priority = Unspecified_Priority then Init_Priority := System.Priority'Last; end if; if Locking_Policy = 'C' and then Has_Interrupt_Or_Attach_Handler (Object) and then Init_Priority not in System.Interrupt_Priority then -- Required by C.3.1(11) raise Program_Error; end if; Initialization.Defer_Abort (Self_ID); Initialize_Lock (Init_Priority, Object.L'Access); Initialization.Undefer_Abort (Self_ID); Object.Ceiling := System.Any_Priority (Init_Priority); Object.Owner := Null_Task; Object.Compiler_Info := Compiler_Info; Object.Pending_Action := False; Object.Call_In_Progress := null; Object.Entry_Bodies := Entry_Bodies; Object.Find_Body_Index := Find_Body_Index; for E in Object.Entry_Queues'Range loop Object.Entry_Queues (E).Head := null; Object.Entry_Queues (E).Tail := null; end loop; end Initialize_Protection_Entries; ------------------ -- Lock_Entries -- ------------------ procedure Lock_Entries (Object : Protection_Entries_Access; Ceiling_Violation : out Boolean) is begin if Object.Finalized then Raise_Exception (Program_Error'Identity, "Protected Object is finalized"); end if; -- If pragma Detect_Blocking is active then, as described in the ARM -- 9.5.1, par. 15, we must check whether this is an external call on a -- protected subprogram with the same target object as that of the -- protected action that is currently in progress (i.e., if the caller -- is already the protected object's owner). If this is the case hence -- Program_Error must be raised. if Detect_Blocking and then Object.Owner = Self then raise Program_Error; end if; -- The lock is made without defering abort -- Therefore the abort has to be deferred before calling this routine. -- This means that the compiler has to generate a Defer_Abort call -- before the call to Lock. -- The caller is responsible for undeferring abort, and compiler -- generated calls must be protected with cleanup handlers to ensure -- that abort is undeferred in all cases. pragma Assert (STPO.Self.Deferral_Level > 0); Write_Lock (Object.L'Access, Ceiling_Violation); -- We are entering in a protected action, so that we increase the -- protected object nesting level (if pragma Detect_Blocking is -- active), and update the protected object's owner. if Detect_Blocking then declare Self_Id : constant Task_Id := Self; begin -- Update the protected object's owner Object.Owner := Self_Id; -- Increase protected object nesting level Self_Id.Common.Protected_Action_Nesting := Self_Id.Common.Protected_Action_Nesting + 1; end; end if; end Lock_Entries; procedure Lock_Entries (Object : Protection_Entries_Access) is Ceiling_Violation : Boolean; begin Lock_Entries (Object, Ceiling_Violation); if Ceiling_Violation then Raise_Exception (Program_Error'Identity, "Ceiling Violation"); end if; end Lock_Entries; ---------------------------- -- Lock_Read_Only_Entries -- ---------------------------- procedure Lock_Read_Only_Entries (Object : Protection_Entries_Access) is Ceiling_Violation : Boolean; begin if Object.Finalized then Raise_Exception (Program_Error'Identity, "Protected Object is finalized"); end if; -- If pragma Detect_Blocking is active then, as described in the ARM -- 9.5.1, par. 15, we must check whether this is an external call on a -- protected subprogram with the same target object as that of the -- protected action that is currently in progress (i.e., if the caller -- is already the protected object's owner). If this is the case hence -- Program_Error must be raised. -- Note that in this case (getting read access), several tasks may -- have read ownership of the protected object, so that this method of -- storing the (single) protected object's owner does not work -- reliably for read locks. However, this is the approach taken for two -- major reasosn: first, this function is not currently being used (it -- is provided for possible future use), and second, it largely -- simplifies the implementation. if Detect_Blocking and then Object.Owner = Self then raise Program_Error; end if; Read_Lock (Object.L'Access, Ceiling_Violation); if Ceiling_Violation then Raise_Exception (Program_Error'Identity, "Ceiling Violation"); end if; -- We are entering in a protected action, so that we increase the -- protected object nesting level (if pragma Detect_Blocking is -- active), and update the protected object's owner. if Detect_Blocking then declare Self_Id : constant Task_Id := Self; begin -- Update the protected object's owner Object.Owner := Self_Id; -- Increase protected object nesting level Self_Id.Common.Protected_Action_Nesting := Self_Id.Common.Protected_Action_Nesting + 1; end; end if; end Lock_Read_Only_Entries; -------------------- -- Unlock_Entries -- -------------------- procedure Unlock_Entries (Object : Protection_Entries_Access) is begin -- We are exiting from a protected action, so that we decrease the -- protected object nesting level (if pragma Detect_Blocking is -- active), and remove ownership of the protected object. if Detect_Blocking then declare Self_Id : constant Task_Id := Self; begin -- Calls to this procedure can only take place when being within -- a protected action and when the caller is the protected -- object's owner. pragma Assert (Self_Id.Common.Protected_Action_Nesting > 0 and then Object.Owner = Self_Id); -- Remove ownership of the protected object Object.Owner := Null_Task; Self_Id.Common.Protected_Action_Nesting := Self_Id.Common.Protected_Action_Nesting - 1; end; end if; Unlock (Object.L'Access); end Unlock_Entries; end System.Tasking.Protected_Objects.Entries;
----------------------------------------------------------------------- -- asf-navigations-mappers -- Read XML navigation files -- Copyright (C) 2010, 2011, 2017, 2018 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Util.Beans.Objects; with Util.Serialize.Mappers.Record_Mapper; with EL.Contexts; -- The <b>ASF.Navigations.Reader</b> package defines an XML mapper that can be used -- to read the XML navigation files. package ASF.Navigations.Mappers is type Navigation_Case_Fields is (FROM_VIEW_ID, OUTCOME, ACTION, TO_VIEW, REDIRECT, CONDITION, CONTENT, CONTENT_TYPE, NAVIGATION_CASE, NAVIGATION_RULE, STATUS); -- ------------------------------ -- Navigation Config Reader -- ------------------------------ -- When reading and parsing the XML navigation file, the <b>Nav_Config</b> object -- is populated by calls through the <b>Set_Member</b> procedure. The data is -- collected and when the end of the navigation case element is reached, -- the new navigation case is inserted in the navigation handler. type Nav_Config is limited record Outcome : Util.Beans.Objects.Object; Action : Util.Beans.Objects.Object; To_View : Util.Beans.Objects.Object; From_View : Util.Beans.Objects.Object; Redirect : Boolean := False; Condition : Util.Beans.Objects.Object; Content : Util.Beans.Objects.Object; Content_Type : Util.Beans.Objects.Object; Status : Natural := 0; Context : EL.Contexts.ELContext_Access; Handler : Navigation_Handler_Access; end record; type Nav_Config_Access is access all Nav_Config; -- Save in the navigation config object the value associated with the given field. -- When the <b>NAVIGATION_CASE</b> field is reached, insert the new navigation rule -- that was collected in the navigation handler. procedure Set_Member (N : in out Nav_Config; Field : in Navigation_Case_Fields; Value : in Util.Beans.Objects.Object); -- Setup the XML parser to read the navigation rules. generic Mapper : in out Util.Serialize.Mappers.Processing; Handler : in Navigation_Handler_Access; Context : in EL.Contexts.ELContext_Access; package Reader_Config is Config : aliased Nav_Config; end Reader_Config; private -- Reset the navigation config before parsing a new rule. procedure Reset (N : in out Nav_Config); package Navigation_Mapper is new Util.Serialize.Mappers.Record_Mapper (Element_Type => Nav_Config, Element_Type_Access => Nav_Config_Access, Fields => Navigation_Case_Fields, Set_Member => Set_Member); end ASF.Navigations.Mappers;
-- This package was generated by the Ada_Drivers_Library project wizard script package ADL_Config is Vendor : constant String := "Nordic"; -- From board definition Max_Mount_Points : constant := 2; -- From default value Boot_Memory : constant String := "flash"; -- From default value Max_Mount_Name_Length : constant := 128; -- From default value Runtime_Profile : constant String := "zfp"; -- From command line Device_Name : constant String := "nRF51822xxAA"; -- From board definition Device_Family : constant String := "nRF51"; -- From board definition Has_Ravenscar_SFP_Runtime : constant String := "False"; -- From board definition Runtime_Name : constant String := "zfp-cortex-m0"; -- From default value Has_Ravenscar_Full_Runtime : constant String := "False"; -- From board definition CPU_Core : constant String := "ARM Cortex-M0"; -- From mcu definition Board : constant String := "MicroBit"; -- From command line Has_ZFP_Runtime : constant String := "True"; -- From board definition Number_Of_Interrupts : constant := 32; -- From MCU definition Has_Custom_Memory_Area_1 : constant Boolean := False; -- From default value Use_Startup_Gen : constant Boolean := True; -- From command line Max_Path_Length : constant := 1024; -- From default value Runtime_Name_Suffix : constant String := "cortex-m0"; -- From board definition Architecture : constant String := "ARM"; -- From board definition end ADL_Config;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 0 9 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 9 package System.Pack_09 is pragma Preelaborate; Bits : constant := 9; type Bits_09 is mod 2 ** Bits; for Bits_09'Size use Bits; -- In all subprograms below, Rev_SSO is set True if the array has the -- non-default scalar storage order. function Get_09 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_09 with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_09 (Arr : System.Address; N : Natural; E : Bits_09; Rev_SSO : Boolean) with Inline; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. end System.Pack_09;
with Ada.Text_IO; with Ada.Integer_Text_IO; -- Copyright 2021 Melwyn Francis Carlo procedure A049 is use Ada.Text_IO; use Ada.Integer_Text_IO; -- File Reference: http://www.naturalnumbers.org/primes.html N : constant Integer := 10; FT : File_Type; Last_Index : Natural; Prime_Num : String (1 .. 10); File_Name : constant String := "problems/003/PrimeNumbers_Upto_1000000"; Primes_Nums : array (Integer range 1 .. 1200, Integer range 1 .. N) of Integer := (others => (others => 0)); Primes_Digits_Occurrences : array (Integer range 1 .. 1200) of Integer := (others => 0); Prime_Digits : String (1 .. N) := (others => Character'Val (0)); Primes_Digits : array (Integer range 1 .. 1200) of String (1 .. N) := (others => (others => Character'Val (0))); Duplicate_Found : Boolean; I, J, K, L, M : Integer; begin I := 1; Open (FT, In_File, File_Name); while not End_Of_File (FT) loop Get_Line (FT, Prime_Num, Last_Index); if Integer'Value (Prime_Num (1 .. Last_Index)) >= 1000 then if Integer'Value (Prime_Num (1 .. Last_Index)) <= 9999 then Prime_Digits := "0000000000"; Prime_Digits (Integer'Value (Prime_Num (1 .. 1)) + 1) := '1'; Prime_Digits (Integer'Value (Prime_Num (2 .. 2)) + 1) := '1'; Prime_Digits (Integer'Value (Prime_Num (3 .. 3)) + 1) := '1'; Prime_Digits (Integer'Value (Prime_Num (4 .. 4)) + 1) := '1'; Duplicate_Found := False; for J in 1 .. I loop if Primes_Digits (J) = Prime_Digits then if Primes_Nums (J, N) = 0 then for K in 2 .. N loop if Primes_Nums (J, K) = 0 then Primes_Nums (J, K) := Integer'Value ( Prime_Num (1 .. Last_Index)); exit; end if; end loop; Primes_Digits_Occurrences (J) := Primes_Digits_Occurrences (J) + 1; end if; Duplicate_Found := True; exit; end if; end loop; if not Duplicate_Found then Primes_Digits_Occurrences (I) := 0; Primes_Nums (I, 1) := Integer'Value ( Prime_Num (1 .. Last_Index)); Primes_Digits (I) := Prime_Digits; I := I + 1; end if; end if; end if; end loop; Close (FT); J := 1; K := 1; L := 1; M := 1; J_Loop : while J <= I loop if Primes_Digits_Occurrences (J) >= 3 then K := 1; while K <= (N - 2) loop if Primes_Nums (J, K) = 0 then exit; end if; if Primes_Nums (J, K) /= 1487 then L := K + 1; while L <= (N - 1) loop if Primes_Nums (J, L) = 0 then exit; end if; M := L + 1; while M <= N loop if Primes_Nums (J, M) = 0 then exit; end if; if (Primes_Nums (J, M) - Primes_Nums (J, L)) = (Primes_Nums (J, L) - Primes_Nums (J, K)) then exit J_Loop; end if; M := M + 1; end loop; L := L + 1; end loop; end if; K := K + 1; end loop; end if; J := J + 1; end loop J_Loop; Put (Primes_Nums (J, K), Width => 0); Put (Primes_Nums (J, L), Width => 0); Put (Primes_Nums (J, M), Width => 0); end A049;
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding -- -- -- -- Terminal_Interface.Curses.Forms.Field_Types.User -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998,2004 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control: -- $Revision: 1.13 $ -- $Date: 2004/08/21 21:37:00 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with Ada.Unchecked_Conversion; with Interfaces.C; with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux; package body Terminal_Interface.Curses.Forms.Field_Types.User is use type Interfaces.C.int; procedure Set_Field_Type (Fld : in Field; Typ : in User_Defined_Field_Type) is function Allocate_Arg (T : User_Defined_Field_Type'Class) return Argument_Access; function Set_Fld_Type (F : Field := Fld; Cft : C_Field_Type := C_Generic_Type; Arg1 : Argument_Access) return C_Int; pragma Import (C, Set_Fld_Type, "set_field_type"); Res : Eti_Error; function Allocate_Arg (T : User_Defined_Field_Type'Class) return Argument_Access is Ptr : constant Field_Type_Access := new User_Defined_Field_Type'Class'(T); begin return new Argument'(Usr => System.Null_Address, Typ => Ptr, Cft => Null_Field_Type); end Allocate_Arg; begin Res := Set_Fld_Type (Arg1 => Allocate_Arg (Typ)); if Res /= E_Ok then Eti_Exception (Res); end if; end Set_Field_Type; function To_Argument_Access is new Ada.Unchecked_Conversion (System.Address, Argument_Access); function Generic_Field_Check (Fld : Field; Usr : System.Address) return C_Int is Result : Boolean; Udf : constant User_Defined_Field_Type_Access := User_Defined_Field_Type_Access (To_Argument_Access (Usr).Typ); begin Result := Field_Check (Fld, Udf.all); return C_Int (Boolean'Pos (Result)); end Generic_Field_Check; function Generic_Char_Check (Ch : C_Int; Usr : System.Address) return C_Int is Result : Boolean; Udf : constant User_Defined_Field_Type_Access := User_Defined_Field_Type_Access (To_Argument_Access (Usr).Typ); begin Result := Character_Check (Character'Val (Ch), Udf.all); return C_Int (Boolean'Pos (Result)); end Generic_Char_Check; -- ----------------------------------------------------------------------- -- function C_Generic_Type return C_Field_Type is Res : Eti_Error; T : C_Field_Type; begin if M_Generic_Type = Null_Field_Type then T := New_Fieldtype (Generic_Field_Check'Access, Generic_Char_Check'Access); if T = Null_Field_Type then raise Form_Exception; else Res := Set_Fieldtype_Arg (T, Make_Arg'Access, Copy_Arg'Access, Free_Arg'Access); if Res /= E_Ok then Eti_Exception (Res); end if; end if; M_Generic_Type := T; end if; pragma Assert (M_Generic_Type /= Null_Field_Type); return M_Generic_Type; end C_Generic_Type; end Terminal_Interface.Curses.Forms.Field_Types.User;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . U T I L -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2004, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Csets; use Csets; with Stylesw; use Stylesw; with Uintp; use Uintp; with GNAT.Spelling_Checker; use GNAT.Spelling_Checker; separate (Par) package body Util is --------------------- -- Bad_Spelling_Of -- --------------------- function Bad_Spelling_Of (T : Token_Type) return Boolean is Tname : constant String := Token_Type'Image (T); -- Characters of token name S : String (1 .. Tname'Last - 4); -- Characters of token name folded to lower case, omitting TOK_ at start M1 : String (1 .. 42) := "incorrect spelling of keyword ************"; M2 : String (1 .. 44) := "illegal abbreviation of keyword ************"; -- Buffers used to construct error message P1 : constant := 30; P2 : constant := 32; -- Starting subscripts in M1, M2 for keyword name SL : constant Natural := S'Length; -- Length of expected token name excluding TOK_ at start begin if Token /= Tok_Identifier then return False; end if; for J in S'Range loop -- LLVM local S (J) := Fold_Lower (Tname (J + 4)); end loop; Get_Name_String (Token_Name); -- A special check for case of PROGRAM used for PROCEDURE if T = Tok_Procedure and then Name_Len = 7 and then Name_Buffer (1 .. 7) = "program" then Error_Msg_SC ("PROCEDURE expected"); Token := T; return True; -- A special check for an illegal abbrevation elsif Name_Len < S'Length and then Name_Len >= 4 and then Name_Buffer (1 .. Name_Len) = S (1 .. Name_Len) then for J in 1 .. S'Last loop M2 (P2 + J - 1) := Fold_Upper (S (J)); end loop; Error_Msg_SC (M2 (1 .. P2 - 1 + S'Last)); Token := T; return True; end if; -- Now we go into the full circuit to check for a misspelling -- Never consider something a misspelling if either the actual or -- expected string is less than 3 characters (before this check we -- used to consider i to be a misspelled if in some cases!) if SL < 3 or else Name_Len < 3 then return False; -- Special case: prefix matches, i.e. the leading characters of the -- token that we have exactly match the required keyword. If there -- are at least two characters left over, assume that we have a case -- of two keywords joined together which should not be joined. elsif Name_Len > SL + 1 and then S = Name_Buffer (1 .. SL) then Scan_Ptr := Token_Ptr + S'Length; Error_Msg_S ("missing space"); Token := T; return True; end if; if Is_Bad_Spelling_Of (Name_Buffer (1 .. Name_Len), S) then for J in 1 .. S'Last loop M1 (P1 + J - 1) := Fold_Upper (S (J)); end loop; Error_Msg_SC (M1 (1 .. P1 - 1 + S'Last)); Token := T; return True; else return False; end if; end Bad_Spelling_Of; ---------------------- -- Check_95_Keyword -- ---------------------- -- On entry, the caller has checked that current token is an identifier -- whose name matches the name of the 95 keyword New_Tok. procedure Check_95_Keyword (Token_95, Next : Token_Type) is Scan_State : Saved_Scan_State; begin Save_Scan_State (Scan_State); -- at identifier/keyword Scan; -- past identifier/keyword if Token = Next then Restore_Scan_State (Scan_State); -- to identifier Error_Msg_Name_1 := Token_Name; Error_Msg_SC ("(Ada 83) keyword* cannot be used!"); Token := Token_95; else Restore_Scan_State (Scan_State); -- to identifier end if; end Check_95_Keyword; ---------------------- -- Check_Bad_Layout -- ---------------------- procedure Check_Bad_Layout is begin if Style.RM_Column_Check and then Token_Is_At_Start_Of_Line and then Start_Column <= Scope.Table (Scope.Last).Ecol then Error_Msg_BC ("(style) incorrect layout"); end if; end Check_Bad_Layout; -------------------------- -- Check_Misspelling_Of -- -------------------------- procedure Check_Misspelling_Of (T : Token_Type) is begin if Bad_Spelling_Of (T) then null; end if; end Check_Misspelling_Of; ----------------------------- -- Check_Simple_Expression -- ----------------------------- procedure Check_Simple_Expression (E : Node_Id) is begin if Expr_Form = EF_Non_Simple then Error_Msg_N ("this expression must be parenthesized", E); end if; end Check_Simple_Expression; --------------------------------------- -- Check_Simple_Expression_In_Ada_83 -- --------------------------------------- procedure Check_Simple_Expression_In_Ada_83 (E : Node_Id) is begin if Expr_Form = EF_Non_Simple then if Ada_Version = Ada_83 then Error_Msg_N ("(Ada 83) this expression must be parenthesized!", E); end if; end if; end Check_Simple_Expression_In_Ada_83; ------------------------ -- Check_Subtype_Mark -- ------------------------ function Check_Subtype_Mark (Mark : Node_Id) return Node_Id is begin if Nkind (Mark) = N_Identifier or else Nkind (Mark) = N_Selected_Component or else (Nkind (Mark) = N_Attribute_Reference and then Is_Type_Attribute_Name (Attribute_Name (Mark))) or else Mark = Error then return Mark; else Error_Msg ("subtype mark expected", Sloc (Mark)); return Error; end if; end Check_Subtype_Mark; ------------------- -- Comma_Present -- ------------------- function Comma_Present return Boolean is Scan_State : Saved_Scan_State; Paren_Count : Nat; begin -- First check, if a comma is present, then a comma is present! if Token = Tok_Comma then T_Comma; return True; -- If we have a right paren, then that is taken as ending the list -- i.e. no comma is present. elsif Token = Tok_Right_Paren then return False; -- If pragmas, then get rid of them and make a recursive call -- to process what follows these pragmas. elsif Token = Tok_Pragma then P_Pragmas_Misplaced; return Comma_Present; -- At this stage we have an error, and the goal is to decide on whether -- or not we should diagnose an error and report a (non-existent) -- comma as being present, or simply to report no comma is present -- If we are a semicolon, then the question is whether we have a missing -- right paren, or whether the semicolon should have been a comma. To -- guess the right answer, we scan ahead keeping track of the paren -- level, looking for a clue that helps us make the right decision. -- This approach is highly accurate in the single error case, and does -- not make bad mistakes in the multiple error case (indeed we can't -- really make a very bad decision at this point in any case). elsif Token = Tok_Semicolon then Save_Scan_State (Scan_State); Scan; -- past semicolon -- Check for being followed by identifier => which almost certainly -- means we are still in a parameter list and the comma should have -- been a semicolon (such a sequence could not follow a semicolon) if Token = Tok_Identifier then Scan; if Token = Tok_Arrow then goto Assume_Comma; end if; end if; -- If that test didn't work, loop ahead looking for a comma or -- semicolon at the same parenthesis level. Always remember that -- we can't go badly wrong in an error situation like this! Paren_Count := 0; -- Here is the look ahead loop, Paren_Count tells us whether the -- token we are looking at is at the same paren level as the -- suspicious semicolon that we are trying to figure out. loop -- If we hit another semicolon or an end of file, and we have -- not seen a right paren or another comma on the way, then -- probably the semicolon did end the list. Indeed that is -- certainly the only single error correction possible here. if Token = Tok_Semicolon or else Token = Tok_EOF then Restore_Scan_State (Scan_State); return False; -- A comma at the same paren level as the semicolon is a strong -- indicator that the semicolon should have been a comma, indeed -- again this is the only possible single error correction. elsif Token = Tok_Comma then exit when Paren_Count = 0; -- A left paren just bumps the paren count elsif Token = Tok_Left_Paren then Paren_Count := Paren_Count + 1; -- A right paren that is at the same paren level as the semicolon -- also means that the only possible single error correction is -- to assume that the semicolon should have been a comma. If we -- are not at the same paren level, then adjust the paren level. elsif Token = Tok_Right_Paren then exit when Paren_Count = 0; Paren_Count := Paren_Count - 1; end if; -- Keep going, we haven't made a decision yet Scan; end loop; -- If we fall through the loop, it means that we found a terminating -- right paren or another comma. In either case it is reasonable to -- assume that the semicolon was really intended to be a comma. Also -- come here for the identifier arrow case. <<Assume_Comma>> Restore_Scan_State (Scan_State); Error_Msg_SC (""";"" illegal here, replaced by "","""); Scan; -- past the semicolon return True; -- If we are not at semicolon or a right paren, then we base the -- decision on whether or not the next token can be part of an -- expression. If not, then decide that no comma is present (the -- caller will eventually generate a missing right parent message) elsif Token in Token_Class_Eterm then return False; -- Otherwise we assume a comma is present, even if none is present, -- since the next token must be part of an expression, so if we were -- at the end of the list, then there is more than one error present. else T_Comma; -- to give error return True; end if; end Comma_Present; ----------------------- -- Discard_Junk_List -- ----------------------- procedure Discard_Junk_List (L : List_Id) is pragma Warnings (Off, L); begin null; end Discard_Junk_List; ----------------------- -- Discard_Junk_Node -- ----------------------- procedure Discard_Junk_Node (N : Node_Id) is pragma Warnings (Off, N); begin null; end Discard_Junk_Node; ------------ -- Ignore -- ------------ procedure Ignore (T : Token_Type) is begin if Token = T then if T = Tok_Comma then Error_Msg_SC ("unexpected "","" ignored"); elsif T = Tok_Left_Paren then Error_Msg_SC ("unexpected ""("" ignored"); elsif T = Tok_Right_Paren then Error_Msg_SC ("unexpected "")"" ignored"); elsif T = Tok_Semicolon then Error_Msg_SC ("unexpected "";"" ignored"); else declare Tname : constant String := Token_Type'Image (Token); Msg : String := "unexpected keyword ????????????????????????"; begin -- Loop to copy characters of keyword name (ignoring Tok_) for J in 5 .. Tname'Last loop Msg (J + 14) := Fold_Upper (Tname (J)); end loop; Msg (Tname'Last + 15 .. Tname'Last + 22) := " ignored"; Error_Msg_SC (Msg (1 .. Tname'Last + 22)); end; end if; Scan; -- Scan past ignored token end if; end Ignore; ---------------------------- -- Is_Reserved_Identifier -- ---------------------------- function Is_Reserved_Identifier (C : Id_Check := None) return Boolean is begin if not Is_Reserved_Keyword (Token) then return False; else declare Ident_Casing : constant Casing_Type := Identifier_Casing (Current_Source_File); Key_Casing : constant Casing_Type := Keyword_Casing (Current_Source_File); begin -- If the casing of identifiers and keywords is different in -- this source file, and the casing of this token matches the -- keyword casing, then we return False, since it is pretty -- clearly intended to be a keyword. if Ident_Casing = Unknown or else Key_Casing = Unknown or else Ident_Casing = Key_Casing or else Determine_Token_Casing /= Key_Casing then return True; -- Here we have a keyword written clearly with keyword casing. -- In default mode, we would not be willing to consider this as -- a reserved identifier, but if C is set, we may still accept it elsif C /= None then declare Scan_State : Saved_Scan_State; OK_Next_Tok : Boolean; begin Save_Scan_State (Scan_State); Scan; if Token_Is_At_Start_Of_Line then return False; end if; case C is when None => raise Program_Error; when C_Comma_Right_Paren => OK_Next_Tok := Token = Tok_Comma or else Token = Tok_Right_Paren; when C_Comma_Colon => OK_Next_Tok := Token = Tok_Comma or else Token = Tok_Colon; when C_Do => OK_Next_Tok := Token = Tok_Do; when C_Dot => OK_Next_Tok := Token = Tok_Dot; when C_Greater_Greater => OK_Next_Tok := Token = Tok_Greater_Greater; when C_In => OK_Next_Tok := Token = Tok_In; when C_Is => OK_Next_Tok := Token = Tok_Is; when C_Left_Paren_Semicolon => OK_Next_Tok := Token = Tok_Left_Paren or else Token = Tok_Semicolon; when C_Use => OK_Next_Tok := Token = Tok_Use; when C_Vertical_Bar_Arrow => OK_Next_Tok := Token = Tok_Vertical_Bar or else Token = Tok_Arrow; end case; Restore_Scan_State (Scan_State); if OK_Next_Tok then return True; end if; end; end if; end; end if; -- If we fall through it is not a reserved identifier return False; end Is_Reserved_Identifier; ---------------------- -- Merge_Identifier -- ---------------------- procedure Merge_Identifier (Prev : Node_Id; Nxt : Token_Type) is begin if Token /= Tok_Identifier then return; end if; declare S : Saved_Scan_State; T : Token_Type; begin Save_Scan_State (S); Scan; T := Token; Restore_Scan_State (S); if T /= Nxt then return; end if; end; -- Check exactly one space between identifiers if Source (Token_Ptr - 1) /= ' ' or else Int (Token_Ptr) /= Int (Prev_Token_Ptr) + Length_Of_Name (Chars (Prev)) + 1 then return; end if; -- Do the merge Get_Name_String (Chars (Token_Node)); declare Buf : constant String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len); begin Get_Name_String (Chars (Prev)); Add_Char_To_Name_Buffer ('_'); Add_Str_To_Name_Buffer (Buf); Set_Chars (Prev, Name_Find); end; Error_Msg_Node_1 := Prev; Error_Msg_SC ("unexpected identifier, possibly & was meant here"); Scan; end Merge_Identifier; ------------------- -- No_Constraint -- ------------------- procedure No_Constraint is begin if Token in Token_Class_Consk then Error_Msg_SC ("constraint not allowed here"); Discard_Junk_Node (P_Constraint_Opt); end if; end No_Constraint; -------------------- -- No_Right_Paren -- -------------------- function No_Right_Paren (Expr : Node_Id) return Node_Id is begin if Token = Tok_Right_Paren then Error_Msg_SC ("unexpected right parenthesis"); Resync_Expression; return Error; else return Expr; end if; end No_Right_Paren; --------------------- -- Pop_Scope_Stack -- --------------------- procedure Pop_Scope_Stack is begin pragma Assert (Scope.Last > 0); Scope.Decrement_Last; if Debug_Flag_P then Error_Msg_Uint_1 := UI_From_Int (Scope.Last); Error_Msg_SC ("decrement scope stack ptr, new value = ^!"); end if; end Pop_Scope_Stack; ---------------------- -- Push_Scope_Stack -- ---------------------- procedure Push_Scope_Stack is begin Scope.Increment_Last; if Style_Check_Max_Nesting_Level and then Scope.Last = Style_Max_Nesting_Level + 1 then Error_Msg ("(style) maximum nesting level exceeded", First_Non_Blank_Location); end if; Scope.Table (Scope.Last).Junk := False; Scope.Table (Scope.Last).Node := Empty; if Debug_Flag_P then Error_Msg_Uint_1 := UI_From_Int (Scope.Last); Error_Msg_SC ("increment scope stack ptr, new value = ^!"); end if; end Push_Scope_Stack; ---------------------- -- Separate_Present -- ---------------------- function Separate_Present return Boolean is Scan_State : Saved_Scan_State; begin if Token = Tok_Separate then return True; elsif Token /= Tok_Identifier then return False; else Save_Scan_State (Scan_State); Scan; -- past identifier if Token = Tok_Semicolon then Restore_Scan_State (Scan_State); return Bad_Spelling_Of (Tok_Separate); else Restore_Scan_State (Scan_State); return False; end if; end if; end Separate_Present; -------------------------- -- Signal_Bad_Attribute -- -------------------------- procedure Signal_Bad_Attribute is begin Error_Msg_N ("unrecognized attribute&", Token_Node); -- Check for possible misspelling Get_Name_String (Token_Name); declare AN : constant String := Name_Buffer (1 .. Name_Len); begin Error_Msg_Name_1 := First_Attribute_Name; while Error_Msg_Name_1 <= Last_Attribute_Name loop Get_Name_String (Error_Msg_Name_1); if Is_Bad_Spelling_Of (AN, Name_Buffer (1 .. Name_Len)) then Error_Msg_N ("\possible misspelling of %", Token_Node); exit; end if; Error_Msg_Name_1 := Error_Msg_Name_1 + 1; end loop; end; end Signal_Bad_Attribute; ----------------------------- -- Token_Is_At_End_Of_Line -- ----------------------------- function Token_Is_At_End_Of_Line return Boolean is S : Source_Ptr; begin -- Skip past blanks and horizontal tabs S := Scan_Ptr; while Source (S) = ' ' or else Source (S) = ASCII.HT loop S := S + 1; end loop; -- We are at end of line if at a control character (CR/LF/VT/FF/EOF) -- or if we are at the start of an end of line comment sequence. return Source (S) < ' ' or else (Source (S) = '-' and then Source (S + 1) = '-'); end Token_Is_At_End_Of_Line; ------------------------------- -- Token_Is_At_Start_Of_Line -- ------------------------------- function Token_Is_At_Start_Of_Line return Boolean is begin return (Token_Ptr = First_Non_Blank_Location or else Token = Tok_EOF); end Token_Is_At_Start_Of_Line; end Util;
-- Copyright ©2021,2022 Steve Merrony -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- The above copyright notice and this permission notice shall be included in -- all copies or substantial portions of the Software. -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -- THE SOFTWARE. package body Display_P is protected body Display is procedure Set_Dirty is begin Dirty := True; end Set_Dirty; procedure Clear_Dirty is begin Dirty := False; end Clear_Dirty; function Is_Dirty return Boolean is (Dirty); function Get_Visible_Cols return Positive is (Disp.Visible_Cols); function Get_Visible_Lines return Positive is (Disp.Visible_Lines); procedure Set_Visible_Cols (Cols : in Positive) is begin Disp.Visible_Cols := Cols; end Set_Visible_Cols; procedure Set_Visible_Lines (Lines : in Positive) is begin Disp.Visible_Lines := Lines; end Set_Visible_Lines; function Is_Blink_Enabled return Boolean is (Disp.Blink_Enabled); procedure Set_Blink_Enabled (Blink : in Boolean) is begin Disp.Blink_Enabled := Blink; end Set_Blink_Enabled; function Get_Cursor_X return Natural is (Disp.Cursor_X); function Get_Cursor_Y return Natural is (Disp.Cursor_Y); procedure Init is begin Disp.Visible_Lines := Default_Lines; Disp.Visible_Cols := Default_Cols; for Line in 0 .. Total_Lines - 1 loop for Col in 0 .. Total_Cols - 1 loop Disp.Cells(Line, Col).Clear_To_Space; end loop; end loop; Disp.Cells(12,39).Set (Value => 'O', Blnk => False, Dm => False, Rv => False, Under => False, Prot => False); Disp.Cells(12,40).Set (Value => 'K', Blnk => False, Dm => False, Rv => False, Under => False, Prot => False); Disp.Blink_Enabled := True; History.First := 0; History.Last := 0; for C in Empty_History_Line'Range loop Empty_History_Line(C).Clear_To_Space; end loop; for HL in History.Lines'Range loop for Col in 0 .. Total_Cols - 1 loop History.Lines(HL)(Col).Clear_To_Space; end loop; end loop; Set_Scrolled_Back (False); end Init; procedure Copy (Src : in out Display_T; Dest : out Display_T) is begin for Line in 0 .. Src.Visible_Lines-1 loop for Col in 0 .. Src.Visible_Cols-1 loop Cell.Copy (Src => Src.Cells(Line,Col), Dest => Dest.Cells(Line,Col)); end loop; end loop; Dest.Blink_Enabled := Src.Blink_Enabled; Dest.Cursor_X := Src.Cursor_X; Dest.Cursor_Y := Src.Cursor_Y; Dest.Visible_Cols := Src.Visible_Cols; Dest.Visible_Lines := Src.Visible_Lines; end Copy; procedure Clear_Cell (Line, Col : in Natural) is begin Disp.Cells(Line, Col).Clear_To_Space; end Clear_Cell; procedure Clear_Unprotected_Cell (Line, Col : in Natural) is begin Disp.Cells(Line, Col).Clear_If_Unprotected; end Clear_Unprotected_Cell; procedure Get_Cell (Line, Col : in Natural; Value : out Character; Blnk, Dm, Rv, Under, Prot : out Boolean) is begin Disp.Cells(Line,Col).Get (Value => Value, Blnk => Blnk, Dm => Dm, Rv => Rv, Under => Under, Prot => Prot); end Get_Cell; procedure Set_Cell (Line, Col : in Natural; Char : in Character; Blink, Dim, Rev, Under, Prot : in Boolean) is begin Disp.Cells(Line,Col).Set (Value => Char, Blnk => Blink, Dm => Dim, Rv => Rev, Under => Under, Prot => Prot); end Set_Cell; procedure Set_Cursor (X, Y : in Natural) is begin Disp.Cursor_X := X; Disp.Cursor_Y := Y; end Set_Cursor; procedure Clear_Line (Line : in Integer) is begin for Col in 0 .. Total_Cols - 1 loop Disp.Cells(Line, Col).Clear_To_Space; end loop; end Clear_Line; procedure Copy_Line (Src, Dest : in Integer) is begin for Col in 0 .. Total_Cols - 1 loop Cell.Copy (Src => Disp.Cells(Src,Col), Dest => Disp.Cells(Dest,Col)); end loop; end Copy_Line; procedure Copy_Line_To_History (Src : in Integer) is begin History.Last := History.Last + 1; if History.Last = History_Lines then -- wrap-around History.Last := 0; end if; -- has the tail hit the head? if History.Last = History.First then History.First := History.First + 1; if History.First = History_Lines then History.First := 0; end if; end if; for C in History.Lines(History.Last)'Range loop Cell.Copy (Src => Disp.Cells(Src,C), Dest => History.Lines(History.Last)(C)); end loop; end Copy_Line_To_History; procedure Copy_Line_From_History (Src, Dest : in Natural) is HL : History_Line; Ix : Integer; begin if History.First = History.Last then -- no history yet for C in Empty_History_Line'Range loop Cell.Copy (Src => Empty_History_Line(C), Dest => HL(C)); end loop; else Ix := History.Last - Src; if Ix < 0 then Ix := Ix + History_Lines; end if; for C in History.Lines(Ix)'Range loop Cell.Copy (Src => History.Lines(Ix)(C), Dest => HL(C)); end loop; end if; for Col in 0 .. Total_Cols - 1 loop Cell.Copy (Src => HL(Col), Dest => Disp.Cells(Dest,Col)); end loop; end Copy_Line_From_History; procedure Scroll_Up (Lines : in Natural) is begin for L in 1 .. Lines loop Copy_Line_To_History (0); for R in 1 .. Disp.Visible_Lines loop Copy_Line (Src => R, Dest => R - 1); Clear_Line (R); end loop; Clear_Line (Disp.Visible_Lines - 1); end loop; end Scroll_Up; function Is_Scrolled_Back return Boolean is (Scrolled_Back); procedure Set_Scrolled_Back (Back : in Boolean) is begin Scrolled_Back := Back; end Set_Scrolled_Back; procedure Scroll_Back (Start_Line : in Natural) is begin if not Scrolled_Back then Copy (Src => Disp, Dest => Saved_Disp); Scrolled_Back := True; end if; -- there are two cases: we are already scrolled back beyond the 'live' screen, -- or we are partially showing it if Start_Line < Disp.Visible_Lines then declare On_Screen_Line, Live_Line : Natural := 0; begin for HL in reverse 0 .. Start_Line loop Copy_Line_From_History (HL, On_Screen_Line); On_Screen_Line := On_Screen_Line + 1; end loop; while On_Screen_Line < Disp.Visible_Lines loop Copy_Line_From_History (Live_Line, On_Screen_Line); Live_Line := Live_Line + 1; On_Screen_Line := On_Screen_Line + 1; end loop; end; else -- all 'history' - easier for L in 0 .. Disp.Visible_Lines loop Copy_Line_From_History (Start_Line - L, L); end loop; end if; Set_Dirty; end Scroll_Back; procedure Cancel_Scroll_Back is begin Copy (Src => Saved_Disp, Dest => Disp); Scrolled_Back := False; Set_Dirty; end Cancel_Scroll_Back; end Display; end Display_P;
with Pack13_Pkg; package Pack13 is package Four_Bits is new Pack13_Pkg (4); package Thirty_Two_Bits is new Pack13_Pkg (32); type Object is private; type Object_Ptr is access all Object; procedure Set (Myself : Object_Ptr; The_Data : Thirty_Two_Bits.Object); private type Some_Record is record Data_1 : Thirty_Two_Bits.Object; Data_2 : Thirty_Two_Bits.Object; Small_Data : Four_Bits.Object; end record; for Some_Record use record Data_1 at 0 range 0 .. 31; Data_2 at 4 range 0 .. 31; Small_Data at 8 range 0 .. 3; end record; type Object is record Something : Some_Record; end record; for Object use record Something at 0 range 0 .. 67; end record; end Pack13;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.UML.Activity_Partitions.Hash is new AMF.Elements.Generic_Hash (UML_Activity_Partition, UML_Activity_Partition_Access);
with System; package Self is type Lim is limited private; type Lim_Ref is access all Lim; function G (X : Integer) return lim; procedure Change (X : in out Lim; Incr : Integer); function Get (X : Lim) return Integer; private type Lim is limited record Comp : Integer; Self_Default : Lim_Ref := Lim'Unchecked_Access; Self_Unrestricted_Default : Lim_Ref := Lim'Unrestricted_Access; Self_Anon_Default : access Lim := Lim'Unchecked_Access; Self_Anon_Unrestricted_Default : access Lim := Lim'Unrestricted_Access; end record; end Self;
-- Abstract : -- -- See spec. -- -- Copyright (C) 2018 - 2019 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or (at -- your option) any later version. This program is distributed in the -- hope that it will be useful, but WITHOUT ANY WARRANTY; without even -- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR -- PURPOSE. See the GNU General Public License for more details. You -- should have received a copy of the GNU General Public License -- distributed with this program; see file COPYING. If not, write to -- the Free Software Foundation, 51 Franklin Street, Suite 500, Boston, -- MA 02110-1335, USA. pragma License (GPL); with Ada.Command_Line; with Ada.Directories; with Ada.Exceptions; with Ada.Strings.Fixed; with Ada.Text_IO; with GNAT.OS_Lib; with GNAT.Traceback.Symbolic; with SAL; with System.Multiprocessors; with System.Storage_Elements; with WisiToken.Lexer; package body Emacs_Wisi_Common_Parse is procedure Usage (Name : in String) is use Ada.Text_IO; begin Put_Line ("usage: " & Name & "[--recover-log <file-name>]"); Put_Line ("enters a loop waiting for commands:"); Put_Line ("Prompt is '" & Prompt & "'"); Put_Line ("commands are case sensitive"); Put_Line ("See wisi-process-parse.el *--send-parse, *--send-noop for arguments."); end Usage; procedure Read_Input (A : System.Address; N : Integer) is use System.Storage_Elements; B : System.Address := A; Remaining : Integer := N; Read : Integer; begin -- We use GNAT.OS_Lib because it does not buffer input, so it runs -- under Emacs nicely; GNAT Text_IO does not return text until -- some fairly large buffer is filled. -- -- With GNAT GPL 2016, GNAT.OS_Lib.Read does _not_ wait for all N -- bytes or EOF; it returns as soon as it gets some bytes. loop Read := GNAT.OS_Lib.Read (GNAT.OS_Lib.Standin, B, Remaining); if Read = 0 then -- Pipe closed; probably parent Emacs crashed. Force exit. raise SAL.Programmer_Error with "input pipe closed"; end if; Remaining := Remaining - Read; exit when Remaining <= 0; B := B + Storage_Offset (Read); end loop; end Read_Input; function Get_Command_Length return Integer is Temp : aliased String (1 .. 3) := (others => ' '); -- initialize for error message begin Read_Input (Temp'Address, Temp'Length); return Integer'Value (Temp); exception when Constraint_Error => -- From Integer'Value raise Protocol_Error with "invalid command byte count; '" & Temp & "'"; end Get_Command_Length; function Get_String (Source : in String; Last : in out Integer) return String is use Ada.Strings.Fixed; First : constant Integer := Index (Source => Source, Pattern => """", From => Last + 1); begin Last := Index (Source => Source, Pattern => """", From => First + 1); if First = 0 or Last = 0 then raise Protocol_Error with "no '""' found for string"; end if; return Source (First + 1 .. Last - 1); end Get_String; function Get_Integer (Source : in String; Last : in out Integer) return Integer is use Ada.Strings.Fixed; First : constant Integer := Last + 2; -- final char of previous item, space begin Last := Index (Source => Source, Pattern => " ", From => First); if Last = 0 then Last := Source'Last; else Last := Last - 1; end if; return Integer'Value (Source (First .. Last)); exception when others => Ada.Text_IO.Put_Line ("bad integer '" & Source (First .. Source'Last) & "'"); raise; end Get_Integer; function Get_Process_Start_Params return Process_Start_Params is use Ada.Command_Line; procedure Put_Usage is use Ada.Text_IO; begin Put_Line (Standard_Error, "process start args:"); Put_Line (Standard_Error, "--help : put this help"); Put_Line (Standard_Error, "--recover-log <file_name> : log recover actions to file"); end Put_Usage; Next_Arg : Integer := 1; begin return Result : Process_Start_Params do loop exit when Next_Arg > Argument_Count; if Next_Arg <= Argument_Count and then Argument (Next_Arg) = "--help" then Put_Usage; raise Finish; elsif Next_Arg + 1 <= Argument_Count and then Argument (Next_Arg) = "--recover-log" then Result.Recover_Log_File_Name := Ada.Strings.Unbounded.To_Unbounded_String (Argument (Next_Arg + 1)); Next_Arg := Next_Arg + 2; end if; end loop; end return; end Get_Process_Start_Params; function Get_Parse_Params (Command_Line : in String; Last : in out Integer) return Parse_Params is use WisiToken; begin return Result : Parse_Params do -- We don't use an aggregate, to enforce execution order. -- Match wisi-process-parse.el wisi-process--send-parse Result.Post_Parse_Action := Wisi.Post_Parse_Action_Type'Val (Get_Integer (Command_Line, Last)); Result.Source_File_Name := +Get_String (Command_Line, Last); Result.Begin_Byte_Pos := Get_Integer (Command_Line, Last); -- Emacs end is after last char. Result.End_Byte_Pos := Get_Integer (Command_Line, Last) - 1; Result.Goal_Byte_Pos := Get_Integer (Command_Line, Last); Result.Begin_Char_Pos := WisiToken.Buffer_Pos (Get_Integer (Command_Line, Last)); Result.Begin_Line := WisiToken.Line_Number_Type (Get_Integer (Command_Line, Last)); Result.End_Line := WisiToken.Line_Number_Type (Get_Integer (Command_Line, Last)); Result.Begin_Indent := Get_Integer (Command_Line, Last); Result.Partial_Parse_Active := 1 = Get_Integer (Command_Line, Last); Result.Debug_Mode := 1 = Get_Integer (Command_Line, Last); Result.Parse_Verbosity := Get_Integer (Command_Line, Last); Result.McKenzie_Verbosity := Get_Integer (Command_Line, Last); Result.Action_Verbosity := Get_Integer (Command_Line, Last); Result.McKenzie_Disable := Get_Integer (Command_Line, Last); Result.Task_Count := Get_Integer (Command_Line, Last); Result.Check_Limit := Get_Integer (Command_Line, Last); Result.Enqueue_Limit := Get_Integer (Command_Line, Last); Result.Max_Parallel := Get_Integer (Command_Line, Last); Result.Byte_Count := Get_Integer (Command_Line, Last); end return; end Get_Parse_Params; function Get_Refactor_Params (Command_Line : in String; Last : in out Integer) return Refactor_Params is use WisiToken; begin return Result : Refactor_Params do -- We don't use an aggregate, to enforce execution order. -- Match wisi-process-parse.el wisi-process--send-refactor Result.Refactor_Action := Get_Integer (Command_Line, Last); Result.Source_File_Name := +Get_String (Command_Line, Last); Result.Parse_Region.First := WisiToken.Buffer_Pos (Get_Integer (Command_Line, Last)); Result.Parse_Region.Last := WisiToken.Buffer_Pos (Get_Integer (Command_Line, Last) - 1); Result.Edit_Begin := WisiToken.Buffer_Pos (Get_Integer (Command_Line, Last)); Result.Parse_Begin_Char_Pos := WisiToken.Buffer_Pos (Get_Integer (Command_Line, Last)); Result.Parse_Begin_Line := WisiToken.Line_Number_Type (Get_Integer (Command_Line, Last)); Result.Parse_End_Line := WisiToken.Line_Number_Type (Get_Integer (Command_Line, Last)); Result.Parse_Begin_Indent := Get_Integer (Command_Line, Last); Result.Debug_Mode := 1 = Get_Integer (Command_Line, Last); Result.Parse_Verbosity := Get_Integer (Command_Line, Last); Result.Action_Verbosity := Get_Integer (Command_Line, Last); Result.Max_Parallel := Get_Integer (Command_Line, Last); Result.Byte_Count := Get_Integer (Command_Line, Last); end return; end Get_Refactor_Params; procedure Process_Stream (Name : in String; Language_Protocol_Version : in String; Partial_Parse_Active : in out Boolean; Params : in Process_Start_Params; Parser : in out WisiToken.Parse.LR.Parser.Parser; Parse_Data : in out Wisi.Parse_Data_Type'Class; Descriptor : in WisiToken.Descriptor) is use Ada.Text_IO; use WisiToken; -- "+", "-" Unbounded_string procedure Cleanup is begin if Is_Open (Parser.Recover_Log_File) then Close (Parser.Recover_Log_File); end if; end Cleanup; begin declare use Ada.Directories; use Ada.Strings.Unbounded; begin if Length (Params.Recover_Log_File_Name) > 0 then Put_Line (";; logging to '" & (-Params.Recover_Log_File_Name) & "'"); -- to Current_Output, visible from Emacs if Exists (-Params.Recover_Log_File_Name) then Open (Parser.Recover_Log_File, Append_File, -Params.Recover_Log_File_Name); else Create (Parser.Recover_Log_File, Out_File, -Params.Recover_Log_File_Name); end if; end if; end; Parser.Trace.Set_Prefix (";; "); -- so debug messages don't confuse Emacs. Put_Line (Name & " protocol: process version " & Protocol_Version & " language version " & Language_Protocol_Version); -- Read commands and tokens from standard_input via GNAT.OS_Lib, -- send results to standard_output. loop Put (Prompt); Flush; declare Command_Length : constant Integer := Get_Command_Length; Command_Line : aliased String (1 .. Command_Length); Last : Integer; function Match (Target : in String) return Boolean is begin Last := Command_Line'First + Target'Length - 1; return Last <= Command_Line'Last and then Command_Line (Command_Line'First .. Last) = Target; end Match; begin Read_Input (Command_Line'Address, Command_Length); Put_Line (";; " & Command_Line); if Match ("parse") then -- Args: see wisi-process-parse.el wisi-process-parse--send-parse -- Input: <source text> -- Response: -- [response elisp vector]... -- [elisp error form]... -- prompt declare Params : constant Parse_Params := Get_Parse_Params (Command_Line, Last); Buffer : Ada.Strings.Unbounded.String_Access; procedure Clean_Up is use all type SAL.Base_Peek_Type; begin Parser.Lexer.Discard_Rest_Of_Input; if Parser.Parsers.Count > 0 then Parse_Data.Put (Parser.Lexer.Errors, Parser.Parsers.First.State_Ref.Errors, Parser.Parsers.First.State_Ref.Tree); end if; Ada.Strings.Unbounded.Free (Buffer); end Clean_Up; begin Trace_Parse := Params.Parse_Verbosity; Trace_McKenzie := Params.McKenzie_Verbosity; Trace_Action := Params.Action_Verbosity; Debug_Mode := Params.Debug_Mode; Partial_Parse_Active := Params.Partial_Parse_Active; Parser.Partial_Parse_Active := Params.Partial_Parse_Active; if WisiToken.Parse.LR.McKenzie_Defaulted (Parser.Table.all) then -- There is no McKenzie information; don't override that. null; elsif Params.McKenzie_Disable = -1 then -- Use default Parser.Enable_McKenzie_Recover := True; else Parser.Enable_McKenzie_Recover := Params.McKenzie_Disable = 0; end if; Parse_Data.Initialize (Post_Parse_Action => Params.Post_Parse_Action, Lexer => Parser.Lexer, Descriptor => Descriptor'Unrestricted_Access, Base_Terminals => Parser.Terminals'Unrestricted_Access, Begin_Line => Params.Begin_Line, End_Line => Params.End_Line, Begin_Indent => Params.Begin_Indent, Params => Command_Line (Last + 2 .. Command_Line'Last)); if Params.Task_Count > 0 then Parser.Table.McKenzie_Param.Task_Count := System.Multiprocessors.CPU_Range (Params.Task_Count); end if; if Params.Check_Limit > 0 then Parser.Table.McKenzie_Param.Check_Limit := Base_Token_Index (Params.Check_Limit); end if; if Params.Enqueue_Limit > 0 then Parser.Table.McKenzie_Param.Enqueue_Limit := Params.Enqueue_Limit; end if; if Params.Max_Parallel > 0 then Parser.Max_Parallel := SAL.Base_Peek_Type (Params.Max_Parallel); end if; Buffer := new String (Params.Begin_Byte_Pos .. Params.End_Byte_Pos); Read_Input (Buffer (Params.Begin_Byte_Pos)'Address, Params.Byte_Count); Parser.Lexer.Reset_With_String_Access (Buffer, Params.Source_File_Name, Params.Begin_Char_Pos, Params.Begin_Line); -- Parser.Line_Begin_Token First, Last set by Lex_All begin Parser.Parse; exception when WisiToken.Partial_Parse => null; end; Parser.Execute_Actions; Parse_Data.Put (Parser); Clean_Up; exception when Syntax_Error => Clean_Up; Put_Line ("(parse_error)"); when E : Parse_Error => Clean_Up; Put_Line ("(parse_error """ & Ada.Exceptions.Exception_Message (E) & """)"); when E : Fatal_Error => Clean_Up; Put_Line ("(error """ & Ada.Exceptions.Exception_Message (E) & """)"); end; elsif Match ("refactor") then -- Args: see wisi-process-parse.el wisi-process-parse--send-refactor -- Input: <source text> -- Response: -- [edit elisp vector]... -- prompt declare Params : constant Refactor_Params := Get_Refactor_Params (Command_Line, Last); Buffer : Ada.Strings.Unbounded.String_Access; procedure Clean_Up is use all type SAL.Base_Peek_Type; begin Parser.Lexer.Discard_Rest_Of_Input; if Parser.Parsers.Count > 0 then Parse_Data.Put (Parser.Lexer.Errors, Parser.Parsers.First.State_Ref.Errors, Parser.Parsers.First.State_Ref.Tree); end if; Ada.Strings.Unbounded.Free (Buffer); end Clean_Up; begin Trace_Parse := Params.Parse_Verbosity; Trace_Action := Params.Action_Verbosity; Debug_Mode := Params.Debug_Mode; Partial_Parse_Active := True; Parse_Data.Initialize (Post_Parse_Action => Wisi.Navigate, -- mostly ignored Lexer => Parser.Lexer, Descriptor => Descriptor'Unrestricted_Access, Base_Terminals => Parser.Terminals'Unrestricted_Access, Begin_Line => Params.Parse_Begin_Line, End_Line => Params.Parse_End_Line, Begin_Indent => Params.Parse_Begin_Indent, Params => ""); if Params.Max_Parallel > 0 then Parser.Max_Parallel := SAL.Base_Peek_Type (Params.Max_Parallel); end if; Buffer := new String (Integer (Params.Parse_Region.First) .. Integer (Params.Parse_Region.Last)); Read_Input (Buffer (Buffer'First)'Address, Params.Byte_Count); Parser.Lexer.Reset_With_String_Access (Buffer, Params.Source_File_Name, Params.Parse_Begin_Char_Pos, Params.Parse_Begin_Line); begin Parser.Parse; exception when WisiToken.Partial_Parse => null; end; Parser.Execute_Actions; Parse_Data.Refactor (Parser.Parsers.First_State_Ref.Tree, Params.Refactor_Action, Params.Edit_Begin); Clean_Up; exception when Syntax_Error => Clean_Up; Put_Line ("(parse_error ""refactor " & Params.Parse_Region.First'Image & Params.Parse_Region.Last'Image & ": syntax error"")"); when E : Parse_Error => Clean_Up; Put_Line ("(parse_error ""refactor " & Params.Parse_Region.First'Image & Params.Parse_Region.Last'Image & ": " & Ada.Exceptions.Exception_Message (E) & """)"); when E : others => -- includes Fatal_Error Clean_Up; Put_Line ("(error """ & Ada.Exceptions.Exception_Message (E) & """)"); end; elsif Match ("noop") then -- Args: <source byte count> -- Input: <source text> -- Response: prompt declare Byte_Count : constant Integer := Get_Integer (Command_Line, Last); Buffer : constant Ada.Strings.Unbounded.String_Access := new String (1 .. Byte_Count); Token : Base_Token; Lexer_Error : Boolean; pragma Unreferenced (Lexer_Error); begin Token.ID := Invalid_Token_ID; Read_Input (Buffer (1)'Address, Byte_Count); Parser.Lexer.Reset_With_String_Access (Buffer, +""); loop exit when Token.ID = Parser.Trace.Descriptor.EOI_ID; Lexer_Error := Parser.Lexer.Find_Next (Token); end loop; exception when Syntax_Error => Parser.Lexer.Discard_Rest_Of_Input; end; elsif Match ("quit") then exit; else Put_Line ("(error ""bad command: '" & Command_Line & "'"")"); end if; exception when E : Protocol_Error => -- don't exit the loop; allow debugging bad elisp Put_Line ("(error ""protocol error "": " & Ada.Exceptions.Exception_Message (E) & """)"); end; end loop; Cleanup; exception when Finish => null; when E : others => Cleanup; Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure); New_Line (2); Put_Line ("(error ""unhandled exception: " & Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E) & """)"); Put_Line (GNAT.Traceback.Symbolic.Symbolic_Traceback (E)); end Process_Stream; end Emacs_Wisi_Common_Parse;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . G L O B A L _ L O C K S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1999-2006, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This implementation is specific to NT with GNAT.Task_Lock; with Interfaces.C.Strings; with System.OS_Interface; package body System.Global_Locks is package TSL renames GNAT.Task_Lock; package OSI renames System.OS_Interface; package ICS renames Interfaces.C.Strings; subtype Lock_File_Entry is OSI.HANDLE; Last_Lock : Lock_Type := Null_Lock; Lock_Table : array (Lock_Type range 1 .. 15) of Lock_File_Entry; ----------------- -- Create_Lock -- ----------------- procedure Create_Lock (Lock : out Lock_Type; Name : String) is L : Lock_Type; begin TSL.Lock; Last_Lock := Last_Lock + 1; L := Last_Lock; TSL.Unlock; if L > Lock_Table'Last then raise Lock_Error; end if; Lock_Table (L) := OSI.CreateMutex (null, OSI.BOOL (False), ICS.New_String (Name)); Lock := L; end Create_Lock; ------------------ -- Acquire_Lock -- ------------------ procedure Acquire_Lock (Lock : in out Lock_Type) is use type OSI.DWORD; Res : OSI.DWORD; begin Res := OSI.WaitForSingleObject (Lock_Table (Lock), OSI.Wait_Infinite); if Res = OSI.WAIT_FAILED then raise Lock_Error; end if; end Acquire_Lock; ------------------ -- Release_Lock -- ------------------ procedure Release_Lock (Lock : in out Lock_Type) is use type OSI.BOOL; Res : OSI.BOOL; begin Res := OSI.ReleaseMutex (Lock_Table (Lock)); if Res = OSI.False then raise Lock_Error; end if; end Release_Lock; end System.Global_Locks;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.BOUNDED_DOUBLY_LINKED_LISTS -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Iterator_Interfaces; with Ada.Containers.Helpers; private with Ada.Streams; private with Ada.Finalization; private with Ada.Strings.Text_Output; generic type Element_Type is private; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Bounded_Doubly_Linked_Lists with SPARK_Mode => Off is pragma Annotate (CodePeer, Skip_Analysis); pragma Pure; pragma Remote_Types; type List (Capacity : Count_Type) is tagged private with Constant_Indexing => Constant_Reference, Variable_Indexing => Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type, Aggregate => (Empty => Empty, Add_Unnamed => Append_One); pragma Preelaborable_Initialization (List); type Cursor is private; pragma Preelaborable_Initialization (Cursor); Empty_List : constant List; No_Element : constant Cursor; function Empty (Capacity : Count_Type := 10) return List; function Has_Element (Position : Cursor) return Boolean; package List_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : List) return Boolean; function Length (Container : List) return Count_Type; function Is_Empty (Container : List) return Boolean; procedure Clear (Container : in out List); function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out List; Position : Cursor; New_Item : Element_Type); procedure Query_Element (Position : Cursor; Process : not null access procedure (Element : Element_Type)); procedure Update_Element (Container : in out List; Position : Cursor; Process : not null access procedure (Element : in out Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased List; Position : Cursor) return Constant_Reference_Type; function Reference (Container : aliased in out List; Position : Cursor) return Reference_Type; procedure Assign (Target : in out List; Source : List); function Copy (Source : List; Capacity : Count_Type := 0) return List; procedure Move (Target : in out List; Source : in out List); procedure Insert (Container : in out List; Before : Cursor; New_Item : Element_Type; Count : Count_Type := 1); procedure Insert (Container : in out List; Before : Cursor; New_Item : Element_Type; Position : out Cursor; Count : Count_Type := 1); procedure Insert (Container : in out List; Before : Cursor; Position : out Cursor; Count : Count_Type := 1); procedure Prepend (Container : in out List; New_Item : Element_Type; Count : Count_Type := 1); procedure Append (Container : in out List; New_Item : Element_Type; Count : Count_Type := 1); procedure Append_One (Container : in out List; New_Item : Element_Type); procedure Delete (Container : in out List; Position : in out Cursor; Count : Count_Type := 1); procedure Delete_First (Container : in out List; Count : Count_Type := 1); procedure Delete_Last (Container : in out List; Count : Count_Type := 1); procedure Reverse_Elements (Container : in out List); function Iterate (Container : List) return List_Iterator_Interfaces.Reversible_Iterator'class; function Iterate (Container : List; Start : Cursor) return List_Iterator_Interfaces.Reversible_Iterator'class; procedure Swap (Container : in out List; I, J : Cursor); procedure Swap_Links (Container : in out List; I, J : Cursor); procedure Splice (Target : in out List; Before : Cursor; Source : in out List); procedure Splice (Target : in out List; Before : Cursor; Source : in out List; Position : in out Cursor); procedure Splice (Container : in out List; Before : Cursor; Position : Cursor); function First (Container : List) return Cursor; function First_Element (Container : List) return Element_Type; function Last (Container : List) return Cursor; function Last_Element (Container : List) return Element_Type; function Next (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); function Previous (Position : Cursor) return Cursor; procedure Previous (Position : in out Cursor); function Find (Container : List; Item : Element_Type; Position : Cursor := No_Element) return Cursor; function Reverse_Find (Container : List; Item : Element_Type; Position : Cursor := No_Element) return Cursor; function Contains (Container : List; Item : Element_Type) return Boolean; procedure Iterate (Container : List; Process : not null access procedure (Position : Cursor)); procedure Reverse_Iterate (Container : List; Process : not null access procedure (Position : Cursor)); generic with function "<" (Left, Right : Element_Type) return Boolean is <>; package Generic_Sorting is function Is_Sorted (Container : List) return Boolean; procedure Sort (Container : in out List); procedure Merge (Target, Source : in out List); end Generic_Sorting; private pragma Inline (Next); pragma Inline (Previous); use Ada.Containers.Helpers; package Implementation is new Generic_Implementation; use Implementation; use Ada.Streams; use Ada.Finalization; type Node_Type is record Prev : Count_Type'Base; Next : Count_Type; Element : aliased Element_Type; end record; type Node_Array is array (Count_Type range <>) of Node_Type; type List (Capacity : Count_Type) is tagged record Nodes : Node_Array (1 .. Capacity); Free : Count_Type'Base := -1; First : Count_Type := 0; Last : Count_Type := 0; Length : Count_Type := 0; TC : aliased Tamper_Counts; end record with Put_Image => Put_Image; procedure Put_Image (S : in out Ada.Strings.Text_Output.Sink'Class; V : List); procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out List); for List'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : List); for List'Write use Write; type List_Access is access all List; for List_Access'Storage_Size use 0; type Cursor is record Container : List_Access; Node : Count_Type := 0; end record; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Cursor); for Cursor'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Cursor); for Cursor'Write use Write; subtype Reference_Control_Type is Implementation.Reference_Control_Type; -- It is necessary to rename this here, so that the compiler can find it type Constant_Reference_Type (Element : not null access constant Element_Type) is record Control : Reference_Control_Type := raise Program_Error with "uninitialized reference"; -- The RM says, "The default initialization of an object of -- type Constant_Reference_Type or Reference_Type propagates -- Program_Error." end record; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Constant_Reference_Type); for Constant_Reference_Type'Read use Read; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Constant_Reference_Type); for Constant_Reference_Type'Write use Write; type Reference_Type (Element : not null access Element_Type) is record Control : Reference_Control_Type := raise Program_Error with "uninitialized reference"; -- The RM says, "The default initialization of an object of -- type Constant_Reference_Type or Reference_Type propagates -- Program_Error." end record; procedure Write (Stream : not null access Root_Stream_Type'Class; Item : Reference_Type); for Reference_Type'Write use Write; procedure Read (Stream : not null access Root_Stream_Type'Class; Item : out Reference_Type); for Reference_Type'Read use Read; -- Three operations are used to optimize in the expansion of "for ... of" -- loops: the Next(Cursor) procedure in the visible part, and the following -- Pseudo_Reference and Get_Element_Access functions. See Exp_Ch5 for -- details. function Pseudo_Reference (Container : aliased List'Class) return Reference_Control_Type; pragma Inline (Pseudo_Reference); -- Creates an object of type Reference_Control_Type pointing to the -- container, and increments the Lock. Finalization of this object will -- decrement the Lock. type Element_Access is access all Element_Type with Storage_Size => 0; function Get_Element_Access (Position : Cursor) return not null Element_Access; -- Returns a pointer to the element designated by Position. Empty_List : constant List := (Capacity => 0, others => <>); No_Element : constant Cursor := Cursor'(null, 0); type Iterator is new Limited_Controlled and List_Iterator_Interfaces.Reversible_Iterator with record Container : List_Access; Node : Count_Type; end record with Disable_Controlled => not T_Check; overriding procedure Finalize (Object : in out Iterator); overriding function First (Object : Iterator) return Cursor; overriding function Last (Object : Iterator) return Cursor; overriding function Next (Object : Iterator; Position : Cursor) return Cursor; overriding function Previous (Object : Iterator; Position : Cursor) return Cursor; end Ada.Containers.Bounded_Doubly_Linked_Lists;
------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . O S _ I N T E R F A C E -- -- -- -- S p e c -- -- -- -- Copyright (C) 1991-1994, Florida State University -- -- Copyright (C) 1995-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the GNU/Hurd (POSIX Threads) version of this package -- This package encapsulates all direct interfaces to OS services -- that are needed by children of System. -- PLEASE DO NOT add any with-clauses to this package or remove the pragma -- Preelaborate. This package is designed to be a bottom-level (leaf) package with Interfaces.C; with Unchecked_Conversion; package System.OS_Interface is pragma Preelaborate; pragma Linker_Options ("-lpthread"); pragma Linker_Options ("-lrt"); subtype int is Interfaces.C.int; subtype char is Interfaces.C.char; subtype short is Interfaces.C.short; subtype long is Interfaces.C.long; subtype unsigned is Interfaces.C.unsigned; subtype unsigned_short is Interfaces.C.unsigned_short; subtype unsigned_long is Interfaces.C.unsigned_long; subtype unsigned_char is Interfaces.C.unsigned_char; subtype plain_char is Interfaces.C.plain_char; subtype size_t is Interfaces.C.size_t; ----------- -- Errno -- ----------- -- From /usr/include/i386-gnu/bits/errno.h function errno return int; pragma Import (C, errno, "__get_errno"); EAGAIN : constant := 1073741859; EINTR : constant := 1073741828; EINVAL : constant := 1073741846; ENOMEM : constant := 1073741836; EPERM : constant := 1073741825; ETIMEDOUT : constant := 1073741884; ------------- -- Signals -- ------------- -- From /usr/include/i386-gnu/bits/signum.h Max_Interrupt : constant := 32; type Signal is new int range 0 .. Max_Interrupt; for Signal'Size use int'Size; SIGHUP : constant := 1; -- hangup SIGINT : constant := 2; -- interrupt (rubout) SIGQUIT : constant := 3; -- quit (ASCD FS) SIGILL : constant := 4; -- illegal instruction (not reset) SIGTRAP : constant := 5; -- trace trap (not reset) SIGIOT : constant := 6; -- IOT instruction SIGABRT : constant := 6; -- used by abort, replace SIGIOT in the future SIGEMT : constant := 7; -- EMT instruction SIGFPE : constant := 8; -- floating point exception SIGKILL : constant := 9; -- kill (cannot be caught or ignored) SIGBUS : constant := 10; -- bus error SIGSEGV : constant := 11; -- segmentation violation SIGSYS : constant := 12; -- bad argument to system call SIGPIPE : constant := 13; -- write on a pipe with no one to read it SIGALRM : constant := 14; -- alarm clock SIGTERM : constant := 15; -- software termination signal from kill SIGURG : constant := 16; -- urgent condition on IO channel SIGSTOP : constant := 17; -- stop (cannot be caught or ignored) SIGTSTP : constant := 18; -- user stop requested from tty SIGCONT : constant := 19; -- stopped process has been continued SIGCLD : constant := 20; -- alias for SIGCHLD SIGCHLD : constant := 20; -- child status change SIGTTIN : constant := 21; -- background tty read attempted SIGTTOU : constant := 22; -- background tty write attempted SIGIO : constant := 23; -- I/O possible (Solaris SIGPOLL alias) SIGPOLL : constant := 23; -- I/O possible (same as SIGIO?) SIGXCPU : constant := 24; -- CPU time limit exceeded SIGXFSZ : constant := 25; -- filesize limit exceeded SIGVTALRM : constant := 26; -- virtual timer expired SIGPROF : constant := 27; -- profiling timer expired SIGWINCH : constant := 28; -- window size change SIGINFO : constant := 29; -- information request (NetBSD/FreeBSD) SIGUSR1 : constant := 30; -- user defined signal 1 SIGUSR2 : constant := 31; -- user defined signal 2 SIGLOST : constant := 32; -- Resource lost (Sun); server died (GNU) SIGADAABORT : constant := SIGABRT; -- Change this if you want to use another signal for task abort. -- SIGTERM might be a good one. type Signal_Set is array (Natural range <>) of Signal; Unmasked : constant Signal_Set := ( SIGTRAP, -- To enable debugging on multithreaded applications, mark SIGTRAP to -- be kept unmasked. SIGBUS, SIGTTIN, SIGTTOU, SIGTSTP, -- Keep these three signals unmasked so that background processes -- and IO behaves as normal "C" applications SIGPROF, -- To avoid confusing the profiler SIGKILL, SIGSTOP); -- These two signals actually cannot be masked; -- POSIX simply won't allow it. Reserved : constant Signal_Set := -- I am not sure why the following signal is reserved. -- I guess they are not supported by this version of GNU/Hurd. (0 .. 0 => SIGVTALRM); type sigset_t is private; -- From /usr/include/signal.h /usr/include/i386-gnu/bits/sigset.h function sigaddset (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigaddset, "sigaddset"); function sigdelset (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigdelset, "sigdelset"); function sigfillset (set : access sigset_t) return int; pragma Import (C, sigfillset, "sigfillset"); function sigismember (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigismember, "sigismember"); function sigemptyset (set : access sigset_t) return int; pragma Import (C, sigemptyset, "sigemptyset"); -- sigcontext is architecture dependent, so define it private type struct_sigcontext is private; -- From /usr/include/i386-gnu/bits/sigaction.h: Note: arg. order differs type struct_sigaction is record sa_handler : System.Address; sa_mask : sigset_t; sa_flags : int; end record; pragma Convention (C, struct_sigaction); type struct_sigaction_ptr is access all struct_sigaction; -- From /usr/include/i386-gnu/bits/sigaction.h SIG_BLOCK : constant := 1; SIG_UNBLOCK : constant := 2; SIG_SETMASK : constant := 3; -- From /usr/include/i386-gnu/bits/signum.h SIG_ERR : constant := 1; SIG_DFL : constant := 0; SIG_IGN : constant := 1; SIG_HOLD : constant := 2; -- From /usr/include/i386-gnu/bits/sigaction.h SA_SIGINFO : constant := 16#0040#; SA_ONSTACK : constant := 16#0001#; function sigaction (sig : Signal; act : struct_sigaction_ptr; oact : struct_sigaction_ptr) return int; pragma Import (C, sigaction, "sigaction"); ---------- -- Time -- ---------- Time_Slice_Supported : constant Boolean := True; -- Indicates whether time slicing is supported (i.e SCHED_RR is supported) type timespec is private; function nanosleep (rqtp, rmtp : access timespec) return int; pragma Import (C, nanosleep, "nanosleep"); type clockid_t is new int; CLOCK_REALTIME : constant clockid_t := 0; -- From: /usr/include/time.h function clock_gettime (clock_id : clockid_t; tp : access timespec) return int; pragma Import (C, clock_gettime, "clock_gettime"); function clock_getres (clock_id : clockid_t; res : access timespec) return int; pragma Import (C, clock_getres, "clock_getres"); function To_Duration (TS : timespec) return Duration; pragma Inline (To_Duration); function To_Timespec (D : Duration) return timespec; pragma Inline (To_Timespec); -- From: /usr/include/unistd.h function sysconf (name : int) return long; pragma Import (C, sysconf); -- From /usr/include/i386-gnu/bits/confname.h SC_CLK_TCK : constant := 2; SC_NPROCESSORS_ONLN : constant := 84; ------------------------- -- Priority Scheduling -- ------------------------- -- From /usr/include/i386-gnu/bits/sched.h SCHED_OTHER : constant := 0; SCHED_FIFO : constant := 1; SCHED_RR : constant := 2; function To_Target_Priority (Prio : System.Any_Priority) return Interfaces.C.int; -- Maps System.Any_Priority to a POSIX priority. ------------- -- Process -- ------------- type pid_t is private; -- From: /usr/include/signal.h function kill (pid : pid_t; sig : Signal) return int; pragma Import (C, kill, "kill"); -- From: /usr/include/unistd.h function getpid return pid_t; pragma Import (C, getpid, "getpid"); --------- -- LWP -- --------- -- From: /usr/include/pthread/pthread.h function lwp_self return System.Address; -- lwp_self does not exist on this thread library, revert to pthread_self -- which is the closest approximation (with getpid). This function is -- needed to share 7staprop.adb across POSIX-like targets. pragma Import (C, lwp_self, "pthread_self"); ------------- -- Threads -- ------------- type Thread_Body is access function (arg : System.Address) return System.Address; pragma Convention (C, Thread_Body); function Thread_Body_Access is new Unchecked_Conversion (System.Address, Thread_Body); -- From: /usr/include/bits/pthread.h:typedef int __pthread_t; -- /usr/include/pthread/pthreadtypes.h:typedef __pthread_t pthread_t; type pthread_t is new unsigned_long; subtype Thread_Id is pthread_t; function To_pthread_t is new Unchecked_Conversion (unsigned_long, pthread_t); type pthread_mutex_t is limited private; type pthread_rwlock_t is limited private; type pthread_cond_t is limited private; type pthread_attr_t is limited private; type pthread_mutexattr_t is limited private; type pthread_rwlockattr_t is limited private; type pthread_condattr_t is limited private; type pthread_key_t is private; -- From /usr/include/pthread/pthreadtypes.h PTHREAD_CREATE_DETACHED : constant := 1; PTHREAD_CREATE_JOINABLE : constant := 0; PTHREAD_SCOPE_PROCESS : constant := 1; PTHREAD_SCOPE_SYSTEM : constant := 0; ----------- -- Stack -- ----------- -- From: /usr/include/i386-gnu/bits/sigstack.h type stack_t is record ss_sp : System.Address; ss_size : size_t; ss_flags : int; end record; pragma Convention (C, stack_t); function sigaltstack (ss : not null access stack_t; oss : access stack_t) return int; pragma Import (C, sigaltstack, "sigaltstack"); Alternate_Stack : aliased System.Address; -- This is a dummy definition, never used (Alternate_Stack_Size is null) Alternate_Stack_Size : constant := 0; -- No alternate signal stack is used on this platform Stack_Base_Available : constant Boolean := False; -- Indicates whether the stack base is available on this target function Get_Stack_Base (thread : pthread_t) return Address; pragma Inline (Get_Stack_Base); -- returns the stack base of the specified thread. Only call this function -- when Stack_Base_Available is True. -- From: /usr/include/i386-gnu/bits/shm.h function Get_Page_Size return int; pragma Import (C, Get_Page_Size, "getpagesize"); -- Returns the size of a page -- From /usr/include/i386-gnu/bits/mman.h PROT_NONE : constant := 0; PROT_READ : constant := 4; PROT_WRITE : constant := 2; PROT_EXEC : constant := 1; PROT_ALL : constant := PROT_READ + PROT_WRITE + PROT_EXEC; PROT_ON : constant := PROT_NONE; PROT_OFF : constant := PROT_ALL; -- From /usr/include/i386-gnu/bits/mman.h function mprotect (addr : Address; len : size_t; prot : int) return int; pragma Import (C, mprotect); --------------------------------------- -- Nonstandard Thread Initialization -- --------------------------------------- procedure pthread_init; pragma Inline (pthread_init); -- This is a dummy procedure to share some GNULLI files ------------------------- -- POSIX.1c Section 3 -- ------------------------- -- From: /usr/include/signal.h: -- sigwait (__const sigset_t *__restrict __set, int *__restrict __sig) function sigwait (set : access sigset_t; sig : access Signal) return int; pragma Import (C, sigwait, "sigwait"); -- From: /usr/include/pthread/pthread.h: -- extern int pthread_kill (pthread_t thread, int signo); function pthread_kill (thread : pthread_t; sig : Signal) return int; pragma Import (C, pthread_kill, "pthread_kill"); -- From: /usr/include/i386-gnu/bits/sigthread.h -- extern int pthread_sigmask (int __how, __const __sigset_t *__newmask, -- __sigset_t *__oldmask) __THROW; function pthread_sigmask (how : int; set : access sigset_t; oset : access sigset_t) return int; pragma Import (C, pthread_sigmask, "pthread_sigmask"); -------------------------- -- POSIX.1c Section 11 -- -------------------------- -- From: /usr/include/pthread/pthread.h and -- /usr/include/pthread/pthreadtypes.h function pthread_mutexattr_init (attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutexattr_init, "pthread_mutexattr_init"); function pthread_mutexattr_destroy (attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutexattr_destroy, "pthread_mutexattr_destroy"); function pthread_mutex_init (mutex : access pthread_mutex_t; attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutex_init, "pthread_mutex_init"); function pthread_mutex_destroy (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_destroy, "pthread_mutex_destroy"); function pthread_mutex_lock (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_lock, "pthread_mutex_lock"); function pthread_mutex_unlock (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_unlock, "pthread_mutex_unlock"); function pthread_rwlockattr_init (attr : access pthread_rwlockattr_t) return int; pragma Import (C, pthread_rwlockattr_init, "pthread_rwlockattr_init"); function pthread_rwlockattr_destroy (attr : access pthread_rwlockattr_t) return int; pragma Import (C, pthread_rwlockattr_destroy, "pthread_rwlockattr_destroy"); PTHREAD_RWLOCK_PREFER_READER_NP : constant := 0; PTHREAD_RWLOCK_PREFER_WRITER_NP : constant := 1; PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP : constant := 2; function pthread_rwlockattr_setkind_np (attr : access pthread_rwlockattr_t; pref : int) return int; pragma Import (C, pthread_rwlockattr_setkind_np, "pthread_rwlockattr_setkind_np"); function pthread_rwlock_init (mutex : access pthread_rwlock_t; attr : access pthread_rwlockattr_t) return int; pragma Import (C, pthread_rwlock_init, "pthread_rwlock_init"); function pthread_rwlock_destroy (mutex : access pthread_rwlock_t) return int; pragma Import (C, pthread_rwlock_destroy, "pthread_rwlock_destroy"); function pthread_rwlock_rdlock (mutex : access pthread_rwlock_t) return int; pragma Import (C, pthread_rwlock_rdlock, "pthread_rwlock_rdlock"); function pthread_rwlock_wrlock (mutex : access pthread_rwlock_t) return int; pragma Import (C, pthread_rwlock_wrlock, "pthread_rwlock_wrlock"); function pthread_rwlock_unlock (mutex : access pthread_rwlock_t) return int; pragma Import (C, pthread_rwlock_unlock, "pthread_rwlock_unlock"); function pthread_condattr_init (attr : access pthread_condattr_t) return int; pragma Import (C, pthread_condattr_init, "pthread_condattr_init"); function pthread_condattr_destroy (attr : access pthread_condattr_t) return int; pragma Import (C, pthread_condattr_destroy, "pthread_condattr_destroy"); function pthread_cond_init (cond : access pthread_cond_t; attr : access pthread_condattr_t) return int; pragma Import (C, pthread_cond_init, "pthread_cond_init"); function pthread_cond_destroy (cond : access pthread_cond_t) return int; pragma Import (C, pthread_cond_destroy, "pthread_cond_destroy"); function pthread_cond_signal (cond : access pthread_cond_t) return int; pragma Import (C, pthread_cond_signal, "pthread_cond_signal"); function pthread_cond_wait (cond : access pthread_cond_t; mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_cond_wait, "pthread_cond_wait"); function pthread_cond_timedwait (cond : access pthread_cond_t; mutex : access pthread_mutex_t; abstime : access timespec) return int; pragma Import (C, pthread_cond_timedwait, "pthread_cond_timedwait"); Relative_Timed_Wait : constant Boolean := False; -- pthread_cond_timedwait requires an absolute delay time -------------------------- -- POSIX.1c Section 13 -- -------------------------- -- From /usr/include/pthread/pthreadtypes.h PTHREAD_PRIO_NONE : constant := 0; PTHREAD_PRIO_PROTECT : constant := 2; PTHREAD_PRIO_INHERIT : constant := 1; -- GNU/Hurd does not support Thread Priority Protection or Thread -- Priority Inheritance and lacks some pthread_mutexattr_* functions. -- Replace them with dummy versions. -- From: /usr/include/pthread/pthread.h function pthread_mutexattr_setprotocol (attr : access pthread_mutexattr_t; protocol : int) return int; pragma Import (C, pthread_mutexattr_setprotocol, "pthread_mutexattr_setprotocol"); function pthread_mutexattr_getprotocol (attr : access pthread_mutexattr_t; protocol : access int) return int; pragma Import (C, pthread_mutexattr_getprotocol, "pthread_mutexattr_getprotocol"); function pthread_mutexattr_setprioceiling (attr : access pthread_mutexattr_t; prioceiling : int) return int; function pthread_mutexattr_getprioceiling (attr : access pthread_mutexattr_t; prioceiling : access int) return int; type struct_sched_param is record sched_priority : int; -- scheduling priority end record; pragma Convention (C, struct_sched_param); function pthread_setschedparam (thread : pthread_t; policy : int; param : access struct_sched_param) return int; function pthread_attr_setscope (attr : access pthread_attr_t; contentionscope : int) return int; pragma Import (C, pthread_attr_setscope, "pthread_attr_setscope"); function pthread_attr_getscope (attr : access pthread_attr_t; contentionscope : access int) return int; pragma Import (C, pthread_attr_getscope, "pthread_attr_getscope"); function pthread_attr_setinheritsched (attr : access pthread_attr_t; inheritsched : int) return int; pragma Import (C, pthread_attr_setinheritsched, "pthread_attr_setinheritsched"); function pthread_attr_getinheritsched (attr : access pthread_attr_t; inheritsched : access int) return int; pragma Import (C, pthread_attr_getinheritsched, "pthread_attr_getinheritsched"); function pthread_attr_setschedpolicy (attr : access pthread_attr_t; policy : int) return int; pragma Import (C, pthread_attr_setschedpolicy, "pthread_setschedpolicy"); function sched_yield return int; pragma Import (C, sched_yield, "sched_yield"); --------------------------- -- P1003.1c - Section 16 -- --------------------------- function pthread_attr_init (attributes : access pthread_attr_t) return int; pragma Import (C, pthread_attr_init, "pthread_attr_init"); function pthread_attr_destroy (attributes : access pthread_attr_t) return int; pragma Import (C, pthread_attr_destroy, "pthread_attr_destroy"); function pthread_attr_setdetachstate (attr : access pthread_attr_t; detachstate : int) return int; pragma Import (C, pthread_attr_setdetachstate, "pthread_attr_setdetachstate"); function pthread_attr_setstacksize (attr : access pthread_attr_t; stacksize : size_t) return int; pragma Import (C, pthread_attr_setstacksize, "pthread_attr_setstacksize"); -- From: /usr/include/pthread/pthread.h function pthread_create (thread : access pthread_t; attributes : access pthread_attr_t; start_routine : Thread_Body; arg : System.Address) return int; pragma Import (C, pthread_create, "pthread_create"); procedure pthread_exit (status : System.Address); pragma Import (C, pthread_exit, "pthread_exit"); function pthread_self return pthread_t; pragma Import (C, pthread_self, "pthread_self"); -------------------------- -- POSIX.1c Section 17 -- -------------------------- function pthread_setspecific (key : pthread_key_t; value : System.Address) return int; pragma Import (C, pthread_setspecific, "pthread_setspecific"); function pthread_getspecific (key : pthread_key_t) return System.Address; pragma Import (C, pthread_getspecific, "pthread_getspecific"); type destructor_pointer is access procedure (arg : System.Address); pragma Convention (C, destructor_pointer); function pthread_key_create (key : access pthread_key_t; destructor : destructor_pointer) return int; pragma Import (C, pthread_key_create, "pthread_key_create"); -- From /usr/include/i386-gnu/bits/sched.h CPU_SETSIZE : constant := 1_024; type bit_field is array (1 .. CPU_SETSIZE) of Boolean; for bit_field'Size use CPU_SETSIZE; pragma Pack (bit_field); pragma Convention (C, bit_field); type cpu_set_t is record bits : bit_field; end record; pragma Convention (C, cpu_set_t); private type sigset_t is array (1 .. 4) of unsigned; -- In GNU/Hurd the component sa_handler turns out to -- be one a union type, and the selector is a macro: -- #define sa_handler __sigaction_handler.sa_handler -- #define sa_sigaction __sigaction_handler.sa_sigaction -- Should we add a signal_context type here ? -- How could it be done independent of the CPU architecture ? -- sigcontext type is opaque, so it is architecturally neutral. -- It is always passed as an access type, so define it as an empty record -- since the contents are not used anywhere. type struct_sigcontext is null record; pragma Convention (C, struct_sigcontext); type pid_t is new int; type time_t is new long; type timespec is record tv_sec : time_t; tv_nsec : long; end record; pragma Convention (C, timespec); -- From: /usr/include/pthread/pthreadtypes.h: -- typedef struct __pthread_attr pthread_attr_t; -- /usr/include/i386-gnu/bits/thread-attr.h: struct __pthread_attr... -- /usr/include/pthread/pthreadtypes.h: enum __pthread_contentionscope -- enum __pthread_detachstate detachstate; -- enum __pthread_inheritsched inheritsched; -- enum __pthread_contentionscope contentionscope; -- Not used: schedpolicy : int; type pthread_attr_t is record schedparam : struct_sched_param; stackaddr : System.Address; stacksize : size_t; guardsize : size_t; detachstate : int; inheritsched : int; contentionscope : int; schedpolicy : int; end record; pragma Convention (C, pthread_attr_t); -- From: /usr/include/pthread/pthreadtypes.h: -- typedef struct __pthread_condattr pthread_condattr_t; -- From: /usr/include/i386-gnu/bits/condition-attr.h: -- struct __pthread_condattr { -- enum __pthread_process_shared pshared; -- __Clockid_T Clock;} -- From: /usr/include/pthread/pthreadtypes.h: -- enum __pthread_process_shared type pthread_condattr_t is record pshared : int; clock : clockid_t; end record; pragma Convention (C, pthread_condattr_t); -- From: /usr/include/pthread/pthreadtypes.h: -- typedef struct __pthread_mutexattr pthread_mutexattr_t; and -- /usr/include/i386-gnu/bits/mutex-attr.h -- struct __pthread_mutexattr { -- int prioceiling; -- enum __pthread_mutex_protocol protocol; -- enum __pthread_process_shared pshared; -- enum __pthread_mutex_type mutex_type;}; type pthread_mutexattr_t is record prioceiling : int; protocol : int; pshared : int; mutex_type : int; end record; pragma Convention (C, pthread_mutexattr_t); -- From: /usr/include/pthread/pthreadtypes.h -- typedef struct __pthread_mutex pthread_mutex_t; and -- /usr/include/i386-gnu/bits/mutex.h: -- struct __pthread_mutex { -- __pthread_spinlock_t __held; -- __pthread_spinlock_t __lock; -- /* in cthreads, mutex_init does not initialized the third -- pointer, as such, we cannot rely on its value for anything. */ -- char *cthreadscompat1; -- struct __pthread *__queue; -- struct __pthread_mutexattr *attr; -- void *data; -- /* up to this point, we are completely compatible with cthreads -- and what libc expects. */ -- void *owner; -- unsigned locks; -- /* if null then the default attributes apply. */ -- }; type pthread_mutex_t is record held : int; lock : int; cthreadcompat : System.Address; queue : System.Address; attr : System.Address; data : System.Address; owner : System.Address; locks : unsigned; end record; pragma Convention (C, pthread_mutex_t); -- pointer needed? -- type pthread_mutex_t_ptr is access pthread_mutex_t; -- From: /usr/include/pthread/pthreadtypes.h: -- typedef struct __pthread_cond pthread_cond_t; -- typedef struct __pthread_condattr pthread_condattr_t; -- /usr/include/i386-gnu/bits/condition.h:struct __pthread_cond{} -- pthread_condattr_t: see above! -- /usr/include/i386-gnu/bits/condition.h: -- struct __pthread_condimpl *__impl; type pthread_cond_t is record lock : int; queue : System.Address; condattr : System.Address; impl : System.Address; data : System.Address; end record; pragma Convention (C, pthread_cond_t); -- From: /usr/include/pthread/pthreadtypes.h: -- typedef __pthread_key pthread_key_t; and -- /usr/include/i386-gnu/bits/thread-specific.h: -- typedef int __pthread_key; type pthread_key_t is new int; -- From: /usr/include/i386-gnu/bits/rwlock-attr.h: -- struct __pthread_rwlockattr { -- enum __pthread_process_shared pshared; }; type pthread_rwlockattr_t is record pshared : int; end record; pragma Convention (C, pthread_rwlockattr_t); -- From: /usr/include/i386-gnu/bits/rwlock.h: -- struct __pthread_rwlock { -- __pthread_spinlock_t __held; -- __pthread_spinlock_t __lock; -- int readers; -- struct __pthread *readerqueue; -- struct __pthread *writerqueue; -- struct __pthread_rwlockattr *__attr; -- void *__data; }; type pthread_rwlock_t is record held : int; lock : int; readers : int; readerqueue : System.Address; writerqueue : System.Address; attr : pthread_rwlockattr_t; data : int; end record; pragma Convention (C, pthread_rwlock_t); end System.OS_Interface;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . N U M E R I C S . F L O A T _ R A N D O M -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Note: the implementation used in this package is a version of the -- Mersenne Twister. See s-rannum.adb for details and references. with System.Random_Numbers; package Ada.Numerics.Float_Random with SPARK_Mode => Off is -- Basic facilities type Generator is limited private; subtype Uniformly_Distributed is Float range 0.0 .. 1.0; function Random (Gen : Generator) return Uniformly_Distributed; procedure Reset (Gen : Generator); procedure Reset (Gen : Generator; Initiator : Integer); -- Advanced facilities type State is private; procedure Save (Gen : Generator; To_State : out State); procedure Reset (Gen : Generator; From_State : State); Max_Image_Width : constant := System.Random_Numbers.Max_Image_Width; function Image (Of_State : State) return String; function Value (Coded_State : String) return State; private type Generator is new System.Random_Numbers.Generator; type State is new System.Random_Numbers.State; end Ada.Numerics.Float_Random;
with Ada.Numerics.Discrete_Random; package body Noise is type Color is (Black, White); package Color_Random is new Ada.Numerics.Discrete_Random (Color); Color_Gen : Color_Random.Generator; function Create_Image (Width, Height : Natural) return Lumen.Image.Descriptor is Result : Lumen.Image.Descriptor; begin Color_Random.Reset (Color_Gen); Result.Width := Width; Result.Height := Height; Result.Complete := True; Result.Values := new Lumen.Image.Pixel_Matrix (1 .. Width, 1 .. Height); for X in 1 .. Width loop for Y in 1 .. Height loop if Color_Random.Random (Color_Gen) = Black then Result.Values (X, Y) := (R => 0, G => 0, B => 0, A => 0); else Result.Values (X, Y) := (R => 255, G => 255, B => 255, A => 0); end if; end loop; end loop; return Result; end Create_Image; end Noise;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- A U N I T . T E S T _ F I X T U R E S -- -- -- -- S p e c -- -- -- -- -- -- Copyright (C) 2008-2011, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT is maintained by AdaCore (http://www.adacore.com) -- -- -- ------------------------------------------------------------------------------ -- <description> -- A Test_Fixture is used to provide a common environment for a set of test -- cases. -- -- To define a test case from a test fixture, see AUnit.Test_Caller. -- -- Each test runs in its own fixture so there can be no side effects among -- test runs. -- -- Here is an example: -- -- <code> -- package Math_Test is -- Type Test is new AUnit.Test_Fixtures.Test_Fixture with record -- M_Value1 : Integer; -- M_Value2 : Integer; -- end record; -- -- procedure Set_Up (T : in out Test); -- -- procedure Test_Addition (T : in out Test); -- -- end Math_Test; -- -- package body Math_Test is -- -- procedure Set_Up (T : in out Test) is -- begin -- T.M_Value1 := 2; -- T.M_Value2 := 3; -- end Set_Up; -- -- procedure Test_Addition (T : in out Test) is -- begin -- Assert (T.M_Value1 + T.M_Value2 = 5, -- "Incorrect addition for integers"); -- end Test_Addition; -- -- end Math_Test; -- </code> -- </description> with AUnit.Assertions; package AUnit.Test_Fixtures is type Test_Fixture is new AUnit.Assertions.Test with private; procedure Set_Up (Test : in out Test_Fixture); -- Set up performed before each test case procedure Tear_Down (Test : in out Test_Fixture); -- Tear down performed after each test case private type Test_Fixture is new AUnit.Assertions.Test with null record; end AUnit.Test_Fixtures;
with STM32_SVD.SPI; generic SPI : in out STM32_SVD.SPI.SPI_Peripheral; Data_Size : STM32GD.SPI.SPI_Data_Size := Data_Size_8b; package STM32GD.SPI.Peripheral is pragma Preelaborate; procedure Init; procedure Transfer (Data : in out SPI_Data_8b) with Pre => Data_Size = Data_Size_8b; end STM32GD.SPI.Peripheral;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Internals.Tables.UML_Attributes; with AMF.UML.Generalizations.Collections; package body AMF.Internals.UML_Classifiers is ----------------- -- All_Parents -- ----------------- overriding function All_Parents (Self : not null access constant UML_Classifier_Proxy) return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is -- [UML241] 7.3.8 Classifier -- -- [3] The query allParents() gives all of the direct and indirect -- ancestors of a generalized Classifier. -- -- Classifier::allParents(): Set(Classifier); -- -- allParents = -- self.parents()->union(self.parents()->collect(p | p.allParents())) P : constant AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier := Self.Parents; begin return Result : AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier := P do for J in 1 .. P.Length loop Result.Union (P.Element (J).All_Parents); end loop; end return; end All_Parents; ------------- -- Parents -- ------------- overriding function Parents (Self : not null access constant UML_Classifier_Proxy) return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is -- [UML241] 7.3.8 Classifier -- -- [2] The query parents() gives all of the immediate ancestors of a -- generalized Classifier. -- -- Classifier::parents(): Set(Classifier); -- -- parents = generalization.general begin return Result : AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier do declare G : constant AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization := UML_Classifier_Proxy'Class (Self.all).Get_Generalization; X : AMF.UML.Classifiers.UML_Classifier_Access; -- GNAT FSF 4.6: X is used to workaround crash of compiler. begin for J in 1 .. G.Length loop X := G.Element (J).Get_General; Result.Add (X); end loop; end; end return; end Parents; --------------------- -- Set_Is_Abstract -- --------------------- overriding procedure Set_Is_Abstract (Self : not null access UML_Classifier_Proxy; To : Boolean) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Abstract (Self.Element, To); end Set_Is_Abstract; end AMF.Internals.UML_Classifiers;
with Ada.Text_Io; use Ada.Text_Io; with Ada.Strings.Fixed; With Ada.Strings.Unbounded; procedure Number_Base_Conversion is Max_Base : constant := 36; subtype Base_Type is Integer range 2..Max_Base; Num_Digits : constant String := "0123456789abcdefghijklmnopqrstuvwxyz"; Invalid_Digit : exception; function To_Decimal(Value : String; Base : Base_Type) return Integer is use Ada.Strings.Fixed; Result : Integer := 0; Decimal_Value : Integer; Radix_Offset : Natural := 0; begin for I in reverse Value'range loop Decimal_Value := Index(Num_Digits, Value(I..I)) - 1; if Decimal_Value < 0 then raise Invalid_Digit; end if; Result := Result + (Base**Radix_Offset * Decimal_Value); Radix_Offset := Radix_Offset + 1; end loop; return Result; end To_Decimal; function To_Base(Value : Natural; Base : Base_Type) return String is use Ada.Strings.Unbounded; Result : Unbounded_String := Null_Unbounded_String; Temp : Natural := Value; Base_Digit : String(1..1); begin if Temp = 0 then return "0"; end if; while Temp > 0 loop Base_Digit(1) := Num_Digits((Temp mod Base) + 1); if Result = Null_Unbounded_String then Append(Result, Base_Digit); else Insert(Source => Result, Before => 1, New_Item => Base_Digit); end if; Temp := Temp / Base; end loop; return To_String(Result); end To_Base; begin Put_Line("26 converted to base 16 is " & To_Base(26, 16)); Put_line("1a (base 16) is decimal" & Integer'image(To_Decimal("1a", 16))); end Number_Base_Conversion;
------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ L L U -- -- -- -- S p e c -- -- -- -- $Revision: 2 $ -- -- -- -- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved -- -- -- -- The GNAT library is free software; you can redistribute it and/or modify -- -- it under terms of the GNU Library General Public License as published by -- -- the Free Software Foundation; either version 2, or (at your option) any -- -- later version. The GNAT library is distributed in the hope that it will -- -- be useful, but WITHOUT ANY WARRANTY; without even the implied warranty -- -- of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- -- Library General Public License for more details. You should have -- -- received a copy of the GNU Library General Public License along with -- -- the GNAT library; see the file COPYING.LIB. If not, write to the Free -- -- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routines for supporting the Image attribute for -- unsigned (modular) integer types larger than Size Unsigned'Size, and also -- for conversion operations required in Text_IO.Modular_IO for such types. with System.Unsigned_Types; package System.Img_LLU is pragma Preelaborate (Img_LLU); function Image_Long_Long_Unsigned (V : System.Unsigned_Types.Long_Long_Unsigned; S : access String) return Natural; -- Computes Long_Long_Unsigned'Image (V), storing the result in S (1 .. N) -- where N is the length of the image string. The value of N is returned as -- the result. The caller guarantees that the string is long enough. procedure Set_Image_Long_Long_Unsigned (V : System.Unsigned_Types.Long_Long_Unsigned; S : out String; P : in out Natural); -- Sets the image of V starting at S (P + 1) with no leading spaces (i.e. -- Text_IO format where Width = 0), starting at S (P + 1), updating P -- to point to the last character stored. The caller promises that the -- buffer is large enough and no check is made for this (Constraint_Error -- will not be necessarily raised if this is violated since it is perfectly -- valid to compile this unit with checks off). end System.Img_LLU;
------------------------------------------------------------------------------ -- -- -- Modular Hash Infrastructure -- -- -- -- SHA1 -- -- -- -- - "Reference" Implementation - -- -- -- -- ------------------------------------------------------------------------ -- -- -- -- Copyright (C) 2018-2021, ANNEXI-STRAYLINE Trans-Human Ltd. -- -- All rights reserved. -- -- -- -- Original Contributors: -- -- * Ensi Martini (ANNEXI-STRAYLINE) -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- -- -- * Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A -- -- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ package body Modular_Hashing.SHA1 is pragma Assert (Stream_Element'Size = 8); -- This implementation makes the assumption that a Stream_Element is 8 bits -- wide. This is a safe assumption in most common applications. Making this -- assumption greatly simplifies this reference implementation. -- -- Internal Subprograms -- ------------------ -- Digest_Chunk -- ------------------ -- This procedure is the internal digest that allows for a 512-bit block to -- be processed without finishing the hash (padding) -- -- This is the bulk of the SHA1 algorithm, missing only the addition of -- message size with padding, which is handed by the Digest subprogram procedure Digest_Chunk (Engine : in out SHA1_Engine) with Inline is A, B, C, D, E, F, K, Temp : Unsigned_32; Word_Sequence : array (1 .. 80) of Unsigned_32; begin -- Break the chunk into 16 32-bit words, assign to Word_Sequence for I in 1 .. 16 loop Word_Sequence(I) := Shift_Left(Value => Unsigned_32 (Engine.Buffer(Stream_Element_Offset((I * 4) - 3))), Amount => 24) + Shift_Left(Value => Unsigned_32 (Engine.Buffer(Stream_Element_Offset((I * 4) - 2))), Amount => 16) + Shift_Left(Value => Unsigned_32 (Engine.Buffer(Stream_Element_Offset((I * 4) - 1))), Amount => 8) + Unsigned_32(Engine.Buffer(Stream_Element_Offset(I * 4))); end loop; -- Create the values for the rest of Word_Sequence for I in 17 .. 80 loop Word_Sequence(I) := Rotate_Left (Value => Word_Sequence(I - 3) xor Word_Sequence(I - 8) xor Word_Sequence(I - 14) xor Word_Sequence(I - 16), Amount => 1); end loop; A := Engine.H0; B := Engine.H1; C := Engine.H2; D := Engine.H3; E := Engine.H4; declare procedure Operations(Index : Integer) with Inline is begin Temp := Rotate_Left (Value => A, Amount => 5) + F + E + K + Word_Sequence(Index); E := D; D := C; C := Rotate_Left (Value => B, Amount => 30); B := A; A := Temp; end; begin -- The following loops are split-up to avoid persistent if-else -- statements that is common in many reference implementations. -- Inlining the operations takes up more code-space, but that is rarely -- a concern in modern times... for I in 1 .. 20 loop F := (B and C) or ((not B) and D); K := 16#5A827999#; Operations (I); end loop; for I in 21 .. 40 loop F := B xor C xor D; K := 16#6ED9EBA1#; Operations (I); end loop; for I in 41 .. 60 loop F := (B and C) or (B and D) or (C and D); K := 16#8F1BBCDC#; Operations (I); end loop; for I in 61 .. 80 loop F := B xor C xor D; K := 16#CA62C1D6#; Operations (I); end loop; end; Engine.H0 := Engine.H0 + A; Engine.H1 := Engine.H1 + B; Engine.H2 := Engine.H2 + C; Engine.H3 := Engine.H3 + D; Engine.H4 := Engine.H4 + E; Engine.Last_Element_Index := 0; end Digest_Chunk; -- -- SHA1_Hash -- --------- -- "<" -- --------- function "<" (Left, Right: SHA1_Hash) return Boolean is begin -- Even though our numbers are split into arrays of Unsigned_32, -- comparison operators can work on each section individually, -- as the lower indices have more significance for I in Message_Digest'Range loop if Left.Digest(I) < Right.Digest(I) then return True; elsif Left.Digest(I) > Right.Digest(I) then return False; end if; end loop; -- The only way we get here is when Left = Right return False; end "<"; --------- -- ">" -- --------- function ">" (Left, Right: SHA1_Hash) return Boolean is begin -- Even though our numbers are split into arrays of Unsigned_32, -- comparison operators can work on each section individually, -- as the lower indices have more significance for I in Message_Digest'Range loop if Left.Digest(I) > Right.Digest(I) then return True; elsif Left.Digest(I) < Right.Digest(I) then return False; end if; end loop; -- The only way we get here is when Left = Right return False; end ">"; --------- -- "=" -- --------- function "=" (Left, Right: SHA1_Hash) return Boolean is begin for I in Message_Digest'Range loop if Left.Digest(I) /= Right.Digest(I) then return False; end if; end loop; return True; end "="; ------------ -- Binary -- ------------ function Binary (Value: SHA1_Hash) return Hash_Binary_Value is I: Positive; Register: Unsigned_32; begin return Output: Hash_Binary_Value (1 .. SHA1_Hash_Bytes) do I := Output'First; for Chunk of reverse Value.Digest loop -- Value.Digest big-endian Register := Chunk; for J in 1 .. 4 loop -- Four bytes per digest chunk Output(I) := Unsigned_8 (Register and 16#FF#); Register := Shift_Right (Register, 8); I := I + 1; end loop; end loop; end return; end Binary; -- -- SHA1_Engine -- ----------- -- Write -- ----------- overriding procedure Write (Stream : in out SHA1_Engine; Item : in Stream_Element_Array) is Last_In: Stream_Element_Offset; begin -- Check for a null range of Item and discard if Item'Length = 0 then return; end if; Last_In := Item'First - 1; -- Finally, we can go ahead and add the message length to the Engine now, -- since there are early-ending code-paths below, and so we can avoid -- duplicating code. The only way this can really go wrong is if the -- entire message is larger than the Message_Size, which SHA1 limits to a -- 64-bit signed integer. Therefore a message of 16 exabytes will cause -- an invalid hash, due to a wrap-around of the Message_Size. -- That's a risk we are willing to take. Stream.Message_Length := Stream.Message_Length + (Stream_Element'Size * Item'Length); -- Our buffer has a size of 512 (the size of a "chunk" of processing for -- the SHA-1 algorithm). -- Our write should be automated so that as soon as that buffer is full -- (no matter how much of the Item array is written already), the chunk is -- processed -- In order to take advantage of any processor vector copy features, we -- will explicitly copy Item in chunks that are either the full size of -- Item, 64 elements, or the remaining space in the hash Buffer, whichever -- is largest while Last_In < Item'Last loop declare subtype Buffer_Slice is Stream_Element_Offset range Stream.Last_Element_Index + 1 .. Stream.Buffer'Last; Buffer_Slice_Length: Stream_Element_Offset := Buffer_Slice'Last - Buffer_Slice'First + 1; subtype Item_Slice is Stream_Element_Offset range Last_In + 1 .. Item'Last; Item_Slice_Length: Stream_Element_Offset := Item_Slice'Last - Item_Slice'First + 1; begin if Buffer_Slice_Length > Item_Slice_Length then -- We can fit the rest in the buffer, with space left-over declare -- Set-up a specific slice in the Buffer which can accommodate -- the remaining elements of Item subtype Target_Slice is Stream_Element_Offset range Buffer_Slice'First .. Buffer_Slice'First + (Item_Slice'Last - Item_Slice'First); begin -- Here is the block copy Stream.Buffer(Target_Slice'Range):= Item (Item_Slice'Range); Stream.Last_Element_Index := Target_Slice'Last; end; -- That's it, we've absorbed the entire Item, no need to waste -- time updating Last_In. return; else -- This means the buffer space is either equal to or smaller than -- the remaining Item elements, this means we need process the -- chunk (digest the buffer) no matter what -- First step is to copy in as much of the remaining Item -- elements as possible declare subtype Source_Slice is Stream_Element_Offset range Item_Slice'First .. Item_Slice'First + Buffer_Slice_Length - 1; begin -- Block copy Stream.Buffer(Buffer_Slice'Range) := Item (Source_Slice'Range); Stream.Last_Element_Index := Buffer_Slice'Last; Last_In := Source_Slice'Last; end; -- Now we digest the currently full buffer Digest_Chunk (Stream); end if; end; end loop; end Write; ----------- -- Reset -- ----------- overriding procedure Reset (Engine : in out SHA1_Engine) is begin Engine.Last_Element_Index := 0; Engine.Message_Length := 0; Engine.H0 := H0_Initial; Engine.H1 := H1_Initial; Engine.H2 := H2_Initial; Engine.H3 := H3_Initial; Engine.H4 := H4_Initial; end Reset; ------------ -- Digest -- ------------ overriding function Digest (Engine : in out SHA1_Engine) return Hash'Class is -- The core of the message digest algorithm occurs in-line with stream -- writes through the Digest_Chunk procedure. The role of this function -- is to append the message size and padding, and then execute the final -- Digest_Chunk before returning the digest. -- We work with the data in the Buffer in chunks of 512 bits -- Once we get to the last section that is < 512 bits, we append -- the 64 bit length and padding 0's -- In most cases, this 64 bit + padding will all be in the last section -- of the buffer -- We pad up until the 448th bit (56th byte) and then add the length -- However, we must also keep in mind the fringe case where the data ends -- at bit position 448 or later (byte 56 or later) -- In that case, the approach to take is to pad the final chunk, then add -- a new one that is ONLY padding and the 64 bit length Message_Length_Spliced : Stream_Element_Array(1 .. 8); Special_Case_Index : Stream_Element_Offset := 0; begin -- Splitting the 64-bit message length into array of bytes for I in 1 .. 8 loop Message_Length_Spliced(Stream_Element_Offset(I)) := Stream_Element (Unsigned_8(Shift_Right(Value => Engine.Message_Length, Amount => 8 * (8 - I)) and 16#ff#)); end loop; -- This is a while loop but we use an exit condition to make sure that it -- executes at least once (for the case of empty hash message) loop if Special_Case_Index /= 0 then if Special_Case_Index = 1 then Engine.Buffer(1) := 2#10000000#; else Engine.Buffer(1) := 2#00000000#; end if; Engine.Buffer(2 .. 56) := (others => 2#00000000#); Engine.Buffer(57 .. 64) := Message_Length_Spliced; Special_Case_Index := 0; -- If there is less than 512 bits left in the Buffer else -- The case where one chunk will hold Buffer + padding + 64 bits if Engine.Last_Element_Index < 56 then -- Add the correct amount of padding Engine.Buffer(Engine.Last_Element_Index + 1) := 2#10000000#; Engine.Buffer(Engine.Last_Element_Index + 2 .. 56) := (others => 2#00000000#); -- Finish it off with Message_Length Engine.Buffer(57 .. 64) := Message_Length_Spliced; -- The case where one chunk will hold Buffer + padding, and -- another will hold padding + 64 bit message length else -- Put what we can of the padding in the current chunk Engine.Buffer(Engine.Last_Element_Index + 1) := 2#10000000#; Engine.Buffer(Engine.Last_Element_Index + 2 .. 64) := (others => 2#00000000#); -- Save where we left off in the padding for the next chunk Special_Case_Index := 65 - Engine.Last_Element_Index; end if; end if; Digest_Chunk (Engine); exit when Engine.Last_Element_Index = 0 and Special_Case_Index = 0; end loop; return Result: SHA1_Hash do Result.Digest := (1 => Engine.H0, 2 => Engine.H1, 3 => Engine.H2, 4 => Engine.H3, 5 => Engine.H4); Engine.Reset; end return; end Digest; end Modular_Hashing.SHA1;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_OPERATIONS -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ -- The references below to "CLR" refer to the following book, from which -- several of the algorithms here were adapted: -- Introduction to Algorithms -- by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest -- Publisher: The MIT Press (June 18, 1990) -- ISBN: 0262031418 with System; use type System.Address; package body Ada.Containers.Red_Black_Trees.Generic_Operations is pragma Warnings (Off, "variable ""Busy*"" is not referenced"); pragma Warnings (Off, "variable ""Lock*"" is not referenced"); -- See comment in Ada.Containers.Helpers ----------------------- -- Local Subprograms -- ----------------------- procedure Delete_Fixup (Tree : in out Tree_Type; Node : Node_Access); procedure Delete_Swap (Tree : in out Tree_Type; Z, Y : Node_Access); procedure Left_Rotate (Tree : in out Tree_Type; X : Node_Access); procedure Right_Rotate (Tree : in out Tree_Type; Y : Node_Access); -- Why is all the following code commented out ??? -- --------------------- -- -- Check_Invariant -- -- --------------------- -- procedure Check_Invariant (Tree : Tree_Type) is -- Root : constant Node_Access := Tree.Root; -- -- function Check (Node : Node_Access) return Natural; -- -- ----------- -- -- Check -- -- ----------- -- -- function Check (Node : Node_Access) return Natural is -- begin -- if Node = null then -- return 0; -- end if; -- -- if Color (Node) = Red then -- declare -- L : constant Node_Access := Left (Node); -- begin -- pragma Assert (L = null or else Color (L) = Black); -- null; -- end; -- -- declare -- R : constant Node_Access := Right (Node); -- begin -- pragma Assert (R = null or else Color (R) = Black); -- null; -- end; -- -- declare -- NL : constant Natural := Check (Left (Node)); -- NR : constant Natural := Check (Right (Node)); -- begin -- pragma Assert (NL = NR); -- return NL; -- end; -- end if; -- -- declare -- NL : constant Natural := Check (Left (Node)); -- NR : constant Natural := Check (Right (Node)); -- begin -- pragma Assert (NL = NR); -- return NL + 1; -- end; -- end Check; -- -- -- Start of processing for Check_Invariant -- -- begin -- if Root = null then -- pragma Assert (Tree.First = null); -- pragma Assert (Tree.Last = null); -- pragma Assert (Tree.Length = 0); -- null; -- -- else -- pragma Assert (Color (Root) = Black); -- pragma Assert (Tree.Length > 0); -- pragma Assert (Tree.Root /= null); -- pragma Assert (Tree.First /= null); -- pragma Assert (Tree.Last /= null); -- pragma Assert (Parent (Tree.Root) = null); -- pragma Assert ((Tree.Length > 1) -- or else (Tree.First = Tree.Last -- and Tree.First = Tree.Root)); -- pragma Assert (Left (Tree.First) = null); -- pragma Assert (Right (Tree.Last) = null); -- -- declare -- L : constant Node_Access := Left (Root); -- R : constant Node_Access := Right (Root); -- NL : constant Natural := Check (L); -- NR : constant Natural := Check (R); -- begin -- pragma Assert (NL = NR); -- null; -- end; -- end if; -- end Check_Invariant; ------------------ -- Delete_Fixup -- ------------------ procedure Delete_Fixup (Tree : in out Tree_Type; Node : Node_Access) is -- CLR p274 X : Node_Access := Node; W : Node_Access; begin while X /= Tree.Root and then Color (X) = Black loop if X = Left (Parent (X)) then W := Right (Parent (X)); if Color (W) = Red then Set_Color (W, Black); Set_Color (Parent (X), Red); Left_Rotate (Tree, Parent (X)); W := Right (Parent (X)); end if; if (Left (W) = null or else Color (Left (W)) = Black) and then (Right (W) = null or else Color (Right (W)) = Black) then Set_Color (W, Red); X := Parent (X); else if Right (W) = null or else Color (Right (W)) = Black then -- As a condition for setting the color of the left child to -- black, the left child access value must be non-null. A -- truth table analysis shows that if we arrive here, that -- condition holds, so there's no need for an explicit test. -- The assertion is here to document what we know is true. pragma Assert (Left (W) /= null); Set_Color (Left (W), Black); Set_Color (W, Red); Right_Rotate (Tree, W); W := Right (Parent (X)); end if; Set_Color (W, Color (Parent (X))); Set_Color (Parent (X), Black); Set_Color (Right (W), Black); Left_Rotate (Tree, Parent (X)); X := Tree.Root; end if; else pragma Assert (X = Right (Parent (X))); W := Left (Parent (X)); if Color (W) = Red then Set_Color (W, Black); Set_Color (Parent (X), Red); Right_Rotate (Tree, Parent (X)); W := Left (Parent (X)); end if; if (Left (W) = null or else Color (Left (W)) = Black) and then (Right (W) = null or else Color (Right (W)) = Black) then Set_Color (W, Red); X := Parent (X); else if Left (W) = null or else Color (Left (W)) = Black then -- As a condition for setting the color of the right child -- to black, the right child access value must be non-null. -- A truth table analysis shows that if we arrive here, that -- condition holds, so there's no need for an explicit test. -- The assertion is here to document what we know is true. pragma Assert (Right (W) /= null); Set_Color (Right (W), Black); Set_Color (W, Red); Left_Rotate (Tree, W); W := Left (Parent (X)); end if; Set_Color (W, Color (Parent (X))); Set_Color (Parent (X), Black); Set_Color (Left (W), Black); Right_Rotate (Tree, Parent (X)); X := Tree.Root; end if; end if; end loop; Set_Color (X, Black); end Delete_Fixup; --------------------------- -- Delete_Node_Sans_Free -- --------------------------- procedure Delete_Node_Sans_Free (Tree : in out Tree_Type; Node : Node_Access) is -- CLR p273 X, Y : Node_Access; Z : constant Node_Access := Node; pragma Assert (Z /= null); begin TC_Check (Tree.TC); -- Why are these all commented out ??? -- pragma Assert (Tree.Length > 0); -- pragma Assert (Tree.Root /= null); -- pragma Assert (Tree.First /= null); -- pragma Assert (Tree.Last /= null); -- pragma Assert (Parent (Tree.Root) = null); -- pragma Assert ((Tree.Length > 1) -- or else (Tree.First = Tree.Last -- and then Tree.First = Tree.Root)); -- pragma Assert ((Left (Node) = null) -- or else (Parent (Left (Node)) = Node)); -- pragma Assert ((Right (Node) = null) -- or else (Parent (Right (Node)) = Node)); -- pragma Assert (((Parent (Node) = null) and then (Tree.Root = Node)) -- or else ((Parent (Node) /= null) and then -- ((Left (Parent (Node)) = Node) -- or else (Right (Parent (Node)) = Node)))); if Left (Z) = null then if Right (Z) = null then if Z = Tree.First then Tree.First := Parent (Z); end if; if Z = Tree.Last then Tree.Last := Parent (Z); end if; if Color (Z) = Black then Delete_Fixup (Tree, Z); end if; pragma Assert (Left (Z) = null); pragma Assert (Right (Z) = null); if Z = Tree.Root then pragma Assert (Tree.Length = 1); pragma Assert (Parent (Z) = null); Tree.Root := null; elsif Z = Left (Parent (Z)) then Set_Left (Parent (Z), null); else pragma Assert (Z = Right (Parent (Z))); Set_Right (Parent (Z), null); end if; else pragma Assert (Z /= Tree.Last); X := Right (Z); if Z = Tree.First then Tree.First := Min (X); end if; if Z = Tree.Root then Tree.Root := X; elsif Z = Left (Parent (Z)) then Set_Left (Parent (Z), X); else pragma Assert (Z = Right (Parent (Z))); Set_Right (Parent (Z), X); end if; Set_Parent (X, Parent (Z)); if Color (Z) = Black then Delete_Fixup (Tree, X); end if; end if; elsif Right (Z) = null then pragma Assert (Z /= Tree.First); X := Left (Z); if Z = Tree.Last then Tree.Last := Max (X); end if; if Z = Tree.Root then Tree.Root := X; elsif Z = Left (Parent (Z)) then Set_Left (Parent (Z), X); else pragma Assert (Z = Right (Parent (Z))); Set_Right (Parent (Z), X); end if; Set_Parent (X, Parent (Z)); if Color (Z) = Black then Delete_Fixup (Tree, X); end if; else pragma Assert (Z /= Tree.First); pragma Assert (Z /= Tree.Last); Y := Next (Z); pragma Assert (Left (Y) = null); X := Right (Y); if X = null then if Y = Left (Parent (Y)) then pragma Assert (Parent (Y) /= Z); Delete_Swap (Tree, Z, Y); Set_Left (Parent (Z), Z); else pragma Assert (Y = Right (Parent (Y))); pragma Assert (Parent (Y) = Z); Set_Parent (Y, Parent (Z)); if Z = Tree.Root then Tree.Root := Y; elsif Z = Left (Parent (Z)) then Set_Left (Parent (Z), Y); else pragma Assert (Z = Right (Parent (Z))); Set_Right (Parent (Z), Y); end if; Set_Left (Y, Left (Z)); Set_Parent (Left (Y), Y); Set_Right (Y, Z); Set_Parent (Z, Y); Set_Left (Z, null); Set_Right (Z, null); declare Y_Color : constant Color_Type := Color (Y); begin Set_Color (Y, Color (Z)); Set_Color (Z, Y_Color); end; end if; if Color (Z) = Black then Delete_Fixup (Tree, Z); end if; pragma Assert (Left (Z) = null); pragma Assert (Right (Z) = null); if Z = Right (Parent (Z)) then Set_Right (Parent (Z), null); else pragma Assert (Z = Left (Parent (Z))); Set_Left (Parent (Z), null); end if; else if Y = Left (Parent (Y)) then pragma Assert (Parent (Y) /= Z); Delete_Swap (Tree, Z, Y); Set_Left (Parent (Z), X); Set_Parent (X, Parent (Z)); else pragma Assert (Y = Right (Parent (Y))); pragma Assert (Parent (Y) = Z); Set_Parent (Y, Parent (Z)); if Z = Tree.Root then Tree.Root := Y; elsif Z = Left (Parent (Z)) then Set_Left (Parent (Z), Y); else pragma Assert (Z = Right (Parent (Z))); Set_Right (Parent (Z), Y); end if; Set_Left (Y, Left (Z)); Set_Parent (Left (Y), Y); declare Y_Color : constant Color_Type := Color (Y); begin Set_Color (Y, Color (Z)); Set_Color (Z, Y_Color); end; end if; if Color (Z) = Black then Delete_Fixup (Tree, X); end if; end if; end if; Tree.Length := Tree.Length - 1; end Delete_Node_Sans_Free; ----------------- -- Delete_Swap -- ----------------- procedure Delete_Swap (Tree : in out Tree_Type; Z, Y : Node_Access) is pragma Assert (Z /= Y); pragma Assert (Parent (Y) /= Z); Y_Parent : constant Node_Access := Parent (Y); Y_Color : constant Color_Type := Color (Y); begin Set_Parent (Y, Parent (Z)); Set_Left (Y, Left (Z)); Set_Right (Y, Right (Z)); Set_Color (Y, Color (Z)); if Tree.Root = Z then Tree.Root := Y; elsif Right (Parent (Y)) = Z then Set_Right (Parent (Y), Y); else pragma Assert (Left (Parent (Y)) = Z); Set_Left (Parent (Y), Y); end if; if Right (Y) /= null then Set_Parent (Right (Y), Y); end if; if Left (Y) /= null then Set_Parent (Left (Y), Y); end if; Set_Parent (Z, Y_Parent); Set_Color (Z, Y_Color); Set_Left (Z, null); Set_Right (Z, null); end Delete_Swap; -------------------- -- Generic_Adjust -- -------------------- procedure Generic_Adjust (Tree : in out Tree_Type) is N : constant Count_Type := Tree.Length; Root : constant Node_Access := Tree.Root; use type Helpers.Tamper_Counts; begin -- If the counts are nonzero, execution is technically erroneous, but -- it seems friendly to allow things like concurrent "=" on shared -- constants. Zero_Counts (Tree.TC); if N = 0 then pragma Assert (Root = null); return; end if; Tree.Root := null; Tree.First := null; Tree.Last := null; Tree.Length := 0; Tree.Root := Copy_Tree (Root); Tree.First := Min (Tree.Root); Tree.Last := Max (Tree.Root); Tree.Length := N; end Generic_Adjust; ------------------- -- Generic_Clear -- ------------------- procedure Generic_Clear (Tree : in out Tree_Type) is Root : Node_Access := Tree.Root; begin TC_Check (Tree.TC); Tree := (First => null, Last => null, Root => null, Length => 0, TC => <>); Delete_Tree (Root); end Generic_Clear; ----------------------- -- Generic_Copy_Tree -- ----------------------- function Generic_Copy_Tree (Source_Root : Node_Access) return Node_Access is Target_Root : Node_Access := Copy_Node (Source_Root); P, X : Node_Access; begin if Right (Source_Root) /= null then Set_Right (Node => Target_Root, Right => Generic_Copy_Tree (Right (Source_Root))); Set_Parent (Node => Right (Target_Root), Parent => Target_Root); end if; P := Target_Root; X := Left (Source_Root); while X /= null loop declare Y : constant Node_Access := Copy_Node (X); begin Set_Left (Node => P, Left => Y); Set_Parent (Node => Y, Parent => P); if Right (X) /= null then Set_Right (Node => Y, Right => Generic_Copy_Tree (Right (X))); Set_Parent (Node => Right (Y), Parent => Y); end if; P := Y; X := Left (X); end; end loop; return Target_Root; exception when others => Delete_Tree (Target_Root); raise; end Generic_Copy_Tree; ------------------------- -- Generic_Delete_Tree -- ------------------------- procedure Generic_Delete_Tree (X : in out Node_Access) is Y : Node_Access; pragma Warnings (Off, Y); begin while X /= null loop Y := Right (X); Generic_Delete_Tree (Y); Y := Left (X); Free (X); X := Y; end loop; end Generic_Delete_Tree; ------------------- -- Generic_Equal -- ------------------- function Generic_Equal (Left, Right : Tree_Type) return Boolean is begin if Left.Length /= Right.Length then return False; end if; -- If the containers are empty, return a result immediately, so as to -- not manipulate the tamper bits unnecessarily. if Left.Length = 0 then return True; end if; declare Lock_Left : With_Lock (Left.TC'Unrestricted_Access); Lock_Right : With_Lock (Right.TC'Unrestricted_Access); L_Node : Node_Access := Left.First; R_Node : Node_Access := Right.First; begin while L_Node /= null loop if not Is_Equal (L_Node, R_Node) then return False; end if; L_Node := Next (L_Node); R_Node := Next (R_Node); end loop; end; return True; end Generic_Equal; ----------------------- -- Generic_Iteration -- ----------------------- procedure Generic_Iteration (Tree : Tree_Type) is procedure Iterate (P : Node_Access); ------------- -- Iterate -- ------------- procedure Iterate (P : Node_Access) is X : Node_Access := P; begin while X /= null loop Iterate (Left (X)); Process (X); X := Right (X); end loop; end Iterate; -- Start of processing for Generic_Iteration begin Iterate (Tree.Root); end Generic_Iteration; ------------------ -- Generic_Move -- ------------------ procedure Generic_Move (Target, Source : in out Tree_Type) is begin if Target'Address = Source'Address then return; end if; TC_Check (Source.TC); Clear (Target); Target := Source; Source := (First => null, Last => null, Root => null, Length => 0, TC => <>); end Generic_Move; ------------------ -- Generic_Read -- ------------------ procedure Generic_Read (Stream : not null access Root_Stream_Type'Class; Tree : in out Tree_Type) is N : Count_Type'Base; Node, Last_Node : Node_Access; begin Clear (Tree); Count_Type'Base'Read (Stream, N); pragma Assert (N >= 0); if N = 0 then return; end if; Node := Read_Node (Stream); pragma Assert (Node /= null); pragma Assert (Color (Node) = Red); Set_Color (Node, Black); Tree.Root := Node; Tree.First := Node; Tree.Last := Node; Tree.Length := 1; for J in Count_Type range 2 .. N loop Last_Node := Node; pragma Assert (Last_Node = Tree.Last); Node := Read_Node (Stream); pragma Assert (Node /= null); pragma Assert (Color (Node) = Red); Set_Right (Node => Last_Node, Right => Node); Tree.Last := Node; Set_Parent (Node => Node, Parent => Last_Node); Rebalance_For_Insert (Tree, Node); Tree.Length := Tree.Length + 1; end loop; end Generic_Read; ------------------------------- -- Generic_Reverse_Iteration -- ------------------------------- procedure Generic_Reverse_Iteration (Tree : Tree_Type) is procedure Iterate (P : Node_Access); ------------- -- Iterate -- ------------- procedure Iterate (P : Node_Access) is X : Node_Access := P; begin while X /= null loop Iterate (Right (X)); Process (X); X := Left (X); end loop; end Iterate; -- Start of processing for Generic_Reverse_Iteration begin Iterate (Tree.Root); end Generic_Reverse_Iteration; ------------------- -- Generic_Write -- ------------------- procedure Generic_Write (Stream : not null access Root_Stream_Type'Class; Tree : Tree_Type) is procedure Process (Node : Node_Access); pragma Inline (Process); procedure Iterate is new Generic_Iteration (Process); ------------- -- Process -- ------------- procedure Process (Node : Node_Access) is begin Write_Node (Stream, Node); end Process; -- Start of processing for Generic_Write begin Count_Type'Base'Write (Stream, Tree.Length); Iterate (Tree); end Generic_Write; ----------------- -- Left_Rotate -- ----------------- procedure Left_Rotate (Tree : in out Tree_Type; X : Node_Access) is -- CLR p266 Y : constant Node_Access := Right (X); pragma Assert (Y /= null); begin Set_Right (X, Left (Y)); if Left (Y) /= null then Set_Parent (Left (Y), X); end if; Set_Parent (Y, Parent (X)); if X = Tree.Root then Tree.Root := Y; elsif X = Left (Parent (X)) then Set_Left (Parent (X), Y); else pragma Assert (X = Right (Parent (X))); Set_Right (Parent (X), Y); end if; Set_Left (Y, X); Set_Parent (X, Y); end Left_Rotate; --------- -- Max -- --------- function Max (Node : Node_Access) return Node_Access is -- CLR p248 X : Node_Access := Node; Y : Node_Access; begin loop Y := Right (X); if Y = null then return X; end if; X := Y; end loop; end Max; --------- -- Min -- --------- function Min (Node : Node_Access) return Node_Access is -- CLR p248 X : Node_Access := Node; Y : Node_Access; begin loop Y := Left (X); if Y = null then return X; end if; X := Y; end loop; end Min; ---------- -- Next -- ---------- function Next (Node : Node_Access) return Node_Access is begin -- CLR p249 if Node = null then return null; end if; if Right (Node) /= null then return Min (Right (Node)); end if; declare X : Node_Access := Node; Y : Node_Access := Parent (Node); begin while Y /= null and then X = Right (Y) loop X := Y; Y := Parent (Y); end loop; return Y; end; end Next; -------------- -- Previous -- -------------- function Previous (Node : Node_Access) return Node_Access is begin if Node = null then return null; end if; if Left (Node) /= null then return Max (Left (Node)); end if; declare X : Node_Access := Node; Y : Node_Access := Parent (Node); begin while Y /= null and then X = Left (Y) loop X := Y; Y := Parent (Y); end loop; return Y; end; end Previous; -------------------------- -- Rebalance_For_Insert -- -------------------------- procedure Rebalance_For_Insert (Tree : in out Tree_Type; Node : Node_Access) is -- CLR p.268 X : Node_Access := Node; pragma Assert (X /= null); pragma Assert (Color (X) = Red); Y : Node_Access; begin while X /= Tree.Root and then Color (Parent (X)) = Red loop if Parent (X) = Left (Parent (Parent (X))) then Y := Right (Parent (Parent (X))); if Y /= null and then Color (Y) = Red then Set_Color (Parent (X), Black); Set_Color (Y, Black); Set_Color (Parent (Parent (X)), Red); X := Parent (Parent (X)); else if X = Right (Parent (X)) then X := Parent (X); Left_Rotate (Tree, X); end if; Set_Color (Parent (X), Black); Set_Color (Parent (Parent (X)), Red); Right_Rotate (Tree, Parent (Parent (X))); end if; else pragma Assert (Parent (X) = Right (Parent (Parent (X)))); Y := Left (Parent (Parent (X))); if Y /= null and then Color (Y) = Red then Set_Color (Parent (X), Black); Set_Color (Y, Black); Set_Color (Parent (Parent (X)), Red); X := Parent (Parent (X)); else if X = Left (Parent (X)) then X := Parent (X); Right_Rotate (Tree, X); end if; Set_Color (Parent (X), Black); Set_Color (Parent (Parent (X)), Red); Left_Rotate (Tree, Parent (Parent (X))); end if; end if; end loop; Set_Color (Tree.Root, Black); end Rebalance_For_Insert; ------------------ -- Right_Rotate -- ------------------ procedure Right_Rotate (Tree : in out Tree_Type; Y : Node_Access) is X : constant Node_Access := Left (Y); pragma Assert (X /= null); begin Set_Left (Y, Right (X)); if Right (X) /= null then Set_Parent (Right (X), Y); end if; Set_Parent (X, Parent (Y)); if Y = Tree.Root then Tree.Root := X; elsif Y = Left (Parent (Y)) then Set_Left (Parent (Y), X); else pragma Assert (Y = Right (Parent (Y))); Set_Right (Parent (Y), X); end if; Set_Right (X, Y); Set_Parent (Y, X); end Right_Rotate; --------- -- Vet -- --------- function Vet (Tree : Tree_Type; Node : Node_Access) return Boolean is begin if Node = null then return True; end if; if Parent (Node) = Node or else Left (Node) = Node or else Right (Node) = Node then return False; end if; if Tree.Length = 0 or else Tree.Root = null or else Tree.First = null or else Tree.Last = null then return False; end if; if Parent (Tree.Root) /= null then return False; end if; if Left (Tree.First) /= null then return False; end if; if Right (Tree.Last) /= null then return False; end if; if Tree.Length = 1 then if Tree.First /= Tree.Last or else Tree.First /= Tree.Root then return False; end if; if Node /= Tree.First then return False; end if; if Parent (Node) /= null or else Left (Node) /= null or else Right (Node) /= null then return False; end if; return True; end if; if Tree.First = Tree.Last then return False; end if; if Tree.Length = 2 then if Tree.First /= Tree.Root and then Tree.Last /= Tree.Root then return False; end if; if Tree.First /= Node and then Tree.Last /= Node then return False; end if; end if; if Left (Node) /= null and then Parent (Left (Node)) /= Node then return False; end if; if Right (Node) /= null and then Parent (Right (Node)) /= Node then return False; end if; if Parent (Node) = null then if Tree.Root /= Node then return False; end if; elsif Left (Parent (Node)) /= Node and then Right (Parent (Node)) /= Node then return False; end if; return True; end Vet; end Ada.Containers.Red_Black_Trees.Generic_Operations;
With System.Storage_Elements, Risi_Script.Types.Implementation.Creators, Risi_Script.Types.Internals, Ada.Containers, Ada.Strings.Unbounded, Ada.Strings.Fixed; Separate(Risi_Script.Types.Implementation) Package Body Conversions is Use Risi_Script.Types.Implementation.Creators; Use Type Ada.Containers.Count_Type; Package SE renames System.Storage_Elements; Type Braket_Style is ( Round, Square, Curly ); --------------------- -- UTIL FUNCTIONS -- --------------------- Function "+"( S : String ) return Ada.Strings.Unbounded.Unbounded_String renames Ada.Strings.Unbounded.To_Unbounded_String; Function "+"( S : Ada.Strings.Unbounded.Unbounded_String ) return String renames Ada.Strings.Unbounded.To_String; Function Trim( S : String ) return Ada.Strings.Unbounded.Unbounded_String is Use Ada.Strings.Unbounded, Ada.Strings.Fixed, Ada.Strings; begin Return + Trim(Side => Left, Source => S); end Trim; Function To_Address( X : SE.integer_Address ) return System.Address renames SE.To_Address; Generic Type X is private; Default : X; with Function Value( S : String ) return X; Function Parse_String( S : String_Type ) return X; Function Parse_String( S : String_Type ) return X is begin return Result : X := Default do Result:= Value( +S ); exception when others => null; end return; end Parse_String; Function Bracket( S : String; Style : Braket_Style ) return String is (case Style is when Round => '(' & S & ')', when Square => '[' & S & ']', when Curly => '{' & S & '}' ); Function Bracket( S : Unbounded_String; Style : Braket_Style ) return Unbounded_String is (case Style is when Round => '(' & S & ')', when Square => '[' & S & ']', when Curly => '{' & S & '}' ); ---------------------- -- INSTANTIATIONS -- ---------------------- Function As_Array is new To_Array(Integer_Type); Function As_Array is new To_Array(Real_Type); Function As_Array is new To_Array(Pointer_Type); Function As_Array is new To_Array(Fixed_Type); Function As_Array is new To_Array(Boolean_Type); Function As_Array is new To_Array(Func_Type); Function As_Hash is new To_Hash(Integer_Type); Function As_Hash is new To_Hash(Real_Type); Function As_Hash is new To_Hash(Pointer_Type); Function As_Hash is new To_Hash(Fixed_Type); Function As_Hash is new To_Hash(Boolean_Type); Function As_Hash is new To_Hash(Func_Type); Function Parse is new Parse_String( Integer_Type, 0, Integer_Type'Value ); Function Parse is new Parse_String( Real_Type, 0.0, Real_Type'Value ); Function Parse is new Parse_String( Fixed_Type, 0.0, Fixed_Type'Value ); Function Parse is new Parse_String( Boolean_Type, True, Boolean_Type'Value ); ---------------------- -- IMPLEMENTATION -- ---------------------- Function Convert(Value : Integer_Type ) return Array_Type renames As_Array; Function Convert(Value : Integer_Type ) return Hash_Type renames As_Hash; Function Convert(Value : Integer_Type ) return String_Type is ( Trim( Integer_Type'Image(Value) ) ); Function Convert(Value : Integer_Type ) return Real_Type is ( Real_Type(Value) ); -- Function Convert(Value : Integer_Type ) return Pointer_Type; -- Function Convert(Value : Integer_Type ) return Reference_Type; Function Convert(Value : Integer_Type ) return Fixed_Type is (if abs Value in 0..99_999_999_999_999 then Fixed_Type(Value) elsif Value > 0 then Fixed_Type'Last else Fixed_Type'First ); Function Convert(Value : Integer_Type ) return Boolean_Type is ( Boolean_Type(Value in 0..Integer_Type'Last) ); -- Function Convert(Value : Integer_Type ) return Func_Type; -- Function Convert(Value : Array_Type ) return Integer_Type is ( Integer_Type( Value.Length ) ); Function Convert(Value : Array_Type ) return Hash_Type is Function Internal_Convert(Value : Array_Type; Offset : Integer) return Hash_Type is begin Return Result : Hash_Type do for C in Value.Iterate loop declare Use Hash, List; K : constant String := Natural'Image(To_Index(C) + Offset); V : Representation renames Value(C); begin if Get_Enumeration(V) /= RT_Array then Result.Include( K, V ); else Result.Include( K, Internal_Create( Internal_Convert(V.Array_Value, Offset+1) ) ); end if; end; end loop; end return; end Internal_Convert; begin Return Internal_Convert( Value, -1 ); end Convert; Function Convert(Value : Array_Type ) return String_Type is Use Ada.Strings.Unbounded; Working : Unbounded_String; begin for Item in value.iterate loop declare Key : Positive renames List.To_Index(Item); Last : constant Boolean := Key = Value.Last_Index; Value : constant String := Image( List.Element( Item ) ); begin Append( Source => Working, New_Item => Value & (if not Last then ", " else "") ); end; end loop; Return Bracket( Working, Square ); end Convert; Function Convert(Value : Array_Type ) return Real_Type is ( Real_Type(Value.Length) ); -- Function Convert(Value : Array_Type ) return Pointer_Type; -- Function Convert(Value : Array_Type ) return Reference_Type; Function Convert(Value : Array_Type ) return Fixed_Type is ( Fixed_Type(Value.Length) ); Function Convert(Value : Array_Type ) return Boolean_Type is ( Boolean_Type(Value.Length > 0) ); -- Function Convert(Value : Array_Type ) return Func_Type; -- Function Convert(Value : Hash_Type ) return Integer_Type is ( Integer_Type(Value.Length) ); Function Convert(Value : Hash_Type ) return Array_Type is begin Return Result : Array_Type do for Item of Value loop Result.Append( Item ); end loop; end return; end Convert; Function Convert(Value : Hash_Type ) return String_Type is use Ada.Strings.Unbounded, Hash; Working : Unbounded_String; begin for E in Value.Iterate loop Append( Source => Working, New_Item => '"' & Key(E) & '"' & " => " & Image(Element(E)) & (if E /= Value.Last then ", " else "") ); end loop; return Working; end Convert; Function Convert(Value : Hash_Type ) return Real_Type is ( Real_Type(Value.Length) ); -- Function Convert(Value : Hash_Type ) return Pointer_Type; -- Function Convert(Value : Hash_Type ) return Reference_Type; Function Convert(Value : Hash_Type ) return Fixed_Type is ( Fixed_Type(Value.Length) ); Function Convert(Value : Hash_Type ) return Boolean_Type is ( Boolean_Type(Value.Length > 0) ); -- Function Convert(Value : Hash_Type ) return Func_Type; -- Function Convert(Value : String_Type ) return Integer_Type renames Parse; -- Function Convert(Value : String_Type ) return Array_Type; -- Function Convert(Value : String_Type ) return Hash_Type; Function Convert(Value : String_Type ) return Real_Type renames Parse; -- Function Convert(Value : String_Type ) return Pointer_Type; -- Function Convert(Value : String_Type ) return Reference_Type; Function Convert(Value : String_Type ) return Fixed_Type renames Parse; Function Convert(Value : String_Type ) return Boolean_Type renames Parse; -- Function Convert(Value : String_Type ) return Func_Type; -- Function Convert(Value : Real_Type ) return Integer_Type is First : Constant Real_Type:= Real_Type(Integer_Type'First); Last : Constant Real_Type:= Real_Type(Integer_Type'Last); Subtype Int_Range is Real_Type range First..Last; begin return (if Value in Int_Range then Integer_Type(Value) elsif Value > Last then Integer_Type'Last else Integer_Type'First ); end convert; Function Convert(Value : Real_Type ) return Array_Type renames As_Array; Function Convert(Value : Real_Type ) return Hash_Type renames As_Hash; Function Convert(Value : Real_Type ) return String_Type is ( Trim( Real_Type'Image(Value) ) ); -- Function Convert(Value : Real_Type ) return Pointer_Type; -- Function Convert(Value : Real_Type ) return Reference_Type; Function Convert(Value : Real_Type ) return Fixed_Type is First : Constant Real_Type:= Real_Type(Fixed_Type'First); Last : constant Real_Type:= Real_Type(Fixed_Type'Last); subtype Fixed_Range is Real_Type range First..Last; begin return (if Value in Fixed_Range then Fixed_Type( Value ) elsif Value > Last then Fixed_Type'Last else Fixed_Type'First ); end Convert; Function Convert(Value : Real_Type ) return Boolean_Type is ( Boolean_Type(Value in 0.0..Real_Type'Last) ); -- Function Convert(Value : Real_Type ) return Func_Type; -- -- Function Convert(Value : Pointer_Type ) return Integer_Type; -- Function Convert(Value : Pointer_Type ) return Array_Type; -- Function Convert(Value : Pointer_Type ) return Hash_Type; -- Function Convert(Value : Pointer_Type ) return String_Type; -- Function Convert(Value : Pointer_Type ) return Real_Type; -- Function Convert(Value : Pointer_Type ) return Pointer_Type; -- Function Convert(Value : Pointer_Type ) return Reference_Type; -- Function Convert(Value : Pointer_Type ) return Fixed_Type; -- Function Convert(Value : Pointer_Type ) return Boolean_Type; -- Function Convert(Value : Pointer_Type ) return Func_Type; -- Function Convert(Value : Reference_Type ) return Integer_Type is (case Get_Enumeration(Value) is when RT_Integer => Convert(Value), when RT_Array => Convert(Value), when RT_Hash => Convert(Value), when RT_String => Convert(Value), when RT_Real => Convert(Value), when RT_Pointer => Convert(Value), when RT_Reference => Convert(Value), when RT_Fixed => Convert(Value), when RT_Boolean => Convert(Value), when RT_Func => Convert(Value) ); -- Function Convert(Value : Reference_Type ) return Array_Type; -- Function Convert(Value : Reference_Type ) return Hash_Type; -- Function Convert(Value : Reference_Type ) return String_Type; -- Function Convert(Value : Reference_Type ) return Real_Type; -- Function Convert(Value : Reference_Type ) return Pointer_Type; -- Function Convert(Value : Reference_Type ) return Fixed_Type; -- Function Convert(Value : Reference_Type ) return Boolean_Type; -- Function Convert(Value : Reference_Type ) return Func_Type; Function Convert(Value : Fixed_Type ) return Integer_Type is ( Integer_Type(Value) ); Function Convert(Value : Fixed_Type ) return Array_Type renames As_Array; Function Convert(Value : Fixed_Type ) return Hash_Type renames As_Hash; Function Convert(Value : Fixed_Type ) return String_Type is ( Trim( Fixed_Type'Image(Value) ) ); Function Convert(Value : Fixed_Type ) return Real_Type is ( Real_Type(Value) ); -- Function Convert(Value : Fixed_Type ) return Pointer_Type; -- Function Convert(Value : Fixed_Type ) return Reference_Type; Function Convert(Value : Fixed_Type ) return Boolean_Type is ( Boolean_Type(Value in 0.0..Fixed_Type'Last) ); -- Function Convert(Value : Fixed_Type ) return Func_Type; Function Convert(Value : Boolean_Type ) return Integer_Type is (If Value = True then 1 else -1); Function Convert(Value : Boolean_Type ) return Array_Type renames As_Array; Function Convert(Value : Boolean_Type ) return Hash_Type renames As_Hash; Function Convert(Value : Boolean_Type ) return String_Type is (+(if Value = True then "TRUE" else "FALSE")); Function Convert(Value : Boolean_Type ) return Real_Type is (if Value = True then 1.0 else -1.0); Function Convert(Value : Boolean_Type ) return Pointer_Type is (if Value = True then Pointer_Type(System.Null_Address) else Pointer_Type( To_Address(SE.Integer_Address'Last) ) ); -- Function Convert(Value : Boolean_Type ) return Reference_Type; Function Convert(Value : Boolean_Type ) return Fixed_Type is (If Value = True then 1.0 else -1.0); -- Function Convert(Value : Boolean_Type ) return Func_Type; -- Function Convert(Value : Func_Type ) return Integer_Type; -- Function Convert(Value : Func_Type ) return Array_Type; -- Function Convert(Value : Func_Type ) return Hash_Type; -- Function Convert(Value : Func_Type ) return String_Type; -- Function Convert(Value : Func_Type ) return Real_Type; -- Function Convert(Value : Func_Type ) return Pointer_Type; -- Function Convert(Value : Func_Type ) return Reference_Type; -- Function Convert(Value : Func_Type ) return Fixed_Type; -- Function Convert(Value : Func_Type ) return Boolean_Type; -- End Conversions;
--PRÁCTICA 3: CÉSAR BORAO MORATINOS (Chat_Client_2) with Handlers; with Ada.Text_IO; with Chat_Messages; with Lower_Layer_UDP; with Ada.Command_Line; with Ada.Strings.Unbounded; procedure Chat_Client_2 is package ATI renames Ada.Text_IO; package CM renames Chat_Messages; package LLU renames Lower_Layer_UDP; package ACL renames Ada.Command_Line; package ASU renames Ada.Strings.Unbounded; use type CM.Message_Type; Server_EP: LLU.End_Point_Type; Port: Integer; Nick: ASU.Unbounded_String; Client_EP_Receive: LLU.End_Point_Type; Client_EP_Handler: LLU.End_Point_Type; Buffer_In: aliased LLU.Buffer_Type(1024); Buffer_Out: aliased LLU.Buffer_Type(1024); Mess: CM.Message_Type; Expired: Boolean; Accepted: Boolean; Comment: ASU.Unbounded_String; begin --Binding Port := Integer'Value(ACL.Argument(2)); Server_EP := LLU.Build(LLU.To_IP(ACL.Argument(1)),Port); Nick := ASU.To_Unbounded_String(ACL.Argument(3)); LLU.Bind_Any(Client_EP_Receive); LLU.Bind_Any(Client_EP_Handler, Handlers.Client_Handler'Access); LLU.Reset(Buffer_In); if ACL.Argument_Count = 3 then if ASU.To_String(Nick) /= "server" then --Init Message CM.Init_Message(Server_EP,Client_EP_Receive, Client_EP_Handler,Nick,Buffer_Out'Access); LLU.Receive(Client_EP_Receive, Buffer_In'Access, 10.0, Expired); if Expired then ATI.Put_Line("Server unreachable"); else --Server Reply Mess := CM.Message_Type'Input(Buffer_In'Access); Accepted := Boolean'Input(Buffer_In'Access); LLU.Reset(Buffer_In); if Accepted then ATI.Put_Line("Mini-Chat v2.0: Welcome " & ASU.To_String(Nick)); loop ATI.Put(">> "); Comment := ASU.To_Unbounded_String(ATI.Get_Line); exit when ASU.To_String(Comment) = ".quit"; --Writer Message CM.Writer_Message(Server_EP,Client_EP_Handler, Nick,Comment,Buffer_Out'Access); end loop; --Logout Message CM.Logout_Message(Server_EP,Client_EP_Handler, Nick,Buffer_Out'Access); else ATI.Put_Line("Mini-Chat v2.0: IGNORED new user " & ASU.To_String(Nick) & ", nick already used"); end if; end if; else ATI.New_Line; ATI.Put_Line("Nick 'server' not avaliable, try again"); ATI.New_Line; end if; else ATI.New_Line; ATI.Put_Line("Client Usage: [user] [Port] <nick>"); ATI.New_Line; end if; LLU.Finalize; end Chat_Client_2;
------------------------------------------------------------------------------ -- AGAR CORE LIBRARY -- -- A G A R . C O R E . I N I T -- -- B o d y -- -- -- -- Copyright (c) 2018-2019, Julien Nadeau Carriere (vedge@csoft.net) -- -- Copyright (c) 2010, coreland (mark@coreland.ath.cx) -- -- -- -- Permission to use, copy, modify, and/or distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ package body Agar.Init is procedure Get_Version (Major : out Natural; Minor : out Natural; Patch : out Natural) is Version : aliased Agar_Version; begin AG_GetVersion (Version'Unchecked_Access); Major := Natural (Version.Major); Minor := Natural (Version.Minor); Patch := Natural (Version.Patch); end Get_Version; function Init_Core (Program_Name : in String; Verbose : in Boolean := False; Create_Directory : in Boolean := False; Software_Timers : in Boolean := False) return Boolean is Ch_Name : aliased C.char_array := C.To_C (Program_Name); C_Flags : C.unsigned := 0; begin if Verbose then C_Flags := C_Flags or AG_VERBOSE; end if; if Create_Directory then C_Flags := C_Flags or AG_CREATE_DATADIR; end if; if Software_Timers then C_Flags := C_Flags or AG_SOFT_TIMERS; end if; return 0 = AG_InitCore (Progname => CS.To_Chars_Ptr (Ch_Name'Unchecked_Access), Flags => C_Flags); end; function Init_Core (Verbose : in Boolean := False; Create_Directory : in Boolean := False; Software_Timers : in Boolean := False) return Boolean is C_Flags : C.unsigned := 0; begin if Verbose then C_Flags := C_Flags or AG_VERBOSE; end if; if Create_Directory then C_Flags := C_Flags or AG_CREATE_DATADIR; end if; if Software_Timers then C_Flags := C_Flags or AG_SOFT_TIMERS; end if; return 0 = AG_InitCore (Progname => CS.Null_Ptr, Flags => C_Flags); end; -- -- Proxy procedure to call 'Atexit_Callback' from C. -- procedure At_Exit_Proxy with Convention => C; Atexit_Callback : Atexit_Func_Access := null; procedure At_Exit_Proxy is begin if Atexit_Callback /= null then Atexit_Callback.all; end if; end At_Exit_Proxy; procedure At_Exit (Callback : Atexit_Func_Access) is begin Atexit_Callback := Callback; AG_AtExitFunc (At_Exit_Proxy'Access); end At_Exit; end Agar.Init;
-- C64109C.ADA -- Grant of Unlimited Rights -- -- 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 -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- 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 -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT ARRAYS THAT ARE COMPONENTS OF RECORDS ARE PASSED CORRECTLY -- TO SUBPROGRAMS. SPECIFICALLY, -- (C) CHECK RECORDS HAVING A DISCRIMINANT, WITH MORE THAN ONE ARRAY -- COMPONENT, WHERE THE BOUNDS OF THE ARRAY DEPEND ON THE -- DISCRIMINANT. -- CPP 8/20/84 WITH REPORT; USE REPORT; PROCEDURE C64109C IS BEGIN TEST ("C64109C", "CHECK THAT ARRAYS WHICH ARE COMPONENTS OF " & "RECORDS ARE PASSED CORRECTLY TO SUBPROGRAMS - " & "RECORDS WITH DISCRIMINANTS"); DECLARE -- (C) SUBTYPE SUBINT IS INTEGER RANGE 1..6; TYPE ARRAY_TYPE IS ARRAY (SUBINT RANGE <>) OF INTEGER; TYPE RECORD_TYPE (BOUND : INTEGER) IS RECORD B : BOOLEAN; A : ARRAY_TYPE (1..BOUND); AA : ARRAY_TYPE (BOUND..6); END RECORD; REC : RECORD_TYPE (BOUND => IDENT_INT(4)) := (BOUND => 4, B => TRUE, A => (1..IDENT_INT(4) => 6), AA => (4..6 => 8)); BOOL : BOOLEAN; PROCEDURE P1 (ARR : ARRAY_TYPE) IS BEGIN IF ARR /= (6, 6, 6, 6) THEN FAILED ("IN PARAM NOT PASSED CORRECTLY"); END IF; IF ARR'FIRST /= 1 OR ARR'LAST /= IDENT_INT(4) THEN FAILED ("WRONG BOUNDS - IN PARAMETER"); END IF; END P1; FUNCTION F1 (ARR : ARRAY_TYPE) RETURN BOOLEAN IS BEGIN IF ARR /= (6, 6, 6, 6) THEN FAILED ("IN PARAM NOT PASSED CORRECTLY TO FN"); END IF; IF ARR'FIRST /= 1 OR ARR'LAST /= IDENT_INT(4) THEN FAILED ("WRONG BOUNDS - IN PARAMETER FOR FN"); END IF; RETURN TRUE; END F1; PROCEDURE P2 (ARR : IN OUT ARRAY_TYPE) IS BEGIN IF ARR /= (8, 8, 8) THEN FAILED ("IN OUT PARAM NOT PASSED CORRECTLY"); END IF; IF ARR'FIRST /= 4 OR ARR'LAST /= IDENT_INT(6) THEN FAILED ("WRONG BOUNDS - IN OUT PARAMETER"); END IF; ARR := (ARR'RANGE => 10); END P2; PROCEDURE P3 (ARR : OUT ARRAY_TYPE) IS BEGIN IF ARR'FIRST /= 1 OR ARR'LAST /= IDENT_INT(4) THEN FAILED ("WRONG BOUNDS - OUT PARAMETER"); END IF; ARR := (ARR'RANGE => 4); END P3; BEGIN -- (C) P1 (REC.A); IF REC.A /= (6, 6, 6, 6) THEN FAILED ("IN PARAM CHANGED BY PROCEDURE"); END IF; BOOL := F1 (REC.A); IF REC.A /= (6, 6, 6, 6) THEN FAILED ("IN PARAM CHANGED BY FUNCTION"); END IF; P2 (REC.AA); IF REC.AA /= (10, 10, 10) THEN FAILED ("IN OUT PARAM NOT RETURNED CORRECTLY"); END IF; P3 (REC.A); IF REC.A /= (4, 4, 4, 4) THEN FAILED ("OUT PARAM NOT RETURNED CORRECTLY"); END IF; END; -- (C) RESULT; END C64109C;
-- This spec has been automatically generated from STM32L4x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.LPTIM is pragma Preelaborate; --------------- -- Registers -- --------------- -- Interrupt and Status Register type ISR_Register is record -- Read-only. Compare match CMPM : Boolean; -- Read-only. Autoreload match ARRM : Boolean; -- Read-only. External trigger edge event EXTTRIG : Boolean; -- Read-only. Compare register update OK CMPOK : Boolean; -- Read-only. Autoreload register update OK ARROK : Boolean; -- Read-only. Counter direction change down to up UP : Boolean; -- Read-only. Counter direction change up to down DOWN : Boolean; -- unspecified Reserved_7_31 : HAL.UInt25; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record CMPM at 0 range 0 .. 0; ARRM at 0 range 1 .. 1; EXTTRIG at 0 range 2 .. 2; CMPOK at 0 range 3 .. 3; ARROK at 0 range 4 .. 4; UP at 0 range 5 .. 5; DOWN at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; -- Interrupt Clear Register type ICR_Register is record -- Write-only. compare match Clear Flag CMPMCF : Boolean := False; -- Write-only. Autoreload match Clear Flag ARRMCF : Boolean := False; -- Write-only. External trigger valid edge Clear Flag EXTTRIGCF : Boolean := False; -- Write-only. Compare register update OK Clear Flag CMPOKCF : Boolean := False; -- Write-only. Autoreload register update OK Clear Flag ARROKCF : Boolean := False; -- Write-only. Direction change to UP Clear Flag UPCF : Boolean := False; -- Write-only. Direction change to down Clear Flag DOWNCF : Boolean := False; -- unspecified Reserved_7_31 : HAL.UInt25 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record CMPMCF at 0 range 0 .. 0; ARRMCF at 0 range 1 .. 1; EXTTRIGCF at 0 range 2 .. 2; CMPOKCF at 0 range 3 .. 3; ARROKCF at 0 range 4 .. 4; UPCF at 0 range 5 .. 5; DOWNCF at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; -- Interrupt Enable Register type IER_Register is record -- Compare match Interrupt Enable CMPMIE : Boolean := False; -- Autoreload match Interrupt Enable ARRMIE : Boolean := False; -- External trigger valid edge Interrupt Enable EXTTRIGIE : Boolean := False; -- Compare register update OK Interrupt Enable CMPOKIE : Boolean := False; -- Autoreload register update OK Interrupt Enable ARROKIE : Boolean := False; -- Direction change to UP Interrupt Enable UPIE : Boolean := False; -- Direction change to down Interrupt Enable DOWNIE : Boolean := False; -- unspecified Reserved_7_31 : HAL.UInt25 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IER_Register use record CMPMIE at 0 range 0 .. 0; ARRMIE at 0 range 1 .. 1; EXTTRIGIE at 0 range 2 .. 2; CMPOKIE at 0 range 3 .. 3; ARROKIE at 0 range 4 .. 4; UPIE at 0 range 5 .. 5; DOWNIE at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; subtype CFGR_CKPOL_Field is HAL.UInt2; subtype CFGR_CKFLT_Field is HAL.UInt2; subtype CFGR_TRGFLT_Field is HAL.UInt2; subtype CFGR_PRESC_Field is HAL.UInt3; subtype CFGR_TRIGSEL_Field is HAL.UInt3; subtype CFGR_TRIGEN_Field is HAL.UInt2; -- Configuration Register type CFGR_Register is record -- Clock selector CKSEL : Boolean := False; -- Clock Polarity CKPOL : CFGR_CKPOL_Field := 16#0#; -- Configurable digital filter for external clock CKFLT : CFGR_CKFLT_Field := 16#0#; -- unspecified Reserved_5_5 : HAL.Bit := 16#0#; -- Configurable digital filter for trigger TRGFLT : CFGR_TRGFLT_Field := 16#0#; -- unspecified Reserved_8_8 : HAL.Bit := 16#0#; -- Clock prescaler PRESC : CFGR_PRESC_Field := 16#0#; -- unspecified Reserved_12_12 : HAL.Bit := 16#0#; -- Trigger selector TRIGSEL : CFGR_TRIGSEL_Field := 16#0#; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- Trigger enable and polarity TRIGEN : CFGR_TRIGEN_Field := 16#0#; -- Timeout enable TIMOUT : Boolean := False; -- Waveform shape WAVE : Boolean := False; -- Waveform shape polarity WAVPOL : Boolean := False; -- Registers update mode PRELOAD : Boolean := False; -- counter mode enabled COUNTMODE : Boolean := False; -- Encoder mode enable ENC : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record CKSEL at 0 range 0 .. 0; CKPOL at 0 range 1 .. 2; CKFLT at 0 range 3 .. 4; Reserved_5_5 at 0 range 5 .. 5; TRGFLT at 0 range 6 .. 7; Reserved_8_8 at 0 range 8 .. 8; PRESC at 0 range 9 .. 11; Reserved_12_12 at 0 range 12 .. 12; TRIGSEL at 0 range 13 .. 15; Reserved_16_16 at 0 range 16 .. 16; TRIGEN at 0 range 17 .. 18; TIMOUT at 0 range 19 .. 19; WAVE at 0 range 20 .. 20; WAVPOL at 0 range 21 .. 21; PRELOAD at 0 range 22 .. 22; COUNTMODE at 0 range 23 .. 23; ENC at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- Control Register type CR_Register is record -- LPTIM Enable ENABLE : Boolean := False; -- LPTIM start in single mode SNGSTRT : Boolean := False; -- Timer start in continuous mode CNTSTRT : Boolean := False; -- unspecified Reserved_3_31 : HAL.UInt29 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record ENABLE at 0 range 0 .. 0; SNGSTRT at 0 range 1 .. 1; CNTSTRT at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype CMP_CMP_Field is HAL.UInt16; -- Compare Register type CMP_Register is record -- Compare value CMP : CMP_CMP_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CMP_Register use record CMP at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype ARR_ARR_Field is HAL.UInt16; -- Autoreload Register type ARR_Register is record -- Auto reload value ARR : ARR_ARR_Field := 16#1#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for ARR_Register use record ARR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CNT_CNT_Field is HAL.UInt16; -- Counter Register type CNT_Register is record -- Read-only. Counter value CNT : CNT_CNT_Field; -- unspecified Reserved_16_31 : HAL.UInt16; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CNT_Register use record CNT at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Low power timer type LPTIM_Peripheral is record -- Interrupt and Status Register ISR : aliased ISR_Register; -- Interrupt Clear Register ICR : aliased ICR_Register; -- Interrupt Enable Register IER : aliased IER_Register; -- Configuration Register CFGR : aliased CFGR_Register; -- Control Register CR : aliased CR_Register; -- Compare Register CMP : aliased CMP_Register; -- Autoreload Register ARR : aliased ARR_Register; -- Counter Register CNT : aliased CNT_Register; end record with Volatile; for LPTIM_Peripheral use record ISR at 16#0# range 0 .. 31; ICR at 16#4# range 0 .. 31; IER at 16#8# range 0 .. 31; CFGR at 16#C# range 0 .. 31; CR at 16#10# range 0 .. 31; CMP at 16#14# range 0 .. 31; ARR at 16#18# range 0 .. 31; CNT at 16#1C# range 0 .. 31; end record; -- Low power timer LPTIM1_Periph : aliased LPTIM_Peripheral with Import, Address => LPTIM1_Base; -- Low power timer LPTIM2_Periph : aliased LPTIM_Peripheral with Import, Address => LPTIM2_Base; end STM32_SVD.LPTIM;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.HASH_TABLES.GENERIC_BOUNDED_OPERATIONS -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2015, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ -- Hash_Table_Type is used to implement hashed containers. This package -- declares hash-table operations that do not depend on keys. with Ada.Streams; generic with package HT_Types is new Generic_Bounded_Hash_Table_Types (<>); use HT_Types, HT_Types.Implementation; with function Hash_Node (Node : Node_Type) return Hash_Type; with function Next (Node : Node_Type) return Count_Type; with procedure Set_Next (Node : in out Node_Type; Next : Count_Type); package Ada.Containers.Hash_Tables.Generic_Bounded_Operations is pragma Pure; function Index (Buckets : Buckets_Type; Node : Node_Type) return Hash_Type; pragma Inline (Index); -- Uses the hash value of Node to compute its Buckets array index function Index (HT : Hash_Table_Type'Class; Node : Node_Type) return Hash_Type; pragma Inline (Index); -- Uses the hash value of Node to compute its Hash_Table buckets array -- index. function Checked_Index (Hash_Table : aliased in out Hash_Table_Type'Class; Node : Count_Type) return Hash_Type; -- Calls Index, but also locks and unlocks the container, per AI05-0022, in -- order to detect element tampering by the generic actual Hash function. generic with function Find (HT : Hash_Table_Type'Class; Key : Node_Type) return Boolean; function Generic_Equal (L, R : Hash_Table_Type'Class) return Boolean; -- Used to implement hashed container equality. For each node in hash table -- L, it calls Find to search for an equivalent item in hash table R. If -- Find returns False for any node then Generic_Equal terminates -- immediately and returns False. Otherwise if Find returns True for every -- node then Generic_Equal returns True. procedure Clear (HT : in out Hash_Table_Type'Class); -- Deallocates each node in hash table HT. (Note that it only deallocates -- the nodes, not the buckets array.) Program_Error is raised if the hash -- table is busy. procedure Delete_Node_At_Index (HT : in out Hash_Table_Type'Class; Indx : Hash_Type; X : Count_Type); -- Delete a node whose bucket position is known. extracted from following -- subprogram, but also used directly to remove a node whose element has -- been modified through a key_preserving reference: in that case we cannot -- use the value of the element precisely because the current value does -- not correspond to the hash code that determines its bucket. procedure Delete_Node_Sans_Free (HT : in out Hash_Table_Type'Class; X : Count_Type); -- Removes node X from the hash table without deallocating the node generic with procedure Set_Element (Node : in out Node_Type); procedure Generic_Allocate (HT : in out Hash_Table_Type'Class; Node : out Count_Type); -- Claim a node from the free store. Generic_Allocate first -- calls Set_Element on the potential node, and then returns -- the node's index as the value of the Node parameter. procedure Free (HT : in out Hash_Table_Type'Class; X : Count_Type); -- Return a node back to the free store, from where it had -- been previously claimed via Generic_Allocate. function First (HT : Hash_Table_Type'Class) return Count_Type; -- Returns the head of the list in the first (lowest-index) non-empty -- bucket. function Next (HT : Hash_Table_Type'Class; Node : Count_Type) return Count_Type; -- Returns the node that immediately follows Node. This corresponds to -- either the next node in the same bucket, or (if Node is the last node in -- its bucket) the head of the list in the first non-empty bucket that -- follows. generic with procedure Process (Node : Count_Type); procedure Generic_Iteration (HT : Hash_Table_Type'Class); -- Calls Process for each node in hash table HT generic use Ada.Streams; with procedure Write (Stream : not null access Root_Stream_Type'Class; Node : Node_Type); procedure Generic_Write (Stream : not null access Root_Stream_Type'Class; HT : Hash_Table_Type'Class); -- Used to implement the streaming attribute for hashed containers. It -- calls Write for each node to write its value into Stream. generic use Ada.Streams; with function New_Node (Stream : not null access Root_Stream_Type'Class) return Count_Type; procedure Generic_Read (Stream : not null access Root_Stream_Type'Class; HT : out Hash_Table_Type'Class); -- Used to implement the streaming attribute for hashed containers. It -- first clears hash table HT, then populates the hash table by calling -- New_Node for each item in Stream. end Ada.Containers.Hash_Tables.Generic_Bounded_Operations;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- N L I S T S -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2000 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides facilities for manipulating lists of nodes (see -- package Atree for format and implementation of tree nodes). The Link field -- of the nodes is used as the forward pointer for these lists. See also -- package Elists which provides another form of lists that are not threaded -- through the nodes (and therefore allow nodes to be on multiple lists). with System; with Types; use Types; package Nlists is -- A node list is a list of nodes in a special format that means that -- nodes can be on at most one such list. For each node list, a list -- header is allocated in the lists table, and a List_Id value references -- this header, which may be used to access the nodes in the list using -- the set of routines that define this interface. -- Note: node lists can contain either nodes or entities (extended nodes) -- or a mixture of nodes and extended nodes. function Last_List_Id return List_Id; pragma Inline (Last_List_Id); -- Returns Id of last allocated list header function Lists_Address return System.Address; pragma Inline (Lists_Address); -- Return address of Lists table (used in Back_End for Gigi call) function Num_Lists return Nat; pragma Inline (Num_Lists); -- Number of currently allocated lists function New_List return List_Id; -- Creates a new empty node list. Typically this is used to initialize -- a field in some other node which points to a node list where the list -- is then subsequently filled in using Append calls. function Empty_List return List_Id renames New_List; -- Used in contexts where an empty list (as opposed to an initially empty -- list to be filled in) is required. function New_List (Node : Node_Id) return List_Id; -- Build a new list initially containing the given node function New_List (Node1, Node2 : Node_Id) return List_Id; -- Build a new list initially containing the two given nodes function New_List (Node1, Node2, Node3 : Node_Id) return List_Id; -- Build a new list initially containing the three given nodes function New_List (Node1, Node2, Node3, Node4 : Node_Id) return List_Id; -- Build a new list initially containing the four given nodes function New_List (Node1 : Node_Id; Node2 : Node_Id; Node3 : Node_Id; Node4 : Node_Id; Node5 : Node_Id) return List_Id; -- Build a new list initially containing the five given nodes function New_List (Node1 : Node_Id; Node2 : Node_Id; Node3 : Node_Id; Node4 : Node_Id; Node5 : Node_Id; Node6 : Node_Id) return List_Id; -- Build a new list initially containing the five given nodes function New_Copy_List (List : List_Id) return List_Id; -- Creates a new list containing copies (made with Atree.New_Copy) of every -- node in the original list. If the argument is No_List, then the returned -- result is No_List. If the argument is an empty list, then the returned -- result is a new empty list. function New_Copy_List_Original (List : List_Id) return List_Id; -- Same as New_Copy_List but copies only nodes coming from source function New_Copy_List_Tree (List : List_Id) return List_Id; -- Similar to New_Copy_List, except that the copies are done using the -- Atree.New_Copy_Tree function, which means that a full recursive copy -- of the subtrees in the list is performed, setting proper parents. As -- for New_Copy_Tree, it is illegal to attempt to copy extended nodes -- (entities) either directly or indirectly using this function. function First (List : List_Id) return Node_Id; pragma Inline (First); -- Obtains the first element of the given node list or, if the node list -- has no items or is equal to No_List, then Empty is returned. function First_Non_Pragma (List : List_Id) return Node_Id; -- Used when dealing with a list that can contain pragmas to skip past -- any initial pragmas and return the first element that is not a pragma. -- If the list is empty, or if it contains only pragmas, then Empty is -- returned. It is an error to call First_Non_Pragma with a Node_Id value -- or No_List (No_List is not considered to be the same as an empty list). -- This function also skips N_Null nodes which can result from rewriting -- unrecognized or incorrrect pragmas. function Last (List : List_Id) return Node_Id; pragma Inline (Last); -- Obtains the last element of the given node list or, if the node list -- has no items, then Empty is returned. It is an error to call Last with -- a Node_Id or No_List. (No_List is not considered to be the same as an -- empty node list). function Last_Non_Pragma (List : List_Id) return Node_Id; -- Obtains the last element of a given node list that is not a pragma. -- If the list is empty, or if it contains only pragmas, then Empty is -- returned. It is an error to call Last_Non_Pragma with a Node_Id or -- No_List. (No_List is not considered to be the same as an empty list). function List_Length (List : List_Id) return Nat; pragma Inline (List_Length); -- Returns number of items in the given list. It is an error to call -- this function with No_List (No_List is not considered to be the same -- as an empty list). function Next (Node : Node_Id) return Node_Id; pragma Inline (Next); -- This function returns the next node on a node list, or Empty if Node is -- the last element of the node list. The argument must be a member of a -- node list. procedure Next (Node : in out Node_Id); pragma Inline (Next); -- Equivalent to Node := Next (Node); function Next_Non_Pragma (Node : Node_Id) return Node_Id; -- This function returns the next node on a node list, skipping past any -- pragmas, or Empty if there is no non-pragma entry left. The argument -- must be a member of a node list. This function also skips N_Null nodes -- which can result from rewriting unrecognized or incorrect pragmas. procedure Next_Non_Pragma (Node : in out Node_Id); pragma Inline (Next_Non_Pragma); -- Equivalent to Node := Next_Non_Pragma (Node); function Prev (Node : Node_Id) return Node_Id; pragma Inline (Prev); -- This function returns the previous node on a node list list, or Empty if -- Node is the first element of the node list. The argument must be a -- member of a node list. Note that the implementation does not maintain -- back pointers, so this function potentially requires traversal of the -- entire list, or more accurately of the part of the list preceding Node. function Pick (List : List_Id; Index : Pos) return Node_Id; -- Given a list, picks out the Index'th entry (1 = first entry). The -- caller must ensure that Index is in range. procedure Prev (Node : in out Node_Id); pragma Inline (Prev); -- Equivalent to Node := Prev (Node); function Prev_Non_Pragma (Node : Node_Id) return Node_Id; pragma Inline (Prev_Non_Pragma); -- This function returns the previous node on a node list, skipping any -- pragmas. If Node is the first element of the list, or if the only -- elements preceding it are pragmas, then Empty is returned. The -- argument must be a member of a node list. Like Prev, this function -- may require expensive traversal of the head section of the list. procedure Prev_Non_Pragma (Node : in out Node_Id); pragma Inline (Prev_Non_Pragma); -- Equivalent to Node := Prev_Non_Pragma (Node); function Is_Empty_List (List : List_Id) return Boolean; pragma Inline (Is_Empty_List); -- This function determines if a given list id references a node list that -- contains no items. No_List is a not a legitimate argument. function Is_Non_Empty_List (List : List_Id) return Boolean; pragma Inline (Is_Non_Empty_List); -- This function determines if a given list id references a node list that -- contains at least one item. No_List as an argument returns False. function Is_List_Member (Node : Node_Id) return Boolean; pragma Inline (Is_List_Member); -- This function determines if a given node is a member of a node list. -- It is an error for Node to be Empty, or to be a node list. function List_Containing (Node : Node_Id) return List_Id; pragma Inline (List_Containing); -- This function provides a pointer to the node list containing Node. -- Node must be a member of a node list. procedure Append (Node : Node_Id; To : List_Id); -- Appends Node at the end of node list To. Node must be a non-empty node -- that is not already a member of a node list, and To must be a -- node list. An attempt to append an error node is ignored without -- complaint and the list is unchanged. procedure Append_To (To : List_Id; Node : Node_Id); pragma Inline (Append_To); -- Like Append, but arguments are the other way round procedure Append_List (List : List_Id; To : List_Id); -- Appends node list List to the end of node list To. On return, -- List is reset to be empty. procedure Append_List_To (To : List_Id; List : List_Id); pragma Inline (Append_List_To); -- Like Append_List, but arguments are the other way round procedure Insert_After (After : Node_Id; Node : Node_Id); -- Insert Node, which must be a non-empty node that is not already a -- member of a node list, immediately past node After, which must be a -- node that is currently a member of a node list. An attempt to insert -- an error node is ignored without complaint (and the list is unchanged). procedure Insert_List_After (After : Node_Id; List : List_Id); -- Inserts the entire contents of node list List immediately after node -- After, which must be a member of a node list. On return, the node list -- List is reset to be the empty node list. procedure Insert_Before (Before : Node_Id; Node : Node_Id); -- Insert Node, which must be a non-empty node that is not already a -- member of a node list, immediately before Before, which must be a node -- that is currently a member of a node list. An attempt to insert an -- error node is ignored without complaint (and the list is unchanged). procedure Insert_List_Before (Before : Node_Id; List : List_Id); -- Inserts the entire contents of node list List immediately before node -- Before, which must be a member of a node list. On return, the node list -- List is reset to be the empty node list. procedure Prepend (Node : Node_Id; To : List_Id); pragma Inline (Prepend); -- Prepends Node at the start of node list To. Node must be a non-empty -- node that is not already a member of a node list, and To must be a -- node list. An attempt to prepend an error node is ignored without -- complaint and the list is unchanged. procedure Prepend_To (To : List_Id; Node : Node_Id); pragma Inline (Prepend_To); -- Like Prepend, but arguments are the other way round procedure Remove (Node : Node_Id); -- Removes Node, which must be a node that is a member of a node list, -- from this node list. The contents of Node are not otherwise affected. function Remove_Head (List : List_Id) return Node_Id; -- Removes the head element of a node list, and returns the node (whose -- contents are not otherwise affected) as the result. If the node list -- is empty, then Empty is returned. function Remove_Next (Node : Node_Id) return Node_Id; pragma Inline (Remove_Next); -- Removes the item immediately following the given node, and returns it -- as the result. If Node is the last element of the list, then Empty is -- returned. Node must be a member of a list. Unlike Remove, Remove_Next -- is fast and does not involve any list traversal. procedure Initialize; -- Called at the start of compilation of each new main source file to -- initialize the allocation of the list table. Note that Initialize -- must not be called if Tree_Read is used. procedure Lock; -- Called to lock tables before back end is called procedure Tree_Read; -- Initializes internal tables from current tree file using Tree_Read. -- Note that Initialize should not be called if Tree_Read is used. -- Tree_Read includes all necessary initialization. procedure Tree_Write; -- Writes out internal tables to current tree file using Tree_Write function Parent (List : List_Id) return Node_Id; pragma Inline (Parent); -- Node lists may have a parent in the same way as a node. The function -- accesses the Parent value, which is either Empty when a list header -- is first created, or the value that has been set by Set_Parent. procedure Set_Parent (List : List_Id; Node : Node_Id); pragma Inline (Set_Parent); -- Sets the parent field of the given list to reference the given node function No (List : List_Id) return Boolean; pragma Inline (No); -- Tests given Id for equality with No_List. This allows notations like -- "if No (Statements)" as opposed to "if Statements = No_List". function Present (List : List_Id) return Boolean; pragma Inline (Present); -- Tests given Id for inequality with No_List. This allows notations like -- "if Present (Statements)" as opposed to "if Statements /= No_List". procedure Allocate_List_Tables (N : Node_Id); -- Called when nodes table is expanded to include node N. This call -- makes sure that list structures internal to Nlists are adjusted -- appropriately to reflect this increase in the size of the nodes table. function Next_Node_Address return System.Address; function Prev_Node_Address return System.Address; -- These functions return the addresses of the Next_Node and Prev_Node -- tables (used in Back_End for Gigi). procedure Delete_List (L : List_Id); -- Removes all elements of the given list, and calls Delete_Tree on each function p (U : Union_Id) return Node_Id; -- This function is intended for use from the debugger, it determines -- whether U is a Node_Id or List_Id, and calls the appropriate Parent -- function and returns the parent Node in either case. This is shorter -- to type, and avoids the overloading problem of using Parent. It -- should NEVER be used except from the debugger. If p is called with -- other than a node or list id value, it returns 99_999_999. end Nlists;
with Ada.Text_IO; use Ada.Text_IO; package Auto_Differentiation.Integrator is type Variable (N2 : Nat) is record X : Real_Vector (1 .. N2); T : Real; end record; type Control_Type is record N : Nat; Dt : Real := 1.0; Eps : Real := 1.0e-10; Err : Real := 1.0; K : Nat := 9; end record; procedure FJ (Lagrangian : not null access function (X : Real_Vector; N : Nat) return AD_Type; Var : in Variable; Control : in Control_Type; Q : in Real_Vector; F : out Sparse_Vector; J : out Sparse_Matrix); function Collocation (Lagrangian : not null access function (X : Real_Vector; N : Nat) return AD_Type; Var : in Variable; Control : in out Control_Type) return Real_Vector with Pre => Is_Setup = True; function Bogacki_Shampine (Hamiltonian : not null access function (X : Real_Vector; N : Nat) return AD_Type; Var : in Variable; Control : in out Control_Type) return Real_Vector; procedure Update (Hamiltonian : not null access function (X : Real_Vector; N : Nat) return AD_Type; Var : in out Variable; Control : in out Control_Type); procedure Print_Data (Var : in Variable; Hamiltonian : not null access function (X : Real_Vector; N : Nat) return AD_Type); procedure Print_XYZ (File : in File_Type; Var : in Variable); procedure Print_Data_L (File : in File_Type; Var : in Variable); procedure Setup (N : in Nat; K : in Nat); function Is_Setup return Boolean; private MatA, MatB, MatC, MatD : Sparse_Matrix; end Auto_Differentiation.Integrator;
pragma License (Unrestricted); -- implementation unit specialized for Darwin with Ada.Directories.Volumes; package System.Native_Directories.File_Names is -- compare file names with normalization and case-insensitive, if HFS+ function Equal_File_Names ( FS : Ada.Directories.Volumes.File_System; Left, Right : String) return Boolean; function Less_File_Names ( FS : Ada.Directories.Volumes.File_System; Left, Right : String) return Boolean; end System.Native_Directories.File_Names;
---------------------------------------------------------------- -- ZLib for Ada thick binding. -- -- -- -- Copyright (C) 2002-2003 Dmitriy Anisimkov -- -- -- -- Open source license information is in the zlib.ads file. -- ---------------------------------------------------------------- -- $Id: read.adb,v 1.7 2003/08/12 12:12:35 vagul Exp $ -- Test/demo program for the generic read interface. with Ada.Numerics.Discrete_Random; with Ada.Streams; with Ada.Text_IO; with ZLib; procedure Read is use Ada.Streams; ------------------------------------ -- Test configuration parameters -- ------------------------------------ File_Size : Stream_Element_Offset := 100_000; Continuous : constant Boolean := False; -- If this constant is True, the test would be repeated again and again, -- with increment File_Size for every iteration. Header : constant ZLib.Header_Type := ZLib.Default; -- Do not use Header other than Default in ZLib versions 1.1.4 and older. Init_Random : constant := 8; -- We are using the same random sequence, in case of we catch bug, -- so we would be able to reproduce it. -- End -- Pack_Size : Stream_Element_Offset; Offset : Stream_Element_Offset; Filter : ZLib.Filter_Type; subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#; package Random_Elements is new Ada.Numerics.Discrete_Random (Visible_Symbols); Gen : Random_Elements.Generator; Period : constant Stream_Element_Offset := 200; -- Period constant variable for random generator not to be very random. -- Bigger period, harder random. Read_Buffer : Stream_Element_Array (1 .. 2048); Read_First : Stream_Element_Offset; Read_Last : Stream_Element_Offset; procedure Reset; procedure Read (Item : out Stream_Element_Array; Last : out Stream_Element_Offset); -- this procedure is for generic instantiation of -- ZLib.Read -- reading data from the File_In. procedure Read is new ZLib.Read (Read, Read_Buffer, Read_First, Read_Last); ---------- -- Read -- ---------- procedure Read (Item : out Stream_Element_Array; Last : out Stream_Element_Offset) is begin Last := Stream_Element_Offset'Min (Item'Last, Item'First + File_Size - Offset); for J in Item'First .. Last loop if J < Item'First + Period then Item (J) := Random_Elements.Random (Gen); else Item (J) := Item (J - Period); end if; Offset := Offset + 1; end loop; end Read; ----------- -- Reset -- ----------- procedure Reset is begin Random_Elements.Reset (Gen, Init_Random); Pack_Size := 0; Offset := 1; Read_First := Read_Buffer'Last + 1; end Reset; begin Ada.Text_IO.Put_Line ("ZLib " & ZLib.Version); loop for Level in ZLib.Compression_Level'Range loop Ada.Text_IO.Put ("Level =" & ZLib.Compression_Level'Image (Level)); -- Deflate using generic instantiation. ZLib.Deflate_Init (Filter, Level, Header => Header); Reset; Ada.Text_IO.Put (Stream_Element_Offset'Image (File_Size) & " ->"); loop declare Buffer : Stream_Element_Array (1 .. 1024); Last : Stream_Element_Offset; begin Read (Filter, Buffer, Last); Pack_Size := Pack_Size + Last - Buffer'First + 1; exit when Last < Buffer'Last; end; end loop; Ada.Text_IO.Put_Line (Stream_Element_Offset'Image (Pack_Size)); ZLib.Close (Filter); end loop; exit when not Continuous; File_Size := File_Size + 1; end loop; end Read;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_get_mapfv_reply_t is -- Item -- type Item is record response_type : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; sequence : aliased Interfaces.Unsigned_16; length : aliased Interfaces.Unsigned_32; pad1 : aliased swig.int8_t_Array (0 .. 3); n : aliased Interfaces.Unsigned_32; datum : aliased xcb.xcb_glx_float32_t; pad2 : aliased swig.int8_t_Array (0 .. 11); end record; -- Item_Array -- type Item_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_mapfv_reply_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_mapfv_reply_t.Item, Element_Array => xcb.xcb_glx_get_mapfv_reply_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_mapfv_reply_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_mapfv_reply_t.Pointer, Element_Array => xcb.xcb_glx_get_mapfv_reply_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_get_mapfv_reply_t;
-- Copyright 2005-2015 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. procedure First is procedure Break_Me is begin null; end Break_Me; begin Break_Me; end First;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . R A N D O M _ N U M B E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2007-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Extended pseudo-random number generation -- This package provides a type representing pseudo-random number generators, -- and subprograms to extract various uniform distributions of numbers -- from them. It also provides types for representing initialization values -- and snapshots of internal generator state, which permit reproducible -- pseudo-random streams. -- The generator currently provided by this package has an extremely long -- period (at least 2**19937-1), and passes the Big Crush test suite, with the -- exception of the two linear complexity tests. Therefore, it is suitable -- for simulations, but should not be used as a cryptographic pseudo-random -- source without additional processing. -- Note: this package is in the System hierarchy so that it can be directly -- used by other predefined packages. User access to this package is via -- the package GNAT.Random_Numbers (file g-rannum.ads), which also extends -- its capabilities. The interfaces are different so as to include in -- System.Random_Numbers only the definitions necessary to implement the -- standard random-number packages Ada.Numerics.Float_Random and -- Ada.Numerics.Discrete_Random. -- Note: this package is marked SPARK_Mode Off, because functions Random work -- by side-effect to change the value of the generator, hence they should not -- be called from SPARK code. with Interfaces; private with Ada.Strings.Text_Output; package System.Random_Numbers with SPARK_Mode => Off is type Generator is limited private; -- Generator encodes the current state of a random number stream, it is -- provided as input to produce the next random number, and updated so -- that it is ready to produce the next one. type State is private; -- A non-limited version of a Generator's internal state function Random (Gen : Generator) return Float; function Random (Gen : Generator) return Long_Float; -- Return pseudo-random numbers uniformly distributed on [0.0 .. 1.0) function Random (Gen : Generator) return Interfaces.Unsigned_32; function Random (Gen : Generator) return Interfaces.Unsigned_64; -- Return pseudo-random numbers uniformly distributed on T'First .. T'Last -- for builtin integer types. generic type Result_Subtype is (<>); Default_Min : Result_Subtype := Result_Subtype'Val (0); function Random_Discrete (Gen : Generator; Min : Result_Subtype := Default_Min; Max : Result_Subtype := Result_Subtype'Last) return Result_Subtype; -- Returns pseudo-random numbers uniformly distributed on Min .. Max generic type Result_Subtype is digits <>; function Random_Float (Gen : Generator) return Result_Subtype; -- Returns pseudo-random numbers uniformly distributed on [0 .. 1) type Initialization_Vector is array (Integer range <>) of Interfaces.Unsigned_32; -- Provides the most general initialization values for a generator (used -- in Reset). In general, there is little point in providing more than -- a certain number of values (currently 624). procedure Reset (Gen : Generator); -- Re-initialize the state of Gen from the time of day procedure Reset (Gen : Generator; Initiator : Initialization_Vector); procedure Reset (Gen : Generator; Initiator : Interfaces.Integer_32); procedure Reset (Gen : Generator; Initiator : Interfaces.Unsigned_32); procedure Reset (Gen : Generator; Initiator : Integer); -- Re-initialize Gen based on the Initiator in various ways. Identical -- values of Initiator cause identical sequences of values. procedure Reset (Gen : Generator; From_State : Generator); -- Causes the state of Gen to be identical to that of From_State; Gen -- and From_State will produce identical sequences of values subsequently. procedure Reset (Gen : Generator; From_State : State); procedure Save (Gen : Generator; To_State : out State); -- The sequence -- Save (Gen2, S); Reset (Gen1, S) -- has the same effect as Reset (Gen2, Gen1). procedure Reset (Gen : Generator; From_Image : String); function Image (Gen : Generator) return String; -- The call -- Reset (Gen2, Image (Gen1)) -- has the same effect as Reset (Gen2, Gen1); Max_Image_Width : constant := 11 * 624; -- Maximum possible length of result of Image (...) function Image (Of_State : State) return String; -- A String representation of Of_State. Identical to the result of -- Image (Gen), if Of_State has been set with Save (Gen, Of_State). function Value (Coded_State : String) return State; -- Inverse of Image on States private N : constant := 624; -- The number of 32-bit integers in the shift register M : constant := 397; -- Feedback distance from the current position subtype State_Val is Interfaces.Unsigned_32; type State is array (0 .. N - 1) of State_Val with Put_Image => Put_Image; procedure Put_Image (S : in out Ada.Strings.Text_Output.Sink'Class; V : State); type Writable_Access (Self : access Generator) is limited null record; -- Auxiliary type to make Generator a self-referential type type Generator is limited record Writable : Writable_Access (Generator'Access); -- This self reference allows functions to modify Generator arguments S : State := (others => 0); -- The shift register, a circular buffer I : Integer := N; -- Current starting position in shift register S (N means uninitialized) -- We should avoid using the identifier I here ??? end record; end System.Random_Numbers;
----------------------------------------------------------------------- -- package Predictor_1, 17th order Predictor-Corrector integrator -- Copyright (C) 2008-2018 Jonathan S. Parker. -- -- Permission to use, copy, modify, and/or distribute this software for any -- purpose with or without fee is hereby granted, provided that the above -- copyright notice and this permission notice appear in all copies. -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ------------------------------------------------------------------------ -- PACKAGE Predictor_1 -- -- Procedure Integrate is a 17th order Predictor-Corrector integration -- routine for solving dY/dt = F (t, Y). The independent variable is -- t (e.g. time), vector Y is the dependent variable, and F is -- some function. -- -- The Predictor-Corrector method uses least-squares to fit a 17th -- order polynomial to the 33 previous values of F in dY/dt = F(t,Y). -- Least-squares-fit polynomials are then used to predict and -- correct the next values of F and Y. -- -- NOTES ON USE -- -- The following version assumes that the Dynamical Variable is -- a 1 dimensional array of Real numbers. -- -- To use this routine higher order differential equations have to -- be reduced to 1st order equations. -- For example a 3rd order equation in X becomes a first order -- equation in the vector Y = (Y1,Y2,Y3) = (X, dX/dt, d/dt(dX/dt)). -- If the equation in X is (d/dt)**3 X = G(t,X), then the -- equation in vector Y is -- -- d/dt (Y1, Y2, Y3) = (Y2, Y3, G(t,Y1)). -- -- If the equation in X is d/dt(d/dt(dX/dt))) = G(t,X,dX/dt), -- then the equation in Y is -- -- d/dt (Y1, Y2, Y3) = (Y2, Y3, G(t,Y1,Y2)). -- -- So the routine solves the equation dY/dt = F(t,Y), or, more -- explicitly, d/dt (Y1, Y2, Y3) = (Y2, Y3, G(t,Y1,Y2)) = F(t,Y). -- The user plugs in the function F(t,Y) as a generic formal function. -- Even if F is t or Y independent, it must be in the form F(t,Y). -- The user has to do all of the work to convert higher order -- equations to first order equations. On some compilers, -- performance is very sensitive to how this is done. That's -- why this part is best left to the user. I've seen factors of -- 3 improvement in speed when this part of the data structure -- is optimized. A pragma Inline is also worth trying. -- The generic formal parameters "+" and "*" below should be -- compiled Inline. generic type Real is digits <>; -- The independent variable. It's called Time -- throughout the package as though the differential -- equation dY/dt = F (t, Y) were time dependent. Of cource -- it can have any meaning. type Dyn_Index is range <>; type Dynamical_Variable is array(Dyn_Index) of Real; -- The dependent variable. -- We require its exact form here so that some inner loop -- optimizations can be performed below. -- -- To use this routine one must reduce higher order differential -- Equations to 1st order. -- For example a 3rd order equation in X becomes a first order -- equation in the vector Y = (X, dX/dt, d/dt(dX/dt)). with function F (Time : Real; Y : Dynamical_Variable) return Dynamical_Variable is <>; -- Defines the equation to be integrated as -- dY/dt = F (t, Y). Even if the equation is t or Y -- independent, it must be entered in this form. with function "*" (Left : Real; Right : Dynamical_Variable) return Dynamical_Variable is <>; -- Defines multiplication of the independent by the -- dependent variable. An operation of this sort must exist by -- definition of the derivative, dY/dt = (Y(t+dt) - Y(t)) / dt, -- which requires multiplication of the (inverse) independent -- variable t, by the Dynamical variable Y (the dependent variable). with function "+" (Left : Dynamical_Variable; Right : Dynamical_Variable) return Dynamical_Variable is <>; -- Defines summation of the dependent variable. Again, this -- operation must exist by the definition of the derivative, -- dY/dt = (Y(t+dt) - Y(t)) / dt = (Y(t+dt) + (-1)*Y(t)) / dt. with function "-" (Left : Dynamical_Variable; Right : Dynamical_Variable) return Dynamical_Variable is <>; with function Norm (Y1: in Dynamical_Variable) return Real is <>; -- not used yet. package Predictor_1 is type Step_Integer is range 1 .. 2**31-1; procedure Integrate (Final_State : out Dynamical_Variable; Final_Time : in Real; Initial_State : in Dynamical_Variable; Initial_Time : in Real; No_Of_Steps : in Step_Integer); -- You must init. all elements of array Initial_State. -- -- The 1st 32 steps use an 8th order Runge-Kutta to initialize -- an array, so if No_Of_Steps < 33 then you are using the -- Runge-Kutta to do the integration. No_Of_Corrector_Evaluate_Iterations : constant Positive := 1; -- Notice there has to be at least 1 Correction step. That means -- this is always a predictor-corrector method. 1 usually best here. Final_Corrector_Desired : constant Boolean := True; Extrapolation_Desired : constant Boolean := True; end Predictor_1;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . S T A C K _ C H E C K I N G . O P E R A T I O N S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1999-2020, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides a implementation of stack checking operations using -- comparison with stack base and limit. pragma Restrictions (No_Elaboration_Code); -- We want to guarantee the absence of elaboration code because the binder -- does not handle references to this package. with System.Storage_Elements; package System.Stack_Checking.Operations is pragma Preelaborate; procedure Update_Stack_Cache (Stack : Stack_Access); -- Set the stack cache for the current task. Note that this is only for -- optimization purposes, nothing can be assumed about the contents of the -- cache at any time, see Set_Stack_Info. -- -- The stack cache should contain the bounds of the current task. But -- because the RTS is not aware of task switches, the stack cache may be -- incorrect. So when the stack pointer is not within the bounds of the -- stack cache, Stack_Check first update the cache (which is a costly -- operation hence the need of a cache). procedure Invalidate_Stack_Cache (Any_Stack : Stack_Access); -- Invalidate cache entries for the task T that owns Any_Stack. This causes -- the Set_Stack_Info function to be called during the next stack check -- done by T. This can be used to interrupt task T asynchronously. -- Stack_Check should be called in loops for this to work reliably. function Stack_Check (Stack_Address : System.Address) return Stack_Access; -- This version of Stack_Check should not be inlined procedure Notify_Stack_Attributes (Initial_SP : System.Address; Size : System.Storage_Elements.Storage_Offset); -- Register Initial_SP as the initial stack pointer value for the current -- task when it starts and Size as the associated stack area size. This -- should be called once, after the soft-links have been initialized and -- prior to the first "Stack_Check" call. private Cache : aliased Stack_Access := Null_Stack; pragma Export (C, Cache, "_gnat_stack_cache"); pragma Export (C, Stack_Check, "_gnat_stack_check"); end System.Stack_Checking.Operations;
-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired) -- -- Copyright William A. Whitaker (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. separate (Latin_Utils.Inflections_Package) package body Tackon_Record_IO is --------------------------------------------------------------------------- procedure Get (File : in File_Type; Item : out Tackon_Record) is pragma Unreferenced (File); begin Item := Null_Tackon_Record; end Get; --------------------------------------------------------------------------- procedure Get (Item : out Tackon_Record) is begin Item := Null_Tackon_Record; end Get; --------------------------------------------------------------------------- procedure Put (File : in File_Type; Item : in Tackon_Record) is begin null; end Put; --------------------------------------------------------------------------- procedure Put (Item : in Tackon_Record) is begin null; end Put; --------------------------------------------------------------------------- procedure Get (Source : in String; Target : out Tackon_Record; Last : out Integer ) is begin Target := Null_Tackon_Record; Last := Source'First - 1; end Get; --------------------------------------------------------------------------- procedure Put (Target : out String; Item : in Tackon_Record) is pragma Unreferenced (Item); begin Target := (others => ' '); end Put; --------------------------------------------------------------------------- end Tackon_Record_IO;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . D E B U G _ P O O L S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Exceptions.Traceback; with GNAT.IO; use GNAT.IO; with System.Address_Image; with System.Memory; use System.Memory; with System.Soft_Links; use System.Soft_Links; with System.Traceback_Entries; use System.Traceback_Entries; with GNAT.HTable; with GNAT.Traceback; use GNAT.Traceback; with Ada.Unchecked_Conversion; package body GNAT.Debug_Pools is Default_Alignment : constant := Standard'Maximum_Alignment; -- Alignment used for the memory chunks returned by Allocate. Using this -- value garantees that this alignment will be compatible with all types -- and at the same time makes it easy to find the location of the extra -- header allocated for each chunk. Initial_Memory_Size : constant Storage_Offset := 2 ** 26; -- 64 Mb -- Initial size of memory that the debug pool can handle. This is used to -- compute the size of the htable used to monitor the blocks, but this is -- dynamic and will grow as needed. Having a bigger size here means a -- longer setup time, but less time spent later on to grow the array. Max_Ignored_Levels : constant Natural := 10; -- Maximum number of levels that will be ignored in backtraces. This is so -- that we still have enough significant levels in the tracebacks returned -- to the user. -- -- The value 10 is chosen as being greater than the maximum callgraph -- in this package. Its actual value is not really relevant, as long as it -- is high enough to make sure we still have enough frames to return to -- the user after we have hidden the frames internal to this package. --------------------------- -- Back Trace Hash Table -- --------------------------- -- This package needs to store one set of tracebacks for each allocation -- point (when was it allocated or deallocated). This would use too much -- memory, so the tracebacks are actually stored in a hash table, and -- we reference elements in this hash table instead. -- This hash-table will remain empty if the discriminant Stack_Trace_Depth -- for the pools is set to 0. -- This table is a global table, that can be shared among all debug pools -- with no problems. type Header is range 1 .. 1023; -- Number of elements in the hash-table type Tracebacks_Array_Access is access GNAT.Traceback.Tracebacks_Array; type Traceback_Kind is (Alloc, Dealloc, Indirect_Alloc, Indirect_Dealloc); type Traceback_Htable_Elem; type Traceback_Htable_Elem_Ptr is access Traceback_Htable_Elem; type Traceback_Htable_Elem is record Traceback : Tracebacks_Array_Access; Kind : Traceback_Kind; Count : Natural; Total : Byte_Count; Next : Traceback_Htable_Elem_Ptr; end record; -- Subprograms used for the Backtrace_Htable instantiation procedure Set_Next (E : Traceback_Htable_Elem_Ptr; Next : Traceback_Htable_Elem_Ptr); pragma Inline (Set_Next); function Next (E : Traceback_Htable_Elem_Ptr) return Traceback_Htable_Elem_Ptr; pragma Inline (Next); function Get_Key (E : Traceback_Htable_Elem_Ptr) return Tracebacks_Array_Access; pragma Inline (Get_Key); function Hash (T : Tracebacks_Array_Access) return Header; pragma Inline (Hash); function Equal (K1, K2 : Tracebacks_Array_Access) return Boolean; -- Why is this not inlined??? -- The hash table for back traces package Backtrace_Htable is new GNAT.HTable.Static_HTable (Header_Num => Header, Element => Traceback_Htable_Elem, Elmt_Ptr => Traceback_Htable_Elem_Ptr, Null_Ptr => null, Set_Next => Set_Next, Next => Next, Key => Tracebacks_Array_Access, Get_Key => Get_Key, Hash => Hash, Equal => Equal); ----------------------- -- Allocations table -- ----------------------- type Allocation_Header; type Allocation_Header_Access is access Allocation_Header; type Traceback_Ptr_Or_Address is new System.Address; -- A type that acts as a C union, and is either a System.Address or a -- Traceback_Htable_Elem_Ptr. -- The following record stores extra information that needs to be -- memorized for each block allocated with the special debug pool. type Allocation_Header is record Allocation_Address : System.Address; -- Address of the block returned by malloc, possibly unaligned Block_Size : Storage_Offset; -- Needed only for advanced freeing algorithms (traverse all allocated -- blocks for potential references). This value is negated when the -- chunk of memory has been logically freed by the application. This -- chunk has not been physically released yet. Alloc_Traceback : Traceback_Htable_Elem_Ptr; -- ??? comment required Dealloc_Traceback : Traceback_Ptr_Or_Address; -- Pointer to the traceback for the allocation (if the memory chunk is -- still valid), or to the first deallocation otherwise. Make sure this -- is a thin pointer to save space. -- -- Dealloc_Traceback is also for blocks that are still allocated to -- point to the previous block in the list. This saves space in this -- header, and make manipulation of the lists of allocated pointers -- faster. Next : System.Address; -- Point to the next block of the same type (either allocated or -- logically freed) in memory. This points to the beginning of the user -- data, and does not include the header of that block. end record; function Header_Of (Address : System.Address) return Allocation_Header_Access; pragma Inline (Header_Of); -- Return the header corresponding to a previously allocated address function To_Address is new Ada.Unchecked_Conversion (Traceback_Ptr_Or_Address, System.Address); function To_Address is new Ada.Unchecked_Conversion (System.Address, Traceback_Ptr_Or_Address); function To_Traceback is new Ada.Unchecked_Conversion (Traceback_Ptr_Or_Address, Traceback_Htable_Elem_Ptr); function To_Traceback is new Ada.Unchecked_Conversion (Traceback_Htable_Elem_Ptr, Traceback_Ptr_Or_Address); Header_Offset : constant Storage_Count := Default_Alignment * ((Allocation_Header'Size / System.Storage_Unit + Default_Alignment - 1) / Default_Alignment); -- Offset of user data after allocation header Minimum_Allocation : constant Storage_Count := Default_Alignment - 1 + Header_Offset; -- Minimal allocation: size of allocation_header rounded up to next -- multiple of default alignment + worst-case padding. ----------------------- -- Allocations table -- ----------------------- -- This table is indexed on addresses modulo Default_Alignment, and for -- each index it indicates whether that memory block is valid. Its behavior -- is similar to GNAT.Table, except that we need to pack the table to save -- space, so we cannot reuse GNAT.Table as is. -- This table is the reason why all alignments have to be forced to common -- value (Default_Alignment), so that this table can be kept to a -- reasonnable size. type Byte is mod 2 ** System.Storage_Unit; Big_Table_Size : constant Storage_Offset := (Storage_Offset'Last - 1) / Default_Alignment; type Big_Table is array (0 .. Big_Table_Size) of Byte; -- A simple, flat-array type used to access memory bytes (see the comment -- for Valid_Blocks below). -- -- It would be cleaner to represent this as a packed array of Boolean. -- However, we cannot specify pragma Pack for such an array, since the -- total size on a 64 bit machine would be too big (> Integer'Last). -- -- Given an address, we know if it is under control of the debug pool if -- the byte at index: -- ((Address - Edata'Address) / Default_Alignment) -- / Storage_unit -- has the bit -- ((Address - Edata'Address) / Default_Alignment) -- mod Storage_Unit -- set to 1. -- -- See the subprograms Is_Valid and Set_Valid for proper manipulation of -- this array. type Table_Ptr is access Big_Table; function To_Pointer is new Ada.Unchecked_Conversion (System.Address, Table_Ptr); Valid_Blocks : Table_Ptr := null; Valid_Blocks_Size : Storage_Offset := 0; -- These two variables represents a mapping of the currently allocated -- memory. Every time the pool works on an address, we first check that the -- index Address / Default_Alignment is True. If not, this means that this -- address is not under control of the debug pool and thus this is probably -- an invalid memory access (it could also be a general access type). -- -- Note that in fact we never allocate the full size of Big_Table, only a -- slice big enough to manage the currently allocated memory. Edata : System.Address := System.Null_Address; -- Address in memory that matches the index 0 in Valid_Blocks. It is named -- after the symbol _edata, which, on most systems, indicate the lowest -- possible address returned by malloc. Unfortunately, this symbol doesn't -- exist on windows, so we cannot use it instead of this variable. ----------------------- -- Local subprograms -- ----------------------- function Find_Or_Create_Traceback (Pool : Debug_Pool; Kind : Traceback_Kind; Size : Storage_Count; Ignored_Frame_Start : System.Address; Ignored_Frame_End : System.Address) return Traceback_Htable_Elem_Ptr; -- Return an element matching the current traceback (omitting the frames -- that are in the current package). If this traceback already existed in -- the htable, a pointer to this is returned to spare memory. Null is -- returned if the pool is set not to store tracebacks. If the traceback -- already existed in the table, the count is incremented so that -- Dump_Tracebacks returns useful results. All addresses up to, and -- including, an address between Ignored_Frame_Start .. Ignored_Frame_End -- are ignored. procedure Put_Line (Depth : Natural; Traceback : Tracebacks_Array_Access; Ignored_Frame_Start : System.Address := System.Null_Address; Ignored_Frame_End : System.Address := System.Null_Address); -- Print Traceback to Standard_Output. If Traceback is null, print the -- call_chain at the current location, up to Depth levels, ignoring all -- addresses up to the first one in the range -- Ignored_Frame_Start .. Ignored_Frame_End function Is_Valid (Storage : System.Address) return Boolean; pragma Inline (Is_Valid); -- Return True if Storage is an address that the debug pool has under its -- control. procedure Set_Valid (Storage : System.Address; Value : Boolean); pragma Inline (Set_Valid); -- Mark the address Storage as being under control of the memory pool (if -- Value is True), or not (if Value is False). This procedure will -- reallocate the table Valid_Blocks as needed. procedure Set_Dead_Beef (Storage_Address : System.Address; Size_In_Storage_Elements : Storage_Count); -- Set the contents of the memory block pointed to by Storage_Address to -- the 16#DEADBEEF# pattern. If Size_In_Storage_Elements is not a multiple -- of the length of this pattern, the last instance may be partial. procedure Free_Physically (Pool : in out Debug_Pool); -- Start to physically release some memory to the system, until the amount -- of logically (but not physically) freed memory is lower than the -- expected amount in Pool. procedure Allocate_End; procedure Deallocate_End; procedure Dereference_End; -- These procedures are used as markers when computing the stacktraces, -- so that addresses in the debug pool itself are not reported to the user. Code_Address_For_Allocate_End : System.Address; Code_Address_For_Deallocate_End : System.Address; Code_Address_For_Dereference_End : System.Address; -- Taking the address of the above procedures will not work on some -- architectures (HPUX and VMS for instance). Thus we do the same thing -- that is done in a-except.adb, and get the address of labels instead procedure Skip_Levels (Depth : Natural; Trace : Tracebacks_Array; Start : out Natural; Len : in out Natural; Ignored_Frame_Start : System.Address; Ignored_Frame_End : System.Address); -- Set Start .. Len to the range of values from Trace that should be output -- to the user. This range of values exludes any address prior to the first -- one in Ignored_Frame_Start .. Ignored_Frame_End (basically addresses -- internal to this package). Depth is the number of levels that the user -- is interested in. --------------- -- Header_Of -- --------------- function Header_Of (Address : System.Address) return Allocation_Header_Access is function Convert is new Ada.Unchecked_Conversion (System.Address, Allocation_Header_Access); begin return Convert (Address - Header_Offset); end Header_Of; -------------- -- Set_Next -- -------------- procedure Set_Next (E : Traceback_Htable_Elem_Ptr; Next : Traceback_Htable_Elem_Ptr) is begin E.Next := Next; end Set_Next; ---------- -- Next -- ---------- function Next (E : Traceback_Htable_Elem_Ptr) return Traceback_Htable_Elem_Ptr is begin return E.Next; end Next; ----------- -- Equal -- ----------- function Equal (K1, K2 : Tracebacks_Array_Access) return Boolean is use Ada.Exceptions.Traceback; begin return K1.all = K2.all; end Equal; ------------- -- Get_Key -- ------------- function Get_Key (E : Traceback_Htable_Elem_Ptr) return Tracebacks_Array_Access is begin return E.Traceback; end Get_Key; ---------- -- Hash -- ---------- function Hash (T : Tracebacks_Array_Access) return Header is Result : Integer_Address := 0; begin for X in T'Range loop Result := Result + To_Integer (PC_For (T (X))); end loop; return Header (1 + Result mod Integer_Address (Header'Last)); end Hash; -------------- -- Put_Line -- -------------- procedure Put_Line (Depth : Natural; Traceback : Tracebacks_Array_Access; Ignored_Frame_Start : System.Address := System.Null_Address; Ignored_Frame_End : System.Address := System.Null_Address) is procedure Print (Tr : Tracebacks_Array); -- Print the traceback to standard_output ----------- -- Print -- ----------- procedure Print (Tr : Tracebacks_Array) is begin for J in Tr'Range loop Put ("0x" & Address_Image (PC_For (Tr (J))) & ' '); end loop; Put (ASCII.LF); end Print; -- Start of processing for Put_Line begin if Traceback = null then declare Tr : aliased Tracebacks_Array (1 .. Depth + Max_Ignored_Levels); Start, Len : Natural; begin Call_Chain (Tr, Len); Skip_Levels (Depth, Tr, Start, Len, Ignored_Frame_Start, Ignored_Frame_End); Print (Tr (Start .. Len)); end; else Print (Traceback.all); end if; end Put_Line; ----------------- -- Skip_Levels -- ----------------- procedure Skip_Levels (Depth : Natural; Trace : Tracebacks_Array; Start : out Natural; Len : in out Natural; Ignored_Frame_Start : System.Address; Ignored_Frame_End : System.Address) is begin Start := Trace'First; while Start <= Len and then (PC_For (Trace (Start)) < Ignored_Frame_Start or else PC_For (Trace (Start)) > Ignored_Frame_End) loop Start := Start + 1; end loop; Start := Start + 1; -- Just in case: make sure we have a traceback even if Ignore_Till -- wasn't found. if Start > Len then Start := 1; end if; if Len - Start + 1 > Depth then Len := Depth + Start - 1; end if; end Skip_Levels; ------------------------------ -- Find_Or_Create_Traceback -- ------------------------------ function Find_Or_Create_Traceback (Pool : Debug_Pool; Kind : Traceback_Kind; Size : Storage_Count; Ignored_Frame_Start : System.Address; Ignored_Frame_End : System.Address) return Traceback_Htable_Elem_Ptr is begin if Pool.Stack_Trace_Depth = 0 then return null; end if; declare Trace : aliased Tracebacks_Array (1 .. Integer (Pool.Stack_Trace_Depth) + Max_Ignored_Levels); Len, Start : Natural; Elem : Traceback_Htable_Elem_Ptr; begin Call_Chain (Trace, Len); Skip_Levels (Pool.Stack_Trace_Depth, Trace, Start, Len, Ignored_Frame_Start, Ignored_Frame_End); -- Check if the traceback is already in the table Elem := Backtrace_Htable.Get (Trace (Start .. Len)'Unrestricted_Access); -- If not, insert it if Elem = null then Elem := new Traceback_Htable_Elem' (Traceback => new Tracebacks_Array'(Trace (Start .. Len)), Count => 1, Kind => Kind, Total => Byte_Count (Size), Next => null); Backtrace_Htable.Set (Elem); else Elem.Count := Elem.Count + 1; Elem.Total := Elem.Total + Byte_Count (Size); end if; return Elem; end; end Find_Or_Create_Traceback; -------------- -- Is_Valid -- -------------- function Is_Valid (Storage : System.Address) return Boolean is Offset : constant Storage_Offset := (Storage - Edata) / Default_Alignment; Bit : constant Byte := 2 ** Natural (Offset mod System.Storage_Unit); begin return (Storage mod Default_Alignment) = 0 and then Offset >= 0 and then Offset < Valid_Blocks_Size * Storage_Unit and then (Valid_Blocks (Offset / Storage_Unit) and Bit) /= 0; end Is_Valid; --------------- -- Set_Valid -- --------------- procedure Set_Valid (Storage : System.Address; Value : Boolean) is Offset : Storage_Offset; Bit : Byte; Bytes : Storage_Offset; Tmp : constant Table_Ptr := Valid_Blocks; Edata_Align : constant Storage_Offset := Default_Alignment * Storage_Unit; procedure Memset (A : Address; C : Integer; N : size_t); pragma Import (C, Memset, "memset"); procedure Memmove (Dest, Src : Address; N : size_t); pragma Import (C, Memmove, "memmove"); begin -- Allocate, or reallocate, the valid blocks table as needed. We start -- with a size big enough to handle Initial_Memory_Size bytes of memory, -- to avoid too many reallocations. The table will typically be around -- 16Mb in that case, which is still small enough. if Valid_Blocks_Size = 0 then Valid_Blocks_Size := (Initial_Memory_Size / Default_Alignment) / Storage_Unit; Valid_Blocks := To_Pointer (Alloc (size_t (Valid_Blocks_Size))); Edata := Storage; -- Reset the memory using memset, which is much faster than the -- standard Ada code with "when others" Memset (Valid_Blocks.all'Address, 0, size_t (Valid_Blocks_Size)); end if; -- First case : the new address is outside of the current scope of -- Valid_Blocks, before the current start address. We need to reallocate -- the table accordingly. This should be a rare occurence, since in most -- cases, the first allocation will also have the lowest address. But -- there is no garantee... if Storage < Edata then -- The difference between the new Edata and the current one must be -- a multiple of Default_Alignment * Storage_Unit, so that the bit -- representing an address in Valid_Blocks are kept the same. Offset := ((Edata - Storage) / Edata_Align + 1) * Edata_Align; Offset := Offset / Default_Alignment; Bytes := Offset / Storage_Unit; Valid_Blocks := To_Pointer (Alloc (Size => size_t (Valid_Blocks_Size + Bytes))); Memmove (Dest => Valid_Blocks.all'Address + Bytes, Src => Tmp.all'Address, N => size_t (Valid_Blocks_Size)); Memset (A => Valid_Blocks.all'Address, C => 0, N => size_t (Bytes)); Free (Tmp.all'Address); Valid_Blocks_Size := Valid_Blocks_Size + Bytes; -- Take into the account the new start address Edata := Storage - Edata_Align + (Edata - Storage) mod Edata_Align; end if; -- Second case : the new address is outside of the current scope of -- Valid_Blocks, so we have to grow the table as appropriate. -- Note: it might seem more natural for the following statement to -- be written: -- Offset := (Storage - Edata) / Default_Alignment; -- but that won't work since Storage_Offset is signed, and it is -- possible to subtract a small address from a large address and -- get a negative value. This may seem strange, but it is quite -- specifically allowed in the RM, and is what most implementations -- including GNAT actually do. Hence the conversion to Integer_Address -- which is a full range modular type, not subject to this glitch. Offset := Storage_Offset ((To_Integer (Storage) - To_Integer (Edata)) / Default_Alignment); if Offset >= Valid_Blocks_Size * System.Storage_Unit then Bytes := Valid_Blocks_Size; loop Bytes := 2 * Bytes; exit when Offset <= Bytes * System.Storage_Unit; end loop; Valid_Blocks := To_Pointer (Realloc (Ptr => Valid_Blocks.all'Address, Size => size_t (Bytes))); Memset (Valid_Blocks.all'Address + Valid_Blocks_Size, 0, size_t (Bytes - Valid_Blocks_Size)); Valid_Blocks_Size := Bytes; end if; Bit := 2 ** Natural (Offset mod System.Storage_Unit); Bytes := Offset / Storage_Unit; -- Then set the value as valid if Value then Valid_Blocks (Bytes) := Valid_Blocks (Bytes) or Bit; else Valid_Blocks (Bytes) := Valid_Blocks (Bytes) and (not Bit); end if; end Set_Valid; -------------- -- Allocate -- -------------- procedure Allocate (Pool : in out Debug_Pool; Storage_Address : out Address; Size_In_Storage_Elements : Storage_Count; Alignment : Storage_Count) is pragma Unreferenced (Alignment); -- Ignored, we always force 'Default_Alignment type Local_Storage_Array is new Storage_Array (1 .. Size_In_Storage_Elements + Minimum_Allocation); type Ptr is access Local_Storage_Array; -- On some systems, we might want to physically protect pages -- against writing when they have been freed (of course, this is -- expensive in terms of wasted memory). To do that, all we should -- have to do it to set the size of this array to the page size. -- See mprotect(). P : Ptr; Current : Byte_Count; Trace : Traceback_Htable_Elem_Ptr; begin <<Allocate_Label>> Lock_Task.all; -- If necessary, start physically releasing memory. The reason this is -- done here, although Pool.Logically_Deallocated has not changed above, -- is so that we do this only after a series of deallocations (e.g a -- loop that deallocates a big array). If we were doing that in -- Deallocate, we might be physically freeing memory several times -- during the loop, which is expensive. if Pool.Logically_Deallocated > Byte_Count (Pool.Maximum_Logically_Freed_Memory) then Free_Physically (Pool); end if; -- Use standard (ie through malloc) allocations. This automatically -- raises Storage_Error if needed. We also try once more to physically -- release memory, so that even marked blocks, in the advanced scanning, -- are freed. begin P := new Local_Storage_Array; exception when Storage_Error => Free_Physically (Pool); P := new Local_Storage_Array; end; Storage_Address := System.Null_Address + Default_Alignment * (((P.all'Address + Default_Alignment - 1) - System.Null_Address) / Default_Alignment) + Header_Offset; pragma Assert ((Storage_Address - System.Null_Address) mod Default_Alignment = 0); pragma Assert (Storage_Address + Size_In_Storage_Elements <= P.all'Address + P'Length); Trace := Find_Or_Create_Traceback (Pool, Alloc, Size_In_Storage_Elements, Allocate_Label'Address, Code_Address_For_Allocate_End); pragma Warnings (Off); -- Turn warning on alignment for convert call off. We know that in -- fact this conversion is safe since P itself is always aligned on -- Default_Alignment. Header_Of (Storage_Address).all := (Allocation_Address => P.all'Address, Alloc_Traceback => Trace, Dealloc_Traceback => To_Traceback (null), Next => Pool.First_Used_Block, Block_Size => Size_In_Storage_Elements); pragma Warnings (On); -- Link this block in the list of used blocks. This will be used to list -- memory leaks in Print_Info, and for the advanced schemes of -- Physical_Free, where we want to traverse all allocated blocks and -- search for possible references. -- We insert in front, since most likely we'll be freeing the most -- recently allocated blocks first (the older one might stay allocated -- for the whole life of the application). if Pool.First_Used_Block /= System.Null_Address then Header_Of (Pool.First_Used_Block).Dealloc_Traceback := To_Address (Storage_Address); end if; Pool.First_Used_Block := Storage_Address; -- Mark the new address as valid Set_Valid (Storage_Address, True); -- Update internal data Pool.Allocated := Pool.Allocated + Byte_Count (Size_In_Storage_Elements); Current := Pool.Allocated - Pool.Logically_Deallocated - Pool.Physically_Deallocated; if Current > Pool.High_Water then Pool.High_Water := Current; end if; Unlock_Task.all; exception when others => Unlock_Task.all; raise; end Allocate; ------------------ -- Allocate_End -- ------------------ -- DO NOT MOVE, this must be right after Allocate. This is similar to -- what is done in a-except, so that we can hide the traceback frames -- internal to this package procedure Allocate_End is begin <<Allocate_End_Label>> Code_Address_For_Allocate_End := Allocate_End_Label'Address; end Allocate_End; ------------------- -- Set_Dead_Beef -- ------------------- procedure Set_Dead_Beef (Storage_Address : System.Address; Size_In_Storage_Elements : Storage_Count) is Dead_Bytes : constant := 4; type Data is mod 2 ** (Dead_Bytes * 8); for Data'Size use Dead_Bytes * 8; Dead : constant Data := 16#DEAD_BEEF#; type Dead_Memory is array (1 .. Size_In_Storage_Elements / Dead_Bytes) of Data; type Mem_Ptr is access Dead_Memory; type Byte is mod 2 ** 8; for Byte'Size use 8; type Dead_Memory_Bytes is array (0 .. 2) of Byte; type Dead_Memory_Bytes_Ptr is access Dead_Memory_Bytes; function From_Ptr is new Ada.Unchecked_Conversion (System.Address, Mem_Ptr); function From_Ptr is new Ada.Unchecked_Conversion (System.Address, Dead_Memory_Bytes_Ptr); M : constant Mem_Ptr := From_Ptr (Storage_Address); M2 : Dead_Memory_Bytes_Ptr; Modulo : constant Storage_Count := Size_In_Storage_Elements mod Dead_Bytes; begin M.all := (others => Dead); -- Any bytes left (up to three of them) if Modulo /= 0 then M2 := From_Ptr (Storage_Address + M'Length * Dead_Bytes); M2 (0) := 16#DE#; if Modulo >= 2 then M2 (1) := 16#AD#; if Modulo >= 3 then M2 (2) := 16#BE#; end if; end if; end if; end Set_Dead_Beef; --------------------- -- Free_Physically -- --------------------- procedure Free_Physically (Pool : in out Debug_Pool) is type Byte is mod 256; type Byte_Access is access Byte; function To_Byte is new Ada.Unchecked_Conversion (System.Address, Byte_Access); type Address_Access is access System.Address; function To_Address_Access is new Ada.Unchecked_Conversion (System.Address, Address_Access); In_Use_Mark : constant Byte := 16#D#; Free_Mark : constant Byte := 16#F#; Total_Freed : Storage_Count := 0; procedure Reset_Marks; -- Unmark all the logically freed blocks, so that they are considered -- for physical deallocation procedure Mark (H : Allocation_Header_Access; A : System.Address; In_Use : Boolean); -- Mark the user data block starting at A. For a block of size zero, -- nothing is done. For a block with a different size, the first byte -- is set to either "D" (in use) or "F" (free). function Marked (A : System.Address) return Boolean; -- Return true if the user data block starting at A might be in use -- somewhere else procedure Mark_Blocks; -- Traverse all allocated blocks, and search for possible references -- to logically freed blocks. Mark them appropriately procedure Free_Blocks (Ignore_Marks : Boolean); -- Physically release blocks. Only the blocks that haven't been marked -- will be released, unless Ignore_Marks is true. ----------------- -- Free_Blocks -- ----------------- procedure Free_Blocks (Ignore_Marks : Boolean) is Header : Allocation_Header_Access; Tmp : System.Address := Pool.First_Free_Block; Next : System.Address; Previous : System.Address := System.Null_Address; begin while Tmp /= System.Null_Address and then Total_Freed < Pool.Minimum_To_Free loop Header := Header_Of (Tmp); -- If we know, or at least assume, the block is no longer -- reference anywhere, we can free it physically. if Ignore_Marks or else not Marked (Tmp) then declare pragma Suppress (All_Checks); -- Suppress the checks on this section. If they are overflow -- errors, it isn't critical, and we'd rather avoid a -- Constraint_Error in that case. begin -- Note that block_size < zero for freed blocks Pool.Physically_Deallocated := Pool.Physically_Deallocated - Byte_Count (Header.Block_Size); Pool.Logically_Deallocated := Pool.Logically_Deallocated + Byte_Count (Header.Block_Size); Total_Freed := Total_Freed - Header.Block_Size; end; Next := Header.Next; System.Memory.Free (Header.Allocation_Address); Set_Valid (Tmp, False); -- Remove this block from the list if Previous = System.Null_Address then Pool.First_Free_Block := Next; else Header_Of (Previous).Next := Next; end if; Tmp := Next; else Previous := Tmp; Tmp := Header.Next; end if; end loop; end Free_Blocks; ---------- -- Mark -- ---------- procedure Mark (H : Allocation_Header_Access; A : System.Address; In_Use : Boolean) is begin if H.Block_Size /= 0 then if In_Use then To_Byte (A).all := In_Use_Mark; else To_Byte (A).all := Free_Mark; end if; end if; end Mark; ----------------- -- Mark_Blocks -- ----------------- procedure Mark_Blocks is Tmp : System.Address := Pool.First_Used_Block; Previous : System.Address; Last : System.Address; Pointed : System.Address; Header : Allocation_Header_Access; begin -- For each allocated block, check its contents. Things that look -- like a possible address are used to mark the blocks so that we try -- and keep them, for better detection in case of invalid access. -- This mechanism is far from being fool-proof: it doesn't check the -- stacks of the threads, doesn't check possible memory allocated not -- under control of this debug pool. But it should allow us to catch -- more cases. while Tmp /= System.Null_Address loop Previous := Tmp; Last := Tmp + Header_Of (Tmp).Block_Size; while Previous < Last loop -- ??? Should we move byte-per-byte, or consider that addresses -- are always aligned on 4-bytes boundaries ? Let's use the -- fastest for now. Pointed := To_Address_Access (Previous).all; if Is_Valid (Pointed) then Header := Header_Of (Pointed); -- Do not even attempt to mark blocks in use. That would -- screw up the whole application, of course. if Header.Block_Size < 0 then Mark (Header, Pointed, In_Use => True); end if; end if; Previous := Previous + System.Address'Size; end loop; Tmp := Header_Of (Tmp).Next; end loop; end Mark_Blocks; ------------ -- Marked -- ------------ function Marked (A : System.Address) return Boolean is begin return To_Byte (A).all = In_Use_Mark; end Marked; ----------------- -- Reset_Marks -- ----------------- procedure Reset_Marks is Current : System.Address := Pool.First_Free_Block; Header : Allocation_Header_Access; begin while Current /= System.Null_Address loop Header := Header_Of (Current); Mark (Header, Current, False); Current := Header.Next; end loop; end Reset_Marks; -- Start of processing for Free_Physically begin Lock_Task.all; if Pool.Advanced_Scanning then Reset_Marks; -- Reset the mark for each freed block Mark_Blocks; end if; Free_Blocks (Ignore_Marks => not Pool.Advanced_Scanning); -- The contract is that we need to free at least Minimum_To_Free bytes, -- even if this means freeing marked blocks in the advanced scheme if Total_Freed < Pool.Minimum_To_Free and then Pool.Advanced_Scanning then Pool.Marked_Blocks_Deallocated := True; Free_Blocks (Ignore_Marks => True); end if; Unlock_Task.all; exception when others => Unlock_Task.all; raise; end Free_Physically; ---------------- -- Deallocate -- ---------------- procedure Deallocate (Pool : in out Debug_Pool; Storage_Address : Address; Size_In_Storage_Elements : Storage_Count; Alignment : Storage_Count) is pragma Unreferenced (Alignment); Header : constant Allocation_Header_Access := Header_Of (Storage_Address); Valid : Boolean; Previous : System.Address; begin <<Deallocate_Label>> Lock_Task.all; Valid := Is_Valid (Storage_Address); if not Valid then Unlock_Task.all; if Pool.Raise_Exceptions then raise Freeing_Not_Allocated_Storage; else Put ("error: Freeing not allocated storage, at "); Put_Line (Pool.Stack_Trace_Depth, null, Deallocate_Label'Address, Code_Address_For_Deallocate_End); end if; elsif Header.Block_Size < 0 then Unlock_Task.all; if Pool.Raise_Exceptions then raise Freeing_Deallocated_Storage; else Put ("error: Freeing already deallocated storage, at "); Put_Line (Pool.Stack_Trace_Depth, null, Deallocate_Label'Address, Code_Address_For_Deallocate_End); Put (" Memory already deallocated at "); Put_Line (0, To_Traceback (Header.Dealloc_Traceback).Traceback); Put (" Memory was allocated at "); Put_Line (0, Header.Alloc_Traceback.Traceback); end if; else -- Remove this block from the list of used blocks Previous := To_Address (Header_Of (Storage_Address).Dealloc_Traceback); if Previous = System.Null_Address then Pool.First_Used_Block := Header_Of (Pool.First_Used_Block).Next; if Pool.First_Used_Block /= System.Null_Address then Header_Of (Pool.First_Used_Block).Dealloc_Traceback := To_Traceback (null); end if; else Header_Of (Previous).Next := Header_Of (Storage_Address).Next; if Header_Of (Storage_Address).Next /= System.Null_Address then Header_Of (Header_Of (Storage_Address).Next).Dealloc_Traceback := To_Address (Previous); end if; end if; -- Update the header Header.all := (Allocation_Address => Header.Allocation_Address, Alloc_Traceback => Header.Alloc_Traceback, Dealloc_Traceback => To_Traceback (Find_Or_Create_Traceback (Pool, Dealloc, Size_In_Storage_Elements, Deallocate_Label'Address, Code_Address_For_Deallocate_End)), Next => System.Null_Address, Block_Size => -Size_In_Storage_Elements); if Pool.Reset_Content_On_Free then Set_Dead_Beef (Storage_Address, Size_In_Storage_Elements); end if; Pool.Logically_Deallocated := Pool.Logically_Deallocated + Byte_Count (Size_In_Storage_Elements); -- Link this free block with the others (at the end of the list, so -- that we can start releasing the older blocks first later on). if Pool.First_Free_Block = System.Null_Address then Pool.First_Free_Block := Storage_Address; Pool.Last_Free_Block := Storage_Address; else Header_Of (Pool.Last_Free_Block).Next := Storage_Address; Pool.Last_Free_Block := Storage_Address; end if; -- Do not physically release the memory here, but in Alloc. -- See comment there for details. Unlock_Task.all; end if; exception when others => Unlock_Task.all; raise; end Deallocate; -------------------- -- Deallocate_End -- -------------------- -- DO NOT MOVE, this must be right after Deallocate -- See Allocate_End procedure Deallocate_End is begin <<Deallocate_End_Label>> Code_Address_For_Deallocate_End := Deallocate_End_Label'Address; end Deallocate_End; ----------------- -- Dereference -- ----------------- procedure Dereference (Pool : in out Debug_Pool; Storage_Address : Address; Size_In_Storage_Elements : Storage_Count; Alignment : Storage_Count) is pragma Unreferenced (Alignment, Size_In_Storage_Elements); Valid : constant Boolean := Is_Valid (Storage_Address); Header : Allocation_Header_Access; begin -- Locking policy: we do not do any locking in this procedure. The -- tables are only read, not written to, and although a problem might -- appear if someone else is modifying the tables at the same time, this -- race condition is not intended to be detected by this storage_pool (a -- now invalid pointer would appear as valid). Instead, we prefer -- optimum performance for dereferences. <<Dereference_Label>> if not Valid then if Pool.Raise_Exceptions then raise Accessing_Not_Allocated_Storage; else Put ("error: Accessing not allocated storage, at "); Put_Line (Pool.Stack_Trace_Depth, null, Dereference_Label'Address, Code_Address_For_Dereference_End); end if; else Header := Header_Of (Storage_Address); if Header.Block_Size < 0 then if Pool.Raise_Exceptions then raise Accessing_Deallocated_Storage; else Put ("error: Accessing deallocated storage, at "); Put_Line (Pool.Stack_Trace_Depth, null, Dereference_Label'Address, Code_Address_For_Dereference_End); Put (" First deallocation at "); Put_Line (0, To_Traceback (Header.Dealloc_Traceback).Traceback); Put (" Initial allocation at "); Put_Line (0, Header.Alloc_Traceback.Traceback); end if; end if; end if; end Dereference; --------------------- -- Dereference_End -- --------------------- -- DO NOT MOVE: this must be right after Dereference -- See Allocate_End procedure Dereference_End is begin <<Dereference_End_Label>> Code_Address_For_Dereference_End := Dereference_End_Label'Address; end Dereference_End; ---------------- -- Print_Info -- ---------------- procedure Print_Info (Pool : Debug_Pool; Cumulate : Boolean := False; Display_Slots : Boolean := False; Display_Leaks : Boolean := False) is package Backtrace_Htable_Cumulate is new GNAT.HTable.Static_HTable (Header_Num => Header, Element => Traceback_Htable_Elem, Elmt_Ptr => Traceback_Htable_Elem_Ptr, Null_Ptr => null, Set_Next => Set_Next, Next => Next, Key => Tracebacks_Array_Access, Get_Key => Get_Key, Hash => Hash, Equal => Equal); -- This needs a comment ??? probably some of the ones below do too??? Data : Traceback_Htable_Elem_Ptr; Elem : Traceback_Htable_Elem_Ptr; Current : System.Address; Header : Allocation_Header_Access; K : Traceback_Kind; begin Put_Line ("Total allocated bytes : " & Byte_Count'Image (Pool.Allocated)); Put_Line ("Total logically deallocated bytes : " & Byte_Count'Image (Pool.Logically_Deallocated)); Put_Line ("Total physically deallocated bytes : " & Byte_Count'Image (Pool.Physically_Deallocated)); if Pool.Marked_Blocks_Deallocated then Put_Line ("Marked blocks were physically deallocated. This is"); Put_Line ("potentially dangereous, and you might want to run"); Put_Line ("again with a lower value of Minimum_To_Free"); end if; Put_Line ("Current Water Mark: " & Byte_Count'Image (Pool.Allocated - Pool.Logically_Deallocated - Pool.Physically_Deallocated)); Put_Line ("High Water Mark: " & Byte_Count'Image (Pool.High_Water)); Put_Line (""); if Display_Slots then Data := Backtrace_Htable.Get_First; while Data /= null loop if Data.Kind in Alloc .. Dealloc then Elem := new Traceback_Htable_Elem' (Traceback => new Tracebacks_Array'(Data.Traceback.all), Count => Data.Count, Kind => Data.Kind, Total => Data.Total, Next => null); Backtrace_Htable_Cumulate.Set (Elem); if Cumulate then if Data.Kind = Alloc then K := Indirect_Alloc; else K := Indirect_Dealloc; end if; -- Propagate the direct call to all its parents for T in Data.Traceback'First + 1 .. Data.Traceback'Last loop Elem := Backtrace_Htable_Cumulate.Get (Data.Traceback (T .. Data.Traceback'Last)'Unrestricted_Access); -- If not, insert it if Elem = null then Elem := new Traceback_Htable_Elem' (Traceback => new Tracebacks_Array' (Data.Traceback (T .. Data.Traceback'Last)), Count => Data.Count, Kind => K, Total => Data.Total, Next => null); Backtrace_Htable_Cumulate.Set (Elem); -- Properly take into account that the subprograms -- indirectly called might be doing either allocations -- or deallocations. This needs to be reflected in the -- counts. else Elem.Count := Elem.Count + Data.Count; if K = Elem.Kind then Elem.Total := Elem.Total + Data.Total; elsif Elem.Total > Data.Total then Elem.Total := Elem.Total - Data.Total; else Elem.Kind := K; Elem.Total := Data.Total - Elem.Total; end if; end if; end loop; end if; Data := Backtrace_Htable.Get_Next; end if; end loop; Put_Line ("List of allocations/deallocations: "); Data := Backtrace_Htable_Cumulate.Get_First; while Data /= null loop case Data.Kind is when Alloc => Put ("alloc (count:"); when Indirect_Alloc => Put ("indirect alloc (count:"); when Dealloc => Put ("free (count:"); when Indirect_Dealloc => Put ("indirect free (count:"); end case; Put (Natural'Image (Data.Count) & ", total:" & Byte_Count'Image (Data.Total) & ") "); for T in Data.Traceback'Range loop Put ("0x" & Address_Image (PC_For (Data.Traceback (T))) & ' '); end loop; Put_Line (""); Data := Backtrace_Htable_Cumulate.Get_Next; end loop; Backtrace_Htable_Cumulate.Reset; end if; if Display_Leaks then Put_Line (""); Put_Line ("List of not deallocated blocks:"); -- Do not try to group the blocks with the same stack traces -- together. This is done by the gnatmem output. Current := Pool.First_Used_Block; while Current /= System.Null_Address loop Header := Header_Of (Current); Put ("Size: " & Storage_Count'Image (Header.Block_Size) & " at: "); for T in Header.Alloc_Traceback.Traceback'Range loop Put ("0x" & Address_Image (PC_For (Header.Alloc_Traceback.Traceback (T))) & ' '); end loop; Put_Line (""); Current := Header.Next; end loop; end if; end Print_Info; ------------------ -- Storage_Size -- ------------------ function Storage_Size (Pool : Debug_Pool) return Storage_Count is pragma Unreferenced (Pool); begin return Storage_Count'Last; end Storage_Size; --------------- -- Configure -- --------------- procedure Configure (Pool : in out Debug_Pool; Stack_Trace_Depth : Natural := Default_Stack_Trace_Depth; Maximum_Logically_Freed_Memory : SSC := Default_Max_Freed; Minimum_To_Free : SSC := Default_Min_Freed; Reset_Content_On_Free : Boolean := Default_Reset_Content; Raise_Exceptions : Boolean := Default_Raise_Exceptions; Advanced_Scanning : Boolean := Default_Advanced_Scanning) is begin Pool.Stack_Trace_Depth := Stack_Trace_Depth; Pool.Maximum_Logically_Freed_Memory := Maximum_Logically_Freed_Memory; Pool.Reset_Content_On_Free := Reset_Content_On_Free; Pool.Raise_Exceptions := Raise_Exceptions; Pool.Minimum_To_Free := Minimum_To_Free; Pool.Advanced_Scanning := Advanced_Scanning; end Configure; ---------------- -- Print_Pool -- ---------------- procedure Print_Pool (A : System.Address) is Storage : constant Address := A; Valid : constant Boolean := Is_Valid (Storage); Header : Allocation_Header_Access; begin -- We might get Null_Address if the call from gdb was done -- incorrectly. For instance, doing a "print_pool(my_var)" passes 0x0, -- instead of passing the value of my_var if A = System.Null_Address then Put_Line ("Memory not under control of the storage pool"); return; end if; if not Valid then Put_Line ("Memory not under control of the storage pool"); else Header := Header_Of (Storage); Put_Line ("0x" & Address_Image (A) & " allocated at:"); Put_Line (0, Header.Alloc_Traceback.Traceback); if To_Traceback (Header.Dealloc_Traceback) /= null then Put_Line ("0x" & Address_Image (A) & " logically freed memory, deallocated at:"); Put_Line (0, To_Traceback (Header.Dealloc_Traceback).Traceback); end if; end if; end Print_Pool; ----------------------- -- Print_Info_Stdout -- ----------------------- procedure Print_Info_Stdout (Pool : Debug_Pool; Cumulate : Boolean := False; Display_Slots : Boolean := False; Display_Leaks : Boolean := False) is procedure Internal is new Print_Info (Put_Line => GNAT.IO.Put_Line, Put => GNAT.IO.Put); begin Internal (Pool, Cumulate, Display_Slots, Display_Leaks); end Print_Info_Stdout; ------------------ -- Dump_Gnatmem -- ------------------ procedure Dump_Gnatmem (Pool : Debug_Pool; File_Name : String) is type File_Ptr is new System.Address; function fopen (Path : String; Mode : String) return File_Ptr; pragma Import (C, fopen); procedure fwrite (Ptr : System.Address; Size : size_t; Nmemb : size_t; Stream : File_Ptr); procedure fwrite (Str : String; Size : size_t; Nmemb : size_t; Stream : File_Ptr); pragma Import (C, fwrite); procedure fputc (C : Integer; Stream : File_Ptr); pragma Import (C, fputc); procedure fclose (Stream : File_Ptr); pragma Import (C, fclose); Address_Size : constant size_t := System.Address'Max_Size_In_Storage_Elements; -- Size in bytes of a pointer File : File_Ptr; Current : System.Address; Header : Allocation_Header_Access; Actual_Size : size_t; Num_Calls : Integer; Tracebk : Tracebacks_Array_Access; begin File := fopen (File_Name & ASCII.NUL, "wb" & ASCII.NUL); fwrite ("GMEM DUMP" & ASCII.LF, 10, 1, File); -- List of not deallocated blocks (see Print_Info) Current := Pool.First_Used_Block; while Current /= System.Null_Address loop Header := Header_Of (Current); Actual_Size := size_t (Header.Block_Size); Tracebk := Header.Alloc_Traceback.Traceback; Num_Calls := Tracebk'Length; -- (Code taken from memtrack.adb in GNAT's sources) -- Logs allocation call using the format: -- 'A' <mem addr> <size chunk> <len backtrace> <addr1> ... <addrn> fputc (Character'Pos ('A'), File); fwrite (Current'Address, Address_Size, 1, File); fwrite (Actual_Size'Address, size_t'Max_Size_In_Storage_Elements, 1, File); fwrite (Num_Calls'Address, Integer'Max_Size_In_Storage_Elements, 1, File); for J in Tracebk'First .. Tracebk'First + Num_Calls - 1 loop declare Ptr : System.Address := PC_For (Tracebk (J)); begin fwrite (Ptr'Address, Address_Size, 1, File); end; end loop; Current := Header.Next; end loop; fclose (File); end Dump_Gnatmem; begin Allocate_End; Deallocate_End; Dereference_End; end GNAT.Debug_Pools;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2016, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- This package provides a set of convenience routines for putting characters -- and strings out to the LCD. with BMP_Fonts; use BMP_Fonts; with HAL.Bitmap; with HAL.Framebuffer; package LCD_Std_Out is Black : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Black; Blue : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Blue; Light_Blue : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Light_Blue; Green : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Green; Cyan : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Cyan; Gray : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Gray; Magenta : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Magenta; Light_Green : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Light_Green; Brown : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Brown; Red : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Red; Orange : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Orange; Yellow : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.Yellow; White : HAL.Bitmap.Bitmap_Color renames HAL.Bitmap.White; Default_Text_Color : constant HAL.Bitmap.Bitmap_Color := White; Default_Background_Color : constant HAL.Bitmap.Bitmap_Color := Black; Default_Font : constant BMP_Font := Font16x24; -- Default_Orientation : constant LCD.Orientations := LCD.Portrait_2; -- Changes to these current values will appear on subsequent calls to the -- output routines. Current_Text_Color : HAL.Bitmap.Bitmap_Color := Default_Text_Color; Current_Background_Color : HAL.Bitmap.Bitmap_Color := Default_Background_Color; procedure Set_Font (To : BMP_Font); -- Changes the current font setting so that subsequent output is in the -- specified font. procedure Set_Orientation (To : HAL.Framebuffer.Display_Orientation); -- Configures the screen orientation and fills the screen with the current -- background color. All previously displayed content is lost. procedure Clear_Screen; ---------------------------------------------------------------------------- -- These routines maintain a logical line and column, such that text will -- wrap around to the next "line" when necessary, as determined by the -- current orientation of the screen. procedure Put_Line (Msg : String); -- Note: wraps around to the next line if necessary. -- Always calls procedure New_Line automatically after printing the string. procedure Put (Msg : String); -- Note: wraps around to the next line if necessary. procedure Put (Msg : Character); procedure New_Line; -- A subsequent call to Put or Put_Line will start printing characters at -- the beginning of the next line, wrapping around to the top of the LCD -- screen if necessary. ---------------------------------------------------------------------------- -- These routines are provided for convenience, as an alternative to -- using both this package and an instance of Bitmnapped_Drawing directly, -- when wanting both the wrap-around semantics and direct X/Y coordinate -- control. You can combine calls to these routines with the ones above but -- these do not update the logical line/column state, so more likely you -- will use one set or the other. If you only need X/Y coordinate control, -- consider directly using an instance of HAL.Bitmap. procedure Put (X, Y : Natural; Msg : Character); -- Prints the character at the specified location. Has no other effect -- whatsoever, especially none on the state of the current logical line -- or logical column. procedure Put (X, Y : Natural; Msg : String); -- Prints the string, starting at the specified location. Has no other -- effect whatsoever, especially none on the state of the current logical -- line or logical column. Does not wrap around. end LCD_Std_Out;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . O S _ I N T E R F A C E -- -- -- -- S p e c -- -- -- -- Copyright (C) 1995-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is a QNX/Neutrino version of this package -- This package encapsulates all direct interfaces to OS services -- that are needed by the tasking run-time (libgnarl). -- PLEASE DO NOT add any with-clauses to this package or remove the pragma -- Preelaborate. This package is designed to be a bottom-level (leaf) package. with Ada.Unchecked_Conversion; with Interfaces.C; with System.OS_Constants; package System.OS_Interface is pragma Preelaborate; subtype int is Interfaces.C.int; subtype char is Interfaces.C.char; subtype short is Interfaces.C.short; subtype long is Interfaces.C.long; subtype unsigned is Interfaces.C.unsigned; subtype unsigned_short is Interfaces.C.unsigned_short; subtype unsigned_long is Interfaces.C.unsigned_long; subtype unsigned_char is Interfaces.C.unsigned_char; subtype plain_char is Interfaces.C.plain_char; subtype size_t is Interfaces.C.size_t; ----------- -- Errno -- ----------- function errno return int; pragma Import (C, errno, "__get_errno"); EPERM : constant := 1; EINTR : constant := 4; EAGAIN : constant := 11; ENOMEM : constant := 12; EINVAL : constant := 22; ETIMEDOUT : constant := 260; ------------- -- Signals -- ------------- Max_Interrupt : constant := 64; type Signal is new int range 0 .. Max_Interrupt; for Signal'Size use int'Size; SIGHUP : constant := 1; SIGINT : constant := 2; SIGQUIT : constant := 3; SIGILL : constant := 4; SIGTRAP : constant := 5; SIGIOT : constant := 6; SIGABRT : constant := 6; SIGDEADLK : constant := 7; SIGFPE : constant := 8; SIGKILL : constant := 9; SIGBUS : constant := 10; SIGSEGV : constant := 11; SIGSYS : constant := 12; SIGPIPE : constant := 13; SIGALRM : constant := 14; SIGTERM : constant := 15; SIGUSR1 : constant := 16; SIGUSR2 : constant := 17; SIGCLD : constant := 18; SIGCHLD : constant := 18; SIGPWR : constant := 19; SIGWINCH : constant := 20; SIGURG : constant := 21; SIGPOLL : constant := 22; SIGIO : constant := 22; SIGSTOP : constant := 23; SIGTSTP : constant := 24; SIGCONT : constant := 25; SIGTTIN : constant := 26; SIGTTOU : constant := 27; SIGVTALRM : constant := 28; SIGPROF : constant := 29; SIGXCPU : constant := 30; SIGXFSZ : constant := 31; SIGRTMIN : constant := 41; SITRTMAX : constant := 56; SIGSELECT : constant := 57; SIGPHOTON : constant := 58; SIGADAABORT : constant := SIGABRT; -- Change this to use another signal for task abort. SIGTERM might be a -- good one. type Signal_Set is array (Natural range <>) of Signal; Unmasked : constant Signal_Set := ( SIGTRAP, -- To enable debugging on multithreaded applications, mark SIGTRAP to -- be kept unmasked. SIGBUS, SIGTTIN, SIGTTOU, SIGTSTP, -- Keep these three signals unmasked so that background processes and IO -- behaves as normal "C" applications SIGPROF, -- To avoid confusing the profiler SIGKILL, SIGSTOP); -- These two signals actually can't be masked (POSIX won't allow it) Reserved : constant Signal_Set := (SIGABRT, SIGKILL, SIGSTOP, SIGSEGV); type sigset_t is private; function sigaddset (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigaddset, "sigaddset"); function sigdelset (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigdelset, "sigdelset"); function sigfillset (set : access sigset_t) return int; pragma Import (C, sigfillset, "sigfillset"); function sigismember (set : access sigset_t; sig : Signal) return int; pragma Import (C, sigismember, "sigismember"); function sigemptyset (set : access sigset_t) return int; pragma Import (C, sigemptyset, "sigemptyset"); type pad7 is array (1 .. 7) of int; type siginfo_t is record si_signo : int; si_code : int; si_errno : int; X_data : pad7; end record; pragma Convention (C, siginfo_t); type struct_sigaction is record sa_handler : System.Address; sa_flags : int; sa_mask : sigset_t; end record; pragma Convention (C, struct_sigaction); type struct_sigaction_ptr is access all struct_sigaction; SIG_BLOCK : constant := 0; SIG_UNBLOCK : constant := 1; SIG_SETMASK : constant := 2; SIG_PENDING : constant := 5; SA_NOCLDSTOP : constant := 16#0001#; SA_SIGINFO : constant := 16#0002#; SA_RESETHAND : constant := 16#0004#; SA_ONSTACK : constant := 16#0008#; SA_NODEFER : constant := 16#0010#; SA_NOCLDWAIT : constant := 16#0020#; SS_ONSTACK : constant := 1; SS_DISABLE : constant := 2; SIG_DFL : constant := 0; SIG_IGN : constant := 1; function sigaction (sig : Signal; act : struct_sigaction_ptr; oact : struct_sigaction_ptr) return int; pragma Import (C, sigaction, "sigaction"); ---------- -- Time -- ---------- Time_Slice_Supported : constant Boolean := True; -- Indicates whether time slicing is supported type timespec is private; type clockid_t is new int; function clock_gettime (clock_id : clockid_t; tp : access timespec) return int; pragma Import (C, clock_gettime, "clock_gettime"); function clock_getres (clock_id : clockid_t; res : access timespec) return int; pragma Import (C, clock_getres, "clock_getres"); function To_Duration (TS : timespec) return Duration; pragma Inline (To_Duration); function To_Timespec (D : Duration) return timespec; pragma Inline (To_Timespec); ------------------------- -- Priority Scheduling -- ------------------------- SCHED_FIFO : constant := 1; SCHED_RR : constant := 2; SCHED_OTHER : constant := 3; function To_Target_Priority (Prio : System.Any_Priority) return Interfaces.C.int with Inline_Always; -- Maps System.Any_Priority to a POSIX priority ------------- -- Process -- ------------- type pid_t is private; function kill (pid : pid_t; sig : Signal) return int; pragma Import (C, kill, "kill"); function getpid return pid_t; pragma Import (C, getpid, "getpid"); ------------- -- Threads -- ------------- type Thread_Body is access function (arg : System.Address) return System.Address; pragma Convention (C, Thread_Body); function Thread_Body_Access is new Ada.Unchecked_Conversion (System.Address, Thread_Body); type pthread_t is new int; subtype Thread_Id is pthread_t; type pthread_mutex_t is limited private; type pthread_cond_t is limited private; type pthread_attr_t is limited private; type pthread_mutexattr_t is limited private; type pthread_condattr_t is limited private; type pthread_key_t is private; PTHREAD_CREATE_DETACHED : constant := 1; PTHREAD_SCOPE_PROCESS : constant := 4; PTHREAD_SCOPE_SYSTEM : constant := 0; PTHREAD_INHERIT_SCHED : constant := 0; PTHREAD_EXPLICIT_SCHED : constant := 2; -- Read/Write lock not supported on Android. subtype pthread_rwlock_t is pthread_mutex_t; subtype pthread_rwlockattr_t is pthread_mutexattr_t; ----------- -- Stack -- ----------- type stack_t is record ss_sp : System.Address; ss_flags : int; ss_size : size_t; end record; pragma Convention (C, stack_t); function sigaltstack (ss : not null access stack_t; oss : access stack_t) return int with Inline; -- Not supported on QNX Alternate_Stack : aliased System.Address; -- Dummy definition: alternate stack not available due to missing -- sigaltstack in QNX Alternate_Stack_Size : constant := 0; -- This must be kept in sync with init.c:__gnat_alternate_stack Stack_Base_Available : constant Boolean := False; -- Indicates whether the stack base is available on this target function Get_Stack_Base (thread : pthread_t) return System.Address with Inline; -- This is a dummy procedure to share some GNULLI files function Get_Page_Size return int; pragma Import (C, Get_Page_Size, "getpagesize"); -- Returns the size of a page PROT_NONE : constant := 16#00_00#; PROT_READ : constant := 16#01_00#; PROT_WRITE : constant := 16#02_00#; PROT_EXEC : constant := 16#04_00#; PROT_ALL : constant := PROT_READ + PROT_WRITE + PROT_EXEC; PROT_ON : constant := PROT_READ; PROT_OFF : constant := PROT_ALL; function mprotect (addr : Address; len : size_t; prot : int) return int; pragma Import (C, mprotect); --------------------------------------- -- Nonstandard Thread Initialization -- --------------------------------------- procedure pthread_init with Inline_Always; ------------------------- -- POSIX.1c Section 3 -- ------------------------- function sigwait (set : access sigset_t; sig : access Signal) return int; pragma Import (C, sigwait, "sigwait"); function pthread_kill (thread : pthread_t; sig : Signal) return int; pragma Import (C, pthread_kill, "pthread_kill"); function pthread_sigmask (how : int; set : access sigset_t; oset : access sigset_t) return int; pragma Import (C, pthread_sigmask, "pthread_sigmask"); -------------------------- -- POSIX.1c Section 11 -- -------------------------- function pthread_mutexattr_init (attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutexattr_init, "pthread_mutexattr_init"); function pthread_mutexattr_destroy (attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutexattr_destroy, "pthread_mutexattr_destroy"); function pthread_mutex_init (mutex : access pthread_mutex_t; attr : access pthread_mutexattr_t) return int; pragma Import (C, pthread_mutex_init, "pthread_mutex_init"); function pthread_mutex_destroy (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_destroy, "pthread_mutex_destroy"); function pthread_mutex_lock (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_lock, "pthread_mutex_lock"); function pthread_mutex_unlock (mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_mutex_unlock, "pthread_mutex_unlock"); function pthread_mutex_setprioceiling (mutex : access pthread_mutex_t; prioceiling : int; old_ceiling : access int) return int; pragma Import (C, pthread_mutex_setprioceiling); function pthread_condattr_init (attr : access pthread_condattr_t) return int; pragma Import (C, pthread_condattr_init, "pthread_condattr_init"); function pthread_condattr_destroy (attr : access pthread_condattr_t) return int; pragma Import (C, pthread_condattr_destroy, "pthread_condattr_destroy"); function pthread_cond_init (cond : access pthread_cond_t; attr : access pthread_condattr_t) return int; pragma Import (C, pthread_cond_init, "pthread_cond_init"); function pthread_cond_destroy (cond : access pthread_cond_t) return int; pragma Import (C, pthread_cond_destroy, "pthread_cond_destroy"); function pthread_cond_signal (cond : access pthread_cond_t) return int; pragma Import (C, pthread_cond_signal, "pthread_cond_signal"); function pthread_cond_wait (cond : access pthread_cond_t; mutex : access pthread_mutex_t) return int; pragma Import (C, pthread_cond_wait, "pthread_cond_wait"); function pthread_cond_timedwait (cond : access pthread_cond_t; mutex : access pthread_mutex_t; abstime : access timespec) return int; pragma Import (C, pthread_cond_timedwait, "pthread_cond_timedwait"); -------------------------- -- POSIX.1c Section 13 -- -------------------------- PTHREAD_PRIO_INHERIT : constant := 0; PTHREAD_PRIO_NONE : constant := 1; PTHREAD_PRIO_PROTECT : constant := 2; function pthread_mutexattr_setprotocol (attr : access pthread_mutexattr_t; protocol : int) return int; pragma Import (C, pthread_mutexattr_setprotocol); function pthread_mutexattr_getprotocol (attr : access pthread_mutexattr_t; protocol : access int) return int; pragma Import (C, pthread_mutexattr_getprotocol); function pthread_mutexattr_setprioceiling (attr : access pthread_mutexattr_t; prioceiling : int) return int; pragma Import (C, pthread_mutexattr_setprioceiling); function pthread_mutexattr_getprioceiling (attr : access pthread_mutexattr_t; prioceiling : access int) return int; pragma Import (C, pthread_mutexattr_getprioceiling); function pthread_mutex_getprioceiling (attr : access pthread_mutex_t; prioceiling : access int) return int; pragma Import (C, pthread_mutex_getprioceiling); type pad8 is array (1 .. 8) of int; pragma Convention (C, pad8); type struct_sched_param is record sched_priority : int := 0; -- scheduling priority sched_curpriority : int := 0; reserved : pad8 := (others => 0); end record; pragma Convention (C, struct_sched_param); function pthread_setschedparam (thread : pthread_t; policy : int; param : access struct_sched_param) return int; pragma Import (C, pthread_setschedparam, "pthread_setschedparam"); function pthread_getschedparam (thread : pthread_t; policy : access int; param : access struct_sched_param) return int; pragma Import (C, pthread_getschedparam, "pthread_getschedparam"); function pthread_setschedprio (thread : pthread_t; priority : int) return int; pragma Import (C, pthread_setschedprio); function pthread_attr_setschedparam (attr : access pthread_attr_t; param : access struct_sched_param) return int; pragma Import (C, pthread_attr_setschedparam); function pthread_attr_setinheritsched (attr : access pthread_attr_t; inheritsched : int) return int; pragma Import (C, pthread_attr_setinheritsched); function pthread_attr_setscope (attr : access pthread_attr_t; scope : int) return int; pragma Import (C, pthread_attr_setscope, "pthread_attr_setscope"); function pthread_attr_setschedpolicy (attr : access pthread_attr_t; policy : int) return int; pragma Import (C, pthread_attr_setschedpolicy, "pthread_attr_setschedpolicy"); function sched_yield return int; pragma Import (C, sched_yield, "sched_yield"); --------------------------- -- P1003.1c - Section 16 -- --------------------------- function pthread_attr_init (attributes : access pthread_attr_t) return int; pragma Import (C, pthread_attr_init, "pthread_attr_init"); function pthread_attr_destroy (attributes : access pthread_attr_t) return int; pragma Import (C, pthread_attr_destroy, "pthread_attr_destroy"); function pthread_attr_setdetachstate (attr : access pthread_attr_t; detachstate : int) return int; pragma Import (C, pthread_attr_setdetachstate); function pthread_attr_setstacksize (attr : access pthread_attr_t; stacksize : size_t) return int; pragma Import (C, pthread_attr_setstacksize); function pthread_create (thread : access pthread_t; attributes : access pthread_attr_t; start_routine : Thread_Body; arg : System.Address) return int; pragma Import (C, pthread_create, "pthread_create"); procedure pthread_exit (status : System.Address); pragma Import (C, pthread_exit, "pthread_exit"); function pthread_self return pthread_t; pragma Import (C, pthread_self, "pthread_self"); function lwp_self return System.Address; pragma Import (C, lwp_self, "pthread_self"); -------------------------- -- POSIX.1c Section 17 -- -------------------------- function pthread_setspecific (key : pthread_key_t; value : System.Address) return int; pragma Import (C, pthread_setspecific, "pthread_setspecific"); function pthread_getspecific (key : pthread_key_t) return System.Address; pragma Import (C, pthread_getspecific, "pthread_getspecific"); type destructor_pointer is access procedure (arg : System.Address); pragma Convention (C, destructor_pointer); function pthread_key_create (key : access pthread_key_t; destructor : destructor_pointer) return int; pragma Import (C, pthread_key_create, "pthread_key_create"); private type sigset_t is array (1 .. 2) of Interfaces.Unsigned_32; pragma Convention (C, sigset_t); type pid_t is new int; type time_t is new long; type timespec is record tv_sec : time_t; tv_nsec : long; end record; pragma Convention (C, timespec); type unsigned_long_long_t is mod 2 ** 64; -- Local type only used to get the alignment of this type below subtype char_array is Interfaces.C.char_array; type pthread_attr_t is record Data : char_array (1 .. OS_Constants.PTHREAD_ATTR_SIZE); end record; pragma Convention (C, pthread_attr_t); for pthread_attr_t'Alignment use Interfaces.C.unsigned_long'Alignment; type pthread_condattr_t is record Data : char_array (1 .. OS_Constants.PTHREAD_CONDATTR_SIZE); end record; pragma Convention (C, pthread_condattr_t); for pthread_condattr_t'Alignment use Interfaces.C.int'Alignment; type pthread_mutexattr_t is record Data : char_array (1 .. OS_Constants.PTHREAD_MUTEXATTR_SIZE); end record; pragma Convention (C, pthread_mutexattr_t); for pthread_mutexattr_t'Alignment use Interfaces.C.int'Alignment; type pthread_mutex_t is record Data : char_array (1 .. OS_Constants.PTHREAD_MUTEX_SIZE); end record; pragma Convention (C, pthread_mutex_t); for pthread_mutex_t'Alignment use Interfaces.C.unsigned_long'Alignment; type pthread_cond_t is record Data : char_array (1 .. OS_Constants.PTHREAD_COND_SIZE); end record; pragma Convention (C, pthread_cond_t); for pthread_cond_t'Alignment use unsigned_long_long_t'Alignment; type pthread_key_t is new int; end System.OS_Interface;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . S E T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2018-2020, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; with GNAT.Dynamic_HTables; use GNAT.Dynamic_HTables; package GNAT.Sets is -------------------- -- Membership_Set -- -------------------- -- The following package offers a membership set abstraction with the -- following characteristics: -- -- * Creation of multiple instances, of different sizes -- * Iterable elements -- -- The following use pattern must be employed with this set: -- -- Set : Membership_Set := Create (<some size>); -- -- <various operations> -- -- Destroy (Set); -- -- The destruction of the set reclaims all storage occupied by it. generic type Element_Type is private; with function "=" (Left : Element_Type; Right : Element_Type) return Boolean; with function Hash (Key : Element_Type) return Bucket_Range_Type; -- Map an arbitrary key into the range of buckets package Membership_Sets is -------------------- -- Set operations -- -------------------- -- The following type denotes a membership set handle. Each instance -- must be created using routine Create. type Membership_Set is private; Nil : constant Membership_Set; function Contains (S : Membership_Set; Elem : Element_Type) return Boolean; -- Determine whether membership set S contains element Elem function Create (Initial_Size : Positive) return Membership_Set; -- Create a new membership set with bucket capacity Initial_Size. This -- routine must be called at the start of the membership set's lifetime. procedure Delete (S : Membership_Set; Elem : Element_Type); -- Delete element Elem from membership set S. The routine has no effect -- if the element is not present in the membership set. This action will -- raise Iterated if the membership set has outstanding iterators. procedure Destroy (S : in out Membership_Set); -- Destroy the contents of membership set S, rendering it unusable. This -- routine must be called at the end of the membership set's lifetime. -- This action will raise Iterated if the hash table has outstanding -- iterators. procedure Insert (S : Membership_Set; Elem : Element_Type); -- Insert element Elem in membership set S. The routine has no effect -- if the element is already present in the membership set. This action -- will raise Iterated if the membership set has outstanding iterators. function Is_Empty (S : Membership_Set) return Boolean; -- Determine whether set S is empty function Present (S : Membership_Set) return Boolean; -- Determine whether set S exists procedure Reset (S : Membership_Set); -- Destroy the contents of membership set S, and reset it to its initial -- created state. This action will raise Iterated if the membership set -- has outstanding iterators. function Size (S : Membership_Set) return Natural; -- Obtain the number of elements in membership set S ------------------------- -- Iterator operations -- ------------------------- -- The following type represents an element iterator. An iterator locks -- all mutation operations, and unlocks them once it is exhausted. The -- iterator must be used with the following pattern: -- -- Iter := Iterate (My_Set); -- while Has_Next (Iter) loop -- Next (Iter, Element); -- end loop; -- -- It is possible to advance the iterator by using Next only, however -- this risks raising Iterator_Exhausted. type Iterator is private; function Iterate (S : Membership_Set) return Iterator; -- Obtain an iterator over the elements of membership set S. This action -- locks all mutation functionality of the associated membership set. function Has_Next (Iter : Iterator) return Boolean; -- Determine whether iterator Iter has more keys to examine. If the -- iterator has been exhausted, restore all mutation functionality of -- the associated membership set. procedure Next (Iter : in out Iterator; Elem : out Element_Type); -- Return the current element referenced by iterator Iter and advance -- to the next available element. If the iterator has been exhausted -- and further attempts are made to advance it, this routine restores -- mutation functionality of the associated membership set, and then -- raises Iterator_Exhausted. private procedure Destroy (B : in out Boolean); -- Destroy boolean B package Hashed_Set is new Dynamic_Hash_Tables (Key_Type => Element_Type, Value_Type => Boolean, No_Value => False, Expansion_Threshold => 1.5, Expansion_Factor => 2, Compression_Threshold => 0.3, Compression_Factor => 2, "=" => "=", Destroy_Value => Destroy, Hash => Hash); type Membership_Set is new Hashed_Set.Dynamic_Hash_Table; Nil : constant Membership_Set := Membership_Set (Hashed_Set.Nil); type Iterator is new Hashed_Set.Iterator; end Membership_Sets; end GNAT.Sets;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . S O C K E T S . C O N S T A N T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2000-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides target dependent definitions of constant for use -- by the GNAT.Sockets package (g-socket.ads). This package should not be -- directly with'ed by an applications program. -- This is the version for powerpc-linux -- This file is generated automatically, do not modify it by hand! Instead, -- make changes to gen-soccon.c and re-run it on each target. package GNAT.Sockets.Constants is -------------- -- Families -- -------------- AF_INET : constant := 2; -- IPv4 address family AF_INET6 : constant := 10; -- IPv6 address family ----------- -- Modes -- ----------- SOCK_STREAM : constant := 1; -- Stream socket SOCK_DGRAM : constant := 2; -- Datagram socket ------------------- -- Socket errors -- ------------------- EACCES : constant := 13; -- Permission denied EADDRINUSE : constant := 98; -- Address already in use EADDRNOTAVAIL : constant := 99; -- Cannot assign address EAFNOSUPPORT : constant := 97; -- Addr family not supported EALREADY : constant := 114; -- Operation in progress EBADF : constant := 9; -- Bad file descriptor ECONNABORTED : constant := 103; -- Connection aborted ECONNREFUSED : constant := 111; -- Connection refused ECONNRESET : constant := 104; -- Connection reset by peer EDESTADDRREQ : constant := 89; -- Destination addr required EFAULT : constant := 14; -- Bad address EHOSTDOWN : constant := 112; -- Host is down EHOSTUNREACH : constant := 113; -- No route to host EINPROGRESS : constant := 115; -- Operation now in progress EINTR : constant := 4; -- Interrupted system call EINVAL : constant := 22; -- Invalid argument EIO : constant := 5; -- Input output error EISCONN : constant := 106; -- Socket already connected ELOOP : constant := 40; -- Too many symbolic lynks EMFILE : constant := 24; -- Too many open files EMSGSIZE : constant := 90; -- Message too long ENAMETOOLONG : constant := 36; -- Name too long ENETDOWN : constant := 100; -- Network is down ENETRESET : constant := 102; -- Disconn. on network reset ENETUNREACH : constant := 101; -- Network is unreachable ENOBUFS : constant := 105; -- No buffer space available ENOPROTOOPT : constant := 92; -- Protocol not available ENOTCONN : constant := 107; -- Socket not connected ENOTSOCK : constant := 88; -- Operation on non socket EOPNOTSUPP : constant := 95; -- Operation not supported EPFNOSUPPORT : constant := 96; -- Unknown protocol family EPROTONOSUPPORT : constant := 93; -- Unknown protocol EPROTOTYPE : constant := 91; -- Unknown protocol type ESHUTDOWN : constant := 108; -- Cannot send once shutdown ESOCKTNOSUPPORT : constant := 94; -- Socket type not supported ETIMEDOUT : constant := 110; -- Connection timed out ETOOMANYREFS : constant := 109; -- Too many references EWOULDBLOCK : constant := 11; -- Operation would block ----------------- -- Host errors -- ----------------- HOST_NOT_FOUND : constant := 1; -- Unknown host TRY_AGAIN : constant := 2; -- Host name lookup failure NO_DATA : constant := 4; -- No data record for name NO_RECOVERY : constant := 3; -- Non recoverable errors ------------------- -- Control flags -- ------------------- FIONBIO : constant := -2147195266; -- Set/clear non-blocking io FIONREAD : constant := 1074030207; -- How many bytes to read -------------------- -- Shutdown modes -- -------------------- SHUT_RD : constant := 0; -- No more recv SHUT_WR : constant := 1; -- No more send SHUT_RDWR : constant := 2; -- No more recv/send --------------------- -- Protocol levels -- --------------------- SOL_SOCKET : constant := 1; -- Options for socket level IPPROTO_IP : constant := 0; -- Dummy protocol for IP IPPROTO_UDP : constant := 17; -- UDP IPPROTO_TCP : constant := 6; -- TCP ------------------- -- Request flags -- ------------------- MSG_OOB : constant := 1; -- Process out-of-band data MSG_PEEK : constant := 2; -- Peek at incoming data MSG_EOR : constant := 128; -- Send end of record MSG_WAITALL : constant := 256; -- Wait for full reception MSG_NOSIGNAL : constant := 16384; -- No SIGPIPE on send MSG_Forced_Flags : constant := MSG_NOSIGNAL; -- Flags set on all send(2) calls -------------------- -- Socket options -- -------------------- TCP_NODELAY : constant := 1; -- Do not coalesce packets SO_REUSEADDR : constant := 2; -- Bind reuse local address SO_KEEPALIVE : constant := 9; -- Enable keep-alive msgs SO_LINGER : constant := 13; -- Defer close to flush data SO_BROADCAST : constant := 6; -- Can send broadcast msgs SO_SNDBUF : constant := 7; -- Set/get send buffer size SO_RCVBUF : constant := 8; -- Set/get recv buffer size SO_SNDTIMEO : constant := 19; -- Emission timeout SO_RCVTIMEO : constant := 18; -- Reception timeout SO_ERROR : constant := 4; -- Get/clear error status IP_MULTICAST_IF : constant := 32; -- Set/get mcast interface IP_MULTICAST_TTL : constant := 33; -- Set/get multicast TTL IP_MULTICAST_LOOP : constant := 34; -- Set/get mcast loopback IP_ADD_MEMBERSHIP : constant := 35; -- Join a multicast group IP_DROP_MEMBERSHIP : constant := 36; -- Leave a multicast group ------------------- -- System limits -- ------------------- IOV_MAX : constant := 2147483647; -- Maximum writev iovcnt ---------------------- -- Type definitions -- ---------------------- -- Sizes (in bytes) of the components of struct timeval SIZEOF_tv_sec : constant := 4; -- tv_sec SIZEOF_tv_usec : constant := 4; -- tv_usec end GNAT.Sockets.Constants;
-- -- Copyright (C) 2018, AdaCore -- -- Copyright (c) 2013, Nordic Semiconductor ASA -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- -- * Redistributions in binary form must reproduce the above copyright notice, -- this list of conditions and the following disclaimer in the documentation -- and/or other materials provided with the distribution. -- -- * Neither the name of Nordic Semiconductor ASA nor the names of its -- contributors may be used to endorse or promote products derived from this -- software without specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE -- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- This spec has been automatically generated from nrf51.svd pragma Ada_2012; pragma Style_Checks (Off); with System; package Interfaces.NRF51.UART is pragma Preelaborate; pragma No_Elaboration_Code_All; --------------- -- Registers -- --------------- -- Shortcut between CTS event and STARTRX task. type SHORTS_CTS_STARTRX_Field is ( -- Shortcut disabled. Disabled, -- Shortcut enabled. Enabled) with Size => 1; for SHORTS_CTS_STARTRX_Field use (Disabled => 0, Enabled => 1); -- Shortcut between NCTS event and STOPRX task. type SHORTS_NCTS_STOPRX_Field is ( -- Shortcut disabled. Disabled, -- Shortcut enabled. Enabled) with Size => 1; for SHORTS_NCTS_STOPRX_Field use (Disabled => 0, Enabled => 1); -- Shortcuts for UART. type SHORTS_Register is record -- unspecified Reserved_0_2 : Interfaces.NRF51.UInt3 := 16#0#; -- Shortcut between CTS event and STARTRX task. CTS_STARTRX : SHORTS_CTS_STARTRX_Field := Interfaces.NRF51.UART.Disabled; -- Shortcut between NCTS event and STOPRX task. NCTS_STOPRX : SHORTS_NCTS_STOPRX_Field := Interfaces.NRF51.UART.Disabled; -- unspecified Reserved_5_31 : Interfaces.NRF51.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SHORTS_Register use record Reserved_0_2 at 0 range 0 .. 2; CTS_STARTRX at 0 range 3 .. 3; NCTS_STOPRX at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; -- Enable interrupt on CTS event. type INTENSET_CTS_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_CTS_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on CTS event. type INTENSET_CTS_Field_1 is ( -- Reset value for the field Intenset_Cts_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_CTS_Field_1 use (Intenset_Cts_Field_Reset => 0, Set => 1); -- Enable interrupt on NCTS event. type INTENSET_NCTS_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_NCTS_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on NCTS event. type INTENSET_NCTS_Field_1 is ( -- Reset value for the field Intenset_Ncts_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_NCTS_Field_1 use (Intenset_Ncts_Field_Reset => 0, Set => 1); -- Enable interrupt on RXRDY event. type INTENSET_RXDRDY_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_RXDRDY_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on RXRDY event. type INTENSET_RXDRDY_Field_1 is ( -- Reset value for the field Intenset_Rxdrdy_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_RXDRDY_Field_1 use (Intenset_Rxdrdy_Field_Reset => 0, Set => 1); -- Enable interrupt on TXRDY event. type INTENSET_TXDRDY_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_TXDRDY_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on TXRDY event. type INTENSET_TXDRDY_Field_1 is ( -- Reset value for the field Intenset_Txdrdy_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_TXDRDY_Field_1 use (Intenset_Txdrdy_Field_Reset => 0, Set => 1); -- Enable interrupt on ERROR event. type INTENSET_ERROR_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_ERROR_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on ERROR event. type INTENSET_ERROR_Field_1 is ( -- Reset value for the field Intenset_Error_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_ERROR_Field_1 use (Intenset_Error_Field_Reset => 0, Set => 1); -- Enable interrupt on RXTO event. type INTENSET_RXTO_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENSET_RXTO_Field use (Disabled => 0, Enabled => 1); -- Enable interrupt on RXTO event. type INTENSET_RXTO_Field_1 is ( -- Reset value for the field Intenset_Rxto_Field_Reset, -- Enable interrupt on write. Set) with Size => 1; for INTENSET_RXTO_Field_1 use (Intenset_Rxto_Field_Reset => 0, Set => 1); -- Interrupt enable set register. type INTENSET_Register is record -- Enable interrupt on CTS event. CTS : INTENSET_CTS_Field_1 := Intenset_Cts_Field_Reset; -- Enable interrupt on NCTS event. NCTS : INTENSET_NCTS_Field_1 := Intenset_Ncts_Field_Reset; -- Enable interrupt on RXRDY event. RXDRDY : INTENSET_RXDRDY_Field_1 := Intenset_Rxdrdy_Field_Reset; -- unspecified Reserved_3_6 : Interfaces.NRF51.UInt4 := 16#0#; -- Enable interrupt on TXRDY event. TXDRDY : INTENSET_TXDRDY_Field_1 := Intenset_Txdrdy_Field_Reset; -- unspecified Reserved_8_8 : Interfaces.NRF51.Bit := 16#0#; -- Enable interrupt on ERROR event. ERROR : INTENSET_ERROR_Field_1 := Intenset_Error_Field_Reset; -- unspecified Reserved_10_16 : Interfaces.NRF51.UInt7 := 16#0#; -- Enable interrupt on RXTO event. RXTO : INTENSET_RXTO_Field_1 := Intenset_Rxto_Field_Reset; -- unspecified Reserved_18_31 : Interfaces.NRF51.UInt14 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for INTENSET_Register use record CTS at 0 range 0 .. 0; NCTS at 0 range 1 .. 1; RXDRDY at 0 range 2 .. 2; Reserved_3_6 at 0 range 3 .. 6; TXDRDY at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; ERROR at 0 range 9 .. 9; Reserved_10_16 at 0 range 10 .. 16; RXTO at 0 range 17 .. 17; Reserved_18_31 at 0 range 18 .. 31; end record; -- Disable interrupt on CTS event. type INTENCLR_CTS_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_CTS_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on CTS event. type INTENCLR_CTS_Field_1 is ( -- Reset value for the field Intenclr_Cts_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_CTS_Field_1 use (Intenclr_Cts_Field_Reset => 0, Clear => 1); -- Disable interrupt on NCTS event. type INTENCLR_NCTS_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_NCTS_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on NCTS event. type INTENCLR_NCTS_Field_1 is ( -- Reset value for the field Intenclr_Ncts_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_NCTS_Field_1 use (Intenclr_Ncts_Field_Reset => 0, Clear => 1); -- Disable interrupt on RXRDY event. type INTENCLR_RXDRDY_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_RXDRDY_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on RXRDY event. type INTENCLR_RXDRDY_Field_1 is ( -- Reset value for the field Intenclr_Rxdrdy_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_RXDRDY_Field_1 use (Intenclr_Rxdrdy_Field_Reset => 0, Clear => 1); -- Disable interrupt on TXRDY event. type INTENCLR_TXDRDY_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_TXDRDY_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on TXRDY event. type INTENCLR_TXDRDY_Field_1 is ( -- Reset value for the field Intenclr_Txdrdy_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_TXDRDY_Field_1 use (Intenclr_Txdrdy_Field_Reset => 0, Clear => 1); -- Disable interrupt on ERROR event. type INTENCLR_ERROR_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_ERROR_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on ERROR event. type INTENCLR_ERROR_Field_1 is ( -- Reset value for the field Intenclr_Error_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_ERROR_Field_1 use (Intenclr_Error_Field_Reset => 0, Clear => 1); -- Disable interrupt on RXTO event. type INTENCLR_RXTO_Field is ( -- Interrupt disabled. Disabled, -- Interrupt enabled. Enabled) with Size => 1; for INTENCLR_RXTO_Field use (Disabled => 0, Enabled => 1); -- Disable interrupt on RXTO event. type INTENCLR_RXTO_Field_1 is ( -- Reset value for the field Intenclr_Rxto_Field_Reset, -- Disable interrupt on write. Clear) with Size => 1; for INTENCLR_RXTO_Field_1 use (Intenclr_Rxto_Field_Reset => 0, Clear => 1); -- Interrupt enable clear register. type INTENCLR_Register is record -- Disable interrupt on CTS event. CTS : INTENCLR_CTS_Field_1 := Intenclr_Cts_Field_Reset; -- Disable interrupt on NCTS event. NCTS : INTENCLR_NCTS_Field_1 := Intenclr_Ncts_Field_Reset; -- Disable interrupt on RXRDY event. RXDRDY : INTENCLR_RXDRDY_Field_1 := Intenclr_Rxdrdy_Field_Reset; -- unspecified Reserved_3_6 : Interfaces.NRF51.UInt4 := 16#0#; -- Disable interrupt on TXRDY event. TXDRDY : INTENCLR_TXDRDY_Field_1 := Intenclr_Txdrdy_Field_Reset; -- unspecified Reserved_8_8 : Interfaces.NRF51.Bit := 16#0#; -- Disable interrupt on ERROR event. ERROR : INTENCLR_ERROR_Field_1 := Intenclr_Error_Field_Reset; -- unspecified Reserved_10_16 : Interfaces.NRF51.UInt7 := 16#0#; -- Disable interrupt on RXTO event. RXTO : INTENCLR_RXTO_Field_1 := Intenclr_Rxto_Field_Reset; -- unspecified Reserved_18_31 : Interfaces.NRF51.UInt14 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for INTENCLR_Register use record CTS at 0 range 0 .. 0; NCTS at 0 range 1 .. 1; RXDRDY at 0 range 2 .. 2; Reserved_3_6 at 0 range 3 .. 6; TXDRDY at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; ERROR at 0 range 9 .. 9; Reserved_10_16 at 0 range 10 .. 16; RXTO at 0 range 17 .. 17; Reserved_18_31 at 0 range 18 .. 31; end record; -- A start bit is received while the previous data still lies in RXD. (Data -- loss). type ERRORSRC_OVERRUN_Field is ( -- Error not present. Notpresent, -- Error present. Present) with Size => 1; for ERRORSRC_OVERRUN_Field use (Notpresent => 0, Present => 1); -- A start bit is received while the previous data still lies in RXD. (Data -- loss). type ERRORSRC_OVERRUN_Field_1 is ( -- Reset value for the field Errorsrc_Overrun_Field_Reset, -- Clear error on write. Clear) with Size => 1; for ERRORSRC_OVERRUN_Field_1 use (Errorsrc_Overrun_Field_Reset => 0, Clear => 1); -- A character with bad parity is received. Only checked if HW parity -- control is enabled. type ERRORSRC_PARITY_Field is ( -- Error not present. Notpresent, -- Error present. Present) with Size => 1; for ERRORSRC_PARITY_Field use (Notpresent => 0, Present => 1); -- A character with bad parity is received. Only checked if HW parity -- control is enabled. type ERRORSRC_PARITY_Field_1 is ( -- Reset value for the field Errorsrc_Parity_Field_Reset, -- Clear error on write. Clear) with Size => 1; for ERRORSRC_PARITY_Field_1 use (Errorsrc_Parity_Field_Reset => 0, Clear => 1); -- A valid stop bit is not detected on the serial data input after all bits -- in a character have been received. type ERRORSRC_FRAMING_Field is ( -- Error not present. Notpresent, -- Error present. Present) with Size => 1; for ERRORSRC_FRAMING_Field use (Notpresent => 0, Present => 1); -- A valid stop bit is not detected on the serial data input after all bits -- in a character have been received. type ERRORSRC_FRAMING_Field_1 is ( -- Reset value for the field Errorsrc_Framing_Field_Reset, -- Clear error on write. Clear) with Size => 1; for ERRORSRC_FRAMING_Field_1 use (Errorsrc_Framing_Field_Reset => 0, Clear => 1); -- The serial data input is '0' for longer than the length of a data frame. type ERRORSRC_BREAK_Field is ( -- Error not present. Notpresent, -- Error present. Present) with Size => 1; for ERRORSRC_BREAK_Field use (Notpresent => 0, Present => 1); -- The serial data input is '0' for longer than the length of a data frame. type ERRORSRC_BREAK_Field_1 is ( -- Reset value for the field Errorsrc_Break_Field_Reset, -- Clear error on write. Clear) with Size => 1; for ERRORSRC_BREAK_Field_1 use (Errorsrc_Break_Field_Reset => 0, Clear => 1); -- Error source. Write error field to 1 to clear error. type ERRORSRC_Register is record -- A start bit is received while the previous data still lies in RXD. -- (Data loss). OVERRUN : ERRORSRC_OVERRUN_Field_1 := Errorsrc_Overrun_Field_Reset; -- A character with bad parity is received. Only checked if HW parity -- control is enabled. PARITY : ERRORSRC_PARITY_Field_1 := Errorsrc_Parity_Field_Reset; -- A valid stop bit is not detected on the serial data input after all -- bits in a character have been received. FRAMING : ERRORSRC_FRAMING_Field_1 := Errorsrc_Framing_Field_Reset; -- The serial data input is '0' for longer than the length of a data -- frame. BREAK : ERRORSRC_BREAK_Field_1 := Errorsrc_Break_Field_Reset; -- unspecified Reserved_4_31 : Interfaces.NRF51.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ERRORSRC_Register use record OVERRUN at 0 range 0 .. 0; PARITY at 0 range 1 .. 1; FRAMING at 0 range 2 .. 2; BREAK at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Enable or disable UART and acquire IOs. type ENABLE_ENABLE_Field is ( -- UART disabled. Disabled, -- UART enabled. Enabled) with Size => 3; for ENABLE_ENABLE_Field use (Disabled => 0, Enabled => 4); -- Enable UART and acquire IOs. type ENABLE_Register is record -- Enable or disable UART and acquire IOs. ENABLE : ENABLE_ENABLE_Field := Interfaces.NRF51.UART.Disabled; -- unspecified Reserved_3_31 : Interfaces.NRF51.UInt29 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ENABLE_Register use record ENABLE at 0 range 0 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype RXD_RXD_Field is Interfaces.NRF51.Byte; -- RXD register. On read action the buffer pointer is displaced. Once read -- the character is consumed. If read when no character available, the UART -- will stop working. type RXD_Register is record -- Read-only. *** Reading this field has side effects on other resources -- ***. RX data from previous transfer. Double buffered. RXD : RXD_RXD_Field; -- unspecified Reserved_8_31 : Interfaces.NRF51.UInt24; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RXD_Register use record RXD at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype TXD_TXD_Field is Interfaces.NRF51.Byte; -- TXD register. type TXD_Register is record -- Write-only. TX data for transfer. TXD : TXD_TXD_Field := 16#0#; -- unspecified Reserved_8_31 : Interfaces.NRF51.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TXD_Register use record TXD at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- Hardware flow control. type CONFIG_HWFC_Field is ( -- Hardware flow control disabled. Disabled, -- Hardware flow control enabled. Enabled) with Size => 1; for CONFIG_HWFC_Field use (Disabled => 0, Enabled => 1); -- Include parity bit. type CONFIG_PARITY_Field is ( -- Parity bit excluded. Excluded, -- Parity bit included. Included) with Size => 3; for CONFIG_PARITY_Field use (Excluded => 0, Included => 7); -- Configuration of parity and hardware flow control register. type CONFIG_Register is record -- Hardware flow control. HWFC : CONFIG_HWFC_Field := Interfaces.NRF51.UART.Disabled; -- Include parity bit. PARITY : CONFIG_PARITY_Field := Interfaces.NRF51.UART.Excluded; -- unspecified Reserved_4_31 : Interfaces.NRF51.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CONFIG_Register use record HWFC at 0 range 0 .. 0; PARITY at 0 range 1 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; -- Peripheral power control. type POWER_POWER_Field is ( -- Module power disabled. Disabled, -- Module power enabled. Enabled) with Size => 1; for POWER_POWER_Field use (Disabled => 0, Enabled => 1); -- Peripheral power control. type POWER_Register is record -- Peripheral power control. POWER : POWER_POWER_Field := Interfaces.NRF51.UART.Disabled; -- unspecified Reserved_1_31 : Interfaces.NRF51.UInt31 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for POWER_Register use record POWER at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Universal Asynchronous Receiver/Transmitter. type UART_Peripheral is record -- Start UART receiver. TASKS_STARTRX : aliased Interfaces.NRF51.UInt32; -- Stop UART receiver. TASKS_STOPRX : aliased Interfaces.NRF51.UInt32; -- Start UART transmitter. TASKS_STARTTX : aliased Interfaces.NRF51.UInt32; -- Stop UART transmitter. TASKS_STOPTX : aliased Interfaces.NRF51.UInt32; -- Suspend UART. TASKS_SUSPEND : aliased Interfaces.NRF51.UInt32; -- CTS activated. EVENTS_CTS : aliased Interfaces.NRF51.UInt32; -- CTS deactivated. EVENTS_NCTS : aliased Interfaces.NRF51.UInt32; -- Data received in RXD. EVENTS_RXDRDY : aliased Interfaces.NRF51.UInt32; -- Data sent from TXD. EVENTS_TXDRDY : aliased Interfaces.NRF51.UInt32; -- Error detected. EVENTS_ERROR : aliased Interfaces.NRF51.UInt32; -- Receiver timeout. EVENTS_RXTO : aliased Interfaces.NRF51.UInt32; -- Shortcuts for UART. SHORTS : aliased SHORTS_Register; -- Interrupt enable set register. INTENSET : aliased INTENSET_Register; -- Interrupt enable clear register. INTENCLR : aliased INTENCLR_Register; -- Error source. Write error field to 1 to clear error. ERRORSRC : aliased ERRORSRC_Register; -- Enable UART and acquire IOs. ENABLE : aliased ENABLE_Register; -- Pin select for RTS. PSELRTS : aliased Interfaces.NRF51.UInt32; -- Pin select for TXD. PSELTXD : aliased Interfaces.NRF51.UInt32; -- Pin select for CTS. PSELCTS : aliased Interfaces.NRF51.UInt32; -- Pin select for RXD. PSELRXD : aliased Interfaces.NRF51.UInt32; -- RXD register. On read action the buffer pointer is displaced. Once -- read the character is consumed. If read when no character available, -- the UART will stop working. RXD : aliased RXD_Register; -- TXD register. TXD : aliased TXD_Register; -- UART Baudrate. BAUDRATE : aliased Interfaces.NRF51.UInt32; -- Configuration of parity and hardware flow control register. CONFIG : aliased CONFIG_Register; -- Peripheral power control. POWER : aliased POWER_Register; end record with Volatile; for UART_Peripheral use record TASKS_STARTRX at 16#0# range 0 .. 31; TASKS_STOPRX at 16#4# range 0 .. 31; TASKS_STARTTX at 16#8# range 0 .. 31; TASKS_STOPTX at 16#C# range 0 .. 31; TASKS_SUSPEND at 16#1C# range 0 .. 31; EVENTS_CTS at 16#100# range 0 .. 31; EVENTS_NCTS at 16#104# range 0 .. 31; EVENTS_RXDRDY at 16#108# range 0 .. 31; EVENTS_TXDRDY at 16#11C# range 0 .. 31; EVENTS_ERROR at 16#124# range 0 .. 31; EVENTS_RXTO at 16#144# range 0 .. 31; SHORTS at 16#200# range 0 .. 31; INTENSET at 16#304# range 0 .. 31; INTENCLR at 16#308# range 0 .. 31; ERRORSRC at 16#480# range 0 .. 31; ENABLE at 16#500# range 0 .. 31; PSELRTS at 16#508# range 0 .. 31; PSELTXD at 16#50C# range 0 .. 31; PSELCTS at 16#510# range 0 .. 31; PSELRXD at 16#514# range 0 .. 31; RXD at 16#518# range 0 .. 31; TXD at 16#51C# range 0 .. 31; BAUDRATE at 16#524# range 0 .. 31; CONFIG at 16#56C# range 0 .. 31; POWER at 16#FFC# range 0 .. 31; end record; -- Universal Asynchronous Receiver/Transmitter. UART0_Periph : aliased UART_Peripheral with Import, Address => System'To_Address (16#40002000#); end Interfaces.NRF51.UART;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2014, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- Abstract server type to represent integration with servers. ------------------------------------------------------------------------------ limited with Matreshka.Servlet_Containers; package Matreshka.Servlet_Servers is pragma Preelaborate; type Abstract_Server is abstract tagged limited null record; type Server_Access is access all Abstract_Server'Class; not overriding procedure Set_Container (Self : not null access Abstract_Server; Container : Matreshka.Servlet_Containers.Servlet_Container_Access) is abstract; end Matreshka.Servlet_Servers;
with Ada.Containers.Indefinite_Ordered_Maps; use Ada; package Utilities.Option_Lists is package Option_Maps is new Ada.Containers.Indefinite_Ordered_Maps (Key_Type => String, Element_Type => String); subtype Option_List is Option_Maps.Map; Empty_List : constant Option_List := Option_Maps.Empty_Map; type Case_Action is (Force_Lower, Force_Upper, Keep); function Parse (Input : String; Entry_Separator : Character := ','; Key_Separator : Character := '='; Trim_Key : Boolean := True; Trim_Value : Boolean := True; Key_Case : Case_Action := Force_Lower; Default_Value : String := "") return Option_List; end Utilities.Option_Lists;
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Explanation -- -- -- -- S P E C -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control -- $Revision: 1.10 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ -- Poor mans help system. This scans a sequential file for key lines and -- then reads the lines up to the next key. Those lines are presented in -- a window as help or explanation. -- package Sample.Explanation is procedure Explain (Key : in String); -- Retrieve the text associated with this key and display it. procedure Explain_Context; -- Explain the current context. procedure Notepad (Key : in String); -- Put a note on the screen and maintain it with the context Explanation_Not_Found : exception; Explanation_Error : exception; end Sample.Explanation;
-- Spécification du module Piles. generic Capacite : Integer; -- Nombre maximal d'éléments qu'une pile peut contenir type T_Element is private; -- Type des éléments de la pile package Piles is type T_Pile is limited private; --// "très privé" en Algorithmique ! --// Sur un type privé, on a droit à l'affectation (:=) et l'égalité (=). --// On perd ces opérations avec un type "limited private" (très privé). -- Initilaiser une pile. La pile est vide. procedure Initialiser (Pile : out T_Pile) with Post => Est_Vide (Pile); -- Est-ce que la pile est vide ? function Est_Vide (Pile : in T_Pile) return Boolean; -- Est-ce que la pile est pleine ? function Est_Pleine (Pile : in T_Pile) return Boolean; -- L'élément en sommet de la pile. function Sommet (Pile : in T_Pile) return T_Element with Pre => not Est_Vide (Pile); -- Empiler l'élément en somment de la pile. procedure Empiler (Pile : in out T_Pile; Element : in T_Element) with Pre => not Est_Pleine (Pile), Post => Sommet (Pile) = Element; -- Supprimer l'élément en sommet de pile procedure Depiler (Pile : in out T_Pile) with Pre => not Est_Vide (Pile); -- Afficher les éléments de la pile generic with procedure Afficher_Element (Un_Element: in T_Element); procedure Afficher (Pile : in T_Pile); private type T_Tab_Elements is array (1..Capacite) of T_Element; type T_Pile is record Elements : T_Tab_Elements; -- les éléments de la pile Taille: Integer; -- Nombre d'éléments dans la pile end record; end Piles;
-- Standard Ada library specification -- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com> -- Copyright (c) 2004-2016 AXE Consultants -- Copyright (c) 2004, 2005, 2006 Ada-Europe -- Copyright (c) 2000 The MITRE Corporation, Inc. -- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc. -- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual --------------------------------------------------------------------------- with Ada.Iterator_Interfaces; generic type Key_Type (<>) is private; type Element_Type (<>) is private; with function Hash (Key : Key_Type) return Hash_Type; with function Equivalent_Keys (Left, Right : Key_Type) return Boolean; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Indefinite_Hashed_Maps is pragma Preelaborate(Indefinite_Hashed_Maps); pragma Remote_Types(Indefinite_Hashed_Maps); type Map is tagged private with Constant_Indexing => Constant_Reference, Variable_Indexing => Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; pragma Preelaborable_Initialization(Map); type Cursor is private; pragma Preelaborable_Initialization(Cursor); Empty_Map : constant Map; No_Element : constant Cursor; function Has_Element (Position : Cursor) return Boolean; package Map_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : Map) return Boolean; function Capacity (Container : Map) return Count_Type; procedure Reserve_Capacity (Container : in out Map; Capacity : in Count_Type); function Length (Container : Map) return Count_Type; function Is_Empty (Container : Map) return Boolean; procedure Clear (Container : in out Map); function Key (Position : Cursor) return Key_Type; function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out Map; Position : in Cursor; New_Item : in Element_Type); procedure Query_Element (Position : in Cursor; Process : not null access procedure (Key : in Key_Type; Element : in Element_Type)); procedure Update_Element (Container : in out Map; Position : in Cursor; Process : not null access procedure (Key : in Key_Type; Element : in out Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased in Map; Position : in Cursor) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Position : in Cursor) return Reference_Type; function Constant_Reference (Container : aliased in Map; Key : in Key_Type) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Key : in Key_Type) return Reference_Type; procedure Assign (Target : in out Map; Source : in Map); function Copy (Source : Map; Capacity : Count_Type := 0) return Map; procedure Move (Target : in out Map; Source : in out Map); procedure Insert (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type; Position : out Cursor; Inserted : out Boolean); procedure Insert (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Include (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Replace (Container : in out Map; Key : in Key_Type; New_Item : in Element_Type); procedure Exclude (Container : in out Map; Key : in Key_Type); procedure Delete (Container : in out Map; Key : in Key_Type); procedure Delete (Container : in out Map; Position : in out Cursor); function First (Container : Map) return Cursor; function Next (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); function Find (Container : Map; Key : Key_Type) return Cursor; function Element (Container : Map; Key : Key_Type) return Element_Type; function Contains (Container : Map; Key : Key_Type) return Boolean; function Equivalent_Keys (Left, Right : Cursor) return Boolean; function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean; function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean; procedure Iterate (Container : in Map; Process : not null access procedure (Position : in Cursor)); function Iterate (Container : in Map) return Map_Iterator_Interfaces.Forward_Iterator'Class; private -- not specified by the language end Ada.Containers.Indefinite_Hashed_Maps;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- XML Processor -- -- -- -- Testsuite Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ package body XML.SAX.Input_Sources.Streams is procedure Free is new Ada.Unchecked_Deallocation (Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class, Matreshka.Internals.Text_Codecs.Decoder_Access); -- not overriding function Encoding -- (Self : SAX_Input_Source) return League.Strings.Universal_String; -------------- -- Finalize -- -------------- overriding procedure Finalize (Self : in out Stream_Input_Source) is begin Free (Self.Buffer); Free (Self.Decoder); end Finalize; ---------- -- Next -- ---------- overriding procedure Next (Self : in out Stream_Input_Source; Buffer : in out not null Matreshka.Internals.Strings.Shared_String_Access; End_Of_Data : out Boolean) is use type Ada.Streams.Stream_Element; use type Matreshka.Internals.Text_Codecs.Decoder_Access; type Encodings is (Unknown, UCS4LE, UCS4BE, UCS42143, UCS43412, UTF16LE, UTF16BE, EBCDIC, UTF8); First : Ada.Streams.Stream_Element_Offset := Self.Last + 1; Encoding : Encodings := Unknown; Factory : Matreshka.Internals.Text_Codecs.Decoder_Factory; begin -- Restart decoding when requested. if Self.Restart then Self.Restart := False; Self.Decoder.Decode_Append (Self.Buffer (Self.First .. Self.Last), Buffer); end if; -- Reallocate buffer when necessary. if First > Self.Buffer'Last then declare Old : Stream_Element_Array_Access := Self.Buffer; begin Self.Buffer := new Ada.Streams.Stream_Element_Array (Old'First .. Old'Last + 1024); Self.Buffer (Old'Range) := Old.all; Free (Old); end; end if; -- Read next portion of data from the source. Stream_Input_Source'Class (Self).Read (Self.Buffer (First .. Self.Buffer'Last), Self.Last, End_Of_Data); -- Detect encoding automatically when four first bytes are readed. if Self.Decoder = null then if Self.Last >= 3 then First := 0; -- Try to recognize Byte Order Mark. if Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#FE# and Self.Buffer (3) = 16#FF# then -- UCS-4, big-endian machine (1234 order) Encoding := UCS4BE; First := 4; elsif Self.Buffer (0) = 16#FF# and Self.Buffer (1) = 16#FE# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#00# then -- UCS-4, little-endian machine (4321 order) Encoding := UCS4LE; First := 4; elsif Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#FF# and Self.Buffer (3) = 16#FE# then -- UCS-4, unusual octet order (2143) Encoding := UCS42143; First := 4; elsif Self.Buffer (0) = 16#FE# and Self.Buffer (1) = 16#FF# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#00# then -- UCS-4, unusual octet order (3412) Encoding := UCS43412; First := 4; elsif Self.Buffer (0) = 16#FE# and Self.Buffer (1) = 16#FF# and (Self.Buffer (2) /= 16#00# or Self.Buffer (3) /= 16#00#) then -- UTF-16, big-endian Encoding := UTF16BE; First := 2; elsif Self.Buffer (0) = 16#FF# and Self.Buffer (1) = 16#FE# and (Self.Buffer (2) /= 16#00# or Self.Buffer (3) /= 16#00#) then -- UTF-16, little-endian Encoding := UTF16LE; First := 2; elsif Self.Buffer (0) = 16#EF# and Self.Buffer (1) = 16#BB# and Self.Buffer (2) = 16#BF# then -- UTF-8 Encoding := UTF8; First := 3; -- Byte Order Mark is not recognized, try to detect encoding -- without Byte Order Mark. elsif Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#3C# then -- UCS-4 or other encoding with a 32-bit code unit and ASCII -- characters encoded as ASCII values, big-endian (1234). Encoding := UCS4BE; elsif Self.Buffer (0) = 16#3C# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#00# then -- UCS-4 or other encoding with a 32-bit code unit and ASCII -- characters encoded as ASCII values, little-endian (4321). Encoding := UCS4LE; elsif Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#3C# and Self.Buffer (3) = 16#00# then -- UCS-4 or other encoding with a 32-bit code unit and ASCII -- characters encoded as ASCII values, unusual byte order -- (2143). Encoding := UCS42143; elsif Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#3C# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#00# then -- UCS-4 or other encoding with a 32-bit code unit and ASCII -- characters encoded as ASCII values, unusual byte order -- (3412). Encoding := UCS43412; elsif Self.Buffer (0) = 16#00# and Self.Buffer (1) = 16#3C# and Self.Buffer (2) = 16#00# and Self.Buffer (3) = 16#3F# then -- UTF-16BE or big-endian ISO-10646-UCS-2 or other encoding -- with a 16-bit code unit in big-endian order and ASCII -- characters encoded as ASCII values. Encoding := UTF16BE; elsif Self.Buffer (0) = 16#3C# and Self.Buffer (1) = 16#00# and Self.Buffer (2) = 16#3F# and Self.Buffer (3) = 16#00# then -- UTF-16LE or little-endian ISO-10646-UCS-2 or other encoding -- with a 16-bit code unit in little-endian order and ASCII -- characters encoded as ASCII values. Encoding := UTF16LE; elsif Self.Buffer (0) = 16#3C# and Self.Buffer (1) = 16#3F# and Self.Buffer (2) = 16#78# and Self.Buffer (3) = 16#6D# then -- UTF-8, ISO 646, ASCII, some part of ISO 8859, Shift-JIS, -- EUC, or any other 7-bit, 8-bit, or mixed-width encoding -- which ensures that the characters of ASCII have their normal -- positions, width, and values. Encoding := UTF8; elsif Self.Buffer (0) = 16#4C# and Self.Buffer (1) = 16#6F# and Self.Buffer (2) = 16#A7# and Self.Buffer (3) = 16#94# then -- EBCDIC (in some flavor). Encoding := EBCDIC; else -- UTF-8 without an encoding declaration, or else the data -- stream is mislabeled (lacking a required encoding -- declaration), corrupt, fragmentary, or enclosed in a wrapper -- of some kind. Encoding := UTF8; end if; elsif End_Of_Data then -- This is just a guess, entity is too small to detect encoding -- more precisely. First := 0; Encoding := UTF8; end if; if Encoding /= Unknown then -- Create appropriate decoder. case Encoding is when Unknown => raise Program_Error; when UCS4LE => raise Program_Error; when UCS4BE => raise Program_Error; when UCS42143 => raise Program_Error; when UCS43412 => raise Program_Error; when UTF16LE => Self.Encoding := League.Strings.To_Universal_String ("UTF-16"); Factory := Matreshka.Internals.Text_Codecs.Decoder (Matreshka.Internals.Text_Codecs.MIB_UTF16LE); when UTF16BE => Self.Encoding := League.Strings.To_Universal_String ("UTF-16"); Factory := Matreshka.Internals.Text_Codecs.Decoder (Matreshka.Internals.Text_Codecs.MIB_UTF16BE); when EBCDIC => raise Program_Error; when UTF8 => Self.Encoding := League.Strings.To_Universal_String ("UTF-8"); Factory := Matreshka.Internals.Text_Codecs.Decoder (Matreshka.Internals.Text_Codecs.MIB_UTF8); end case; -- Create decoder's state object. Self.Decoder := new Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class' (Factory (Self.Version_Mode)); -- Decode all readed data (not last chunk only) except possible -- leading byte order mark, but protect from decoding empty -- sequence of bytes. if First <= Self.Last then Self.Decoder.Decode_Append (Self.Buffer (First .. Self.Last), Buffer); end if; Self.First := First; end if; -- Decode received portion of data. elsif Self.Last >= First then Self.Decoder.Decode_Append (Self.Buffer (First .. Self.Last), Buffer); if not Self.Accumulate then Self.Last := -1; else Self.First := Self.Last + 1; end if; end if; end Next; --------------- -- Public_Id -- --------------- overriding function Public_Id (Self : Stream_Input_Source) return League.Strings.Universal_String is begin return Self.Public_Id; end Public_Id; -- not overriding procedure Set_Encoding -- (Self : in out SAX_Input_Source; -- Encoding : League.Strings.Universal_String); ---------- -- Read -- ---------- not overriding procedure Read (Self : in out Stream_Input_Source; Buffer : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset; End_Of_Data : out Boolean) is begin Self.Stream.Read (Buffer, Last); if Last < Buffer'First then Last := Buffer'First - 1; End_Of_Data := True; else End_Of_Data := False; end if; end Read; ----------- -- Reset -- ----------- not overriding procedure Reset (Self : in out Stream_Input_Source) is begin Self.First := 0; Self.Last := -1; Self.Accumulate := True; Self.Restart := False; Self.Decoder := null; Self.Stream := null; Self.Version_Mode := Matreshka.Internals.Text_Codecs.XML_1_0; Free (Self.Decoder); end Reset; ----------- -- Reset -- ----------- overriding procedure Reset (Self : in out Stream_Input_Source; Version : League.Strings.Universal_String; Encoding : League.Strings.Universal_String; Rescan : out Boolean; Success : out Boolean) is use type Matreshka.Internals.Text_Codecs.Decoder_Factory; use type Matreshka.Internals.Text_Codecs.Decoder_Mode; use type League.Strings.Universal_String; Old_Version_Mode : constant Matreshka.Internals.Text_Codecs.Decoder_Mode := Self.Version_Mode; Old_Encoding : constant League.Strings.Universal_String := Self.Encoding; Factory : Matreshka.Internals.Text_Codecs.Decoder_Factory; begin Self.Accumulate := False; if not Version.Is_Empty then Self.Set_Version (Version); end if; if not Encoding.Is_Empty then Self.Set_Encoding (Encoding); end if; Rescan := Self.Version_Mode /= Old_Version_Mode or Self.Encoding /= Old_Encoding; Success := True; if Rescan then -- Release decoder object. Free (Self.Decoder); -- Resolve new decoder and create its state. Factory := Matreshka.Internals.Text_Codecs.Decoder (Matreshka.Internals.Text_Codecs.To_Character_Set (Self.Encoding)); if Factory = null then Success := False; else Self.Decoder := new Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class' (Factory (Self.Version_Mode)); end if; Self.Restart := True; end if; end Reset; ------------------ -- Set_Encoding -- ------------------ not overriding procedure Set_Encoding (Self : in out Stream_Input_Source; Encoding : League.Strings.Universal_String) is begin Self.Encoding := Encoding; end Set_Encoding; ------------------- -- Set_Public_Id -- ------------------- not overriding procedure Set_Public_Id (Self : in out Stream_Input_Source; Id : League.Strings.Universal_String) is begin Self.Public_Id := Id; end Set_Public_Id; ---------------- -- Set_Stream -- ---------------- not overriding procedure Set_Stream (Self : in out Stream_Input_Source; Stream : not null Stream_Access) is begin Self.Stream := Stream; end Set_Stream; ------------------- -- Set_System_Id -- ------------------- overriding procedure Set_System_Id (Self : in out Stream_Input_Source; Id : League.Strings.Universal_String) is begin Self.System_Id := Id; end Set_System_Id; ----------------- -- Set_Version -- ----------------- overriding procedure Set_Version (Self : in out Stream_Input_Source; Version : League.Strings.Universal_String) is use League.Strings; begin if Version = To_Universal_String ("1.0") then Self.Version_Mode := Matreshka.Internals.Text_Codecs.XML_1_0; elsif Version = To_Universal_String ("1.1") then Self.Version_Mode := Matreshka.Internals.Text_Codecs.XML_1_1; else raise Constraint_Error with "unsupported XML version"; end if; end Set_Version; --------------- -- System_Id -- --------------- overriding function System_Id (Self : Stream_Input_Source) return League.Strings.Universal_String is begin return Self.System_Id; end System_Id; end XML.SAX.Input_Sources.Streams;
package body simulation is procedure init is begin if not CSV_here.Open then Put_Line ("Simulation: Error opening file"); Simulation.Finished := True; return; else Put_Line ("Simulation: Replay from file"); have_data := True; CSV_here.Parse_Header; end if; end init; procedure update is begin if CSV_here.End_Of_File then Finished := True; Put_Line ("Simulation: EOF"); return; end if; if not CSV_here.Parse_Row then Simulation.Finished := True; Put_Line ("Simulation: Row error"); else CSV_here.Dump_Columns; declare t : float := CSV_here.Get_Column("time"); begin Put_Line ("t=" & t'Img); end; end if; end; procedure close is begin CSV_here.Close; end close; end simulation;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Tools Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with Ada.Containers.Vectors; with WSDL.AST.Components; package WSDL.AST.Bindings is pragma Preelaborate; package Binding_Fault_Vectors is new Ada.Containers.Vectors (Positive, WSDL.AST.Binding_Fault_Access, WSDL.AST."="); package Binding_Operation_Vectors is new Ada.Containers.Vectors (Positive, WSDL.AST.Binding_Operation_Access, WSDL.AST."="); type SOAP_Binding_Extension is record Version : League.Strings.Universal_String; -- Value of {soap version} property. Underlying_Protocol : League.Strings.Universal_String; -- Value of {soap underlying protocol} property. MEP_Default : League.Strings.Universal_String; -- Value of {soap mep default} property. end record; type Binding_Node is new WSDL.AST.Components.Component_Node with record Interface_Name : Qualified_Name; -- Name of interface. Interface_Node : WSDL.AST.Interface_Access; -- Value of {interface} property. Binding_Type : League.Strings.Universal_String; -- Value of {type} property. Binding_Operations : Binding_Operation_Vectors.Vector; -- Value of {binding operations} property. Binding_Faults : Binding_Fault_Vectors.Vector; -- Value of {binding faults} property. SOAP : SOAP_Binding_Extension; -- SOAP Binding specific components. end record; overriding procedure Enter (Self : not null access Binding_Node; Visitor : in out WSDL.Visitors.WSDL_Visitor'Class; Control : in out WSDL.Iterators.Traverse_Control); overriding procedure Leave (Self : not null access Binding_Node; Visitor : in out WSDL.Visitors.WSDL_Visitor'Class; Control : in out WSDL.Iterators.Traverse_Control); overriding procedure Visit (Self : not null access Binding_Node; Iterator : in out WSDL.Iterators.WSDL_Iterator'Class; Visitor : in out WSDL.Visitors.WSDL_Visitor'Class; Control : in out WSDL.Iterators.Traverse_Control); package Constructors is function Create_Binding (Parent : not null WSDL.AST.Description_Access; Name : League.Strings.Universal_String) return not null WSDL.AST.Binding_Access; end Constructors; end WSDL.AST.Bindings;
-- SPDX-License-Identifier: MIT -- -- Copyright (c) 2016 - 2018 Gautier de Montmollin (maintainer of the Ada version) -- SWITZERLAND -- -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in -- all copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -- THE SOFTWARE. -- Standalone LZ77 compression (encoding) package -- ---------------------------------------------- -- -- This is a collection of various free LZ77 match finders and encoders. -- The differences reside in the way matches are found, or skipped. -- See body (lz77.adb) for details and credits. -- -- Pure Ada 95+ code, 100% portable: OS-, CPU- and compiler- independent. private package DCF.Lz77 is pragma Preelaborate; type Method_Type is (Iz_4, Iz_5, Iz_6, Iz_7, Iz_8, Iz_9, Iz_10); -- Use the Info-Zip algorithm, levels 4-10 (see body for details and credits) subtype Byte is Unsigned_8; generic -- LZSS Parameters String_Buffer_Size : Integer := 2**12; Look_Ahead : Integer := 65; Threshold : Integer := 2; Method : Method_Type; -- Input of data with function Read_Byte return Byte; with function More_Bytes return Boolean; -- Output of LZ-compressed data with procedure Write_Literal (B : Byte); with procedure Write_Dl_Code (Distance, Length : Integer); procedure Encode; end DCF.Lz77;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (VxWorks 653 x86 vThreads) -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This version is for the AE653 vThreads full run-time package System is pragma Pure; -- Note that we take advantage of the implementation permission to make -- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada -- 2005, this is Pure in any case (AI-362). pragma No_Elaboration_Code_All; -- Allow the use of that restriction in units that WITH this unit type Name is (SYSTEM_NAME_GNAT); System_Name : constant Name := SYSTEM_NAME_GNAT; -- System-Dependent Named Numbers Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1); Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1; Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size; Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1; Max_Base_Digits : constant := Long_Long_Float'Digits; Max_Digits : constant := Long_Long_Float'Digits; Max_Mantissa : constant := 63; Fine_Delta : constant := 2.0 ** (-Max_Mantissa); Tick : constant := 1.0 / 60.0; -- Storage-related Declarations type Address is private; pragma Preelaborable_Initialization (Address); Null_Address : constant Address; Storage_Unit : constant := 8; Word_Size : constant := 32; Memory_Size : constant := 2 ** 32; -- Address comparison function "<" (Left, Right : Address) return Boolean; function "<=" (Left, Right : Address) return Boolean; function ">" (Left, Right : Address) return Boolean; function ">=" (Left, Right : Address) return Boolean; function "=" (Left, Right : Address) return Boolean; pragma Import (Intrinsic, "<"); pragma Import (Intrinsic, "<="); pragma Import (Intrinsic, ">"); pragma Import (Intrinsic, ">="); pragma Import (Intrinsic, "="); -- Other System-Dependent Declarations type Bit_Order is (High_Order_First, Low_Order_First); Default_Bit_Order : constant Bit_Order := Low_Order_First; pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning -- Priority-related Declarations (RM D.1) -- Ada priorities are mapped to VxWorks priorities using the following -- transformation: 255 - Ada Priority -- Ada priorities are used as follows: -- 256 is reserved for the VxWorks kernel -- 248 - 255 correspond to hardware interrupt levels 0 .. 7 -- 247 is a catchall default "interrupt" priority for signals, -- allowing higher priority than normal tasks, but lower than -- hardware priority levels. Protected Object ceilings can -- override these values. -- 246 is used by the Interrupt_Manager task Max_Priority : constant Positive := 245; Max_Interrupt_Priority : constant Positive := 255; subtype Any_Priority is Integer range 0 .. 255; subtype Priority is Any_Priority range 0 .. 245; subtype Interrupt_Priority is Any_Priority range 246 .. 255; Default_Priority : constant Priority := 122; private type Address is mod Memory_Size; Null_Address : constant Address := 0; -------------------------------------- -- System Implementation Parameters -- -------------------------------------- -- These parameters provide information about the target that is used -- by the compiler. They are in the private part of System, where they -- can be accessed using the special circuitry in the Targparm unit -- whose source should be consulted for more detailed descriptions -- of the individual switch values. Backend_Divide_Checks : constant Boolean := False; Backend_Overflow_Checks : constant Boolean := True; Command_Line_Args : constant Boolean := False; Configurable_Run_Time : constant Boolean := False; Denorm : constant Boolean := True; Duration_32_Bits : constant Boolean := False; Exit_Status_Supported : constant Boolean := True; Fractional_Fixed_Ops : constant Boolean := False; Frontend_Layout : constant Boolean := False; Machine_Overflows : constant Boolean := True; Machine_Rounds : constant Boolean := True; Preallocated_Stacks : constant Boolean := False; Signed_Zeros : constant Boolean := True; Stack_Check_Default : constant Boolean := False; Stack_Check_Probes : constant Boolean := True; Stack_Check_Limits : constant Boolean := False; Support_Aggregates : constant Boolean := True; Support_Atomic_Primitives : constant Boolean := True; Support_Composite_Assign : constant Boolean := True; Support_Composite_Compare : constant Boolean := True; Support_Long_Shifts : constant Boolean := True; Always_Compatible_Rep : constant Boolean := False; Suppress_Standard_Library : constant Boolean := False; Use_Ada_Main_Program_Name : constant Boolean := True; Frontend_Exceptions : constant Boolean := False; ZCX_By_Default : constant Boolean := False; Executable_Extension : constant String := ".out"; end System;
-- This spec has been automatically generated from STM32F427x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; with System; with HAL; package STM32_SVD.SPI is pragma Preelaborate; --------------- -- Registers -- --------------- ------------------ -- CR1_Register -- ------------------ subtype CR1_BR_Field is HAL.UInt3; -- control register 1 type CR1_Register is record -- Clock phase CPHA : Boolean := False; -- Clock polarity CPOL : Boolean := False; -- Master selection MSTR : Boolean := False; -- Baud rate control BR : CR1_BR_Field := 16#0#; -- SPI enable SPE : Boolean := False; -- Frame format LSBFIRST : Boolean := False; -- Internal slave select SSI : Boolean := False; -- Software slave management SSM : Boolean := False; -- Receive only RXONLY : Boolean := False; -- Data frame format DFF : Boolean := False; -- CRC transfer next CRCNEXT : Boolean := False; -- Hardware CRC calculation enable CRCEN : Boolean := False; -- Output enable in bidirectional mode BIDIOE : Boolean := False; -- Bidirectional data mode enable BIDIMODE : Boolean := False; -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register use record CPHA at 0 range 0 .. 0; CPOL at 0 range 1 .. 1; MSTR at 0 range 2 .. 2; BR at 0 range 3 .. 5; SPE at 0 range 6 .. 6; LSBFIRST at 0 range 7 .. 7; SSI at 0 range 8 .. 8; SSM at 0 range 9 .. 9; RXONLY at 0 range 10 .. 10; DFF at 0 range 11 .. 11; CRCNEXT at 0 range 12 .. 12; CRCEN at 0 range 13 .. 13; BIDIOE at 0 range 14 .. 14; BIDIMODE at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ------------------ -- CR2_Register -- ------------------ -- control register 2 type CR2_Register is record -- Rx buffer DMA enable RXDMAEN : Boolean := False; -- Tx buffer DMA enable TXDMAEN : Boolean := False; -- SS output enable SSOE : Boolean := False; -- unspecified Reserved_3_3 : HAL.Bit := 16#0#; -- Frame format FRF : Boolean := False; -- Error interrupt enable ERRIE : Boolean := False; -- RX buffer not empty interrupt enable RXNEIE : Boolean := False; -- Tx buffer empty interrupt enable TXEIE : Boolean := False; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record RXDMAEN at 0 range 0 .. 0; TXDMAEN at 0 range 1 .. 1; SSOE at 0 range 2 .. 2; Reserved_3_3 at 0 range 3 .. 3; FRF at 0 range 4 .. 4; ERRIE at 0 range 5 .. 5; RXNEIE at 0 range 6 .. 6; TXEIE at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; ----------------- -- SR_Register -- ----------------- -- status register type SR_Register is record -- Read-only. Receive buffer not empty RXNE : Boolean := False; -- Read-only. Transmit buffer empty TXE : Boolean := True; -- Read-only. Channel side CHSIDE : Boolean := False; -- Read-only. Underrun flag UDR : Boolean := False; -- CRC error flag CRCERR : Boolean := False; -- Read-only. Mode fault MODF : Boolean := False; -- Read-only. Overrun flag OVR : Boolean := False; -- Read-only. Busy flag BSY : Boolean := False; -- Read-only. TI frame format error TIFRFE : Boolean := False; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record RXNE at 0 range 0 .. 0; TXE at 0 range 1 .. 1; CHSIDE at 0 range 2 .. 2; UDR at 0 range 3 .. 3; CRCERR at 0 range 4 .. 4; MODF at 0 range 5 .. 5; OVR at 0 range 6 .. 6; BSY at 0 range 7 .. 7; TIFRFE at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; ----------------- -- DR_Register -- ----------------- subtype DR_DR_Field is HAL.Short; -- data register type DR_Register is record -- Data register DR : DR_DR_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DR_Register use record DR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; -------------------- -- CRCPR_Register -- -------------------- subtype CRCPR_CRCPOLY_Field is HAL.Short; -- CRC polynomial register type CRCPR_Register is record -- CRC polynomial register CRCPOLY : CRCPR_CRCPOLY_Field := 16#7#; -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CRCPR_Register use record CRCPOLY at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; --------------------- -- RXCRCR_Register -- --------------------- subtype RXCRCR_RxCRC_Field is HAL.Short; -- RX CRC register type RXCRCR_Register is record -- Read-only. Rx CRC register RxCRC : RXCRCR_RxCRC_Field; -- unspecified Reserved_16_31 : HAL.Short; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RXCRCR_Register use record RxCRC at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; --------------------- -- TXCRCR_Register -- --------------------- subtype TXCRCR_TxCRC_Field is HAL.Short; -- TX CRC register type TXCRCR_Register is record -- Read-only. Tx CRC register TxCRC : TXCRCR_TxCRC_Field; -- unspecified Reserved_16_31 : HAL.Short; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TXCRCR_Register use record TxCRC at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ---------------------- -- I2SCFGR_Register -- ---------------------- subtype I2SCFGR_DATLEN_Field is HAL.UInt2; subtype I2SCFGR_I2SSTD_Field is HAL.UInt2; subtype I2SCFGR_I2SCFG_Field is HAL.UInt2; -- I2S configuration register type I2SCFGR_Register is record -- Channel length (number of bits per audio channel) CHLEN : Boolean := False; -- Data length to be transferred DATLEN : I2SCFGR_DATLEN_Field := 16#0#; -- Steady state clock polarity CKPOL : Boolean := False; -- I2S standard selection I2SSTD : I2SCFGR_I2SSTD_Field := 16#0#; -- unspecified Reserved_6_6 : HAL.Bit := 16#0#; -- PCM frame synchronization PCMSYNC : Boolean := False; -- I2S configuration mode I2SCFG : I2SCFGR_I2SCFG_Field := 16#0#; -- I2S Enable I2SE : Boolean := False; -- I2S mode selection I2SMOD : Boolean := False; -- unspecified Reserved_12_31 : HAL.UInt20 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for I2SCFGR_Register use record CHLEN at 0 range 0 .. 0; DATLEN at 0 range 1 .. 2; CKPOL at 0 range 3 .. 3; I2SSTD at 0 range 4 .. 5; Reserved_6_6 at 0 range 6 .. 6; PCMSYNC at 0 range 7 .. 7; I2SCFG at 0 range 8 .. 9; I2SE at 0 range 10 .. 10; I2SMOD at 0 range 11 .. 11; Reserved_12_31 at 0 range 12 .. 31; end record; -------------------- -- I2SPR_Register -- -------------------- subtype I2SPR_I2SDIV_Field is HAL.Byte; -- I2S prescaler register type I2SPR_Register is record -- I2S Linear prescaler I2SDIV : I2SPR_I2SDIV_Field := 16#A#; -- Odd factor for the prescaler ODD : Boolean := False; -- Master clock output enable MCKOE : Boolean := False; -- unspecified Reserved_10_31 : HAL.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for I2SPR_Register use record I2SDIV at 0 range 0 .. 7; ODD at 0 range 8 .. 8; MCKOE at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Serial peripheral interface type SPI_Peripheral is record -- control register 1 CR1 : CR1_Register; -- control register 2 CR2 : CR2_Register; -- status register SR : SR_Register; -- data register DR : DR_Register; -- CRC polynomial register CRCPR : CRCPR_Register; -- RX CRC register RXCRCR : RXCRCR_Register; -- TX CRC register TXCRCR : TXCRCR_Register; -- I2S configuration register I2SCFGR : I2SCFGR_Register; -- I2S prescaler register I2SPR : I2SPR_Register; end record with Volatile; for SPI_Peripheral use record CR1 at 0 range 0 .. 31; CR2 at 4 range 0 .. 31; SR at 8 range 0 .. 31; DR at 12 range 0 .. 31; CRCPR at 16 range 0 .. 31; RXCRCR at 20 range 0 .. 31; TXCRCR at 24 range 0 .. 31; I2SCFGR at 28 range 0 .. 31; I2SPR at 32 range 0 .. 31; end record; -- Serial peripheral interface I2S2ext_Periph : aliased SPI_Peripheral with Import, Address => I2S2ext_Base; -- Serial peripheral interface SPI2_Periph : aliased SPI_Peripheral with Import, Address => SPI2_Base; -- Serial peripheral interface SPI3_Periph : aliased SPI_Peripheral with Import, Address => SPI3_Base; -- Serial peripheral interface I2S3ext_Periph : aliased SPI_Peripheral with Import, Address => I2S3ext_Base; -- Serial peripheral interface SPI1_Periph : aliased SPI_Peripheral with Import, Address => SPI1_Base; -- Serial peripheral interface SPI4_Periph : aliased SPI_Peripheral with Import, Address => SPI4_Base; -- Serial peripheral interface SPI5_Periph : aliased SPI_Peripheral with Import, Address => SPI5_Base; -- Serial peripheral interface SPI6_Periph : aliased SPI_Peripheral with Import, Address => SPI6_Base; end STM32_SVD.SPI;
with AAA.Strings; use AAA.Strings; private with GNAT.Strings; package Commands.Generate is type Command is new Commands.Command with private; overriding function Name (Cmd : Command) return CLIC.Subcommand.Identifier is ("generate"); overriding procedure Execute (Cmd : in out Command; Args : AAA.Strings.Vector); overriding function Long_Description (Cmd : Command) return AAA.Strings.Vector; overriding procedure Setup_Switches (Cmd : in out Command; Config : in out CLIC.Subcommand.Switches_Configuration); overriding function Short_Description (Cmd : Command) return String is ("Generates new code from blueprints."); overriding function Usage_Custom_Parameters (Cmd : Command) return String is ("[-dry-run] "); private type Command is new Commands.Command with record Dry_Run : aliased Boolean := False; end record; end Commands.Generate;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Generic_Collections; package AMF.Standard_Profile_L2.Entities.Collections is pragma Preelaborate; package Standard_Profile_L2_Entity_Collections is new AMF.Generic_Collections (Standard_Profile_L2_Entity, Standard_Profile_L2_Entity_Access); type Set_Of_Standard_Profile_L2_Entity is new Standard_Profile_L2_Entity_Collections.Set with null record; Empty_Set_Of_Standard_Profile_L2_Entity : constant Set_Of_Standard_Profile_L2_Entity; type Ordered_Set_Of_Standard_Profile_L2_Entity is new Standard_Profile_L2_Entity_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_Standard_Profile_L2_Entity : constant Ordered_Set_Of_Standard_Profile_L2_Entity; type Bag_Of_Standard_Profile_L2_Entity is new Standard_Profile_L2_Entity_Collections.Bag with null record; Empty_Bag_Of_Standard_Profile_L2_Entity : constant Bag_Of_Standard_Profile_L2_Entity; type Sequence_Of_Standard_Profile_L2_Entity is new Standard_Profile_L2_Entity_Collections.Sequence with null record; Empty_Sequence_Of_Standard_Profile_L2_Entity : constant Sequence_Of_Standard_Profile_L2_Entity; private Empty_Set_Of_Standard_Profile_L2_Entity : constant Set_Of_Standard_Profile_L2_Entity := (Standard_Profile_L2_Entity_Collections.Set with null record); Empty_Ordered_Set_Of_Standard_Profile_L2_Entity : constant Ordered_Set_Of_Standard_Profile_L2_Entity := (Standard_Profile_L2_Entity_Collections.Ordered_Set with null record); Empty_Bag_Of_Standard_Profile_L2_Entity : constant Bag_Of_Standard_Profile_L2_Entity := (Standard_Profile_L2_Entity_Collections.Bag with null record); Empty_Sequence_Of_Standard_Profile_L2_Entity : constant Sequence_Of_Standard_Profile_L2_Entity := (Standard_Profile_L2_Entity_Collections.Sequence with null record); end AMF.Standard_Profile_L2.Entities.Collections;
-- generated parser support file. -- command line: wisitoken-bnf-generate.exe --generate LALR Ada_Emacs re2c PROCESS ada.wy -- -- Copyright (C) 2013 - 2019 Free Software Foundation, Inc. -- This program is free software; you can redistribute it and/or -- modify it under the terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or (at -- your option) any later version. -- -- This software is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. with Ada_Process_Actions; use Ada_Process_Actions; with WisiToken.Lexer.re2c; with ada_re2c_c; package body Ada_Process_LALR_Main is package Lexer is new WisiToken.Lexer.re2c (ada_re2c_c.New_Lexer, ada_re2c_c.Free_Lexer, ada_re2c_c.Reset_Lexer, ada_re2c_c.Next_Token); procedure Create_Parser (Parser : out WisiToken.Parse.LR.Parser.Parser; Language_Fixes : in WisiToken.Parse.LR.Parser.Language_Fixes_Access; Language_Matching_Begin_Tokens : in WisiToken.Parse.LR.Parser.Language_Matching_Begin_Tokens_Access; Language_String_ID_Set : in WisiToken.Parse.LR.Parser.Language_String_ID_Set_Access; Trace : not null access WisiToken.Trace'Class; User_Data : in WisiToken.Syntax_Trees.User_Data_Access) is use WisiToken.Parse.LR; McKenzie_Param : constant McKenzie_Param_Type := (First_Terminal => 3, Last_Terminal => 107, First_Nonterminal => 108, Last_Nonterminal => 332, Insert => (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4), Delete => (4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4), Push_Back => (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2), Undo_Reduce => (2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2), Minimal_Complete_Cost_Delta => -3, Fast_Forward => 2, Matching_Begin => 3, Ignore_Check_Fail => 2, Task_Count => 0, Check_Limit => 4, Check_Delta_Limit => 100, Enqueue_Limit => 45000); Table : constant Parse_Table_Ptr := new Parse_Table (State_First => 0, State_Last => 1281, First_Terminal => 3, Last_Terminal => 107, First_Nonterminal => 108, Last_Nonterminal => 332); begin Table.McKenzie_Param := McKenzie_Param; declare procedure Subr_1 is begin Add_Action (Table.States (0), 4, 1); Add_Action (Table.States (0), 5, 2); Add_Action (Table.States (0), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (0), 15, 3); Add_Action (Table.States (0), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (0), 18, 4); Add_Action (Table.States (0), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (0), 27, 5); Add_Action (Table.States (0), 28, 6); Add_Conflict (Table.States (0), 28, (132, 1), 0, null, null); Add_Action (Table.States (0), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (0), 30, 8); Add_Action (Table.States (0), 31, 9); Add_Action (Table.States (0), 32, 10); Add_Action (Table.States (0), 36, 11); Add_Action (Table.States (0), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (0), 40, 12); Add_Action (Table.States (0), 41, 13); Add_Action (Table.States (0), 46, 14); Add_Action (Table.States (0), 47, 15); Add_Action (Table.States (0), 48, 16); Add_Action (Table.States (0), 49, 17); Add_Action (Table.States (0), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (0), 51, 19); Add_Action (Table.States (0), 52, 20); Add_Action (Table.States (0), 57, 21); Add_Action (Table.States (0), 58, 22); Add_Action (Table.States (0), 60, 23); Add_Action (Table.States (0), 61, 24); Add_Action (Table.States (0), 63, 25); Add_Action (Table.States (0), 66, 26); Add_Action (Table.States (0), 69, 27); Add_Action (Table.States (0), 71, 28); Add_Action (Table.States (0), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (0), 74, 30); Add_Action (Table.States (0), 93, 31); Add_Action (Table.States (0), 104, 32); Add_Action (Table.States (0), 105, 33); Add_Action (Table.States (0), 106, 34); Add_Error (Table.States (0)); Add_Goto (Table.States (0), 112, 35); Add_Goto (Table.States (0), 113, 36); Add_Goto (Table.States (0), 121, 37); Add_Goto (Table.States (0), 123, 38); Add_Goto (Table.States (0), 126, 39); Add_Goto (Table.States (0), 127, 40); Add_Goto (Table.States (0), 128, 41); Add_Goto (Table.States (0), 131, 42); Add_Goto (Table.States (0), 132, 43); Add_Goto (Table.States (0), 133, 44); Add_Goto (Table.States (0), 134, 45); Add_Goto (Table.States (0), 135, 46); Add_Goto (Table.States (0), 139, 47); Add_Goto (Table.States (0), 142, 48); Add_Goto (Table.States (0), 143, 49); Add_Goto (Table.States (0), 151, 50); Add_Goto (Table.States (0), 152, 51); Add_Goto (Table.States (0), 157, 52); Add_Goto (Table.States (0), 161, 53); Add_Goto (Table.States (0), 179, 54); Add_Goto (Table.States (0), 182, 55); Add_Goto (Table.States (0), 186, 56); Add_Goto (Table.States (0), 190, 57); Add_Goto (Table.States (0), 193, 58); Add_Goto (Table.States (0), 196, 59); Add_Goto (Table.States (0), 206, 60); Add_Goto (Table.States (0), 207, 61); Add_Goto (Table.States (0), 209, 62); Add_Goto (Table.States (0), 210, 63); Add_Goto (Table.States (0), 213, 64); Add_Goto (Table.States (0), 214, 65); Add_Goto (Table.States (0), 215, 66); Add_Goto (Table.States (0), 216, 67); Add_Goto (Table.States (0), 217, 68); Add_Goto (Table.States (0), 219, 69); Add_Goto (Table.States (0), 222, 70); Add_Goto (Table.States (0), 223, 71); Add_Goto (Table.States (0), 232, 72); Add_Goto (Table.States (0), 239, 73); Add_Goto (Table.States (0), 243, 74); Add_Goto (Table.States (0), 244, 75); Add_Goto (Table.States (0), 245, 76); Add_Goto (Table.States (0), 246, 77); Add_Goto (Table.States (0), 247, 78); Add_Goto (Table.States (0), 248, 79); Add_Goto (Table.States (0), 249, 80); Add_Goto (Table.States (0), 250, 81); Add_Goto (Table.States (0), 251, 82); Add_Goto (Table.States (0), 257, 83); Add_Goto (Table.States (0), 259, 84); Add_Goto (Table.States (0), 260, 85); Add_Goto (Table.States (0), 261, 86); Add_Goto (Table.States (0), 262, 87); Add_Goto (Table.States (0), 263, 88); Add_Goto (Table.States (0), 264, 89); Add_Goto (Table.States (0), 265, 90); Add_Goto (Table.States (0), 271, 91); Add_Goto (Table.States (0), 272, 92); Add_Goto (Table.States (0), 276, 93); Add_Goto (Table.States (0), 281, 94); Add_Goto (Table.States (0), 289, 95); Add_Goto (Table.States (0), 290, 96); Add_Goto (Table.States (0), 293, 97); Add_Goto (Table.States (0), 294, 98); Add_Goto (Table.States (0), 298, 99); Add_Goto (Table.States (0), 302, 100); Add_Goto (Table.States (0), 303, 101); Add_Goto (Table.States (0), 304, 102); Add_Goto (Table.States (0), 305, 103); Add_Goto (Table.States (0), 306, 104); Add_Goto (Table.States (0), 307, 105); Add_Goto (Table.States (0), 308, 106); Add_Goto (Table.States (0), 309, 107); Add_Goto (Table.States (0), 311, 108); Add_Goto (Table.States (0), 313, 109); Add_Goto (Table.States (0), 315, 110); Add_Goto (Table.States (0), 316, 111); Add_Goto (Table.States (0), 317, 112); Add_Goto (Table.States (0), 319, 113); Add_Goto (Table.States (0), 323, 114); Add_Goto (Table.States (0), 325, 115); Add_Goto (Table.States (0), 331, 116); Add_Goto (Table.States (0), 332, 117); Table.States (0).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 13))); Add_Action (Table.States (1), 104, 118); Add_Error (Table.States (1)); Table.States (1).Kernel := To_Vector (((113, 4, 4, False), (113, 4, 2, False))); Table.States (1).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 118))); Add_Action (Table.States (2), 104, 119); Add_Action (Table.States (2), 105, 33); Add_Action (Table.States (2), 106, 34); Add_Error (Table.States (2)); Add_Goto (Table.States (2), 128, 41); Add_Goto (Table.States (2), 239, 120); Add_Goto (Table.States (2), 272, 92); Add_Goto (Table.States (2), 293, 97); Table.States (2).Kernel := To_Vector ((0 => (303, 5, 2, False))); Table.States (2).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (3), 3, 121); Add_Action (Table.States (3), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (3), 39, 122); Add_Action (Table.States (3), 40, 123); Add_Action (Table.States (3), 41, 124); Add_Action (Table.States (3), 52, 125); Add_Action (Table.States (3), 76, 126); Add_Action (Table.States (3), 94, 127); Add_Action (Table.States (3), 95, 128); Add_Action (Table.States (3), 103, 129); Add_Action (Table.States (3), 104, 119); Add_Action (Table.States (3), 105, 33); Add_Action (Table.States (3), 106, 34); Add_Error (Table.States (3)); Add_Goto (Table.States (3), 117, 130); Add_Goto (Table.States (3), 128, 41); Add_Goto (Table.States (3), 191, 131); Add_Goto (Table.States (3), 192, 132); Add_Goto (Table.States (3), 197, 133); Add_Goto (Table.States (3), 239, 134); Add_Goto (Table.States (3), 258, 135); Add_Goto (Table.States (3), 272, 92); Add_Goto (Table.States (3), 275, 136); Add_Goto (Table.States (3), 282, 137); Add_Goto (Table.States (3), 283, 138); Add_Goto (Table.States (3), 284, 139); Add_Goto (Table.States (3), 285, 140); Add_Goto (Table.States (3), 286, 141); Add_Goto (Table.States (3), 287, 142); Add_Goto (Table.States (3), 293, 97); Add_Goto (Table.States (3), 301, 143); Add_Goto (Table.States (3), 320, 144); Add_Goto (Table.States (3), 321, 145); Add_Goto (Table.States (3), 330, 146); Table.States (3).Kernel := To_Vector ((0 => (139, 15, 6, False))); Table.States (3).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (4), 3, 121); Add_Action (Table.States (4), 39, 122); Add_Action (Table.States (4), 40, 123); Add_Action (Table.States (4), 41, 124); Add_Action (Table.States (4), 52, 125); Add_Action (Table.States (4), 70, 147); Add_Action (Table.States (4), 76, 126); Add_Action (Table.States (4), 94, 127); Add_Action (Table.States (4), 95, 128); Add_Action (Table.States (4), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (4), 103, 129); Add_Action (Table.States (4), 104, 119); Add_Action (Table.States (4), 105, 33); Add_Action (Table.States (4), 106, 34); Add_Error (Table.States (4)); Add_Goto (Table.States (4), 117, 130); Add_Goto (Table.States (4), 128, 41); Add_Goto (Table.States (4), 191, 131); Add_Goto (Table.States (4), 192, 148); Add_Goto (Table.States (4), 197, 133); Add_Goto (Table.States (4), 239, 134); Add_Goto (Table.States (4), 258, 135); Add_Goto (Table.States (4), 272, 92); Add_Goto (Table.States (4), 275, 136); Add_Goto (Table.States (4), 282, 137); Add_Goto (Table.States (4), 283, 138); Add_Goto (Table.States (4), 284, 139); Add_Goto (Table.States (4), 285, 140); Add_Goto (Table.States (4), 286, 141); Add_Goto (Table.States (4), 287, 142); Add_Goto (Table.States (4), 293, 97); Add_Goto (Table.States (4), 301, 143); Add_Goto (Table.States (4), 320, 144); Add_Goto (Table.States (4), 321, 145); Add_Goto (Table.States (4), 330, 146); Table.States (4).Kernel := To_Vector (((161, 18, 2, False), (161, 18, 1, False))); Table.States (4).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (5), 72, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (5), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (5), 104, 149); Add_Error (Table.States (5)); Add_Goto (Table.States (5), 220, 150); Table.States (5).Kernel := To_Vector (((190, 27, 2, False), (190, 27, 1, False))); Table.States (5).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (6), 104, 151); Add_Action (Table.States (6), 105, 152); Add_Action (Table.States (6), 106, 34); Add_Error (Table.States (6)); Add_Goto (Table.States (6), 128, 153); Add_Goto (Table.States (6), 163, 154); Add_Goto (Table.States (6), 230, 155); Add_Goto (Table.States (6), 231, 156); Add_Goto (Table.States (6), 239, 157); Add_Goto (Table.States (6), 272, 92); Add_Goto (Table.States (6), 293, 97); Table.States (6).Kernel := To_Vector (((121, 28, 5, False), (127, 28, 4, False), (182, 28, 5, False), (229, 28, 0, False), (281, 28, 14, False))); Table.States (6).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 231, 0))); Add_Action (Table.States (7), 104, 119); Add_Action (Table.States (7), 105, 33); Add_Action (Table.States (7), 106, 34); Add_Error (Table.States (7)); Add_Goto (Table.States (7), 128, 41); Add_Goto (Table.States (7), 239, 158); Add_Goto (Table.States (7), 272, 92); Add_Goto (Table.States (7), 293, 97); Table.States (7).Kernel := To_Vector ((0 => (207, 29, 2, False))); Table.States (7).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (8), 29, 159); Add_Conflict (Table.States (8), 29, (210, 1), 1, generic_formal_part_1'Access, null); Add_Action (Table.States (8), 47, 160); Add_Conflict (Table.States (8), 47, (210, 1), 1, generic_formal_part_1'Access, null); Add_Action (Table.States (8), 48, 16); Add_Action (Table.States (8), 50, 161); Add_Conflict (Table.States (8), 50, (210, 1), 1, generic_formal_part_1'Access, null); Add_Action (Table.States (8), 69, 162); Add_Action (Table.States (8), 71, 28); Add_Action (Table.States (8), 74, 163); Add_Action (Table.States (8), 104, 164); Add_Error (Table.States (8)); Add_Goto (Table.States (8), 198, 165); Add_Goto (Table.States (8), 200, 166); Add_Goto (Table.States (8), 201, 167); Add_Goto (Table.States (8), 204, 168); Add_Goto (Table.States (8), 211, 169); Add_Goto (Table.States (8), 212, 170); Add_Goto (Table.States (8), 219, 171); Add_Goto (Table.States (8), 257, 172); Add_Goto (Table.States (8), 331, 173); Table.States (8).Kernel := To_Vector (((210, 30, 3, False), (210, 30, 0, False), (215, 30, 5, False), (215, 30, 5, False), (215, 30, 5, False))); Table.States (8).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 210, 1))); Add_Action (Table.States (9), 104, 174); Add_Error (Table.States (9)); Table.States (9).Kernel := To_Vector ((0 => (303, 31, 2, False))); Table.States (9).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 174))); Add_Action (Table.States (10), 3, 121); Add_Action (Table.States (10), 39, 122); Add_Action (Table.States (10), 40, 123); Add_Action (Table.States (10), 41, 124); Add_Action (Table.States (10), 52, 125); Add_Action (Table.States (10), 68, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (10), 76, 126); Add_Action (Table.States (10), 94, 127); Add_Action (Table.States (10), 95, 128); Add_Action (Table.States (10), 103, 129); Add_Action (Table.States (10), 104, 119); Add_Action (Table.States (10), 105, 33); Add_Action (Table.States (10), 106, 34); Add_Error (Table.States (10)); Add_Goto (Table.States (10), 117, 130); Add_Goto (Table.States (10), 128, 41); Add_Goto (Table.States (10), 191, 131); Add_Goto (Table.States (10), 192, 175); Add_Goto (Table.States (10), 197, 133); Add_Goto (Table.States (10), 239, 134); Add_Goto (Table.States (10), 258, 135); Add_Goto (Table.States (10), 272, 92); Add_Goto (Table.States (10), 275, 136); Add_Goto (Table.States (10), 282, 137); Add_Goto (Table.States (10), 283, 138); Add_Goto (Table.States (10), 284, 139); Add_Goto (Table.States (10), 285, 140); Add_Goto (Table.States (10), 286, 141); Add_Goto (Table.States (10), 287, 142); Add_Goto (Table.States (10), 293, 97); Add_Goto (Table.States (10), 301, 143); Add_Goto (Table.States (10), 320, 144); Add_Goto (Table.States (10), 321, 145); Add_Goto (Table.States (10), 330, 146); Table.States (10).Kernel := To_Vector (((222, 32, 7, False), (222, 32, 5, False), (222, 32, 6, False), (222, 32, 4, False))); Table.States (10).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (11), 49, 176); Add_Action (Table.States (11), 74, 177); Add_Error (Table.States (11)); Table.States (11).Kernel := To_Vector (((332, 36, 4, False), (332, 36, 3, False))); Table.States (11).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 177))); Add_Action (Table.States (12), 46, 178); Add_Error (Table.States (12)); Table.States (12).Kernel := To_Vector ((0 => (246, 40, 1, False))); Table.States (12).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 46, 178))); Add_Action (Table.States (13), 96, 179); Add_Error (Table.States (13)); Table.States (13).Kernel := To_Vector ((0 => (303, 41, 1, False))); Table.States (13).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 179))); Add_Action (Table.States (14), (25, 29, 50), (246, 1), 1, overriding_indicator_opt_1'Access, null); Table.States (14).Kernel := To_Vector ((0 => (246, 46, 0, False))); Table.States (14).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 246, 1))); Add_Action (Table.States (15), 14, 180); Add_Action (Table.States (15), 104, 119); Add_Action (Table.States (15), 105, 33); Add_Action (Table.States (15), 106, 34); Add_Error (Table.States (15)); Add_Goto (Table.States (15), 128, 41); Add_Goto (Table.States (15), 239, 181); Add_Goto (Table.States (15), 272, 92); Add_Goto (Table.States (15), 293, 97); Table.States (15).Kernel := To_Vector (((213, 47, 5, False), (247, 47, 6, False), (247, 47, 5, False), (248, 47, 5, False), (250, 47, 4, False), (251, 47, 4, False), (251, 47, 3, False))); Table.States (15).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (16), 104, 182); Add_Error (Table.States (16)); Table.States (16).Kernel := To_Vector (((257, 48, 4, False), (257, 48, 6, False), (257, 48, 2, False))); Table.States (16).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 182))); Add_Action (Table.States (17), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (17), 28, 183); Add_Action (Table.States (17), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (17), 30, 8); Add_Action (Table.States (17), 40, 12); Add_Action (Table.States (17), 46, 14); Add_Action (Table.States (17), 47, 15); Add_Action (Table.States (17), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (17), 51, 19); Add_Action (Table.States (17), 63, 25); Add_Action (Table.States (17), 66, 26); Add_Action (Table.States (17), 69, 27); Add_Action (Table.States (17), 71, 28); Add_Action (Table.States (17), 74, 184); Add_Action (Table.States (17), 104, 185); Add_Error (Table.States (17)); Add_Goto (Table.States (17), 112, 35); Add_Goto (Table.States (17), 121, 37); Add_Goto (Table.States (17), 127, 40); Add_Goto (Table.States (17), 134, 45); Add_Goto (Table.States (17), 135, 46); Add_Goto (Table.States (17), 157, 186); Add_Goto (Table.States (17), 179, 54); Add_Goto (Table.States (17), 182, 55); Add_Goto (Table.States (17), 186, 56); Add_Goto (Table.States (17), 193, 58); Add_Goto (Table.States (17), 206, 60); Add_Goto (Table.States (17), 207, 61); Add_Goto (Table.States (17), 209, 62); Add_Goto (Table.States (17), 210, 63); Add_Goto (Table.States (17), 213, 64); Add_Goto (Table.States (17), 214, 65); Add_Goto (Table.States (17), 215, 66); Add_Goto (Table.States (17), 216, 67); Add_Goto (Table.States (17), 219, 69); Add_Goto (Table.States (17), 223, 71); Add_Goto (Table.States (17), 243, 74); Add_Goto (Table.States (17), 244, 75); Add_Goto (Table.States (17), 245, 76); Add_Goto (Table.States (17), 246, 77); Add_Goto (Table.States (17), 247, 78); Add_Goto (Table.States (17), 248, 79); Add_Goto (Table.States (17), 249, 80); Add_Goto (Table.States (17), 250, 81); Add_Goto (Table.States (17), 251, 82); Add_Goto (Table.States (17), 259, 84); Add_Goto (Table.States (17), 260, 85); Add_Goto (Table.States (17), 262, 87); Add_Goto (Table.States (17), 263, 88); Add_Goto (Table.States (17), 264, 89); Add_Goto (Table.States (17), 265, 90); Add_Goto (Table.States (17), 271, 91); Add_Goto (Table.States (17), 281, 94); Add_Goto (Table.States (17), 289, 95); Add_Goto (Table.States (17), 304, 102); Add_Goto (Table.States (17), 305, 103); Add_Goto (Table.States (17), 307, 105); Add_Goto (Table.States (17), 308, 106); Add_Goto (Table.States (17), 309, 107); Add_Goto (Table.States (17), 311, 108); Add_Goto (Table.States (17), 313, 109); Add_Goto (Table.States (17), 316, 111); Add_Goto (Table.States (17), 317, 112); Add_Goto (Table.States (17), 319, 113); Add_Goto (Table.States (17), 325, 115); Add_Goto (Table.States (17), 331, 116); Table.States (17).Kernel := To_Vector (((142, 49, 3, False), (332, 49, 3, False))); Table.States (17).Minimal_Complete_Actions := To_Vector (((Reduce, 246, 0), (Shift, 74, 184))); Add_Action (Table.States (18), 104, 119); Add_Action (Table.States (18), 105, 33); Add_Action (Table.States (18), 106, 34); Add_Error (Table.States (18)); Add_Goto (Table.States (18), 128, 41); Add_Goto (Table.States (18), 239, 187); Add_Goto (Table.States (18), 272, 92); Add_Goto (Table.States (18), 293, 97); Table.States (18).Kernel := To_Vector ((0 => (262, 50, 1, False))); Table.States (18).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (19), 14, 188); Add_Action (Table.States (19), 69, 189); Add_Action (Table.States (19), 104, 190); Add_Error (Table.States (19)); Table.States (19).Kernel := To_Vector (((264, 51, 5, False), (265, 51, 5, False), (271, 51, 8, False), (271, 51, 5, False), (304, 51, 7, False), (304, 51, 4, False))); Table.States (19).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 190))); Add_Action (Table.States (20), 96, 191); Add_Action (Table.States (20), 104, 119); Add_Action (Table.States (20), 105, 33); Add_Action (Table.States (20), 106, 34); Add_Error (Table.States (20)); Add_Goto (Table.States (20), 128, 41); Add_Goto (Table.States (20), 239, 192); Add_Goto (Table.States (20), 272, 92); Add_Goto (Table.States (20), 293, 97); Table.States (20).Kernel := To_Vector (((276, 52, 3, False), (276, 52, 2, False), (276, 52, 1, False))); Table.States (20).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 191))); Add_Action (Table.States (21), 104, 119); Add_Action (Table.States (21), 105, 33); Add_Action (Table.States (21), 106, 34); Add_Error (Table.States (21)); Add_Goto (Table.States (21), 128, 41); Add_Goto (Table.States (21), 239, 193); Add_Goto (Table.States (21), 272, 92); Add_Goto (Table.States (21), 293, 97); Table.States (21).Kernel := To_Vector (((290, 57, 4, False), (290, 57, 2, False))); Table.States (21).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (22), 3, 121); Add_Action (Table.States (22), 21, Reduce, (195, 1), 0, null, null); Add_Action (Table.States (22), 39, 122); Add_Action (Table.States (22), 40, 123); Add_Action (Table.States (22), 41, 124); Add_Action (Table.States (22), 52, 125); Add_Action (Table.States (22), 76, 126); Add_Action (Table.States (22), 94, 127); Add_Action (Table.States (22), 95, 128); Add_Action (Table.States (22), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (22), 103, 129); Add_Action (Table.States (22), 104, 194); Add_Action (Table.States (22), 105, 33); Add_Action (Table.States (22), 106, 34); Add_Error (Table.States (22)); Add_Goto (Table.States (22), 117, 130); Add_Goto (Table.States (22), 128, 41); Add_Goto (Table.States (22), 191, 131); Add_Goto (Table.States (22), 192, 195); Add_Goto (Table.States (22), 194, 196); Add_Goto (Table.States (22), 195, 197); Add_Goto (Table.States (22), 197, 133); Add_Goto (Table.States (22), 239, 134); Add_Goto (Table.States (22), 258, 135); Add_Goto (Table.States (22), 272, 92); Add_Goto (Table.States (22), 275, 136); Add_Goto (Table.States (22), 282, 137); Add_Goto (Table.States (22), 283, 138); Add_Goto (Table.States (22), 284, 139); Add_Goto (Table.States (22), 285, 140); Add_Goto (Table.States (22), 286, 141); Add_Goto (Table.States (22), 287, 142); Add_Goto (Table.States (22), 293, 97); Add_Goto (Table.States (22), 301, 143); Add_Goto (Table.States (22), 320, 144); Add_Goto (Table.States (22), 321, 145); Add_Goto (Table.States (22), 330, 146); Table.States (22).Kernel := To_Vector (((196, 58, 4, False), (196, 58, 4, False), (302, 58, 1, False))); Table.States (22).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (23), 76, 198); Add_Error (Table.States (23)); Table.States (23).Kernel := To_Vector ((0 => (315, 60, 9, False))); Table.States (23).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 76, 198))); Add_Action (Table.States (24), 4, 1); Add_Action (Table.States (24), 18, 4); Add_Action (Table.States (24), 22, Reduce, (297, 1), 0, null, null); Add_Action (Table.States (24), 24, Reduce, (297, 1), 0, null, null); Add_Action (Table.States (24), 67, 199); Add_Action (Table.States (24), 72, 200); Add_Action (Table.States (24), 104, 119); Add_Action (Table.States (24), 105, 33); Add_Action (Table.States (24), 106, 34); Add_Error (Table.States (24)); Add_Goto (Table.States (24), 113, 201); Add_Goto (Table.States (24), 128, 41); Add_Goto (Table.States (24), 160, 202); Add_Goto (Table.States (24), 161, 203); Add_Goto (Table.States (24), 178, 204); Add_Goto (Table.States (24), 239, 205); Add_Goto (Table.States (24), 261, 206); Add_Goto (Table.States (24), 272, 92); Add_Goto (Table.States (24), 293, 97); Add_Goto (Table.States (24), 295, 207); Add_Goto (Table.States (24), 296, 208); Add_Goto (Table.States (24), 297, 209); Add_Goto (Table.States (24), 324, 210); Table.States (24).Kernel := To_Vector (((126, 61, 6, False), (152, 61, 5, False), (294, 61, 4, False), (294, 61, 3, False), (323, 61, 7, False))); Table.States (24).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 297, 0))); Add_Action (Table.States (25), 104, 211); Add_Error (Table.States (25)); Table.States (25).Kernel := To_Vector ((0 => (313, 63, 4, False))); Table.States (25).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 211))); Add_Action (Table.States (26), 14, 212); Add_Action (Table.States (26), 69, 213); Add_Action (Table.States (26), 104, 214); Add_Error (Table.States (26)); Table.States (26).Kernel := To_Vector (((305, 66, 7, False), (305, 66, 4, False), (305, 66, 2, False), (316, 66, 6, False), (317, 66, 5, False), (319, 66, 8, False), (319, 66, 5, False), (319, 66, 3, False))); Table.States (26).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 214))); Add_Action (Table.States (27), 104, 215); Add_Error (Table.States (27)); Table.States (27).Kernel := To_Vector (((206, 69, 4, False), (223, 69, 4, False), (223, 69, 2, False), (259, 69, 7, False), (260, 69, 4, False))); Table.States (27).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 215))); Add_Action (Table.States (28), 9, 216); Add_Action (Table.States (28), 69, 217); Add_Action (Table.States (28), 104, 119); Add_Action (Table.States (28), 105, 33); Add_Action (Table.States (28), 106, 34); Add_Error (Table.States (28)); Add_Goto (Table.States (28), 128, 41); Add_Goto (Table.States (28), 238, 218); Add_Goto (Table.States (28), 239, 219); Add_Goto (Table.States (28), 272, 92); Add_Goto (Table.States (28), 293, 97); Table.States (28).Kernel := To_Vector (((331, 71, 4, False), (331, 71, 3, False), (331, 71, 2, False))); Table.States (28).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (29), 3, 121); Add_Action (Table.States (29), 37, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (29), 39, 122); Add_Action (Table.States (29), 40, 123); Add_Action (Table.States (29), 41, 124); Add_Action (Table.States (29), 52, 125); Add_Action (Table.States (29), 76, 126); Add_Action (Table.States (29), 94, 127); Add_Action (Table.States (29), 95, 128); Add_Action (Table.States (29), 103, 129); Add_Action (Table.States (29), 104, 119); Add_Action (Table.States (29), 105, 33); Add_Action (Table.States (29), 106, 34); Add_Error (Table.States (29)); Add_Goto (Table.States (29), 117, 130); Add_Goto (Table.States (29), 128, 41); Add_Goto (Table.States (29), 191, 131); Add_Goto (Table.States (29), 192, 220); Add_Goto (Table.States (29), 197, 133); Add_Goto (Table.States (29), 239, 134); Add_Goto (Table.States (29), 258, 135); Add_Goto (Table.States (29), 272, 92); Add_Goto (Table.States (29), 275, 136); Add_Goto (Table.States (29), 282, 137); Add_Goto (Table.States (29), 283, 138); Add_Goto (Table.States (29), 284, 139); Add_Goto (Table.States (29), 285, 140); Add_Goto (Table.States (29), 286, 141); Add_Goto (Table.States (29), 287, 142); Add_Goto (Table.States (29), 293, 97); Add_Goto (Table.States (29), 301, 143); Add_Goto (Table.States (29), 320, 144); Add_Goto (Table.States (29), 321, 145); Add_Goto (Table.States (29), 330, 146); Table.States (29).Kernel := To_Vector ((0 => (229, 73, 0, False))); Table.States (29).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (30), 104, 119); Add_Action (Table.States (30), 105, 33); Add_Action (Table.States (30), 106, 34); Add_Error (Table.States (30)); Add_Goto (Table.States (30), 128, 41); Add_Goto (Table.States (30), 238, 221); Add_Goto (Table.States (30), 239, 219); Add_Goto (Table.States (30), 272, 92); Add_Goto (Table.States (30), 293, 97); Table.States (30).Kernel := To_Vector ((0 => (332, 74, 2, False))); Table.States (30).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (31), 104, 222); Add_Error (Table.States (31)); Table.States (31).Kernel := To_Vector ((0 => (217, 93, 2, False))); Table.States (31).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 222))); Add_Action (Table.States (32), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (32), 81, 223); Add_Conflict (Table.States (32), 81, (219, 1), 1, identifier_list_1'Access, null); Add_Action (Table.States (32), 82, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (32), 83, Reduce, (219, 1), 1, identifier_list_1'Access, null); Add_Action (Table.States (32), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (32), 96, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (32), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (32), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (32)); Table.States (32).Kernel := To_Vector (((131, 104, 1, False), (219, 104, 0, False), (239, 104, 0, False), (245, 104, 5, False), (245, 104, 6, False), (245, 104, 5, False))); Table.States (32).Minimal_Complete_Actions := To_Vector (((Reduce, 219, 1), (Reduce, 239, 1))); Add_Action (Table.States (33), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 7), 1, null, name_7_check'Access); Table.States (33).Kernel := To_Vector ((0 => (239, 105, 0, False))); Table.States (33).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (34), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 6), 1, null, null); Table.States (34).Kernel := To_Vector ((0 => (239, 106, 0, False))); Table.States (34).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (35), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 0), 1, null, null); Table.States (35).Kernel := To_Vector ((0 => (157, 112, 0, False))); Table.States (35).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (36), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 5), 1, null, null); Table.States (36).Kernel := To_Vector ((0 => (151, 113, 0, False))); Table.States (36).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (37), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 1), 1, null, null); Table.States (37).Kernel := To_Vector ((0 => (157, 121, 0, False))); Table.States (37).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (38), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 1), 1, null, null); Table.States (38).Kernel := To_Vector ((0 => (303, 123, 0, False))); Table.States (38).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (39), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (298, 3), 1, null, null); Table.States (39).Kernel := To_Vector ((0 => (298, 126, 0, False))); Table.States (39).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 298, 1))); Add_Action (Table.States (40), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (121, 3), 1, null, null); Table.States (40).Kernel := To_Vector ((0 => (121, 127, 0, False))); Table.States (40).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 121, 1))); Add_Action (Table.States (41), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 3), 1, null, null); Table.States (41).Kernel := To_Vector ((0 => (239, 128, 0, True))); Table.States (41).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Table.States (41).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (42), (13, 17, 28, 37, 73), (132, 0), 1, null, block_label_opt_0_check'Access); Table.States (42).Kernel := To_Vector ((0 => (132, 131, 0, False))); Table.States (42).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 132, 1))); Add_Action (Table.States (43), 13, 224); Add_Action (Table.States (43), 17, 225); Add_Action (Table.States (43), 28, 226); Add_Action (Table.States (43), 37, 227); Add_Action (Table.States (43), 73, 29); Add_Error (Table.States (43)); Add_Goto (Table.States (43), 229, 228); Table.States (43).Kernel := To_Vector (((133, 132, 4, False), (133, 132, 3, False), (232, 132, 5, False), (232, 132, 4, False))); Table.States (43).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 13, 224))); Add_Action (Table.States (44), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 3), 1, null, null); Table.States (44).Kernel := To_Vector ((0 => (151, 133, 0, False))); Table.States (44).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (45), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 2), 1, null, null); Table.States (45).Kernel := To_Vector ((0 => (157, 134, 0, False))); Table.States (45).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (46), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (134, 1), 1, null, null); Table.States (46).Kernel := To_Vector ((0 => (134, 135, 0, False))); Table.States (46).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 134, 1))); Add_Action (Table.States (47), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 1), 1, null, null); Table.States (47).Kernel := To_Vector ((0 => (151, 139, 0, False))); Table.States (47).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (48), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (143, 1), 1, compilation_unit_list_1'Access, compilation_unit_list_1_check'Access); Table.States (48).Kernel := To_Vector ((0 => (143, 142, 0, False))); Table.States (48).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 143, 1))); Add_Action (Table.States (49), 4, 1); Add_Action (Table.States (49), 5, 2); Add_Action (Table.States (49), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (49), 15, 3); Add_Action (Table.States (49), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (49), 18, 4); Add_Action (Table.States (49), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (49), 27, 5); Add_Action (Table.States (49), 28, 6); Add_Conflict (Table.States (49), 28, (132, 1), 0, null, null); Add_Action (Table.States (49), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (49), 30, 8); Add_Action (Table.States (49), 31, 9); Add_Action (Table.States (49), 32, 10); Add_Action (Table.States (49), 36, 11); Add_Action (Table.States (49), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (49), 40, 12); Add_Action (Table.States (49), 41, 13); Add_Action (Table.States (49), 46, 14); Add_Action (Table.States (49), 47, 15); Add_Action (Table.States (49), 48, 16); Add_Action (Table.States (49), 49, 17); Add_Action (Table.States (49), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (49), 51, 19); Add_Action (Table.States (49), 52, 20); Add_Action (Table.States (49), 57, 21); Add_Action (Table.States (49), 58, 22); Add_Action (Table.States (49), 60, 23); Add_Action (Table.States (49), 61, 24); Add_Action (Table.States (49), 63, 25); Add_Action (Table.States (49), 66, 26); Add_Action (Table.States (49), 69, 27); Add_Action (Table.States (49), 71, 28); Add_Action (Table.States (49), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (49), 74, 30); Add_Action (Table.States (49), 93, 31); Add_Action (Table.States (49), 104, 32); Add_Action (Table.States (49), 105, 33); Add_Action (Table.States (49), 106, 34); Add_Action (Table.States (49), 107, Accept_It, (108, 0), 1, null, null); Add_Error (Table.States (49)); Add_Goto (Table.States (49), 112, 35); Add_Goto (Table.States (49), 113, 36); Add_Goto (Table.States (49), 121, 37); Add_Goto (Table.States (49), 123, 38); Add_Goto (Table.States (49), 126, 39); Add_Goto (Table.States (49), 127, 40); Add_Goto (Table.States (49), 128, 41); Add_Goto (Table.States (49), 131, 42); Add_Goto (Table.States (49), 132, 43); Add_Goto (Table.States (49), 133, 44); Add_Goto (Table.States (49), 134, 45); Add_Goto (Table.States (49), 135, 46); Add_Goto (Table.States (49), 139, 47); Add_Goto (Table.States (49), 142, 229); Add_Goto (Table.States (49), 151, 50); Add_Goto (Table.States (49), 152, 51); Add_Goto (Table.States (49), 157, 52); Add_Goto (Table.States (49), 161, 53); Add_Goto (Table.States (49), 179, 54); Add_Goto (Table.States (49), 182, 55); Add_Goto (Table.States (49), 186, 56); Add_Goto (Table.States (49), 190, 57); Add_Goto (Table.States (49), 193, 58); Add_Goto (Table.States (49), 196, 59); Add_Goto (Table.States (49), 206, 60); Add_Goto (Table.States (49), 207, 61); Add_Goto (Table.States (49), 209, 62); Add_Goto (Table.States (49), 210, 63); Add_Goto (Table.States (49), 213, 64); Add_Goto (Table.States (49), 214, 65); Add_Goto (Table.States (49), 215, 66); Add_Goto (Table.States (49), 216, 67); Add_Goto (Table.States (49), 217, 68); Add_Goto (Table.States (49), 219, 69); Add_Goto (Table.States (49), 222, 70); Add_Goto (Table.States (49), 223, 71); Add_Goto (Table.States (49), 232, 72); Add_Goto (Table.States (49), 239, 73); Add_Goto (Table.States (49), 243, 74); Add_Goto (Table.States (49), 244, 75); Add_Goto (Table.States (49), 245, 76); Add_Goto (Table.States (49), 246, 77); Add_Goto (Table.States (49), 247, 78); Add_Goto (Table.States (49), 248, 79); Add_Goto (Table.States (49), 249, 80); Add_Goto (Table.States (49), 250, 81); Add_Goto (Table.States (49), 251, 82); Add_Goto (Table.States (49), 257, 83); Add_Goto (Table.States (49), 259, 84); Add_Goto (Table.States (49), 260, 85); Add_Goto (Table.States (49), 261, 86); Add_Goto (Table.States (49), 262, 87); Add_Goto (Table.States (49), 263, 88); Add_Goto (Table.States (49), 264, 89); Add_Goto (Table.States (49), 265, 90); Add_Goto (Table.States (49), 271, 91); Add_Goto (Table.States (49), 272, 92); Add_Goto (Table.States (49), 276, 93); Add_Goto (Table.States (49), 281, 94); Add_Goto (Table.States (49), 289, 95); Add_Goto (Table.States (49), 290, 96); Add_Goto (Table.States (49), 293, 97); Add_Goto (Table.States (49), 294, 98); Add_Goto (Table.States (49), 298, 99); Add_Goto (Table.States (49), 302, 100); Add_Goto (Table.States (49), 303, 101); Add_Goto (Table.States (49), 304, 102); Add_Goto (Table.States (49), 305, 103); Add_Goto (Table.States (49), 306, 104); Add_Goto (Table.States (49), 307, 105); Add_Goto (Table.States (49), 308, 106); Add_Goto (Table.States (49), 309, 107); Add_Goto (Table.States (49), 311, 108); Add_Goto (Table.States (49), 313, 109); Add_Goto (Table.States (49), 315, 110); Add_Goto (Table.States (49), 316, 111); Add_Goto (Table.States (49), 317, 112); Add_Goto (Table.States (49), 319, 113); Add_Goto (Table.States (49), 323, 114); Add_Goto (Table.States (49), 325, 115); Add_Goto (Table.States (49), 331, 116); Add_Goto (Table.States (49), 332, 117); Table.States (49).Kernel := To_Vector (((108, 143, 1, False), (143, 143, 2, True))); end Subr_1; procedure Subr_2 is begin Add_Action (Table.States (50), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (306, 2), 1, null, null); Table.States (50).Kernel := To_Vector ((0 => (306, 151, 0, False))); Table.States (50).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 306, 1))); Add_Action (Table.States (51), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (298, 2), 1, null, null); Table.States (51).Kernel := To_Vector ((0 => (298, 152, 0, False))); Table.States (51).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 298, 1))); Add_Action (Table.States (52), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (142, 3), 1, null, null); Table.States (52).Kernel := To_Vector ((0 => (142, 157, 0, False))); Table.States (52).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 142, 1))); Add_Action (Table.States (53), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 7), 1, null, null); Table.States (53).Kernel := To_Vector ((0 => (303, 161, 0, False))); Table.States (53).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (54), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 3), 1, null, null); Table.States (54).Kernel := To_Vector ((0 => (157, 179, 0, False))); Table.States (54).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (55), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (121, 1), 1, null, null); Table.States (55).Kernel := To_Vector ((0 => (121, 182, 0, False))); Table.States (55).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 121, 1))); Add_Action (Table.States (56), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 4), 1, null, null); Table.States (56).Kernel := To_Vector ((0 => (157, 186, 0, False))); Table.States (56).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (57), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 2), 1, null, null); Table.States (57).Kernel := To_Vector ((0 => (303, 190, 0, False))); Table.States (57).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (58), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 5), 1, null, null); Table.States (58).Kernel := To_Vector ((0 => (157, 193, 0, False))); Table.States (58).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (59), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 4), 1, null, null); Table.States (59).Kernel := To_Vector ((0 => (151, 196, 0, False))); Table.States (59).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (60), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (325, 0), 1, null, null); Table.States (60).Kernel := To_Vector ((0 => (325, 206, 0, False))); Table.States (60).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 325, 1))); Add_Action (Table.States (61), (35, 74, 96), (312, 1), 1, null, subprogram_specification_1_check'Access); Table.States (61).Kernel := To_Vector ((0 => (312, 207, 0, False))); Table.States (61).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 312, 1))); Add_Action (Table.States (62), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 6), 1, null, null); Table.States (62).Kernel := To_Vector ((0 => (157, 209, 0, False))); Table.States (62).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (63), 29, 7); Add_Action (Table.States (63), 47, 230); Add_Action (Table.States (63), 50, 18); Add_Error (Table.States (63)); Add_Goto (Table.States (63), 207, 61); Add_Goto (Table.States (63), 251, 231); Add_Goto (Table.States (63), 262, 87); Add_Goto (Table.States (63), 312, 232); Table.States (63).Kernel := To_Vector (((214, 210, 5, False), (216, 210, 3, False))); Table.States (63).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 50, 18))); Add_Action (Table.States (64), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 7), 1, null, null); Table.States (64).Kernel := To_Vector ((0 => (157, 213, 0, False))); Table.States (64).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (65), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (209, 1), 1, null, null); Table.States (65).Kernel := To_Vector ((0 => (209, 214, 0, False))); Table.States (65).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 209, 1))); Add_Action (Table.States (66), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (289, 3), 1, null, null); Table.States (66).Kernel := To_Vector ((0 => (289, 215, 0, False))); Table.States (66).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 289, 1))); Add_Action (Table.States (67), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (209, 0), 1, null, null); Table.States (67).Kernel := To_Vector ((0 => (209, 216, 0, False))); Table.States (67).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 209, 1))); Add_Action (Table.States (68), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (306, 0), 1, null, null); Table.States (68).Kernel := To_Vector ((0 => (306, 217, 0, False))); Table.States (68).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 306, 1))); Add_Action (Table.States (69), 81, 233); Add_Action (Table.States (69), 83, 234); Add_Error (Table.States (69)); Table.States (69).Kernel := To_Vector (((157, 219, 4, False), (186, 219, 3, False), (219, 219, 2, True), (244, 219, 4, False), (244, 219, 5, False), (244, 219, 11, False), (244, 219, 3, False), (244, 219, 4, False), (244, 219, 10, False))); Table.States (69).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 81, 233))); Add_Action (Table.States (70), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 0), 1, null, null); Table.States (70).Kernel := To_Vector ((0 => (151, 222, 0, False))); Table.States (70).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (71), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (325, 1), 1, null, null); Table.States (71).Kernel := To_Vector ((0 => (325, 223, 0, False))); Table.States (71).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 325, 1))); Add_Action (Table.States (72), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 2), 1, null, null); Table.States (72).Kernel := To_Vector ((0 => (151, 232, 0, False))); Table.States (72).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (73), 76, 235); Add_Action (Table.States (73), 82, 236); Add_Action (Table.States (73), 84, 237); Add_Action (Table.States (73), 96, 238); Add_Action (Table.States (73), 101, 239); Add_Action (Table.States (73), 102, 240); Add_Error (Table.States (73)); Add_Goto (Table.States (73), 115, 241); Add_Goto (Table.States (73), 322, 242); Table.States (73).Kernel := To_Vector (((123, 239, 2, False), (128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (261, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (73).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 238))); Add_Action (Table.States (74), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 8), 1, null, null); Table.States (74).Kernel := To_Vector ((0 => (157, 243, 0, False))); Table.States (74).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (75), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 10), 1, null, null); Table.States (75).Kernel := To_Vector ((0 => (157, 244, 0, False))); Table.States (75).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (76), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (289, 0), 1, null, null); Table.States (76).Kernel := To_Vector ((0 => (289, 245, 0, False))); Table.States (76).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 289, 1))); Add_Action (Table.States (77), 25, 243); Add_Action (Table.States (77), 29, 244); Add_Action (Table.States (77), 50, 245); Add_Error (Table.States (77)); Add_Goto (Table.States (77), 207, 246); Add_Goto (Table.States (77), 262, 247); Add_Goto (Table.States (77), 312, 248); Table.States (77).Kernel := To_Vector (((112, 246, 5, False), (179, 246, 6, False), (179, 246, 3, False), (193, 246, 7, False), (213, 246, 6, False), (213, 246, 6, False), (243, 246, 5, False), (307, 246, 6, False), (308, 246, 5, False), (309, 246, 3, False), (311, 246, 5, False))); Table.States (77).Minimal_Complete_Actions := To_Vector (((Shift, 25, 243), (Shift, 50, 245))); Add_Action (Table.States (78), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (263, 1), 1, null, null); Table.States (78).Kernel := To_Vector ((0 => (263, 247, 0, False))); Table.States (78).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 263, 1))); Add_Action (Table.States (79), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (135, 1), 1, null, null); Table.States (79).Kernel := To_Vector ((0 => (135, 248, 0, False))); Table.States (79).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 135, 1))); Add_Action (Table.States (80), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 11), 1, null, null); Table.States (80).Kernel := To_Vector ((0 => (157, 249, 0, False))); Table.States (80).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (81), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (289, 1), 1, null, null); Table.States (81).Kernel := To_Vector ((0 => (289, 250, 0, False))); Table.States (81).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 289, 1))); Add_Action (Table.States (82), 96, 249); Add_Error (Table.States (82)); Table.States (82).Kernel := To_Vector ((0 => (249, 251, 1, False))); Table.States (82).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 249))); Add_Action (Table.States (83), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 10), 1, null, null); Table.States (83).Kernel := To_Vector ((0 => (303, 257, 0, False))); Table.States (83).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (84), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (325, 3), 1, null, null); Table.States (84).Kernel := To_Vector ((0 => (325, 259, 0, False))); Table.States (84).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 325, 1))); Add_Action (Table.States (85), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (325, 2), 1, null, null); Table.States (85).Kernel := To_Vector ((0 => (325, 260, 0, False))); Table.States (85).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 325, 1))); Add_Action (Table.States (86), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 4), 1, null, null); Table.States (86).Kernel := To_Vector ((0 => (303, 261, 0, False))); Table.States (86).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (87), (35, 74, 96), (312, 0), 1, null, subprogram_specification_0_check'Access); Table.States (87).Kernel := To_Vector ((0 => (312, 262, 0, False))); Table.States (87).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 312, 1))); Add_Action (Table.States (88), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (134, 0), 1, null, null); Table.States (88).Kernel := To_Vector ((0 => (134, 263, 0, False))); Table.States (88).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 134, 1))); Add_Action (Table.States (89), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (263, 3), 1, null, null); Table.States (89).Kernel := To_Vector ((0 => (263, 264, 0, False))); Table.States (89).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 263, 1))); Add_Action (Table.States (90), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (135, 3), 1, null, null); Table.States (90).Kernel := To_Vector ((0 => (135, 265, 0, False))); Table.States (90).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 135, 1))); Add_Action (Table.States (91), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (206, 2), 1, null, null); Table.States (91).Kernel := To_Vector ((0 => (206, 271, 0, False))); Table.States (91).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 206, 1))); Add_Action (Table.States (92), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 4), 1, null, null); Table.States (92).Kernel := To_Vector ((0 => (239, 272, 0, True))); Table.States (92).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Table.States (92).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (93), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 9), 1, null, null); Table.States (93).Kernel := To_Vector ((0 => (303, 276, 0, False))); Table.States (93).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (94), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (121, 2), 1, null, null); Table.States (94).Kernel := To_Vector ((0 => (121, 281, 0, False))); Table.States (94).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 121, 1))); Add_Action (Table.States (95), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 12), 1, null, null); Table.States (95).Kernel := To_Vector ((0 => (157, 289, 0, False))); Table.States (95).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (96), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 6), 1, null, null); Table.States (96).Kernel := To_Vector ((0 => (303, 290, 0, False))); Table.States (96).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (97), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 2), 1, null, name_2_check'Access); Table.States (97).Kernel := To_Vector ((0 => (239, 293, 0, True))); Table.States (97).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Table.States (97).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (98), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (298, 0), 1, null, null); Table.States (98).Kernel := To_Vector ((0 => (298, 294, 0, False))); Table.States (98).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 298, 1))); Add_Action (Table.States (99), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (151, 6), 1, null, null); Table.States (99).Kernel := To_Vector ((0 => (151, 298, 0, False))); Table.States (99).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 151, 1))); Add_Action (Table.States (100), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 5), 1, null, null); Table.States (100).Kernel := To_Vector ((0 => (303, 302, 0, False))); Table.States (100).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 1))); Add_Action (Table.States (101), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (306, 1), 1, null, null); Table.States (101).Kernel := To_Vector ((0 => (306, 303, 0, False))); Table.States (101).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 306, 1))); Add_Action (Table.States (102), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 7), 1, null, null); Table.States (102).Kernel := To_Vector ((0 => (244, 304, 0, False))); Table.States (102).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 1))); Add_Action (Table.States (103), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 6), 1, null, null); Table.States (103).Kernel := To_Vector ((0 => (244, 305, 0, False))); Table.States (103).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 1))); Add_Action (Table.States (104), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (142, 4), 1, null, null); Table.States (104).Kernel := To_Vector ((0 => (142, 306, 0, False))); Table.States (104).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 142, 1))); Add_Action (Table.States (105), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (263, 0), 1, null, null); Table.States (105).Kernel := To_Vector ((0 => (263, 307, 0, False))); Table.States (105).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 263, 1))); Add_Action (Table.States (106), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (135, 0), 1, null, null); Table.States (106).Kernel := To_Vector ((0 => (135, 308, 0, False))); Table.States (106).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 135, 1))); Add_Action (Table.States (107), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 13), 1, null, null); Table.States (107).Kernel := To_Vector ((0 => (157, 309, 0, False))); Table.States (107).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (108), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (289, 2), 1, null, null); Table.States (108).Kernel := To_Vector ((0 => (289, 311, 0, False))); Table.States (108).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 289, 1))); Add_Action (Table.States (109), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 14), 1, null, null); Table.States (109).Kernel := To_Vector ((0 => (157, 313, 0, False))); Table.States (109).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (110), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (142, 1), 1, null, null); Table.States (110).Kernel := To_Vector ((0 => (142, 315, 0, False))); Table.States (110).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 142, 1))); Add_Action (Table.States (111), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (263, 2), 1, null, null); Table.States (111).Kernel := To_Vector ((0 => (263, 316, 0, False))); Table.States (111).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 263, 1))); Add_Action (Table.States (112), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (135, 2), 1, null, null); Table.States (112).Kernel := To_Vector ((0 => (135, 317, 0, False))); Table.States (112).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 135, 1))); Add_Action (Table.States (113), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (206, 1), 1, null, null); Table.States (113).Kernel := To_Vector ((0 => (206, 319, 0, False))); Table.States (113).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 206, 1))); Add_Action (Table.States (114), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (298, 1), 1, null, null); Table.States (114).Kernel := To_Vector ((0 => (298, 323, 0, False))); Table.States (114).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 298, 1))); Add_Action (Table.States (115), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 15), 1, null, null); Table.States (115).Kernel := To_Vector ((0 => (157, 325, 0, False))); Table.States (115).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (116), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 16), 1, null, null); Table.States (116).Kernel := To_Vector ((0 => (157, 331, 0, False))); Table.States (116).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 1))); Add_Action (Table.States (117), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (142, 0), 1, null, null); Table.States (117).Kernel := To_Vector ((0 => (142, 332, 0, False))); Table.States (117).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 142, 1))); Add_Action (Table.States (118), 21, Reduce, (116, 1), 0, null, null); Add_Action (Table.States (118), 76, 250); Add_Conflict (Table.States (118), 76, (116, 1), 0, null, null); Add_Action (Table.States (118), 96, Reduce, (116, 1), 0, null, null); Add_Error (Table.States (118)); Add_Goto (Table.States (118), 115, 251); Add_Goto (Table.States (118), 116, 252); Table.States (118).Kernel := To_Vector (((113, 104, 3, False), (113, 104, 1, False))); Table.States (118).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 116, 0))); Add_Action (Table.States (119), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 5), 1, name_5'Access, name_5_check'Access); Table.States (119).Kernel := To_Vector ((0 => (239, 104, 0, False))); Table.States (119).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (120), 76, 235); Add_Action (Table.States (120), 84, 237); Add_Action (Table.States (120), 96, 253); Add_Action (Table.States (120), 101, 239); Add_Action (Table.States (120), 102, 240); Add_Error (Table.States (120)); Add_Goto (Table.States (120), 115, 241); Add_Goto (Table.States (120), 322, 242); Table.States (120).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (303, 239, 1, False))); Table.States (120).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 253))); Add_Action (Table.States (121), 39, 122); Add_Action (Table.States (121), 41, 124); Add_Action (Table.States (121), 76, 126); Add_Action (Table.States (121), 103, 129); Add_Action (Table.States (121), 104, 119); Add_Action (Table.States (121), 105, 33); Add_Action (Table.States (121), 106, 34); Add_Error (Table.States (121)); Add_Goto (Table.States (121), 117, 130); Add_Goto (Table.States (121), 128, 41); Add_Goto (Table.States (121), 239, 134); Add_Goto (Table.States (121), 258, 254); Add_Goto (Table.States (121), 272, 92); Add_Goto (Table.States (121), 293, 97); Table.States (121).Kernel := To_Vector ((0 => (197, 3, 1, False))); Table.States (121).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (122), 104, 119); Add_Action (Table.States (122), 105, 33); Add_Action (Table.States (122), 106, 34); Add_Error (Table.States (122)); Add_Goto (Table.States (122), 128, 41); Add_Goto (Table.States (122), 239, 255); Add_Goto (Table.States (122), 272, 92); Add_Goto (Table.States (122), 293, 97); Table.States (122).Kernel := To_Vector ((0 => (258, 39, 1, False))); Table.States (122).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (123), 39, 122); Add_Action (Table.States (123), 41, 124); Add_Action (Table.States (123), 76, 126); Add_Action (Table.States (123), 103, 129); Add_Action (Table.States (123), 104, 119); Add_Action (Table.States (123), 105, 33); Add_Action (Table.States (123), 106, 34); Add_Error (Table.States (123)); Add_Goto (Table.States (123), 117, 130); Add_Goto (Table.States (123), 128, 41); Add_Goto (Table.States (123), 239, 134); Add_Goto (Table.States (123), 258, 256); Add_Goto (Table.States (123), 272, 92); Add_Goto (Table.States (123), 293, 97); Table.States (123).Kernel := To_Vector ((0 => (197, 40, 1, False))); Table.States (123).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (124), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99, 100), (258, 1), 1, null, null); Table.States (124).Kernel := To_Vector ((0 => (258, 41, 0, False))); Table.States (124).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (125), 104, 119); Add_Action (Table.States (125), 105, 33); Add_Action (Table.States (125), 106, 34); Add_Error (Table.States (125)); Add_Goto (Table.States (125), 128, 41); Add_Goto (Table.States (125), 239, 257); Add_Goto (Table.States (125), 272, 92); Add_Goto (Table.States (125), 293, 97); Table.States (125).Kernel := To_Vector (((275, 52, 2, True), (275, 52, 1, False))); Table.States (125).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (126), 3, 121); Add_Action (Table.States (126), 15, 258); Add_Action (Table.States (126), 28, 259); Add_Action (Table.States (126), 32, 260); Add_Action (Table.States (126), 39, 122); Add_Action (Table.States (126), 40, 261); Add_Action (Table.States (126), 41, 262); Add_Action (Table.States (126), 44, 263); Add_Action (Table.States (126), 52, 125); Add_Action (Table.States (126), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (126), 76, 126); Add_Action (Table.States (126), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (126), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (126), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (126), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (126), 94, 127); Add_Action (Table.States (126), 95, 128); Add_Action (Table.States (126), 103, 129); Add_Action (Table.States (126), 104, 119); Add_Action (Table.States (126), 105, 33); Add_Action (Table.States (126), 106, 264); Add_Error (Table.States (126)); Add_Goto (Table.States (126), 117, 130); Add_Goto (Table.States (126), 124, 265); Add_Goto (Table.States (126), 125, 266); Add_Goto (Table.States (126), 128, 41); Add_Goto (Table.States (126), 136, 267); Add_Goto (Table.States (126), 153, 268); Add_Goto (Table.States (126), 165, 269); Add_Goto (Table.States (126), 166, 270); Add_Goto (Table.States (126), 191, 271); Add_Goto (Table.States (126), 192, 272); Add_Goto (Table.States (126), 197, 133); Add_Goto (Table.States (126), 221, 273); Add_Goto (Table.States (126), 239, 274); Add_Goto (Table.States (126), 258, 135); Add_Goto (Table.States (126), 272, 92); Add_Goto (Table.States (126), 273, 275); Add_Goto (Table.States (126), 275, 136); Add_Goto (Table.States (126), 277, 276); Add_Goto (Table.States (126), 282, 137); Add_Goto (Table.States (126), 283, 138); Add_Goto (Table.States (126), 284, 139); Add_Goto (Table.States (126), 285, 140); Add_Goto (Table.States (126), 286, 141); Add_Goto (Table.States (126), 287, 142); Add_Goto (Table.States (126), 293, 97); Add_Goto (Table.States (126), 301, 277); Add_Goto (Table.States (126), 320, 144); Add_Goto (Table.States (126), 321, 145); Add_Goto (Table.States (126), 330, 146); Table.States (126).Kernel := To_Vector (((117, 76, 4, False), (117, 76, 2, False), (117, 76, 3, False), (117, 76, 3, False), (117, 76, 1, False))); Table.States (126).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Add_Action (Table.States (127), (3, 39, 40, 41, 76, 103, 104, 105, 106), (330, 1), 1, null, null); Table.States (127).Kernel := To_Vector ((0 => (330, 94, 0, False))); Table.States (127).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 330, 1))); Add_Action (Table.States (128), (3, 39, 40, 41, 76, 103, 104, 105, 106), (330, 0), 1, null, null); Table.States (128).Kernel := To_Vector ((0 => (330, 95, 0, False))); Table.States (128).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 330, 1))); Add_Action (Table.States (129), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99, 100), (258, 0), 1, primary_0'Access, null); Table.States (129).Kernel := To_Vector ((0 => (258, 103, 0, False))); Table.States (129).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (130), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99, 100), (258, 2), 1, primary_2'Access, null); Table.States (130).Kernel := To_Vector ((0 => (258, 117, 0, False))); Table.States (130).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (131), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (192, 0), 1, null, null); Table.States (131).Kernel := To_Vector ((0 => (192, 191, 0, True))); Table.States (131).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 1))); Table.States (131).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (132), 35, 278); Add_Error (Table.States (132)); Table.States (132).Kernel := To_Vector ((0 => (139, 192, 6, False))); Table.States (132).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 278))); Add_Action (Table.States (133), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99), (320, 1), 1, null, null); Table.States (133).Kernel := To_Vector ((0 => (320, 197, 0, False))); Table.States (133).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 320, 1))); Add_Action (Table.States (134), 10, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 20, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 21, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 22, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 23, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 33, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 35, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 37, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 38, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 40, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 42, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 43, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 53, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 55, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 68, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 74, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 75, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 76, 235); Add_Action (Table.States (134), 77, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 78, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 79, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 82, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 83, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 84, 237); Add_Action (Table.States (134), 85, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 86, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 87, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 88, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 89, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 91, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 92, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 94, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 95, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 96, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 97, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 98, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 99, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 100, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (134), 101, 239); Add_Action (Table.States (134), 102, 240); Add_Error (Table.States (134)); Add_Goto (Table.States (134), 115, 241); Add_Goto (Table.States (134), 322, 242); Table.States (134).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (258, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (134).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (135), 10, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 20, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 21, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 22, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 23, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 33, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 35, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 37, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 38, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 40, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 42, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 43, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 53, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 55, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 68, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 74, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 75, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 77, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 78, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 79, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 82, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 83, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 85, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 86, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 87, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 88, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 89, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 91, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 92, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 94, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 95, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 96, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 97, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 98, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 99, Reduce, (197, 1), 1, null, null); Add_Action (Table.States (135), 100, 279); Add_Error (Table.States (135)); Table.States (135).Kernel := To_Vector (((197, 258, 2, False), (197, 258, 0, False))); Table.States (135).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 197, 1))); Add_Action (Table.States (136), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (287, 4), 1, null, null); Table.States (136).Kernel := To_Vector ((0 => (287, 275, 0, True))); Table.States (136).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 1))); Table.States (136).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (137), 10, 280); Add_Conflict (Table.States (137), 10, (191, 1), 1, null, null); Add_Action (Table.States (137), 20, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 21, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 22, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 23, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 35, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 37, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 43, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 53, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 68, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 74, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 75, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 77, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 79, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 83, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 87, Reduce, (191, 1), 1, null, null); Add_Action (Table.States (137), 96, Reduce, (191, 1), 1, null, null); Add_Error (Table.States (137)); Table.States (137).Kernel := To_Vector (((191, 282, 0, True), (282, 282, 2, True))); Table.States (137).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (137).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (138), 10, 281); Add_Conflict (Table.States (138), 10, (191, 2), 1, null, null); Add_Action (Table.States (138), 20, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 21, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 22, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 23, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 35, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 37, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 43, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 53, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 68, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 74, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 75, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 77, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 79, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 83, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 87, Reduce, (191, 2), 1, null, null); Add_Action (Table.States (138), 96, Reduce, (191, 2), 1, null, null); Add_Error (Table.States (138)); Table.States (138).Kernel := To_Vector (((191, 283, 0, True), (283, 283, 3, True))); Table.States (138).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (138).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (139), 10, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 20, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 21, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 22, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 23, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 35, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 37, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 43, 282); Add_Conflict (Table.States (139), 43, (191, 3), 1, null, null); Add_Action (Table.States (139), 53, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 68, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 74, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 75, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 77, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 79, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 83, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 87, Reduce, (191, 3), 1, null, null); Add_Action (Table.States (139), 96, Reduce, (191, 3), 1, null, null); Add_Error (Table.States (139)); Table.States (139).Kernel := To_Vector (((191, 284, 0, True), (284, 284, 2, True))); Table.States (139).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (139).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (140), 10, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 20, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 21, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 22, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 23, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 35, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 37, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 43, 283); Add_Conflict (Table.States (140), 43, (191, 4), 1, null, null); Add_Action (Table.States (140), 53, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 68, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 74, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 75, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 77, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 79, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 83, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 87, Reduce, (191, 4), 1, null, null); Add_Action (Table.States (140), 96, Reduce, (191, 4), 1, null, null); Add_Error (Table.States (140)); Table.States (140).Kernel := To_Vector (((191, 285, 0, True), (285, 285, 3, True))); Table.States (140).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (140).Minimal_Complete_Actions_Recursive := True; end Subr_2; procedure Subr_3 is begin Add_Action (Table.States (141), 10, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 20, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 21, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 22, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 23, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 35, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 37, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 43, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 53, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 68, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 74, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 75, 284); Add_Conflict (Table.States (141), 75, (191, 5), 1, null, null); Add_Action (Table.States (141), 77, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 79, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 83, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 87, Reduce, (191, 5), 1, null, null); Add_Action (Table.States (141), 96, Reduce, (191, 5), 1, null, null); Add_Error (Table.States (141)); Table.States (141).Kernel := To_Vector (((191, 286, 0, True), (286, 286, 2, True))); Table.States (141).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (141).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (142), 10, 285); Add_Conflict (Table.States (142), 10, (191, 0), 1, null, null); Add_Action (Table.States (142), 20, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 21, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 22, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 23, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 35, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 37, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 43, 286); Add_Conflict (Table.States (142), 43, (191, 0), 1, null, null); Add_Action (Table.States (142), 53, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 68, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 74, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 75, 287); Add_Conflict (Table.States (142), 75, (191, 0), 1, null, null); Add_Action (Table.States (142), 77, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 79, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 83, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 87, Reduce, (191, 0), 1, null, null); Add_Action (Table.States (142), 96, Reduce, (191, 0), 1, null, null); Add_Error (Table.States (142)); Table.States (142).Kernel := To_Vector (((191, 287, 0, True), (282, 287, 2, True), (283, 287, 3, True), (284, 287, 2, True), (285, 287, 3, True), (286, 287, 2, True))); Table.States (142).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 191, 1))); Table.States (142).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (143), 10, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 20, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 21, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 22, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 23, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 33, 288); Add_Action (Table.States (143), 35, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 37, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 40, 289); Add_Action (Table.States (143), 43, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 53, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 68, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 74, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 75, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 77, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 79, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 83, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 86, 290); Add_Action (Table.States (143), 87, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 88, 291); Add_Action (Table.States (143), 89, 292); Add_Action (Table.States (143), 91, 293); Add_Action (Table.States (143), 92, 294); Add_Action (Table.States (143), 96, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (143), 98, 295); Add_Error (Table.States (143)); Add_Goto (Table.States (143), 288, 296); Table.States (143).Kernel := To_Vector (((287, 301, 3, False), (287, 301, 2, False), (287, 301, 2, False), (287, 301, 0, False))); Table.States (143).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 1))); Add_Action (Table.States (144), 10, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 20, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 21, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 22, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 23, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 33, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 35, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 37, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 38, 297); Add_Action (Table.States (144), 40, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 42, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 43, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 53, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 55, 298); Add_Action (Table.States (144), 68, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 74, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 75, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 77, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 78, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 79, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 82, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 83, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 85, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 86, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 87, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 88, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 89, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 91, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 92, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 94, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 95, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 96, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 97, 299); Add_Action (Table.States (144), 98, Reduce, (321, 1), 1, null, null); Add_Action (Table.States (144), 99, 300); Add_Error (Table.States (144)); Add_Goto (Table.States (144), 237, 301); Table.States (144).Kernel := To_Vector (((320, 320, 2, True), (321, 320, 0, False))); Table.States (144).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 321, 1))); Add_Action (Table.States (145), 10, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 20, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 21, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 22, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 23, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 33, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 35, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 37, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 40, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 42, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 43, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 53, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 68, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 74, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 75, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 77, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 78, 302); Add_Action (Table.States (145), 79, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 82, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 83, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 85, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 86, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 87, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 88, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 89, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 91, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 92, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 94, 303); Add_Action (Table.States (145), 95, 304); Add_Action (Table.States (145), 96, Reduce, (301, 1), 1, null, null); Add_Action (Table.States (145), 98, Reduce, (301, 1), 1, null, null); Add_Error (Table.States (145)); Add_Goto (Table.States (145), 130, 305); Table.States (145).Kernel := To_Vector (((301, 321, 0, False), (321, 321, 2, True))); Table.States (145).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 301, 1))); Add_Action (Table.States (146), 3, 121); Add_Action (Table.States (146), 39, 122); Add_Action (Table.States (146), 40, 123); Add_Action (Table.States (146), 41, 124); Add_Action (Table.States (146), 76, 126); Add_Action (Table.States (146), 103, 129); Add_Action (Table.States (146), 104, 119); Add_Action (Table.States (146), 105, 33); Add_Action (Table.States (146), 106, 34); Add_Error (Table.States (146)); Add_Goto (Table.States (146), 117, 130); Add_Goto (Table.States (146), 128, 41); Add_Goto (Table.States (146), 197, 133); Add_Goto (Table.States (146), 239, 134); Add_Goto (Table.States (146), 258, 135); Add_Goto (Table.States (146), 272, 92); Add_Goto (Table.States (146), 293, 97); Add_Goto (Table.States (146), 320, 144); Add_Goto (Table.States (146), 321, 306); Table.States (146).Kernel := To_Vector ((0 => (301, 330, 1, False))); Table.States (146).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (147), 3, 121); Add_Action (Table.States (147), 39, 122); Add_Action (Table.States (147), 40, 123); Add_Action (Table.States (147), 41, 124); Add_Action (Table.States (147), 52, 125); Add_Action (Table.States (147), 76, 126); Add_Action (Table.States (147), 94, 127); Add_Action (Table.States (147), 95, 128); Add_Action (Table.States (147), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (147), 103, 129); Add_Action (Table.States (147), 104, 119); Add_Action (Table.States (147), 105, 33); Add_Action (Table.States (147), 106, 34); Add_Error (Table.States (147)); Add_Goto (Table.States (147), 117, 130); Add_Goto (Table.States (147), 128, 41); Add_Goto (Table.States (147), 191, 131); Add_Goto (Table.States (147), 192, 307); Add_Goto (Table.States (147), 197, 133); Add_Goto (Table.States (147), 239, 134); Add_Goto (Table.States (147), 258, 135); Add_Goto (Table.States (147), 272, 92); Add_Goto (Table.States (147), 275, 136); Add_Goto (Table.States (147), 282, 137); Add_Goto (Table.States (147), 283, 138); Add_Goto (Table.States (147), 284, 139); Add_Goto (Table.States (147), 285, 140); Add_Goto (Table.States (147), 286, 141); Add_Goto (Table.States (147), 287, 142); Add_Goto (Table.States (147), 293, 97); Add_Goto (Table.States (147), 301, 143); Add_Goto (Table.States (147), 320, 144); Add_Goto (Table.States (147), 321, 145); Add_Goto (Table.States (147), 330, 146); Table.States (147).Kernel := To_Vector ((0 => (161, 70, 1, False))); Table.States (147).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (148), 96, 308); Add_Error (Table.States (148)); Table.States (148).Kernel := To_Vector ((0 => (161, 192, 1, False))); Table.States (148).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 308))); Add_Action (Table.States (149), (72, 96), (220, 0), 1, null, identifier_opt_0_check'Access); Table.States (149).Kernel := To_Vector ((0 => (220, 104, 0, False))); Table.States (149).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 1))); Add_Action (Table.States (150), 72, 309); Add_Action (Table.States (150), 96, 310); Add_Error (Table.States (150)); Table.States (150).Kernel := To_Vector (((190, 220, 2, False), (190, 220, 1, False))); Table.States (150).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 310))); Add_Action (Table.States (151), 33, 311); Add_Action (Table.States (151), 42, 312); Add_Action (Table.States (151), 71, Reduce, (163, 0), 1, null, null); Add_Conflict (Table.States (151), 71, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (151), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (151), 81, 313); Add_Action (Table.States (151), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (151), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (151), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (151)); Table.States (151).Kernel := To_Vector (((163, 104, 0, False), (230, 104, 5, False), (230, 104, 4, False), (230, 104, 3, False), (230, 104, 3, False), (230, 104, 2, False), (230, 104, 2, False), (239, 104, 0, False))); Table.States (151).Minimal_Complete_Actions := To_Vector (((Reduce, 163, 1), (Reduce, 239, 1))); Add_Action (Table.States (152), 71, Reduce, (163, 1), 1, null, null); Add_Conflict (Table.States (152), 71, (239, 7), 1, null, name_7_check'Access); Add_Action (Table.States (152), 76, Reduce, (239, 7), 1, null, name_7_check'Access); Add_Action (Table.States (152), 84, Reduce, (239, 7), 1, null, name_7_check'Access); Add_Action (Table.States (152), 101, Reduce, (239, 7), 1, null, name_7_check'Access); Add_Action (Table.States (152), 102, Reduce, (239, 7), 1, null, name_7_check'Access); Add_Error (Table.States (152)); Table.States (152).Kernel := To_Vector (((163, 105, 0, False), (239, 105, 0, False))); Table.States (152).Minimal_Complete_Actions := To_Vector (((Reduce, 163, 1), (Reduce, 239, 1))); Add_Action (Table.States (153), 71, 314); Add_Conflict (Table.States (153), 71, (239, 3), 1, null, null); Add_Action (Table.States (153), 76, Reduce, (239, 3), 1, null, null); Add_Action (Table.States (153), 84, Reduce, (239, 3), 1, null, null); Add_Action (Table.States (153), 101, Reduce, (239, 3), 1, null, null); Add_Action (Table.States (153), 102, Reduce, (239, 3), 1, null, null); Add_Error (Table.States (153)); Table.States (153).Kernel := To_Vector (((121, 128, 2, False), (239, 128, 0, True))); Table.States (153).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Table.States (153).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (154), 71, 315); Add_Error (Table.States (154)); Table.States (154).Kernel := To_Vector ((0 => (127, 163, 3, False))); Table.States (154).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 71, 315))); Add_Action (Table.States (155), (1 => 37), (231, 0), 1, null, null); Table.States (155).Kernel := To_Vector ((0 => (231, 230, 0, False))); Table.States (155).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 231, 1))); Add_Action (Table.States (156), (1 => 37), (229, 1), 2, iteration_scheme_1'Access, null); Table.States (156).Kernel := To_Vector ((0 => (229, 231, 0, False))); Table.States (156).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 229, 2))); Add_Action (Table.States (157), 71, 316); Add_Action (Table.States (157), 76, 235); Add_Action (Table.States (157), 84, 237); Add_Action (Table.States (157), 101, 239); Add_Action (Table.States (157), 102, 240); Add_Error (Table.States (157)); Add_Goto (Table.States (157), 115, 241); Add_Goto (Table.States (157), 322, 242); Table.States (157).Kernel := To_Vector (((128, 239, 2, True), (182, 239, 4, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (281, 239, 13, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (157).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 71, 316))); Add_Action (Table.States (158), 58, 317); Add_Action (Table.States (158), 76, 318); Add_Action (Table.States (158), 84, 237); Add_Action (Table.States (158), 101, 239); Add_Action (Table.States (158), 102, 240); Add_Error (Table.States (158)); Add_Goto (Table.States (158), 115, 241); Add_Goto (Table.States (158), 199, 319); Add_Goto (Table.States (158), 252, 320); Add_Goto (Table.States (158), 291, 321); Add_Goto (Table.States (158), 322, 242); Table.States (158).Kernel := To_Vector (((128, 239, 2, True), (207, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (158).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 58, 317))); Add_Action (Table.States (159), 104, 119); Add_Action (Table.States (159), 105, 33); Add_Action (Table.States (159), 106, 34); Add_Error (Table.States (159)); Add_Goto (Table.States (159), 128, 41); Add_Goto (Table.States (159), 239, 322); Add_Goto (Table.States (159), 272, 92); Add_Goto (Table.States (159), 293, 97); Table.States (159).Kernel := To_Vector ((0 => (215, 29, 4, False))); Table.States (159).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (160), 104, 119); Add_Action (Table.States (160), 105, 33); Add_Action (Table.States (160), 106, 34); Add_Error (Table.States (160)); Add_Goto (Table.States (160), 128, 41); Add_Goto (Table.States (160), 239, 323); Add_Goto (Table.States (160), 272, 92); Add_Goto (Table.States (160), 293, 97); Table.States (160).Kernel := To_Vector ((0 => (215, 47, 4, False))); Table.States (160).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (161), 104, 119); Add_Action (Table.States (161), 105, 33); Add_Action (Table.States (161), 106, 34); Add_Error (Table.States (161)); Add_Goto (Table.States (161), 128, 41); Add_Goto (Table.States (161), 239, 324); Add_Goto (Table.States (161), 272, 92); Add_Goto (Table.States (161), 293, 97); Table.States (161).Kernel := To_Vector ((0 => (215, 50, 4, False))); Table.States (161).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (162), 104, 325); Add_Error (Table.States (162)); Table.States (162).Kernel := To_Vector (((201, 69, 4, False), (201, 69, 4, False), (201, 69, 2, False))); Table.States (162).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 325))); Add_Action (Table.States (163), 29, 7); Add_Action (Table.States (163), 47, 326); Add_Action (Table.States (163), 50, 18); Add_Error (Table.States (163)); Add_Goto (Table.States (163), 207, 61); Add_Goto (Table.States (163), 262, 87); Add_Goto (Table.States (163), 312, 327); Table.States (163).Kernel := To_Vector (((200, 74, 6, False), (200, 74, 5, False), (200, 74, 5, False), (200, 74, 3, False), (204, 74, 6, False))); Table.States (163).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 50, 18))); Add_Action (Table.States (164), (81, 83), (219, 1), 1, identifier_list_1'Access, null); Table.States (164).Kernel := To_Vector ((0 => (219, 104, 0, False))); Table.States (164).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 219, 1))); Add_Action (Table.States (165), (29, 47, 48, 50, 69, 71, 74, 104), (212, 0), 1, null, null); Table.States (165).Kernel := To_Vector ((0 => (212, 198, 0, False))); Table.States (165).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (166), (29, 47, 48, 50, 69, 71, 74, 104), (212, 2), 1, null, null); Table.States (166).Kernel := To_Vector ((0 => (212, 200, 0, False))); Table.States (166).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (167), (29, 47, 48, 50, 69, 71, 74, 104), (212, 1), 1, null, null); Table.States (167).Kernel := To_Vector ((0 => (212, 201, 0, False))); Table.States (167).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (168), (29, 47, 48, 50, 69, 71, 74, 104), (212, 3), 1, null, null); Table.States (168).Kernel := To_Vector ((0 => (212, 204, 0, False))); Table.States (168).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (169), 29, Reduce, (210, 0), 2, generic_formal_part_0'Access, null); Add_Action (Table.States (169), 47, Reduce, (210, 0), 2, generic_formal_part_0'Access, null); Add_Action (Table.States (169), 48, 16); Add_Action (Table.States (169), 50, Reduce, (210, 0), 2, generic_formal_part_0'Access, null); Add_Action (Table.States (169), 69, 162); Add_Action (Table.States (169), 71, 28); Add_Action (Table.States (169), 74, 163); Add_Action (Table.States (169), 104, 164); Add_Error (Table.States (169)); Add_Goto (Table.States (169), 198, 165); Add_Goto (Table.States (169), 200, 166); Add_Goto (Table.States (169), 201, 167); Add_Goto (Table.States (169), 204, 168); Add_Goto (Table.States (169), 212, 328); Add_Goto (Table.States (169), 219, 171); Add_Goto (Table.States (169), 257, 172); Add_Goto (Table.States (169), 331, 173); Table.States (169).Kernel := To_Vector (((210, 211, 0, False), (211, 211, 3, True))); Table.States (169).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 210, 2))); Add_Action (Table.States (170), (29, 47, 48, 50, 69, 71, 74, 104), (211, 1), 1, null, null); Table.States (170).Kernel := To_Vector ((0 => (211, 212, 0, False))); Table.States (170).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 211, 1))); Add_Action (Table.States (171), 81, 329); Add_Action (Table.States (171), 83, 234); Add_Error (Table.States (171)); Table.States (171).Kernel := To_Vector (((198, 219, 4, False), (198, 219, 5, False), (198, 219, 3, False), (198, 219, 4, False), (219, 219, 2, True))); Table.States (171).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 81, 329))); Add_Action (Table.States (172), (29, 47, 48, 50, 69, 71, 74, 104), (212, 4), 1, null, null); Table.States (172).Kernel := To_Vector ((0 => (212, 257, 0, False))); Table.States (172).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (173), (29, 47, 48, 50, 69, 71, 74, 104), (212, 5), 1, null, null); Table.States (173).Kernel := To_Vector ((0 => (212, 331, 0, False))); Table.States (173).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 212, 1))); Add_Action (Table.States (174), 96, 330); Add_Error (Table.States (174)); Table.States (174).Kernel := To_Vector ((0 => (303, 104, 1, False))); Table.States (174).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 330))); Add_Action (Table.States (175), 68, 331); Add_Error (Table.States (175)); Table.States (175).Kernel := To_Vector (((222, 192, 7, False), (222, 192, 5, False), (222, 192, 6, False), (222, 192, 4, False))); Table.States (175).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 331))); Add_Action (Table.States (176), 74, 332); Add_Error (Table.States (176)); Table.States (176).Kernel := To_Vector ((0 => (332, 49, 3, False))); Table.States (176).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 332))); Add_Action (Table.States (177), 104, 119); Add_Action (Table.States (177), 105, 33); Add_Action (Table.States (177), 106, 34); Add_Error (Table.States (177)); Add_Goto (Table.States (177), 128, 41); Add_Goto (Table.States (177), 238, 333); Add_Goto (Table.States (177), 239, 219); Add_Goto (Table.States (177), 272, 92); Add_Goto (Table.States (177), 293, 97); Table.States (177).Kernel := To_Vector ((0 => (332, 74, 2, False))); Table.States (177).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (178), (25, 29, 50), (246, 0), 2, overriding_indicator_opt_0'Access, null); Table.States (178).Kernel := To_Vector ((0 => (246, 46, 0, False))); Table.States (178).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 246, 2))); Add_Action (Table.States (179), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 0), 2, simple_statement_0'Access, null); Table.States (179).Kernel := To_Vector ((0 => (303, 96, 0, False))); Table.States (179).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 2))); Add_Action (Table.States (180), 104, 119); Add_Action (Table.States (180), 105, 33); Add_Action (Table.States (180), 106, 34); Add_Error (Table.States (180)); Add_Goto (Table.States (180), 128, 41); Add_Goto (Table.States (180), 239, 334); Add_Goto (Table.States (180), 272, 92); Add_Goto (Table.States (180), 293, 97); Table.States (180).Kernel := To_Vector (((247, 14, 5, False), (247, 14, 4, False), (248, 14, 4, False))); Table.States (180).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (181), 35, 335); Add_Conflict (Table.States (181), 35, (122, 1), 0, null, null); Add_Action (Table.States (181), 56, 336); Add_Action (Table.States (181), 74, 337); Add_Action (Table.States (181), 76, 235); Add_Action (Table.States (181), 84, 237); Add_Action (Table.States (181), 101, 239); Add_Action (Table.States (181), 102, 240); Add_Error (Table.States (181)); Add_Goto (Table.States (181), 115, 241); Add_Goto (Table.States (181), 122, 338); Add_Goto (Table.States (181), 322, 242); Table.States (181).Kernel := To_Vector (((128, 239, 2, True), (213, 239, 4, False), (239, 239, 5, True), (239, 239, 2, True), (250, 239, 3, False), (251, 239, 3, False), (251, 239, 2, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (181).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (182), 76, 339); Add_Action (Table.States (182), 96, 340); Add_Error (Table.States (182)); Table.States (182).Kernel := To_Vector (((257, 104, 3, False), (257, 104, 5, False), (257, 104, 1, False))); Table.States (182).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 340))); Add_Action (Table.States (183), 104, 341); Add_Action (Table.States (183), 105, 152); Add_Action (Table.States (183), 106, 34); Add_Error (Table.States (183)); Add_Goto (Table.States (183), 128, 153); Add_Goto (Table.States (183), 163, 154); Add_Goto (Table.States (183), 239, 157); Add_Goto (Table.States (183), 272, 92); Add_Goto (Table.States (183), 293, 97); Table.States (183).Kernel := To_Vector (((121, 28, 5, False), (127, 28, 4, False), (182, 28, 5, False), (281, 28, 14, False))); Table.States (183).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 341))); Add_Action (Table.States (184), 104, 119); Add_Action (Table.States (184), 105, 33); Add_Action (Table.States (184), 106, 34); Add_Error (Table.States (184)); Add_Goto (Table.States (184), 128, 41); Add_Goto (Table.States (184), 238, 342); Add_Goto (Table.States (184), 239, 219); Add_Goto (Table.States (184), 272, 92); Add_Goto (Table.States (184), 293, 97); Table.States (184).Kernel := To_Vector ((0 => (332, 74, 2, False))); Table.States (184).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (185), 81, 343); Add_Conflict (Table.States (185), 81, (219, 1), 1, identifier_list_1'Access, null); Add_Action (Table.States (185), 83, Reduce, (219, 1), 1, identifier_list_1'Access, null); Add_Error (Table.States (185)); Table.States (185).Kernel := To_Vector (((219, 104, 0, False), (245, 104, 5, False), (245, 104, 6, False), (245, 104, 5, False))); Table.States (185).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 219, 1))); Add_Action (Table.States (186), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (142, 2), 2, compilation_unit_2'Access, null); Table.States (186).Kernel := To_Vector ((0 => (142, 157, 0, False))); Table.States (186).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 142, 2))); Add_Action (Table.States (187), 35, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (187), 74, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (187), 76, 318); Add_Action (Table.States (187), 84, 237); Add_Action (Table.States (187), 96, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (187), 101, 239); Add_Action (Table.States (187), 102, 240); Add_Error (Table.States (187)); Add_Goto (Table.States (187), 115, 241); Add_Goto (Table.States (187), 199, 344); Add_Goto (Table.States (187), 253, 345); Add_Goto (Table.States (187), 322, 242); Table.States (187).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (262, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (187).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (188), 104, 346); Add_Error (Table.States (188)); Table.States (188).Kernel := To_Vector (((264, 14, 4, False), (265, 14, 4, False))); Table.States (188).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 346))); Add_Action (Table.States (189), 104, 347); Add_Error (Table.States (189)); Table.States (189).Kernel := To_Vector (((271, 69, 7, False), (271, 69, 4, False))); Table.States (189).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 347))); Add_Action (Table.States (190), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (190), 74, 337); Add_Error (Table.States (190)); Add_Goto (Table.States (190), 122, 348); Table.States (190).Kernel := To_Vector (((304, 104, 6, False), (304, 104, 3, False))); Table.States (190).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (191), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (276, 2), 2, raise_statement_2'Access, null); Table.States (191).Kernel := To_Vector ((0 => (276, 96, 0, False))); Table.States (191).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 276, 2))); Add_Action (Table.States (192), 74, 349); Add_Action (Table.States (192), 76, 235); Add_Action (Table.States (192), 84, 237); Add_Action (Table.States (192), 96, 350); Add_Action (Table.States (192), 101, 239); Add_Action (Table.States (192), 102, 240); Add_Error (Table.States (192)); Add_Goto (Table.States (192), 115, 241); Add_Goto (Table.States (192), 322, 242); Table.States (192).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (276, 239, 2, False), (276, 239, 1, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (192).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 350))); Add_Action (Table.States (193), 74, 351); Add_Action (Table.States (193), 76, 235); Add_Action (Table.States (193), 84, 237); Add_Action (Table.States (193), 96, 352); Add_Action (Table.States (193), 101, 239); Add_Action (Table.States (193), 102, 240); Add_Error (Table.States (193)); Add_Goto (Table.States (193), 115, 241); Add_Goto (Table.States (193), 322, 242); Table.States (193).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (290, 239, 3, False), (290, 239, 1, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (193).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 352))); Add_Action (Table.States (194), 10, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 33, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 38, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 40, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 43, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 55, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 75, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 78, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 81, 353); Add_Action (Table.States (194), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 86, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 88, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 89, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 91, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 92, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 94, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 95, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 96, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 97, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 98, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 99, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 100, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (194), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (194)); Table.States (194).Kernel := To_Vector (((194, 104, 3, False), (194, 104, 2, False), (239, 104, 0, False))); Table.States (194).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (195), 96, 354); Add_Error (Table.States (195)); Table.States (195).Kernel := To_Vector ((0 => (302, 192, 1, False))); Table.States (195).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 354))); Add_Action (Table.States (196), 21, Reduce, (195, 0), 1, null, null); Add_Action (Table.States (196), 96, 355); Add_Error (Table.States (196)); Table.States (196).Kernel := To_Vector (((195, 194, 0, False), (196, 194, 1, False))); Table.States (196).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 195, 1))); Add_Action (Table.States (197), 21, 356); Add_Error (Table.States (197)); Table.States (197).Kernel := To_Vector ((0 => (196, 195, 4, False))); Table.States (197).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 21, 356))); Add_Action (Table.States (198), 104, 119); Add_Action (Table.States (198), 105, 33); Add_Action (Table.States (198), 106, 34); Add_Error (Table.States (198)); Add_Goto (Table.States (198), 128, 41); Add_Goto (Table.States (198), 239, 357); Add_Goto (Table.States (198), 272, 92); Add_Goto (Table.States (198), 293, 97); Table.States (198).Kernel := To_Vector ((0 => (315, 76, 8, False))); Table.States (198).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (199), 96, 358); Add_Error (Table.States (199)); Table.States (199).Kernel := To_Vector ((0 => (295, 67, 1, False))); Table.States (199).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 358))); Add_Action (Table.States (200), 3, 121); Add_Action (Table.States (200), 39, 122); Add_Action (Table.States (200), 40, 123); Add_Action (Table.States (200), 41, 124); Add_Action (Table.States (200), 52, 125); Add_Action (Table.States (200), 76, 126); Add_Action (Table.States (200), 87, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (200), 94, 127); Add_Action (Table.States (200), 95, 128); Add_Action (Table.States (200), 103, 129); Add_Action (Table.States (200), 104, 119); Add_Action (Table.States (200), 105, 33); Add_Action (Table.States (200), 106, 34); Add_Error (Table.States (200)); Add_Goto (Table.States (200), 117, 130); Add_Goto (Table.States (200), 128, 41); Add_Goto (Table.States (200), 191, 131); Add_Goto (Table.States (200), 192, 359); Add_Goto (Table.States (200), 197, 133); Add_Goto (Table.States (200), 239, 134); Add_Goto (Table.States (200), 258, 135); Add_Goto (Table.States (200), 272, 92); Add_Goto (Table.States (200), 275, 136); Add_Goto (Table.States (200), 282, 137); Add_Goto (Table.States (200), 283, 138); Add_Goto (Table.States (200), 284, 139); Add_Goto (Table.States (200), 285, 140); Add_Goto (Table.States (200), 286, 141); Add_Goto (Table.States (200), 287, 142); Add_Goto (Table.States (200), 293, 97); Add_Goto (Table.States (200), 301, 143); Add_Goto (Table.States (200), 320, 144); Add_Goto (Table.States (200), 321, 145); Add_Goto (Table.States (200), 330, 146); Table.States (200).Kernel := To_Vector (((295, 72, 4, False), (295, 72, 3, False), (295, 72, 3, False))); Table.States (200).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); end Subr_3; procedure Subr_4 is begin Add_Action (Table.States (201), 4, 1); Add_Action (Table.States (201), 5, 2); Add_Action (Table.States (201), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (201), 15, 3); Add_Action (Table.States (201), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (201), 18, 4); Add_Action (Table.States (201), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (201), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (201), 27, 5); Add_Action (Table.States (201), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (201), 31, 9); Add_Action (Table.States (201), 32, 10); Add_Action (Table.States (201), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (201), 41, 13); Add_Action (Table.States (201), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (201), 48, 16); Add_Action (Table.States (201), 52, 20); Add_Action (Table.States (201), 57, 21); Add_Action (Table.States (201), 58, 22); Add_Action (Table.States (201), 61, 24); Add_Action (Table.States (201), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (201), 93, 31); Add_Action (Table.States (201), 104, 360); Add_Action (Table.States (201), 105, 33); Add_Action (Table.States (201), 106, 34); Add_Error (Table.States (201)); Add_Goto (Table.States (201), 113, 36); Add_Goto (Table.States (201), 123, 38); Add_Goto (Table.States (201), 126, 39); Add_Goto (Table.States (201), 128, 41); Add_Goto (Table.States (201), 131, 42); Add_Goto (Table.States (201), 132, 43); Add_Goto (Table.States (201), 133, 44); Add_Goto (Table.States (201), 139, 47); Add_Goto (Table.States (201), 151, 50); Add_Goto (Table.States (201), 152, 51); Add_Goto (Table.States (201), 161, 53); Add_Goto (Table.States (201), 190, 57); Add_Goto (Table.States (201), 196, 59); Add_Goto (Table.States (201), 217, 68); Add_Goto (Table.States (201), 222, 70); Add_Goto (Table.States (201), 232, 72); Add_Goto (Table.States (201), 239, 73); Add_Goto (Table.States (201), 257, 83); Add_Goto (Table.States (201), 261, 86); Add_Goto (Table.States (201), 272, 92); Add_Goto (Table.States (201), 276, 93); Add_Goto (Table.States (201), 290, 96); Add_Goto (Table.States (201), 293, 97); Add_Goto (Table.States (201), 294, 98); Add_Goto (Table.States (201), 298, 99); Add_Goto (Table.States (201), 299, 361); Add_Goto (Table.States (201), 300, 362); Add_Goto (Table.States (201), 302, 100); Add_Goto (Table.States (201), 303, 101); Add_Goto (Table.States (201), 306, 363); Add_Goto (Table.States (201), 323, 114); Table.States (201).Kernel := To_Vector ((0 => (295, 113, 0, False))); Table.States (201).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (202), (22, 24, 43), (295, 5), 1, null, null); Table.States (202).Kernel := To_Vector ((0 => (295, 160, 0, False))); Table.States (202).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 1))); Add_Action (Table.States (203), 4, 1); Add_Action (Table.States (203), 5, 2); Add_Action (Table.States (203), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (203), 15, 3); Add_Action (Table.States (203), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (203), 18, 4); Add_Action (Table.States (203), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (203), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (203), 27, 5); Add_Action (Table.States (203), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (203), 31, 9); Add_Action (Table.States (203), 32, 10); Add_Action (Table.States (203), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (203), 41, 13); Add_Action (Table.States (203), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (203), 48, 16); Add_Action (Table.States (203), 52, 20); Add_Action (Table.States (203), 57, 21); Add_Action (Table.States (203), 58, 22); Add_Action (Table.States (203), 61, 24); Add_Action (Table.States (203), 68, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (203), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (203), 93, 31); Add_Action (Table.States (203), 104, 360); Add_Action (Table.States (203), 105, 33); Add_Action (Table.States (203), 106, 34); Add_Error (Table.States (203)); Add_Goto (Table.States (203), 113, 36); Add_Goto (Table.States (203), 123, 38); Add_Goto (Table.States (203), 126, 39); Add_Goto (Table.States (203), 128, 41); Add_Goto (Table.States (203), 131, 42); Add_Goto (Table.States (203), 132, 43); Add_Goto (Table.States (203), 133, 44); Add_Goto (Table.States (203), 139, 47); Add_Goto (Table.States (203), 151, 50); Add_Goto (Table.States (203), 152, 51); Add_Goto (Table.States (203), 161, 53); Add_Goto (Table.States (203), 190, 57); Add_Goto (Table.States (203), 196, 59); Add_Goto (Table.States (203), 217, 68); Add_Goto (Table.States (203), 222, 70); Add_Goto (Table.States (203), 232, 72); Add_Goto (Table.States (203), 239, 73); Add_Goto (Table.States (203), 257, 83); Add_Goto (Table.States (203), 261, 86); Add_Goto (Table.States (203), 272, 92); Add_Goto (Table.States (203), 276, 93); Add_Goto (Table.States (203), 290, 96); Add_Goto (Table.States (203), 293, 97); Add_Goto (Table.States (203), 294, 98); Add_Goto (Table.States (203), 298, 99); Add_Goto (Table.States (203), 299, 361); Add_Goto (Table.States (203), 300, 364); Add_Goto (Table.States (203), 302, 100); Add_Goto (Table.States (203), 303, 101); Add_Goto (Table.States (203), 306, 363); Add_Goto (Table.States (203), 323, 114); Table.States (203).Kernel := To_Vector (((160, 161, 0, False), (324, 161, 0, False))); Table.States (203).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (204), 22, 365); Add_Action (Table.States (204), 43, 366); Add_Error (Table.States (204)); Table.States (204).Kernel := To_Vector (((152, 178, 4, False), (323, 178, 6, False))); Table.States (204).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 22, 365))); Add_Action (Table.States (205), 4, 1); Add_Action (Table.States (205), 5, 2); Add_Action (Table.States (205), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (205), 15, 3); Add_Action (Table.States (205), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (205), 18, 4); Add_Action (Table.States (205), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (205), 27, 5); Add_Action (Table.States (205), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (205), 31, 9); Add_Action (Table.States (205), 32, 10); Add_Action (Table.States (205), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (205), 41, 13); Add_Action (Table.States (205), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (205), 48, 16); Add_Action (Table.States (205), 52, 20); Add_Action (Table.States (205), 57, 21); Add_Action (Table.States (205), 58, 22); Add_Action (Table.States (205), 61, 24); Add_Action (Table.States (205), 68, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (205), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (205), 76, 235); Add_Action (Table.States (205), 84, 237); Add_Action (Table.States (205), 93, 31); Add_Action (Table.States (205), 96, 238); Add_Action (Table.States (205), 101, 239); Add_Action (Table.States (205), 102, 240); Add_Action (Table.States (205), 104, 360); Add_Action (Table.States (205), 105, 33); Add_Action (Table.States (205), 106, 34); Add_Error (Table.States (205)); Add_Goto (Table.States (205), 113, 36); Add_Goto (Table.States (205), 115, 241); Add_Goto (Table.States (205), 123, 38); Add_Goto (Table.States (205), 126, 39); Add_Goto (Table.States (205), 128, 41); Add_Goto (Table.States (205), 131, 42); Add_Goto (Table.States (205), 132, 43); Add_Goto (Table.States (205), 133, 44); Add_Goto (Table.States (205), 139, 47); Add_Goto (Table.States (205), 151, 50); Add_Goto (Table.States (205), 152, 51); Add_Goto (Table.States (205), 161, 53); Add_Goto (Table.States (205), 190, 57); Add_Goto (Table.States (205), 196, 59); Add_Goto (Table.States (205), 217, 68); Add_Goto (Table.States (205), 222, 70); Add_Goto (Table.States (205), 232, 72); Add_Goto (Table.States (205), 239, 73); Add_Goto (Table.States (205), 257, 83); Add_Goto (Table.States (205), 261, 86); Add_Goto (Table.States (205), 272, 92); Add_Goto (Table.States (205), 276, 93); Add_Goto (Table.States (205), 290, 96); Add_Goto (Table.States (205), 293, 97); Add_Goto (Table.States (205), 294, 98); Add_Goto (Table.States (205), 298, 99); Add_Goto (Table.States (205), 299, 361); Add_Goto (Table.States (205), 300, 367); Add_Goto (Table.States (205), 302, 100); Add_Goto (Table.States (205), 303, 101); Add_Goto (Table.States (205), 306, 363); Add_Goto (Table.States (205), 322, 242); Add_Goto (Table.States (205), 323, 114); Table.States (205).Kernel := To_Vector (((128, 239, 2, True), (178, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (261, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (324, 239, 0, False))); Table.States (205).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (206), 4, 1); Add_Action (Table.States (206), 5, 2); Add_Action (Table.States (206), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (206), 15, 3); Add_Action (Table.States (206), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (206), 18, 4); Add_Action (Table.States (206), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (206), 27, 5); Add_Action (Table.States (206), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (206), 31, 9); Add_Action (Table.States (206), 32, 10); Add_Action (Table.States (206), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (206), 41, 13); Add_Action (Table.States (206), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (206), 48, 16); Add_Action (Table.States (206), 52, 20); Add_Action (Table.States (206), 57, 21); Add_Action (Table.States (206), 58, 22); Add_Action (Table.States (206), 61, 24); Add_Action (Table.States (206), 68, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (206), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (206), 93, 31); Add_Action (Table.States (206), 104, 360); Add_Action (Table.States (206), 105, 33); Add_Action (Table.States (206), 106, 34); Add_Error (Table.States (206)); Add_Goto (Table.States (206), 113, 36); Add_Goto (Table.States (206), 123, 38); Add_Goto (Table.States (206), 126, 39); Add_Goto (Table.States (206), 128, 41); Add_Goto (Table.States (206), 131, 42); Add_Goto (Table.States (206), 132, 43); Add_Goto (Table.States (206), 133, 44); Add_Goto (Table.States (206), 139, 47); Add_Goto (Table.States (206), 151, 50); Add_Goto (Table.States (206), 152, 51); Add_Goto (Table.States (206), 161, 53); Add_Goto (Table.States (206), 190, 57); Add_Goto (Table.States (206), 196, 59); Add_Goto (Table.States (206), 217, 68); Add_Goto (Table.States (206), 222, 70); Add_Goto (Table.States (206), 232, 72); Add_Goto (Table.States (206), 239, 73); Add_Goto (Table.States (206), 257, 83); Add_Goto (Table.States (206), 261, 86); Add_Goto (Table.States (206), 272, 92); Add_Goto (Table.States (206), 276, 93); Add_Goto (Table.States (206), 290, 96); Add_Goto (Table.States (206), 293, 97); Add_Goto (Table.States (206), 294, 98); Add_Goto (Table.States (206), 298, 99); Add_Goto (Table.States (206), 299, 361); Add_Goto (Table.States (206), 300, 368); Add_Goto (Table.States (206), 302, 100); Add_Goto (Table.States (206), 303, 101); Add_Goto (Table.States (206), 306, 363); Add_Goto (Table.States (206), 323, 114); Table.States (206).Kernel := To_Vector (((178, 261, 0, False), (324, 261, 0, False))); Table.States (206).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (207), (22, 24, 43), (296, 1), 1, select_alternative_list_1'Access, null); Table.States (207).Kernel := To_Vector ((0 => (296, 295, 0, False))); Table.States (207).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 296, 1))); Add_Action (Table.States (208), 22, Reduce, (297, 0), 1, null, null); Add_Action (Table.States (208), 24, Reduce, (297, 0), 1, null, null); Add_Action (Table.States (208), 43, 369); Add_Error (Table.States (208)); Table.States (208).Kernel := To_Vector (((296, 296, 3, True), (297, 296, 0, False))); Table.States (208).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 297, 1))); Add_Action (Table.States (209), 22, 370); Add_Action (Table.States (209), 24, 371); Add_Error (Table.States (209)); Table.States (209).Kernel := To_Vector (((294, 297, 4, False), (294, 297, 3, False))); Table.States (209).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 371))); Add_Action (Table.States (210), 68, 372); Add_Error (Table.States (210)); Table.States (210).Kernel := To_Vector ((0 => (126, 324, 5, False))); Table.States (210).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 372))); Add_Action (Table.States (211), 35, 373); Add_Error (Table.States (211)); Table.States (211).Kernel := To_Vector ((0 => (313, 104, 3, False))); Table.States (211).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 373))); Add_Action (Table.States (212), 104, 374); Add_Error (Table.States (212)); Table.States (212).Kernel := To_Vector (((316, 14, 5, False), (317, 14, 4, False))); Table.States (212).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 374))); Add_Action (Table.States (213), 104, 375); Add_Error (Table.States (213)); Table.States (213).Kernel := To_Vector (((319, 69, 7, False), (319, 69, 4, False), (319, 69, 2, False))); Table.States (213).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 375))); Add_Action (Table.States (214), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (214), 74, 337); Add_Action (Table.States (214), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (214)); Add_Goto (Table.States (214), 122, 376); Table.States (214).Kernel := To_Vector (((305, 104, 6, False), (305, 104, 3, False), (305, 104, 1, False))); Table.States (214).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (215), 35, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (215), 76, 377); Add_Action (Table.States (215), 96, Reduce, (169, 2), 0, null, null); Add_Error (Table.States (215)); Add_Goto (Table.States (215), 169, 378); Table.States (215).Kernel := To_Vector (((206, 104, 3, False), (223, 104, 3, False), (223, 104, 1, False), (259, 104, 6, False), (260, 104, 3, False))); Table.States (215).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 0))); Add_Action (Table.States (216), 69, 379); Add_Error (Table.States (216)); Table.States (216).Kernel := To_Vector ((0 => (331, 9, 3, False))); Table.States (216).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 69, 379))); Add_Action (Table.States (217), 104, 119); Add_Action (Table.States (217), 105, 33); Add_Action (Table.States (217), 106, 34); Add_Error (Table.States (217)); Add_Goto (Table.States (217), 128, 41); Add_Goto (Table.States (217), 238, 380); Add_Goto (Table.States (217), 239, 219); Add_Goto (Table.States (217), 272, 92); Add_Goto (Table.States (217), 293, 97); Table.States (217).Kernel := To_Vector ((0 => (331, 69, 2, False))); Table.States (217).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (218), 83, 381); Add_Action (Table.States (218), 96, 382); Add_Error (Table.States (218)); Table.States (218).Kernel := To_Vector (((238, 238, 2, True), (331, 238, 1, False))); Table.States (218).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 382))); Add_Action (Table.States (219), 76, 235); Add_Action (Table.States (219), 83, Reduce, (238, 1), 1, null, null); Add_Action (Table.States (219), 84, 237); Add_Action (Table.States (219), 96, Reduce, (238, 1), 1, null, null); Add_Action (Table.States (219), 101, 239); Add_Action (Table.States (219), 102, 240); Add_Error (Table.States (219)); Add_Goto (Table.States (219), 115, 241); Add_Goto (Table.States (219), 322, 242); Table.States (219).Kernel := To_Vector (((128, 239, 2, True), (238, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (219).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 238, 1))); Add_Action (Table.States (220), (1 => 37), (229, 0), 2, iteration_scheme_0'Access, null); Table.States (220).Kernel := To_Vector ((0 => (229, 192, 0, False))); Table.States (220).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 229, 2))); Add_Action (Table.States (221), 83, 381); Add_Action (Table.States (221), 96, 383); Add_Error (Table.States (221)); Table.States (221).Kernel := To_Vector (((238, 238, 2, True), (332, 238, 1, False))); Table.States (221).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 383))); Add_Action (Table.States (222), 90, 384); Add_Error (Table.States (222)); Table.States (222).Kernel := To_Vector ((0 => (217, 104, 1, False))); Table.States (222).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 90, 384))); Add_Action (Table.States (223), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (223), 13, Reduce, (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Add_Action (Table.States (223), 17, Reduce, (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Add_Action (Table.States (223), 26, 385); Add_Action (Table.States (223), 28, Reduce, (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Add_Action (Table.States (223), 37, Reduce, (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Add_Action (Table.States (223), 40, 386); Add_Action (Table.States (223), 73, Reduce, (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Add_Action (Table.States (223), 104, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (223), 105, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (223), 106, Reduce, (241, 1), 0, null, null); Add_Error (Table.States (223)); Add_Goto (Table.States (223), 114, 387); Add_Goto (Table.States (223), 241, 388); Table.States (223).Kernel := To_Vector (((131, 81, 0, False), (245, 81, 4, False), (245, 81, 5, False), (245, 81, 4, False))); Table.States (223).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 131, 2))); Add_Action (Table.States (224), 4, 1); Add_Action (Table.States (224), 5, 2); Add_Action (Table.States (224), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (224), 15, 3); Add_Action (Table.States (224), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (224), 18, 4); Add_Action (Table.States (224), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (224), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (224), 27, 5); Add_Action (Table.States (224), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (224), 31, 9); Add_Action (Table.States (224), 32, 10); Add_Action (Table.States (224), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (224), 41, 13); Add_Action (Table.States (224), 48, 16); Add_Action (Table.States (224), 52, 20); Add_Action (Table.States (224), 57, 21); Add_Action (Table.States (224), 58, 22); Add_Action (Table.States (224), 61, 24); Add_Action (Table.States (224), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (224), 93, 31); Add_Action (Table.States (224), 104, 360); Add_Action (Table.States (224), 105, 33); Add_Action (Table.States (224), 106, 34); Add_Error (Table.States (224)); Add_Goto (Table.States (224), 113, 36); Add_Goto (Table.States (224), 123, 38); Add_Goto (Table.States (224), 126, 39); Add_Goto (Table.States (224), 128, 41); Add_Goto (Table.States (224), 131, 42); Add_Goto (Table.States (224), 132, 43); Add_Goto (Table.States (224), 133, 44); Add_Goto (Table.States (224), 139, 47); Add_Goto (Table.States (224), 151, 50); Add_Goto (Table.States (224), 152, 51); Add_Goto (Table.States (224), 161, 53); Add_Goto (Table.States (224), 190, 57); Add_Goto (Table.States (224), 196, 59); Add_Goto (Table.States (224), 217, 68); Add_Goto (Table.States (224), 218, 389); Add_Goto (Table.States (224), 222, 70); Add_Goto (Table.States (224), 232, 72); Add_Goto (Table.States (224), 239, 73); Add_Goto (Table.States (224), 257, 83); Add_Goto (Table.States (224), 261, 86); Add_Goto (Table.States (224), 272, 92); Add_Goto (Table.States (224), 276, 93); Add_Goto (Table.States (224), 290, 96); Add_Goto (Table.States (224), 293, 97); Add_Goto (Table.States (224), 294, 98); Add_Goto (Table.States (224), 298, 99); Add_Goto (Table.States (224), 299, 361); Add_Goto (Table.States (224), 300, 390); Add_Goto (Table.States (224), 302, 100); Add_Goto (Table.States (224), 303, 101); Add_Goto (Table.States (224), 306, 363); Add_Goto (Table.States (224), 323, 114); Table.States (224).Kernel := To_Vector ((0 => (133, 13, 2, False))); Table.States (224).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (225), 13, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (225), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (225), 28, 183); Add_Action (Table.States (225), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (225), 30, 8); Add_Action (Table.States (225), 40, 12); Add_Action (Table.States (225), 46, 14); Add_Action (Table.States (225), 47, 15); Add_Action (Table.States (225), 48, 16); Add_Action (Table.States (225), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (225), 51, 19); Add_Action (Table.States (225), 63, 25); Add_Action (Table.States (225), 66, 26); Add_Action (Table.States (225), 69, 27); Add_Action (Table.States (225), 71, 28); Add_Action (Table.States (225), 104, 185); Add_Error (Table.States (225)); Add_Goto (Table.States (225), 112, 35); Add_Goto (Table.States (225), 121, 37); Add_Goto (Table.States (225), 127, 40); Add_Goto (Table.States (225), 134, 45); Add_Goto (Table.States (225), 135, 46); Add_Goto (Table.States (225), 157, 391); Add_Goto (Table.States (225), 158, 392); Add_Goto (Table.States (225), 159, 393); Add_Goto (Table.States (225), 179, 54); Add_Goto (Table.States (225), 182, 55); Add_Goto (Table.States (225), 186, 56); Add_Goto (Table.States (225), 193, 58); Add_Goto (Table.States (225), 206, 60); Add_Goto (Table.States (225), 207, 61); Add_Goto (Table.States (225), 209, 62); Add_Goto (Table.States (225), 210, 63); Add_Goto (Table.States (225), 213, 64); Add_Goto (Table.States (225), 214, 65); Add_Goto (Table.States (225), 215, 66); Add_Goto (Table.States (225), 216, 67); Add_Goto (Table.States (225), 219, 69); Add_Goto (Table.States (225), 223, 71); Add_Goto (Table.States (225), 243, 74); Add_Goto (Table.States (225), 244, 75); Add_Goto (Table.States (225), 245, 76); Add_Goto (Table.States (225), 246, 77); Add_Goto (Table.States (225), 247, 78); Add_Goto (Table.States (225), 248, 79); Add_Goto (Table.States (225), 249, 80); Add_Goto (Table.States (225), 250, 81); Add_Goto (Table.States (225), 251, 82); Add_Goto (Table.States (225), 257, 394); Add_Goto (Table.States (225), 259, 84); Add_Goto (Table.States (225), 260, 85); Add_Goto (Table.States (225), 262, 87); Add_Goto (Table.States (225), 263, 88); Add_Goto (Table.States (225), 264, 89); Add_Goto (Table.States (225), 265, 90); Add_Goto (Table.States (225), 271, 91); Add_Goto (Table.States (225), 281, 94); Add_Goto (Table.States (225), 289, 95); Add_Goto (Table.States (225), 304, 102); Add_Goto (Table.States (225), 305, 103); Add_Goto (Table.States (225), 307, 105); Add_Goto (Table.States (225), 308, 106); Add_Goto (Table.States (225), 309, 107); Add_Goto (Table.States (225), 311, 108); Add_Goto (Table.States (225), 313, 109); Add_Goto (Table.States (225), 316, 111); Add_Goto (Table.States (225), 317, 112); Add_Goto (Table.States (225), 319, 113); Add_Goto (Table.States (225), 325, 115); Add_Goto (Table.States (225), 331, 116); Table.States (225).Kernel := To_Vector ((0 => (133, 17, 3, False))); Table.States (225).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (226), 37, Reduce, (231, 1), 0, null, null); Add_Action (Table.States (226), 104, 395); Add_Error (Table.States (226)); Add_Goto (Table.States (226), 230, 155); Add_Goto (Table.States (226), 231, 156); Table.States (226).Kernel := To_Vector ((0 => (229, 28, 0, False))); Table.States (226).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 231, 0))); Add_Action (Table.States (227), 4, 1); Add_Action (Table.States (227), 5, 2); Add_Action (Table.States (227), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (227), 15, 3); Add_Action (Table.States (227), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (227), 18, 4); Add_Action (Table.States (227), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (227), 27, 5); Add_Action (Table.States (227), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (227), 31, 9); Add_Action (Table.States (227), 32, 10); Add_Action (Table.States (227), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (227), 41, 13); Add_Action (Table.States (227), 48, 16); Add_Action (Table.States (227), 52, 20); Add_Action (Table.States (227), 57, 21); Add_Action (Table.States (227), 58, 22); Add_Action (Table.States (227), 61, 24); Add_Action (Table.States (227), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (227), 93, 31); Add_Action (Table.States (227), 104, 360); Add_Action (Table.States (227), 105, 33); Add_Action (Table.States (227), 106, 34); Add_Error (Table.States (227)); Add_Goto (Table.States (227), 113, 36); Add_Goto (Table.States (227), 123, 38); Add_Goto (Table.States (227), 126, 39); Add_Goto (Table.States (227), 128, 41); Add_Goto (Table.States (227), 131, 42); Add_Goto (Table.States (227), 132, 43); Add_Goto (Table.States (227), 133, 44); Add_Goto (Table.States (227), 139, 47); Add_Goto (Table.States (227), 151, 50); Add_Goto (Table.States (227), 152, 51); Add_Goto (Table.States (227), 161, 53); Add_Goto (Table.States (227), 190, 57); Add_Goto (Table.States (227), 196, 59); Add_Goto (Table.States (227), 217, 68); Add_Goto (Table.States (227), 222, 70); Add_Goto (Table.States (227), 232, 72); Add_Goto (Table.States (227), 239, 73); Add_Goto (Table.States (227), 257, 83); Add_Goto (Table.States (227), 261, 86); Add_Goto (Table.States (227), 272, 92); Add_Goto (Table.States (227), 276, 93); Add_Goto (Table.States (227), 290, 96); Add_Goto (Table.States (227), 293, 97); Add_Goto (Table.States (227), 294, 98); Add_Goto (Table.States (227), 298, 99); Add_Goto (Table.States (227), 299, 361); Add_Goto (Table.States (227), 300, 396); Add_Goto (Table.States (227), 302, 100); Add_Goto (Table.States (227), 303, 101); Add_Goto (Table.States (227), 306, 363); Add_Goto (Table.States (227), 323, 114); Table.States (227).Kernel := To_Vector ((0 => (232, 37, 3, False))); Table.States (227).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (228), 37, 397); Add_Error (Table.States (228)); Table.States (228).Kernel := To_Vector ((0 => (232, 229, 4, False))); Table.States (228).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 37, 397))); Add_Action (Table.States (229), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (143, 0), 2, compilation_unit_list_0'Access, null); Table.States (229).Kernel := To_Vector ((0 => (143, 142, 0, True))); Table.States (229).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 143, 2))); Table.States (229).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (230), 104, 119); Add_Action (Table.States (230), 105, 33); Add_Action (Table.States (230), 106, 34); Add_Error (Table.States (230)); Add_Goto (Table.States (230), 128, 41); Add_Goto (Table.States (230), 239, 398); Add_Goto (Table.States (230), 272, 92); Add_Goto (Table.States (230), 293, 97); Table.States (230).Kernel := To_Vector (((251, 47, 4, False), (251, 47, 3, False))); Table.States (230).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (231), 96, 399); Add_Error (Table.States (231)); Table.States (231).Kernel := To_Vector ((0 => (214, 251, 1, False))); Table.States (231).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 399))); Add_Action (Table.States (232), 74, 337); Add_Action (Table.States (232), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (232)); Add_Goto (Table.States (232), 122, 400); Table.States (232).Kernel := To_Vector ((0 => (216, 312, 1, False))); Table.States (232).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (233), 7, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 8, 401); Add_Action (Table.States (233), 11, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 16, 402); Add_Conflict (Table.States (233), 16, (118, 1), 0, null, null); Add_Action (Table.States (233), 26, 403); Add_Action (Table.States (233), 40, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 74, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 82, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 96, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 104, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 105, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (233), 106, Reduce, (118, 1), 0, null, null); Add_Error (Table.States (233)); Add_Goto (Table.States (233), 118, 404); Table.States (233).Kernel := To_Vector (((157, 81, 3, False), (186, 81, 2, False), (244, 81, 3, False), (244, 81, 4, False), (244, 81, 10, False), (244, 81, 2, False), (244, 81, 3, False), (244, 81, 9, False))); Table.States (233).Minimal_Complete_Actions := To_Vector (((Shift, 26, 403), (Reduce, 118, 0))); Add_Action (Table.States (234), 104, 405); Add_Error (Table.States (234)); Table.States (234).Kernel := To_Vector ((0 => (219, 83, 1, True))); Table.States (234).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 405))); Table.States (234).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (235), 3, 121); Add_Action (Table.States (235), 15, 258); Add_Action (Table.States (235), 28, 259); Add_Action (Table.States (235), 32, 260); Add_Action (Table.States (235), 39, 122); Add_Action (Table.States (235), 40, 261); Add_Action (Table.States (235), 41, 124); Add_Action (Table.States (235), 44, 263); Add_Action (Table.States (235), 52, 125); Add_Action (Table.States (235), 76, 126); Add_Action (Table.States (235), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (235), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (235), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (235), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (235), 94, 127); Add_Action (Table.States (235), 95, 128); Add_Action (Table.States (235), 103, 129); Add_Action (Table.States (235), 104, 119); Add_Action (Table.States (235), 105, 33); Add_Action (Table.States (235), 106, 264); Add_Error (Table.States (235)); Add_Goto (Table.States (235), 117, 130); Add_Goto (Table.States (235), 124, 265); Add_Goto (Table.States (235), 125, 406); Add_Goto (Table.States (235), 128, 41); Add_Goto (Table.States (235), 136, 267); Add_Goto (Table.States (235), 153, 407); Add_Goto (Table.States (235), 165, 269); Add_Goto (Table.States (235), 166, 270); Add_Goto (Table.States (235), 191, 408); Add_Goto (Table.States (235), 197, 133); Add_Goto (Table.States (235), 221, 273); Add_Goto (Table.States (235), 239, 274); Add_Goto (Table.States (235), 258, 135); Add_Goto (Table.States (235), 272, 92); Add_Goto (Table.States (235), 273, 275); Add_Goto (Table.States (235), 275, 136); Add_Goto (Table.States (235), 277, 409); Add_Goto (Table.States (235), 278, 410); Add_Goto (Table.States (235), 282, 137); Add_Goto (Table.States (235), 283, 138); Add_Goto (Table.States (235), 284, 139); Add_Goto (Table.States (235), 285, 140); Add_Goto (Table.States (235), 286, 141); Add_Goto (Table.States (235), 287, 142); Add_Goto (Table.States (235), 293, 97); Add_Goto (Table.States (235), 301, 277); Add_Goto (Table.States (235), 320, 144); Add_Goto (Table.States (235), 321, 145); Add_Goto (Table.States (235), 330, 146); Table.States (235).Kernel := To_Vector (((115, 76, 1, False), (115, 76, 3, False), (239, 76, 4, True))); Table.States (235).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Table.States (235).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (236), 3, 121); Add_Action (Table.States (236), 39, 122); Add_Action (Table.States (236), 40, 123); Add_Action (Table.States (236), 41, 124); Add_Action (Table.States (236), 52, 125); Add_Action (Table.States (236), 76, 126); Add_Action (Table.States (236), 94, 127); Add_Action (Table.States (236), 95, 128); Add_Action (Table.States (236), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (236), 103, 129); Add_Action (Table.States (236), 104, 119); Add_Action (Table.States (236), 105, 33); Add_Action (Table.States (236), 106, 34); Add_Error (Table.States (236)); Add_Goto (Table.States (236), 117, 130); Add_Goto (Table.States (236), 128, 41); Add_Goto (Table.States (236), 191, 131); Add_Goto (Table.States (236), 192, 411); Add_Goto (Table.States (236), 197, 133); Add_Goto (Table.States (236), 239, 134); Add_Goto (Table.States (236), 258, 135); Add_Goto (Table.States (236), 272, 92); Add_Goto (Table.States (236), 275, 136); Add_Goto (Table.States (236), 282, 137); Add_Goto (Table.States (236), 283, 138); Add_Goto (Table.States (236), 284, 139); Add_Goto (Table.States (236), 285, 140); Add_Goto (Table.States (236), 286, 141); Add_Goto (Table.States (236), 287, 142); Add_Goto (Table.States (236), 293, 97); Add_Goto (Table.States (236), 301, 143); Add_Goto (Table.States (236), 320, 144); Add_Goto (Table.States (236), 321, 145); Add_Goto (Table.States (236), 330, 146); Table.States (236).Kernel := To_Vector ((0 => (123, 82, 1, False))); Table.States (236).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); end Subr_4; procedure Subr_5 is begin Add_Action (Table.States (237), 9, 412); Add_Action (Table.States (237), 104, 413); Add_Action (Table.States (237), 105, 414); Add_Action (Table.States (237), 106, 415); Add_Error (Table.States (237)); Table.States (237).Kernel := To_Vector (((293, 84, 1, True), (293, 84, 1, True), (293, 84, 1, True), (293, 84, 1, True))); Table.States (237).Minimal_Complete_Actions := To_Vector (((Shift, 104, 413), (Shift, 106, 415), (Shift, 105, 414), (Shift, 9, 412))); Table.States (237).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (238), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (261, 0), 2, procedure_call_statement_0'Access, null); Table.States (238).Kernel := To_Vector ((0 => (261, 96, 0, False))); Table.States (238).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 261, 2))); Add_Action (Table.States (239), (7, 19, 20, 38, 53, 76, 104, 105, 106), (322, 0), 1, null, null); Table.States (239).Kernel := To_Vector ((0 => (322, 101, 0, False))); Table.States (239).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 322, 1))); Add_Action (Table.States (240), (7, 19, 20, 38, 53, 76, 104, 105, 106), (322, 1), 1, null, null); Table.States (240).Kernel := To_Vector ((0 => (322, 102, 0, False))); Table.States (240).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 322, 1))); Add_Action (Table.States (241), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 1), 2, name_1'Access, null); Table.States (241).Kernel := To_Vector ((0 => (239, 115, 0, True))); Table.States (241).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 2))); Table.States (241).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (242), 7, 416); Add_Action (Table.States (242), 19, 417); Add_Action (Table.States (242), 20, 418); Add_Action (Table.States (242), 38, 419); Add_Action (Table.States (242), 76, 126); Add_Action (Table.States (242), 104, 119); Add_Action (Table.States (242), 105, 33); Add_Action (Table.States (242), 106, 34); Add_Error (Table.States (242)); Add_Goto (Table.States (242), 117, 420); Add_Goto (Table.States (242), 128, 41); Add_Goto (Table.States (242), 129, 421); Add_Goto (Table.States (242), 239, 422); Add_Goto (Table.States (242), 272, 92); Add_Goto (Table.States (242), 293, 97); Table.States (242).Kernel := To_Vector (((128, 322, 1, True), (272, 322, 2, True))); Table.States (242).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (242).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (243), 104, 423); Add_Error (Table.States (243)); Table.States (243).Kernel := To_Vector (((179, 25, 5, False), (179, 25, 2, False))); Table.States (243).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 423))); Add_Action (Table.States (244), 104, 119); Add_Action (Table.States (244), 105, 33); Add_Action (Table.States (244), 106, 34); Add_Error (Table.States (244)); Add_Goto (Table.States (244), 128, 41); Add_Goto (Table.States (244), 239, 424); Add_Goto (Table.States (244), 272, 92); Add_Goto (Table.States (244), 293, 97); Table.States (244).Kernel := To_Vector (((207, 29, 2, False), (213, 29, 5, False))); Table.States (244).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (245), 104, 119); Add_Action (Table.States (245), 105, 33); Add_Action (Table.States (245), 106, 34); Add_Error (Table.States (245)); Add_Goto (Table.States (245), 128, 41); Add_Goto (Table.States (245), 239, 425); Add_Goto (Table.States (245), 272, 92); Add_Goto (Table.States (245), 293, 97); Table.States (245).Kernel := To_Vector (((213, 50, 5, False), (262, 50, 1, False))); Table.States (245).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (246), 35, 426); Add_Conflict (Table.States (246), 35, (312, 1), 1, null, subprogram_specification_1_check'Access); Add_Action (Table.States (246), 56, Reduce, (312, 1), 1, null, subprogram_specification_1_check'Access); Add_Action (Table.States (246), 74, Reduce, (312, 1), 1, null, subprogram_specification_1_check'Access); Add_Action (Table.States (246), 96, Reduce, (312, 1), 1, null, subprogram_specification_1_check'Access); Add_Error (Table.States (246)); Table.States (246).Kernel := To_Vector (((193, 207, 4, False), (312, 207, 0, False))); Table.States (246).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 312, 1))); Add_Action (Table.States (247), 35, 427); Add_Conflict (Table.States (247), 35, (312, 0), 1, null, subprogram_specification_0_check'Access); Add_Action (Table.States (247), 56, Reduce, (312, 0), 1, null, subprogram_specification_0_check'Access); Add_Action (Table.States (247), 74, Reduce, (312, 0), 1, null, subprogram_specification_0_check'Access); Add_Action (Table.States (247), 96, Reduce, (312, 0), 1, null, subprogram_specification_0_check'Access); Add_Error (Table.States (247)); Table.States (247).Kernel := To_Vector (((243, 262, 3, False), (312, 262, 0, False))); Table.States (247).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 312, 1))); Add_Action (Table.States (248), 35, 428); Add_Conflict (Table.States (248), 35, (122, 1), 0, null, null); Add_Action (Table.States (248), 56, 429); Add_Action (Table.States (248), 74, 337); Add_Action (Table.States (248), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (248)); Add_Goto (Table.States (248), 122, 430); Table.States (248).Kernel := To_Vector (((112, 312, 3, False), (307, 312, 4, False), (308, 312, 3, False), (309, 312, 1, False), (311, 312, 3, False))); Table.States (248).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (249), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (249, 0), 2, package_declaration_0'Access, null); Table.States (249).Kernel := To_Vector ((0 => (249, 96, 0, False))); Table.States (249).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 249, 2))); Add_Action (Table.States (250), 3, 121); Add_Action (Table.States (250), 15, 258); Add_Action (Table.States (250), 28, 259); Add_Action (Table.States (250), 32, 260); Add_Action (Table.States (250), 39, 122); Add_Action (Table.States (250), 40, 261); Add_Action (Table.States (250), 41, 124); Add_Action (Table.States (250), 44, 263); Add_Action (Table.States (250), 52, 125); Add_Action (Table.States (250), 76, 126); Add_Action (Table.States (250), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (250), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (250), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (250), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (250), 94, 127); Add_Action (Table.States (250), 95, 128); Add_Action (Table.States (250), 103, 129); Add_Action (Table.States (250), 104, 119); Add_Action (Table.States (250), 105, 33); Add_Action (Table.States (250), 106, 264); Add_Error (Table.States (250)); Add_Goto (Table.States (250), 117, 130); Add_Goto (Table.States (250), 124, 265); Add_Goto (Table.States (250), 125, 406); Add_Goto (Table.States (250), 128, 41); Add_Goto (Table.States (250), 136, 267); Add_Goto (Table.States (250), 153, 407); Add_Goto (Table.States (250), 165, 269); Add_Goto (Table.States (250), 166, 270); Add_Goto (Table.States (250), 191, 408); Add_Goto (Table.States (250), 197, 133); Add_Goto (Table.States (250), 221, 273); Add_Goto (Table.States (250), 239, 274); Add_Goto (Table.States (250), 258, 135); Add_Goto (Table.States (250), 272, 92); Add_Goto (Table.States (250), 273, 275); Add_Goto (Table.States (250), 275, 136); Add_Goto (Table.States (250), 277, 276); Add_Goto (Table.States (250), 282, 137); Add_Goto (Table.States (250), 283, 138); Add_Goto (Table.States (250), 284, 139); Add_Goto (Table.States (250), 285, 140); Add_Goto (Table.States (250), 286, 141); Add_Goto (Table.States (250), 287, 142); Add_Goto (Table.States (250), 293, 97); Add_Goto (Table.States (250), 301, 277); Add_Goto (Table.States (250), 320, 144); Add_Goto (Table.States (250), 321, 145); Add_Goto (Table.States (250), 330, 146); Table.States (250).Kernel := To_Vector (((115, 76, 1, False), (115, 76, 3, False))); Table.States (250).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Add_Action (Table.States (251), (21, 76, 96), (116, 0), 1, null, null); Table.States (251).Kernel := To_Vector ((0 => (116, 115, 0, False))); Table.States (251).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 116, 1))); Add_Action (Table.States (252), 21, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (252), 76, 431); Add_Action (Table.States (252), 96, Reduce, (253, 1), 0, null, null); Add_Error (Table.States (252)); Add_Goto (Table.States (252), 199, 344); Add_Goto (Table.States (252), 253, 432); Table.States (252).Kernel := To_Vector (((113, 116, 3, False), (113, 116, 1, False))); Table.States (252).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (253), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 8), 3, simple_statement_8'Access, null); Table.States (253).Kernel := To_Vector ((0 => (303, 96, 0, False))); Table.States (253).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 3))); Add_Action (Table.States (254), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99), (197, 2), 2, null, null); Table.States (254).Kernel := To_Vector ((0 => (197, 258, 0, False))); Table.States (254).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 197, 2))); Add_Action (Table.States (255), 10, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 20, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 21, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 22, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 23, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 33, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 35, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 37, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 38, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 40, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 42, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 43, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 53, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 55, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 68, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 74, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 75, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 76, 235); Add_Action (Table.States (255), 77, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 78, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 79, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 82, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 83, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 84, 237); Add_Action (Table.States (255), 85, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 86, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 87, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 88, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 89, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 91, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 92, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 94, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 95, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 96, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 97, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 98, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 99, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 100, Reduce, (258, 4), 2, primary_4'Access, null); Add_Action (Table.States (255), 101, 239); Add_Action (Table.States (255), 102, 240); Add_Error (Table.States (255)); Add_Goto (Table.States (255), 115, 241); Add_Goto (Table.States (255), 322, 242); Table.States (255).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (258, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (255).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 2))); Add_Action (Table.States (256), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99), (197, 3), 2, null, null); Table.States (256).Kernel := To_Vector ((0 => (197, 258, 0, False))); Table.States (256).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 197, 2))); Add_Action (Table.States (257), 10, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 20, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 21, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 22, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 23, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 35, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 37, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 43, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 53, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 68, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 74, 433); Add_Conflict (Table.States (257), 74, (275, 1), 2, null, null); Add_Action (Table.States (257), 75, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 76, 235); Add_Action (Table.States (257), 77, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 79, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 83, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 84, 237); Add_Action (Table.States (257), 87, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 96, Reduce, (275, 1), 2, null, null); Add_Action (Table.States (257), 101, 239); Add_Action (Table.States (257), 102, 240); Add_Error (Table.States (257)); Add_Goto (Table.States (257), 115, 241); Add_Goto (Table.States (257), 322, 242); Table.States (257).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (275, 239, 1, True), (275, 239, 0, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (257).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 275, 2))); Table.States (257).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (258), 3, 121); Add_Action (Table.States (258), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (258), 39, 122); Add_Action (Table.States (258), 40, 123); Add_Action (Table.States (258), 41, 124); Add_Action (Table.States (258), 52, 125); Add_Action (Table.States (258), 76, 126); Add_Action (Table.States (258), 94, 127); Add_Action (Table.States (258), 95, 128); Add_Action (Table.States (258), 103, 129); Add_Action (Table.States (258), 104, 119); Add_Action (Table.States (258), 105, 33); Add_Action (Table.States (258), 106, 34); Add_Error (Table.States (258)); Add_Goto (Table.States (258), 117, 130); Add_Goto (Table.States (258), 128, 41); Add_Goto (Table.States (258), 191, 131); Add_Goto (Table.States (258), 192, 434); Add_Goto (Table.States (258), 197, 133); Add_Goto (Table.States (258), 239, 134); Add_Goto (Table.States (258), 258, 135); Add_Goto (Table.States (258), 272, 92); Add_Goto (Table.States (258), 275, 136); Add_Goto (Table.States (258), 282, 137); Add_Goto (Table.States (258), 283, 138); Add_Goto (Table.States (258), 284, 139); Add_Goto (Table.States (258), 285, 140); Add_Goto (Table.States (258), 286, 141); Add_Goto (Table.States (258), 287, 142); Add_Goto (Table.States (258), 293, 97); Add_Goto (Table.States (258), 301, 143); Add_Goto (Table.States (258), 320, 144); Add_Goto (Table.States (258), 321, 145); Add_Goto (Table.States (258), 330, 146); Table.States (258).Kernel := To_Vector ((0 => (136, 15, 3, False))); Table.States (258).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (259), 9, 435); Add_Action (Table.States (259), 62, 436); Add_Error (Table.States (259)); Add_Goto (Table.States (259), 274, 437); Table.States (259).Kernel := To_Vector ((0 => (273, 28, 5, False))); Table.States (259).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 9, 435))); Add_Action (Table.States (260), 3, 121); Add_Action (Table.States (260), 39, 122); Add_Action (Table.States (260), 40, 123); Add_Action (Table.States (260), 41, 124); Add_Action (Table.States (260), 52, 125); Add_Action (Table.States (260), 68, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (260), 76, 126); Add_Action (Table.States (260), 94, 127); Add_Action (Table.States (260), 95, 128); Add_Action (Table.States (260), 103, 129); Add_Action (Table.States (260), 104, 119); Add_Action (Table.States (260), 105, 33); Add_Action (Table.States (260), 106, 34); Add_Error (Table.States (260)); Add_Goto (Table.States (260), 117, 130); Add_Goto (Table.States (260), 128, 41); Add_Goto (Table.States (260), 191, 131); Add_Goto (Table.States (260), 192, 438); Add_Goto (Table.States (260), 197, 133); Add_Goto (Table.States (260), 239, 134); Add_Goto (Table.States (260), 258, 135); Add_Goto (Table.States (260), 272, 92); Add_Goto (Table.States (260), 275, 136); Add_Goto (Table.States (260), 282, 137); Add_Goto (Table.States (260), 283, 138); Add_Goto (Table.States (260), 284, 139); Add_Goto (Table.States (260), 285, 140); Add_Goto (Table.States (260), 286, 141); Add_Goto (Table.States (260), 287, 142); Add_Goto (Table.States (260), 293, 97); Add_Goto (Table.States (260), 301, 143); Add_Goto (Table.States (260), 320, 144); Add_Goto (Table.States (260), 321, 145); Add_Goto (Table.States (260), 330, 146); Table.States (260).Kernel := To_Vector (((221, 32, 4, False), (221, 32, 2, False), (221, 32, 3, False), (221, 32, 1, False))); Table.States (260).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (261), 39, 122); Add_Action (Table.States (261), 41, 439); Add_Action (Table.States (261), 76, 126); Add_Action (Table.States (261), 103, 129); Add_Action (Table.States (261), 104, 119); Add_Action (Table.States (261), 105, 33); Add_Action (Table.States (261), 106, 34); Add_Error (Table.States (261)); Add_Goto (Table.States (261), 117, 130); Add_Goto (Table.States (261), 128, 41); Add_Goto (Table.States (261), 239, 134); Add_Goto (Table.States (261), 258, 256); Add_Goto (Table.States (261), 272, 92); Add_Goto (Table.States (261), 293, 97); Table.States (261).Kernel := To_Vector (((165, 40, 2, False), (197, 40, 1, False))); Table.States (261).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (262), 10, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 33, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 38, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 40, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 43, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 54, 440); Add_Action (Table.States (262), 55, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 74, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 75, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 77, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 78, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 79, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 83, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 85, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 86, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 87, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 88, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 89, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 91, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 92, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 94, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 95, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 97, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 98, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 99, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (262), 100, Reduce, (258, 1), 1, null, null); Add_Error (Table.States (262)); Table.States (262).Kernel := To_Vector (((117, 41, 2, False), (258, 41, 0, False))); Table.States (262).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (263), (79, 87), (165, 3), 1, null, null); Table.States (263).Kernel := To_Vector ((0 => (165, 44, 0, False))); Table.States (263).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 165, 1))); Add_Action (Table.States (264), 10, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 33, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 35, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 38, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 40, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 43, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 53, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 55, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 74, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 75, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 76, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 77, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 78, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 79, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 83, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 84, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 85, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 86, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 87, 441); Add_Conflict (Table.States (264), 87, (239, 6), 1, null, null); Add_Action (Table.States (264), 88, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 89, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 91, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 92, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 94, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 95, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 96, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 97, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 98, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 99, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 100, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 101, Reduce, (239, 6), 1, null, null); Add_Action (Table.States (264), 102, Reduce, (239, 6), 1, null, null); Add_Error (Table.States (264)); Table.States (264).Kernel := To_Vector (((124, 106, 1, False), (124, 106, 2, False), (239, 106, 0, False))); Table.States (264).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (265), (35, 77, 83, 96), (125, 1), 1, null, null); Table.States (265).Kernel := To_Vector ((0 => (125, 124, 0, False))); Table.States (265).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 1))); Add_Action (Table.States (266), 77, 442); Add_Action (Table.States (266), 83, 443); Add_Error (Table.States (266)); Table.States (266).Kernel := To_Vector (((117, 125, 1, False), (125, 125, 1, True))); Table.States (266).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 442))); Add_Action (Table.States (267), (1 => 77), (153, 1), 1, null, null); Table.States (267).Kernel := To_Vector ((0 => (153, 136, 0, False))); Table.States (267).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 153, 1))); Add_Action (Table.States (268), 77, 444); Add_Error (Table.States (268)); Table.States (268).Kernel := To_Vector ((0 => (117, 153, 1, False))); Table.States (268).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 444))); Add_Action (Table.States (269), (79, 87), (166, 1), 1, null, null); Table.States (269).Kernel := To_Vector ((0 => (166, 165, 0, False))); Table.States (269).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 166, 1))); Add_Action (Table.States (270), 79, 445); Add_Action (Table.States (270), 87, 446); Add_Error (Table.States (270)); Table.States (270).Kernel := To_Vector (((124, 166, 1, False), (124, 166, 2, False), (166, 166, 2, True))); Table.States (270).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 446))); Add_Action (Table.States (271), 74, Reduce, (192, 0), 1, null, null); Add_Action (Table.States (271), 77, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Conflict (Table.States (271), 77, (192, 0), 1, null, null); Add_Action (Table.States (271), 79, Reduce, (165, 0), 1, null, null); Add_Action (Table.States (271), 83, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Action (Table.States (271), 87, Reduce, (165, 0), 1, null, null); Add_Error (Table.States (271)); Table.States (271).Kernel := To_Vector (((124, 191, 0, False), (165, 191, 0, False), (192, 191, 0, True))); Table.States (271).Minimal_Complete_Actions := To_Vector (((Reduce, 124, 1), (Reduce, 165, 1), (Reduce, 192, 1))); Table.States (271).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (272), 74, 447); Add_Error (Table.States (272)); Table.States (272).Kernel := To_Vector (((117, 192, 4, False), (117, 192, 2, False))); Table.States (272).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 447))); Add_Action (Table.States (273), (1 => 77), (153, 0), 1, null, null); Table.States (273).Kernel := To_Vector ((0 => (153, 221, 0, False))); Table.States (273).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 153, 1))); Add_Action (Table.States (274), 10, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 20, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 21, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 22, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 23, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 33, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 35, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 37, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 38, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 40, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 43, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 53, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 55, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 68, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 74, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 75, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 76, 235); Add_Action (Table.States (274), 77, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 78, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 79, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 83, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 84, 237); Add_Action (Table.States (274), 85, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 86, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 87, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 88, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 89, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 91, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 92, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 94, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 95, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 96, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 97, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 98, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 99, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 100, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (274), 101, 239); Add_Action (Table.States (274), 102, 240); Add_Error (Table.States (274)); Add_Goto (Table.States (274), 115, 241); Add_Goto (Table.States (274), 322, 448); Table.States (274).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (258, 239, 0, False), (272, 239, 3, True), (277, 239, 4, False), (277, 239, 2, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (274).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (275), (1 => 77), (153, 2), 1, null, null); Table.States (275).Kernel := To_Vector ((0 => (153, 273, 0, False))); Table.States (275).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 153, 1))); Add_Action (Table.States (276), (79, 87), (165, 2), 1, null, null); Table.States (276).Kernel := To_Vector ((0 => (165, 277, 0, False))); Table.States (276).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 165, 1))); Add_Action (Table.States (277), 10, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 33, 288); Add_Action (Table.States (277), 35, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 40, 289); Add_Action (Table.States (277), 43, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 74, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 75, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 77, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 79, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 83, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 85, 449); Add_Action (Table.States (277), 86, 290); Add_Action (Table.States (277), 87, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 88, 291); Add_Action (Table.States (277), 89, 292); Add_Action (Table.States (277), 91, 293); Add_Action (Table.States (277), 92, 294); Add_Action (Table.States (277), 96, Reduce, (287, 3), 1, null, null); Add_Action (Table.States (277), 98, 295); Add_Error (Table.States (277)); Add_Goto (Table.States (277), 288, 296); Table.States (277).Kernel := To_Vector (((277, 301, 2, False), (287, 301, 3, False), (287, 301, 2, False), (287, 301, 2, False), (287, 301, 0, False))); Table.States (277).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 1))); Add_Action (Table.States (278), 72, 450); Add_Error (Table.States (278)); Add_Goto (Table.States (278), 140, 451); Add_Goto (Table.States (278), 141, 452); Table.States (278).Kernel := To_Vector ((0 => (139, 35, 5, False))); Table.States (278).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 72, 450))); Add_Action (Table.States (279), 39, 122); Add_Action (Table.States (279), 41, 124); Add_Action (Table.States (279), 76, 126); Add_Action (Table.States (279), 103, 129); Add_Action (Table.States (279), 104, 119); Add_Action (Table.States (279), 105, 33); Add_Action (Table.States (279), 106, 34); Add_Error (Table.States (279)); Add_Goto (Table.States (279), 117, 130); Add_Goto (Table.States (279), 128, 41); Add_Goto (Table.States (279), 239, 134); Add_Goto (Table.States (279), 258, 453); Add_Goto (Table.States (279), 272, 92); Add_Goto (Table.States (279), 293, 97); Table.States (279).Kernel := To_Vector ((0 => (197, 100, 1, False))); Table.States (279).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (280), 3, 121); Add_Action (Table.States (280), 39, 122); Add_Action (Table.States (280), 40, 123); Add_Action (Table.States (280), 41, 124); Add_Action (Table.States (280), 52, 125); Add_Action (Table.States (280), 76, 126); Add_Action (Table.States (280), 94, 127); Add_Action (Table.States (280), 95, 128); Add_Action (Table.States (280), 103, 129); Add_Action (Table.States (280), 104, 119); Add_Action (Table.States (280), 105, 33); Add_Action (Table.States (280), 106, 34); Add_Error (Table.States (280)); Add_Goto (Table.States (280), 117, 130); Add_Goto (Table.States (280), 128, 41); Add_Goto (Table.States (280), 197, 133); Add_Goto (Table.States (280), 239, 134); Add_Goto (Table.States (280), 258, 135); Add_Goto (Table.States (280), 272, 92); Add_Goto (Table.States (280), 275, 136); Add_Goto (Table.States (280), 287, 454); Add_Goto (Table.States (280), 293, 97); Add_Goto (Table.States (280), 301, 143); Add_Goto (Table.States (280), 320, 144); Add_Goto (Table.States (280), 321, 145); Add_Goto (Table.States (280), 330, 146); Table.States (280).Kernel := To_Vector ((0 => (282, 10, 1, True))); Table.States (280).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (280).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (281), 68, 455); Add_Error (Table.States (281)); Table.States (281).Kernel := To_Vector ((0 => (283, 10, 2, True))); Table.States (281).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 455))); Table.States (281).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (282), 3, 121); Add_Action (Table.States (282), 39, 122); Add_Action (Table.States (282), 40, 123); Add_Action (Table.States (282), 41, 124); Add_Action (Table.States (282), 52, 125); Add_Action (Table.States (282), 76, 126); Add_Action (Table.States (282), 94, 127); Add_Action (Table.States (282), 95, 128); Add_Action (Table.States (282), 103, 129); Add_Action (Table.States (282), 104, 119); Add_Action (Table.States (282), 105, 33); Add_Action (Table.States (282), 106, 34); Add_Error (Table.States (282)); Add_Goto (Table.States (282), 117, 130); Add_Goto (Table.States (282), 128, 41); Add_Goto (Table.States (282), 197, 133); Add_Goto (Table.States (282), 239, 134); Add_Goto (Table.States (282), 258, 135); Add_Goto (Table.States (282), 272, 92); Add_Goto (Table.States (282), 275, 136); Add_Goto (Table.States (282), 287, 456); Add_Goto (Table.States (282), 293, 97); Add_Goto (Table.States (282), 301, 143); Add_Goto (Table.States (282), 320, 144); Add_Goto (Table.States (282), 321, 145); Add_Goto (Table.States (282), 330, 146); Table.States (282).Kernel := To_Vector ((0 => (284, 43, 1, True))); Table.States (282).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (282).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (283), 22, 457); Add_Error (Table.States (283)); Table.States (283).Kernel := To_Vector ((0 => (285, 43, 2, True))); Table.States (283).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 22, 457))); Table.States (283).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (284), 3, 121); Add_Action (Table.States (284), 39, 122); Add_Action (Table.States (284), 40, 123); Add_Action (Table.States (284), 41, 124); Add_Action (Table.States (284), 52, 125); Add_Action (Table.States (284), 76, 126); Add_Action (Table.States (284), 94, 127); Add_Action (Table.States (284), 95, 128); Add_Action (Table.States (284), 103, 129); Add_Action (Table.States (284), 104, 119); Add_Action (Table.States (284), 105, 33); Add_Action (Table.States (284), 106, 34); Add_Error (Table.States (284)); Add_Goto (Table.States (284), 117, 130); Add_Goto (Table.States (284), 128, 41); Add_Goto (Table.States (284), 197, 133); Add_Goto (Table.States (284), 239, 134); Add_Goto (Table.States (284), 258, 135); Add_Goto (Table.States (284), 272, 92); Add_Goto (Table.States (284), 275, 136); Add_Goto (Table.States (284), 287, 458); Add_Goto (Table.States (284), 293, 97); Add_Goto (Table.States (284), 301, 143); Add_Goto (Table.States (284), 320, 144); Add_Goto (Table.States (284), 321, 145); Add_Goto (Table.States (284), 330, 146); Table.States (284).Kernel := To_Vector ((0 => (286, 75, 1, True))); Table.States (284).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (284).Minimal_Complete_Actions_Recursive := True; end Subr_5; procedure Subr_6 is begin Add_Action (Table.States (285), 3, 121); Add_Action (Table.States (285), 39, 122); Add_Action (Table.States (285), 40, 123); Add_Action (Table.States (285), 41, 124); Add_Action (Table.States (285), 52, 125); Add_Action (Table.States (285), 68, 459); Add_Action (Table.States (285), 76, 126); Add_Action (Table.States (285), 94, 127); Add_Action (Table.States (285), 95, 128); Add_Action (Table.States (285), 103, 129); Add_Action (Table.States (285), 104, 119); Add_Action (Table.States (285), 105, 33); Add_Action (Table.States (285), 106, 34); Add_Error (Table.States (285)); Add_Goto (Table.States (285), 117, 130); Add_Goto (Table.States (285), 128, 41); Add_Goto (Table.States (285), 197, 133); Add_Goto (Table.States (285), 239, 134); Add_Goto (Table.States (285), 258, 135); Add_Goto (Table.States (285), 272, 92); Add_Goto (Table.States (285), 275, 136); Add_Goto (Table.States (285), 287, 460); Add_Goto (Table.States (285), 293, 97); Add_Goto (Table.States (285), 301, 143); Add_Goto (Table.States (285), 320, 144); Add_Goto (Table.States (285), 321, 145); Add_Goto (Table.States (285), 330, 146); Table.States (285).Kernel := To_Vector (((282, 10, 1, True), (283, 10, 2, True))); Table.States (285).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (285).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (286), 3, 121); Add_Action (Table.States (286), 22, 461); Add_Action (Table.States (286), 39, 122); Add_Action (Table.States (286), 40, 123); Add_Action (Table.States (286), 41, 124); Add_Action (Table.States (286), 52, 125); Add_Action (Table.States (286), 76, 126); Add_Action (Table.States (286), 94, 127); Add_Action (Table.States (286), 95, 128); Add_Action (Table.States (286), 103, 129); Add_Action (Table.States (286), 104, 119); Add_Action (Table.States (286), 105, 33); Add_Action (Table.States (286), 106, 34); Add_Error (Table.States (286)); Add_Goto (Table.States (286), 117, 130); Add_Goto (Table.States (286), 128, 41); Add_Goto (Table.States (286), 197, 133); Add_Goto (Table.States (286), 239, 134); Add_Goto (Table.States (286), 258, 135); Add_Goto (Table.States (286), 272, 92); Add_Goto (Table.States (286), 275, 136); Add_Goto (Table.States (286), 287, 462); Add_Goto (Table.States (286), 293, 97); Add_Goto (Table.States (286), 301, 143); Add_Goto (Table.States (286), 320, 144); Add_Goto (Table.States (286), 321, 145); Add_Goto (Table.States (286), 330, 146); Table.States (286).Kernel := To_Vector (((284, 43, 1, True), (285, 43, 2, True))); Table.States (286).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (286).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (287), 3, 121); Add_Action (Table.States (287), 39, 122); Add_Action (Table.States (287), 40, 123); Add_Action (Table.States (287), 41, 124); Add_Action (Table.States (287), 52, 125); Add_Action (Table.States (287), 76, 126); Add_Action (Table.States (287), 94, 127); Add_Action (Table.States (287), 95, 128); Add_Action (Table.States (287), 103, 129); Add_Action (Table.States (287), 104, 119); Add_Action (Table.States (287), 105, 33); Add_Action (Table.States (287), 106, 34); Add_Error (Table.States (287)); Add_Goto (Table.States (287), 117, 130); Add_Goto (Table.States (287), 128, 41); Add_Goto (Table.States (287), 197, 133); Add_Goto (Table.States (287), 239, 134); Add_Goto (Table.States (287), 258, 135); Add_Goto (Table.States (287), 272, 92); Add_Goto (Table.States (287), 275, 136); Add_Goto (Table.States (287), 287, 463); Add_Goto (Table.States (287), 293, 97); Add_Goto (Table.States (287), 301, 143); Add_Goto (Table.States (287), 320, 144); Add_Goto (Table.States (287), 321, 145); Add_Goto (Table.States (287), 330, 146); Table.States (287).Kernel := To_Vector ((0 => (286, 75, 1, True))); Table.States (287).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (287).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (288), 3, 121); Add_Action (Table.States (288), 39, 122); Add_Action (Table.States (288), 40, 123); Add_Action (Table.States (288), 41, 124); Add_Action (Table.States (288), 76, 126); Add_Action (Table.States (288), 94, 127); Add_Action (Table.States (288), 95, 128); Add_Action (Table.States (288), 103, 129); Add_Action (Table.States (288), 104, 119); Add_Action (Table.States (288), 105, 33); Add_Action (Table.States (288), 106, 34); Add_Error (Table.States (288)); Add_Goto (Table.States (288), 117, 130); Add_Goto (Table.States (288), 128, 41); Add_Goto (Table.States (288), 197, 133); Add_Goto (Table.States (288), 233, 464); Add_Goto (Table.States (288), 234, 465); Add_Goto (Table.States (288), 239, 274); Add_Goto (Table.States (288), 258, 135); Add_Goto (Table.States (288), 272, 92); Add_Goto (Table.States (288), 277, 466); Add_Goto (Table.States (288), 293, 97); Add_Goto (Table.States (288), 301, 467); Add_Goto (Table.States (288), 320, 144); Add_Goto (Table.States (288), 321, 145); Add_Goto (Table.States (288), 330, 146); Table.States (288).Kernel := To_Vector ((0 => (287, 33, 1, False))); Table.States (288).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (289), 33, 468); Add_Error (Table.States (289)); Table.States (289).Kernel := To_Vector ((0 => (287, 40, 2, False))); Table.States (289).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 33, 468))); Add_Action (Table.States (290), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 0), 1, null, null); Table.States (290).Kernel := To_Vector ((0 => (288, 86, 0, False))); Table.States (290).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (291), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 4), 1, null, null); Table.States (291).Kernel := To_Vector ((0 => (288, 88, 0, False))); Table.States (291).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (292), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 5), 1, null, null); Table.States (292).Kernel := To_Vector ((0 => (288, 89, 0, False))); Table.States (292).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (293), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 2), 1, null, null); Table.States (293).Kernel := To_Vector ((0 => (288, 91, 0, False))); Table.States (293).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (294), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 3), 1, null, null); Table.States (294).Kernel := To_Vector ((0 => (288, 92, 0, False))); Table.States (294).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (295), (3, 39, 40, 41, 76, 94, 95, 103, 104, 105, 106), (288, 1), 1, null, null); Table.States (295).Kernel := To_Vector ((0 => (288, 98, 0, False))); Table.States (295).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 288, 1))); Add_Action (Table.States (296), 3, 121); Add_Action (Table.States (296), 39, 122); Add_Action (Table.States (296), 40, 123); Add_Action (Table.States (296), 41, 124); Add_Action (Table.States (296), 76, 126); Add_Action (Table.States (296), 94, 127); Add_Action (Table.States (296), 95, 128); Add_Action (Table.States (296), 103, 129); Add_Action (Table.States (296), 104, 119); Add_Action (Table.States (296), 105, 33); Add_Action (Table.States (296), 106, 34); Add_Error (Table.States (296)); Add_Goto (Table.States (296), 117, 130); Add_Goto (Table.States (296), 128, 41); Add_Goto (Table.States (296), 197, 133); Add_Goto (Table.States (296), 239, 134); Add_Goto (Table.States (296), 258, 135); Add_Goto (Table.States (296), 272, 92); Add_Goto (Table.States (296), 293, 97); Add_Goto (Table.States (296), 301, 469); Add_Goto (Table.States (296), 320, 144); Add_Goto (Table.States (296), 321, 145); Add_Goto (Table.States (296), 330, 146); Table.States (296).Kernel := To_Vector ((0 => (287, 288, 1, False))); Table.States (296).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (297), (3, 39, 40, 41, 76, 103, 104, 105, 106), (237, 2), 1, null, null); Table.States (297).Kernel := To_Vector ((0 => (237, 38, 0, False))); Table.States (297).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 237, 1))); Add_Action (Table.States (298), (3, 39, 40, 41, 76, 103, 104, 105, 106), (237, 3), 1, null, null); Table.States (298).Kernel := To_Vector ((0 => (237, 55, 0, False))); Table.States (298).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 237, 1))); Add_Action (Table.States (299), (3, 39, 40, 41, 76, 103, 104, 105, 106), (237, 1), 1, null, null); Table.States (299).Kernel := To_Vector ((0 => (237, 97, 0, False))); Table.States (299).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 237, 1))); Add_Action (Table.States (300), (3, 39, 40, 41, 76, 103, 104, 105, 106), (237, 0), 1, null, null); Table.States (300).Kernel := To_Vector ((0 => (237, 99, 0, False))); Table.States (300).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 237, 1))); Add_Action (Table.States (301), 3, 121); Add_Action (Table.States (301), 39, 122); Add_Action (Table.States (301), 40, 123); Add_Action (Table.States (301), 41, 124); Add_Action (Table.States (301), 76, 126); Add_Action (Table.States (301), 103, 129); Add_Action (Table.States (301), 104, 119); Add_Action (Table.States (301), 105, 33); Add_Action (Table.States (301), 106, 34); Add_Error (Table.States (301)); Add_Goto (Table.States (301), 117, 130); Add_Goto (Table.States (301), 128, 41); Add_Goto (Table.States (301), 197, 470); Add_Goto (Table.States (301), 239, 134); Add_Goto (Table.States (301), 258, 135); Add_Goto (Table.States (301), 272, 92); Add_Goto (Table.States (301), 293, 97); Table.States (301).Kernel := To_Vector ((0 => (320, 237, 1, True))); Table.States (301).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (301).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (302), (3, 39, 40, 41, 76, 103, 104, 105, 106), (130, 2), 1, null, null); Table.States (302).Kernel := To_Vector ((0 => (130, 78, 0, False))); Table.States (302).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 130, 1))); Add_Action (Table.States (303), (3, 39, 40, 41, 76, 103, 104, 105, 106), (130, 1), 1, null, null); Table.States (303).Kernel := To_Vector ((0 => (130, 94, 0, False))); Table.States (303).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 130, 1))); Add_Action (Table.States (304), (3, 39, 40, 41, 76, 103, 104, 105, 106), (130, 0), 1, null, null); Table.States (304).Kernel := To_Vector ((0 => (130, 95, 0, False))); Table.States (304).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 130, 1))); Add_Action (Table.States (305), 3, 121); Add_Action (Table.States (305), 39, 122); Add_Action (Table.States (305), 40, 123); Add_Action (Table.States (305), 41, 124); Add_Action (Table.States (305), 76, 126); Add_Action (Table.States (305), 103, 129); Add_Action (Table.States (305), 104, 119); Add_Action (Table.States (305), 105, 33); Add_Action (Table.States (305), 106, 34); Add_Error (Table.States (305)); Add_Goto (Table.States (305), 117, 130); Add_Goto (Table.States (305), 128, 41); Add_Goto (Table.States (305), 197, 133); Add_Goto (Table.States (305), 239, 134); Add_Goto (Table.States (305), 258, 135); Add_Goto (Table.States (305), 272, 92); Add_Goto (Table.States (305), 293, 97); Add_Goto (Table.States (305), 320, 471); Table.States (305).Kernel := To_Vector ((0 => (321, 130, 1, True))); Table.States (305).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (305).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (306), 10, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 20, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 21, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 22, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 23, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 33, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 35, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 37, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 40, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 42, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 43, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 53, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 68, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 74, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 75, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 77, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 78, 302); Add_Action (Table.States (306), 79, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 82, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 83, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 85, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 86, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 87, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 88, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 89, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 91, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 92, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 94, 303); Add_Action (Table.States (306), 95, 304); Add_Action (Table.States (306), 96, Reduce, (301, 0), 2, null, null); Add_Action (Table.States (306), 98, Reduce, (301, 0), 2, null, null); Add_Error (Table.States (306)); Add_Goto (Table.States (306), 130, 305); Table.States (306).Kernel := To_Vector (((301, 321, 0, False), (321, 321, 2, True))); Table.States (306).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 301, 2))); Add_Action (Table.States (307), 96, 472); Add_Error (Table.States (307)); Table.States (307).Kernel := To_Vector ((0 => (161, 192, 1, False))); Table.States (307).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 472))); Add_Action (Table.States (308), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (161, 1), 3, delay_statement_1'Access, null); Table.States (308).Kernel := To_Vector ((0 => (161, 96, 0, False))); Table.States (308).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 161, 3))); Add_Action (Table.States (309), 3, 121); Add_Action (Table.States (309), 39, 122); Add_Action (Table.States (309), 40, 123); Add_Action (Table.States (309), 41, 124); Add_Action (Table.States (309), 52, 125); Add_Action (Table.States (309), 76, 126); Add_Action (Table.States (309), 94, 127); Add_Action (Table.States (309), 95, 128); Add_Action (Table.States (309), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (309), 103, 129); Add_Action (Table.States (309), 104, 119); Add_Action (Table.States (309), 105, 33); Add_Action (Table.States (309), 106, 34); Add_Error (Table.States (309)); Add_Goto (Table.States (309), 117, 130); Add_Goto (Table.States (309), 128, 41); Add_Goto (Table.States (309), 191, 131); Add_Goto (Table.States (309), 192, 473); Add_Goto (Table.States (309), 197, 133); Add_Goto (Table.States (309), 239, 134); Add_Goto (Table.States (309), 258, 135); Add_Goto (Table.States (309), 272, 92); Add_Goto (Table.States (309), 275, 136); Add_Goto (Table.States (309), 282, 137); Add_Goto (Table.States (309), 283, 138); Add_Goto (Table.States (309), 284, 139); Add_Goto (Table.States (309), 285, 140); Add_Goto (Table.States (309), 286, 141); Add_Goto (Table.States (309), 287, 142); Add_Goto (Table.States (309), 293, 97); Add_Goto (Table.States (309), 301, 143); Add_Goto (Table.States (309), 320, 144); Add_Goto (Table.States (309), 321, 145); Add_Goto (Table.States (309), 330, 146); Table.States (309).Kernel := To_Vector ((0 => (190, 72, 1, False))); Table.States (309).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (310), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (190, 1), 3, exit_statement_1'Access, null); Table.States (310).Kernel := To_Vector ((0 => (190, 96, 0, False))); Table.States (310).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 190, 3))); Add_Action (Table.States (311), 3, 121); Add_Action (Table.States (311), 39, 122); Add_Action (Table.States (311), 40, 474); Add_Action (Table.States (311), 41, 124); Add_Action (Table.States (311), 59, 475); Add_Action (Table.States (311), 76, 126); Add_Action (Table.States (311), 94, 127); Add_Action (Table.States (311), 95, 128); Add_Action (Table.States (311), 103, 129); Add_Action (Table.States (311), 104, 119); Add_Action (Table.States (311), 105, 33); Add_Action (Table.States (311), 106, 34); Add_Error (Table.States (311)); Add_Goto (Table.States (311), 117, 130); Add_Goto (Table.States (311), 128, 41); Add_Goto (Table.States (311), 167, 476); Add_Goto (Table.States (311), 197, 133); Add_Goto (Table.States (311), 239, 477); Add_Goto (Table.States (311), 258, 135); Add_Goto (Table.States (311), 272, 92); Add_Goto (Table.States (311), 277, 478); Add_Goto (Table.States (311), 293, 97); Add_Goto (Table.States (311), 301, 479); Add_Goto (Table.States (311), 314, 480); Add_Goto (Table.States (311), 320, 144); Add_Goto (Table.States (311), 321, 145); Add_Goto (Table.States (311), 330, 146); Table.States (311).Kernel := To_Vector (((230, 33, 2, False), (230, 33, 1, False))); Table.States (311).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (312), 59, 481); Add_Action (Table.States (312), 104, 119); Add_Action (Table.States (312), 105, 33); Add_Action (Table.States (312), 106, 34); Add_Error (Table.States (312)); Add_Goto (Table.States (312), 128, 41); Add_Goto (Table.States (312), 239, 482); Add_Goto (Table.States (312), 272, 92); Add_Goto (Table.States (312), 293, 97); Table.States (312).Kernel := To_Vector (((230, 42, 2, False), (230, 42, 1, False))); Table.States (312).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (313), 40, 483); Add_Action (Table.States (313), 104, 119); Add_Action (Table.States (313), 105, 33); Add_Action (Table.States (313), 106, 34); Add_Error (Table.States (313)); Add_Goto (Table.States (313), 128, 41); Add_Goto (Table.States (313), 239, 484); Add_Goto (Table.States (313), 272, 92); Add_Goto (Table.States (313), 293, 97); Add_Goto (Table.States (313), 314, 485); Table.States (313).Kernel := To_Vector (((230, 81, 4, False), (230, 81, 3, False))); Table.States (313).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (314), 3, 121); Add_Action (Table.States (314), 39, 122); Add_Action (Table.States (314), 40, 123); Add_Action (Table.States (314), 41, 124); Add_Action (Table.States (314), 52, 125); Add_Action (Table.States (314), 76, 126); Add_Action (Table.States (314), 94, 127); Add_Action (Table.States (314), 95, 128); Add_Action (Table.States (314), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (314), 103, 129); Add_Action (Table.States (314), 104, 119); Add_Action (Table.States (314), 105, 33); Add_Action (Table.States (314), 106, 34); Add_Error (Table.States (314)); Add_Goto (Table.States (314), 117, 130); Add_Goto (Table.States (314), 128, 41); Add_Goto (Table.States (314), 191, 131); Add_Goto (Table.States (314), 192, 486); Add_Goto (Table.States (314), 197, 133); Add_Goto (Table.States (314), 239, 134); Add_Goto (Table.States (314), 258, 135); Add_Goto (Table.States (314), 272, 92); Add_Goto (Table.States (314), 275, 136); Add_Goto (Table.States (314), 282, 137); Add_Goto (Table.States (314), 283, 138); Add_Goto (Table.States (314), 284, 139); Add_Goto (Table.States (314), 285, 140); Add_Goto (Table.States (314), 286, 141); Add_Goto (Table.States (314), 287, 142); Add_Goto (Table.States (314), 293, 97); Add_Goto (Table.States (314), 301, 143); Add_Goto (Table.States (314), 320, 144); Add_Goto (Table.States (314), 321, 145); Add_Goto (Table.States (314), 330, 146); Table.States (314).Kernel := To_Vector ((0 => (121, 71, 1, False))); Table.States (314).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (315), 12, 487); Add_Error (Table.States (315)); Table.States (315).Kernel := To_Vector ((0 => (127, 71, 2, False))); Table.States (315).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 12, 487))); Add_Action (Table.States (316), 54, 488); Add_Action (Table.States (316), 76, 126); Add_Error (Table.States (316)); Add_Goto (Table.States (316), 117, 489); Table.States (316).Kernel := To_Vector (((182, 71, 3, False), (281, 71, 12, False))); Table.States (316).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 76, 126))); Add_Action (Table.States (317), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 21, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 35, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 40, 386); Add_Action (Table.States (317), 56, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 74, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 77, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 82, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 96, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 104, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 105, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (317), 106, Reduce, (241, 1), 0, null, null); Add_Error (Table.States (317)); Add_Goto (Table.States (317), 114, 490); Add_Goto (Table.States (317), 241, 491); Table.States (317).Kernel := To_Vector (((291, 58, 0, False), (291, 58, 2, True))); Table.States (317).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 0))); Add_Action (Table.States (318), 3, 121); Add_Action (Table.States (318), 15, 258); Add_Action (Table.States (318), 28, 259); Add_Action (Table.States (318), 32, 260); Add_Action (Table.States (318), 39, 122); Add_Action (Table.States (318), 40, 261); Add_Action (Table.States (318), 41, 124); Add_Action (Table.States (318), 44, 263); Add_Action (Table.States (318), 52, 125); Add_Action (Table.States (318), 76, 126); Add_Action (Table.States (318), 77, Reduce, (124, 5), 0, null, null); Add_Conflict (Table.States (318), 77, (254, 4), 0, null, null); Add_Action (Table.States (318), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (318), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (318), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (318), 94, 127); Add_Action (Table.States (318), 95, 128); Add_Action (Table.States (318), 96, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (318), 103, 129); Add_Action (Table.States (318), 104, 492); Add_Action (Table.States (318), 105, 33); Add_Action (Table.States (318), 106, 264); Add_Error (Table.States (318)); Add_Goto (Table.States (318), 117, 130); Add_Goto (Table.States (318), 124, 265); Add_Goto (Table.States (318), 125, 406); Add_Goto (Table.States (318), 128, 41); Add_Goto (Table.States (318), 136, 267); Add_Goto (Table.States (318), 153, 407); Add_Goto (Table.States (318), 165, 269); Add_Goto (Table.States (318), 166, 270); Add_Goto (Table.States (318), 191, 408); Add_Goto (Table.States (318), 197, 133); Add_Goto (Table.States (318), 219, 493); Add_Goto (Table.States (318), 221, 273); Add_Goto (Table.States (318), 239, 274); Add_Goto (Table.States (318), 254, 494); Add_Goto (Table.States (318), 255, 495); Add_Goto (Table.States (318), 258, 135); Add_Goto (Table.States (318), 272, 92); Add_Goto (Table.States (318), 273, 275); Add_Goto (Table.States (318), 275, 136); Add_Goto (Table.States (318), 277, 409); Add_Goto (Table.States (318), 278, 410); Add_Goto (Table.States (318), 282, 137); Add_Goto (Table.States (318), 283, 138); Add_Goto (Table.States (318), 284, 139); Add_Goto (Table.States (318), 285, 140); Add_Goto (Table.States (318), 286, 141); Add_Goto (Table.States (318), 287, 142); Add_Goto (Table.States (318), 293, 97); Add_Goto (Table.States (318), 301, 277); Add_Goto (Table.States (318), 320, 144); Add_Goto (Table.States (318), 321, 145); Add_Goto (Table.States (318), 330, 146); Table.States (318).Kernel := To_Vector (((115, 76, 1, False), (115, 76, 3, False), (199, 76, 1, False), (239, 76, 4, True))); Table.States (318).Minimal_Complete_Actions := To_Vector (((Reduce, 125, 0), (Reduce, 255, 0))); Table.States (318).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (319), 58, 317); Add_Error (Table.States (319)); Add_Goto (Table.States (319), 291, 496); Table.States (319).Kernel := To_Vector ((0 => (252, 199, 1, True))); Table.States (319).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 58, 317))); Table.States (319).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (320), (35, 56, 74, 96), (207, 0), 3, function_specification_0'Access, function_specification_0_check'Access); Table.States (320).Kernel := To_Vector ((0 => (207, 252, 0, False))); Table.States (320).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 207, 3))); Add_Action (Table.States (321), (21, 35, 56, 74, 77, 82, 96), (252, 1), 1, null, null); Table.States (321).Kernel := To_Vector ((0 => (252, 291, 0, True))); Table.States (321).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 252, 1))); Table.States (321).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (322), 56, 497); Add_Action (Table.States (322), 76, 235); Add_Action (Table.States (322), 84, 237); Add_Action (Table.States (322), 101, 239); Add_Action (Table.States (322), 102, 240); Add_Error (Table.States (322)); Add_Goto (Table.States (322), 115, 241); Add_Goto (Table.States (322), 322, 242); Table.States (322).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 3, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (322).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 497))); Add_Action (Table.States (323), 56, 498); Add_Action (Table.States (323), 76, 235); Add_Action (Table.States (323), 84, 237); Add_Action (Table.States (323), 101, 239); Add_Action (Table.States (323), 102, 240); Add_Error (Table.States (323)); Add_Goto (Table.States (323), 115, 241); Add_Goto (Table.States (323), 322, 242); Table.States (323).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 3, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (323).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 498))); Add_Action (Table.States (324), 56, 499); Add_Action (Table.States (324), 76, 235); Add_Action (Table.States (324), 84, 237); Add_Action (Table.States (324), 101, 239); Add_Action (Table.States (324), 102, 240); Add_Error (Table.States (324)); Add_Goto (Table.States (324), 115, 241); Add_Goto (Table.States (324), 322, 242); Table.States (324).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 3, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (324).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 499))); Add_Action (Table.States (325), 35, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (325), 74, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (325), 76, 377); Add_Action (Table.States (325), 96, Reduce, (169, 2), 0, null, null); Add_Error (Table.States (325)); Add_Goto (Table.States (325), 169, 500); Table.States (325).Kernel := To_Vector (((201, 104, 3, False), (201, 104, 3, False), (201, 104, 1, False))); Table.States (325).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 0))); Add_Action (Table.States (326), 104, 119); Add_Action (Table.States (326), 105, 33); Add_Action (Table.States (326), 106, 34); Add_Error (Table.States (326)); Add_Goto (Table.States (326), 128, 41); Add_Goto (Table.States (326), 239, 501); Add_Goto (Table.States (326), 272, 92); Add_Goto (Table.States (326), 293, 97); Table.States (326).Kernel := To_Vector ((0 => (204, 47, 5, False))); Table.States (326).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (327), 35, 502); Add_Action (Table.States (327), 74, 337); Add_Action (Table.States (327), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (327)); Add_Goto (Table.States (327), 122, 503); Table.States (327).Kernel := To_Vector (((200, 312, 4, False), (200, 312, 3, False), (200, 312, 3, False), (200, 312, 1, False))); Table.States (327).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (328), (29, 47, 48, 50, 69, 71, 74, 104), (211, 0), 2, null, null); Table.States (328).Kernel := To_Vector ((0 => (211, 212, 0, True))); Table.States (328).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 211, 2))); Table.States (328).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (329), 7, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 33, 504); Add_Action (Table.States (329), 40, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 45, 505); Add_Action (Table.States (329), 74, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 82, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 96, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 104, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 105, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (329), 106, Reduce, (236, 3), 0, null, null); Add_Error (Table.States (329)); Add_Goto (Table.States (329), 236, 506); Table.States (329).Kernel := To_Vector (((198, 81, 3, False), (198, 81, 4, False), (198, 81, 2, False), (198, 81, 3, False))); Table.States (329).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 236, 0))); Add_Action (Table.States (330), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (303, 3), 3, simple_statement_3'Access, null); Table.States (330).Kernel := To_Vector ((0 => (303, 96, 0, False))); Table.States (330).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 303, 3))); Add_Action (Table.States (331), 4, 1); Add_Action (Table.States (331), 5, 2); Add_Action (Table.States (331), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (331), 15, 3); Add_Action (Table.States (331), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (331), 18, 4); Add_Action (Table.States (331), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (331), 23, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (331), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (331), 27, 5); Add_Action (Table.States (331), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (331), 31, 9); Add_Action (Table.States (331), 32, 10); Add_Action (Table.States (331), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (331), 41, 13); Add_Action (Table.States (331), 48, 16); Add_Action (Table.States (331), 52, 20); Add_Action (Table.States (331), 57, 21); Add_Action (Table.States (331), 58, 22); Add_Action (Table.States (331), 61, 24); Add_Action (Table.States (331), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (331), 93, 31); Add_Action (Table.States (331), 104, 360); Add_Action (Table.States (331), 105, 33); Add_Action (Table.States (331), 106, 34); Add_Error (Table.States (331)); Add_Goto (Table.States (331), 113, 36); Add_Goto (Table.States (331), 123, 38); Add_Goto (Table.States (331), 126, 39); Add_Goto (Table.States (331), 128, 41); Add_Goto (Table.States (331), 131, 42); Add_Goto (Table.States (331), 132, 43); Add_Goto (Table.States (331), 133, 44); Add_Goto (Table.States (331), 139, 47); Add_Goto (Table.States (331), 151, 50); Add_Goto (Table.States (331), 152, 51); Add_Goto (Table.States (331), 161, 53); Add_Goto (Table.States (331), 190, 57); Add_Goto (Table.States (331), 196, 59); Add_Goto (Table.States (331), 217, 68); Add_Goto (Table.States (331), 222, 70); Add_Goto (Table.States (331), 232, 72); Add_Goto (Table.States (331), 239, 73); Add_Goto (Table.States (331), 257, 83); Add_Goto (Table.States (331), 261, 86); Add_Goto (Table.States (331), 272, 92); Add_Goto (Table.States (331), 276, 93); Add_Goto (Table.States (331), 290, 96); Add_Goto (Table.States (331), 293, 97); Add_Goto (Table.States (331), 294, 98); Add_Goto (Table.States (331), 298, 99); Add_Goto (Table.States (331), 299, 361); Add_Goto (Table.States (331), 300, 507); Add_Goto (Table.States (331), 302, 100); Add_Goto (Table.States (331), 303, 101); Add_Goto (Table.States (331), 306, 363); Add_Goto (Table.States (331), 323, 114); Table.States (331).Kernel := To_Vector (((222, 68, 6, False), (222, 68, 4, False), (222, 68, 5, False), (222, 68, 3, False))); Table.States (331).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (332), 104, 119); Add_Action (Table.States (332), 105, 33); Add_Action (Table.States (332), 106, 34); Add_Error (Table.States (332)); Add_Goto (Table.States (332), 128, 41); Add_Goto (Table.States (332), 238, 508); Add_Goto (Table.States (332), 239, 219); Add_Goto (Table.States (332), 272, 92); Add_Goto (Table.States (332), 293, 97); Table.States (332).Kernel := To_Vector ((0 => (332, 74, 2, False))); Table.States (332).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (333), 83, 381); Add_Action (Table.States (333), 96, 509); Add_Error (Table.States (333)); Table.States (333).Kernel := To_Vector (((238, 238, 2, True), (332, 238, 1, False))); Table.States (333).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 509))); Add_Action (Table.States (334), 35, 510); Add_Conflict (Table.States (334), 35, (122, 1), 0, null, null); Add_Action (Table.States (334), 74, 337); Add_Action (Table.States (334), 76, 235); Add_Action (Table.States (334), 84, 237); Add_Action (Table.States (334), 101, 239); Add_Action (Table.States (334), 102, 240); Add_Error (Table.States (334)); Add_Goto (Table.States (334), 115, 241); Add_Goto (Table.States (334), 122, 511); Add_Goto (Table.States (334), 322, 242); Table.States (334).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (247, 239, 4, False), (247, 239, 3, False), (248, 239, 3, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (334).Minimal_Complete_Actions := To_Vector (((Reduce, 122, 0), (Shift, 35, 510))); Add_Action (Table.States (335), 39, 512); Add_Error (Table.States (335)); Table.States (335).Kernel := To_Vector ((0 => (213, 35, 3, False))); Table.States (335).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 512))); end Subr_6; procedure Subr_7 is begin Add_Action (Table.States (336), 104, 119); Add_Action (Table.States (336), 105, 33); Add_Action (Table.States (336), 106, 34); Add_Error (Table.States (336)); Add_Goto (Table.States (336), 128, 41); Add_Goto (Table.States (336), 239, 513); Add_Goto (Table.States (336), 272, 92); Add_Goto (Table.States (336), 293, 97); Table.States (336).Kernel := To_Vector ((0 => (250, 56, 2, False))); Table.States (336).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (337), 3, 121); Add_Action (Table.States (337), 35, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (337), 39, 122); Add_Action (Table.States (337), 40, 261); Add_Action (Table.States (337), 41, 124); Add_Action (Table.States (337), 44, 263); Add_Action (Table.States (337), 52, 125); Add_Action (Table.States (337), 76, 126); Add_Action (Table.States (337), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (337), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (337), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (337), 94, 127); Add_Action (Table.States (337), 95, 128); Add_Action (Table.States (337), 96, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (337), 103, 129); Add_Action (Table.States (337), 104, 119); Add_Action (Table.States (337), 105, 33); Add_Action (Table.States (337), 106, 264); Add_Error (Table.States (337)); Add_Goto (Table.States (337), 117, 130); Add_Goto (Table.States (337), 124, 265); Add_Goto (Table.States (337), 125, 514); Add_Goto (Table.States (337), 128, 41); Add_Goto (Table.States (337), 165, 269); Add_Goto (Table.States (337), 166, 270); Add_Goto (Table.States (337), 191, 408); Add_Goto (Table.States (337), 197, 133); Add_Goto (Table.States (337), 239, 274); Add_Goto (Table.States (337), 258, 135); Add_Goto (Table.States (337), 272, 92); Add_Goto (Table.States (337), 275, 136); Add_Goto (Table.States (337), 277, 276); Add_Goto (Table.States (337), 282, 137); Add_Goto (Table.States (337), 283, 138); Add_Goto (Table.States (337), 284, 139); Add_Goto (Table.States (337), 285, 140); Add_Goto (Table.States (337), 286, 141); Add_Goto (Table.States (337), 287, 142); Add_Goto (Table.States (337), 293, 97); Add_Goto (Table.States (337), 301, 277); Add_Goto (Table.States (337), 320, 144); Add_Goto (Table.States (337), 321, 145); Add_Goto (Table.States (337), 330, 146); Table.States (337).Kernel := To_Vector ((0 => (122, 74, 0, False))); Table.States (337).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Add_Action (Table.States (338), 35, 515); Add_Error (Table.States (338)); Table.States (338).Kernel := To_Vector (((251, 122, 3, False), (251, 122, 2, False))); Table.States (338).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 515))); Add_Action (Table.States (339), 3, 121); Add_Action (Table.States (339), 15, 258); Add_Action (Table.States (339), 28, 259); Add_Action (Table.States (339), 32, 260); Add_Action (Table.States (339), 39, 122); Add_Action (Table.States (339), 40, 261); Add_Action (Table.States (339), 41, 124); Add_Action (Table.States (339), 44, 263); Add_Action (Table.States (339), 52, 125); Add_Action (Table.States (339), 76, 126); Add_Action (Table.States (339), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (339), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (339), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (339), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (339), 94, 127); Add_Action (Table.States (339), 95, 128); Add_Action (Table.States (339), 103, 129); Add_Action (Table.States (339), 104, 119); Add_Action (Table.States (339), 105, 33); Add_Action (Table.States (339), 106, 264); Add_Error (Table.States (339)); Add_Goto (Table.States (339), 117, 130); Add_Goto (Table.States (339), 124, 265); Add_Goto (Table.States (339), 125, 516); Add_Goto (Table.States (339), 128, 41); Add_Goto (Table.States (339), 136, 267); Add_Goto (Table.States (339), 153, 517); Add_Goto (Table.States (339), 165, 269); Add_Goto (Table.States (339), 166, 270); Add_Goto (Table.States (339), 191, 408); Add_Goto (Table.States (339), 197, 133); Add_Goto (Table.States (339), 221, 273); Add_Goto (Table.States (339), 239, 274); Add_Goto (Table.States (339), 258, 135); Add_Goto (Table.States (339), 272, 92); Add_Goto (Table.States (339), 273, 275); Add_Goto (Table.States (339), 275, 136); Add_Goto (Table.States (339), 277, 276); Add_Goto (Table.States (339), 282, 137); Add_Goto (Table.States (339), 283, 138); Add_Goto (Table.States (339), 284, 139); Add_Goto (Table.States (339), 285, 140); Add_Goto (Table.States (339), 286, 141); Add_Goto (Table.States (339), 287, 142); Add_Goto (Table.States (339), 293, 97); Add_Goto (Table.States (339), 301, 277); Add_Goto (Table.States (339), 320, 144); Add_Goto (Table.States (339), 321, 145); Add_Goto (Table.States (339), 330, 146); Table.States (339).Kernel := To_Vector (((257, 76, 2, False), (257, 76, 4, False))); Table.States (339).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Add_Action (Table.States (340), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (257, 2), 3, pragma_g_2'Access, null); Table.States (340).Kernel := To_Vector ((0 => (257, 96, 0, False))); Table.States (340).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 257, 3))); Add_Action (Table.States (341), 71, Reduce, (163, 0), 1, null, null); Add_Conflict (Table.States (341), 71, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (341), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (341), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (341), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (341), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (341)); Table.States (341).Kernel := To_Vector (((163, 104, 0, False), (239, 104, 0, False))); Table.States (341).Minimal_Complete_Actions := To_Vector (((Reduce, 163, 1), (Reduce, 239, 1))); Add_Action (Table.States (342), 83, 381); Add_Action (Table.States (342), 96, 518); Add_Error (Table.States (342)); Table.States (342).Kernel := To_Vector (((238, 238, 2, True), (332, 238, 1, False))); Table.States (342).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 518))); Add_Action (Table.States (343), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (343), 26, 385); Add_Action (Table.States (343), 40, 386); Add_Action (Table.States (343), 104, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (343), 105, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (343), 106, Reduce, (241, 1), 0, null, null); Add_Error (Table.States (343)); Add_Goto (Table.States (343), 114, 387); Add_Goto (Table.States (343), 241, 388); Table.States (343).Kernel := To_Vector (((245, 81, 4, False), (245, 81, 5, False), (245, 81, 4, False))); Table.States (343).Minimal_Complete_Actions := To_Vector (((Reduce, 241, 0), (Shift, 26, 385))); Add_Action (Table.States (344), (21, 35, 56, 72, 74, 77, 82, 96), (253, 0), 1, null, null); Table.States (344).Kernel := To_Vector ((0 => (253, 199, 0, False))); Table.States (344).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 1))); Add_Action (Table.States (345), (35, 56, 74, 96), (262, 0), 3, procedure_specification_0'Access, procedure_specification_0_check'Access); Table.States (345).Kernel := To_Vector ((0 => (262, 253, 0, False))); Table.States (345).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 262, 3))); Add_Action (Table.States (346), 35, 519); Add_Conflict (Table.States (346), 35, (122, 1), 0, null, null); Add_Action (Table.States (346), 74, 337); Add_Error (Table.States (346)); Add_Goto (Table.States (346), 122, 520); Table.States (346).Kernel := To_Vector (((264, 104, 3, False), (265, 104, 3, False))); Table.States (346).Minimal_Complete_Actions := To_Vector (((Reduce, 122, 0), (Shift, 35, 519))); Add_Action (Table.States (347), 35, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (347), 74, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (347), 76, 377); Add_Error (Table.States (347)); Add_Goto (Table.States (347), 169, 521); Table.States (347).Kernel := To_Vector (((271, 104, 6, False), (271, 104, 3, False))); Table.States (347).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 0))); Add_Action (Table.States (348), 35, 522); Add_Error (Table.States (348)); Table.States (348).Kernel := To_Vector (((304, 122, 6, False), (304, 122, 3, False))); Table.States (348).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 522))); Add_Action (Table.States (349), 3, 121); Add_Action (Table.States (349), 39, 122); Add_Action (Table.States (349), 40, 123); Add_Action (Table.States (349), 41, 124); Add_Action (Table.States (349), 52, 125); Add_Action (Table.States (349), 76, 126); Add_Action (Table.States (349), 94, 127); Add_Action (Table.States (349), 95, 128); Add_Action (Table.States (349), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (349), 103, 129); Add_Action (Table.States (349), 104, 119); Add_Action (Table.States (349), 105, 33); Add_Action (Table.States (349), 106, 34); Add_Error (Table.States (349)); Add_Goto (Table.States (349), 117, 130); Add_Goto (Table.States (349), 128, 41); Add_Goto (Table.States (349), 191, 131); Add_Goto (Table.States (349), 192, 523); Add_Goto (Table.States (349), 197, 133); Add_Goto (Table.States (349), 239, 134); Add_Goto (Table.States (349), 258, 135); Add_Goto (Table.States (349), 272, 92); Add_Goto (Table.States (349), 275, 136); Add_Goto (Table.States (349), 282, 137); Add_Goto (Table.States (349), 283, 138); Add_Goto (Table.States (349), 284, 139); Add_Goto (Table.States (349), 285, 140); Add_Goto (Table.States (349), 286, 141); Add_Goto (Table.States (349), 287, 142); Add_Goto (Table.States (349), 293, 97); Add_Goto (Table.States (349), 301, 143); Add_Goto (Table.States (349), 320, 144); Add_Goto (Table.States (349), 321, 145); Add_Goto (Table.States (349), 330, 146); Table.States (349).Kernel := To_Vector ((0 => (276, 74, 1, False))); Table.States (349).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (350), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (276, 1), 3, raise_statement_1'Access, null); Table.States (350).Kernel := To_Vector ((0 => (276, 96, 0, False))); Table.States (350).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 276, 3))); Add_Action (Table.States (351), 5, 524); Add_Error (Table.States (351)); Table.States (351).Kernel := To_Vector ((0 => (290, 74, 2, False))); Table.States (351).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 5, 524))); Add_Action (Table.States (352), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (290, 1), 3, requeue_statement_1'Access, null); Table.States (352).Kernel := To_Vector ((0 => (290, 96, 0, False))); Table.States (352).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 290, 3))); Add_Action (Table.States (353), 7, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 8, 401); Add_Action (Table.States (353), 16, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 21, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 40, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 82, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 96, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 104, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 105, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (353), 106, Reduce, (118, 1), 0, null, null); Add_Error (Table.States (353)); Add_Goto (Table.States (353), 118, 525); Table.States (353).Kernel := To_Vector (((194, 81, 2, False), (194, 81, 1, False))); Table.States (353).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 118, 0))); Add_Action (Table.States (354), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (302, 0), 3, simple_return_statement_0'Access, null); Table.States (354).Kernel := To_Vector ((0 => (302, 96, 0, False))); Table.States (354).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 302, 3))); Add_Action (Table.States (355), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (196, 1), 3, extended_return_statement_1'Access, null); Table.States (355).Kernel := To_Vector ((0 => (196, 96, 0, False))); Table.States (355).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 196, 3))); Add_Action (Table.States (356), 4, 1); Add_Action (Table.States (356), 5, 2); Add_Action (Table.States (356), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (356), 15, 3); Add_Action (Table.States (356), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (356), 18, 4); Add_Action (Table.States (356), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (356), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (356), 27, 5); Add_Action (Table.States (356), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (356), 31, 9); Add_Action (Table.States (356), 32, 10); Add_Action (Table.States (356), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (356), 41, 13); Add_Action (Table.States (356), 48, 16); Add_Action (Table.States (356), 52, 20); Add_Action (Table.States (356), 57, 21); Add_Action (Table.States (356), 58, 22); Add_Action (Table.States (356), 61, 24); Add_Action (Table.States (356), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (356), 93, 31); Add_Action (Table.States (356), 104, 360); Add_Action (Table.States (356), 105, 33); Add_Action (Table.States (356), 106, 34); Add_Error (Table.States (356)); Add_Goto (Table.States (356), 113, 36); Add_Goto (Table.States (356), 123, 38); Add_Goto (Table.States (356), 126, 39); Add_Goto (Table.States (356), 128, 41); Add_Goto (Table.States (356), 131, 42); Add_Goto (Table.States (356), 132, 43); Add_Goto (Table.States (356), 133, 44); Add_Goto (Table.States (356), 139, 47); Add_Goto (Table.States (356), 151, 50); Add_Goto (Table.States (356), 152, 51); Add_Goto (Table.States (356), 161, 53); Add_Goto (Table.States (356), 190, 57); Add_Goto (Table.States (356), 196, 59); Add_Goto (Table.States (356), 217, 68); Add_Goto (Table.States (356), 218, 526); Add_Goto (Table.States (356), 222, 70); Add_Goto (Table.States (356), 232, 72); Add_Goto (Table.States (356), 239, 73); Add_Goto (Table.States (356), 257, 83); Add_Goto (Table.States (356), 261, 86); Add_Goto (Table.States (356), 272, 92); Add_Goto (Table.States (356), 276, 93); Add_Goto (Table.States (356), 290, 96); Add_Goto (Table.States (356), 293, 97); Add_Goto (Table.States (356), 294, 98); Add_Goto (Table.States (356), 298, 99); Add_Goto (Table.States (356), 299, 361); Add_Goto (Table.States (356), 300, 390); Add_Goto (Table.States (356), 302, 100); Add_Goto (Table.States (356), 303, 101); Add_Goto (Table.States (356), 306, 363); Add_Goto (Table.States (356), 323, 114); Table.States (356).Kernel := To_Vector ((0 => (196, 21, 3, False))); Table.States (356).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (357), 76, 235); Add_Action (Table.States (357), 77, 527); Add_Action (Table.States (357), 84, 237); Add_Action (Table.States (357), 101, 239); Add_Action (Table.States (357), 102, 240); Add_Error (Table.States (357)); Add_Goto (Table.States (357), 115, 241); Add_Goto (Table.States (357), 322, 242); Table.States (357).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (315, 239, 7, False))); Table.States (357).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 527))); Add_Action (Table.States (358), (22, 24, 43), (295, 4), 2, select_alternative_4'Access, null); Table.States (358).Kernel := To_Vector ((0 => (295, 96, 0, False))); Table.States (358).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 2))); Add_Action (Table.States (359), 87, 528); Add_Error (Table.States (359)); Table.States (359).Kernel := To_Vector (((295, 192, 4, False), (295, 192, 3, False), (295, 192, 3, False))); Table.States (359).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 528))); Add_Action (Table.States (360), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (360), 81, 529); Add_Action (Table.States (360), 82, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (360), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (360), 96, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (360), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (360), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (360)); Table.States (360).Kernel := To_Vector (((131, 104, 1, False), (239, 104, 0, False))); Table.States (360).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (361), 4, 1); Add_Action (Table.States (361), 5, 2); Add_Action (Table.States (361), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (361), 15, 3); Add_Action (Table.States (361), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (361), 18, 4); Add_Action (Table.States (361), 22, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 23, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 24, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 26, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 27, 5); Add_Action (Table.States (361), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (361), 31, 9); Add_Action (Table.States (361), 32, 10); Add_Action (Table.States (361), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (361), 41, 13); Add_Action (Table.States (361), 43, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 48, 16); Add_Action (Table.States (361), 52, 20); Add_Action (Table.States (361), 57, 21); Add_Action (Table.States (361), 58, 22); Add_Action (Table.States (361), 61, 24); Add_Action (Table.States (361), 68, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 72, Reduce, (300, 0), 1, null, null); Add_Action (Table.States (361), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (361), 93, 31); Add_Action (Table.States (361), 104, 360); Add_Action (Table.States (361), 105, 33); Add_Action (Table.States (361), 106, 34); Add_Error (Table.States (361)); Add_Goto (Table.States (361), 113, 36); Add_Goto (Table.States (361), 123, 38); Add_Goto (Table.States (361), 126, 39); Add_Goto (Table.States (361), 128, 41); Add_Goto (Table.States (361), 131, 42); Add_Goto (Table.States (361), 132, 43); Add_Goto (Table.States (361), 133, 44); Add_Goto (Table.States (361), 139, 47); Add_Goto (Table.States (361), 151, 50); Add_Goto (Table.States (361), 152, 51); Add_Goto (Table.States (361), 161, 53); Add_Goto (Table.States (361), 190, 57); Add_Goto (Table.States (361), 196, 59); Add_Goto (Table.States (361), 217, 68); Add_Goto (Table.States (361), 222, 70); Add_Goto (Table.States (361), 232, 72); Add_Goto (Table.States (361), 239, 73); Add_Goto (Table.States (361), 257, 83); Add_Goto (Table.States (361), 261, 86); Add_Goto (Table.States (361), 272, 92); Add_Goto (Table.States (361), 276, 93); Add_Goto (Table.States (361), 290, 96); Add_Goto (Table.States (361), 293, 97); Add_Goto (Table.States (361), 294, 98); Add_Goto (Table.States (361), 298, 99); Add_Goto (Table.States (361), 302, 100); Add_Goto (Table.States (361), 303, 101); Add_Goto (Table.States (361), 306, 530); Add_Goto (Table.States (361), 323, 114); Table.States (361).Kernel := To_Vector (((299, 299, 2, True), (300, 299, 0, False))); Table.States (361).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 1))); Add_Action (Table.States (362), (22, 24, 43), (295, 3), 2, null, null); Table.States (362).Kernel := To_Vector ((0 => (295, 300, 0, False))); Table.States (362).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 2))); Add_Action (Table.States (363), (4, 5, 13, 15, 17, 18, 22, 23, 24, 26, 27, 28, 31, 32, 37, 41, 43, 48, 52, 57, 58, 61, 68, 72, 73, 93, 104, 105, 106), (299, 1), 1, null, null); Table.States (363).Kernel := To_Vector ((0 => (299, 306, 0, False))); Table.States (363).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 299, 1))); Add_Action (Table.States (364), 22, Reduce, (160, 0), 2, null, null); Add_Action (Table.States (364), 24, Reduce, (160, 0), 2, null, null); Add_Action (Table.States (364), 43, Reduce, (160, 0), 2, null, null); Add_Action (Table.States (364), 68, Reduce, (324, 2), 2, null, null); Add_Error (Table.States (364)); Table.States (364).Kernel := To_Vector (((160, 300, 0, False), (324, 300, 0, False))); Table.States (364).Minimal_Complete_Actions := To_Vector (((Reduce, 160, 2), (Reduce, 324, 2))); Add_Action (Table.States (365), 4, 1); Add_Action (Table.States (365), 5, 2); Add_Action (Table.States (365), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (365), 15, 3); Add_Action (Table.States (365), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (365), 18, 4); Add_Action (Table.States (365), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (365), 27, 5); Add_Action (Table.States (365), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (365), 31, 9); Add_Action (Table.States (365), 32, 10); Add_Action (Table.States (365), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (365), 41, 13); Add_Action (Table.States (365), 48, 16); Add_Action (Table.States (365), 52, 20); Add_Action (Table.States (365), 57, 21); Add_Action (Table.States (365), 58, 22); Add_Action (Table.States (365), 61, 24); Add_Action (Table.States (365), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (365), 93, 31); Add_Action (Table.States (365), 104, 360); Add_Action (Table.States (365), 105, 33); Add_Action (Table.States (365), 106, 34); Add_Error (Table.States (365)); Add_Goto (Table.States (365), 113, 36); Add_Goto (Table.States (365), 123, 38); Add_Goto (Table.States (365), 126, 39); Add_Goto (Table.States (365), 128, 41); Add_Goto (Table.States (365), 131, 42); Add_Goto (Table.States (365), 132, 43); Add_Goto (Table.States (365), 133, 44); Add_Goto (Table.States (365), 139, 47); Add_Goto (Table.States (365), 151, 50); Add_Goto (Table.States (365), 152, 51); Add_Goto (Table.States (365), 161, 53); Add_Goto (Table.States (365), 190, 57); Add_Goto (Table.States (365), 196, 59); Add_Goto (Table.States (365), 217, 68); Add_Goto (Table.States (365), 222, 70); Add_Goto (Table.States (365), 232, 72); Add_Goto (Table.States (365), 239, 73); Add_Goto (Table.States (365), 257, 83); Add_Goto (Table.States (365), 261, 86); Add_Goto (Table.States (365), 272, 92); Add_Goto (Table.States (365), 276, 93); Add_Goto (Table.States (365), 290, 96); Add_Goto (Table.States (365), 293, 97); Add_Goto (Table.States (365), 294, 98); Add_Goto (Table.States (365), 298, 99); Add_Goto (Table.States (365), 299, 361); Add_Goto (Table.States (365), 300, 531); Add_Goto (Table.States (365), 302, 100); Add_Goto (Table.States (365), 303, 101); Add_Goto (Table.States (365), 306, 363); Add_Goto (Table.States (365), 323, 114); Table.States (365).Kernel := To_Vector ((0 => (152, 22, 3, False))); Table.States (365).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (366), 18, 4); Add_Error (Table.States (366)); Add_Goto (Table.States (366), 160, 532); Add_Goto (Table.States (366), 161, 533); Table.States (366).Kernel := To_Vector ((0 => (323, 43, 5, False))); Table.States (366).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 18, 4))); Add_Action (Table.States (367), 22, Reduce, (178, 1), 2, null, null); Add_Action (Table.States (367), 43, Reduce, (178, 1), 2, null, null); Add_Action (Table.States (367), 68, Reduce, (324, 1), 2, null, null); Add_Error (Table.States (367)); Table.States (367).Kernel := To_Vector (((178, 300, 0, False), (324, 300, 0, False))); Table.States (367).Minimal_Complete_Actions := To_Vector (((Reduce, 178, 2), (Reduce, 324, 2))); Add_Action (Table.States (368), 22, Reduce, (178, 0), 2, null, null); Add_Action (Table.States (368), 43, Reduce, (178, 0), 2, null, null); Add_Action (Table.States (368), 68, Reduce, (324, 0), 2, null, null); Add_Error (Table.States (368)); Table.States (368).Kernel := To_Vector (((178, 300, 0, False), (324, 300, 0, False))); Table.States (368).Minimal_Complete_Actions := To_Vector (((Reduce, 178, 2), (Reduce, 324, 2))); Add_Action (Table.States (369), 4, 1); Add_Action (Table.States (369), 18, 4); Add_Action (Table.States (369), 67, 199); Add_Action (Table.States (369), 72, 200); Add_Error (Table.States (369)); Add_Goto (Table.States (369), 113, 201); Add_Goto (Table.States (369), 160, 202); Add_Goto (Table.States (369), 161, 533); Add_Goto (Table.States (369), 295, 534); Table.States (369).Kernel := To_Vector ((0 => (296, 43, 2, True))); Table.States (369).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 67, 199))); Table.States (369).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (370), 4, 1); Add_Action (Table.States (370), 5, 2); Add_Action (Table.States (370), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (370), 15, 3); Add_Action (Table.States (370), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (370), 18, 4); Add_Action (Table.States (370), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (370), 27, 5); Add_Action (Table.States (370), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (370), 31, 9); Add_Action (Table.States (370), 32, 10); Add_Action (Table.States (370), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (370), 41, 13); Add_Action (Table.States (370), 48, 16); Add_Action (Table.States (370), 52, 20); Add_Action (Table.States (370), 57, 21); Add_Action (Table.States (370), 58, 22); Add_Action (Table.States (370), 61, 24); Add_Action (Table.States (370), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (370), 93, 31); Add_Action (Table.States (370), 104, 360); Add_Action (Table.States (370), 105, 33); Add_Action (Table.States (370), 106, 34); Add_Error (Table.States (370)); Add_Goto (Table.States (370), 113, 36); Add_Goto (Table.States (370), 123, 38); Add_Goto (Table.States (370), 126, 39); Add_Goto (Table.States (370), 128, 41); Add_Goto (Table.States (370), 131, 42); Add_Goto (Table.States (370), 132, 43); Add_Goto (Table.States (370), 133, 44); Add_Goto (Table.States (370), 139, 47); Add_Goto (Table.States (370), 151, 50); Add_Goto (Table.States (370), 152, 51); Add_Goto (Table.States (370), 161, 53); Add_Goto (Table.States (370), 190, 57); Add_Goto (Table.States (370), 196, 59); Add_Goto (Table.States (370), 217, 68); Add_Goto (Table.States (370), 222, 70); Add_Goto (Table.States (370), 232, 72); Add_Goto (Table.States (370), 239, 73); Add_Goto (Table.States (370), 257, 83); Add_Goto (Table.States (370), 261, 86); Add_Goto (Table.States (370), 272, 92); Add_Goto (Table.States (370), 276, 93); Add_Goto (Table.States (370), 290, 96); Add_Goto (Table.States (370), 293, 97); Add_Goto (Table.States (370), 294, 98); Add_Goto (Table.States (370), 298, 99); Add_Goto (Table.States (370), 299, 361); Add_Goto (Table.States (370), 300, 535); Add_Goto (Table.States (370), 302, 100); Add_Goto (Table.States (370), 303, 101); Add_Goto (Table.States (370), 306, 363); Add_Goto (Table.States (370), 323, 114); Table.States (370).Kernel := To_Vector ((0 => (294, 22, 3, False))); Table.States (370).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (371), 61, 536); Add_Error (Table.States (371)); Table.States (371).Kernel := To_Vector ((0 => (294, 24, 2, False))); Table.States (371).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 61, 536))); Add_Action (Table.States (372), 5, 537); Add_Error (Table.States (372)); Table.States (372).Kernel := To_Vector ((0 => (126, 68, 4, False))); Table.States (372).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 5, 537))); Add_Action (Table.States (373), 40, 483); Add_Action (Table.States (373), 104, 119); Add_Action (Table.States (373), 105, 33); Add_Action (Table.States (373), 106, 34); Add_Error (Table.States (373)); Add_Goto (Table.States (373), 128, 41); Add_Goto (Table.States (373), 239, 484); Add_Goto (Table.States (373), 272, 92); Add_Goto (Table.States (373), 293, 97); Add_Goto (Table.States (373), 314, 538); Table.States (373).Kernel := To_Vector ((0 => (313, 35, 2, False))); Table.States (373).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (374), 35, 539); Add_Conflict (Table.States (374), 35, (122, 1), 0, null, null); Add_Action (Table.States (374), 74, 337); Add_Error (Table.States (374)); Add_Goto (Table.States (374), 122, 540); Table.States (374).Kernel := To_Vector (((316, 104, 4, False), (317, 104, 3, False))); Table.States (374).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 539))); Add_Action (Table.States (375), 35, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (375), 74, Reduce, (169, 2), 0, null, null); Add_Action (Table.States (375), 76, 377); Add_Action (Table.States (375), 96, Reduce, (169, 2), 0, null, null); Add_Error (Table.States (375)); Add_Goto (Table.States (375), 169, 541); Table.States (375).Kernel := To_Vector (((319, 104, 6, False), (319, 104, 3, False), (319, 104, 1, False))); Table.States (375).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 0))); Add_Action (Table.States (376), 35, 542); Add_Action (Table.States (376), 96, 543); Add_Error (Table.States (376)); Table.States (376).Kernel := To_Vector (((305, 122, 6, False), (305, 122, 3, False), (305, 122, 1, False))); Table.States (376).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 543))); Add_Action (Table.States (377), 77, Reduce, (170, 4), 0, null, null); Add_Action (Table.States (377), 80, 544); Add_Action (Table.States (377), 96, Reduce, (170, 4), 0, null, null); Add_Action (Table.States (377), 104, 164); Add_Error (Table.States (377)); Add_Goto (Table.States (377), 170, 545); Add_Goto (Table.States (377), 171, 546); Add_Goto (Table.States (377), 219, 547); Table.States (377).Kernel := To_Vector (((169, 76, 2, False), (169, 76, 1, False))); Table.States (377).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 171, 0))); Add_Action (Table.States (378), 35, 548); Add_Action (Table.States (378), 96, 549); Add_Error (Table.States (378)); Table.States (378).Kernel := To_Vector (((206, 169, 3, False), (223, 169, 3, False), (223, 169, 1, False), (259, 169, 6, False), (260, 169, 3, False))); Table.States (378).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 549))); Add_Action (Table.States (379), 104, 119); Add_Action (Table.States (379), 105, 33); Add_Action (Table.States (379), 106, 34); Add_Error (Table.States (379)); Add_Goto (Table.States (379), 128, 41); Add_Goto (Table.States (379), 238, 550); Add_Goto (Table.States (379), 239, 219); Add_Goto (Table.States (379), 272, 92); Add_Goto (Table.States (379), 293, 97); Table.States (379).Kernel := To_Vector ((0 => (331, 69, 2, False))); Table.States (379).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (380), 83, 381); Add_Action (Table.States (380), 96, 551); Add_Error (Table.States (380)); Table.States (380).Kernel := To_Vector (((238, 238, 2, True), (331, 238, 1, False))); Table.States (380).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 551))); Add_Action (Table.States (381), 104, 119); Add_Action (Table.States (381), 105, 33); Add_Action (Table.States (381), 106, 34); Add_Error (Table.States (381)); Add_Goto (Table.States (381), 128, 41); Add_Goto (Table.States (381), 239, 552); Add_Goto (Table.States (381), 272, 92); Add_Goto (Table.States (381), 293, 97); Table.States (381).Kernel := To_Vector ((0 => (238, 83, 1, True))); Table.States (381).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (381).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (382), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (331, 2), 3, use_clause_2'Access, null); Table.States (382).Kernel := To_Vector ((0 => (331, 96, 0, False))); Table.States (382).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 331, 3))); Add_Action (Table.States (383), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (332, 3), 3, with_clause_3'Access, null); Table.States (383).Kernel := To_Vector ((0 => (332, 96, 0, False))); Table.States (383).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 332, 3))); Add_Action (Table.States (384), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (217, 0), 3, goto_label_0'Access, null); Table.States (384).Kernel := To_Vector ((0 => (217, 90, 0, False))); Table.States (384).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 217, 3))); Add_Action (Table.States (385), 56, 553); Add_Error (Table.States (385)); Table.States (385).Kernel := To_Vector ((0 => (245, 26, 3, False))); Table.States (385).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 553))); Add_Action (Table.States (386), 41, 554); Add_Error (Table.States (386)); Table.States (386).Kernel := To_Vector ((0 => (241, 40, 1, False))); Table.States (386).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 554))); Add_Action (Table.States (387), 56, 555); Add_Error (Table.States (387)); Table.States (387).Kernel := To_Vector ((0 => (245, 114, 3, False))); Table.States (387).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 555))); Add_Action (Table.States (388), 7, 556); Add_Action (Table.States (388), 104, 119); Add_Action (Table.States (388), 105, 33); Add_Action (Table.States (388), 106, 34); Add_Error (Table.States (388)); Add_Goto (Table.States (388), 128, 41); Add_Goto (Table.States (388), 239, 557); Add_Goto (Table.States (388), 272, 92); Add_Goto (Table.States (388), 293, 97); Table.States (388).Kernel := To_Vector (((114, 241, 2, False), (114, 241, 3, True), (114, 241, 2, False), (245, 241, 4, False))); Table.States (388).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 7, 556))); Add_Action (Table.States (389), 24, 558); Add_Error (Table.States (389)); Table.States (389).Kernel := To_Vector ((0 => (133, 218, 2, False))); Table.States (389).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 558))); Add_Action (Table.States (390), 24, Reduce, (218, 1), 1, null, null); Add_Action (Table.States (390), 26, 559); Add_Error (Table.States (390)); Table.States (390).Kernel := To_Vector (((218, 300, 1, False), (218, 300, 0, False))); Table.States (390).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 1))); Add_Action (Table.States (391), (13, 24, 25, 28, 29, 30, 40, 46, 47, 48, 49, 50, 51, 63, 66, 69, 71, 104), (158, 2), 1, null, null); Table.States (391).Kernel := To_Vector ((0 => (158, 157, 0, False))); Table.States (391).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 158, 1))); Add_Action (Table.States (392), 13, Reduce, (159, 0), 1, null, null); Add_Action (Table.States (392), 24, Reduce, (159, 0), 1, null, null); Add_Action (Table.States (392), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (392), 28, 183); Add_Action (Table.States (392), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (392), 30, 8); Add_Action (Table.States (392), 40, 12); Add_Action (Table.States (392), 46, 14); Add_Action (Table.States (392), 47, 15); Add_Action (Table.States (392), 48, 16); Add_Action (Table.States (392), 49, Reduce, (159, 0), 1, null, null); Add_Action (Table.States (392), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (392), 51, 19); Add_Action (Table.States (392), 63, 25); Add_Action (Table.States (392), 66, 26); Add_Action (Table.States (392), 69, 27); Add_Action (Table.States (392), 71, 28); Add_Action (Table.States (392), 104, 185); Add_Error (Table.States (392)); Add_Goto (Table.States (392), 112, 35); Add_Goto (Table.States (392), 121, 37); Add_Goto (Table.States (392), 127, 40); Add_Goto (Table.States (392), 134, 45); Add_Goto (Table.States (392), 135, 46); Add_Goto (Table.States (392), 157, 560); Add_Goto (Table.States (392), 179, 54); Add_Goto (Table.States (392), 182, 55); Add_Goto (Table.States (392), 186, 56); Add_Goto (Table.States (392), 193, 58); Add_Goto (Table.States (392), 206, 60); Add_Goto (Table.States (392), 207, 61); Add_Goto (Table.States (392), 209, 62); Add_Goto (Table.States (392), 210, 63); Add_Goto (Table.States (392), 213, 64); Add_Goto (Table.States (392), 214, 65); Add_Goto (Table.States (392), 215, 66); Add_Goto (Table.States (392), 216, 67); Add_Goto (Table.States (392), 219, 69); Add_Goto (Table.States (392), 223, 71); Add_Goto (Table.States (392), 243, 74); Add_Goto (Table.States (392), 244, 75); Add_Goto (Table.States (392), 245, 76); Add_Goto (Table.States (392), 246, 77); Add_Goto (Table.States (392), 247, 78); Add_Goto (Table.States (392), 248, 79); Add_Goto (Table.States (392), 249, 80); Add_Goto (Table.States (392), 250, 81); Add_Goto (Table.States (392), 251, 82); Add_Goto (Table.States (392), 257, 561); Add_Goto (Table.States (392), 259, 84); Add_Goto (Table.States (392), 260, 85); Add_Goto (Table.States (392), 262, 87); Add_Goto (Table.States (392), 263, 88); Add_Goto (Table.States (392), 264, 89); Add_Goto (Table.States (392), 265, 90); Add_Goto (Table.States (392), 271, 91); Add_Goto (Table.States (392), 281, 94); Add_Goto (Table.States (392), 289, 95); Add_Goto (Table.States (392), 304, 102); Add_Goto (Table.States (392), 305, 103); Add_Goto (Table.States (392), 307, 105); Add_Goto (Table.States (392), 308, 106); Add_Goto (Table.States (392), 309, 107); Add_Goto (Table.States (392), 311, 108); Add_Goto (Table.States (392), 313, 109); Add_Goto (Table.States (392), 316, 111); Add_Goto (Table.States (392), 317, 112); Add_Goto (Table.States (392), 319, 113); Add_Goto (Table.States (392), 325, 115); Add_Goto (Table.States (392), 331, 116); Table.States (392).Kernel := To_Vector (((158, 158, 3, True), (158, 158, 3, True), (159, 158, 0, False))); Table.States (392).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 1))); end Subr_7; procedure Subr_8 is begin Add_Action (Table.States (393), 13, 562); Add_Error (Table.States (393)); Table.States (393).Kernel := To_Vector ((0 => (133, 159, 3, False))); Table.States (393).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 13, 562))); Add_Action (Table.States (394), (13, 24, 25, 28, 29, 30, 40, 46, 47, 48, 49, 50, 51, 63, 66, 69, 71, 104), (158, 3), 1, null, null); Table.States (394).Kernel := To_Vector ((0 => (158, 257, 0, False))); Table.States (394).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 158, 1))); Add_Action (Table.States (395), 33, 311); Add_Action (Table.States (395), 42, 312); Add_Action (Table.States (395), 81, 313); Add_Error (Table.States (395)); Table.States (395).Kernel := To_Vector (((230, 104, 5, False), (230, 104, 4, False), (230, 104, 3, False), (230, 104, 3, False), (230, 104, 2, False), (230, 104, 2, False))); Table.States (395).Minimal_Complete_Actions := To_Vector (((Shift, 42, 312), (Shift, 33, 311))); Add_Action (Table.States (396), 24, 563); Add_Error (Table.States (396)); Table.States (396).Kernel := To_Vector ((0 => (232, 300, 3, False))); Table.States (396).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 563))); Add_Action (Table.States (397), 4, 1); Add_Action (Table.States (397), 5, 2); Add_Action (Table.States (397), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (397), 15, 3); Add_Action (Table.States (397), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (397), 18, 4); Add_Action (Table.States (397), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (397), 27, 5); Add_Action (Table.States (397), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (397), 31, 9); Add_Action (Table.States (397), 32, 10); Add_Action (Table.States (397), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (397), 41, 13); Add_Action (Table.States (397), 48, 16); Add_Action (Table.States (397), 52, 20); Add_Action (Table.States (397), 57, 21); Add_Action (Table.States (397), 58, 22); Add_Action (Table.States (397), 61, 24); Add_Action (Table.States (397), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (397), 93, 31); Add_Action (Table.States (397), 104, 360); Add_Action (Table.States (397), 105, 33); Add_Action (Table.States (397), 106, 34); Add_Error (Table.States (397)); Add_Goto (Table.States (397), 113, 36); Add_Goto (Table.States (397), 123, 38); Add_Goto (Table.States (397), 126, 39); Add_Goto (Table.States (397), 128, 41); Add_Goto (Table.States (397), 131, 42); Add_Goto (Table.States (397), 132, 43); Add_Goto (Table.States (397), 133, 44); Add_Goto (Table.States (397), 139, 47); Add_Goto (Table.States (397), 151, 50); Add_Goto (Table.States (397), 152, 51); Add_Goto (Table.States (397), 161, 53); Add_Goto (Table.States (397), 190, 57); Add_Goto (Table.States (397), 196, 59); Add_Goto (Table.States (397), 217, 68); Add_Goto (Table.States (397), 222, 70); Add_Goto (Table.States (397), 232, 72); Add_Goto (Table.States (397), 239, 73); Add_Goto (Table.States (397), 257, 83); Add_Goto (Table.States (397), 261, 86); Add_Goto (Table.States (397), 272, 92); Add_Goto (Table.States (397), 276, 93); Add_Goto (Table.States (397), 290, 96); Add_Goto (Table.States (397), 293, 97); Add_Goto (Table.States (397), 294, 98); Add_Goto (Table.States (397), 298, 99); Add_Goto (Table.States (397), 299, 361); Add_Goto (Table.States (397), 300, 564); Add_Goto (Table.States (397), 302, 100); Add_Goto (Table.States (397), 303, 101); Add_Goto (Table.States (397), 306, 363); Add_Goto (Table.States (397), 323, 114); Table.States (397).Kernel := To_Vector ((0 => (232, 37, 3, False))); Table.States (397).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (398), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (398), 74, 337); Add_Action (Table.States (398), 76, 235); Add_Action (Table.States (398), 84, 237); Add_Action (Table.States (398), 101, 239); Add_Action (Table.States (398), 102, 240); Add_Error (Table.States (398)); Add_Goto (Table.States (398), 115, 241); Add_Goto (Table.States (398), 122, 338); Add_Goto (Table.States (398), 322, 242); Table.States (398).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (251, 239, 3, False), (251, 239, 2, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (398).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (399), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (214, 0), 3, generic_package_declaration_0'Access, null); Table.States (399).Kernel := To_Vector ((0 => (214, 96, 0, False))); Table.States (399).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 214, 3))); Add_Action (Table.States (400), 96, 565); Add_Error (Table.States (400)); Table.States (400).Kernel := To_Vector ((0 => (216, 122, 1, False))); Table.States (400).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 565))); Add_Action (Table.States (401), (7, 11, 16, 21, 33, 40, 45, 74, 77, 82, 96, 104, 105, 106), (118, 0), 1, null, null); Table.States (401).Kernel := To_Vector ((0 => (118, 8, 0, False))); Table.States (401).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 118, 1))); Add_Action (Table.States (402), 82, 566); Add_Error (Table.States (402)); Table.States (402).Kernel := To_Vector ((0 => (157, 16, 2, False))); Table.States (402).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 82, 566))); Add_Action (Table.States (403), 96, 567); Add_Error (Table.States (403)); Table.States (403).Kernel := To_Vector ((0 => (186, 26, 1, False))); Table.States (403).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 567))); Add_Action (Table.States (404), 7, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 11, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 16, 568); Add_Action (Table.States (404), 40, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 74, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 82, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 96, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 104, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 105, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (404), 106, Reduce, (154, 1), 0, null, null); Add_Error (Table.States (404)); Add_Goto (Table.States (404), 154, 569); Table.States (404).Kernel := To_Vector (((244, 118, 3, False), (244, 118, 4, False), (244, 118, 10, False), (244, 118, 2, False), (244, 118, 3, False), (244, 118, 9, False))); Table.States (404).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 154, 0))); Add_Action (Table.States (405), (81, 83), (219, 0), 3, identifier_list_0'Access, null); Table.States (405).Kernel := To_Vector ((0 => (219, 104, 0, True))); Table.States (405).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 219, 3))); Table.States (405).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (406), 77, 570); Add_Action (Table.States (406), 83, 443); Add_Error (Table.States (406)); Table.States (406).Kernel := To_Vector (((115, 125, 1, False), (125, 125, 1, True))); Table.States (406).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 570))); Add_Action (Table.States (407), 77, 571); Add_Error (Table.States (407)); Table.States (407).Kernel := To_Vector ((0 => (115, 153, 1, False))); Table.States (407).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 571))); Add_Action (Table.States (408), 35, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Action (Table.States (408), 77, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Action (Table.States (408), 79, Reduce, (165, 0), 1, null, null); Add_Action (Table.States (408), 83, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Action (Table.States (408), 87, Reduce, (165, 0), 1, null, null); Add_Action (Table.States (408), 96, Reduce, (124, 4), 1, association_opt_4'Access, null); Add_Error (Table.States (408)); Table.States (408).Kernel := To_Vector (((124, 191, 0, False), (165, 191, 0, False))); Table.States (408).Minimal_Complete_Actions := To_Vector (((Reduce, 124, 1), (Reduce, 165, 1))); Add_Action (Table.States (409), 77, Reduce, (278, 1), 1, null, null); Add_Action (Table.States (409), 79, Reduce, (165, 2), 1, null, null); Add_Action (Table.States (409), 83, Reduce, (278, 1), 1, null, null); Add_Action (Table.States (409), 87, Reduce, (165, 2), 1, null, null); Add_Error (Table.States (409)); Table.States (409).Kernel := To_Vector (((165, 277, 0, False), (278, 277, 0, False))); Table.States (409).Minimal_Complete_Actions := To_Vector (((Reduce, 165, 1), (Reduce, 278, 1))); Add_Action (Table.States (410), 77, 572); Add_Action (Table.States (410), 83, 573); Add_Error (Table.States (410)); Table.States (410).Kernel := To_Vector (((239, 278, 1, True), (278, 278, 4, True))); Table.States (410).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 572))); Table.States (410).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (411), 96, 574); Add_Error (Table.States (411)); Table.States (411).Kernel := To_Vector ((0 => (123, 192, 1, False))); Table.States (411).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 574))); Add_Action (Table.States (412), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (293, 3), 3, selected_component_3'Access, null); Table.States (412).Kernel := To_Vector ((0 => (293, 9, 0, True))); Table.States (412).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 293, 3))); Table.States (412).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (413), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (293, 0), 3, selected_component_0'Access, selected_component_0_check'Access); Table.States (413).Kernel := To_Vector ((0 => (293, 104, 0, True))); Table.States (413).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 293, 3))); Table.States (413).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (414), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (293, 2), 3, selected_component_2'Access, selected_component_2_check'Access); Table.States (414).Kernel := To_Vector ((0 => (293, 105, 0, True))); Table.States (414).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 293, 3))); Table.States (414).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (415), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (293, 1), 3, selected_component_1'Access, null); Table.States (415).Kernel := To_Vector ((0 => (293, 106, 0, True))); Table.States (415).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 293, 3))); Table.States (415).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (416), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (129, 1), 1, null, null); Table.States (416).Kernel := To_Vector ((0 => (129, 7, 0, False))); Table.States (416).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 129, 1))); Add_Action (Table.States (417), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (129, 2), 1, null, null); Table.States (417).Kernel := To_Vector ((0 => (129, 19, 0, False))); Table.States (417).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 129, 1))); Add_Action (Table.States (418), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (129, 3), 1, null, null); Table.States (418).Kernel := To_Vector ((0 => (129, 20, 0, False))); Table.States (418).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 129, 1))); Add_Action (Table.States (419), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (129, 4), 1, null, null); Table.States (419).Kernel := To_Vector ((0 => (129, 38, 0, False))); Table.States (419).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 129, 1))); Add_Action (Table.States (420), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (272, 0), 3, qualified_expression_0'Access, null); Table.States (420).Kernel := To_Vector ((0 => (272, 117, 0, True))); Table.States (420).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 272, 3))); Table.States (420).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (421), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (128, 0), 3, null, null); Table.States (421).Kernel := To_Vector ((0 => (128, 129, 0, True))); Table.States (421).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 128, 3))); Table.States (421).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (422), 4, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 5, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 10, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 13, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 15, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 17, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 18, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 20, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 21, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 22, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 23, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 27, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 28, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 31, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 32, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 33, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 35, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 37, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 38, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 40, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 41, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 42, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 43, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 48, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 52, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 53, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 55, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 56, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 57, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 58, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 61, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 68, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 71, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 73, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 74, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 75, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 76, 235); Add_Conflict (Table.States (422), 76, (129, 0), 1, null, null); Add_Action (Table.States (422), 77, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 78, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 79, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 82, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 83, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 84, 237); Add_Conflict (Table.States (422), 84, (129, 0), 1, null, null); Add_Action (Table.States (422), 85, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 86, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 87, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 88, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 89, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 91, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 92, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 93, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 94, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 95, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 96, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 97, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 98, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 99, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 100, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 101, 239); Add_Conflict (Table.States (422), 101, (129, 0), 1, null, null); Add_Action (Table.States (422), 102, 240); Add_Conflict (Table.States (422), 102, (129, 0), 1, null, null); Add_Action (Table.States (422), 104, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 105, Reduce, (129, 0), 1, null, null); Add_Action (Table.States (422), 106, Reduce, (129, 0), 1, null, null); Add_Error (Table.States (422)); Add_Goto (Table.States (422), 115, 241); Add_Goto (Table.States (422), 322, 242); Table.States (422).Kernel := To_Vector (((128, 239, 2, True), (129, 239, 0, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (422).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 129, 1))); Table.States (422).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (423), 74, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (423), 76, 575); Add_Action (Table.States (423), 96, Reduce, (253, 1), 0, null, null); Add_Error (Table.States (423)); Add_Goto (Table.States (423), 199, 344); Add_Goto (Table.States (423), 253, 576); Table.States (423).Kernel := To_Vector (((179, 104, 4, False), (179, 104, 1, False))); Table.States (423).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (424), 35, 577); Add_Action (Table.States (424), 58, 317); Add_Action (Table.States (424), 76, 318); Add_Action (Table.States (424), 84, 237); Add_Action (Table.States (424), 101, 239); Add_Action (Table.States (424), 102, 240); Add_Error (Table.States (424)); Add_Goto (Table.States (424), 115, 241); Add_Goto (Table.States (424), 199, 319); Add_Goto (Table.States (424), 252, 320); Add_Goto (Table.States (424), 291, 321); Add_Goto (Table.States (424), 322, 242); Table.States (424).Kernel := To_Vector (((128, 239, 2, True), (207, 239, 1, False), (213, 239, 4, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (424).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 58, 317))); Add_Action (Table.States (425), 35, 578); Add_Conflict (Table.States (425), 35, (253, 1), 0, null, null); Add_Action (Table.States (425), 56, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (425), 74, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (425), 76, 318); Add_Action (Table.States (425), 84, 237); Add_Action (Table.States (425), 96, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (425), 101, 239); Add_Action (Table.States (425), 102, 240); Add_Error (Table.States (425)); Add_Goto (Table.States (425), 115, 241); Add_Goto (Table.States (425), 199, 344); Add_Goto (Table.States (425), 253, 345); Add_Goto (Table.States (425), 322, 242); Table.States (425).Kernel := To_Vector (((128, 239, 2, True), (213, 239, 4, False), (239, 239, 5, True), (239, 239, 2, True), (262, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (425).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (426), 76, 579); Add_Error (Table.States (426)); Add_Goto (Table.States (426), 256, 580); Table.States (426).Kernel := To_Vector ((0 => (193, 35, 3, False))); Table.States (426).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 76, 579))); Add_Action (Table.States (427), 41, 581); Add_Error (Table.States (427)); Table.States (427).Kernel := To_Vector ((0 => (243, 35, 2, False))); Table.States (427).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 581))); Add_Action (Table.States (428), 6, 582); Add_Action (Table.States (428), 60, 583); Add_Error (Table.States (428)); Table.States (428).Kernel := To_Vector (((112, 35, 2, False), (308, 35, 2, False))); Table.States (428).Minimal_Complete_Actions := To_Vector (((Shift, 6, 582), (Shift, 60, 583))); Add_Action (Table.States (429), 104, 119); Add_Action (Table.States (429), 105, 33); Add_Action (Table.States (429), 106, 34); Add_Error (Table.States (429)); Add_Goto (Table.States (429), 128, 41); Add_Goto (Table.States (429), 239, 584); Add_Goto (Table.States (429), 272, 92); Add_Goto (Table.States (429), 293, 97); Table.States (429).Kernel := To_Vector ((0 => (311, 56, 2, False))); Table.States (429).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (430), 35, 585); Add_Action (Table.States (430), 96, 586); Add_Error (Table.States (430)); Table.States (430).Kernel := To_Vector (((307, 122, 4, False), (309, 122, 1, False))); Table.States (430).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 586))); Add_Action (Table.States (431), 77, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (431), 96, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (431), 104, 164); Add_Error (Table.States (431)); Add_Goto (Table.States (431), 219, 493); Add_Goto (Table.States (431), 254, 494); Add_Goto (Table.States (431), 255, 495); Table.States (431).Kernel := To_Vector ((0 => (199, 76, 1, False))); Table.States (431).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 255, 0))); Add_Action (Table.States (432), 21, 587); Add_Action (Table.States (432), 96, 588); Add_Error (Table.States (432)); Table.States (432).Kernel := To_Vector (((113, 253, 3, False), (113, 253, 1, False))); Table.States (432).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 588))); Add_Action (Table.States (433), 3, 121); Add_Action (Table.States (433), 10, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 20, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 21, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 22, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 23, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 37, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 39, 122); Add_Action (Table.States (433), 40, 123); Add_Action (Table.States (433), 41, 124); Add_Action (Table.States (433), 43, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 52, 125); Add_Action (Table.States (433), 53, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 68, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 75, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 76, 126); Add_Action (Table.States (433), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 79, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 83, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 87, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 94, 127); Add_Action (Table.States (433), 95, 128); Add_Action (Table.States (433), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (433), 103, 129); Add_Action (Table.States (433), 104, 119); Add_Action (Table.States (433), 105, 33); Add_Action (Table.States (433), 106, 34); Add_Error (Table.States (433)); Add_Goto (Table.States (433), 117, 130); Add_Goto (Table.States (433), 128, 41); Add_Goto (Table.States (433), 191, 131); Add_Goto (Table.States (433), 192, 589); Add_Goto (Table.States (433), 197, 133); Add_Goto (Table.States (433), 239, 134); Add_Goto (Table.States (433), 258, 135); Add_Goto (Table.States (433), 272, 92); Add_Goto (Table.States (433), 275, 136); Add_Goto (Table.States (433), 282, 137); Add_Goto (Table.States (433), 283, 138); Add_Goto (Table.States (433), 284, 139); Add_Goto (Table.States (433), 285, 140); Add_Goto (Table.States (433), 286, 141); Add_Goto (Table.States (433), 287, 142); Add_Goto (Table.States (433), 293, 97); Add_Goto (Table.States (433), 301, 143); Add_Goto (Table.States (433), 320, 144); Add_Goto (Table.States (433), 321, 145); Add_Goto (Table.States (433), 330, 146); Table.States (433).Kernel := To_Vector ((0 => (275, 74, 0, True))); Table.States (433).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Table.States (433).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (434), 35, 590); Add_Error (Table.States (434)); Table.States (434).Kernel := To_Vector ((0 => (136, 192, 3, False))); Table.States (434).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 590))); Add_Action (Table.States (435), (1 => 104), (274, 0), 1, null, null); Table.States (435).Kernel := To_Vector ((0 => (274, 9, 0, False))); Table.States (435).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 274, 1))); Add_Action (Table.States (436), (1 => 104), (274, 1), 1, null, null); Table.States (436).Kernel := To_Vector ((0 => (274, 62, 0, False))); Table.States (436).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 274, 1))); Add_Action (Table.States (437), 104, 395); Add_Error (Table.States (437)); Add_Goto (Table.States (437), 230, 591); Table.States (437).Kernel := To_Vector ((0 => (273, 274, 4, False))); Table.States (437).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 395))); Add_Action (Table.States (438), 68, 592); Add_Error (Table.States (438)); Table.States (438).Kernel := To_Vector (((221, 192, 4, False), (221, 192, 2, False), (221, 192, 3, False), (221, 192, 1, False))); Table.States (438).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 592))); Add_Action (Table.States (439), 10, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 33, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 35, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 38, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 40, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 43, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 55, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 74, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 75, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 77, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 78, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 79, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 83, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 85, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 86, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 87, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 88, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 89, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 91, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 92, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 94, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 95, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 96, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 97, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 98, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 99, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (439), 104, 119); Add_Action (Table.States (439), 105, 33); Add_Action (Table.States (439), 106, 34); Add_Error (Table.States (439)); Add_Goto (Table.States (439), 128, 41); Add_Goto (Table.States (439), 239, 593); Add_Goto (Table.States (439), 272, 92); Add_Goto (Table.States (439), 293, 97); Table.States (439).Kernel := To_Vector (((165, 41, 1, False), (258, 41, 0, False))); Table.States (439).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (440), 77, 594); Add_Error (Table.States (440)); Table.States (440).Kernel := To_Vector ((0 => (117, 54, 1, False))); Table.States (440).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 594))); Add_Action (Table.States (441), 3, 121); Add_Action (Table.States (441), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (441), 39, 122); Add_Action (Table.States (441), 40, 123); Add_Action (Table.States (441), 41, 124); Add_Action (Table.States (441), 52, 125); Add_Action (Table.States (441), 76, 126); Add_Action (Table.States (441), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (441), 80, 595); Add_Action (Table.States (441), 83, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (441), 94, 127); Add_Action (Table.States (441), 95, 128); Add_Action (Table.States (441), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (441), 103, 129); Add_Action (Table.States (441), 104, 119); Add_Action (Table.States (441), 105, 33); Add_Action (Table.States (441), 106, 34); Add_Error (Table.States (441)); Add_Goto (Table.States (441), 117, 130); Add_Goto (Table.States (441), 128, 41); Add_Goto (Table.States (441), 191, 131); Add_Goto (Table.States (441), 192, 596); Add_Goto (Table.States (441), 197, 133); Add_Goto (Table.States (441), 239, 134); Add_Goto (Table.States (441), 258, 135); Add_Goto (Table.States (441), 272, 92); Add_Goto (Table.States (441), 275, 136); Add_Goto (Table.States (441), 282, 137); Add_Goto (Table.States (441), 283, 138); Add_Goto (Table.States (441), 284, 139); Add_Goto (Table.States (441), 285, 140); Add_Goto (Table.States (441), 286, 141); Add_Goto (Table.States (441), 287, 142); Add_Goto (Table.States (441), 293, 97); Add_Goto (Table.States (441), 301, 143); Add_Goto (Table.States (441), 320, 144); Add_Goto (Table.States (441), 321, 145); Add_Goto (Table.States (441), 330, 146); Table.States (441).Kernel := To_Vector (((124, 87, 0, False), (124, 87, 1, False))); Table.States (441).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (442), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (117, 4), 3, aggregate_4'Access, null); Table.States (442).Kernel := To_Vector ((0 => (117, 77, 0, False))); Table.States (442).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 117, 3))); Add_Action (Table.States (443), 3, 121); Add_Action (Table.States (443), 35, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (443), 39, 122); Add_Action (Table.States (443), 40, 261); Add_Action (Table.States (443), 41, 124); Add_Action (Table.States (443), 44, 263); Add_Action (Table.States (443), 52, 125); Add_Action (Table.States (443), 76, 126); Add_Action (Table.States (443), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (443), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (443), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (443), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (443), 94, 127); Add_Action (Table.States (443), 95, 128); Add_Action (Table.States (443), 96, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (443), 103, 129); Add_Action (Table.States (443), 104, 119); Add_Action (Table.States (443), 105, 33); Add_Action (Table.States (443), 106, 264); Add_Error (Table.States (443)); Add_Goto (Table.States (443), 117, 130); Add_Goto (Table.States (443), 124, 597); Add_Goto (Table.States (443), 128, 41); Add_Goto (Table.States (443), 165, 269); Add_Goto (Table.States (443), 166, 270); Add_Goto (Table.States (443), 191, 408); Add_Goto (Table.States (443), 197, 133); Add_Goto (Table.States (443), 239, 274); Add_Goto (Table.States (443), 258, 135); Add_Goto (Table.States (443), 272, 92); Add_Goto (Table.States (443), 275, 136); Add_Goto (Table.States (443), 277, 276); Add_Goto (Table.States (443), 282, 137); Add_Goto (Table.States (443), 283, 138); Add_Goto (Table.States (443), 284, 139); Add_Goto (Table.States (443), 285, 140); Add_Goto (Table.States (443), 286, 141); Add_Goto (Table.States (443), 287, 142); Add_Goto (Table.States (443), 293, 97); Add_Goto (Table.States (443), 301, 277); Add_Goto (Table.States (443), 320, 144); Add_Goto (Table.States (443), 321, 145); Add_Goto (Table.States (443), 330, 146); Table.States (443).Kernel := To_Vector ((0 => (125, 83, 0, True))); Table.States (443).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 124, 0))); Table.States (443).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (444), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (117, 3), 3, aggregate_3'Access, null); Table.States (444).Kernel := To_Vector ((0 => (117, 77, 0, False))); Table.States (444).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 117, 3))); Add_Action (Table.States (445), 3, 121); Add_Action (Table.States (445), 39, 122); Add_Action (Table.States (445), 40, 261); Add_Action (Table.States (445), 41, 124); Add_Action (Table.States (445), 44, 263); Add_Action (Table.States (445), 52, 125); Add_Action (Table.States (445), 76, 126); Add_Action (Table.States (445), 94, 127); Add_Action (Table.States (445), 95, 128); Add_Action (Table.States (445), 103, 129); Add_Action (Table.States (445), 104, 119); Add_Action (Table.States (445), 105, 33); Add_Action (Table.States (445), 106, 34); Add_Error (Table.States (445)); Add_Goto (Table.States (445), 117, 130); Add_Goto (Table.States (445), 128, 41); Add_Goto (Table.States (445), 165, 598); Add_Goto (Table.States (445), 191, 599); Add_Goto (Table.States (445), 197, 133); Add_Goto (Table.States (445), 239, 274); Add_Goto (Table.States (445), 258, 135); Add_Goto (Table.States (445), 272, 92); Add_Goto (Table.States (445), 275, 136); Add_Goto (Table.States (445), 277, 276); Add_Goto (Table.States (445), 282, 137); Add_Goto (Table.States (445), 283, 138); Add_Goto (Table.States (445), 284, 139); Add_Goto (Table.States (445), 285, 140); Add_Goto (Table.States (445), 286, 141); Add_Goto (Table.States (445), 287, 142); Add_Goto (Table.States (445), 293, 97); Add_Goto (Table.States (445), 301, 277); Add_Goto (Table.States (445), 320, 144); Add_Goto (Table.States (445), 321, 145); Add_Goto (Table.States (445), 330, 146); Table.States (445).Kernel := To_Vector ((0 => (166, 79, 1, True))); Table.States (445).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (445).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (446), 3, 121); Add_Action (Table.States (446), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (446), 39, 122); Add_Action (Table.States (446), 40, 123); Add_Action (Table.States (446), 41, 124); Add_Action (Table.States (446), 52, 125); Add_Action (Table.States (446), 76, 126); Add_Action (Table.States (446), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (446), 80, 600); Add_Action (Table.States (446), 83, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (446), 94, 127); Add_Action (Table.States (446), 95, 128); Add_Action (Table.States (446), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (446), 103, 129); Add_Action (Table.States (446), 104, 119); Add_Action (Table.States (446), 105, 33); Add_Action (Table.States (446), 106, 34); Add_Error (Table.States (446)); Add_Goto (Table.States (446), 117, 130); Add_Goto (Table.States (446), 128, 41); Add_Goto (Table.States (446), 191, 131); Add_Goto (Table.States (446), 192, 601); Add_Goto (Table.States (446), 197, 133); Add_Goto (Table.States (446), 239, 134); Add_Goto (Table.States (446), 258, 135); Add_Goto (Table.States (446), 272, 92); Add_Goto (Table.States (446), 275, 136); Add_Goto (Table.States (446), 282, 137); Add_Goto (Table.States (446), 283, 138); Add_Goto (Table.States (446), 284, 139); Add_Goto (Table.States (446), 285, 140); Add_Goto (Table.States (446), 286, 141); Add_Goto (Table.States (446), 287, 142); Add_Goto (Table.States (446), 293, 97); Add_Goto (Table.States (446), 301, 143); Add_Goto (Table.States (446), 320, 144); Add_Goto (Table.States (446), 321, 145); Add_Goto (Table.States (446), 330, 146); Table.States (446).Kernel := To_Vector (((124, 87, 0, False), (124, 87, 1, False))); Table.States (446).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); end Subr_8; procedure Subr_9 is begin Add_Action (Table.States (447), 3, 121); Add_Action (Table.States (447), 39, 122); Add_Action (Table.States (447), 40, 261); Add_Action (Table.States (447), 41, 602); Add_Action (Table.States (447), 44, 263); Add_Action (Table.States (447), 52, 125); Add_Action (Table.States (447), 76, 126); Add_Action (Table.States (447), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (447), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (447), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (447), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (447), 94, 127); Add_Action (Table.States (447), 95, 128); Add_Action (Table.States (447), 103, 129); Add_Action (Table.States (447), 104, 119); Add_Action (Table.States (447), 105, 33); Add_Action (Table.States (447), 106, 264); Add_Error (Table.States (447)); Add_Goto (Table.States (447), 117, 130); Add_Goto (Table.States (447), 124, 265); Add_Goto (Table.States (447), 125, 603); Add_Goto (Table.States (447), 128, 41); Add_Goto (Table.States (447), 165, 269); Add_Goto (Table.States (447), 166, 270); Add_Goto (Table.States (447), 191, 408); Add_Goto (Table.States (447), 197, 133); Add_Goto (Table.States (447), 239, 274); Add_Goto (Table.States (447), 258, 135); Add_Goto (Table.States (447), 272, 92); Add_Goto (Table.States (447), 275, 136); Add_Goto (Table.States (447), 277, 276); Add_Goto (Table.States (447), 282, 137); Add_Goto (Table.States (447), 283, 138); Add_Goto (Table.States (447), 284, 139); Add_Goto (Table.States (447), 285, 140); Add_Goto (Table.States (447), 286, 141); Add_Goto (Table.States (447), 287, 142); Add_Goto (Table.States (447), 293, 97); Add_Goto (Table.States (447), 301, 277); Add_Goto (Table.States (447), 320, 144); Add_Goto (Table.States (447), 321, 145); Add_Goto (Table.States (447), 330, 146); Table.States (447).Kernel := To_Vector (((117, 74, 3, False), (117, 74, 1, False))); Table.States (447).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Add_Action (Table.States (448), 7, 416); Add_Action (Table.States (448), 19, 417); Add_Action (Table.States (448), 20, 418); Add_Action (Table.States (448), 38, 419); Add_Action (Table.States (448), 53, 604); Add_Action (Table.States (448), 76, 126); Add_Action (Table.States (448), 104, 119); Add_Action (Table.States (448), 105, 33); Add_Action (Table.States (448), 106, 34); Add_Error (Table.States (448)); Add_Goto (Table.States (448), 117, 420); Add_Goto (Table.States (448), 128, 41); Add_Goto (Table.States (448), 129, 421); Add_Goto (Table.States (448), 239, 422); Add_Goto (Table.States (448), 272, 92); Add_Goto (Table.States (448), 293, 97); Table.States (448).Kernel := To_Vector (((128, 322, 1, True), (272, 322, 2, True), (277, 322, 3, False), (277, 322, 1, False))); Table.States (448).Minimal_Complete_Actions := To_Vector (((Shift, 104, 119), (Shift, 53, 604))); Table.States (448).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (449), 3, 121); Add_Action (Table.States (449), 39, 122); Add_Action (Table.States (449), 40, 123); Add_Action (Table.States (449), 41, 124); Add_Action (Table.States (449), 76, 126); Add_Action (Table.States (449), 94, 127); Add_Action (Table.States (449), 95, 128); Add_Action (Table.States (449), 103, 129); Add_Action (Table.States (449), 104, 119); Add_Action (Table.States (449), 105, 33); Add_Action (Table.States (449), 106, 34); Add_Error (Table.States (449)); Add_Goto (Table.States (449), 117, 130); Add_Goto (Table.States (449), 128, 41); Add_Goto (Table.States (449), 197, 133); Add_Goto (Table.States (449), 239, 134); Add_Goto (Table.States (449), 258, 135); Add_Goto (Table.States (449), 272, 92); Add_Goto (Table.States (449), 293, 97); Add_Goto (Table.States (449), 301, 605); Add_Goto (Table.States (449), 320, 144); Add_Goto (Table.States (449), 321, 145); Add_Goto (Table.States (449), 330, 146); Table.States (449).Kernel := To_Vector ((0 => (277, 85, 1, False))); Table.States (449).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (450), 3, 121); Add_Action (Table.States (450), 39, 122); Add_Action (Table.States (450), 40, 261); Add_Action (Table.States (450), 41, 124); Add_Action (Table.States (450), 44, 263); Add_Action (Table.States (450), 52, 125); Add_Action (Table.States (450), 76, 126); Add_Action (Table.States (450), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (450), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (450), 94, 127); Add_Action (Table.States (450), 95, 128); Add_Action (Table.States (450), 103, 129); Add_Action (Table.States (450), 104, 119); Add_Action (Table.States (450), 105, 33); Add_Action (Table.States (450), 106, 34); Add_Error (Table.States (450)); Add_Goto (Table.States (450), 117, 130); Add_Goto (Table.States (450), 128, 41); Add_Goto (Table.States (450), 165, 269); Add_Goto (Table.States (450), 166, 606); Add_Goto (Table.States (450), 191, 599); Add_Goto (Table.States (450), 197, 133); Add_Goto (Table.States (450), 239, 274); Add_Goto (Table.States (450), 258, 135); Add_Goto (Table.States (450), 272, 92); Add_Goto (Table.States (450), 275, 136); Add_Goto (Table.States (450), 277, 276); Add_Goto (Table.States (450), 282, 137); Add_Goto (Table.States (450), 283, 138); Add_Goto (Table.States (450), 284, 139); Add_Goto (Table.States (450), 285, 140); Add_Goto (Table.States (450), 286, 141); Add_Goto (Table.States (450), 287, 142); Add_Goto (Table.States (450), 293, 97); Add_Goto (Table.States (450), 301, 277); Add_Goto (Table.States (450), 320, 144); Add_Goto (Table.States (450), 321, 145); Add_Goto (Table.States (450), 330, 146); Table.States (450).Kernel := To_Vector ((0 => (140, 72, 1, False))); Table.States (450).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 166, 0))); Add_Action (Table.States (451), (24, 72), (141, 1), 1, null, null); Table.States (451).Kernel := To_Vector ((0 => (141, 140, 0, False))); Table.States (451).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 141, 1))); Add_Action (Table.States (452), 24, 607); Add_Action (Table.States (452), 72, 450); Add_Error (Table.States (452)); Add_Goto (Table.States (452), 140, 608); Table.States (452).Kernel := To_Vector (((139, 141, 3, False), (141, 141, 2, True))); Table.States (452).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 607))); Add_Action (Table.States (453), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99), (197, 0), 3, null, null); Table.States (453).Kernel := To_Vector ((0 => (197, 258, 0, False))); Table.States (453).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 197, 3))); Add_Action (Table.States (454), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (282, 0), 3, null, null); Table.States (454).Kernel := To_Vector ((0 => (282, 287, 0, True))); Table.States (454).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 282, 3))); Table.States (454).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (455), 3, 121); Add_Action (Table.States (455), 39, 122); Add_Action (Table.States (455), 40, 123); Add_Action (Table.States (455), 41, 124); Add_Action (Table.States (455), 52, 125); Add_Action (Table.States (455), 76, 126); Add_Action (Table.States (455), 94, 127); Add_Action (Table.States (455), 95, 128); Add_Action (Table.States (455), 103, 129); Add_Action (Table.States (455), 104, 119); Add_Action (Table.States (455), 105, 33); Add_Action (Table.States (455), 106, 34); Add_Error (Table.States (455)); Add_Goto (Table.States (455), 117, 130); Add_Goto (Table.States (455), 128, 41); Add_Goto (Table.States (455), 197, 133); Add_Goto (Table.States (455), 239, 134); Add_Goto (Table.States (455), 258, 135); Add_Goto (Table.States (455), 272, 92); Add_Goto (Table.States (455), 275, 136); Add_Goto (Table.States (455), 287, 609); Add_Goto (Table.States (455), 293, 97); Add_Goto (Table.States (455), 301, 143); Add_Goto (Table.States (455), 320, 144); Add_Goto (Table.States (455), 321, 145); Add_Goto (Table.States (455), 330, 146); Table.States (455).Kernel := To_Vector ((0 => (283, 68, 1, True))); Table.States (455).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (455).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (456), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (284, 0), 3, null, null); Table.States (456).Kernel := To_Vector ((0 => (284, 287, 0, True))); Table.States (456).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 284, 3))); Table.States (456).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (457), 3, 121); Add_Action (Table.States (457), 39, 122); Add_Action (Table.States (457), 40, 123); Add_Action (Table.States (457), 41, 124); Add_Action (Table.States (457), 52, 125); Add_Action (Table.States (457), 76, 126); Add_Action (Table.States (457), 94, 127); Add_Action (Table.States (457), 95, 128); Add_Action (Table.States (457), 103, 129); Add_Action (Table.States (457), 104, 119); Add_Action (Table.States (457), 105, 33); Add_Action (Table.States (457), 106, 34); Add_Error (Table.States (457)); Add_Goto (Table.States (457), 117, 130); Add_Goto (Table.States (457), 128, 41); Add_Goto (Table.States (457), 197, 133); Add_Goto (Table.States (457), 239, 134); Add_Goto (Table.States (457), 258, 135); Add_Goto (Table.States (457), 272, 92); Add_Goto (Table.States (457), 275, 136); Add_Goto (Table.States (457), 287, 610); Add_Goto (Table.States (457), 293, 97); Add_Goto (Table.States (457), 301, 143); Add_Goto (Table.States (457), 320, 144); Add_Goto (Table.States (457), 321, 145); Add_Goto (Table.States (457), 330, 146); Table.States (457).Kernel := To_Vector ((0 => (285, 22, 1, True))); Table.States (457).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (457).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (458), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (286, 0), 3, null, null); Table.States (458).Kernel := To_Vector ((0 => (286, 287, 0, True))); Table.States (458).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 286, 3))); Table.States (458).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (459), 3, 121); Add_Action (Table.States (459), 39, 122); Add_Action (Table.States (459), 40, 123); Add_Action (Table.States (459), 41, 124); Add_Action (Table.States (459), 52, 125); Add_Action (Table.States (459), 76, 126); Add_Action (Table.States (459), 94, 127); Add_Action (Table.States (459), 95, 128); Add_Action (Table.States (459), 103, 129); Add_Action (Table.States (459), 104, 119); Add_Action (Table.States (459), 105, 33); Add_Action (Table.States (459), 106, 34); Add_Error (Table.States (459)); Add_Goto (Table.States (459), 117, 130); Add_Goto (Table.States (459), 128, 41); Add_Goto (Table.States (459), 197, 133); Add_Goto (Table.States (459), 239, 134); Add_Goto (Table.States (459), 258, 135); Add_Goto (Table.States (459), 272, 92); Add_Goto (Table.States (459), 275, 136); Add_Goto (Table.States (459), 287, 611); Add_Goto (Table.States (459), 293, 97); Add_Goto (Table.States (459), 301, 143); Add_Goto (Table.States (459), 320, 144); Add_Goto (Table.States (459), 321, 145); Add_Goto (Table.States (459), 330, 146); Table.States (459).Kernel := To_Vector ((0 => (283, 68, 1, True))); Table.States (459).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (459).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (460), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (282, 1), 3, null, null); Table.States (460).Kernel := To_Vector ((0 => (282, 287, 0, True))); Table.States (460).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 282, 3))); Table.States (460).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (461), 3, 121); Add_Action (Table.States (461), 39, 122); Add_Action (Table.States (461), 40, 123); Add_Action (Table.States (461), 41, 124); Add_Action (Table.States (461), 52, 125); Add_Action (Table.States (461), 76, 126); Add_Action (Table.States (461), 94, 127); Add_Action (Table.States (461), 95, 128); Add_Action (Table.States (461), 103, 129); Add_Action (Table.States (461), 104, 119); Add_Action (Table.States (461), 105, 33); Add_Action (Table.States (461), 106, 34); Add_Error (Table.States (461)); Add_Goto (Table.States (461), 117, 130); Add_Goto (Table.States (461), 128, 41); Add_Goto (Table.States (461), 197, 133); Add_Goto (Table.States (461), 239, 134); Add_Goto (Table.States (461), 258, 135); Add_Goto (Table.States (461), 272, 92); Add_Goto (Table.States (461), 275, 136); Add_Goto (Table.States (461), 287, 612); Add_Goto (Table.States (461), 293, 97); Add_Goto (Table.States (461), 301, 143); Add_Goto (Table.States (461), 320, 144); Add_Goto (Table.States (461), 321, 145); Add_Goto (Table.States (461), 330, 146); Table.States (461).Kernel := To_Vector ((0 => (285, 22, 1, True))); Table.States (461).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (461).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (462), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (284, 1), 3, null, null); Table.States (462).Kernel := To_Vector ((0 => (284, 287, 0, True))); Table.States (462).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 284, 3))); Table.States (462).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (463), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (286, 1), 3, null, null); Table.States (463).Kernel := To_Vector ((0 => (286, 287, 0, True))); Table.States (463).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 286, 3))); Table.States (463).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (464), 10, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 20, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 21, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 22, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 23, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 35, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 37, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 43, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 53, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 68, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 74, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 75, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 77, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 79, 613); Add_Conflict (Table.States (464), 79, (287, 1), 3, null, null); Add_Action (Table.States (464), 83, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 87, Reduce, (287, 1), 3, null, null); Add_Action (Table.States (464), 96, Reduce, (287, 1), 3, null, null); Add_Error (Table.States (464)); Table.States (464).Kernel := To_Vector (((233, 233, 2, True), (287, 233, 0, False))); Table.States (464).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 3))); Add_Action (Table.States (465), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (233, 1), 1, null, null); Table.States (465).Kernel := To_Vector ((0 => (233, 234, 0, False))); Table.States (465).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 233, 1))); Add_Action (Table.States (466), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (234, 1), 1, null, null); Table.States (466).Kernel := To_Vector ((0 => (234, 277, 0, False))); Table.States (466).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 234, 1))); Add_Action (Table.States (467), 10, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 20, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 21, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 22, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 23, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 35, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 37, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 43, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 53, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 68, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 74, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 75, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 77, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 79, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 83, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 85, 449); Add_Action (Table.States (467), 87, Reduce, (234, 0), 1, null, null); Add_Action (Table.States (467), 96, Reduce, (234, 0), 1, null, null); Add_Error (Table.States (467)); Table.States (467).Kernel := To_Vector (((234, 301, 0, False), (277, 301, 2, False))); Table.States (467).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 234, 1))); Add_Action (Table.States (468), 3, 121); Add_Action (Table.States (468), 39, 122); Add_Action (Table.States (468), 40, 123); Add_Action (Table.States (468), 41, 124); Add_Action (Table.States (468), 76, 126); Add_Action (Table.States (468), 94, 127); Add_Action (Table.States (468), 95, 128); Add_Action (Table.States (468), 103, 129); Add_Action (Table.States (468), 104, 119); Add_Action (Table.States (468), 105, 33); Add_Action (Table.States (468), 106, 34); Add_Error (Table.States (468)); Add_Goto (Table.States (468), 117, 130); Add_Goto (Table.States (468), 128, 41); Add_Goto (Table.States (468), 197, 133); Add_Goto (Table.States (468), 233, 614); Add_Goto (Table.States (468), 234, 465); Add_Goto (Table.States (468), 239, 274); Add_Goto (Table.States (468), 258, 135); Add_Goto (Table.States (468), 272, 92); Add_Goto (Table.States (468), 277, 466); Add_Goto (Table.States (468), 293, 97); Add_Goto (Table.States (468), 301, 467); Add_Goto (Table.States (468), 320, 144); Add_Goto (Table.States (468), 321, 145); Add_Goto (Table.States (468), 330, 146); Table.States (468).Kernel := To_Vector ((0 => (287, 33, 1, False))); Table.States (468).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (469), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (287, 2), 3, null, null); Table.States (469).Kernel := To_Vector ((0 => (287, 301, 0, False))); Table.States (469).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 3))); Add_Action (Table.States (470), (10, 20, 21, 22, 23, 33, 35, 37, 38, 40, 42, 43, 53, 55, 68, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 94, 95, 96, 97, 98, 99), (320, 0), 3, null, null); Table.States (470).Kernel := To_Vector ((0 => (320, 197, 0, True))); Table.States (470).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 320, 3))); Table.States (470).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (471), 10, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 20, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 21, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 22, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 23, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 33, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 35, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 37, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 38, 297); Add_Action (Table.States (471), 40, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 42, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 43, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 53, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 55, 298); Add_Action (Table.States (471), 68, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 74, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 75, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 77, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 78, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 79, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 82, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 83, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 85, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 86, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 87, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 88, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 89, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 91, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 92, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 94, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 95, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 96, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 97, 299); Add_Action (Table.States (471), 98, Reduce, (321, 0), 3, null, null); Add_Action (Table.States (471), 99, 300); Add_Error (Table.States (471)); Add_Goto (Table.States (471), 237, 301); Table.States (471).Kernel := To_Vector (((320, 320, 2, True), (321, 320, 0, True))); Table.States (471).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 321, 3))); Table.States (471).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (472), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (161, 0), 4, delay_statement_0'Access, null); Table.States (472).Kernel := To_Vector ((0 => (161, 96, 0, False))); Table.States (472).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 161, 4))); Add_Action (Table.States (473), 96, 615); Add_Error (Table.States (473)); Table.States (473).Kernel := To_Vector ((0 => (190, 192, 1, False))); Table.States (473).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 615))); Add_Action (Table.States (474), 39, 122); Add_Action (Table.States (474), 41, 616); Add_Action (Table.States (474), 76, 126); Add_Action (Table.States (474), 103, 129); Add_Action (Table.States (474), 104, 119); Add_Action (Table.States (474), 105, 33); Add_Action (Table.States (474), 106, 34); Add_Error (Table.States (474)); Add_Goto (Table.States (474), 117, 130); Add_Goto (Table.States (474), 128, 41); Add_Goto (Table.States (474), 239, 134); Add_Goto (Table.States (474), 258, 256); Add_Goto (Table.States (474), 272, 92); Add_Goto (Table.States (474), 293, 97); Table.States (474).Kernel := To_Vector (((197, 40, 1, False), (314, 40, 6, False), (314, 40, 2, False))); Table.States (474).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (475), 3, 121); Add_Action (Table.States (475), 39, 122); Add_Action (Table.States (475), 40, 474); Add_Action (Table.States (475), 41, 124); Add_Action (Table.States (475), 76, 126); Add_Action (Table.States (475), 94, 127); Add_Action (Table.States (475), 95, 128); Add_Action (Table.States (475), 103, 129); Add_Action (Table.States (475), 104, 119); Add_Action (Table.States (475), 105, 33); Add_Action (Table.States (475), 106, 34); Add_Error (Table.States (475)); Add_Goto (Table.States (475), 117, 130); Add_Goto (Table.States (475), 128, 41); Add_Goto (Table.States (475), 167, 617); Add_Goto (Table.States (475), 197, 133); Add_Goto (Table.States (475), 239, 477); Add_Goto (Table.States (475), 258, 135); Add_Goto (Table.States (475), 272, 92); Add_Goto (Table.States (475), 277, 478); Add_Goto (Table.States (475), 293, 97); Add_Goto (Table.States (475), 301, 479); Add_Goto (Table.States (475), 314, 480); Add_Goto (Table.States (475), 320, 144); Add_Goto (Table.States (475), 321, 145); Add_Goto (Table.States (475), 330, 146); Table.States (475).Kernel := To_Vector ((0 => (230, 59, 1, False))); Table.States (475).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (476), (37, 87), (230, 5), 3, iterator_specification_5'Access, null); Table.States (476).Kernel := To_Vector ((0 => (230, 167, 0, False))); Table.States (476).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 3))); Add_Action (Table.States (477), 10, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 33, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 37, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (477), 38, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 40, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 43, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 53, 618); Add_Action (Table.States (477), 55, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 75, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 76, 619); Add_Action (Table.States (477), 77, Reduce, (258, 3), 1, null, null); Add_Conflict (Table.States (477), 77, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (477), 78, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 79, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 83, Reduce, (258, 3), 1, null, null); Add_Conflict (Table.States (477), 83, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (477), 84, 237); Add_Action (Table.States (477), 85, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 86, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 87, Reduce, (258, 3), 1, null, null); Add_Conflict (Table.States (477), 87, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (477), 88, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 89, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 91, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 92, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 94, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 95, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 97, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 98, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 99, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 100, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (477), 101, 239); Add_Action (Table.States (477), 102, 240); Add_Error (Table.States (477)); Add_Goto (Table.States (477), 115, 241); Add_Goto (Table.States (477), 155, 620); Add_Goto (Table.States (477), 224, 621); Add_Goto (Table.States (477), 322, 448); Table.States (477).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (258, 239, 0, False), (272, 239, 3, True), (277, 239, 4, False), (277, 239, 2, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (314, 239, 4, False), (314, 239, 0, False))); Table.States (477).Minimal_Complete_Actions := To_Vector (((Reduce, 258, 1), (Reduce, 314, 1))); Add_Action (Table.States (478), (37, 77, 83, 87), (167, 1), 1, null, null); Table.States (478).Kernel := To_Vector ((0 => (167, 277, 0, False))); Table.States (478).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 167, 1))); Add_Action (Table.States (479), 85, 449); Add_Error (Table.States (479)); Table.States (479).Kernel := To_Vector ((0 => (277, 301, 2, False))); Table.States (479).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 85, 449))); Add_Action (Table.States (480), (37, 77, 83, 87), (167, 0), 1, null, null); Table.States (480).Kernel := To_Vector ((0 => (167, 314, 0, False))); Table.States (480).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 167, 1))); Add_Action (Table.States (481), 104, 119); Add_Action (Table.States (481), 105, 33); Add_Action (Table.States (481), 106, 34); Add_Error (Table.States (481)); Add_Goto (Table.States (481), 128, 41); Add_Goto (Table.States (481), 239, 622); Add_Goto (Table.States (481), 272, 92); Add_Goto (Table.States (481), 293, 97); Table.States (481).Kernel := To_Vector ((0 => (230, 59, 1, False))); Table.States (481).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (482), 37, Reduce, (230, 4), 3, null, null); Add_Action (Table.States (482), 76, 235); Add_Action (Table.States (482), 84, 237); Add_Action (Table.States (482), 87, Reduce, (230, 4), 3, null, null); Add_Action (Table.States (482), 101, 239); Add_Action (Table.States (482), 102, 240); Add_Error (Table.States (482)); Add_Goto (Table.States (482), 115, 241); Add_Goto (Table.States (482), 322, 242); Table.States (482).Kernel := To_Vector (((128, 239, 2, True), (230, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (482).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 3))); Add_Action (Table.States (483), 41, 623); Add_Error (Table.States (483)); Table.States (483).Kernel := To_Vector (((314, 40, 6, False), (314, 40, 2, False))); Table.States (483).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 623))); Add_Action (Table.States (484), 10, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 21, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 42, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 53, 618); Add_Action (Table.States (484), 74, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 76, 619); Add_Action (Table.States (484), 82, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 84, 237); Add_Action (Table.States (484), 96, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (484), 101, 239); Add_Action (Table.States (484), 102, 240); Add_Error (Table.States (484)); Add_Goto (Table.States (484), 115, 241); Add_Goto (Table.States (484), 155, 620); Add_Goto (Table.States (484), 224, 621); Add_Goto (Table.States (484), 322, 242); Table.States (484).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (314, 239, 4, False), (314, 239, 0, False))); Table.States (484).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 314, 1))); Add_Action (Table.States (485), 42, 624); Add_Error (Table.States (485)); Table.States (485).Kernel := To_Vector (((230, 314, 3, False), (230, 314, 2, False))); Table.States (485).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 42, 624))); Add_Action (Table.States (486), 96, 625); Add_Error (Table.States (486)); Table.States (486).Kernel := To_Vector ((0 => (121, 192, 1, False))); Table.States (486).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 625))); Add_Action (Table.States (487), 3, 121); Add_Action (Table.States (487), 39, 122); Add_Action (Table.States (487), 40, 123); Add_Action (Table.States (487), 41, 124); Add_Action (Table.States (487), 52, 125); Add_Action (Table.States (487), 76, 126); Add_Action (Table.States (487), 94, 127); Add_Action (Table.States (487), 95, 128); Add_Action (Table.States (487), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (487), 103, 129); Add_Action (Table.States (487), 104, 119); Add_Action (Table.States (487), 105, 33); Add_Action (Table.States (487), 106, 34); Add_Error (Table.States (487)); Add_Goto (Table.States (487), 117, 130); Add_Goto (Table.States (487), 128, 41); Add_Goto (Table.States (487), 191, 131); Add_Goto (Table.States (487), 192, 626); Add_Goto (Table.States (487), 197, 133); Add_Goto (Table.States (487), 239, 134); Add_Goto (Table.States (487), 258, 135); Add_Goto (Table.States (487), 272, 92); Add_Goto (Table.States (487), 275, 136); Add_Goto (Table.States (487), 282, 137); Add_Goto (Table.States (487), 283, 138); Add_Goto (Table.States (487), 284, 139); Add_Goto (Table.States (487), 285, 140); Add_Goto (Table.States (487), 286, 141); Add_Goto (Table.States (487), 287, 142); Add_Goto (Table.States (487), 293, 97); Add_Goto (Table.States (487), 301, 143); Add_Goto (Table.States (487), 320, 144); Add_Goto (Table.States (487), 321, 145); Add_Goto (Table.States (487), 330, 146); Table.States (487).Kernel := To_Vector ((0 => (127, 12, 1, False))); Table.States (487).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (488), 12, 627); Add_Action (Table.States (488), 104, Reduce, (235, 1), 0, null, null); Add_Error (Table.States (488)); Add_Goto (Table.States (488), 235, 628); Table.States (488).Kernel := To_Vector ((0 => (281, 54, 11, False))); Table.States (488).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 235, 0))); Add_Action (Table.States (489), 96, 629); Add_Error (Table.States (489)); Table.States (489).Kernel := To_Vector ((0 => (182, 117, 1, False))); Table.States (489).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 629))); Add_Action (Table.States (490), (21, 35, 56, 74, 77, 82, 96), (291, 1), 2, result_profile_1'Access, null); Table.States (490).Kernel := To_Vector ((0 => (291, 114, 0, True))); Table.States (490).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 291, 2))); Table.States (490).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (491), 7, 556); Add_Action (Table.States (491), 21, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 35, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 56, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 74, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 77, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 82, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (491), 104, 119); Add_Action (Table.States (491), 105, 33); Add_Action (Table.States (491), 106, 34); Add_Error (Table.States (491)); Add_Goto (Table.States (491), 128, 41); Add_Goto (Table.States (491), 239, 630); Add_Goto (Table.States (491), 240, 631); Add_Goto (Table.States (491), 272, 92); Add_Goto (Table.States (491), 293, 97); Table.States (491).Kernel := To_Vector (((114, 241, 2, False), (114, 241, 3, True), (114, 241, 2, False), (291, 241, 0, False))); Table.States (491).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (492), 10, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 33, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 38, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 40, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 43, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 53, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 55, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 75, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 77, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 78, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 79, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 81, Reduce, (219, 1), 1, identifier_list_1'Access, null); Add_Action (Table.States (492), 83, Reduce, (219, 1), 1, identifier_list_1'Access, null); Add_Conflict (Table.States (492), 83, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 85, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 86, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 87, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 88, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 89, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 91, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 92, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 94, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 95, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 97, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 98, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 99, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 100, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (492), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (492)); Table.States (492).Kernel := To_Vector (((219, 104, 0, False), (239, 104, 0, False))); Table.States (492).Minimal_Complete_Actions := To_Vector (((Reduce, 219, 1), (Reduce, 239, 1))); end Subr_9; procedure Subr_10 is begin Add_Action (Table.States (493), 81, 632); Add_Action (Table.States (493), 83, 234); Add_Error (Table.States (493)); Table.States (493).Kernel := To_Vector (((219, 219, 2, True), (254, 219, 3, False), (254, 219, 2, False), (254, 219, 4, False), (254, 219, 3, False))); Table.States (493).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 81, 632))); Add_Action (Table.States (494), (77, 96), (255, 1), 1, null, null); Table.States (494).Kernel := To_Vector ((0 => (255, 254, 0, False))); Table.States (494).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 255, 1))); Add_Action (Table.States (495), 77, 633); Add_Action (Table.States (495), 96, 634); Add_Error (Table.States (495)); Table.States (495).Kernel := To_Vector (((199, 255, 1, False), (255, 255, 1, True))); Table.States (495).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 633))); Add_Action (Table.States (496), (21, 35, 56, 74, 77, 82, 96), (252, 0), 2, parameter_and_result_profile_0'Access, null); Table.States (496).Kernel := To_Vector ((0 => (252, 291, 0, True))); Table.States (496).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 252, 2))); Table.States (496).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (497), 104, 119); Add_Action (Table.States (497), 105, 33); Add_Action (Table.States (497), 106, 34); Add_Error (Table.States (497)); Add_Goto (Table.States (497), 128, 41); Add_Goto (Table.States (497), 239, 635); Add_Goto (Table.States (497), 272, 92); Add_Goto (Table.States (497), 293, 97); Table.States (497).Kernel := To_Vector ((0 => (215, 56, 2, False))); Table.States (497).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (498), 104, 119); Add_Action (Table.States (498), 105, 33); Add_Action (Table.States (498), 106, 34); Add_Error (Table.States (498)); Add_Goto (Table.States (498), 128, 41); Add_Goto (Table.States (498), 239, 636); Add_Goto (Table.States (498), 272, 92); Add_Goto (Table.States (498), 293, 97); Table.States (498).Kernel := To_Vector ((0 => (215, 56, 2, False))); Table.States (498).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (499), 104, 119); Add_Action (Table.States (499), 105, 33); Add_Action (Table.States (499), 106, 34); Add_Error (Table.States (499)); Add_Goto (Table.States (499), 128, 41); Add_Goto (Table.States (499), 239, 637); Add_Goto (Table.States (499), 272, 92); Add_Goto (Table.States (499), 293, 97); Table.States (499).Kernel := To_Vector ((0 => (215, 56, 2, False))); Table.States (499).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (500), 35, 638); Add_Action (Table.States (500), 74, 337); Add_Action (Table.States (500), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (500)); Add_Goto (Table.States (500), 122, 639); Table.States (500).Kernel := To_Vector (((201, 169, 3, False), (201, 169, 3, False), (201, 169, 1, False))); Table.States (500).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (501), 35, 640); Add_Action (Table.States (501), 76, 235); Add_Action (Table.States (501), 84, 237); Add_Action (Table.States (501), 101, 239); Add_Action (Table.States (501), 102, 240); Add_Error (Table.States (501)); Add_Goto (Table.States (501), 115, 241); Add_Goto (Table.States (501), 322, 242); Table.States (501).Kernel := To_Vector (((128, 239, 2, True), (204, 239, 4, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (501).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 640))); Add_Action (Table.States (502), 6, 641); Add_Action (Table.States (502), 41, 642); Add_Action (Table.States (502), 80, 643); Add_Action (Table.States (502), 104, 119); Add_Action (Table.States (502), 105, 33); Add_Action (Table.States (502), 106, 34); Add_Error (Table.States (502)); Add_Goto (Table.States (502), 128, 41); Add_Goto (Table.States (502), 239, 644); Add_Goto (Table.States (502), 272, 92); Add_Goto (Table.States (502), 293, 97); Add_Goto (Table.States (502), 310, 645); Table.States (502).Kernel := To_Vector (((200, 35, 3, False), (200, 35, 2, False), (200, 35, 2, False))); Table.States (502).Minimal_Complete_Actions := To_Vector (((Shift, 104, 119), (Shift, 6, 641))); Add_Action (Table.States (503), 96, 646); Add_Error (Table.States (503)); Table.States (503).Kernel := To_Vector ((0 => (200, 122, 1, False))); Table.States (503).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 646))); Add_Action (Table.States (504), 7, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 40, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 45, 647); Add_Action (Table.States (504), 74, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 82, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 96, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 104, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 105, Reduce, (236, 0), 1, null, null); Add_Action (Table.States (504), 106, Reduce, (236, 0), 1, null, null); Add_Error (Table.States (504)); Table.States (504).Kernel := To_Vector (((236, 33, 0, False), (236, 33, 1, False))); Table.States (504).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 236, 1))); Add_Action (Table.States (505), (7, 40, 74, 82, 96, 104, 105, 106), (236, 2), 1, null, null); Table.States (505).Kernel := To_Vector ((0 => (236, 45, 0, False))); Table.States (505).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 236, 1))); Add_Action (Table.States (506), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (506), 40, 386); Add_Action (Table.States (506), 104, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (506), 105, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (506), 106, Reduce, (241, 1), 0, null, null); Add_Error (Table.States (506)); Add_Goto (Table.States (506), 114, 648); Add_Goto (Table.States (506), 241, 649); Table.States (506).Kernel := To_Vector (((198, 236, 3, False), (198, 236, 4, False), (198, 236, 2, False), (198, 236, 3, False))); Table.States (506).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 0))); Add_Action (Table.States (507), 22, 650); Add_Action (Table.States (507), 23, 651); Add_Action (Table.States (507), 24, 652); Add_Error (Table.States (507)); Add_Goto (Table.States (507), 174, 653); Add_Goto (Table.States (507), 175, 654); Table.States (507).Kernel := To_Vector (((222, 300, 6, False), (222, 300, 4, False), (222, 300, 5, False), (222, 300, 3, False))); Table.States (507).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 652))); Add_Action (Table.States (508), 83, 381); Add_Action (Table.States (508), 96, 655); Add_Error (Table.States (508)); Table.States (508).Kernel := To_Vector (((238, 238, 2, True), (332, 238, 1, False))); Table.States (508).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 655))); Add_Action (Table.States (509), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (332, 1), 4, with_clause_1'Access, null); Table.States (509).Kernel := To_Vector ((0 => (332, 96, 0, False))); Table.States (509).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 332, 4))); Add_Action (Table.States (510), 60, 656); Add_Error (Table.States (510)); Table.States (510).Kernel := To_Vector ((0 => (248, 35, 2, False))); Table.States (510).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 60, 656))); Add_Action (Table.States (511), 35, 657); Add_Error (Table.States (511)); Table.States (511).Kernel := To_Vector (((247, 122, 4, False), (247, 122, 3, False))); Table.States (511).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 657))); Add_Action (Table.States (512), 104, 119); Add_Action (Table.States (512), 105, 33); Add_Action (Table.States (512), 106, 34); Add_Error (Table.States (512)); Add_Goto (Table.States (512), 128, 41); Add_Goto (Table.States (512), 239, 658); Add_Goto (Table.States (512), 272, 92); Add_Goto (Table.States (512), 293, 97); Table.States (512).Kernel := To_Vector ((0 => (213, 39, 2, False))); Table.States (512).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (513), 74, 337); Add_Action (Table.States (513), 76, 235); Add_Action (Table.States (513), 84, 237); Add_Action (Table.States (513), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (513), 101, 239); Add_Action (Table.States (513), 102, 240); Add_Error (Table.States (513)); Add_Goto (Table.States (513), 115, 241); Add_Goto (Table.States (513), 122, 659); Add_Goto (Table.States (513), 322, 242); Table.States (513).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (250, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (513).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (514), 35, Reduce, (122, 0), 2, aspect_specification_opt_0'Access, null); Add_Action (Table.States (514), 83, 443); Add_Action (Table.States (514), 96, Reduce, (122, 0), 2, aspect_specification_opt_0'Access, null); Add_Error (Table.States (514)); Table.States (514).Kernel := To_Vector (((122, 125, 0, False), (125, 125, 1, True))); Table.States (514).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 2))); Add_Action (Table.States (515), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (515), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (515), 28, 183); Add_Action (Table.States (515), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (515), 30, 8); Add_Action (Table.States (515), 40, 12); Add_Action (Table.States (515), 46, 14); Add_Action (Table.States (515), 47, 15); Add_Action (Table.States (515), 48, 16); Add_Action (Table.States (515), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (515), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (515), 51, 19); Add_Action (Table.States (515), 63, 25); Add_Action (Table.States (515), 66, 26); Add_Action (Table.States (515), 69, 27); Add_Action (Table.States (515), 71, 28); Add_Action (Table.States (515), 104, 185); Add_Error (Table.States (515)); Add_Goto (Table.States (515), 112, 35); Add_Goto (Table.States (515), 121, 37); Add_Goto (Table.States (515), 127, 40); Add_Goto (Table.States (515), 134, 45); Add_Goto (Table.States (515), 135, 46); Add_Goto (Table.States (515), 157, 391); Add_Goto (Table.States (515), 158, 392); Add_Goto (Table.States (515), 159, 660); Add_Goto (Table.States (515), 179, 54); Add_Goto (Table.States (515), 182, 55); Add_Goto (Table.States (515), 186, 56); Add_Goto (Table.States (515), 193, 58); Add_Goto (Table.States (515), 206, 60); Add_Goto (Table.States (515), 207, 61); Add_Goto (Table.States (515), 209, 62); Add_Goto (Table.States (515), 210, 63); Add_Goto (Table.States (515), 213, 64); Add_Goto (Table.States (515), 214, 65); Add_Goto (Table.States (515), 215, 66); Add_Goto (Table.States (515), 216, 67); Add_Goto (Table.States (515), 219, 69); Add_Goto (Table.States (515), 223, 71); Add_Goto (Table.States (515), 243, 74); Add_Goto (Table.States (515), 244, 75); Add_Goto (Table.States (515), 245, 76); Add_Goto (Table.States (515), 246, 77); Add_Goto (Table.States (515), 247, 78); Add_Goto (Table.States (515), 248, 79); Add_Goto (Table.States (515), 249, 80); Add_Goto (Table.States (515), 250, 81); Add_Goto (Table.States (515), 251, 82); Add_Goto (Table.States (515), 257, 394); Add_Goto (Table.States (515), 259, 84); Add_Goto (Table.States (515), 260, 85); Add_Goto (Table.States (515), 262, 87); Add_Goto (Table.States (515), 263, 88); Add_Goto (Table.States (515), 264, 89); Add_Goto (Table.States (515), 265, 90); Add_Goto (Table.States (515), 271, 91); Add_Goto (Table.States (515), 281, 94); Add_Goto (Table.States (515), 289, 95); Add_Goto (Table.States (515), 304, 102); Add_Goto (Table.States (515), 305, 103); Add_Goto (Table.States (515), 307, 105); Add_Goto (Table.States (515), 308, 106); Add_Goto (Table.States (515), 309, 107); Add_Goto (Table.States (515), 311, 108); Add_Goto (Table.States (515), 313, 109); Add_Goto (Table.States (515), 316, 111); Add_Goto (Table.States (515), 317, 112); Add_Goto (Table.States (515), 319, 113); Add_Goto (Table.States (515), 325, 115); Add_Goto (Table.States (515), 331, 116); Table.States (515).Kernel := To_Vector (((251, 35, 2, False), (251, 35, 1, False))); Table.States (515).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (516), 77, 661); Add_Action (Table.States (516), 83, 443); Add_Error (Table.States (516)); Table.States (516).Kernel := To_Vector (((125, 125, 1, True), (257, 125, 2, False))); Table.States (516).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 661))); Add_Action (Table.States (517), 77, 662); Add_Error (Table.States (517)); Table.States (517).Kernel := To_Vector ((0 => (257, 153, 2, False))); Table.States (517).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 662))); Add_Action (Table.States (518), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (332, 2), 4, with_clause_2'Access, null); Table.States (518).Kernel := To_Vector ((0 => (332, 96, 0, False))); Table.States (518).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 332, 4))); Add_Action (Table.States (519), 60, 663); Add_Error (Table.States (519)); Table.States (519).Kernel := To_Vector ((0 => (265, 35, 2, False))); Table.States (519).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 60, 663))); Add_Action (Table.States (520), 35, 664); Add_Error (Table.States (520)); Table.States (520).Kernel := To_Vector ((0 => (264, 122, 3, False))); Table.States (520).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 664))); Add_Action (Table.States (521), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (521), 74, 337); Add_Error (Table.States (521)); Add_Goto (Table.States (521), 122, 665); Table.States (521).Kernel := To_Vector (((271, 169, 6, False), (271, 169, 3, False))); Table.States (521).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (522), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (522), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (522), 28, 183); Add_Action (Table.States (522), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (522), 30, 8); Add_Action (Table.States (522), 39, 666); Add_Action (Table.States (522), 40, 12); Add_Action (Table.States (522), 46, 14); Add_Action (Table.States (522), 47, 15); Add_Action (Table.States (522), 48, 16); Add_Action (Table.States (522), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (522), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (522), 51, 19); Add_Action (Table.States (522), 63, 25); Add_Action (Table.States (522), 66, 26); Add_Action (Table.States (522), 69, 27); Add_Action (Table.States (522), 71, 28); Add_Action (Table.States (522), 104, 185); Add_Error (Table.States (522)); Add_Goto (Table.States (522), 112, 35); Add_Goto (Table.States (522), 121, 37); Add_Goto (Table.States (522), 127, 40); Add_Goto (Table.States (522), 134, 45); Add_Goto (Table.States (522), 135, 46); Add_Goto (Table.States (522), 157, 391); Add_Goto (Table.States (522), 158, 392); Add_Goto (Table.States (522), 159, 667); Add_Goto (Table.States (522), 179, 54); Add_Goto (Table.States (522), 182, 55); Add_Goto (Table.States (522), 186, 56); Add_Goto (Table.States (522), 193, 58); Add_Goto (Table.States (522), 206, 60); Add_Goto (Table.States (522), 207, 61); Add_Goto (Table.States (522), 209, 62); Add_Goto (Table.States (522), 210, 63); Add_Goto (Table.States (522), 213, 64); Add_Goto (Table.States (522), 214, 65); Add_Goto (Table.States (522), 215, 66); Add_Goto (Table.States (522), 216, 67); Add_Goto (Table.States (522), 219, 69); Add_Goto (Table.States (522), 223, 71); Add_Goto (Table.States (522), 243, 74); Add_Goto (Table.States (522), 244, 75); Add_Goto (Table.States (522), 245, 76); Add_Goto (Table.States (522), 246, 77); Add_Goto (Table.States (522), 247, 78); Add_Goto (Table.States (522), 248, 79); Add_Goto (Table.States (522), 249, 80); Add_Goto (Table.States (522), 250, 81); Add_Goto (Table.States (522), 251, 82); Add_Goto (Table.States (522), 257, 394); Add_Goto (Table.States (522), 259, 84); Add_Goto (Table.States (522), 260, 85); Add_Goto (Table.States (522), 262, 87); Add_Goto (Table.States (522), 263, 88); Add_Goto (Table.States (522), 264, 89); Add_Goto (Table.States (522), 265, 90); Add_Goto (Table.States (522), 266, 668); Add_Goto (Table.States (522), 271, 91); Add_Goto (Table.States (522), 281, 94); Add_Goto (Table.States (522), 289, 95); Add_Goto (Table.States (522), 304, 102); Add_Goto (Table.States (522), 305, 103); Add_Goto (Table.States (522), 307, 105); Add_Goto (Table.States (522), 308, 106); Add_Goto (Table.States (522), 309, 107); Add_Goto (Table.States (522), 311, 108); Add_Goto (Table.States (522), 313, 109); Add_Goto (Table.States (522), 316, 111); Add_Goto (Table.States (522), 317, 112); Add_Goto (Table.States (522), 319, 113); Add_Goto (Table.States (522), 325, 115); Add_Goto (Table.States (522), 331, 116); Table.States (522).Kernel := To_Vector (((304, 35, 5, False), (304, 35, 2, False))); Table.States (522).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (523), 96, 669); Add_Error (Table.States (523)); Table.States (523).Kernel := To_Vector ((0 => (276, 192, 1, False))); Table.States (523).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 669))); Add_Action (Table.States (524), 96, 670); Add_Error (Table.States (524)); Table.States (524).Kernel := To_Vector ((0 => (290, 5, 1, False))); Table.States (524).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 670))); Add_Action (Table.States (525), 7, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 16, 568); Add_Action (Table.States (525), 21, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 40, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 82, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 96, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 104, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 105, Reduce, (154, 1), 0, null, null); Add_Action (Table.States (525), 106, Reduce, (154, 1), 0, null, null); Add_Error (Table.States (525)); Add_Goto (Table.States (525), 154, 671); Table.States (525).Kernel := To_Vector (((194, 118, 2, False), (194, 118, 1, False))); Table.States (525).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 154, 0))); Add_Action (Table.States (526), 24, 672); Add_Error (Table.States (526)); Table.States (526).Kernel := To_Vector ((0 => (196, 218, 3, False))); Table.States (526).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 672))); Add_Action (Table.States (527), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (527), 40, 12); Add_Action (Table.States (527), 46, 14); Add_Action (Table.States (527), 47, 673); Add_Action (Table.States (527), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (527), 51, 674); Add_Action (Table.States (527), 66, 675); Add_Error (Table.States (527)); Add_Goto (Table.States (527), 207, 61); Add_Goto (Table.States (527), 246, 676); Add_Goto (Table.States (527), 247, 78); Add_Goto (Table.States (527), 262, 87); Add_Goto (Table.States (527), 263, 677); Add_Goto (Table.States (527), 264, 89); Add_Goto (Table.States (527), 307, 105); Add_Goto (Table.States (527), 316, 111); Table.States (527).Kernel := To_Vector ((0 => (315, 77, 6, False))); Table.States (527).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 246, 0))); Add_Action (Table.States (528), 4, 1); Add_Action (Table.States (528), 18, 4); Add_Action (Table.States (528), 67, 678); Add_Error (Table.States (528)); Add_Goto (Table.States (528), 113, 679); Add_Goto (Table.States (528), 160, 680); Add_Goto (Table.States (528), 161, 533); Table.States (528).Kernel := To_Vector (((295, 87, 3, False), (295, 87, 2, False), (295, 87, 2, False))); Table.States (528).Minimal_Complete_Actions := To_Vector (((Shift, 67, 678), (Shift, 18, 4))); Add_Action (Table.States (529), (13, 17, 28, 37, 73), (131, 0), 2, block_label_0'Access, block_label_0_check'Access); Table.States (529).Kernel := To_Vector ((0 => (131, 81, 0, False))); Table.States (529).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 131, 2))); Add_Action (Table.States (530), (4, 5, 13, 15, 17, 18, 22, 23, 24, 26, 27, 28, 31, 32, 37, 41, 43, 48, 52, 57, 58, 61, 68, 72, 73, 93, 104, 105, 106), (299, 0), 2, null, null); Table.States (530).Kernel := To_Vector ((0 => (299, 306, 0, True))); Table.States (530).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 299, 2))); Table.States (530).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (531), 24, 681); Add_Error (Table.States (531)); Table.States (531).Kernel := To_Vector ((0 => (152, 300, 3, False))); Table.States (531).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 681))); Add_Action (Table.States (532), 24, 682); Add_Error (Table.States (532)); Table.States (532).Kernel := To_Vector ((0 => (323, 160, 3, False))); Table.States (532).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 682))); Add_Action (Table.States (533), 4, 1); Add_Action (Table.States (533), 5, 2); Add_Action (Table.States (533), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (533), 15, 3); Add_Action (Table.States (533), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (533), 18, 4); Add_Action (Table.States (533), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (533), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (533), 27, 5); Add_Action (Table.States (533), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (533), 31, 9); Add_Action (Table.States (533), 32, 10); Add_Action (Table.States (533), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (533), 41, 13); Add_Action (Table.States (533), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (533), 48, 16); Add_Action (Table.States (533), 52, 20); Add_Action (Table.States (533), 57, 21); Add_Action (Table.States (533), 58, 22); Add_Action (Table.States (533), 61, 24); Add_Action (Table.States (533), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (533), 93, 31); Add_Action (Table.States (533), 104, 360); Add_Action (Table.States (533), 105, 33); Add_Action (Table.States (533), 106, 34); Add_Error (Table.States (533)); Add_Goto (Table.States (533), 113, 36); Add_Goto (Table.States (533), 123, 38); Add_Goto (Table.States (533), 126, 39); Add_Goto (Table.States (533), 128, 41); Add_Goto (Table.States (533), 131, 42); Add_Goto (Table.States (533), 132, 43); Add_Goto (Table.States (533), 133, 44); Add_Goto (Table.States (533), 139, 47); Add_Goto (Table.States (533), 151, 50); Add_Goto (Table.States (533), 152, 51); Add_Goto (Table.States (533), 161, 53); Add_Goto (Table.States (533), 190, 57); Add_Goto (Table.States (533), 196, 59); Add_Goto (Table.States (533), 217, 68); Add_Goto (Table.States (533), 222, 70); Add_Goto (Table.States (533), 232, 72); Add_Goto (Table.States (533), 239, 73); Add_Goto (Table.States (533), 257, 83); Add_Goto (Table.States (533), 261, 86); Add_Goto (Table.States (533), 272, 92); Add_Goto (Table.States (533), 276, 93); Add_Goto (Table.States (533), 290, 96); Add_Goto (Table.States (533), 293, 97); Add_Goto (Table.States (533), 294, 98); Add_Goto (Table.States (533), 298, 99); Add_Goto (Table.States (533), 299, 361); Add_Goto (Table.States (533), 300, 683); Add_Goto (Table.States (533), 302, 100); Add_Goto (Table.States (533), 303, 101); Add_Goto (Table.States (533), 306, 363); Add_Goto (Table.States (533), 323, 114); Table.States (533).Kernel := To_Vector ((0 => (160, 161, 0, False))); Table.States (533).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (534), (22, 24, 43), (296, 0), 3, select_alternative_list_0'Access, null); Table.States (534).Kernel := To_Vector ((0 => (296, 295, 0, True))); Table.States (534).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 296, 3))); Table.States (534).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (535), 24, 684); Add_Error (Table.States (535)); Table.States (535).Kernel := To_Vector ((0 => (294, 300, 3, False))); Table.States (535).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 684))); Add_Action (Table.States (536), 96, 685); Add_Error (Table.States (536)); Table.States (536).Kernel := To_Vector ((0 => (294, 61, 1, False))); Table.States (536).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 685))); Add_Action (Table.States (537), 4, 1); Add_Action (Table.States (537), 5, 2); Add_Action (Table.States (537), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (537), 15, 3); Add_Action (Table.States (537), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (537), 18, 4); Add_Action (Table.States (537), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (537), 27, 5); Add_Action (Table.States (537), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (537), 31, 9); Add_Action (Table.States (537), 32, 10); Add_Action (Table.States (537), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (537), 41, 13); Add_Action (Table.States (537), 48, 16); Add_Action (Table.States (537), 52, 20); Add_Action (Table.States (537), 57, 21); Add_Action (Table.States (537), 58, 22); Add_Action (Table.States (537), 61, 24); Add_Action (Table.States (537), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (537), 93, 31); Add_Action (Table.States (537), 104, 360); Add_Action (Table.States (537), 105, 33); Add_Action (Table.States (537), 106, 34); Add_Error (Table.States (537)); Add_Goto (Table.States (537), 113, 36); Add_Goto (Table.States (537), 123, 38); Add_Goto (Table.States (537), 126, 39); Add_Goto (Table.States (537), 128, 41); Add_Goto (Table.States (537), 131, 42); Add_Goto (Table.States (537), 132, 43); Add_Goto (Table.States (537), 133, 44); Add_Goto (Table.States (537), 139, 47); Add_Goto (Table.States (537), 151, 50); Add_Goto (Table.States (537), 152, 51); Add_Goto (Table.States (537), 161, 53); Add_Goto (Table.States (537), 190, 57); Add_Goto (Table.States (537), 196, 59); Add_Goto (Table.States (537), 217, 68); Add_Goto (Table.States (537), 222, 70); Add_Goto (Table.States (537), 232, 72); Add_Goto (Table.States (537), 239, 73); Add_Goto (Table.States (537), 257, 83); Add_Goto (Table.States (537), 261, 86); Add_Goto (Table.States (537), 272, 92); Add_Goto (Table.States (537), 276, 93); Add_Goto (Table.States (537), 290, 96); Add_Goto (Table.States (537), 293, 97); Add_Goto (Table.States (537), 294, 98); Add_Goto (Table.States (537), 298, 99); Add_Goto (Table.States (537), 299, 361); Add_Goto (Table.States (537), 300, 686); Add_Goto (Table.States (537), 302, 100); Add_Goto (Table.States (537), 303, 101); Add_Goto (Table.States (537), 306, 363); Add_Goto (Table.States (537), 323, 114); Table.States (537).Kernel := To_Vector ((0 => (126, 5, 3, False))); Table.States (537).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (538), 74, 337); Add_Action (Table.States (538), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (538)); Add_Goto (Table.States (538), 122, 687); Table.States (538).Kernel := To_Vector ((0 => (313, 314, 1, False))); Table.States (538).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (539), 60, 688); Add_Error (Table.States (539)); Table.States (539).Kernel := To_Vector ((0 => (317, 35, 2, False))); Table.States (539).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 60, 688))); Add_Action (Table.States (540), 35, 689); Add_Error (Table.States (540)); Table.States (540).Kernel := To_Vector ((0 => (316, 122, 4, False))); Table.States (540).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 689))); Add_Action (Table.States (541), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (541), 74, 337); Add_Action (Table.States (541), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (541)); Add_Goto (Table.States (541), 122, 690); Table.States (541).Kernel := To_Vector (((319, 169, 6, False), (319, 169, 3, False), (319, 169, 1, False))); Table.States (541).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (542), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (542), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (542), 28, 183); Add_Action (Table.States (542), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (542), 30, 8); Add_Action (Table.States (542), 39, 691); Add_Action (Table.States (542), 40, 12); Add_Action (Table.States (542), 46, 14); Add_Action (Table.States (542), 47, 15); Add_Action (Table.States (542), 48, 16); Add_Action (Table.States (542), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (542), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (542), 51, 19); Add_Action (Table.States (542), 63, 25); Add_Action (Table.States (542), 66, 26); Add_Action (Table.States (542), 69, 27); Add_Action (Table.States (542), 71, 28); Add_Action (Table.States (542), 104, 185); Add_Error (Table.States (542)); Add_Goto (Table.States (542), 112, 35); Add_Goto (Table.States (542), 121, 37); Add_Goto (Table.States (542), 127, 40); Add_Goto (Table.States (542), 134, 45); Add_Goto (Table.States (542), 135, 46); Add_Goto (Table.States (542), 157, 391); Add_Goto (Table.States (542), 158, 392); Add_Goto (Table.States (542), 159, 692); Add_Goto (Table.States (542), 179, 54); Add_Goto (Table.States (542), 182, 55); Add_Goto (Table.States (542), 186, 56); Add_Goto (Table.States (542), 193, 58); Add_Goto (Table.States (542), 206, 60); Add_Goto (Table.States (542), 207, 61); Add_Goto (Table.States (542), 209, 62); Add_Goto (Table.States (542), 210, 63); Add_Goto (Table.States (542), 213, 64); Add_Goto (Table.States (542), 214, 65); Add_Goto (Table.States (542), 215, 66); Add_Goto (Table.States (542), 216, 67); Add_Goto (Table.States (542), 219, 69); Add_Goto (Table.States (542), 223, 71); Add_Goto (Table.States (542), 243, 74); Add_Goto (Table.States (542), 244, 75); Add_Goto (Table.States (542), 245, 76); Add_Goto (Table.States (542), 246, 77); Add_Goto (Table.States (542), 247, 78); Add_Goto (Table.States (542), 248, 79); Add_Goto (Table.States (542), 249, 80); Add_Goto (Table.States (542), 250, 81); Add_Goto (Table.States (542), 251, 82); Add_Goto (Table.States (542), 257, 394); Add_Goto (Table.States (542), 259, 84); Add_Goto (Table.States (542), 260, 85); Add_Goto (Table.States (542), 262, 87); Add_Goto (Table.States (542), 263, 88); Add_Goto (Table.States (542), 264, 89); Add_Goto (Table.States (542), 265, 90); Add_Goto (Table.States (542), 271, 91); Add_Goto (Table.States (542), 281, 94); Add_Goto (Table.States (542), 289, 95); Add_Goto (Table.States (542), 304, 102); Add_Goto (Table.States (542), 305, 103); Add_Goto (Table.States (542), 307, 105); Add_Goto (Table.States (542), 308, 106); Add_Goto (Table.States (542), 309, 107); Add_Goto (Table.States (542), 311, 108); Add_Goto (Table.States (542), 313, 109); Add_Goto (Table.States (542), 316, 111); Add_Goto (Table.States (542), 317, 112); Add_Goto (Table.States (542), 318, 693); Add_Goto (Table.States (542), 319, 113); Add_Goto (Table.States (542), 325, 115); Add_Goto (Table.States (542), 331, 116); Table.States (542).Kernel := To_Vector (((305, 35, 5, False), (305, 35, 2, False))); Table.States (542).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 0))); Add_Action (Table.States (543), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (305, 2), 4, single_task_declaration_2'Access, null); Table.States (543).Kernel := To_Vector ((0 => (305, 96, 0, False))); Table.States (543).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 305, 4))); Add_Action (Table.States (544), 77, 694); Add_Error (Table.States (544)); Table.States (544).Kernel := To_Vector ((0 => (169, 80, 1, False))); Table.States (544).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 694))); Add_Action (Table.States (545), (77, 96), (171, 1), 1, null, null); Table.States (545).Kernel := To_Vector ((0 => (171, 170, 0, False))); Table.States (545).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 171, 1))); Add_Action (Table.States (546), 77, 695); Add_Action (Table.States (546), 96, 696); Add_Error (Table.States (546)); Table.States (546).Kernel := To_Vector (((169, 171, 1, False), (171, 171, 1, True))); Table.States (546).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 695))); Add_Action (Table.States (547), 81, 697); Add_Action (Table.States (547), 83, 234); Add_Error (Table.States (547)); Table.States (547).Kernel := To_Vector (((170, 219, 3, False), (170, 219, 4, False), (170, 219, 2, False), (170, 219, 3, False), (219, 219, 2, True))); Table.States (547).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 81, 697))); Add_Action (Table.States (548), 6, 698); Add_Action (Table.States (548), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (548), 11, 699); Add_Action (Table.States (548), 19, 700); Add_Action (Table.States (548), 20, 701); Add_Action (Table.States (548), 34, 702); Add_Action (Table.States (548), 36, 703); Add_Action (Table.States (548), 38, 704); Add_Action (Table.States (548), 39, Reduce, (109, 5), 0, null, null); Add_Conflict (Table.States (548), 39, (110, 3), 0, null, null); Add_Action (Table.States (548), 40, 386); Add_Action (Table.States (548), 41, Reduce, (111, 5), 0, null, null); Add_Action (Table.States (548), 49, Reduce, (111, 5), 0, null, null); Add_Action (Table.States (548), 51, 706); Add_Action (Table.States (548), 53, 707); Add_Action (Table.States (548), 54, Reduce, (111, 5), 0, null, null); Add_Action (Table.States (548), 64, 709); Add_Action (Table.States (548), 65, 710); Add_Action (Table.States (548), 66, 711); Add_Action (Table.States (548), 76, 712); Add_Error (Table.States (548)); Add_Goto (Table.States (548), 109, 713); Add_Goto (Table.States (548), 110, 714); Add_Goto (Table.States (548), 111, 715); Add_Goto (Table.States (548), 114, 716); Add_Goto (Table.States (548), 120, 717); Add_Goto (Table.States (548), 162, 718); Add_Goto (Table.States (548), 183, 719); Add_Goto (Table.States (548), 228, 720); Add_Goto (Table.States (548), 241, 721); Add_Goto (Table.States (548), 326, 722); Table.States (548).Kernel := To_Vector (((206, 35, 2, False), (223, 35, 2, False), (259, 35, 5, False), (260, 35, 2, False))); Table.States (548).Minimal_Complete_Actions := To_Vector (((Shift, 38, 704), (Shift, 65, 710), (Reduce, 111, 0))); Add_Action (Table.States (549), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (223, 1), 4, incomplete_type_declaration_1'Access, null); Table.States (549).Kernel := To_Vector ((0 => (223, 96, 0, False))); Table.States (549).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 223, 4))); Add_Action (Table.States (550), 83, 381); Add_Action (Table.States (550), 96, 723); Add_Error (Table.States (550)); Table.States (550).Kernel := To_Vector (((238, 238, 2, True), (331, 238, 1, False))); Table.States (550).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 723))); Add_Action (Table.States (551), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (331, 1), 4, use_clause_1'Access, null); Table.States (551).Kernel := To_Vector ((0 => (331, 96, 0, False))); Table.States (551).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 331, 4))); end Subr_10; procedure Subr_11 is begin Add_Action (Table.States (552), 76, 235); Add_Action (Table.States (552), 83, Reduce, (238, 0), 3, null, null); Add_Action (Table.States (552), 84, 237); Add_Action (Table.States (552), 96, Reduce, (238, 0), 3, null, null); Add_Action (Table.States (552), 101, 239); Add_Action (Table.States (552), 102, 240); Add_Error (Table.States (552)); Add_Goto (Table.States (552), 115, 241); Add_Goto (Table.States (552), 322, 242); Table.States (552).Kernel := To_Vector (((128, 239, 2, True), (238, 239, 0, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (552).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 238, 3))); Table.States (552).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (553), 104, 119); Add_Action (Table.States (553), 105, 33); Add_Action (Table.States (553), 106, 34); Add_Error (Table.States (553)); Add_Goto (Table.States (553), 128, 41); Add_Goto (Table.States (553), 239, 724); Add_Goto (Table.States (553), 272, 92); Add_Goto (Table.States (553), 293, 97); Table.States (553).Kernel := To_Vector ((0 => (245, 56, 2, False))); Table.States (553).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (554), (7, 21, 35, 56, 74, 77, 82, 96, 104, 105, 106), (241, 0), 2, null, null); Table.States (554).Kernel := To_Vector ((0 => (241, 41, 0, False))); Table.States (554).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 2))); Add_Action (Table.States (555), 104, 119); Add_Action (Table.States (555), 105, 33); Add_Action (Table.States (555), 106, 34); Add_Error (Table.States (555)); Add_Goto (Table.States (555), 128, 41); Add_Goto (Table.States (555), 239, 725); Add_Goto (Table.States (555), 272, 92); Add_Goto (Table.States (555), 293, 97); Table.States (555).Kernel := To_Vector ((0 => (245, 56, 2, False))); Table.States (555).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (556), 9, 726); Add_Action (Table.States (556), 16, 727); Add_Action (Table.States (556), 29, Reduce, (270, 1), 0, null, null); Add_Action (Table.States (556), 50, Reduce, (270, 1), 0, null, null); Add_Action (Table.States (556), 51, 728); Add_Action (Table.States (556), 104, Reduce, (208, 2), 0, null, null); Add_Action (Table.States (556), 105, Reduce, (208, 2), 0, null, null); Add_Action (Table.States (556), 106, Reduce, (208, 2), 0, null, null); Add_Error (Table.States (556)); Add_Goto (Table.States (556), 208, 729); Add_Goto (Table.States (556), 270, 730); Table.States (556).Kernel := To_Vector (((114, 7, 1, False), (114, 7, 2, True), (114, 7, 1, False))); Table.States (556).Minimal_Complete_Actions := To_Vector (((Reduce, 270, 0), (Reduce, 208, 0))); Table.States (556).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (557), 56, 731); Add_Action (Table.States (557), 76, 235); Add_Action (Table.States (557), 84, 237); Add_Action (Table.States (557), 101, 239); Add_Action (Table.States (557), 102, 240); Add_Error (Table.States (557)); Add_Goto (Table.States (557), 115, 241); Add_Goto (Table.States (557), 322, 242); Table.States (557).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (245, 239, 3, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (557).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 56, 731))); Add_Action (Table.States (558), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (558), 104, 149); Add_Error (Table.States (558)); Add_Goto (Table.States (558), 220, 732); Table.States (558).Kernel := To_Vector ((0 => (133, 24, 1, False))); Table.States (558).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (559), 24, Reduce, (189, 1), 0, null, null); Add_Action (Table.States (559), 48, 16); Add_Action (Table.States (559), 72, 733); Add_Error (Table.States (559)); Add_Goto (Table.States (559), 187, 734); Add_Goto (Table.States (559), 188, 735); Add_Goto (Table.States (559), 189, 736); Add_Goto (Table.States (559), 257, 737); Table.States (559).Kernel := To_Vector ((0 => (218, 26, 0, False))); Table.States (559).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 189, 0))); Add_Action (Table.States (560), (13, 24, 25, 28, 29, 30, 40, 46, 47, 48, 49, 50, 51, 63, 66, 69, 71, 104), (158, 0), 2, null, null); Table.States (560).Kernel := To_Vector ((0 => (158, 157, 0, True))); Table.States (560).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 158, 2))); Table.States (560).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (561), (13, 24, 25, 28, 29, 30, 40, 46, 47, 48, 49, 50, 51, 63, 66, 69, 71, 104), (158, 1), 2, null, null); Table.States (561).Kernel := To_Vector ((0 => (158, 257, 0, True))); Table.States (561).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 158, 2))); Table.States (561).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (562), 4, 1); Add_Action (Table.States (562), 5, 2); Add_Action (Table.States (562), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (562), 15, 3); Add_Action (Table.States (562), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (562), 18, 4); Add_Action (Table.States (562), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (562), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (562), 27, 5); Add_Action (Table.States (562), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (562), 31, 9); Add_Action (Table.States (562), 32, 10); Add_Action (Table.States (562), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (562), 41, 13); Add_Action (Table.States (562), 48, 16); Add_Action (Table.States (562), 52, 20); Add_Action (Table.States (562), 57, 21); Add_Action (Table.States (562), 58, 22); Add_Action (Table.States (562), 61, 24); Add_Action (Table.States (562), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (562), 93, 31); Add_Action (Table.States (562), 104, 360); Add_Action (Table.States (562), 105, 33); Add_Action (Table.States (562), 106, 34); Add_Error (Table.States (562)); Add_Goto (Table.States (562), 113, 36); Add_Goto (Table.States (562), 123, 38); Add_Goto (Table.States (562), 126, 39); Add_Goto (Table.States (562), 128, 41); Add_Goto (Table.States (562), 131, 42); Add_Goto (Table.States (562), 132, 43); Add_Goto (Table.States (562), 133, 44); Add_Goto (Table.States (562), 139, 47); Add_Goto (Table.States (562), 151, 50); Add_Goto (Table.States (562), 152, 51); Add_Goto (Table.States (562), 161, 53); Add_Goto (Table.States (562), 190, 57); Add_Goto (Table.States (562), 196, 59); Add_Goto (Table.States (562), 217, 68); Add_Goto (Table.States (562), 218, 738); Add_Goto (Table.States (562), 222, 70); Add_Goto (Table.States (562), 232, 72); Add_Goto (Table.States (562), 239, 73); Add_Goto (Table.States (562), 257, 83); Add_Goto (Table.States (562), 261, 86); Add_Goto (Table.States (562), 272, 92); Add_Goto (Table.States (562), 276, 93); Add_Goto (Table.States (562), 290, 96); Add_Goto (Table.States (562), 293, 97); Add_Goto (Table.States (562), 294, 98); Add_Goto (Table.States (562), 298, 99); Add_Goto (Table.States (562), 299, 361); Add_Goto (Table.States (562), 300, 390); Add_Goto (Table.States (562), 302, 100); Add_Goto (Table.States (562), 303, 101); Add_Goto (Table.States (562), 306, 363); Add_Goto (Table.States (562), 323, 114); Table.States (562).Kernel := To_Vector ((0 => (133, 13, 2, False))); Table.States (562).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (563), 37, 739); Add_Error (Table.States (563)); Table.States (563).Kernel := To_Vector ((0 => (232, 24, 2, False))); Table.States (563).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 37, 739))); Add_Action (Table.States (564), 24, 740); Add_Error (Table.States (564)); Table.States (564).Kernel := To_Vector ((0 => (232, 300, 3, False))); Table.States (564).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 740))); Add_Action (Table.States (565), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (216, 0), 4, generic_subprogram_declaration_0'Access, null); Table.States (565).Kernel := To_Vector ((0 => (216, 96, 0, False))); Table.States (565).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 216, 4))); Add_Action (Table.States (566), 3, 121); Add_Action (Table.States (566), 39, 122); Add_Action (Table.States (566), 40, 123); Add_Action (Table.States (566), 41, 124); Add_Action (Table.States (566), 52, 125); Add_Action (Table.States (566), 76, 126); Add_Action (Table.States (566), 94, 127); Add_Action (Table.States (566), 95, 128); Add_Action (Table.States (566), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (566), 103, 129); Add_Action (Table.States (566), 104, 119); Add_Action (Table.States (566), 105, 33); Add_Action (Table.States (566), 106, 34); Add_Error (Table.States (566)); Add_Goto (Table.States (566), 117, 130); Add_Goto (Table.States (566), 128, 41); Add_Goto (Table.States (566), 191, 131); Add_Goto (Table.States (566), 192, 741); Add_Goto (Table.States (566), 197, 133); Add_Goto (Table.States (566), 239, 134); Add_Goto (Table.States (566), 258, 135); Add_Goto (Table.States (566), 272, 92); Add_Goto (Table.States (566), 275, 136); Add_Goto (Table.States (566), 282, 137); Add_Goto (Table.States (566), 283, 138); Add_Goto (Table.States (566), 284, 139); Add_Goto (Table.States (566), 285, 140); Add_Goto (Table.States (566), 286, 141); Add_Goto (Table.States (566), 287, 142); Add_Goto (Table.States (566), 293, 97); Add_Goto (Table.States (566), 301, 143); Add_Goto (Table.States (566), 320, 144); Add_Goto (Table.States (566), 321, 145); Add_Goto (Table.States (566), 330, 146); Table.States (566).Kernel := To_Vector ((0 => (157, 82, 1, False))); Table.States (566).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (567), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (186, 0), 4, exception_declaration_0'Access, null); Table.States (567).Kernel := To_Vector ((0 => (186, 96, 0, False))); Table.States (567).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 186, 4))); Add_Action (Table.States (568), (7, 11, 21, 40, 74, 82, 96, 104, 105, 106), (154, 0), 1, null, null); Table.States (568).Kernel := To_Vector ((0 => (154, 16, 0, False))); Table.States (568).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 154, 1))); Add_Action (Table.States (569), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (569), 11, 699); Add_Action (Table.States (569), 40, 742); Add_Action (Table.States (569), 104, 119); Add_Action (Table.States (569), 105, 33); Add_Action (Table.States (569), 106, 34); Add_Error (Table.States (569)); Add_Goto (Table.States (569), 114, 743); Add_Goto (Table.States (569), 120, 744); Add_Goto (Table.States (569), 128, 41); Add_Goto (Table.States (569), 239, 484); Add_Goto (Table.States (569), 241, 721); Add_Goto (Table.States (569), 272, 92); Add_Goto (Table.States (569), 293, 97); Add_Goto (Table.States (569), 314, 745); Table.States (569).Kernel := To_Vector (((244, 154, 3, False), (244, 154, 4, False), (244, 154, 10, False), (244, 154, 2, False), (244, 154, 3, False), (244, 154, 9, False))); Table.States (569).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (570), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (115, 0), 3, actual_parameter_part_0'Access, null); Table.States (570).Kernel := To_Vector ((0 => (115, 77, 0, False))); Table.States (570).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 115, 3))); Add_Action (Table.States (571), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (115, 1), 3, actual_parameter_part_1'Access, null); Table.States (571).Kernel := To_Vector ((0 => (115, 77, 0, False))); Table.States (571).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 115, 3))); Add_Action (Table.States (572), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (239, 0), 4, name_0'Access, null); Table.States (572).Kernel := To_Vector ((0 => (239, 77, 0, True))); Table.States (572).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 4))); Table.States (572).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (573), 3, 121); Add_Action (Table.States (573), 39, 122); Add_Action (Table.States (573), 40, 123); Add_Action (Table.States (573), 41, 124); Add_Action (Table.States (573), 76, 126); Add_Action (Table.States (573), 94, 127); Add_Action (Table.States (573), 95, 128); Add_Action (Table.States (573), 103, 129); Add_Action (Table.States (573), 104, 119); Add_Action (Table.States (573), 105, 33); Add_Action (Table.States (573), 106, 34); Add_Error (Table.States (573)); Add_Goto (Table.States (573), 117, 130); Add_Goto (Table.States (573), 128, 41); Add_Goto (Table.States (573), 197, 133); Add_Goto (Table.States (573), 239, 274); Add_Goto (Table.States (573), 258, 135); Add_Goto (Table.States (573), 272, 92); Add_Goto (Table.States (573), 277, 746); Add_Goto (Table.States (573), 293, 97); Add_Goto (Table.States (573), 301, 479); Add_Goto (Table.States (573), 320, 144); Add_Goto (Table.States (573), 321, 145); Add_Goto (Table.States (573), 330, 146); Table.States (573).Kernel := To_Vector ((0 => (278, 83, 3, True))); Table.States (573).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (573).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (574), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (123, 0), 4, assignment_statement_0'Access, null); Table.States (574).Kernel := To_Vector ((0 => (123, 96, 0, False))); Table.States (574).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 123, 4))); Add_Action (Table.States (575), 3, 121); Add_Action (Table.States (575), 39, 122); Add_Action (Table.States (575), 40, 474); Add_Action (Table.States (575), 41, 124); Add_Action (Table.States (575), 76, 126); Add_Action (Table.States (575), 77, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (575), 94, 127); Add_Action (Table.States (575), 95, 128); Add_Action (Table.States (575), 96, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (575), 103, 129); Add_Action (Table.States (575), 104, 492); Add_Action (Table.States (575), 105, 33); Add_Action (Table.States (575), 106, 34); Add_Error (Table.States (575)); Add_Goto (Table.States (575), 117, 130); Add_Goto (Table.States (575), 128, 41); Add_Goto (Table.States (575), 167, 747); Add_Goto (Table.States (575), 197, 133); Add_Goto (Table.States (575), 219, 493); Add_Goto (Table.States (575), 239, 477); Add_Goto (Table.States (575), 254, 494); Add_Goto (Table.States (575), 255, 495); Add_Goto (Table.States (575), 258, 135); Add_Goto (Table.States (575), 272, 92); Add_Goto (Table.States (575), 277, 478); Add_Goto (Table.States (575), 293, 97); Add_Goto (Table.States (575), 301, 479); Add_Goto (Table.States (575), 314, 480); Add_Goto (Table.States (575), 320, 144); Add_Goto (Table.States (575), 321, 145); Add_Goto (Table.States (575), 330, 146); Table.States (575).Kernel := To_Vector (((179, 76, 3, False), (199, 76, 1, False))); Table.States (575).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 255, 0))); Add_Action (Table.States (576), 74, 337); Add_Action (Table.States (576), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (576)); Add_Goto (Table.States (576), 122, 748); Table.States (576).Kernel := To_Vector ((0 => (179, 253, 1, False))); Table.States (576).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (577), 39, 749); Add_Error (Table.States (577)); Table.States (577).Kernel := To_Vector ((0 => (213, 35, 3, False))); Table.States (577).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 749))); Add_Action (Table.States (578), 39, 750); Add_Error (Table.States (578)); Table.States (578).Kernel := To_Vector ((0 => (213, 35, 3, False))); Table.States (578).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 750))); Add_Action (Table.States (579), 3, 121); Add_Action (Table.States (579), 15, 258); Add_Action (Table.States (579), 28, 259); Add_Action (Table.States (579), 32, 260); Add_Action (Table.States (579), 39, 122); Add_Action (Table.States (579), 40, 261); Add_Action (Table.States (579), 41, 124); Add_Action (Table.States (579), 44, 263); Add_Action (Table.States (579), 52, 125); Add_Action (Table.States (579), 76, 126); Add_Action (Table.States (579), 77, Reduce, (124, 5), 0, null, null); Add_Conflict (Table.States (579), 77, (192, 1), 0, null, null); Add_Action (Table.States (579), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (579), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (579), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (579), 94, 127); Add_Action (Table.States (579), 95, 128); Add_Action (Table.States (579), 103, 129); Add_Action (Table.States (579), 104, 119); Add_Action (Table.States (579), 105, 33); Add_Action (Table.States (579), 106, 264); Add_Error (Table.States (579)); Add_Goto (Table.States (579), 117, 130); Add_Goto (Table.States (579), 124, 265); Add_Goto (Table.States (579), 125, 751); Add_Goto (Table.States (579), 128, 41); Add_Goto (Table.States (579), 136, 267); Add_Goto (Table.States (579), 153, 752); Add_Goto (Table.States (579), 165, 269); Add_Goto (Table.States (579), 166, 270); Add_Goto (Table.States (579), 191, 271); Add_Goto (Table.States (579), 192, 753); Add_Goto (Table.States (579), 197, 133); Add_Goto (Table.States (579), 221, 273); Add_Goto (Table.States (579), 239, 274); Add_Goto (Table.States (579), 258, 135); Add_Goto (Table.States (579), 272, 92); Add_Goto (Table.States (579), 273, 275); Add_Goto (Table.States (579), 275, 136); Add_Goto (Table.States (579), 277, 276); Add_Goto (Table.States (579), 282, 137); Add_Goto (Table.States (579), 283, 138); Add_Goto (Table.States (579), 284, 139); Add_Goto (Table.States (579), 285, 140); Add_Goto (Table.States (579), 286, 141); Add_Goto (Table.States (579), 287, 142); Add_Goto (Table.States (579), 293, 97); Add_Goto (Table.States (579), 301, 277); Add_Goto (Table.States (579), 320, 144); Add_Goto (Table.States (579), 321, 145); Add_Goto (Table.States (579), 330, 146); Table.States (579).Kernel := To_Vector (((256, 76, 1, False), (256, 76, 1, False), (256, 76, 3, False))); Table.States (579).Minimal_Complete_Actions := To_Vector (((Reduce, 192, 0), (Reduce, 125, 0))); Add_Action (Table.States (580), 74, 337); Add_Action (Table.States (580), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (580)); Add_Goto (Table.States (580), 122, 754); Table.States (580).Kernel := To_Vector ((0 => (193, 256, 1, False))); Table.States (580).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (581), 74, 337); Add_Action (Table.States (581), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (581)); Add_Goto (Table.States (581), 122, 755); Table.States (581).Kernel := To_Vector ((0 => (243, 41, 1, False))); Table.States (581).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (582), 74, 337); Add_Action (Table.States (582), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (582)); Add_Goto (Table.States (582), 122, 756); Table.States (582).Kernel := To_Vector ((0 => (112, 6, 1, False))); Table.States (582).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (583), 74, 337); Add_Action (Table.States (583), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (583)); Add_Goto (Table.States (583), 122, 757); Table.States (583).Kernel := To_Vector ((0 => (308, 60, 1, False))); Table.States (583).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (584), 74, 337); Add_Action (Table.States (584), 76, 235); Add_Action (Table.States (584), 84, 237); Add_Action (Table.States (584), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (584), 101, 239); Add_Action (Table.States (584), 102, 240); Add_Error (Table.States (584)); Add_Goto (Table.States (584), 115, 241); Add_Goto (Table.States (584), 122, 758); Add_Goto (Table.States (584), 322, 242); Table.States (584).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (311, 239, 1, False))); Table.States (584).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (585), 13, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (585), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (585), 28, 183); Add_Action (Table.States (585), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (585), 30, 8); Add_Action (Table.States (585), 40, 12); Add_Action (Table.States (585), 46, 14); Add_Action (Table.States (585), 47, 15); Add_Action (Table.States (585), 48, 16); Add_Action (Table.States (585), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (585), 51, 19); Add_Action (Table.States (585), 63, 25); Add_Action (Table.States (585), 66, 26); Add_Action (Table.States (585), 69, 27); Add_Action (Table.States (585), 71, 28); Add_Action (Table.States (585), 104, 185); Add_Error (Table.States (585)); Add_Goto (Table.States (585), 112, 35); Add_Goto (Table.States (585), 121, 37); Add_Goto (Table.States (585), 127, 40); Add_Goto (Table.States (585), 134, 45); Add_Goto (Table.States (585), 135, 46); Add_Goto (Table.States (585), 157, 391); Add_Goto (Table.States (585), 158, 392); Add_Goto (Table.States (585), 159, 759); Add_Goto (Table.States (585), 179, 54); Add_Goto (Table.States (585), 182, 55); Add_Goto (Table.States (585), 186, 56); Add_Goto (Table.States (585), 193, 58); Add_Goto (Table.States (585), 206, 60); Add_Goto (Table.States (585), 207, 61); Add_Goto (Table.States (585), 209, 62); Add_Goto (Table.States (585), 210, 63); Add_Goto (Table.States (585), 213, 64); Add_Goto (Table.States (585), 214, 65); Add_Goto (Table.States (585), 215, 66); Add_Goto (Table.States (585), 216, 67); Add_Goto (Table.States (585), 219, 69); Add_Goto (Table.States (585), 223, 71); Add_Goto (Table.States (585), 243, 74); Add_Goto (Table.States (585), 244, 75); Add_Goto (Table.States (585), 245, 76); Add_Goto (Table.States (585), 246, 77); Add_Goto (Table.States (585), 247, 78); Add_Goto (Table.States (585), 248, 79); Add_Goto (Table.States (585), 249, 80); Add_Goto (Table.States (585), 250, 81); Add_Goto (Table.States (585), 251, 82); Add_Goto (Table.States (585), 257, 394); Add_Goto (Table.States (585), 259, 84); Add_Goto (Table.States (585), 260, 85); Add_Goto (Table.States (585), 262, 87); Add_Goto (Table.States (585), 263, 88); Add_Goto (Table.States (585), 264, 89); Add_Goto (Table.States (585), 265, 90); Add_Goto (Table.States (585), 271, 91); Add_Goto (Table.States (585), 281, 94); Add_Goto (Table.States (585), 289, 95); Add_Goto (Table.States (585), 304, 102); Add_Goto (Table.States (585), 305, 103); Add_Goto (Table.States (585), 307, 105); Add_Goto (Table.States (585), 308, 106); Add_Goto (Table.States (585), 309, 107); Add_Goto (Table.States (585), 311, 108); Add_Goto (Table.States (585), 313, 109); Add_Goto (Table.States (585), 316, 111); Add_Goto (Table.States (585), 317, 112); Add_Goto (Table.States (585), 319, 113); Add_Goto (Table.States (585), 325, 115); Add_Goto (Table.States (585), 331, 116); Table.States (585).Kernel := To_Vector ((0 => (307, 35, 3, False))); Table.States (585).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (586), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (309, 0), 4, subprogram_declaration_0'Access, null); Table.States (586).Kernel := To_Vector ((0 => (309, 96, 0, False))); Table.States (586).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 309, 4))); Add_Action (Table.States (587), 4, 1); Add_Action (Table.States (587), 5, 2); Add_Action (Table.States (587), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (587), 15, 3); Add_Action (Table.States (587), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (587), 18, 4); Add_Action (Table.States (587), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (587), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (587), 27, 5); Add_Action (Table.States (587), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (587), 31, 9); Add_Action (Table.States (587), 32, 10); Add_Action (Table.States (587), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (587), 41, 13); Add_Action (Table.States (587), 48, 16); Add_Action (Table.States (587), 52, 20); Add_Action (Table.States (587), 57, 21); Add_Action (Table.States (587), 58, 22); Add_Action (Table.States (587), 61, 24); Add_Action (Table.States (587), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (587), 93, 31); Add_Action (Table.States (587), 104, 360); Add_Action (Table.States (587), 105, 33); Add_Action (Table.States (587), 106, 34); Add_Error (Table.States (587)); Add_Goto (Table.States (587), 113, 36); Add_Goto (Table.States (587), 123, 38); Add_Goto (Table.States (587), 126, 39); Add_Goto (Table.States (587), 128, 41); Add_Goto (Table.States (587), 131, 42); Add_Goto (Table.States (587), 132, 43); Add_Goto (Table.States (587), 133, 44); Add_Goto (Table.States (587), 139, 47); Add_Goto (Table.States (587), 151, 50); Add_Goto (Table.States (587), 152, 51); Add_Goto (Table.States (587), 161, 53); Add_Goto (Table.States (587), 190, 57); Add_Goto (Table.States (587), 196, 59); Add_Goto (Table.States (587), 217, 68); Add_Goto (Table.States (587), 218, 760); Add_Goto (Table.States (587), 222, 70); Add_Goto (Table.States (587), 232, 72); Add_Goto (Table.States (587), 239, 73); Add_Goto (Table.States (587), 257, 83); Add_Goto (Table.States (587), 261, 86); Add_Goto (Table.States (587), 272, 92); Add_Goto (Table.States (587), 276, 93); Add_Goto (Table.States (587), 290, 96); Add_Goto (Table.States (587), 293, 97); Add_Goto (Table.States (587), 294, 98); Add_Goto (Table.States (587), 298, 99); Add_Goto (Table.States (587), 299, 361); Add_Goto (Table.States (587), 300, 390); Add_Goto (Table.States (587), 302, 100); Add_Goto (Table.States (587), 303, 101); Add_Goto (Table.States (587), 306, 363); Add_Goto (Table.States (587), 323, 114); Table.States (587).Kernel := To_Vector ((0 => (113, 21, 2, False))); Table.States (587).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (588), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (113, 1), 5, accept_statement_1'Access, null); Table.States (588).Kernel := To_Vector ((0 => (113, 96, 0, False))); Table.States (588).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 113, 5))); Add_Action (Table.States (589), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (275, 0), 4, raise_expression_0'Access, null); Table.States (589).Kernel := To_Vector ((0 => (275, 192, 0, True))); Table.States (589).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 275, 4))); Table.States (589).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (590), 72, 761); Add_Error (Table.States (590)); Add_Goto (Table.States (590), 137, 762); Add_Goto (Table.States (590), 138, 763); Table.States (590).Kernel := To_Vector ((0 => (136, 35, 2, False))); Table.States (590).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 72, 761))); Add_Action (Table.States (591), 87, 764); Add_Error (Table.States (591)); Table.States (591).Kernel := To_Vector ((0 => (273, 230, 1, False))); Table.States (591).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 764))); Add_Action (Table.States (592), 3, 121); Add_Action (Table.States (592), 22, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (592), 23, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (592), 39, 122); Add_Action (Table.States (592), 40, 123); Add_Action (Table.States (592), 41, 124); Add_Action (Table.States (592), 52, 125); Add_Action (Table.States (592), 76, 126); Add_Action (Table.States (592), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (592), 94, 127); Add_Action (Table.States (592), 95, 128); Add_Action (Table.States (592), 103, 129); Add_Action (Table.States (592), 104, 119); Add_Action (Table.States (592), 105, 33); Add_Action (Table.States (592), 106, 34); Add_Error (Table.States (592)); Add_Goto (Table.States (592), 117, 130); Add_Goto (Table.States (592), 128, 41); Add_Goto (Table.States (592), 191, 131); Add_Goto (Table.States (592), 192, 765); Add_Goto (Table.States (592), 197, 133); Add_Goto (Table.States (592), 239, 134); Add_Goto (Table.States (592), 258, 135); Add_Goto (Table.States (592), 272, 92); Add_Goto (Table.States (592), 275, 136); Add_Goto (Table.States (592), 282, 137); Add_Goto (Table.States (592), 283, 138); Add_Goto (Table.States (592), 284, 139); Add_Goto (Table.States (592), 285, 140); Add_Goto (Table.States (592), 286, 141); Add_Goto (Table.States (592), 287, 142); Add_Goto (Table.States (592), 293, 97); Add_Goto (Table.States (592), 301, 143); Add_Goto (Table.States (592), 320, 144); Add_Goto (Table.States (592), 321, 145); Add_Goto (Table.States (592), 330, 146); Table.States (592).Kernel := To_Vector (((221, 68, 3, False), (221, 68, 1, False), (221, 68, 2, False), (221, 68, 0, False))); Table.States (592).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (593), 76, 235); Add_Action (Table.States (593), 79, Reduce, (165, 1), 3, null, null); Add_Action (Table.States (593), 84, 237); Add_Action (Table.States (593), 87, Reduce, (165, 1), 3, null, null); Add_Action (Table.States (593), 101, 239); Add_Action (Table.States (593), 102, 240); Add_Error (Table.States (593)); Add_Goto (Table.States (593), 115, 241); Add_Goto (Table.States (593), 322, 242); Table.States (593).Kernel := To_Vector (((128, 239, 2, True), (165, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (593).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 165, 3))); Add_Action (Table.States (594), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (117, 2), 4, null, null); Table.States (594).Kernel := To_Vector ((0 => (117, 77, 0, False))); Table.States (594).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 117, 4))); Add_Action (Table.States (595), (35, 77, 83, 96), (124, 1), 3, null, null); Table.States (595).Kernel := To_Vector ((0 => (124, 80, 0, False))); Table.States (595).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 124, 3))); Add_Action (Table.States (596), (35, 77, 83, 96), (124, 0), 3, association_opt_0'Access, null); Table.States (596).Kernel := To_Vector ((0 => (124, 192, 0, False))); Table.States (596).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 124, 3))); Add_Action (Table.States (597), (35, 77, 83, 96), (125, 0), 3, null, null); Table.States (597).Kernel := To_Vector ((0 => (125, 124, 0, True))); Table.States (597).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 3))); Table.States (597).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (598), (79, 87), (166, 0), 3, null, null); Table.States (598).Kernel := To_Vector ((0 => (166, 165, 0, True))); Table.States (598).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 166, 3))); Table.States (598).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (599), (79, 87), (165, 0), 1, null, null); Table.States (599).Kernel := To_Vector ((0 => (165, 191, 0, False))); Table.States (599).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 165, 1))); Add_Action (Table.States (600), (35, 77, 83, 96), (124, 3), 3, association_opt_3'Access, null); Table.States (600).Kernel := To_Vector ((0 => (124, 80, 0, False))); Table.States (600).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 124, 3))); Add_Action (Table.States (601), (35, 77, 83, 96), (124, 2), 3, association_opt_2'Access, null); Table.States (601).Kernel := To_Vector ((0 => (124, 192, 0, False))); Table.States (601).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 124, 3))); Add_Action (Table.States (602), 10, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 33, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 38, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 40, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 43, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 54, 766); Add_Action (Table.States (602), 55, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 75, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 77, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 78, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 79, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 83, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 85, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 86, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 87, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 88, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 89, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 91, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 92, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 94, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 95, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 97, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 98, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 99, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (602), 100, Reduce, (258, 1), 1, null, null); Add_Error (Table.States (602)); Table.States (602).Kernel := To_Vector (((117, 41, 2, False), (258, 41, 0, False))); Table.States (602).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (603), 77, 767); Add_Action (Table.States (603), 83, 443); Add_Error (Table.States (603)); Table.States (603).Kernel := To_Vector (((117, 125, 1, False), (125, 125, 1, True))); Table.States (603).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 767))); Add_Action (Table.States (604), 10, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 20, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 21, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 22, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 23, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 35, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 37, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 42, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 43, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 53, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 68, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 74, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 75, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 76, 768); Add_Action (Table.States (604), 77, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 79, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 82, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 83, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 87, Reduce, (277, 1), 3, null, null); Add_Action (Table.States (604), 96, Reduce, (277, 1), 3, null, null); Add_Error (Table.States (604)); Table.States (604).Kernel := To_Vector (((277, 53, 2, False), (277, 53, 0, False))); Table.States (604).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 277, 3))); end Subr_11; procedure Subr_12 is begin Add_Action (Table.States (605), (10, 20, 21, 22, 23, 35, 37, 42, 43, 53, 68, 74, 75, 77, 79, 82, 83, 87, 96), (277, 2), 3, null, null); Table.States (605).Kernel := To_Vector ((0 => (277, 301, 0, False))); Table.States (605).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 277, 3))); Add_Action (Table.States (606), 79, 445); Add_Action (Table.States (606), 87, 769); Add_Error (Table.States (606)); Table.States (606).Kernel := To_Vector (((140, 166, 1, False), (166, 166, 2, True))); Table.States (606).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 769))); Add_Action (Table.States (607), 15, 770); Add_Error (Table.States (607)); Table.States (607).Kernel := To_Vector ((0 => (139, 24, 2, False))); Table.States (607).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 15, 770))); Add_Action (Table.States (608), (24, 72), (141, 0), 2, null, null); Table.States (608).Kernel := To_Vector ((0 => (141, 140, 0, True))); Table.States (608).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 141, 2))); Table.States (608).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (609), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (283, 0), 4, null, null); Table.States (609).Kernel := To_Vector ((0 => (283, 287, 0, True))); Table.States (609).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 283, 4))); Table.States (609).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (610), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (285, 0), 4, null, null); Table.States (610).Kernel := To_Vector ((0 => (285, 287, 0, True))); Table.States (610).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 285, 4))); Table.States (610).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (611), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (283, 1), 4, null, null); Table.States (611).Kernel := To_Vector ((0 => (283, 287, 0, True))); Table.States (611).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 283, 4))); Table.States (611).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (612), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (285, 1), 4, null, null); Table.States (612).Kernel := To_Vector ((0 => (285, 287, 0, True))); Table.States (612).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 285, 4))); Table.States (612).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (613), 3, 121); Add_Action (Table.States (613), 39, 122); Add_Action (Table.States (613), 40, 123); Add_Action (Table.States (613), 41, 124); Add_Action (Table.States (613), 76, 126); Add_Action (Table.States (613), 94, 127); Add_Action (Table.States (613), 95, 128); Add_Action (Table.States (613), 103, 129); Add_Action (Table.States (613), 104, 119); Add_Action (Table.States (613), 105, 33); Add_Action (Table.States (613), 106, 34); Add_Error (Table.States (613)); Add_Goto (Table.States (613), 117, 130); Add_Goto (Table.States (613), 128, 41); Add_Goto (Table.States (613), 197, 133); Add_Goto (Table.States (613), 234, 771); Add_Goto (Table.States (613), 239, 274); Add_Goto (Table.States (613), 258, 135); Add_Goto (Table.States (613), 272, 92); Add_Goto (Table.States (613), 277, 466); Add_Goto (Table.States (613), 293, 97); Add_Goto (Table.States (613), 301, 467); Add_Goto (Table.States (613), 320, 144); Add_Goto (Table.States (613), 321, 145); Add_Goto (Table.States (613), 330, 146); Table.States (613).Kernel := To_Vector ((0 => (233, 79, 1, True))); Table.States (613).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Table.States (613).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (614), 10, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 20, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 21, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 22, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 23, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 35, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 37, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 43, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 53, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 68, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 74, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 75, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 77, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 79, 613); Add_Conflict (Table.States (614), 79, (287, 0), 4, null, null); Add_Action (Table.States (614), 83, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 87, Reduce, (287, 0), 4, null, null); Add_Action (Table.States (614), 96, Reduce, (287, 0), 4, null, null); Add_Error (Table.States (614)); Table.States (614).Kernel := To_Vector (((233, 233, 2, True), (287, 233, 0, False))); Table.States (614).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 287, 4))); Add_Action (Table.States (615), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (190, 0), 5, exit_statement_0'Access, null); Table.States (615).Kernel := To_Vector ((0 => (190, 96, 0, False))); Table.States (615).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 190, 5))); Add_Action (Table.States (616), 38, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 55, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 78, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 85, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 94, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 95, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 97, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 99, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (616), 104, 119); Add_Action (Table.States (616), 105, 33); Add_Action (Table.States (616), 106, 34); Add_Error (Table.States (616)); Add_Goto (Table.States (616), 128, 41); Add_Goto (Table.States (616), 239, 772); Add_Goto (Table.States (616), 272, 92); Add_Goto (Table.States (616), 293, 97); Table.States (616).Kernel := To_Vector (((258, 41, 0, False), (314, 41, 5, False), (314, 41, 1, False))); Table.States (616).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (617), (37, 87), (230, 2), 4, iterator_specification_2'Access, null); Table.States (617).Kernel := To_Vector ((0 => (230, 167, 0, False))); Table.States (617).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 4))); Add_Action (Table.States (618), 3, 121); Add_Action (Table.States (618), 39, 122); Add_Action (Table.States (618), 40, 123); Add_Action (Table.States (618), 41, 124); Add_Action (Table.States (618), 76, 126); Add_Action (Table.States (618), 94, 127); Add_Action (Table.States (618), 95, 128); Add_Action (Table.States (618), 103, 129); Add_Action (Table.States (618), 104, 119); Add_Action (Table.States (618), 105, 33); Add_Action (Table.States (618), 106, 34); Add_Error (Table.States (618)); Add_Goto (Table.States (618), 117, 130); Add_Goto (Table.States (618), 128, 41); Add_Goto (Table.States (618), 197, 133); Add_Goto (Table.States (618), 239, 274); Add_Goto (Table.States (618), 258, 135); Add_Goto (Table.States (618), 272, 92); Add_Goto (Table.States (618), 277, 773); Add_Goto (Table.States (618), 293, 97); Add_Goto (Table.States (618), 301, 479); Add_Goto (Table.States (618), 320, 144); Add_Goto (Table.States (618), 321, 145); Add_Goto (Table.States (618), 330, 146); Table.States (618).Kernel := To_Vector ((0 => (155, 53, 3, False))); Table.States (618).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (619), 3, 121); Add_Action (Table.States (619), 15, 258); Add_Action (Table.States (619), 28, 259); Add_Action (Table.States (619), 32, 260); Add_Action (Table.States (619), 39, 122); Add_Action (Table.States (619), 40, 774); Add_Action (Table.States (619), 41, 124); Add_Action (Table.States (619), 44, 263); Add_Action (Table.States (619), 52, 125); Add_Action (Table.States (619), 76, 126); Add_Action (Table.States (619), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (619), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (619), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (619), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (619), 94, 127); Add_Action (Table.States (619), 95, 128); Add_Action (Table.States (619), 103, 129); Add_Action (Table.States (619), 104, 119); Add_Action (Table.States (619), 105, 33); Add_Action (Table.States (619), 106, 264); Add_Error (Table.States (619)); Add_Goto (Table.States (619), 117, 130); Add_Goto (Table.States (619), 124, 265); Add_Goto (Table.States (619), 125, 406); Add_Goto (Table.States (619), 128, 41); Add_Goto (Table.States (619), 136, 267); Add_Goto (Table.States (619), 153, 407); Add_Goto (Table.States (619), 165, 269); Add_Goto (Table.States (619), 166, 270); Add_Goto (Table.States (619), 167, 775); Add_Goto (Table.States (619), 168, 776); Add_Goto (Table.States (619), 191, 408); Add_Goto (Table.States (619), 197, 133); Add_Goto (Table.States (619), 221, 273); Add_Goto (Table.States (619), 239, 477); Add_Goto (Table.States (619), 258, 135); Add_Goto (Table.States (619), 272, 92); Add_Goto (Table.States (619), 273, 275); Add_Goto (Table.States (619), 275, 136); Add_Goto (Table.States (619), 277, 777); Add_Goto (Table.States (619), 278, 410); Add_Goto (Table.States (619), 282, 137); Add_Goto (Table.States (619), 283, 138); Add_Goto (Table.States (619), 284, 139); Add_Goto (Table.States (619), 285, 140); Add_Goto (Table.States (619), 286, 141); Add_Goto (Table.States (619), 287, 142); Add_Goto (Table.States (619), 293, 97); Add_Goto (Table.States (619), 301, 277); Add_Goto (Table.States (619), 314, 480); Add_Goto (Table.States (619), 320, 144); Add_Goto (Table.States (619), 321, 145); Add_Goto (Table.States (619), 330, 146); Table.States (619).Kernel := To_Vector (((115, 76, 1, False), (115, 76, 3, False), (224, 76, 4, False), (239, 76, 4, True))); Table.States (619).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Table.States (619).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (620), (10, 21, 37, 42, 74, 77, 82, 83, 87, 96), (314, 2), 2, subtype_indication_2'Access, null); Table.States (620).Kernel := To_Vector ((0 => (314, 155, 0, False))); Table.States (620).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 314, 2))); Add_Action (Table.States (621), (10, 21, 37, 42, 74, 77, 82, 83, 87, 96), (155, 1), 1, null, null); Table.States (621).Kernel := To_Vector ((0 => (155, 224, 0, False))); Table.States (621).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 155, 1))); Add_Action (Table.States (622), 37, Reduce, (230, 3), 4, null, null); Add_Action (Table.States (622), 76, 235); Add_Action (Table.States (622), 84, 237); Add_Action (Table.States (622), 87, Reduce, (230, 3), 4, null, null); Add_Action (Table.States (622), 101, 239); Add_Action (Table.States (622), 102, 240); Add_Error (Table.States (622)); Add_Goto (Table.States (622), 115, 241); Add_Goto (Table.States (622), 322, 242); Table.States (622).Kernel := To_Vector (((128, 239, 2, True), (230, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (622).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 4))); Add_Action (Table.States (623), 104, 119); Add_Action (Table.States (623), 105, 33); Add_Action (Table.States (623), 106, 34); Add_Error (Table.States (623)); Add_Goto (Table.States (623), 128, 41); Add_Goto (Table.States (623), 239, 772); Add_Goto (Table.States (623), 272, 92); Add_Goto (Table.States (623), 293, 97); Table.States (623).Kernel := To_Vector (((314, 41, 5, False), (314, 41, 1, False))); Table.States (623).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (624), 59, 778); Add_Action (Table.States (624), 104, 119); Add_Action (Table.States (624), 105, 33); Add_Action (Table.States (624), 106, 34); Add_Error (Table.States (624)); Add_Goto (Table.States (624), 128, 41); Add_Goto (Table.States (624), 239, 779); Add_Goto (Table.States (624), 272, 92); Add_Goto (Table.States (624), 293, 97); Table.States (624).Kernel := To_Vector (((230, 42, 2, False), (230, 42, 1, False))); Table.States (624).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (625), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (121, 0), 5, aspect_clause_0'Access, null); Table.States (625).Kernel := To_Vector ((0 => (121, 96, 0, False))); Table.States (625).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 121, 5))); Add_Action (Table.States (626), 96, 780); Add_Error (Table.States (626)); Table.States (626).Kernel := To_Vector ((0 => (127, 192, 1, False))); Table.States (626).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 780))); Add_Action (Table.States (627), 38, 781); Add_Error (Table.States (627)); Table.States (627).Kernel := To_Vector ((0 => (235, 12, 2, False))); Table.States (627).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 38, 781))); Add_Action (Table.States (628), 104, 782); Add_Error (Table.States (628)); Add_Goto (Table.States (628), 144, 783); Add_Goto (Table.States (628), 145, 784); Table.States (628).Kernel := To_Vector ((0 => (281, 235, 11, False))); Table.States (628).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 782))); Add_Action (Table.States (629), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (182, 0), 5, enumeration_representation_clause_0'Access, null); Table.States (629).Kernel := To_Vector ((0 => (182, 96, 0, False))); Table.States (629).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 182, 5))); Add_Action (Table.States (630), 21, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 35, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 56, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 74, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 76, 235); Add_Action (Table.States (630), 77, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 82, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 84, 237); Add_Action (Table.States (630), 96, Reduce, (240, 0), 1, null, name_opt_0_check'Access); Add_Action (Table.States (630), 101, 239); Add_Action (Table.States (630), 102, 240); Add_Error (Table.States (630)); Add_Goto (Table.States (630), 115, 241); Add_Goto (Table.States (630), 322, 242); Table.States (630).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (240, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (630).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 1))); Add_Action (Table.States (631), (21, 35, 56, 74, 77, 82, 96), (291, 0), 3, result_profile_0'Access, null); Table.States (631).Kernel := To_Vector ((0 => (291, 240, 0, False))); Table.States (631).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 291, 3))); Add_Action (Table.States (632), 7, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 8, 401); Add_Action (Table.States (632), 33, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 40, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 45, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 77, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 82, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 96, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 104, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 105, Reduce, (118, 1), 0, null, null); Add_Action (Table.States (632), 106, Reduce, (118, 1), 0, null, null); Add_Error (Table.States (632)); Add_Goto (Table.States (632), 118, 785); Table.States (632).Kernel := To_Vector (((254, 81, 2, False), (254, 81, 1, False), (254, 81, 3, False), (254, 81, 2, False))); Table.States (632).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 118, 0))); Add_Action (Table.States (633), (21, 35, 56, 58, 72, 74, 77, 82, 96), (199, 0), 3, formal_part_0'Access, null); Table.States (633).Kernel := To_Vector ((0 => (199, 77, 0, False))); Table.States (633).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 199, 3))); Add_Action (Table.States (634), 77, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (634), 96, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (634), 104, 164); Add_Error (Table.States (634)); Add_Goto (Table.States (634), 219, 493); Add_Goto (Table.States (634), 254, 786); Table.States (634).Kernel := To_Vector ((0 => (255, 96, 0, True))); Table.States (634).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 254, 0))); Table.States (634).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (635), 74, 337); Add_Action (Table.States (635), 76, 235); Add_Action (Table.States (635), 84, 237); Add_Action (Table.States (635), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (635), 101, 239); Add_Action (Table.States (635), 102, 240); Add_Error (Table.States (635)); Add_Goto (Table.States (635), 115, 241); Add_Goto (Table.States (635), 122, 787); Add_Goto (Table.States (635), 322, 242); Table.States (635).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (635).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (636), 74, 337); Add_Action (Table.States (636), 76, 235); Add_Action (Table.States (636), 84, 237); Add_Action (Table.States (636), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (636), 101, 239); Add_Action (Table.States (636), 102, 240); Add_Error (Table.States (636)); Add_Goto (Table.States (636), 115, 241); Add_Goto (Table.States (636), 122, 788); Add_Goto (Table.States (636), 322, 242); Table.States (636).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (636).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (637), 74, 337); Add_Action (Table.States (637), 76, 235); Add_Action (Table.States (637), 84, 237); Add_Action (Table.States (637), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (637), 101, 239); Add_Action (Table.States (637), 102, 240); Add_Error (Table.States (637)); Add_Goto (Table.States (637), 115, 241); Add_Goto (Table.States (637), 122, 789); Add_Goto (Table.States (637), 322, 242); Table.States (637).Kernel := To_Vector (((128, 239, 2, True), (215, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (637).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (638), 6, 790); Add_Action (Table.States (638), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (638), 11, 699); Add_Action (Table.States (638), 19, 791); Add_Action (Table.States (638), 20, 792); Add_Action (Table.States (638), 34, 702); Add_Action (Table.States (638), 36, 793); Add_Action (Table.States (638), 38, 794); Add_Action (Table.States (638), 39, Reduce, (109, 5), 0, null, null); Add_Action (Table.States (638), 40, 386); Add_Action (Table.States (638), 49, Reduce, (111, 5), 0, null, null); Add_Action (Table.States (638), 51, 706); Add_Action (Table.States (638), 53, 795); Add_Action (Table.States (638), 64, 709); Add_Action (Table.States (638), 65, 796); Add_Action (Table.States (638), 66, 711); Add_Action (Table.States (638), 76, 797); Add_Error (Table.States (638)); Add_Goto (Table.States (638), 109, 798); Add_Goto (Table.States (638), 111, 799); Add_Goto (Table.States (638), 114, 800); Add_Goto (Table.States (638), 120, 801); Add_Goto (Table.States (638), 202, 802); Add_Goto (Table.States (638), 203, 803); Add_Goto (Table.States (638), 228, 804); Add_Goto (Table.States (638), 241, 721); Table.States (638).Kernel := To_Vector (((201, 35, 2, False), (201, 35, 2, False))); Table.States (638).Minimal_Complete_Actions := To_Vector (((Reduce, 111, 0), (Shift, 65, 796))); Add_Action (Table.States (639), 96, 805); Add_Error (Table.States (639)); Table.States (639).Kernel := To_Vector ((0 => (201, 122, 1, False))); Table.States (639).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 805))); Add_Action (Table.States (640), 39, 806); Add_Error (Table.States (640)); Table.States (640).Kernel := To_Vector ((0 => (204, 35, 3, False))); Table.States (640).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 806))); Add_Action (Table.States (641), 41, 642); Add_Action (Table.States (641), 74, 337); Add_Action (Table.States (641), 80, 643); Add_Action (Table.States (641), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (641), 104, 119); Add_Action (Table.States (641), 105, 33); Add_Action (Table.States (641), 106, 34); Add_Error (Table.States (641)); Add_Goto (Table.States (641), 122, 807); Add_Goto (Table.States (641), 128, 41); Add_Goto (Table.States (641), 239, 644); Add_Goto (Table.States (641), 272, 92); Add_Goto (Table.States (641), 293, 97); Add_Goto (Table.States (641), 310, 808); Table.States (641).Kernel := To_Vector (((200, 6, 2, False), (200, 6, 1, False))); Table.States (641).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (642), (74, 96), (310, 2), 1, null, null); Table.States (642).Kernel := To_Vector ((0 => (310, 41, 0, False))); Table.States (642).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 310, 1))); Add_Action (Table.States (643), (74, 96), (310, 1), 1, null, null); Table.States (643).Kernel := To_Vector ((0 => (310, 80, 0, False))); Table.States (643).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 310, 1))); Add_Action (Table.States (644), 74, Reduce, (310, 0), 1, subprogram_default_0'Access, null); Add_Action (Table.States (644), 76, 235); Add_Action (Table.States (644), 84, 237); Add_Action (Table.States (644), 96, Reduce, (310, 0), 1, subprogram_default_0'Access, null); Add_Action (Table.States (644), 101, 239); Add_Action (Table.States (644), 102, 240); Add_Error (Table.States (644)); Add_Goto (Table.States (644), 115, 241); Add_Goto (Table.States (644), 322, 242); Table.States (644).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (310, 239, 0, False))); Table.States (644).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 310, 1))); Add_Action (Table.States (645), 74, 337); Add_Action (Table.States (645), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (645)); Add_Goto (Table.States (645), 122, 809); Table.States (645).Kernel := To_Vector ((0 => (200, 310, 1, False))); Table.States (645).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (646), (29, 47, 48, 50, 69, 71, 74, 104), (200, 3), 4, formal_subprogram_declaration_3'Access, null); Table.States (646).Kernel := To_Vector ((0 => (200, 96, 0, False))); Table.States (646).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 200, 4))); Add_Action (Table.States (647), (7, 40, 74, 82, 96, 104, 105, 106), (236, 1), 2, null, null); Table.States (647).Kernel := To_Vector ((0 => (236, 45, 0, False))); Table.States (647).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 236, 2))); Add_Action (Table.States (648), 74, 337); Add_Action (Table.States (648), 82, 810); Add_Action (Table.States (648), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (648)); Add_Goto (Table.States (648), 122, 811); Table.States (648).Kernel := To_Vector (((198, 114, 2, False), (198, 114, 1, False))); Table.States (648).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (649), 7, 556); Add_Action (Table.States (649), 104, 119); Add_Action (Table.States (649), 105, 33); Add_Action (Table.States (649), 106, 34); Add_Error (Table.States (649)); Add_Goto (Table.States (649), 128, 41); Add_Goto (Table.States (649), 239, 812); Add_Goto (Table.States (649), 272, 92); Add_Goto (Table.States (649), 293, 97); Table.States (649).Kernel := To_Vector (((114, 241, 2, False), (114, 241, 3, True), (114, 241, 2, False), (198, 241, 3, False), (198, 241, 2, False))); Table.States (649).Minimal_Complete_Actions := To_Vector (((Shift, 7, 556), (Shift, 104, 119))); Add_Action (Table.States (650), 4, 1); Add_Action (Table.States (650), 5, 2); Add_Action (Table.States (650), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (650), 15, 3); Add_Action (Table.States (650), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (650), 18, 4); Add_Action (Table.States (650), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (650), 27, 5); Add_Action (Table.States (650), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (650), 31, 9); Add_Action (Table.States (650), 32, 10); Add_Action (Table.States (650), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (650), 41, 13); Add_Action (Table.States (650), 48, 16); Add_Action (Table.States (650), 52, 20); Add_Action (Table.States (650), 57, 21); Add_Action (Table.States (650), 58, 22); Add_Action (Table.States (650), 61, 24); Add_Action (Table.States (650), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (650), 93, 31); Add_Action (Table.States (650), 104, 360); Add_Action (Table.States (650), 105, 33); Add_Action (Table.States (650), 106, 34); Add_Error (Table.States (650)); Add_Goto (Table.States (650), 113, 36); Add_Goto (Table.States (650), 123, 38); Add_Goto (Table.States (650), 126, 39); Add_Goto (Table.States (650), 128, 41); Add_Goto (Table.States (650), 131, 42); Add_Goto (Table.States (650), 132, 43); Add_Goto (Table.States (650), 133, 44); Add_Goto (Table.States (650), 139, 47); Add_Goto (Table.States (650), 151, 50); Add_Goto (Table.States (650), 152, 51); Add_Goto (Table.States (650), 161, 53); Add_Goto (Table.States (650), 190, 57); Add_Goto (Table.States (650), 196, 59); Add_Goto (Table.States (650), 217, 68); Add_Goto (Table.States (650), 222, 70); Add_Goto (Table.States (650), 232, 72); Add_Goto (Table.States (650), 239, 73); Add_Goto (Table.States (650), 257, 83); Add_Goto (Table.States (650), 261, 86); Add_Goto (Table.States (650), 272, 92); Add_Goto (Table.States (650), 276, 93); Add_Goto (Table.States (650), 290, 96); Add_Goto (Table.States (650), 293, 97); Add_Goto (Table.States (650), 294, 98); Add_Goto (Table.States (650), 298, 99); Add_Goto (Table.States (650), 299, 361); Add_Goto (Table.States (650), 300, 813); Add_Goto (Table.States (650), 302, 100); Add_Goto (Table.States (650), 303, 101); Add_Goto (Table.States (650), 306, 363); Add_Goto (Table.States (650), 323, 114); Table.States (650).Kernel := To_Vector ((0 => (222, 22, 3, False))); Table.States (650).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (651), 3, 121); Add_Action (Table.States (651), 39, 122); Add_Action (Table.States (651), 40, 123); Add_Action (Table.States (651), 41, 124); Add_Action (Table.States (651), 52, 125); Add_Action (Table.States (651), 68, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (651), 76, 126); Add_Action (Table.States (651), 94, 127); Add_Action (Table.States (651), 95, 128); Add_Action (Table.States (651), 103, 129); Add_Action (Table.States (651), 104, 119); Add_Action (Table.States (651), 105, 33); Add_Action (Table.States (651), 106, 34); Add_Error (Table.States (651)); Add_Goto (Table.States (651), 117, 130); Add_Goto (Table.States (651), 128, 41); Add_Goto (Table.States (651), 191, 131); Add_Goto (Table.States (651), 192, 814); Add_Goto (Table.States (651), 197, 133); Add_Goto (Table.States (651), 239, 134); Add_Goto (Table.States (651), 258, 135); Add_Goto (Table.States (651), 272, 92); Add_Goto (Table.States (651), 275, 136); Add_Goto (Table.States (651), 282, 137); Add_Goto (Table.States (651), 283, 138); Add_Goto (Table.States (651), 284, 139); Add_Goto (Table.States (651), 285, 140); Add_Goto (Table.States (651), 286, 141); Add_Goto (Table.States (651), 287, 142); Add_Goto (Table.States (651), 293, 97); Add_Goto (Table.States (651), 301, 143); Add_Goto (Table.States (651), 320, 144); Add_Goto (Table.States (651), 321, 145); Add_Goto (Table.States (651), 330, 146); Table.States (651).Kernel := To_Vector ((0 => (174, 23, 1, False))); Table.States (651).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (652), 32, 815); Add_Error (Table.States (652)); Table.States (652).Kernel := To_Vector ((0 => (222, 24, 2, False))); Table.States (652).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 32, 815))); Add_Action (Table.States (653), (22, 23, 24), (175, 1), 1, null, null); Table.States (653).Kernel := To_Vector ((0 => (175, 174, 0, False))); Table.States (653).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 175, 1))); Add_Action (Table.States (654), 22, 816); Add_Action (Table.States (654), 23, 651); Add_Action (Table.States (654), 24, 817); Add_Error (Table.States (654)); Add_Goto (Table.States (654), 174, 818); Table.States (654).Kernel := To_Vector (((175, 175, 2, True), (222, 175, 4, False), (222, 175, 3, False))); Table.States (654).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 817))); Add_Action (Table.States (655), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (332, 0), 5, with_clause_0'Access, null); Table.States (655).Kernel := To_Vector ((0 => (332, 96, 0, False))); Table.States (655).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 332, 5))); Add_Action (Table.States (656), 74, 337); Add_Action (Table.States (656), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (656)); Add_Goto (Table.States (656), 122, 819); Table.States (656).Kernel := To_Vector ((0 => (248, 60, 1, False))); Table.States (656).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (657), 13, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (657), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (657), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (657), 28, 183); Add_Action (Table.States (657), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (657), 30, 8); Add_Action (Table.States (657), 40, 12); Add_Action (Table.States (657), 46, 14); Add_Action (Table.States (657), 47, 15); Add_Action (Table.States (657), 48, 16); Add_Action (Table.States (657), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (657), 51, 19); Add_Action (Table.States (657), 63, 25); Add_Action (Table.States (657), 66, 26); Add_Action (Table.States (657), 69, 27); Add_Action (Table.States (657), 71, 28); Add_Action (Table.States (657), 104, 185); Add_Error (Table.States (657)); Add_Goto (Table.States (657), 112, 35); Add_Goto (Table.States (657), 121, 37); Add_Goto (Table.States (657), 127, 40); Add_Goto (Table.States (657), 134, 45); Add_Goto (Table.States (657), 135, 46); Add_Goto (Table.States (657), 157, 391); Add_Goto (Table.States (657), 158, 392); Add_Goto (Table.States (657), 159, 820); Add_Goto (Table.States (657), 179, 54); Add_Goto (Table.States (657), 182, 55); Add_Goto (Table.States (657), 186, 56); Add_Goto (Table.States (657), 193, 58); Add_Goto (Table.States (657), 206, 60); Add_Goto (Table.States (657), 207, 61); Add_Goto (Table.States (657), 209, 62); Add_Goto (Table.States (657), 210, 63); Add_Goto (Table.States (657), 213, 64); Add_Goto (Table.States (657), 214, 65); Add_Goto (Table.States (657), 215, 66); Add_Goto (Table.States (657), 216, 67); Add_Goto (Table.States (657), 219, 69); Add_Goto (Table.States (657), 223, 71); Add_Goto (Table.States (657), 243, 74); Add_Goto (Table.States (657), 244, 75); Add_Goto (Table.States (657), 245, 76); Add_Goto (Table.States (657), 246, 77); Add_Goto (Table.States (657), 247, 78); Add_Goto (Table.States (657), 248, 79); Add_Goto (Table.States (657), 249, 80); Add_Goto (Table.States (657), 250, 81); Add_Goto (Table.States (657), 251, 82); Add_Goto (Table.States (657), 257, 394); Add_Goto (Table.States (657), 259, 84); Add_Goto (Table.States (657), 260, 85); Add_Goto (Table.States (657), 262, 87); Add_Goto (Table.States (657), 263, 88); Add_Goto (Table.States (657), 264, 89); Add_Goto (Table.States (657), 265, 90); Add_Goto (Table.States (657), 271, 91); Add_Goto (Table.States (657), 281, 94); Add_Goto (Table.States (657), 289, 95); Add_Goto (Table.States (657), 304, 102); Add_Goto (Table.States (657), 305, 103); Add_Goto (Table.States (657), 307, 105); Add_Goto (Table.States (657), 308, 106); Add_Goto (Table.States (657), 309, 107); Add_Goto (Table.States (657), 311, 108); Add_Goto (Table.States (657), 313, 109); Add_Goto (Table.States (657), 316, 111); Add_Goto (Table.States (657), 317, 112); Add_Goto (Table.States (657), 319, 113); Add_Goto (Table.States (657), 325, 115); Add_Goto (Table.States (657), 331, 116); Table.States (657).Kernel := To_Vector (((247, 35, 3, False), (247, 35, 2, False))); Table.States (657).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (658), 74, 337); Add_Action (Table.States (658), 76, 235); Add_Action (Table.States (658), 84, 237); Add_Action (Table.States (658), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (658), 101, 239); Add_Action (Table.States (658), 102, 240); Add_Error (Table.States (658)); Add_Goto (Table.States (658), 115, 241); Add_Goto (Table.States (658), 122, 821); Add_Goto (Table.States (658), 322, 242); Table.States (658).Kernel := To_Vector (((128, 239, 2, True), (213, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (658).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (659), 96, 822); Add_Error (Table.States (659)); Table.States (659).Kernel := To_Vector ((0 => (250, 122, 1, False))); Table.States (659).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 822))); Add_Action (Table.States (660), 24, 823); Add_Action (Table.States (660), 49, 824); Add_Error (Table.States (660)); Table.States (660).Kernel := To_Vector (((251, 159, 2, False), (251, 159, 1, False))); Table.States (660).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 823))); Add_Action (Table.States (661), 96, 825); Add_Error (Table.States (661)); Table.States (661).Kernel := To_Vector ((0 => (257, 77, 1, False))); Table.States (661).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 825))); Add_Action (Table.States (662), 96, 826); Add_Error (Table.States (662)); Table.States (662).Kernel := To_Vector ((0 => (257, 77, 1, False))); Table.States (662).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 826))); Add_Action (Table.States (663), 74, 337); Add_Action (Table.States (663), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (663)); Add_Goto (Table.States (663), 122, 827); Table.States (663).Kernel := To_Vector ((0 => (265, 60, 1, False))); Table.States (663).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (664), 24, Reduce, (269, 1), 0, null, null); Add_Action (Table.States (664), 25, 828); Add_Action (Table.States (664), 28, 183); Add_Action (Table.States (664), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (664), 40, 12); Add_Action (Table.States (664), 46, 14); Add_Action (Table.States (664), 50, Reduce, (246, 2), 0, null, null); Add_Error (Table.States (664)); Add_Goto (Table.States (664), 121, 829); Add_Goto (Table.States (664), 127, 40); Add_Goto (Table.States (664), 176, 830); Add_Goto (Table.States (664), 182, 55); Add_Goto (Table.States (664), 193, 831); Add_Goto (Table.States (664), 207, 61); Add_Goto (Table.States (664), 243, 832); Add_Goto (Table.States (664), 246, 833); Add_Goto (Table.States (664), 262, 87); Add_Goto (Table.States (664), 267, 834); Add_Goto (Table.States (664), 268, 835); Add_Goto (Table.States (664), 269, 836); Add_Goto (Table.States (664), 281, 94); Add_Goto (Table.States (664), 307, 837); Add_Goto (Table.States (664), 309, 838); Table.States (664).Kernel := To_Vector ((0 => (264, 35, 2, False))); Table.States (664).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 269, 0))); end Subr_12; procedure Subr_13 is begin Add_Action (Table.States (665), 35, 839); Add_Error (Table.States (665)); Table.States (665).Kernel := To_Vector (((271, 122, 6, False), (271, 122, 3, False))); Table.States (665).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 839))); Add_Action (Table.States (666), 104, 119); Add_Action (Table.States (666), 105, 33); Add_Action (Table.States (666), 106, 34); Add_Error (Table.States (666)); Add_Goto (Table.States (666), 128, 41); Add_Goto (Table.States (666), 227, 840); Add_Goto (Table.States (666), 239, 841); Add_Goto (Table.States (666), 272, 92); Add_Goto (Table.States (666), 293, 97); Table.States (666).Kernel := To_Vector ((0 => (304, 39, 4, False))); Table.States (666).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (667), 24, 842); Add_Action (Table.States (667), 49, 843); Add_Error (Table.States (667)); Table.States (667).Kernel := To_Vector (((266, 159, 2, False), (266, 159, 1, False))); Table.States (667).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 842))); Add_Action (Table.States (668), 96, 844); Add_Error (Table.States (668)); Table.States (668).Kernel := To_Vector ((0 => (304, 266, 1, False))); Table.States (668).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 844))); Add_Action (Table.States (669), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (276, 0), 5, raise_statement_0'Access, null); Table.States (669).Kernel := To_Vector ((0 => (276, 96, 0, False))); Table.States (669).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 276, 5))); Add_Action (Table.States (670), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (290, 0), 5, requeue_statement_0'Access, null); Table.States (670).Kernel := To_Vector ((0 => (290, 96, 0, False))); Table.States (670).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 290, 5))); Add_Action (Table.States (671), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (671), 40, 742); Add_Action (Table.States (671), 104, 119); Add_Action (Table.States (671), 105, 33); Add_Action (Table.States (671), 106, 34); Add_Error (Table.States (671)); Add_Goto (Table.States (671), 114, 845); Add_Goto (Table.States (671), 128, 41); Add_Goto (Table.States (671), 239, 484); Add_Goto (Table.States (671), 241, 721); Add_Goto (Table.States (671), 272, 92); Add_Goto (Table.States (671), 292, 846); Add_Goto (Table.States (671), 293, 97); Add_Goto (Table.States (671), 314, 847); Table.States (671).Kernel := To_Vector (((194, 154, 2, False), (194, 154, 1, False))); Table.States (671).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (672), 58, 848); Add_Error (Table.States (672)); Table.States (672).Kernel := To_Vector ((0 => (196, 24, 2, False))); Table.States (672).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 58, 848))); Add_Action (Table.States (673), 14, 849); Add_Error (Table.States (673)); Table.States (673).Kernel := To_Vector (((247, 47, 6, False), (247, 47, 5, False))); Table.States (673).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 14, 849))); Add_Action (Table.States (674), 14, 850); Add_Error (Table.States (674)); Table.States (674).Kernel := To_Vector ((0 => (264, 51, 5, False))); Table.States (674).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 14, 850))); Add_Action (Table.States (675), 14, 851); Add_Error (Table.States (675)); Table.States (675).Kernel := To_Vector ((0 => (316, 66, 6, False))); Table.States (675).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 14, 851))); Add_Action (Table.States (676), 29, 7); Add_Action (Table.States (676), 50, 18); Add_Error (Table.States (676)); Add_Goto (Table.States (676), 207, 61); Add_Goto (Table.States (676), 262, 87); Add_Goto (Table.States (676), 312, 852); Table.States (676).Kernel := To_Vector ((0 => (307, 246, 6, False))); Table.States (676).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 50, 18))); Add_Action (Table.States (677), (4, 5, 13, 15, 17, 18, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (315, 0), 5, subunit_0'Access, null); Table.States (677).Kernel := To_Vector ((0 => (315, 263, 0, False))); Table.States (677).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 315, 5))); Add_Action (Table.States (678), 96, 853); Add_Error (Table.States (678)); Table.States (678).Kernel := To_Vector ((0 => (295, 67, 1, False))); Table.States (678).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 853))); Add_Action (Table.States (679), 4, 1); Add_Action (Table.States (679), 5, 2); Add_Action (Table.States (679), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (679), 15, 3); Add_Action (Table.States (679), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (679), 18, 4); Add_Action (Table.States (679), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (679), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (679), 27, 5); Add_Action (Table.States (679), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (679), 31, 9); Add_Action (Table.States (679), 32, 10); Add_Action (Table.States (679), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (679), 41, 13); Add_Action (Table.States (679), 43, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (679), 48, 16); Add_Action (Table.States (679), 52, 20); Add_Action (Table.States (679), 57, 21); Add_Action (Table.States (679), 58, 22); Add_Action (Table.States (679), 61, 24); Add_Action (Table.States (679), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (679), 93, 31); Add_Action (Table.States (679), 104, 360); Add_Action (Table.States (679), 105, 33); Add_Action (Table.States (679), 106, 34); Add_Error (Table.States (679)); Add_Goto (Table.States (679), 113, 36); Add_Goto (Table.States (679), 123, 38); Add_Goto (Table.States (679), 126, 39); Add_Goto (Table.States (679), 128, 41); Add_Goto (Table.States (679), 131, 42); Add_Goto (Table.States (679), 132, 43); Add_Goto (Table.States (679), 133, 44); Add_Goto (Table.States (679), 139, 47); Add_Goto (Table.States (679), 151, 50); Add_Goto (Table.States (679), 152, 51); Add_Goto (Table.States (679), 161, 53); Add_Goto (Table.States (679), 190, 57); Add_Goto (Table.States (679), 196, 59); Add_Goto (Table.States (679), 217, 68); Add_Goto (Table.States (679), 222, 70); Add_Goto (Table.States (679), 232, 72); Add_Goto (Table.States (679), 239, 73); Add_Goto (Table.States (679), 257, 83); Add_Goto (Table.States (679), 261, 86); Add_Goto (Table.States (679), 272, 92); Add_Goto (Table.States (679), 276, 93); Add_Goto (Table.States (679), 290, 96); Add_Goto (Table.States (679), 293, 97); Add_Goto (Table.States (679), 294, 98); Add_Goto (Table.States (679), 298, 99); Add_Goto (Table.States (679), 299, 361); Add_Goto (Table.States (679), 300, 854); Add_Goto (Table.States (679), 302, 100); Add_Goto (Table.States (679), 303, 101); Add_Goto (Table.States (679), 306, 363); Add_Goto (Table.States (679), 323, 114); Table.States (679).Kernel := To_Vector ((0 => (295, 113, 0, False))); Table.States (679).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (680), (22, 24, 43), (295, 2), 4, select_alternative_2'Access, null); Table.States (680).Kernel := To_Vector ((0 => (295, 160, 0, False))); Table.States (680).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 4))); Add_Action (Table.States (681), 61, 855); Add_Error (Table.States (681)); Table.States (681).Kernel := To_Vector ((0 => (152, 24, 2, False))); Table.States (681).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 61, 855))); Add_Action (Table.States (682), 61, 856); Add_Error (Table.States (682)); Table.States (682).Kernel := To_Vector ((0 => (323, 24, 2, False))); Table.States (682).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 61, 856))); Add_Action (Table.States (683), (22, 24, 43), (160, 0), 2, null, null); Table.States (683).Kernel := To_Vector ((0 => (160, 300, 0, False))); Table.States (683).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 160, 2))); Add_Action (Table.States (684), 61, 857); Add_Error (Table.States (684)); Table.States (684).Kernel := To_Vector ((0 => (294, 24, 2, False))); Table.States (684).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 61, 857))); Add_Action (Table.States (685), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (294, 1), 5, selective_accept_1'Access, null); Table.States (685).Kernel := To_Vector ((0 => (294, 96, 0, False))); Table.States (685).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 294, 5))); Add_Action (Table.States (686), 24, 858); Add_Error (Table.States (686)); Table.States (686).Kernel := To_Vector ((0 => (126, 300, 3, False))); Table.States (686).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 858))); Add_Action (Table.States (687), 96, 859); Add_Error (Table.States (687)); Table.States (687).Kernel := To_Vector ((0 => (313, 122, 1, False))); Table.States (687).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 859))); Add_Action (Table.States (688), 74, 337); Add_Action (Table.States (688), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (688)); Add_Goto (Table.States (688), 122, 860); Table.States (688).Kernel := To_Vector ((0 => (317, 60, 1, False))); Table.States (688).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (689), 13, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (689), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (689), 28, 183); Add_Action (Table.States (689), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (689), 30, 8); Add_Action (Table.States (689), 40, 12); Add_Action (Table.States (689), 46, 14); Add_Action (Table.States (689), 47, 15); Add_Action (Table.States (689), 48, 16); Add_Action (Table.States (689), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (689), 51, 19); Add_Action (Table.States (689), 63, 25); Add_Action (Table.States (689), 66, 26); Add_Action (Table.States (689), 69, 27); Add_Action (Table.States (689), 71, 28); Add_Action (Table.States (689), 104, 185); Add_Error (Table.States (689)); Add_Goto (Table.States (689), 112, 35); Add_Goto (Table.States (689), 121, 37); Add_Goto (Table.States (689), 127, 40); Add_Goto (Table.States (689), 134, 45); Add_Goto (Table.States (689), 135, 46); Add_Goto (Table.States (689), 157, 391); Add_Goto (Table.States (689), 158, 392); Add_Goto (Table.States (689), 159, 861); Add_Goto (Table.States (689), 179, 54); Add_Goto (Table.States (689), 182, 55); Add_Goto (Table.States (689), 186, 56); Add_Goto (Table.States (689), 193, 58); Add_Goto (Table.States (689), 206, 60); Add_Goto (Table.States (689), 207, 61); Add_Goto (Table.States (689), 209, 62); Add_Goto (Table.States (689), 210, 63); Add_Goto (Table.States (689), 213, 64); Add_Goto (Table.States (689), 214, 65); Add_Goto (Table.States (689), 215, 66); Add_Goto (Table.States (689), 216, 67); Add_Goto (Table.States (689), 219, 69); Add_Goto (Table.States (689), 223, 71); Add_Goto (Table.States (689), 243, 74); Add_Goto (Table.States (689), 244, 75); Add_Goto (Table.States (689), 245, 76); Add_Goto (Table.States (689), 246, 77); Add_Goto (Table.States (689), 247, 78); Add_Goto (Table.States (689), 248, 79); Add_Goto (Table.States (689), 249, 80); Add_Goto (Table.States (689), 250, 81); Add_Goto (Table.States (689), 251, 82); Add_Goto (Table.States (689), 257, 394); Add_Goto (Table.States (689), 259, 84); Add_Goto (Table.States (689), 260, 85); Add_Goto (Table.States (689), 262, 87); Add_Goto (Table.States (689), 263, 88); Add_Goto (Table.States (689), 264, 89); Add_Goto (Table.States (689), 265, 90); Add_Goto (Table.States (689), 271, 91); Add_Goto (Table.States (689), 281, 94); Add_Goto (Table.States (689), 289, 95); Add_Goto (Table.States (689), 304, 102); Add_Goto (Table.States (689), 305, 103); Add_Goto (Table.States (689), 307, 105); Add_Goto (Table.States (689), 308, 106); Add_Goto (Table.States (689), 309, 107); Add_Goto (Table.States (689), 311, 108); Add_Goto (Table.States (689), 313, 109); Add_Goto (Table.States (689), 316, 111); Add_Goto (Table.States (689), 317, 112); Add_Goto (Table.States (689), 319, 113); Add_Goto (Table.States (689), 325, 115); Add_Goto (Table.States (689), 331, 116); Table.States (689).Kernel := To_Vector ((0 => (316, 35, 3, False))); Table.States (689).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (690), 35, 862); Add_Action (Table.States (690), 96, 863); Add_Error (Table.States (690)); Table.States (690).Kernel := To_Vector (((319, 122, 6, False), (319, 122, 3, False), (319, 122, 1, False))); Table.States (690).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 863))); Add_Action (Table.States (691), 104, 119); Add_Action (Table.States (691), 105, 33); Add_Action (Table.States (691), 106, 34); Add_Error (Table.States (691)); Add_Goto (Table.States (691), 128, 41); Add_Goto (Table.States (691), 227, 864); Add_Goto (Table.States (691), 239, 841); Add_Goto (Table.States (691), 272, 92); Add_Goto (Table.States (691), 293, 97); Table.States (691).Kernel := To_Vector ((0 => (305, 39, 4, False))); Table.States (691).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (692), 24, Reduce, (318, 1), 1, task_definition_1'Access, null); Add_Action (Table.States (692), 49, 865); Add_Error (Table.States (692)); Table.States (692).Kernel := To_Vector (((318, 159, 1, False), (318, 159, 0, False))); Table.States (692).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 1))); Add_Action (Table.States (693), 24, 866); Add_Error (Table.States (693)); Table.States (693).Kernel := To_Vector ((0 => (305, 318, 2, False))); Table.States (693).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 866))); Add_Action (Table.States (694), (35, 74, 96), (169, 0), 3, null, null); Table.States (694).Kernel := To_Vector ((0 => (169, 77, 0, False))); Table.States (694).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 3))); Add_Action (Table.States (695), (35, 74, 96), (169, 1), 3, discriminant_part_opt_1'Access, null); Table.States (695).Kernel := To_Vector ((0 => (169, 77, 0, False))); Table.States (695).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 169, 3))); Add_Action (Table.States (696), 77, Reduce, (170, 4), 0, null, null); Add_Action (Table.States (696), 96, Reduce, (170, 4), 0, null, null); Add_Action (Table.States (696), 104, 164); Add_Error (Table.States (696)); Add_Goto (Table.States (696), 170, 867); Add_Goto (Table.States (696), 219, 547); Table.States (696).Kernel := To_Vector ((0 => (171, 96, 0, True))); Table.States (696).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 170, 0))); Table.States (696).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (697), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (697), 40, 868); Add_Action (Table.States (697), 104, 869); Add_Action (Table.States (697), 105, 33); Add_Action (Table.States (697), 106, 34); Add_Error (Table.States (697)); Add_Goto (Table.States (697), 114, 870); Add_Goto (Table.States (697), 128, 41); Add_Goto (Table.States (697), 239, 871); Add_Goto (Table.States (697), 241, 721); Add_Goto (Table.States (697), 242, 872); Add_Goto (Table.States (697), 272, 92); Add_Goto (Table.States (697), 293, 873); Table.States (697).Kernel := To_Vector (((170, 81, 2, False), (170, 81, 3, False), (170, 81, 1, False), (170, 81, 2, False))); Table.States (697).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 869))); Add_Action (Table.States (698), 36, 874); Add_Action (Table.States (698), 39, Reduce, (109, 2), 1, null, null); Add_Conflict (Table.States (698), 39, (110, 2), 1, null, null); Add_Action (Table.States (698), 64, 875); Add_Action (Table.States (698), 65, 876); Add_Error (Table.States (698)); Table.States (698).Kernel := To_Vector (((109, 6, 1, False), (109, 6, 1, False), (109, 6, 0, False), (110, 6, 1, False), (110, 6, 0, False), (111, 6, 2, False), (111, 6, 1, False))); Table.States (698).Minimal_Complete_Actions := To_Vector (((Reduce, 109, 1), (Reduce, 110, 1))); Add_Action (Table.States (699), 76, 877); Add_Error (Table.States (699)); Table.States (699).Kernel := To_Vector (((120, 11, 7, False), (120, 11, 7, False))); Table.States (699).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 76, 877))); Add_Action (Table.States (700), 3, 121); Add_Action (Table.States (700), 20, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (700), 39, 122); Add_Action (Table.States (700), 40, 123); Add_Action (Table.States (700), 41, 124); Add_Action (Table.States (700), 52, 125); Add_Action (Table.States (700), 53, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (700), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (700), 76, 126); Add_Action (Table.States (700), 94, 127); Add_Action (Table.States (700), 95, 128); Add_Action (Table.States (700), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (700), 103, 129); Add_Action (Table.States (700), 104, 119); Add_Action (Table.States (700), 105, 33); Add_Action (Table.States (700), 106, 34); Add_Error (Table.States (700)); Add_Goto (Table.States (700), 117, 130); Add_Goto (Table.States (700), 128, 41); Add_Goto (Table.States (700), 191, 131); Add_Goto (Table.States (700), 192, 878); Add_Goto (Table.States (700), 197, 133); Add_Goto (Table.States (700), 239, 134); Add_Goto (Table.States (700), 258, 135); Add_Goto (Table.States (700), 272, 92); Add_Goto (Table.States (700), 275, 136); Add_Goto (Table.States (700), 282, 137); Add_Goto (Table.States (700), 283, 138); Add_Goto (Table.States (700), 284, 139); Add_Goto (Table.States (700), 285, 140); Add_Goto (Table.States (700), 286, 141); Add_Goto (Table.States (700), 287, 142); Add_Goto (Table.States (700), 293, 97); Add_Goto (Table.States (700), 301, 143); Add_Goto (Table.States (700), 320, 144); Add_Goto (Table.States (700), 321, 145); Add_Goto (Table.States (700), 330, 146); Table.States (700).Kernel := To_Vector (((326, 19, 1, False), (326, 19, 0, False))); Table.States (700).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (701), 3, 121); Add_Action (Table.States (701), 39, 122); Add_Action (Table.States (701), 40, 123); Add_Action (Table.States (701), 41, 124); Add_Action (Table.States (701), 52, 125); Add_Action (Table.States (701), 53, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (701), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (701), 76, 126); Add_Action (Table.States (701), 94, 127); Add_Action (Table.States (701), 95, 128); Add_Action (Table.States (701), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (701), 103, 129); Add_Action (Table.States (701), 104, 119); Add_Action (Table.States (701), 105, 33); Add_Action (Table.States (701), 106, 34); Add_Error (Table.States (701)); Add_Goto (Table.States (701), 117, 130); Add_Goto (Table.States (701), 128, 41); Add_Goto (Table.States (701), 191, 131); Add_Goto (Table.States (701), 192, 879); Add_Goto (Table.States (701), 197, 133); Add_Goto (Table.States (701), 239, 134); Add_Goto (Table.States (701), 258, 135); Add_Goto (Table.States (701), 272, 92); Add_Goto (Table.States (701), 275, 136); Add_Goto (Table.States (701), 282, 137); Add_Goto (Table.States (701), 283, 138); Add_Goto (Table.States (701), 284, 139); Add_Goto (Table.States (701), 285, 140); Add_Goto (Table.States (701), 286, 141); Add_Goto (Table.States (701), 287, 142); Add_Goto (Table.States (701), 293, 97); Add_Goto (Table.States (701), 301, 143); Add_Goto (Table.States (701), 320, 144); Add_Goto (Table.States (701), 321, 145); Add_Goto (Table.States (701), 330, 146); Table.States (701).Kernel := To_Vector ((0 => (326, 20, 0, False))); Table.States (701).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (702), (74, 96), (228, 8), 1, null, null); Table.States (702).Kernel := To_Vector ((0 => (228, 34, 0, False))); Table.States (702).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 1))); Add_Action (Table.States (703), 34, 880); Add_Action (Table.States (703), 39, Reduce, (109, 3), 1, null, null); Add_Conflict (Table.States (703), 39, (110, 1), 1, null, null); Add_Action (Table.States (703), 41, Reduce, (111, 4), 1, null, null); Add_Action (Table.States (703), 49, Reduce, (111, 4), 1, null, null); Add_Action (Table.States (703), 54, Reduce, (111, 4), 1, null, null); Add_Error (Table.States (703)); Table.States (703).Kernel := To_Vector (((109, 36, 0, False), (110, 36, 0, False), (111, 36, 0, False), (228, 36, 3, False), (228, 36, 1, False))); Table.States (703).Minimal_Complete_Actions := To_Vector (((Reduce, 109, 1), (Reduce, 110, 1), (Reduce, 111, 1))); Add_Action (Table.States (704), 3, 121); Add_Action (Table.States (704), 39, 122); Add_Action (Table.States (704), 40, 123); Add_Action (Table.States (704), 41, 124); Add_Action (Table.States (704), 52, 125); Add_Action (Table.States (704), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (704), 76, 126); Add_Action (Table.States (704), 94, 127); Add_Action (Table.States (704), 95, 128); Add_Action (Table.States (704), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (704), 103, 129); Add_Action (Table.States (704), 104, 119); Add_Action (Table.States (704), 105, 33); Add_Action (Table.States (704), 106, 34); Add_Error (Table.States (704)); Add_Goto (Table.States (704), 117, 130); Add_Goto (Table.States (704), 128, 41); Add_Goto (Table.States (704), 191, 131); Add_Goto (Table.States (704), 192, 881); Add_Goto (Table.States (704), 197, 133); Add_Goto (Table.States (704), 239, 134); Add_Goto (Table.States (704), 258, 135); Add_Goto (Table.States (704), 272, 92); Add_Goto (Table.States (704), 275, 136); Add_Goto (Table.States (704), 282, 137); Add_Goto (Table.States (704), 283, 138); Add_Goto (Table.States (704), 284, 139); Add_Goto (Table.States (704), 285, 140); Add_Goto (Table.States (704), 286, 141); Add_Goto (Table.States (704), 287, 142); Add_Goto (Table.States (704), 293, 97); Add_Goto (Table.States (704), 301, 143); Add_Goto (Table.States (704), 320, 144); Add_Goto (Table.States (704), 321, 145); Add_Goto (Table.States (704), 330, 146); Table.States (704).Kernel := To_Vector ((0 => (326, 38, 0, False))); Table.States (704).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (705), 54, 882); Add_Error (Table.States (705)); Table.States (705).Kernel := To_Vector ((0 => (280, 41, 1, False))); Table.States (705).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 54, 882))); Add_Action (Table.States (706), 34, 883); Add_Error (Table.States (706)); Table.States (706).Kernel := To_Vector (((228, 51, 3, False), (228, 51, 1, False))); Table.States (706).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 34, 883))); Add_Action (Table.States (707), 3, 121); Add_Action (Table.States (707), 39, 122); Add_Action (Table.States (707), 40, 123); Add_Action (Table.States (707), 41, 124); Add_Action (Table.States (707), 76, 126); Add_Action (Table.States (707), 94, 127); Add_Action (Table.States (707), 95, 128); Add_Action (Table.States (707), 103, 129); Add_Action (Table.States (707), 104, 119); Add_Action (Table.States (707), 105, 33); Add_Action (Table.States (707), 106, 34); Add_Error (Table.States (707)); Add_Goto (Table.States (707), 117, 130); Add_Goto (Table.States (707), 128, 41); Add_Goto (Table.States (707), 197, 133); Add_Goto (Table.States (707), 239, 134); Add_Goto (Table.States (707), 258, 135); Add_Goto (Table.States (707), 272, 92); Add_Goto (Table.States (707), 293, 97); Add_Goto (Table.States (707), 301, 884); Add_Goto (Table.States (707), 320, 144); Add_Goto (Table.States (707), 321, 145); Add_Goto (Table.States (707), 330, 146); Table.States (707).Kernel := To_Vector ((0 => (326, 53, 3, False))); Table.States (707).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (708), 15, 885); Add_Action (Table.States (708), 24, Reduce, (150, 1), 0, null, null); Add_Action (Table.States (708), 28, 183); Add_Action (Table.States (708), 41, 886); Add_Action (Table.States (708), 104, 164); Add_Error (Table.States (708)); Add_Goto (Table.States (708), 121, 887); Add_Goto (Table.States (708), 127, 40); Add_Goto (Table.States (708), 146, 888); Add_Goto (Table.States (708), 148, 889); Add_Goto (Table.States (708), 149, 890); Add_Goto (Table.States (708), 150, 891); Add_Goto (Table.States (708), 182, 55); Add_Goto (Table.States (708), 219, 892); Add_Goto (Table.States (708), 281, 94); Add_Goto (Table.States (708), 327, 893); Table.States (708).Kernel := To_Vector ((0 => (280, 54, 2, False))); Table.States (708).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 150, 0))); Add_Action (Table.States (709), 34, 894); Add_Action (Table.States (709), 39, Reduce, (109, 4), 1, null, null); Add_Error (Table.States (709)); Table.States (709).Kernel := To_Vector (((109, 64, 0, False), (228, 64, 3, False), (228, 64, 1, False))); Table.States (709).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 109, 1))); Add_Action (Table.States (710), 36, 895); Add_Action (Table.States (710), 41, Reduce, (111, 3), 1, null, null); Add_Action (Table.States (710), 49, Reduce, (111, 3), 1, null, null); Add_Action (Table.States (710), 54, Reduce, (111, 3), 1, null, null); Add_Action (Table.States (710), 96, 896); Add_Error (Table.States (710)); Table.States (710).Kernel := To_Vector (((111, 65, 1, False), (111, 65, 0, False), (223, 65, 1, False))); Table.States (710).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 111, 1))); Add_Action (Table.States (711), 34, 897); Add_Error (Table.States (711)); Table.States (711).Kernel := To_Vector (((228, 66, 3, False), (228, 66, 1, False))); Table.States (711).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 34, 897))); Add_Action (Table.States (712), 104, 898); Add_Action (Table.States (712), 106, 899); Add_Error (Table.States (712)); Add_Goto (Table.States (712), 180, 900); Add_Goto (Table.States (712), 181, 901); Table.States (712).Kernel := To_Vector ((0 => (183, 76, 2, False))); Table.States (712).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 898))); Add_Action (Table.States (713), 39, 902); Add_Error (Table.States (713)); Table.States (713).Kernel := To_Vector ((0 => (259, 109, 5, False))); Table.States (713).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 902))); Add_Action (Table.States (714), 39, 903); Add_Error (Table.States (714)); Table.States (714).Kernel := To_Vector (((162, 110, 5, False), (162, 110, 2, False))); Table.States (714).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 903))); Add_Action (Table.States (715), 41, 705); Add_Action (Table.States (715), 49, 904); Add_Action (Table.States (715), 54, 708); Add_Error (Table.States (715)); Add_Goto (Table.States (715), 280, 905); Table.States (715).Kernel := To_Vector (((260, 111, 2, False), (326, 111, 2, False))); Table.States (715).Minimal_Complete_Actions := To_Vector (((Shift, 49, 904), (Shift, 41, 705))); Add_Action (Table.States (716), (74, 96), (326, 8), 1, null, null); Table.States (716).Kernel := To_Vector ((0 => (326, 114, 0, False))); Table.States (716).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 1))); Add_Action (Table.States (717), (74, 96), (326, 6), 1, null, null); Table.States (717).Kernel := To_Vector ((0 => (326, 120, 0, False))); Table.States (717).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 1))); Add_Action (Table.States (718), (74, 96), (326, 9), 1, null, null); Table.States (718).Kernel := To_Vector ((0 => (326, 162, 0, False))); Table.States (718).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 1))); Add_Action (Table.States (719), (74, 96), (326, 0), 1, null, null); Table.States (719).Kernel := To_Vector ((0 => (326, 183, 0, False))); Table.States (719).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 1))); Add_Action (Table.States (720), (74, 96), (326, 10), 1, null, null); Table.States (720).Kernel := To_Vector ((0 => (326, 228, 0, False))); Table.States (720).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 1))); Add_Action (Table.States (721), 7, 556); Add_Error (Table.States (721)); Table.States (721).Kernel := To_Vector (((114, 241, 2, False), (114, 241, 3, True), (114, 241, 2, False))); Table.States (721).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 7, 556))); Add_Action (Table.States (722), 74, 337); Add_Action (Table.States (722), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (722)); Add_Goto (Table.States (722), 122, 906); Table.States (722).Kernel := To_Vector ((0 => (206, 326, 1, False))); Table.States (722).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (723), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (331, 0), 5, use_clause_0'Access, null); Table.States (723).Kernel := To_Vector ((0 => (331, 96, 0, False))); Table.States (723).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 331, 5))); Add_Action (Table.States (724), 74, 337); Add_Action (Table.States (724), 76, 235); Add_Action (Table.States (724), 84, 237); Add_Action (Table.States (724), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (724), 101, 239); Add_Action (Table.States (724), 102, 240); Add_Error (Table.States (724)); Add_Goto (Table.States (724), 115, 241); Add_Goto (Table.States (724), 122, 907); Add_Goto (Table.States (724), 322, 242); Table.States (724).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (245, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (724).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (725), 74, 337); Add_Action (Table.States (725), 76, 235); Add_Action (Table.States (725), 84, 237); Add_Action (Table.States (725), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (725), 101, 239); Add_Action (Table.States (725), 102, 240); Add_Error (Table.States (725)); Add_Goto (Table.States (725), 115, 241); Add_Goto (Table.States (725), 122, 908); Add_Goto (Table.States (725), 322, 242); Table.States (725).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (245, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (725).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (726), (104, 105, 106), (208, 0), 1, null, null); Table.States (726).Kernel := To_Vector ((0 => (208, 9, 0, False))); Table.States (726).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 208, 1))); Add_Action (Table.States (727), (104, 105, 106), (208, 1), 1, null, null); Table.States (727).Kernel := To_Vector ((0 => (208, 16, 0, False))); Table.States (727).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 208, 1))); Add_Action (Table.States (728), (29, 50), (270, 0), 1, null, null); Table.States (728).Kernel := To_Vector ((0 => (270, 51, 0, False))); Table.States (728).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 270, 1))); Add_Action (Table.States (729), 104, 119); Add_Action (Table.States (729), 105, 33); Add_Action (Table.States (729), 106, 34); Add_Error (Table.States (729)); Add_Goto (Table.States (729), 128, 41); Add_Goto (Table.States (729), 239, 909); Add_Goto (Table.States (729), 272, 92); Add_Goto (Table.States (729), 293, 97); Table.States (729).Kernel := To_Vector ((0 => (114, 208, 1, False))); Table.States (729).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (730), 29, 910); Add_Action (Table.States (730), 50, 911); Add_Error (Table.States (730)); Table.States (730).Kernel := To_Vector (((114, 270, 1, False), (114, 270, 2, True))); Table.States (730).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 50, 911))); Table.States (730).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (731), 104, 119); Add_Action (Table.States (731), 105, 33); Add_Action (Table.States (731), 106, 34); Add_Error (Table.States (731)); Add_Goto (Table.States (731), 128, 41); Add_Goto (Table.States (731), 239, 912); Add_Goto (Table.States (731), 272, 92); Add_Goto (Table.States (731), 293, 97); Table.States (731).Kernel := To_Vector ((0 => (245, 56, 2, False))); Table.States (731).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (732), 96, 913); Add_Error (Table.States (732)); Table.States (732).Kernel := To_Vector ((0 => (133, 220, 1, False))); Table.States (732).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 913))); Add_Action (Table.States (733), 44, 914); Add_Action (Table.States (733), 104, 915); Add_Action (Table.States (733), 105, 33); Add_Action (Table.States (733), 106, 34); Add_Error (Table.States (733)); Add_Goto (Table.States (733), 128, 41); Add_Goto (Table.States (733), 184, 916); Add_Goto (Table.States (733), 185, 917); Add_Goto (Table.States (733), 239, 918); Add_Goto (Table.States (733), 272, 92); Add_Goto (Table.States (733), 293, 97); Table.States (733).Kernel := To_Vector (((187, 72, 4, False), (187, 72, 2, False))); Table.States (733).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 915))); Add_Action (Table.States (734), (24, 72), (188, 1), 1, null, null); Table.States (734).Kernel := To_Vector ((0 => (188, 187, 0, False))); Table.States (734).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 188, 1))); Add_Action (Table.States (735), 24, Reduce, (189, 0), 1, null, null); Add_Action (Table.States (735), 72, 733); Add_Error (Table.States (735)); Add_Goto (Table.States (735), 187, 919); Table.States (735).Kernel := To_Vector (((188, 188, 3, True), (189, 188, 0, False))); Table.States (735).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 189, 1))); Add_Action (Table.States (736), (1 => 24), (218, 0), 3, handled_sequence_of_statements_0'Access, null); Table.States (736).Kernel := To_Vector ((0 => (218, 189, 0, False))); Table.States (736).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 3))); Add_Action (Table.States (737), (24, 72), (188, 2), 1, null, null); Table.States (737).Kernel := To_Vector ((0 => (188, 257, 0, False))); Table.States (737).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 188, 1))); Add_Action (Table.States (738), 24, 920); Add_Error (Table.States (738)); Table.States (738).Kernel := To_Vector ((0 => (133, 218, 2, False))); Table.States (738).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 920))); Add_Action (Table.States (739), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (739), 104, 149); Add_Error (Table.States (739)); Add_Goto (Table.States (739), 220, 921); Table.States (739).Kernel := To_Vector ((0 => (232, 37, 1, False))); Table.States (739).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (740), 37, 922); Add_Error (Table.States (740)); Table.States (740).Kernel := To_Vector ((0 => (232, 24, 2, False))); Table.States (740).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 37, 922))); Add_Action (Table.States (741), 96, 923); Add_Error (Table.States (741)); Table.States (741).Kernel := To_Vector ((0 => (157, 192, 1, False))); Table.States (741).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 923))); Add_Action (Table.States (742), 41, 924); Add_Error (Table.States (742)); Table.States (742).Kernel := To_Vector (((241, 40, 1, False), (314, 40, 6, False), (314, 40, 2, False))); Table.States (742).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 924))); Add_Action (Table.States (743), 74, 337); Add_Action (Table.States (743), 82, 925); Add_Action (Table.States (743), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (743)); Add_Goto (Table.States (743), 122, 926); Table.States (743).Kernel := To_Vector (((244, 114, 2, False), (244, 114, 1, False))); Table.States (743).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (744), 74, 337); Add_Action (Table.States (744), 82, 927); Add_Action (Table.States (744), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (744)); Add_Goto (Table.States (744), 122, 928); Table.States (744).Kernel := To_Vector (((244, 120, 2, False), (244, 120, 1, False))); Table.States (744).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (745), 74, 337); Add_Action (Table.States (745), 82, 929); Add_Action (Table.States (745), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (745)); Add_Goto (Table.States (745), 122, 930); Table.States (745).Kernel := To_Vector (((244, 314, 2, False), (244, 314, 1, False))); Table.States (745).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); end Subr_13; procedure Subr_14 is begin Add_Action (Table.States (746), (77, 83), (278, 0), 3, null, null); Table.States (746).Kernel := To_Vector ((0 => (278, 277, 0, True))); Table.States (746).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 278, 3))); Table.States (746).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (747), 77, 931); Add_Error (Table.States (747)); Table.States (747).Kernel := To_Vector ((0 => (179, 167, 2, False))); Table.States (747).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 931))); Add_Action (Table.States (748), 96, 932); Add_Error (Table.States (748)); Table.States (748).Kernel := To_Vector ((0 => (179, 122, 1, False))); Table.States (748).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 932))); Add_Action (Table.States (749), 104, 119); Add_Action (Table.States (749), 105, 33); Add_Action (Table.States (749), 106, 34); Add_Error (Table.States (749)); Add_Goto (Table.States (749), 128, 41); Add_Goto (Table.States (749), 239, 933); Add_Goto (Table.States (749), 272, 92); Add_Goto (Table.States (749), 293, 97); Table.States (749).Kernel := To_Vector ((0 => (213, 39, 2, False))); Table.States (749).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (750), 104, 119); Add_Action (Table.States (750), 105, 33); Add_Action (Table.States (750), 106, 34); Add_Error (Table.States (750)); Add_Goto (Table.States (750), 128, 41); Add_Goto (Table.States (750), 239, 934); Add_Goto (Table.States (750), 272, 92); Add_Goto (Table.States (750), 293, 97); Table.States (750).Kernel := To_Vector ((0 => (213, 39, 2, False))); Table.States (750).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (751), 77, 935); Add_Action (Table.States (751), 83, 443); Add_Error (Table.States (751)); Table.States (751).Kernel := To_Vector (((125, 125, 1, True), (256, 125, 1, False))); Table.States (751).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 935))); Add_Action (Table.States (752), 77, 936); Add_Error (Table.States (752)); Table.States (752).Kernel := To_Vector ((0 => (256, 153, 1, False))); Table.States (752).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 936))); Add_Action (Table.States (753), 77, 937); Add_Error (Table.States (753)); Table.States (753).Kernel := To_Vector ((0 => (256, 192, 1, False))); Table.States (753).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 937))); Add_Action (Table.States (754), 96, 938); Add_Error (Table.States (754)); Table.States (754).Kernel := To_Vector ((0 => (193, 122, 1, False))); Table.States (754).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 938))); Add_Action (Table.States (755), 96, 939); Add_Error (Table.States (755)); Table.States (755).Kernel := To_Vector ((0 => (243, 122, 1, False))); Table.States (755).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 939))); Add_Action (Table.States (756), 96, 940); Add_Error (Table.States (756)); Table.States (756).Kernel := To_Vector ((0 => (112, 122, 1, False))); Table.States (756).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 940))); Add_Action (Table.States (757), 96, 941); Add_Error (Table.States (757)); Table.States (757).Kernel := To_Vector ((0 => (308, 122, 1, False))); Table.States (757).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 941))); Add_Action (Table.States (758), 96, 942); Add_Error (Table.States (758)); Table.States (758).Kernel := To_Vector ((0 => (311, 122, 1, False))); Table.States (758).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 942))); Add_Action (Table.States (759), 13, 943); Add_Error (Table.States (759)); Table.States (759).Kernel := To_Vector ((0 => (307, 159, 3, False))); Table.States (759).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 13, 943))); Add_Action (Table.States (760), 24, 944); Add_Error (Table.States (760)); Table.States (760).Kernel := To_Vector ((0 => (113, 218, 2, False))); Table.States (760).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 944))); Add_Action (Table.States (761), 3, 121); Add_Action (Table.States (761), 39, 122); Add_Action (Table.States (761), 40, 261); Add_Action (Table.States (761), 41, 124); Add_Action (Table.States (761), 44, 263); Add_Action (Table.States (761), 52, 125); Add_Action (Table.States (761), 76, 126); Add_Action (Table.States (761), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (761), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (761), 94, 127); Add_Action (Table.States (761), 95, 128); Add_Action (Table.States (761), 103, 129); Add_Action (Table.States (761), 104, 119); Add_Action (Table.States (761), 105, 33); Add_Action (Table.States (761), 106, 34); Add_Error (Table.States (761)); Add_Goto (Table.States (761), 117, 130); Add_Goto (Table.States (761), 128, 41); Add_Goto (Table.States (761), 165, 269); Add_Goto (Table.States (761), 166, 945); Add_Goto (Table.States (761), 191, 599); Add_Goto (Table.States (761), 197, 133); Add_Goto (Table.States (761), 239, 274); Add_Goto (Table.States (761), 258, 135); Add_Goto (Table.States (761), 272, 92); Add_Goto (Table.States (761), 275, 136); Add_Goto (Table.States (761), 277, 276); Add_Goto (Table.States (761), 282, 137); Add_Goto (Table.States (761), 283, 138); Add_Goto (Table.States (761), 284, 139); Add_Goto (Table.States (761), 285, 140); Add_Goto (Table.States (761), 286, 141); Add_Goto (Table.States (761), 287, 142); Add_Goto (Table.States (761), 293, 97); Add_Goto (Table.States (761), 301, 277); Add_Goto (Table.States (761), 320, 144); Add_Goto (Table.States (761), 321, 145); Add_Goto (Table.States (761), 330, 146); Table.States (761).Kernel := To_Vector ((0 => (137, 72, 1, False))); Table.States (761).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 166, 0))); Add_Action (Table.States (762), (77, 83), (138, 1), 1, null, null); Table.States (762).Kernel := To_Vector ((0 => (138, 137, 0, False))); Table.States (762).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 138, 1))); Add_Action (Table.States (763), 77, Reduce, (136, 0), 4, case_expression_0'Access, null); Add_Action (Table.States (763), 83, 946); Add_Error (Table.States (763)); Table.States (763).Kernel := To_Vector (((136, 138, 0, False), (138, 138, 3, True))); Table.States (763).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 136, 4))); Add_Action (Table.States (764), 3, 121); Add_Action (Table.States (764), 39, 122); Add_Action (Table.States (764), 40, 123); Add_Action (Table.States (764), 41, 124); Add_Action (Table.States (764), 52, 125); Add_Action (Table.States (764), 76, 126); Add_Action (Table.States (764), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (764), 94, 127); Add_Action (Table.States (764), 95, 128); Add_Action (Table.States (764), 103, 129); Add_Action (Table.States (764), 104, 119); Add_Action (Table.States (764), 105, 33); Add_Action (Table.States (764), 106, 34); Add_Error (Table.States (764)); Add_Goto (Table.States (764), 117, 130); Add_Goto (Table.States (764), 128, 41); Add_Goto (Table.States (764), 191, 131); Add_Goto (Table.States (764), 192, 947); Add_Goto (Table.States (764), 197, 133); Add_Goto (Table.States (764), 239, 134); Add_Goto (Table.States (764), 258, 135); Add_Goto (Table.States (764), 272, 92); Add_Goto (Table.States (764), 275, 136); Add_Goto (Table.States (764), 282, 137); Add_Goto (Table.States (764), 283, 138); Add_Goto (Table.States (764), 284, 139); Add_Goto (Table.States (764), 285, 140); Add_Goto (Table.States (764), 286, 141); Add_Goto (Table.States (764), 287, 142); Add_Goto (Table.States (764), 293, 97); Add_Goto (Table.States (764), 301, 143); Add_Goto (Table.States (764), 320, 144); Add_Goto (Table.States (764), 321, 145); Add_Goto (Table.States (764), 330, 146); Table.States (764).Kernel := To_Vector ((0 => (273, 87, 0, False))); Table.States (764).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (765), 22, 948); Add_Action (Table.States (765), 23, 949); Add_Action (Table.States (765), 77, Reduce, (221, 3), 4, if_expression_3'Access, null); Add_Error (Table.States (765)); Add_Goto (Table.States (765), 172, 950); Add_Goto (Table.States (765), 173, 951); Table.States (765).Kernel := To_Vector (((221, 192, 3, False), (221, 192, 1, False), (221, 192, 2, False), (221, 192, 0, False))); Table.States (765).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 221, 4))); Add_Action (Table.States (766), 77, 952); Add_Error (Table.States (766)); Table.States (766).Kernel := To_Vector ((0 => (117, 54, 1, False))); Table.States (766).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 952))); Add_Action (Table.States (767), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (117, 1), 5, aggregate_1'Access, null); Table.States (767).Kernel := To_Vector ((0 => (117, 77, 0, False))); Table.States (767).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 117, 5))); Add_Action (Table.States (768), 3, 121); Add_Action (Table.States (768), 39, 122); Add_Action (Table.States (768), 40, 123); Add_Action (Table.States (768), 41, 124); Add_Action (Table.States (768), 52, 125); Add_Action (Table.States (768), 76, 126); Add_Action (Table.States (768), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (768), 94, 127); Add_Action (Table.States (768), 95, 128); Add_Action (Table.States (768), 103, 129); Add_Action (Table.States (768), 104, 119); Add_Action (Table.States (768), 105, 33); Add_Action (Table.States (768), 106, 34); Add_Error (Table.States (768)); Add_Goto (Table.States (768), 117, 130); Add_Goto (Table.States (768), 128, 41); Add_Goto (Table.States (768), 191, 131); Add_Goto (Table.States (768), 192, 953); Add_Goto (Table.States (768), 197, 133); Add_Goto (Table.States (768), 239, 134); Add_Goto (Table.States (768), 258, 135); Add_Goto (Table.States (768), 272, 92); Add_Goto (Table.States (768), 275, 136); Add_Goto (Table.States (768), 282, 137); Add_Goto (Table.States (768), 283, 138); Add_Goto (Table.States (768), 284, 139); Add_Goto (Table.States (768), 285, 140); Add_Goto (Table.States (768), 286, 141); Add_Goto (Table.States (768), 287, 142); Add_Goto (Table.States (768), 293, 97); Add_Goto (Table.States (768), 301, 143); Add_Goto (Table.States (768), 320, 144); Add_Goto (Table.States (768), 321, 145); Add_Goto (Table.States (768), 330, 146); Table.States (768).Kernel := To_Vector ((0 => (277, 76, 1, False))); Table.States (768).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (769), 4, 1); Add_Action (Table.States (769), 5, 2); Add_Action (Table.States (769), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (769), 15, 3); Add_Action (Table.States (769), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (769), 18, 4); Add_Action (Table.States (769), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (769), 27, 5); Add_Action (Table.States (769), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (769), 31, 9); Add_Action (Table.States (769), 32, 10); Add_Action (Table.States (769), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (769), 41, 13); Add_Action (Table.States (769), 48, 16); Add_Action (Table.States (769), 52, 20); Add_Action (Table.States (769), 57, 21); Add_Action (Table.States (769), 58, 22); Add_Action (Table.States (769), 61, 24); Add_Action (Table.States (769), 72, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (769), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (769), 93, 31); Add_Action (Table.States (769), 104, 360); Add_Action (Table.States (769), 105, 33); Add_Action (Table.States (769), 106, 34); Add_Error (Table.States (769)); Add_Goto (Table.States (769), 113, 36); Add_Goto (Table.States (769), 123, 38); Add_Goto (Table.States (769), 126, 39); Add_Goto (Table.States (769), 128, 41); Add_Goto (Table.States (769), 131, 42); Add_Goto (Table.States (769), 132, 43); Add_Goto (Table.States (769), 133, 44); Add_Goto (Table.States (769), 139, 47); Add_Goto (Table.States (769), 151, 50); Add_Goto (Table.States (769), 152, 51); Add_Goto (Table.States (769), 161, 53); Add_Goto (Table.States (769), 190, 57); Add_Goto (Table.States (769), 196, 59); Add_Goto (Table.States (769), 217, 68); Add_Goto (Table.States (769), 222, 70); Add_Goto (Table.States (769), 232, 72); Add_Goto (Table.States (769), 239, 73); Add_Goto (Table.States (769), 257, 83); Add_Goto (Table.States (769), 261, 86); Add_Goto (Table.States (769), 272, 92); Add_Goto (Table.States (769), 276, 93); Add_Goto (Table.States (769), 290, 96); Add_Goto (Table.States (769), 293, 97); Add_Goto (Table.States (769), 294, 98); Add_Goto (Table.States (769), 298, 99); Add_Goto (Table.States (769), 299, 361); Add_Goto (Table.States (769), 300, 954); Add_Goto (Table.States (769), 302, 100); Add_Goto (Table.States (769), 303, 101); Add_Goto (Table.States (769), 306, 363); Add_Goto (Table.States (769), 323, 114); Table.States (769).Kernel := To_Vector ((0 => (140, 87, 0, False))); Table.States (769).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (770), 96, 955); Add_Error (Table.States (770)); Table.States (770).Kernel := To_Vector ((0 => (139, 15, 1, False))); Table.States (770).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 955))); Add_Action (Table.States (771), (10, 20, 21, 22, 23, 35, 37, 43, 53, 68, 74, 75, 77, 79, 83, 87, 96), (233, 0), 3, null, null); Table.States (771).Kernel := To_Vector ((0 => (233, 234, 0, True))); Table.States (771).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 233, 3))); Table.States (771).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (772), 10, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 21, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 37, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 42, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 53, 618); Add_Action (Table.States (772), 74, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 76, 619); Add_Action (Table.States (772), 77, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 82, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 83, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 84, 237); Add_Action (Table.States (772), 87, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 96, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (772), 101, 239); Add_Action (Table.States (772), 102, 240); Add_Error (Table.States (772)); Add_Goto (Table.States (772), 115, 241); Add_Goto (Table.States (772), 155, 956); Add_Goto (Table.States (772), 224, 621); Add_Goto (Table.States (772), 322, 242); Table.States (772).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (314, 239, 4, False), (314, 239, 0, False))); Table.States (772).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 314, 3))); Add_Action (Table.States (773), (10, 21, 37, 42, 74, 77, 82, 83, 87, 96), (155, 0), 2, null, null); Table.States (773).Kernel := To_Vector ((0 => (155, 277, 0, False))); Table.States (773).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 155, 2))); Add_Action (Table.States (774), 39, 122); Add_Action (Table.States (774), 41, 957); Add_Action (Table.States (774), 76, 126); Add_Action (Table.States (774), 103, 129); Add_Action (Table.States (774), 104, 119); Add_Action (Table.States (774), 105, 33); Add_Action (Table.States (774), 106, 34); Add_Error (Table.States (774)); Add_Goto (Table.States (774), 117, 130); Add_Goto (Table.States (774), 128, 41); Add_Goto (Table.States (774), 239, 134); Add_Goto (Table.States (774), 258, 256); Add_Goto (Table.States (774), 272, 92); Add_Goto (Table.States (774), 293, 97); Table.States (774).Kernel := To_Vector (((165, 40, 2, False), (197, 40, 1, False), (314, 40, 6, False), (314, 40, 2, False))); Table.States (774).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (775), (77, 83), (168, 1), 1, null, null); Table.States (775).Kernel := To_Vector ((0 => (168, 167, 0, False))); Table.States (775).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 168, 1))); Add_Action (Table.States (776), 77, 958); Add_Action (Table.States (776), 83, 959); Add_Error (Table.States (776)); Table.States (776).Kernel := To_Vector (((168, 168, 2, True), (224, 168, 1, False))); Table.States (776).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 958))); Add_Action (Table.States (777), 77, Reduce, (167, 1), 1, null, null); Add_Conflict (Table.States (777), 77, (278, 1), 1, null, null); Add_Action (Table.States (777), 79, Reduce, (165, 2), 1, null, null); Add_Action (Table.States (777), 83, Reduce, (167, 1), 1, null, null); Add_Conflict (Table.States (777), 83, (278, 1), 1, null, null); Add_Action (Table.States (777), 87, Reduce, (165, 2), 1, null, null); Add_Error (Table.States (777)); Table.States (777).Kernel := To_Vector (((165, 277, 0, False), (167, 277, 0, False), (278, 277, 0, False))); Table.States (777).Minimal_Complete_Actions := To_Vector (((Reduce, 165, 1), (Reduce, 167, 1), (Reduce, 278, 1))); Add_Action (Table.States (778), 104, 119); Add_Action (Table.States (778), 105, 33); Add_Action (Table.States (778), 106, 34); Add_Error (Table.States (778)); Add_Goto (Table.States (778), 128, 41); Add_Goto (Table.States (778), 239, 960); Add_Goto (Table.States (778), 272, 92); Add_Goto (Table.States (778), 293, 97); Table.States (778).Kernel := To_Vector ((0 => (230, 59, 1, False))); Table.States (778).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (779), 37, Reduce, (230, 1), 5, null, null); Add_Action (Table.States (779), 76, 235); Add_Action (Table.States (779), 84, 237); Add_Action (Table.States (779), 87, Reduce, (230, 1), 5, null, null); Add_Action (Table.States (779), 101, 239); Add_Action (Table.States (779), 102, 240); Add_Error (Table.States (779)); Add_Goto (Table.States (779), 115, 241); Add_Goto (Table.States (779), 322, 242); Table.States (779).Kernel := To_Vector (((128, 239, 2, True), (230, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (779).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 5))); Add_Action (Table.States (780), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (127, 0), 6, at_clause_0'Access, null); Table.States (780).Kernel := To_Vector ((0 => (127, 96, 0, False))); Table.States (780).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 127, 6))); Add_Action (Table.States (781), 3, 121); Add_Action (Table.States (781), 39, 122); Add_Action (Table.States (781), 40, 123); Add_Action (Table.States (781), 41, 124); Add_Action (Table.States (781), 52, 125); Add_Action (Table.States (781), 76, 126); Add_Action (Table.States (781), 94, 127); Add_Action (Table.States (781), 95, 128); Add_Action (Table.States (781), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (781), 103, 129); Add_Action (Table.States (781), 104, 119); Add_Action (Table.States (781), 105, 33); Add_Action (Table.States (781), 106, 34); Add_Error (Table.States (781)); Add_Goto (Table.States (781), 117, 130); Add_Goto (Table.States (781), 128, 41); Add_Goto (Table.States (781), 191, 131); Add_Goto (Table.States (781), 192, 961); Add_Goto (Table.States (781), 197, 133); Add_Goto (Table.States (781), 239, 134); Add_Goto (Table.States (781), 258, 135); Add_Goto (Table.States (781), 272, 92); Add_Goto (Table.States (781), 275, 136); Add_Goto (Table.States (781), 282, 137); Add_Goto (Table.States (781), 283, 138); Add_Goto (Table.States (781), 284, 139); Add_Goto (Table.States (781), 285, 140); Add_Goto (Table.States (781), 286, 141); Add_Goto (Table.States (781), 287, 142); Add_Goto (Table.States (781), 293, 97); Add_Goto (Table.States (781), 301, 143); Add_Goto (Table.States (781), 320, 144); Add_Goto (Table.States (781), 321, 145); Add_Goto (Table.States (781), 330, 146); Table.States (781).Kernel := To_Vector ((0 => (235, 38, 1, False))); Table.States (781).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (782), 12, 962); Add_Error (Table.States (782)); Table.States (782).Kernel := To_Vector ((0 => (144, 104, 7, False))); Table.States (782).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 12, 962))); Add_Action (Table.States (783), (24, 104), (145, 1), 1, null, null); Table.States (783).Kernel := To_Vector ((0 => (145, 144, 0, False))); Table.States (783).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 145, 1))); Add_Action (Table.States (784), 24, 963); Add_Action (Table.States (784), 104, 782); Add_Error (Table.States (784)); Add_Goto (Table.States (784), 144, 964); Table.States (784).Kernel := To_Vector (((145, 145, 8, True), (281, 145, 3, False))); Table.States (784).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 963))); Add_Action (Table.States (785), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (785), 33, 504); Add_Action (Table.States (785), 40, 386); Add_Conflict (Table.States (785), 40, (236, 3), 0, null, null); Add_Action (Table.States (785), 45, 505); Add_Action (Table.States (785), 104, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (785), 105, Reduce, (236, 3), 0, null, null); Add_Action (Table.States (785), 106, Reduce, (236, 3), 0, null, null); Add_Error (Table.States (785)); Add_Goto (Table.States (785), 114, 965); Add_Goto (Table.States (785), 236, 966); Add_Goto (Table.States (785), 241, 721); Table.States (785).Kernel := To_Vector (((254, 118, 2, False), (254, 118, 1, False), (254, 118, 3, False), (254, 118, 2, False))); Table.States (785).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 236, 0))); Add_Action (Table.States (786), (77, 96), (255, 0), 3, parameter_specification_list_0'Access, null); Table.States (786).Kernel := To_Vector ((0 => (255, 254, 0, True))); Table.States (786).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 255, 3))); Table.States (786).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (787), 96, 967); Add_Error (Table.States (787)); Table.States (787).Kernel := To_Vector ((0 => (215, 122, 1, False))); Table.States (787).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 967))); Add_Action (Table.States (788), 96, 968); Add_Error (Table.States (788)); Table.States (788).Kernel := To_Vector ((0 => (215, 122, 1, False))); Table.States (788).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 968))); Add_Action (Table.States (789), 96, 969); Add_Error (Table.States (789)); Table.States (789).Kernel := To_Vector ((0 => (215, 122, 1, False))); Table.States (789).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 969))); Add_Action (Table.States (790), 36, 970); Add_Action (Table.States (790), 39, Reduce, (109, 2), 1, null, null); Add_Action (Table.States (790), 64, 875); Add_Action (Table.States (790), 65, 876); Add_Error (Table.States (790)); Table.States (790).Kernel := To_Vector (((109, 6, 1, False), (109, 6, 1, False), (109, 6, 0, False), (111, 6, 2, False), (111, 6, 1, False))); Table.States (790).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 109, 1))); Add_Action (Table.States (791), 80, 971); Add_Error (Table.States (791)); Table.States (791).Kernel := To_Vector (((202, 19, 3, False), (202, 19, 1, False))); Table.States (791).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 971))); Add_Action (Table.States (792), 80, 972); Add_Error (Table.States (792)); Table.States (792).Kernel := To_Vector ((0 => (202, 20, 1, False))); Table.States (792).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 972))); Add_Action (Table.States (793), 34, 880); Add_Action (Table.States (793), 39, Reduce, (109, 3), 1, null, null); Add_Action (Table.States (793), 49, Reduce, (111, 4), 1, null, null); Add_Error (Table.States (793)); Table.States (793).Kernel := To_Vector (((109, 36, 0, False), (111, 36, 0, False), (228, 36, 3, False), (228, 36, 1, False))); Table.States (793).Minimal_Complete_Actions := To_Vector (((Reduce, 109, 1), (Reduce, 111, 1))); Add_Action (Table.States (794), 80, 973); Add_Error (Table.States (794)); Table.States (794).Kernel := To_Vector ((0 => (202, 38, 1, False))); Table.States (794).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 973))); Add_Action (Table.States (795), 80, 974); Add_Error (Table.States (795)); Table.States (795).Kernel := To_Vector ((0 => (202, 53, 1, False))); Table.States (795).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 974))); Add_Action (Table.States (796), 36, 895); Add_Action (Table.States (796), 49, Reduce, (111, 3), 1, null, null); Add_Action (Table.States (796), 74, 337); Add_Action (Table.States (796), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (796)); Add_Goto (Table.States (796), 122, 975); Table.States (796).Kernel := To_Vector (((111, 65, 1, False), (111, 65, 0, False), (201, 65, 1, False))); Table.States (796).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 111, 1))); Add_Action (Table.States (797), 80, 976); Add_Error (Table.States (797)); Table.States (797).Kernel := To_Vector ((0 => (202, 76, 2, False))); Table.States (797).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 976))); Add_Action (Table.States (798), 39, 977); Add_Error (Table.States (798)); Table.States (798).Kernel := To_Vector (((203, 109, 4, False), (203, 109, 2, False))); Table.States (798).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 39, 977))); Add_Action (Table.States (799), 49, 978); Add_Error (Table.States (799)); Table.States (799).Kernel := To_Vector ((0 => (202, 111, 1, False))); Table.States (799).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 49, 978))); Add_Action (Table.States (800), (74, 96), (202, 9), 1, null, null); Table.States (800).Kernel := To_Vector ((0 => (202, 114, 0, False))); Table.States (800).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 1))); Add_Action (Table.States (801), (74, 96), (202, 8), 1, null, null); Table.States (801).Kernel := To_Vector ((0 => (202, 120, 0, False))); Table.States (801).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 1))); Add_Action (Table.States (802), 74, 337); Add_Action (Table.States (802), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (802)); Add_Goto (Table.States (802), 122, 979); Table.States (802).Kernel := To_Vector ((0 => (201, 202, 1, False))); Table.States (802).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (803), (74, 96), (202, 1), 1, null, null); Table.States (803).Kernel := To_Vector ((0 => (202, 203, 0, False))); Table.States (803).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 1))); Add_Action (Table.States (804), (74, 96), (202, 10), 1, null, null); Table.States (804).Kernel := To_Vector ((0 => (202, 228, 0, False))); Table.States (804).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 1))); Add_Action (Table.States (805), (29, 47, 48, 50, 69, 71, 74, 104), (201, 2), 5, formal_type_declaration_2'Access, null); Table.States (805).Kernel := To_Vector ((0 => (201, 96, 0, False))); Table.States (805).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 201, 5))); Add_Action (Table.States (806), 104, 119); Add_Action (Table.States (806), 105, 33); Add_Action (Table.States (806), 106, 34); Add_Error (Table.States (806)); Add_Goto (Table.States (806), 128, 41); Add_Goto (Table.States (806), 239, 980); Add_Goto (Table.States (806), 272, 92); Add_Goto (Table.States (806), 293, 97); Table.States (806).Kernel := To_Vector ((0 => (204, 39, 2, False))); Table.States (806).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (807), 96, 981); Add_Error (Table.States (807)); Table.States (807).Kernel := To_Vector ((0 => (200, 122, 1, False))); Table.States (807).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 981))); Add_Action (Table.States (808), 74, 337); Add_Action (Table.States (808), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (808)); Add_Goto (Table.States (808), 122, 982); Table.States (808).Kernel := To_Vector ((0 => (200, 310, 1, False))); Table.States (808).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (809), 96, 983); Add_Error (Table.States (809)); Table.States (809).Kernel := To_Vector ((0 => (200, 122, 1, False))); Table.States (809).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 983))); Add_Action (Table.States (810), 3, 121); Add_Action (Table.States (810), 39, 122); Add_Action (Table.States (810), 40, 123); Add_Action (Table.States (810), 41, 124); Add_Action (Table.States (810), 52, 125); Add_Action (Table.States (810), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (810), 76, 126); Add_Action (Table.States (810), 94, 127); Add_Action (Table.States (810), 95, 128); Add_Action (Table.States (810), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (810), 103, 129); Add_Action (Table.States (810), 104, 119); Add_Action (Table.States (810), 105, 33); Add_Action (Table.States (810), 106, 34); Add_Error (Table.States (810)); Add_Goto (Table.States (810), 117, 130); Add_Goto (Table.States (810), 128, 41); Add_Goto (Table.States (810), 191, 131); Add_Goto (Table.States (810), 192, 984); Add_Goto (Table.States (810), 197, 133); Add_Goto (Table.States (810), 239, 134); Add_Goto (Table.States (810), 258, 135); Add_Goto (Table.States (810), 272, 92); Add_Goto (Table.States (810), 275, 136); Add_Goto (Table.States (810), 282, 137); Add_Goto (Table.States (810), 283, 138); Add_Goto (Table.States (810), 284, 139); Add_Goto (Table.States (810), 285, 140); Add_Goto (Table.States (810), 286, 141); Add_Goto (Table.States (810), 287, 142); Add_Goto (Table.States (810), 293, 97); Add_Goto (Table.States (810), 301, 143); Add_Goto (Table.States (810), 320, 144); Add_Goto (Table.States (810), 321, 145); Add_Goto (Table.States (810), 330, 146); Table.States (810).Kernel := To_Vector ((0 => (198, 82, 1, False))); Table.States (810).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (811), 96, 985); Add_Error (Table.States (811)); Table.States (811).Kernel := To_Vector ((0 => (198, 122, 1, False))); Table.States (811).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 985))); Add_Action (Table.States (812), 74, 337); Add_Action (Table.States (812), 76, 235); Add_Action (Table.States (812), 82, 986); Add_Action (Table.States (812), 84, 237); Add_Action (Table.States (812), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (812), 101, 239); Add_Action (Table.States (812), 102, 240); Add_Error (Table.States (812)); Add_Goto (Table.States (812), 115, 241); Add_Goto (Table.States (812), 122, 987); Add_Goto (Table.States (812), 322, 242); Table.States (812).Kernel := To_Vector (((128, 239, 2, True), (198, 239, 2, False), (198, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (812).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (813), 24, 988); Add_Error (Table.States (813)); Table.States (813).Kernel := To_Vector ((0 => (222, 300, 3, False))); Table.States (813).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 988))); Add_Action (Table.States (814), 68, 989); Add_Error (Table.States (814)); Table.States (814).Kernel := To_Vector ((0 => (174, 192, 1, False))); Table.States (814).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 989))); Add_Action (Table.States (815), 96, 990); Add_Error (Table.States (815)); Table.States (815).Kernel := To_Vector ((0 => (222, 32, 1, False))); Table.States (815).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 990))); Add_Action (Table.States (816), 4, 1); Add_Action (Table.States (816), 5, 2); Add_Action (Table.States (816), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (816), 15, 3); Add_Action (Table.States (816), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (816), 18, 4); Add_Action (Table.States (816), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (816), 27, 5); Add_Action (Table.States (816), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (816), 31, 9); Add_Action (Table.States (816), 32, 10); Add_Action (Table.States (816), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (816), 41, 13); Add_Action (Table.States (816), 48, 16); Add_Action (Table.States (816), 52, 20); Add_Action (Table.States (816), 57, 21); Add_Action (Table.States (816), 58, 22); Add_Action (Table.States (816), 61, 24); Add_Action (Table.States (816), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (816), 93, 31); Add_Action (Table.States (816), 104, 360); Add_Action (Table.States (816), 105, 33); Add_Action (Table.States (816), 106, 34); Add_Error (Table.States (816)); Add_Goto (Table.States (816), 113, 36); Add_Goto (Table.States (816), 123, 38); Add_Goto (Table.States (816), 126, 39); Add_Goto (Table.States (816), 128, 41); Add_Goto (Table.States (816), 131, 42); Add_Goto (Table.States (816), 132, 43); Add_Goto (Table.States (816), 133, 44); Add_Goto (Table.States (816), 139, 47); Add_Goto (Table.States (816), 151, 50); Add_Goto (Table.States (816), 152, 51); Add_Goto (Table.States (816), 161, 53); Add_Goto (Table.States (816), 190, 57); Add_Goto (Table.States (816), 196, 59); Add_Goto (Table.States (816), 217, 68); Add_Goto (Table.States (816), 222, 70); Add_Goto (Table.States (816), 232, 72); Add_Goto (Table.States (816), 239, 73); Add_Goto (Table.States (816), 257, 83); Add_Goto (Table.States (816), 261, 86); Add_Goto (Table.States (816), 272, 92); Add_Goto (Table.States (816), 276, 93); Add_Goto (Table.States (816), 290, 96); Add_Goto (Table.States (816), 293, 97); Add_Goto (Table.States (816), 294, 98); Add_Goto (Table.States (816), 298, 99); Add_Goto (Table.States (816), 299, 361); Add_Goto (Table.States (816), 300, 991); Add_Goto (Table.States (816), 302, 100); Add_Goto (Table.States (816), 303, 101); Add_Goto (Table.States (816), 306, 363); Add_Goto (Table.States (816), 323, 114); Table.States (816).Kernel := To_Vector ((0 => (222, 22, 3, False))); Table.States (816).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (817), 32, 992); Add_Error (Table.States (817)); Table.States (817).Kernel := To_Vector ((0 => (222, 24, 2, False))); Table.States (817).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 32, 992))); Add_Action (Table.States (818), (22, 23, 24), (175, 0), 2, null, null); Table.States (818).Kernel := To_Vector ((0 => (175, 174, 0, True))); Table.States (818).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 175, 2))); Table.States (818).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (819), 96, 993); Add_Error (Table.States (819)); Table.States (819).Kernel := To_Vector ((0 => (248, 122, 1, False))); Table.States (819).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 993))); Add_Action (Table.States (820), 13, 994); Add_Action (Table.States (820), 24, 995); Add_Error (Table.States (820)); Table.States (820).Kernel := To_Vector (((247, 159, 3, False), (247, 159, 2, False))); Table.States (820).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 995))); end Subr_14; procedure Subr_15 is begin Add_Action (Table.States (821), 96, 996); Add_Error (Table.States (821)); Table.States (821).Kernel := To_Vector ((0 => (213, 122, 1, False))); Table.States (821).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 996))); Add_Action (Table.States (822), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (250, 0), 6, package_renaming_declaration_0'Access, null); Table.States (822).Kernel := To_Vector ((0 => (250, 96, 0, False))); Table.States (822).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 250, 6))); Add_Action (Table.States (823), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (823), 104, 119); Add_Action (Table.States (823), 105, 33); Add_Action (Table.States (823), 106, 34); Add_Error (Table.States (823)); Add_Goto (Table.States (823), 128, 41); Add_Goto (Table.States (823), 239, 630); Add_Goto (Table.States (823), 240, 997); Add_Goto (Table.States (823), 272, 92); Add_Goto (Table.States (823), 293, 97); Table.States (823).Kernel := To_Vector ((0 => (251, 24, 0, False))); Table.States (823).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (824), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (824), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (824), 28, 183); Add_Action (Table.States (824), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (824), 30, 8); Add_Action (Table.States (824), 40, 12); Add_Action (Table.States (824), 46, 14); Add_Action (Table.States (824), 47, 15); Add_Action (Table.States (824), 48, 16); Add_Action (Table.States (824), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (824), 51, 19); Add_Action (Table.States (824), 63, 25); Add_Action (Table.States (824), 66, 26); Add_Action (Table.States (824), 69, 27); Add_Action (Table.States (824), 71, 28); Add_Action (Table.States (824), 104, 185); Add_Error (Table.States (824)); Add_Goto (Table.States (824), 112, 35); Add_Goto (Table.States (824), 121, 37); Add_Goto (Table.States (824), 127, 40); Add_Goto (Table.States (824), 134, 45); Add_Goto (Table.States (824), 135, 46); Add_Goto (Table.States (824), 157, 391); Add_Goto (Table.States (824), 158, 392); Add_Goto (Table.States (824), 159, 998); Add_Goto (Table.States (824), 179, 54); Add_Goto (Table.States (824), 182, 55); Add_Goto (Table.States (824), 186, 56); Add_Goto (Table.States (824), 193, 58); Add_Goto (Table.States (824), 206, 60); Add_Goto (Table.States (824), 207, 61); Add_Goto (Table.States (824), 209, 62); Add_Goto (Table.States (824), 210, 63); Add_Goto (Table.States (824), 213, 64); Add_Goto (Table.States (824), 214, 65); Add_Goto (Table.States (824), 215, 66); Add_Goto (Table.States (824), 216, 67); Add_Goto (Table.States (824), 219, 69); Add_Goto (Table.States (824), 223, 71); Add_Goto (Table.States (824), 243, 74); Add_Goto (Table.States (824), 244, 75); Add_Goto (Table.States (824), 245, 76); Add_Goto (Table.States (824), 246, 77); Add_Goto (Table.States (824), 247, 78); Add_Goto (Table.States (824), 248, 79); Add_Goto (Table.States (824), 249, 80); Add_Goto (Table.States (824), 250, 81); Add_Goto (Table.States (824), 251, 82); Add_Goto (Table.States (824), 257, 394); Add_Goto (Table.States (824), 259, 84); Add_Goto (Table.States (824), 260, 85); Add_Goto (Table.States (824), 262, 87); Add_Goto (Table.States (824), 263, 88); Add_Goto (Table.States (824), 264, 89); Add_Goto (Table.States (824), 265, 90); Add_Goto (Table.States (824), 271, 91); Add_Goto (Table.States (824), 281, 94); Add_Goto (Table.States (824), 289, 95); Add_Goto (Table.States (824), 304, 102); Add_Goto (Table.States (824), 305, 103); Add_Goto (Table.States (824), 307, 105); Add_Goto (Table.States (824), 308, 106); Add_Goto (Table.States (824), 309, 107); Add_Goto (Table.States (824), 311, 108); Add_Goto (Table.States (824), 313, 109); Add_Goto (Table.States (824), 316, 111); Add_Goto (Table.States (824), 317, 112); Add_Goto (Table.States (824), 319, 113); Add_Goto (Table.States (824), 325, 115); Add_Goto (Table.States (824), 331, 116); Table.States (824).Kernel := To_Vector ((0 => (251, 49, 1, False))); Table.States (824).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (825), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (257, 0), 6, pragma_g_0'Access, null); Table.States (825).Kernel := To_Vector ((0 => (257, 96, 0, False))); Table.States (825).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 257, 6))); Add_Action (Table.States (826), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (257, 1), 6, pragma_g_1'Access, null); Table.States (826).Kernel := To_Vector ((0 => (257, 96, 0, False))); Table.States (826).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 257, 6))); Add_Action (Table.States (827), 96, 999); Add_Error (Table.States (827)); Table.States (827).Kernel := To_Vector ((0 => (265, 122, 1, False))); Table.States (827).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 999))); Add_Action (Table.States (828), 104, 1000); Add_Error (Table.States (828)); Table.States (828).Kernel := To_Vector ((0 => (176, 25, 6, False))); Table.States (828).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 1000))); Add_Action (Table.States (829), (24, 25, 28, 29, 40, 46, 50), (267, 5), 1, null, null); Table.States (829).Kernel := To_Vector ((0 => (267, 121, 0, False))); Table.States (829).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (830), (24, 25, 28, 29, 40, 46, 50), (267, 2), 1, null, null); Table.States (830).Kernel := To_Vector ((0 => (267, 176, 0, False))); Table.States (830).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (831), (24, 25, 28, 29, 40, 46, 50), (267, 3), 1, null, null); Table.States (831).Kernel := To_Vector ((0 => (267, 193, 0, False))); Table.States (831).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (832), (24, 25, 28, 29, 40, 46, 50), (267, 4), 1, null, null); Table.States (832).Kernel := To_Vector ((0 => (267, 243, 0, False))); Table.States (832).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (833), 29, 7); Add_Action (Table.States (833), 50, 18); Add_Error (Table.States (833)); Add_Goto (Table.States (833), 207, 246); Add_Goto (Table.States (833), 262, 247); Add_Goto (Table.States (833), 312, 1001); Table.States (833).Kernel := To_Vector (((193, 246, 7, False), (243, 246, 5, False), (307, 246, 6, False), (309, 246, 3, False))); Table.States (833).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 50, 18))); Add_Action (Table.States (834), (24, 25, 28, 29, 40, 46, 50), (268, 1), 1, null, null); Table.States (834).Kernel := To_Vector ((0 => (268, 267, 0, False))); Table.States (834).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 268, 1))); Add_Action (Table.States (835), 24, Reduce, (269, 0), 1, null, null); Add_Action (Table.States (835), 25, 828); Add_Action (Table.States (835), 28, 183); Add_Action (Table.States (835), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (835), 40, 12); Add_Action (Table.States (835), 46, 14); Add_Action (Table.States (835), 50, Reduce, (246, 2), 0, null, null); Add_Error (Table.States (835)); Add_Goto (Table.States (835), 121, 829); Add_Goto (Table.States (835), 127, 40); Add_Goto (Table.States (835), 176, 830); Add_Goto (Table.States (835), 182, 55); Add_Goto (Table.States (835), 193, 831); Add_Goto (Table.States (835), 207, 61); Add_Goto (Table.States (835), 243, 832); Add_Goto (Table.States (835), 246, 833); Add_Goto (Table.States (835), 262, 87); Add_Goto (Table.States (835), 267, 1002); Add_Goto (Table.States (835), 281, 94); Add_Goto (Table.States (835), 307, 837); Add_Goto (Table.States (835), 309, 838); Table.States (835).Kernel := To_Vector (((268, 268, 3, True), (269, 268, 0, False))); Table.States (835).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 269, 1))); Add_Action (Table.States (836), 24, 1003); Add_Error (Table.States (836)); Table.States (836).Kernel := To_Vector ((0 => (264, 269, 2, False))); Table.States (836).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1003))); Add_Action (Table.States (837), (24, 25, 28, 29, 40, 46, 50), (267, 1), 1, null, null); Table.States (837).Kernel := To_Vector ((0 => (267, 307, 0, False))); Table.States (837).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (838), (24, 25, 28, 29, 40, 46, 50), (267, 0), 1, null, null); Table.States (838).Kernel := To_Vector ((0 => (267, 309, 0, False))); Table.States (838).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 267, 1))); Add_Action (Table.States (839), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (839), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (839), 28, 183); Add_Action (Table.States (839), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (839), 30, 8); Add_Action (Table.States (839), 39, 1004); Add_Action (Table.States (839), 40, 12); Add_Action (Table.States (839), 46, 14); Add_Action (Table.States (839), 47, 15); Add_Action (Table.States (839), 48, 16); Add_Action (Table.States (839), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (839), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (839), 51, 19); Add_Action (Table.States (839), 63, 25); Add_Action (Table.States (839), 66, 26); Add_Action (Table.States (839), 69, 27); Add_Action (Table.States (839), 71, 28); Add_Action (Table.States (839), 104, 185); Add_Error (Table.States (839)); Add_Goto (Table.States (839), 112, 35); Add_Goto (Table.States (839), 121, 37); Add_Goto (Table.States (839), 127, 40); Add_Goto (Table.States (839), 134, 45); Add_Goto (Table.States (839), 135, 46); Add_Goto (Table.States (839), 157, 391); Add_Goto (Table.States (839), 158, 392); Add_Goto (Table.States (839), 159, 667); Add_Goto (Table.States (839), 179, 54); Add_Goto (Table.States (839), 182, 55); Add_Goto (Table.States (839), 186, 56); Add_Goto (Table.States (839), 193, 58); Add_Goto (Table.States (839), 206, 60); Add_Goto (Table.States (839), 207, 61); Add_Goto (Table.States (839), 209, 62); Add_Goto (Table.States (839), 210, 63); Add_Goto (Table.States (839), 213, 64); Add_Goto (Table.States (839), 214, 65); Add_Goto (Table.States (839), 215, 66); Add_Goto (Table.States (839), 216, 67); Add_Goto (Table.States (839), 219, 69); Add_Goto (Table.States (839), 223, 71); Add_Goto (Table.States (839), 243, 74); Add_Goto (Table.States (839), 244, 75); Add_Goto (Table.States (839), 245, 76); Add_Goto (Table.States (839), 246, 77); Add_Goto (Table.States (839), 247, 78); Add_Goto (Table.States (839), 248, 79); Add_Goto (Table.States (839), 249, 80); Add_Goto (Table.States (839), 250, 81); Add_Goto (Table.States (839), 251, 82); Add_Goto (Table.States (839), 257, 394); Add_Goto (Table.States (839), 259, 84); Add_Goto (Table.States (839), 260, 85); Add_Goto (Table.States (839), 262, 87); Add_Goto (Table.States (839), 263, 88); Add_Goto (Table.States (839), 264, 89); Add_Goto (Table.States (839), 265, 90); Add_Goto (Table.States (839), 266, 1005); Add_Goto (Table.States (839), 271, 91); Add_Goto (Table.States (839), 281, 94); Add_Goto (Table.States (839), 289, 95); Add_Goto (Table.States (839), 304, 102); Add_Goto (Table.States (839), 305, 103); Add_Goto (Table.States (839), 307, 105); Add_Goto (Table.States (839), 308, 106); Add_Goto (Table.States (839), 309, 107); Add_Goto (Table.States (839), 311, 108); Add_Goto (Table.States (839), 313, 109); Add_Goto (Table.States (839), 316, 111); Add_Goto (Table.States (839), 317, 112); Add_Goto (Table.States (839), 319, 113); Add_Goto (Table.States (839), 325, 115); Add_Goto (Table.States (839), 331, 116); Table.States (839).Kernel := To_Vector (((271, 35, 5, False), (271, 35, 2, False))); Table.States (839).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (840), 10, 1006); Add_Action (Table.States (840), 74, 1007); Add_Error (Table.States (840)); Table.States (840).Kernel := To_Vector (((227, 227, 2, True), (304, 227, 3, False))); Table.States (840).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1007))); Add_Action (Table.States (841), 10, Reduce, (227, 1), 1, interface_list_1'Access, null); Add_Action (Table.States (841), 74, Reduce, (227, 1), 1, interface_list_1'Access, null); Add_Action (Table.States (841), 76, 235); Add_Action (Table.States (841), 84, 237); Add_Action (Table.States (841), 96, Reduce, (227, 1), 1, interface_list_1'Access, null); Add_Action (Table.States (841), 101, 239); Add_Action (Table.States (841), 102, 240); Add_Error (Table.States (841)); Add_Goto (Table.States (841), 115, 241); Add_Goto (Table.States (841), 322, 242); Table.States (841).Kernel := To_Vector (((128, 239, 2, True), (227, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (841).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 227, 1))); Add_Action (Table.States (842), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (842), 104, 149); Add_Error (Table.States (842)); Add_Goto (Table.States (842), 220, 1008); Table.States (842).Kernel := To_Vector ((0 => (266, 24, 0, False))); Table.States (842).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (843), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (843), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (843), 28, 183); Add_Action (Table.States (843), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (843), 30, 8); Add_Action (Table.States (843), 40, 12); Add_Action (Table.States (843), 46, 14); Add_Action (Table.States (843), 47, 15); Add_Action (Table.States (843), 48, 16); Add_Action (Table.States (843), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (843), 51, 19); Add_Action (Table.States (843), 63, 25); Add_Action (Table.States (843), 66, 26); Add_Action (Table.States (843), 69, 27); Add_Action (Table.States (843), 71, 28); Add_Action (Table.States (843), 104, 185); Add_Error (Table.States (843)); Add_Goto (Table.States (843), 112, 35); Add_Goto (Table.States (843), 121, 37); Add_Goto (Table.States (843), 127, 40); Add_Goto (Table.States (843), 134, 45); Add_Goto (Table.States (843), 135, 46); Add_Goto (Table.States (843), 157, 391); Add_Goto (Table.States (843), 158, 392); Add_Goto (Table.States (843), 159, 1009); Add_Goto (Table.States (843), 179, 54); Add_Goto (Table.States (843), 182, 55); Add_Goto (Table.States (843), 186, 56); Add_Goto (Table.States (843), 193, 58); Add_Goto (Table.States (843), 206, 60); Add_Goto (Table.States (843), 207, 61); Add_Goto (Table.States (843), 209, 62); Add_Goto (Table.States (843), 210, 63); Add_Goto (Table.States (843), 213, 64); Add_Goto (Table.States (843), 214, 65); Add_Goto (Table.States (843), 215, 66); Add_Goto (Table.States (843), 216, 67); Add_Goto (Table.States (843), 219, 69); Add_Goto (Table.States (843), 223, 71); Add_Goto (Table.States (843), 243, 74); Add_Goto (Table.States (843), 244, 75); Add_Goto (Table.States (843), 245, 76); Add_Goto (Table.States (843), 246, 77); Add_Goto (Table.States (843), 247, 78); Add_Goto (Table.States (843), 248, 79); Add_Goto (Table.States (843), 249, 80); Add_Goto (Table.States (843), 250, 81); Add_Goto (Table.States (843), 251, 82); Add_Goto (Table.States (843), 257, 394); Add_Goto (Table.States (843), 259, 84); Add_Goto (Table.States (843), 260, 85); Add_Goto (Table.States (843), 262, 87); Add_Goto (Table.States (843), 263, 88); Add_Goto (Table.States (843), 264, 89); Add_Goto (Table.States (843), 265, 90); Add_Goto (Table.States (843), 271, 91); Add_Goto (Table.States (843), 281, 94); Add_Goto (Table.States (843), 289, 95); Add_Goto (Table.States (843), 304, 102); Add_Goto (Table.States (843), 305, 103); Add_Goto (Table.States (843), 307, 105); Add_Goto (Table.States (843), 308, 106); Add_Goto (Table.States (843), 309, 107); Add_Goto (Table.States (843), 311, 108); Add_Goto (Table.States (843), 313, 109); Add_Goto (Table.States (843), 316, 111); Add_Goto (Table.States (843), 317, 112); Add_Goto (Table.States (843), 319, 113); Add_Goto (Table.States (843), 325, 115); Add_Goto (Table.States (843), 331, 116); Table.States (843).Kernel := To_Vector ((0 => (266, 49, 1, False))); Table.States (843).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (844), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (304, 1), 6, single_protected_declaration_1'Access, single_protected_declaration_1_check'Access); Table.States (844).Kernel := To_Vector ((0 => (304, 96, 0, False))); Table.States (844).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 304, 6))); Add_Action (Table.States (845), (21, 82, 96), (292, 1), 1, null, null); Table.States (845).Kernel := To_Vector ((0 => (292, 114, 0, False))); Table.States (845).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 292, 1))); Add_Action (Table.States (846), 21, Reduce, (194, 1), 5, extended_return_object_declaration_1'Access, null); Add_Action (Table.States (846), 82, 1010); Add_Action (Table.States (846), 96, Reduce, (194, 1), 5, extended_return_object_declaration_1'Access, null); Add_Error (Table.States (846)); Table.States (846).Kernel := To_Vector (((194, 292, 1, False), (194, 292, 0, False))); Table.States (846).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 194, 5))); Add_Action (Table.States (847), (21, 82, 96), (292, 0), 1, null, null); Table.States (847).Kernel := To_Vector ((0 => (292, 314, 0, False))); Table.States (847).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 292, 1))); Add_Action (Table.States (848), 96, 1011); Add_Error (Table.States (848)); Table.States (848).Kernel := To_Vector ((0 => (196, 58, 1, False))); Table.States (848).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1011))); Add_Action (Table.States (849), 104, 119); Add_Action (Table.States (849), 105, 33); Add_Action (Table.States (849), 106, 34); Add_Error (Table.States (849)); Add_Goto (Table.States (849), 128, 41); Add_Goto (Table.States (849), 239, 1012); Add_Goto (Table.States (849), 272, 92); Add_Goto (Table.States (849), 293, 97); Table.States (849).Kernel := To_Vector (((247, 14, 5, False), (247, 14, 4, False))); Table.States (849).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (850), 104, 1013); Add_Error (Table.States (850)); Table.States (850).Kernel := To_Vector ((0 => (264, 14, 4, False))); Table.States (850).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 1013))); Add_Action (Table.States (851), 104, 1014); Add_Error (Table.States (851)); Table.States (851).Kernel := To_Vector ((0 => (316, 14, 5, False))); Table.States (851).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 1014))); Add_Action (Table.States (852), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (852), 74, 337); Add_Error (Table.States (852)); Add_Goto (Table.States (852), 122, 1015); Table.States (852).Kernel := To_Vector ((0 => (307, 312, 4, False))); Table.States (852).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (853), (22, 24, 43), (295, 1), 5, select_alternative_1'Access, null); Table.States (853).Kernel := To_Vector ((0 => (295, 96, 0, False))); Table.States (853).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 5))); Add_Action (Table.States (854), (22, 24, 43), (295, 0), 5, select_alternative_0'Access, null); Table.States (854).Kernel := To_Vector ((0 => (295, 300, 0, False))); Table.States (854).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 295, 5))); Add_Action (Table.States (855), 96, 1016); Add_Error (Table.States (855)); Table.States (855).Kernel := To_Vector ((0 => (152, 61, 1, False))); Table.States (855).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1016))); Add_Action (Table.States (856), 96, 1017); Add_Error (Table.States (856)); Table.States (856).Kernel := To_Vector ((0 => (323, 61, 1, False))); Table.States (856).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1017))); Add_Action (Table.States (857), 96, 1018); Add_Error (Table.States (857)); Table.States (857).Kernel := To_Vector ((0 => (294, 61, 1, False))); Table.States (857).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1018))); Add_Action (Table.States (858), 61, 1019); Add_Error (Table.States (858)); Table.States (858).Kernel := To_Vector ((0 => (126, 24, 2, False))); Table.States (858).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 61, 1019))); Add_Action (Table.States (859), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (313, 0), 6, subtype_declaration_0'Access, null); Table.States (859).Kernel := To_Vector ((0 => (313, 96, 0, False))); Table.States (859).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 313, 6))); Add_Action (Table.States (860), 96, 1020); Add_Error (Table.States (860)); Table.States (860).Kernel := To_Vector ((0 => (317, 122, 1, False))); Table.States (860).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1020))); Add_Action (Table.States (861), 13, 1021); Add_Error (Table.States (861)); Table.States (861).Kernel := To_Vector ((0 => (316, 159, 3, False))); Table.States (861).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 13, 1021))); Add_Action (Table.States (862), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (862), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (862), 28, 183); Add_Action (Table.States (862), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (862), 30, 8); Add_Action (Table.States (862), 39, 1022); Add_Action (Table.States (862), 40, 12); Add_Action (Table.States (862), 46, 14); Add_Action (Table.States (862), 47, 15); Add_Action (Table.States (862), 48, 16); Add_Action (Table.States (862), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (862), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (862), 51, 19); Add_Action (Table.States (862), 63, 25); Add_Action (Table.States (862), 66, 26); Add_Action (Table.States (862), 69, 27); Add_Action (Table.States (862), 71, 28); Add_Action (Table.States (862), 104, 185); Add_Error (Table.States (862)); Add_Goto (Table.States (862), 112, 35); Add_Goto (Table.States (862), 121, 37); Add_Goto (Table.States (862), 127, 40); Add_Goto (Table.States (862), 134, 45); Add_Goto (Table.States (862), 135, 46); Add_Goto (Table.States (862), 157, 391); Add_Goto (Table.States (862), 158, 392); Add_Goto (Table.States (862), 159, 692); Add_Goto (Table.States (862), 179, 54); Add_Goto (Table.States (862), 182, 55); Add_Goto (Table.States (862), 186, 56); Add_Goto (Table.States (862), 193, 58); Add_Goto (Table.States (862), 206, 60); Add_Goto (Table.States (862), 207, 61); Add_Goto (Table.States (862), 209, 62); Add_Goto (Table.States (862), 210, 63); Add_Goto (Table.States (862), 213, 64); Add_Goto (Table.States (862), 214, 65); Add_Goto (Table.States (862), 215, 66); Add_Goto (Table.States (862), 216, 67); Add_Goto (Table.States (862), 219, 69); Add_Goto (Table.States (862), 223, 71); Add_Goto (Table.States (862), 243, 74); Add_Goto (Table.States (862), 244, 75); Add_Goto (Table.States (862), 245, 76); Add_Goto (Table.States (862), 246, 77); Add_Goto (Table.States (862), 247, 78); Add_Goto (Table.States (862), 248, 79); Add_Goto (Table.States (862), 249, 80); Add_Goto (Table.States (862), 250, 81); Add_Goto (Table.States (862), 251, 82); Add_Goto (Table.States (862), 257, 394); Add_Goto (Table.States (862), 259, 84); Add_Goto (Table.States (862), 260, 85); Add_Goto (Table.States (862), 262, 87); Add_Goto (Table.States (862), 263, 88); Add_Goto (Table.States (862), 264, 89); Add_Goto (Table.States (862), 265, 90); Add_Goto (Table.States (862), 271, 91); Add_Goto (Table.States (862), 281, 94); Add_Goto (Table.States (862), 289, 95); Add_Goto (Table.States (862), 304, 102); Add_Goto (Table.States (862), 305, 103); Add_Goto (Table.States (862), 307, 105); Add_Goto (Table.States (862), 308, 106); Add_Goto (Table.States (862), 309, 107); Add_Goto (Table.States (862), 311, 108); Add_Goto (Table.States (862), 313, 109); Add_Goto (Table.States (862), 316, 111); Add_Goto (Table.States (862), 317, 112); Add_Goto (Table.States (862), 318, 1023); Add_Goto (Table.States (862), 319, 113); Add_Goto (Table.States (862), 325, 115); Add_Goto (Table.States (862), 331, 116); Table.States (862).Kernel := To_Vector (((319, 35, 5, False), (319, 35, 2, False))); Table.States (862).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 0))); Add_Action (Table.States (863), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (319, 2), 6, task_type_declaration_2'Access, null); Table.States (863).Kernel := To_Vector ((0 => (319, 96, 0, False))); Table.States (863).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 319, 6))); Add_Action (Table.States (864), 10, 1006); Add_Action (Table.States (864), 74, 1024); Add_Error (Table.States (864)); Table.States (864).Kernel := To_Vector (((227, 227, 2, True), (305, 227, 3, False))); Table.States (864).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1024))); Add_Action (Table.States (865), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (865), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (865), 28, 183); Add_Action (Table.States (865), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (865), 30, 8); Add_Action (Table.States (865), 40, 12); Add_Action (Table.States (865), 46, 14); Add_Action (Table.States (865), 47, 15); Add_Action (Table.States (865), 48, 16); Add_Action (Table.States (865), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (865), 51, 19); Add_Action (Table.States (865), 63, 25); Add_Action (Table.States (865), 66, 26); Add_Action (Table.States (865), 69, 27); Add_Action (Table.States (865), 71, 28); Add_Action (Table.States (865), 104, 185); Add_Error (Table.States (865)); Add_Goto (Table.States (865), 112, 35); Add_Goto (Table.States (865), 121, 37); Add_Goto (Table.States (865), 127, 40); Add_Goto (Table.States (865), 134, 45); Add_Goto (Table.States (865), 135, 46); Add_Goto (Table.States (865), 157, 391); Add_Goto (Table.States (865), 158, 392); Add_Goto (Table.States (865), 159, 1025); Add_Goto (Table.States (865), 179, 54); Add_Goto (Table.States (865), 182, 55); Add_Goto (Table.States (865), 186, 56); Add_Goto (Table.States (865), 193, 58); Add_Goto (Table.States (865), 206, 60); Add_Goto (Table.States (865), 207, 61); Add_Goto (Table.States (865), 209, 62); Add_Goto (Table.States (865), 210, 63); Add_Goto (Table.States (865), 213, 64); Add_Goto (Table.States (865), 214, 65); Add_Goto (Table.States (865), 215, 66); Add_Goto (Table.States (865), 216, 67); Add_Goto (Table.States (865), 219, 69); Add_Goto (Table.States (865), 223, 71); Add_Goto (Table.States (865), 243, 74); Add_Goto (Table.States (865), 244, 75); Add_Goto (Table.States (865), 245, 76); Add_Goto (Table.States (865), 246, 77); Add_Goto (Table.States (865), 247, 78); Add_Goto (Table.States (865), 248, 79); Add_Goto (Table.States (865), 249, 80); Add_Goto (Table.States (865), 250, 81); Add_Goto (Table.States (865), 251, 82); Add_Goto (Table.States (865), 257, 394); Add_Goto (Table.States (865), 259, 84); Add_Goto (Table.States (865), 260, 85); Add_Goto (Table.States (865), 262, 87); Add_Goto (Table.States (865), 263, 88); Add_Goto (Table.States (865), 264, 89); Add_Goto (Table.States (865), 265, 90); Add_Goto (Table.States (865), 271, 91); Add_Goto (Table.States (865), 281, 94); Add_Goto (Table.States (865), 289, 95); Add_Goto (Table.States (865), 304, 102); Add_Goto (Table.States (865), 305, 103); Add_Goto (Table.States (865), 307, 105); Add_Goto (Table.States (865), 308, 106); Add_Goto (Table.States (865), 309, 107); Add_Goto (Table.States (865), 311, 108); Add_Goto (Table.States (865), 313, 109); Add_Goto (Table.States (865), 316, 111); Add_Goto (Table.States (865), 317, 112); Add_Goto (Table.States (865), 319, 113); Add_Goto (Table.States (865), 325, 115); Add_Goto (Table.States (865), 331, 116); Table.States (865).Kernel := To_Vector ((0 => (318, 49, 0, False))); Table.States (865).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (866), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (866), 104, 149); Add_Error (Table.States (866)); Add_Goto (Table.States (866), 220, 1026); Table.States (866).Kernel := To_Vector ((0 => (305, 24, 1, False))); Table.States (866).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (867), (77, 96), (171, 0), 3, null, null); Table.States (867).Kernel := To_Vector ((0 => (171, 170, 0, True))); Table.States (867).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 171, 3))); Table.States (867).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (868), 41, 1027); Add_Error (Table.States (868)); Table.States (868).Kernel := To_Vector (((241, 40, 1, False), (242, 40, 2, False), (242, 40, 4, False))); Table.States (868).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 1027))); Add_Action (Table.States (869), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (869), 77, Reduce, (242, 0), 1, null_exclusion_opt_name_type_0'Access, null); Add_Action (Table.States (869), 82, Reduce, (242, 0), 1, null_exclusion_opt_name_type_0'Access, null); Add_Action (Table.States (869), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (869), 96, Reduce, (242, 0), 1, null_exclusion_opt_name_type_0'Access, null); Add_Action (Table.States (869), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (869), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (869)); Table.States (869).Kernel := To_Vector (((239, 104, 0, False), (242, 104, 0, False))); Table.States (869).Minimal_Complete_Actions := To_Vector (((Reduce, 239, 1), (Reduce, 242, 1))); Add_Action (Table.States (870), 77, Reduce, (170, 3), 3, null, null); Add_Action (Table.States (870), 82, 1028); Add_Action (Table.States (870), 96, Reduce, (170, 3), 3, null, null); Add_Error (Table.States (870)); Table.States (870).Kernel := To_Vector (((170, 114, 1, False), (170, 114, 0, False))); Table.States (870).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 170, 3))); Add_Action (Table.States (871), 76, 235); Add_Action (Table.States (871), 84, 237); Add_Action (Table.States (871), 101, 239); Add_Action (Table.States (871), 102, 240); Add_Error (Table.States (871)); Add_Goto (Table.States (871), 115, 241); Add_Goto (Table.States (871), 322, 242); Table.States (871).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (871).Minimal_Complete_Actions := To_Vector (((Shift, 101, 239), (Shift, 76, 235), (Shift, 84, 237))); Table.States (871).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (872), 77, Reduce, (170, 2), 3, null, null); Add_Action (Table.States (872), 82, 1029); Add_Action (Table.States (872), 96, Reduce, (170, 2), 3, null, null); Add_Error (Table.States (872)); Table.States (872).Kernel := To_Vector (((170, 242, 1, False), (170, 242, 0, False))); Table.States (872).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 170, 3))); Add_Action (Table.States (873), 76, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (873), 77, Reduce, (242, 1), 1, null_exclusion_opt_name_type_1'Access, null); Add_Action (Table.States (873), 82, Reduce, (242, 1), 1, null_exclusion_opt_name_type_1'Access, null); Add_Action (Table.States (873), 84, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (873), 96, Reduce, (242, 1), 1, null_exclusion_opt_name_type_1'Access, null); Add_Action (Table.States (873), 101, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (873), 102, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Error (Table.States (873)); Table.States (873).Kernel := To_Vector (((239, 293, 0, True), (242, 293, 0, False))); Table.States (873).Minimal_Complete_Actions := To_Vector (((Reduce, 239, 1), (Reduce, 242, 1))); Table.States (873).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (874), 39, Reduce, (109, 0), 2, null, null); Add_Conflict (Table.States (874), 39, (110, 0), 2, null, null); Add_Error (Table.States (874)); Table.States (874).Kernel := To_Vector (((109, 36, 0, False), (110, 36, 0, False))); Table.States (874).Minimal_Complete_Actions := To_Vector (((Reduce, 109, 2), (Reduce, 110, 2))); Add_Action (Table.States (875), (1 => 39), (109, 1), 2, null, null); Table.States (875).Kernel := To_Vector ((0 => (109, 64, 0, False))); Table.States (875).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 109, 2))); Add_Action (Table.States (876), 36, 1030); Add_Action (Table.States (876), 41, Reduce, (111, 1), 2, null, null); Add_Action (Table.States (876), 49, Reduce, (111, 1), 2, null, null); Add_Action (Table.States (876), 54, Reduce, (111, 1), 2, null, null); Add_Error (Table.States (876)); Table.States (876).Kernel := To_Vector (((111, 65, 1, False), (111, 65, 0, False))); Table.States (876).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 111, 2))); Add_Action (Table.States (877), 3, 121); Add_Action (Table.States (877), 39, 122); Add_Action (Table.States (877), 40, 474); Add_Action (Table.States (877), 41, 124); Add_Action (Table.States (877), 76, 126); Add_Action (Table.States (877), 94, 127); Add_Action (Table.States (877), 95, 128); Add_Action (Table.States (877), 103, 129); Add_Action (Table.States (877), 104, 119); Add_Action (Table.States (877), 105, 33); Add_Action (Table.States (877), 106, 34); Add_Error (Table.States (877)); Add_Goto (Table.States (877), 117, 130); Add_Goto (Table.States (877), 128, 41); Add_Goto (Table.States (877), 167, 775); Add_Goto (Table.States (877), 168, 1031); Add_Goto (Table.States (877), 197, 133); Add_Goto (Table.States (877), 225, 1032); Add_Goto (Table.States (877), 226, 1033); Add_Goto (Table.States (877), 239, 1034); Add_Goto (Table.States (877), 258, 135); Add_Goto (Table.States (877), 272, 92); Add_Goto (Table.States (877), 277, 478); Add_Goto (Table.States (877), 293, 97); Add_Goto (Table.States (877), 301, 479); Add_Goto (Table.States (877), 314, 480); Add_Goto (Table.States (877), 320, 144); Add_Goto (Table.States (877), 321, 145); Add_Goto (Table.States (877), 330, 146); Table.States (877).Kernel := To_Vector (((120, 76, 6, False), (120, 76, 6, False))); Table.States (877).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (878), 20, 1035); Add_Action (Table.States (878), 53, 1036); Add_Action (Table.States (878), 74, Reduce, (279, 1), 0, null, null); Add_Action (Table.States (878), 96, Reduce, (279, 1), 0, null, null); Add_Error (Table.States (878)); Add_Goto (Table.States (878), 279, 1037); Table.States (878).Kernel := To_Vector (((326, 192, 1, False), (326, 192, 0, False))); Table.States (878).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 279, 0))); Add_Action (Table.States (879), 53, 1036); Add_Action (Table.States (879), 74, Reduce, (279, 1), 0, null, null); Add_Action (Table.States (879), 96, Reduce, (279, 1), 0, null, null); Add_Error (Table.States (879)); Add_Goto (Table.States (879), 279, 1038); Table.States (879).Kernel := To_Vector ((0 => (326, 192, 0, False))); Table.States (879).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 279, 0))); Add_Action (Table.States (880), 10, 1039); Add_Action (Table.States (880), 74, Reduce, (228, 4), 2, null, null); Add_Action (Table.States (880), 96, Reduce, (228, 4), 2, null, null); Add_Error (Table.States (880)); Table.States (880).Kernel := To_Vector (((228, 34, 2, False), (228, 34, 0, False))); Table.States (880).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 2))); Add_Action (Table.States (881), (74, 96), (326, 2), 2, null, null); Table.States (881).Kernel := To_Vector ((0 => (326, 192, 0, False))); Table.States (881).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 2))); Add_Action (Table.States (882), (74, 96), (280, 1), 2, null, null); Table.States (882).Kernel := To_Vector ((0 => (280, 54, 0, False))); Table.States (882).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 280, 2))); Add_Action (Table.States (883), 10, 1040); Add_Action (Table.States (883), 74, Reduce, (228, 6), 2, null, null); Add_Action (Table.States (883), 96, Reduce, (228, 6), 2, null, null); Add_Error (Table.States (883)); Table.States (883).Kernel := To_Vector (((228, 34, 2, False), (228, 34, 0, False))); Table.States (883).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 2))); Add_Action (Table.States (884), 85, 1041); Add_Error (Table.States (884)); Table.States (884).Kernel := To_Vector ((0 => (326, 301, 2, False))); Table.States (884).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 85, 1041))); Add_Action (Table.States (885), 35, Reduce, (164, 1), 0, null, null); Add_Action (Table.States (885), 104, 1042); Add_Action (Table.States (885), 105, 1043); Add_Error (Table.States (885)); Add_Goto (Table.States (885), 163, 1044); Add_Goto (Table.States (885), 164, 1045); Table.States (885).Kernel := To_Vector ((0 => (327, 15, 6, False))); Table.States (885).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 164, 0))); Add_Action (Table.States (886), 96, 1046); Add_Error (Table.States (886)); Table.States (886).Kernel := To_Vector ((0 => (149, 41, 1, False))); Table.States (886).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1046))); Add_Action (Table.States (887), (15, 24, 28, 72, 104), (148, 1), 1, null, null); Table.States (887).Kernel := To_Vector ((0 => (148, 121, 0, False))); Table.States (887).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 148, 1))); Add_Action (Table.States (888), (15, 24, 28, 72, 104), (148, 0), 1, null, null); Table.States (888).Kernel := To_Vector ((0 => (148, 146, 0, False))); Table.States (888).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 148, 1))); end Subr_15; procedure Subr_16 is begin Add_Action (Table.States (889), (15, 24, 28, 72, 104), (149, 2), 1, null, null); Table.States (889).Kernel := To_Vector ((0 => (149, 148, 0, False))); Table.States (889).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 149, 1))); Add_Action (Table.States (890), 15, 885); Add_Action (Table.States (890), 24, Reduce, (150, 0), 1, null, null); Add_Action (Table.States (890), 28, 183); Add_Action (Table.States (890), 72, Reduce, (150, 0), 1, null, null); Add_Action (Table.States (890), 104, 164); Add_Error (Table.States (890)); Add_Goto (Table.States (890), 121, 887); Add_Goto (Table.States (890), 127, 40); Add_Goto (Table.States (890), 146, 888); Add_Goto (Table.States (890), 148, 1047); Add_Goto (Table.States (890), 182, 55); Add_Goto (Table.States (890), 219, 892); Add_Goto (Table.States (890), 281, 94); Add_Goto (Table.States (890), 327, 1048); Table.States (890).Kernel := To_Vector (((149, 149, 4, True), (149, 149, 7, True), (150, 149, 0, False))); Table.States (890).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 150, 1))); Add_Action (Table.States (891), 24, 1049); Add_Error (Table.States (891)); Table.States (891).Kernel := To_Vector ((0 => (280, 150, 2, False))); Table.States (891).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1049))); Add_Action (Table.States (892), 81, 1050); Add_Action (Table.States (892), 83, 234); Add_Error (Table.States (892)); Table.States (892).Kernel := To_Vector (((146, 219, 4, False), (146, 219, 3, False), (219, 219, 2, True))); Table.States (892).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 81, 1050))); Add_Action (Table.States (893), (15, 24, 28, 72, 104), (149, 3), 1, null, null); Table.States (893).Kernel := To_Vector ((0 => (149, 327, 0, False))); Table.States (893).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 149, 1))); Add_Action (Table.States (894), 10, 1051); Add_Action (Table.States (894), 74, Reduce, (228, 7), 2, null, null); Add_Action (Table.States (894), 96, Reduce, (228, 7), 2, null, null); Add_Error (Table.States (894)); Table.States (894).Kernel := To_Vector (((228, 34, 2, False), (228, 34, 0, False))); Table.States (894).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 2))); Add_Action (Table.States (895), (41, 49, 54), (111, 2), 2, null, null); Table.States (895).Kernel := To_Vector ((0 => (111, 36, 0, False))); Table.States (895).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 111, 2))); Add_Action (Table.States (896), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (223, 0), 6, incomplete_type_declaration_0'Access, null); Table.States (896).Kernel := To_Vector ((0 => (223, 96, 0, False))); Table.States (896).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 223, 6))); Add_Action (Table.States (897), 10, 1052); Add_Action (Table.States (897), 74, Reduce, (228, 5), 2, null, null); Add_Action (Table.States (897), 96, Reduce, (228, 5), 2, null, null); Add_Error (Table.States (897)); Table.States (897).Kernel := To_Vector (((228, 34, 2, False), (228, 34, 0, False))); Table.States (897).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 2))); Add_Action (Table.States (898), (77, 83), (180, 0), 1, null, null); Table.States (898).Kernel := To_Vector ((0 => (180, 104, 0, False))); Table.States (898).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 180, 1))); Add_Action (Table.States (899), (77, 83), (180, 1), 1, null, null); Table.States (899).Kernel := To_Vector ((0 => (180, 106, 0, False))); Table.States (899).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 180, 1))); Add_Action (Table.States (900), (77, 83), (181, 1), 1, null, null); Table.States (900).Kernel := To_Vector ((0 => (181, 180, 0, False))); Table.States (900).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 181, 1))); Add_Action (Table.States (901), 77, 1053); Add_Action (Table.States (901), 83, 1054); Add_Error (Table.States (901)); Table.States (901).Kernel := To_Vector (((181, 181, 2, True), (183, 181, 1, False))); Table.States (901).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1053))); Add_Action (Table.States (902), 40, 483); Add_Action (Table.States (902), 104, 119); Add_Action (Table.States (902), 105, 33); Add_Action (Table.States (902), 106, 34); Add_Error (Table.States (902)); Add_Goto (Table.States (902), 128, 41); Add_Goto (Table.States (902), 239, 484); Add_Goto (Table.States (902), 272, 92); Add_Goto (Table.States (902), 293, 97); Add_Goto (Table.States (902), 314, 1055); Table.States (902).Kernel := To_Vector ((0 => (259, 39, 4, False))); Table.States (902).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (903), 104, 119); Add_Action (Table.States (903), 105, 33); Add_Action (Table.States (903), 106, 34); Add_Error (Table.States (903)); Add_Goto (Table.States (903), 128, 41); Add_Goto (Table.States (903), 239, 1056); Add_Goto (Table.States (903), 272, 92); Add_Goto (Table.States (903), 293, 97); Table.States (903).Kernel := To_Vector (((162, 39, 4, False), (162, 39, 1, False))); Table.States (903).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (904), 74, 337); Add_Action (Table.States (904), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (904)); Add_Goto (Table.States (904), 122, 1057); Table.States (904).Kernel := To_Vector ((0 => (260, 49, 1, False))); Table.States (904).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (905), (74, 96), (326, 7), 2, null, null); Table.States (905).Kernel := To_Vector ((0 => (326, 280, 0, False))); Table.States (905).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 2))); Add_Action (Table.States (906), 96, 1058); Add_Error (Table.States (906)); Table.States (906).Kernel := To_Vector ((0 => (206, 122, 1, False))); Table.States (906).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1058))); Add_Action (Table.States (907), 96, 1059); Add_Error (Table.States (907)); Table.States (907).Kernel := To_Vector ((0 => (245, 122, 1, False))); Table.States (907).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1059))); Add_Action (Table.States (908), 96, 1060); Add_Error (Table.States (908)); Table.States (908).Kernel := To_Vector ((0 => (245, 122, 1, False))); Table.States (908).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1060))); Add_Action (Table.States (909), 21, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 35, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 56, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 74, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 76, 235); Add_Action (Table.States (909), 77, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 82, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 84, 237); Add_Action (Table.States (909), 96, Reduce, (114, 2), 4, access_definition_2'Access, null); Add_Action (Table.States (909), 101, 239); Add_Action (Table.States (909), 102, 240); Add_Error (Table.States (909)); Add_Goto (Table.States (909), 115, 241); Add_Goto (Table.States (909), 322, 242); Table.States (909).Kernel := To_Vector (((114, 239, 0, False), (128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (909).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 114, 4))); Add_Action (Table.States (910), 58, 317); Add_Action (Table.States (910), 76, 431); Add_Error (Table.States (910)); Add_Goto (Table.States (910), 199, 319); Add_Goto (Table.States (910), 252, 1061); Add_Goto (Table.States (910), 291, 321); Table.States (910).Kernel := To_Vector ((0 => (114, 29, 1, True))); Table.States (910).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 58, 317))); Table.States (910).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (911), 21, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 35, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 56, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 74, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 76, 431); Add_Action (Table.States (911), 77, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 82, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (911), 96, Reduce, (253, 1), 0, null, null); Add_Error (Table.States (911)); Add_Goto (Table.States (911), 199, 344); Add_Goto (Table.States (911), 253, 1062); Table.States (911).Kernel := To_Vector ((0 => (114, 50, 0, False))); Table.States (911).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (912), 74, 337); Add_Action (Table.States (912), 76, 235); Add_Action (Table.States (912), 84, 237); Add_Action (Table.States (912), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (912), 101, 239); Add_Action (Table.States (912), 102, 240); Add_Error (Table.States (912)); Add_Goto (Table.States (912), 115, 241); Add_Goto (Table.States (912), 122, 1063); Add_Goto (Table.States (912), 322, 242); Table.States (912).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (245, 239, 1, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (912).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (913), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (133, 1), 6, block_statement_1'Access, block_statement_1_check'Access); Table.States (913).Kernel := To_Vector ((0 => (133, 96, 0, False))); Table.States (913).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 133, 6))); Add_Action (Table.States (914), (79, 87), (184, 1), 1, null, null); Table.States (914).Kernel := To_Vector ((0 => (184, 44, 0, False))); Table.States (914).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 184, 1))); Add_Action (Table.States (915), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (915), 79, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (915), 81, 1064); Add_Action (Table.States (915), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (915), 87, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (915), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (915), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (915)); Table.States (915).Kernel := To_Vector (((187, 104, 3, False), (239, 104, 0, False))); Table.States (915).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 239, 1))); Add_Action (Table.States (916), (79, 87), (185, 1), 1, null, null); Table.States (916).Kernel := To_Vector ((0 => (185, 184, 0, False))); Table.States (916).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 185, 1))); Add_Action (Table.States (917), 79, 1065); Add_Action (Table.States (917), 87, 1066); Add_Error (Table.States (917)); Table.States (917).Kernel := To_Vector (((185, 185, 2, True), (187, 185, 1, False))); Table.States (917).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 1066))); Add_Action (Table.States (918), 76, 235); Add_Action (Table.States (918), 79, Reduce, (184, 0), 1, null, null); Add_Action (Table.States (918), 84, 237); Add_Action (Table.States (918), 87, Reduce, (184, 0), 1, null, null); Add_Action (Table.States (918), 101, 239); Add_Action (Table.States (918), 102, 240); Add_Error (Table.States (918)); Add_Goto (Table.States (918), 115, 241); Add_Goto (Table.States (918), 322, 242); Table.States (918).Kernel := To_Vector (((128, 239, 2, True), (184, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (918).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 184, 1))); Add_Action (Table.States (919), (24, 72), (188, 0), 2, null, null); Table.States (919).Kernel := To_Vector ((0 => (188, 187, 0, True))); Table.States (919).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 188, 2))); Table.States (919).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (920), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (920), 104, 149); Add_Error (Table.States (920)); Add_Goto (Table.States (920), 220, 1067); Table.States (920).Kernel := To_Vector ((0 => (133, 24, 1, False))); Table.States (920).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (921), 96, 1068); Add_Error (Table.States (921)); Table.States (921).Kernel := To_Vector ((0 => (232, 220, 1, False))); Table.States (921).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1068))); Add_Action (Table.States (922), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (922), 104, 149); Add_Error (Table.States (922)); Add_Goto (Table.States (922), 220, 1069); Table.States (922).Kernel := To_Vector ((0 => (232, 37, 1, False))); Table.States (922).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (923), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (157, 9), 6, declaration_9'Access, null); Table.States (923).Kernel := To_Vector ((0 => (157, 96, 0, False))); Table.States (923).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 157, 6))); Add_Action (Table.States (924), 7, Reduce, (241, 0), 2, null, null); Add_Action (Table.States (924), 104, 119); Add_Action (Table.States (924), 105, 33); Add_Action (Table.States (924), 106, 34); Add_Error (Table.States (924)); Add_Goto (Table.States (924), 128, 41); Add_Goto (Table.States (924), 239, 772); Add_Goto (Table.States (924), 272, 92); Add_Goto (Table.States (924), 293, 97); Table.States (924).Kernel := To_Vector (((241, 41, 0, False), (314, 41, 5, False), (314, 41, 1, False))); Table.States (924).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 2))); Add_Action (Table.States (925), 3, 121); Add_Action (Table.States (925), 39, 122); Add_Action (Table.States (925), 40, 123); Add_Action (Table.States (925), 41, 124); Add_Action (Table.States (925), 52, 125); Add_Action (Table.States (925), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (925), 76, 126); Add_Action (Table.States (925), 94, 127); Add_Action (Table.States (925), 95, 128); Add_Action (Table.States (925), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (925), 103, 129); Add_Action (Table.States (925), 104, 119); Add_Action (Table.States (925), 105, 33); Add_Action (Table.States (925), 106, 34); Add_Error (Table.States (925)); Add_Goto (Table.States (925), 117, 130); Add_Goto (Table.States (925), 128, 41); Add_Goto (Table.States (925), 191, 131); Add_Goto (Table.States (925), 192, 1070); Add_Goto (Table.States (925), 197, 133); Add_Goto (Table.States (925), 239, 134); Add_Goto (Table.States (925), 258, 135); Add_Goto (Table.States (925), 272, 92); Add_Goto (Table.States (925), 275, 136); Add_Goto (Table.States (925), 282, 137); Add_Goto (Table.States (925), 283, 138); Add_Goto (Table.States (925), 284, 139); Add_Goto (Table.States (925), 285, 140); Add_Goto (Table.States (925), 286, 141); Add_Goto (Table.States (925), 287, 142); Add_Goto (Table.States (925), 293, 97); Add_Goto (Table.States (925), 301, 143); Add_Goto (Table.States (925), 320, 144); Add_Goto (Table.States (925), 321, 145); Add_Goto (Table.States (925), 330, 146); Table.States (925).Kernel := To_Vector ((0 => (244, 82, 1, False))); Table.States (925).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (926), 96, 1071); Add_Error (Table.States (926)); Table.States (926).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (926).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1071))); Add_Action (Table.States (927), 3, 121); Add_Action (Table.States (927), 39, 122); Add_Action (Table.States (927), 40, 123); Add_Action (Table.States (927), 41, 124); Add_Action (Table.States (927), 52, 125); Add_Action (Table.States (927), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (927), 76, 126); Add_Action (Table.States (927), 94, 127); Add_Action (Table.States (927), 95, 128); Add_Action (Table.States (927), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (927), 103, 129); Add_Action (Table.States (927), 104, 119); Add_Action (Table.States (927), 105, 33); Add_Action (Table.States (927), 106, 34); Add_Error (Table.States (927)); Add_Goto (Table.States (927), 117, 130); Add_Goto (Table.States (927), 128, 41); Add_Goto (Table.States (927), 191, 131); Add_Goto (Table.States (927), 192, 1072); Add_Goto (Table.States (927), 197, 133); Add_Goto (Table.States (927), 239, 134); Add_Goto (Table.States (927), 258, 135); Add_Goto (Table.States (927), 272, 92); Add_Goto (Table.States (927), 275, 136); Add_Goto (Table.States (927), 282, 137); Add_Goto (Table.States (927), 283, 138); Add_Goto (Table.States (927), 284, 139); Add_Goto (Table.States (927), 285, 140); Add_Goto (Table.States (927), 286, 141); Add_Goto (Table.States (927), 287, 142); Add_Goto (Table.States (927), 293, 97); Add_Goto (Table.States (927), 301, 143); Add_Goto (Table.States (927), 320, 144); Add_Goto (Table.States (927), 321, 145); Add_Goto (Table.States (927), 330, 146); Table.States (927).Kernel := To_Vector ((0 => (244, 82, 1, False))); Table.States (927).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (928), 96, 1073); Add_Error (Table.States (928)); Table.States (928).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (928).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1073))); Add_Action (Table.States (929), 3, 121); Add_Action (Table.States (929), 39, 122); Add_Action (Table.States (929), 40, 123); Add_Action (Table.States (929), 41, 124); Add_Action (Table.States (929), 52, 125); Add_Action (Table.States (929), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (929), 76, 126); Add_Action (Table.States (929), 94, 127); Add_Action (Table.States (929), 95, 128); Add_Action (Table.States (929), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (929), 103, 129); Add_Action (Table.States (929), 104, 119); Add_Action (Table.States (929), 105, 33); Add_Action (Table.States (929), 106, 34); Add_Error (Table.States (929)); Add_Goto (Table.States (929), 117, 130); Add_Goto (Table.States (929), 128, 41); Add_Goto (Table.States (929), 191, 131); Add_Goto (Table.States (929), 192, 1074); Add_Goto (Table.States (929), 197, 133); Add_Goto (Table.States (929), 239, 134); Add_Goto (Table.States (929), 258, 135); Add_Goto (Table.States (929), 272, 92); Add_Goto (Table.States (929), 275, 136); Add_Goto (Table.States (929), 282, 137); Add_Goto (Table.States (929), 283, 138); Add_Goto (Table.States (929), 284, 139); Add_Goto (Table.States (929), 285, 140); Add_Goto (Table.States (929), 286, 141); Add_Goto (Table.States (929), 287, 142); Add_Goto (Table.States (929), 293, 97); Add_Goto (Table.States (929), 301, 143); Add_Goto (Table.States (929), 320, 144); Add_Goto (Table.States (929), 321, 145); Add_Goto (Table.States (929), 330, 146); Table.States (929).Kernel := To_Vector ((0 => (244, 82, 1, False))); Table.States (929).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (930), 96, 1075); Add_Error (Table.States (930)); Table.States (930).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (930).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1075))); Add_Action (Table.States (931), 74, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (931), 76, 431); Add_Action (Table.States (931), 96, Reduce, (253, 1), 0, null, null); Add_Error (Table.States (931)); Add_Goto (Table.States (931), 199, 344); Add_Goto (Table.States (931), 253, 1076); Table.States (931).Kernel := To_Vector ((0 => (179, 77, 1, False))); Table.States (931).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (932), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (179, 1), 6, entry_declaration_1'Access, null); Table.States (932).Kernel := To_Vector ((0 => (179, 96, 0, False))); Table.States (932).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 179, 6))); Add_Action (Table.States (933), 74, 337); Add_Action (Table.States (933), 76, 235); Add_Action (Table.States (933), 84, 237); Add_Action (Table.States (933), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (933), 101, 239); Add_Action (Table.States (933), 102, 240); Add_Error (Table.States (933)); Add_Goto (Table.States (933), 115, 241); Add_Goto (Table.States (933), 122, 1077); Add_Goto (Table.States (933), 322, 242); Table.States (933).Kernel := To_Vector (((128, 239, 2, True), (213, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (933).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (934), 74, 337); Add_Action (Table.States (934), 76, 235); Add_Action (Table.States (934), 84, 237); Add_Action (Table.States (934), 96, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (934), 101, 239); Add_Action (Table.States (934), 102, 240); Add_Error (Table.States (934)); Add_Goto (Table.States (934), 115, 241); Add_Goto (Table.States (934), 122, 1078); Add_Goto (Table.States (934), 322, 242); Table.States (934).Kernel := To_Vector (((128, 239, 2, True), (213, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (934).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (935), (74, 96), (256, 1), 3, paren_expression_1'Access, null); Table.States (935).Kernel := To_Vector ((0 => (256, 77, 0, False))); Table.States (935).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 256, 3))); Add_Action (Table.States (936), (74, 96), (256, 2), 3, paren_expression_2'Access, null); Table.States (936).Kernel := To_Vector ((0 => (256, 77, 0, False))); Table.States (936).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 256, 3))); Add_Action (Table.States (937), (74, 96), (256, 0), 3, paren_expression_0'Access, null); Table.States (937).Kernel := To_Vector ((0 => (256, 77, 0, False))); Table.States (937).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 256, 3))); Add_Action (Table.States (938), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (193, 0), 6, expression_function_declaration_0'Access, null); Table.States (938).Kernel := To_Vector ((0 => (193, 96, 0, False))); Table.States (938).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 193, 6))); Add_Action (Table.States (939), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (243, 0), 6, null_procedure_declaration_0'Access, null); Table.States (939).Kernel := To_Vector ((0 => (243, 96, 0, False))); Table.States (939).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 243, 6))); Add_Action (Table.States (940), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (112, 0), 6, abstract_subprogram_declaration_0'Access, null); Table.States (940).Kernel := To_Vector ((0 => (112, 96, 0, False))); Table.States (940).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 112, 6))); Add_Action (Table.States (941), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (308, 0), 6, subprogram_body_stub_0'Access, null); Table.States (941).Kernel := To_Vector ((0 => (308, 96, 0, False))); Table.States (941).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 308, 6))); Add_Action (Table.States (942), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (311, 0), 6, subprogram_renaming_declaration_0'Access, null); Table.States (942).Kernel := To_Vector ((0 => (311, 96, 0, False))); Table.States (942).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 311, 6))); Add_Action (Table.States (943), 4, 1); Add_Action (Table.States (943), 5, 2); Add_Action (Table.States (943), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (943), 15, 3); Add_Action (Table.States (943), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (943), 18, 4); Add_Action (Table.States (943), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (943), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (943), 27, 5); Add_Action (Table.States (943), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (943), 31, 9); Add_Action (Table.States (943), 32, 10); Add_Action (Table.States (943), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (943), 41, 13); Add_Action (Table.States (943), 48, 16); Add_Action (Table.States (943), 52, 20); Add_Action (Table.States (943), 57, 21); Add_Action (Table.States (943), 58, 22); Add_Action (Table.States (943), 61, 24); Add_Action (Table.States (943), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (943), 93, 31); Add_Action (Table.States (943), 104, 360); Add_Action (Table.States (943), 105, 33); Add_Action (Table.States (943), 106, 34); Add_Error (Table.States (943)); Add_Goto (Table.States (943), 113, 36); Add_Goto (Table.States (943), 123, 38); Add_Goto (Table.States (943), 126, 39); Add_Goto (Table.States (943), 128, 41); Add_Goto (Table.States (943), 131, 42); Add_Goto (Table.States (943), 132, 43); Add_Goto (Table.States (943), 133, 44); Add_Goto (Table.States (943), 139, 47); Add_Goto (Table.States (943), 151, 50); Add_Goto (Table.States (943), 152, 51); Add_Goto (Table.States (943), 161, 53); Add_Goto (Table.States (943), 190, 57); Add_Goto (Table.States (943), 196, 59); Add_Goto (Table.States (943), 217, 68); Add_Goto (Table.States (943), 218, 1079); Add_Goto (Table.States (943), 222, 70); Add_Goto (Table.States (943), 232, 72); Add_Goto (Table.States (943), 239, 73); Add_Goto (Table.States (943), 257, 83); Add_Goto (Table.States (943), 261, 86); Add_Goto (Table.States (943), 272, 92); Add_Goto (Table.States (943), 276, 93); Add_Goto (Table.States (943), 290, 96); Add_Goto (Table.States (943), 293, 97); Add_Goto (Table.States (943), 294, 98); Add_Goto (Table.States (943), 298, 99); Add_Goto (Table.States (943), 299, 361); Add_Goto (Table.States (943), 300, 390); Add_Goto (Table.States (943), 302, 100); Add_Goto (Table.States (943), 303, 101); Add_Goto (Table.States (943), 306, 363); Add_Goto (Table.States (943), 323, 114); Table.States (943).Kernel := To_Vector ((0 => (307, 13, 2, False))); Table.States (943).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (944), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (944), 104, 149); Add_Error (Table.States (944)); Add_Goto (Table.States (944), 220, 1080); Table.States (944).Kernel := To_Vector ((0 => (113, 24, 1, False))); Table.States (944).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (945), 79, 445); Add_Action (Table.States (945), 87, 1081); Add_Error (Table.States (945)); Table.States (945).Kernel := To_Vector (((137, 166, 1, False), (166, 166, 2, True))); Table.States (945).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 1081))); Add_Action (Table.States (946), 72, 761); Add_Error (Table.States (946)); Add_Goto (Table.States (946), 137, 1082); Table.States (946).Kernel := To_Vector ((0 => (138, 83, 2, True))); Table.States (946).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 72, 761))); Table.States (946).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (947), (1 => 77), (273, 0), 5, quantified_expression_0'Access, null); Table.States (947).Kernel := To_Vector ((0 => (273, 192, 0, False))); Table.States (947).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 273, 5))); Add_Action (Table.States (948), 3, 121); Add_Action (Table.States (948), 39, 122); Add_Action (Table.States (948), 40, 123); Add_Action (Table.States (948), 41, 124); Add_Action (Table.States (948), 52, 125); Add_Action (Table.States (948), 76, 126); Add_Action (Table.States (948), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (948), 94, 127); Add_Action (Table.States (948), 95, 128); Add_Action (Table.States (948), 103, 129); Add_Action (Table.States (948), 104, 119); Add_Action (Table.States (948), 105, 33); Add_Action (Table.States (948), 106, 34); Add_Error (Table.States (948)); Add_Goto (Table.States (948), 117, 130); Add_Goto (Table.States (948), 128, 41); Add_Goto (Table.States (948), 191, 131); Add_Goto (Table.States (948), 192, 1083); Add_Goto (Table.States (948), 197, 133); Add_Goto (Table.States (948), 239, 134); Add_Goto (Table.States (948), 258, 135); Add_Goto (Table.States (948), 272, 92); Add_Goto (Table.States (948), 275, 136); Add_Goto (Table.States (948), 282, 137); Add_Goto (Table.States (948), 283, 138); Add_Goto (Table.States (948), 284, 139); Add_Goto (Table.States (948), 285, 140); Add_Goto (Table.States (948), 286, 141); Add_Goto (Table.States (948), 287, 142); Add_Goto (Table.States (948), 293, 97); Add_Goto (Table.States (948), 301, 143); Add_Goto (Table.States (948), 320, 144); Add_Goto (Table.States (948), 321, 145); Add_Goto (Table.States (948), 330, 146); Table.States (948).Kernel := To_Vector ((0 => (221, 22, 0, False))); Table.States (948).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (949), 3, 121); Add_Action (Table.States (949), 39, 122); Add_Action (Table.States (949), 40, 123); Add_Action (Table.States (949), 41, 124); Add_Action (Table.States (949), 52, 125); Add_Action (Table.States (949), 68, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (949), 76, 126); Add_Action (Table.States (949), 94, 127); Add_Action (Table.States (949), 95, 128); Add_Action (Table.States (949), 103, 129); Add_Action (Table.States (949), 104, 119); Add_Action (Table.States (949), 105, 33); Add_Action (Table.States (949), 106, 34); Add_Error (Table.States (949)); Add_Goto (Table.States (949), 117, 130); Add_Goto (Table.States (949), 128, 41); Add_Goto (Table.States (949), 191, 131); Add_Goto (Table.States (949), 192, 1084); Add_Goto (Table.States (949), 197, 133); Add_Goto (Table.States (949), 239, 134); Add_Goto (Table.States (949), 258, 135); Add_Goto (Table.States (949), 272, 92); Add_Goto (Table.States (949), 275, 136); Add_Goto (Table.States (949), 282, 137); Add_Goto (Table.States (949), 283, 138); Add_Goto (Table.States (949), 284, 139); Add_Goto (Table.States (949), 285, 140); Add_Goto (Table.States (949), 286, 141); Add_Goto (Table.States (949), 287, 142); Add_Goto (Table.States (949), 293, 97); Add_Goto (Table.States (949), 301, 143); Add_Goto (Table.States (949), 320, 144); Add_Goto (Table.States (949), 321, 145); Add_Goto (Table.States (949), 330, 146); Table.States (949).Kernel := To_Vector ((0 => (172, 23, 1, False))); Table.States (949).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (950), (22, 23, 77), (173, 1), 1, null, null); Table.States (950).Kernel := To_Vector ((0 => (173, 172, 0, False))); Table.States (950).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 173, 1))); Add_Action (Table.States (951), 22, 1085); Add_Action (Table.States (951), 23, 949); Add_Action (Table.States (951), 77, Reduce, (221, 2), 5, if_expression_2'Access, null); Add_Error (Table.States (951)); Add_Goto (Table.States (951), 172, 1086); Table.States (951).Kernel := To_Vector (((173, 173, 2, True), (221, 173, 1, False), (221, 173, 0, False))); Table.States (951).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 221, 5))); Add_Action (Table.States (952), (4, 5, 10, 13, 15, 17, 18, 20, 21, 22, 23, 27, 28, 31, 32, 33, 35, 37, 38, 40, 41, 42, 43, 48, 52, 53, 55, 56, 57, 58, 61, 68, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106), (117, 0), 6, aggregate_0'Access, null); Table.States (952).Kernel := To_Vector ((0 => (117, 77, 0, False))); Table.States (952).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 117, 6))); Add_Action (Table.States (953), 77, 1087); Add_Error (Table.States (953)); Table.States (953).Kernel := To_Vector ((0 => (277, 192, 1, False))); Table.States (953).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1087))); Add_Action (Table.States (954), (24, 72), (140, 0), 4, case_statement_alternative_0'Access, null); Table.States (954).Kernel := To_Vector ((0 => (140, 300, 0, False))); Table.States (954).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 140, 4))); Add_Action (Table.States (955), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (139, 0), 7, case_statement_0'Access, null); Table.States (955).Kernel := To_Vector ((0 => (139, 96, 0, False))); Table.States (955).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 139, 7))); Add_Action (Table.States (956), (10, 21, 37, 42, 74, 77, 82, 83, 87, 96), (314, 0), 4, subtype_indication_0'Access, null); Table.States (956).Kernel := To_Vector ((0 => (314, 155, 0, False))); Table.States (956).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 314, 4))); Add_Action (Table.States (957), 10, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 33, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 38, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 40, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 43, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 55, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 75, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 77, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 78, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 79, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 83, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 85, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 86, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 87, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 88, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 89, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 91, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 92, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 94, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 95, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 97, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 98, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 99, Reduce, (258, 1), 1, null, null); Add_Action (Table.States (957), 104, 119); Add_Action (Table.States (957), 105, 33); Add_Action (Table.States (957), 106, 34); Add_Error (Table.States (957)); Add_Goto (Table.States (957), 128, 41); Add_Goto (Table.States (957), 239, 1088); Add_Goto (Table.States (957), 272, 92); Add_Goto (Table.States (957), 293, 97); Table.States (957).Kernel := To_Vector (((165, 41, 1, False), (258, 41, 0, False), (314, 41, 5, False), (314, 41, 1, False))); Table.States (957).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 258, 1))); Add_Action (Table.States (958), (10, 21, 37, 42, 74, 77, 82, 83, 87, 96), (224, 0), 3, index_constraint_0'Access, null); Table.States (958).Kernel := To_Vector ((0 => (224, 77, 0, False))); Table.States (958).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 224, 3))); Add_Action (Table.States (959), 3, 121); Add_Action (Table.States (959), 39, 122); Add_Action (Table.States (959), 40, 474); Add_Action (Table.States (959), 41, 124); Add_Action (Table.States (959), 76, 126); Add_Action (Table.States (959), 94, 127); Add_Action (Table.States (959), 95, 128); Add_Action (Table.States (959), 103, 129); Add_Action (Table.States (959), 104, 119); Add_Action (Table.States (959), 105, 33); Add_Action (Table.States (959), 106, 34); Add_Error (Table.States (959)); Add_Goto (Table.States (959), 117, 130); Add_Goto (Table.States (959), 128, 41); Add_Goto (Table.States (959), 167, 1089); Add_Goto (Table.States (959), 197, 133); Add_Goto (Table.States (959), 239, 477); Add_Goto (Table.States (959), 258, 135); Add_Goto (Table.States (959), 272, 92); Add_Goto (Table.States (959), 277, 478); Add_Goto (Table.States (959), 293, 97); Add_Goto (Table.States (959), 301, 479); Add_Goto (Table.States (959), 314, 480); Add_Goto (Table.States (959), 320, 144); Add_Goto (Table.States (959), 321, 145); Add_Goto (Table.States (959), 330, 146); Table.States (959).Kernel := To_Vector ((0 => (168, 83, 1, True))); Table.States (959).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (959).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (960), 37, Reduce, (230, 0), 6, null, null); Add_Action (Table.States (960), 76, 235); Add_Action (Table.States (960), 84, 237); Add_Action (Table.States (960), 87, Reduce, (230, 0), 6, null, null); Add_Action (Table.States (960), 101, 239); Add_Action (Table.States (960), 102, 240); Add_Error (Table.States (960)); Add_Goto (Table.States (960), 115, 241); Add_Goto (Table.States (960), 322, 242); Table.States (960).Kernel := To_Vector (((128, 239, 2, True), (230, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (960).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 230, 6))); end Subr_16; procedure Subr_17 is begin Add_Action (Table.States (961), 96, 1090); Add_Error (Table.States (961)); Table.States (961).Kernel := To_Vector ((0 => (235, 192, 1, False))); Table.States (961).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1090))); Add_Action (Table.States (962), 3, 121); Add_Action (Table.States (962), 39, 122); Add_Action (Table.States (962), 40, 123); Add_Action (Table.States (962), 41, 124); Add_Action (Table.States (962), 76, 126); Add_Action (Table.States (962), 94, 127); Add_Action (Table.States (962), 95, 128); Add_Action (Table.States (962), 103, 129); Add_Action (Table.States (962), 104, 119); Add_Action (Table.States (962), 105, 33); Add_Action (Table.States (962), 106, 34); Add_Error (Table.States (962)); Add_Goto (Table.States (962), 117, 130); Add_Goto (Table.States (962), 128, 41); Add_Goto (Table.States (962), 197, 133); Add_Goto (Table.States (962), 239, 134); Add_Goto (Table.States (962), 258, 135); Add_Goto (Table.States (962), 272, 92); Add_Goto (Table.States (962), 293, 97); Add_Goto (Table.States (962), 301, 1091); Add_Goto (Table.States (962), 320, 144); Add_Goto (Table.States (962), 321, 145); Add_Goto (Table.States (962), 330, 146); Table.States (962).Kernel := To_Vector ((0 => (144, 12, 6, False))); Table.States (962).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (963), 54, 1092); Add_Error (Table.States (963)); Table.States (963).Kernel := To_Vector ((0 => (281, 24, 2, False))); Table.States (963).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 54, 1092))); Add_Action (Table.States (964), (24, 104), (145, 0), 2, null, null); Table.States (964).Kernel := To_Vector ((0 => (145, 144, 0, True))); Table.States (964).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 145, 2))); Table.States (964).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (965), 77, Reduce, (254, 3), 4, parameter_specification_3'Access, null); Add_Action (Table.States (965), 82, 1093); Add_Action (Table.States (965), 96, Reduce, (254, 3), 4, parameter_specification_3'Access, null); Add_Error (Table.States (965)); Table.States (965).Kernel := To_Vector (((254, 114, 1, False), (254, 114, 0, False))); Table.States (965).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 254, 4))); Add_Action (Table.States (966), 40, 386); Add_Action (Table.States (966), 104, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (966), 105, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (966), 106, Reduce, (241, 1), 0, null, null); Add_Error (Table.States (966)); Add_Goto (Table.States (966), 241, 1094); Table.States (966).Kernel := To_Vector (((254, 236, 2, False), (254, 236, 1, False))); Table.States (966).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 0))); Add_Action (Table.States (967), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (215, 2), 7, generic_renaming_declaration_2'Access, null); Table.States (967).Kernel := To_Vector ((0 => (215, 96, 0, False))); Table.States (967).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 215, 7))); Add_Action (Table.States (968), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (215, 0), 7, generic_renaming_declaration_0'Access, null); Table.States (968).Kernel := To_Vector ((0 => (215, 96, 0, False))); Table.States (968).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 215, 7))); Add_Action (Table.States (969), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (215, 1), 7, generic_renaming_declaration_1'Access, null); Table.States (969).Kernel := To_Vector ((0 => (215, 96, 0, False))); Table.States (969).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 215, 7))); Add_Action (Table.States (970), (1 => 39), (109, 0), 2, null, null); Table.States (970).Kernel := To_Vector ((0 => (109, 36, 0, False))); Table.States (970).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 109, 2))); Add_Action (Table.States (971), 20, 1095); Add_Action (Table.States (971), 74, Reduce, (202, 7), 2, null, null); Add_Action (Table.States (971), 96, Reduce, (202, 7), 2, null, null); Add_Error (Table.States (971)); Table.States (971).Kernel := To_Vector (((202, 80, 2, False), (202, 80, 0, False))); Table.States (971).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 2))); Add_Action (Table.States (972), (74, 96), (202, 5), 2, null, null); Table.States (972).Kernel := To_Vector ((0 => (202, 80, 0, False))); Table.States (972).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 2))); Add_Action (Table.States (973), (74, 96), (202, 4), 2, null, null); Table.States (973).Kernel := To_Vector ((0 => (202, 80, 0, False))); Table.States (973).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 2))); Add_Action (Table.States (974), (74, 96), (202, 3), 2, null, null); Table.States (974).Kernel := To_Vector ((0 => (202, 80, 0, False))); Table.States (974).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 2))); Add_Action (Table.States (975), 96, 1096); Add_Error (Table.States (975)); Table.States (975).Kernel := To_Vector ((0 => (201, 122, 1, False))); Table.States (975).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1096))); Add_Action (Table.States (976), 77, 1097); Add_Error (Table.States (976)); Table.States (976).Kernel := To_Vector ((0 => (202, 80, 1, False))); Table.States (976).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1097))); Add_Action (Table.States (977), 104, 119); Add_Action (Table.States (977), 105, 33); Add_Action (Table.States (977), 106, 34); Add_Error (Table.States (977)); Add_Goto (Table.States (977), 128, 41); Add_Goto (Table.States (977), 239, 1098); Add_Goto (Table.States (977), 272, 92); Add_Goto (Table.States (977), 293, 97); Table.States (977).Kernel := To_Vector (((203, 39, 3, False), (203, 39, 1, False))); Table.States (977).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (978), (74, 96), (202, 0), 2, null, null); Table.States (978).Kernel := To_Vector ((0 => (202, 49, 0, False))); Table.States (978).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 2))); Add_Action (Table.States (979), 96, 1099); Add_Error (Table.States (979)); Table.States (979).Kernel := To_Vector ((0 => (201, 122, 1, False))); Table.States (979).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1099))); Add_Action (Table.States (980), 74, Reduce, (205, 1), 0, null, null); Add_Action (Table.States (980), 76, 1100); Add_Action (Table.States (980), 84, 237); Add_Action (Table.States (980), 96, Reduce, (205, 1), 0, null, null); Add_Action (Table.States (980), 101, 239); Add_Action (Table.States (980), 102, 240); Add_Error (Table.States (980)); Add_Goto (Table.States (980), 115, 241); Add_Goto (Table.States (980), 205, 1101); Add_Goto (Table.States (980), 322, 242); Table.States (980).Kernel := To_Vector (((128, 239, 2, True), (204, 239, 1, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (980).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 205, 0))); Add_Action (Table.States (981), (29, 47, 48, 50, 69, 71, 74, 104), (200, 2), 6, formal_subprogram_declaration_2'Access, null); Table.States (981).Kernel := To_Vector ((0 => (200, 96, 0, False))); Table.States (981).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 200, 6))); Add_Action (Table.States (982), 96, 1102); Add_Error (Table.States (982)); Table.States (982).Kernel := To_Vector ((0 => (200, 122, 1, False))); Table.States (982).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1102))); Add_Action (Table.States (983), (29, 47, 48, 50, 69, 71, 74, 104), (200, 1), 6, formal_subprogram_declaration_1'Access, null); Table.States (983).Kernel := To_Vector ((0 => (200, 96, 0, False))); Table.States (983).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 200, 6))); Add_Action (Table.States (984), 74, 337); Add_Action (Table.States (984), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (984)); Add_Goto (Table.States (984), 122, 1103); Table.States (984).Kernel := To_Vector ((0 => (198, 192, 1, False))); Table.States (984).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (985), (29, 47, 48, 50, 69, 71, 74, 104), (198, 3), 6, formal_object_declaration_3'Access, null); Table.States (985).Kernel := To_Vector ((0 => (198, 96, 0, False))); Table.States (985).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 198, 6))); Add_Action (Table.States (986), 3, 121); Add_Action (Table.States (986), 39, 122); Add_Action (Table.States (986), 40, 123); Add_Action (Table.States (986), 41, 124); Add_Action (Table.States (986), 52, 125); Add_Action (Table.States (986), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (986), 76, 126); Add_Action (Table.States (986), 94, 127); Add_Action (Table.States (986), 95, 128); Add_Action (Table.States (986), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (986), 103, 129); Add_Action (Table.States (986), 104, 119); Add_Action (Table.States (986), 105, 33); Add_Action (Table.States (986), 106, 34); Add_Error (Table.States (986)); Add_Goto (Table.States (986), 117, 130); Add_Goto (Table.States (986), 128, 41); Add_Goto (Table.States (986), 191, 131); Add_Goto (Table.States (986), 192, 1104); Add_Goto (Table.States (986), 197, 133); Add_Goto (Table.States (986), 239, 134); Add_Goto (Table.States (986), 258, 135); Add_Goto (Table.States (986), 272, 92); Add_Goto (Table.States (986), 275, 136); Add_Goto (Table.States (986), 282, 137); Add_Goto (Table.States (986), 283, 138); Add_Goto (Table.States (986), 284, 139); Add_Goto (Table.States (986), 285, 140); Add_Goto (Table.States (986), 286, 141); Add_Goto (Table.States (986), 287, 142); Add_Goto (Table.States (986), 293, 97); Add_Goto (Table.States (986), 301, 143); Add_Goto (Table.States (986), 320, 144); Add_Goto (Table.States (986), 321, 145); Add_Goto (Table.States (986), 330, 146); Table.States (986).Kernel := To_Vector ((0 => (198, 82, 1, False))); Table.States (986).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (987), 96, 1105); Add_Error (Table.States (987)); Table.States (987).Kernel := To_Vector ((0 => (198, 122, 1, False))); Table.States (987).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1105))); Add_Action (Table.States (988), 32, 1106); Add_Error (Table.States (988)); Table.States (988).Kernel := To_Vector ((0 => (222, 24, 2, False))); Table.States (988).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 32, 1106))); Add_Action (Table.States (989), 4, 1); Add_Action (Table.States (989), 5, 2); Add_Action (Table.States (989), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (989), 15, 3); Add_Action (Table.States (989), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (989), 18, 4); Add_Action (Table.States (989), 22, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (989), 23, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (989), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (989), 27, 5); Add_Action (Table.States (989), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (989), 31, 9); Add_Action (Table.States (989), 32, 10); Add_Action (Table.States (989), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (989), 41, 13); Add_Action (Table.States (989), 48, 16); Add_Action (Table.States (989), 52, 20); Add_Action (Table.States (989), 57, 21); Add_Action (Table.States (989), 58, 22); Add_Action (Table.States (989), 61, 24); Add_Action (Table.States (989), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (989), 93, 31); Add_Action (Table.States (989), 104, 360); Add_Action (Table.States (989), 105, 33); Add_Action (Table.States (989), 106, 34); Add_Error (Table.States (989)); Add_Goto (Table.States (989), 113, 36); Add_Goto (Table.States (989), 123, 38); Add_Goto (Table.States (989), 126, 39); Add_Goto (Table.States (989), 128, 41); Add_Goto (Table.States (989), 131, 42); Add_Goto (Table.States (989), 132, 43); Add_Goto (Table.States (989), 133, 44); Add_Goto (Table.States (989), 139, 47); Add_Goto (Table.States (989), 151, 50); Add_Goto (Table.States (989), 152, 51); Add_Goto (Table.States (989), 161, 53); Add_Goto (Table.States (989), 190, 57); Add_Goto (Table.States (989), 196, 59); Add_Goto (Table.States (989), 217, 68); Add_Goto (Table.States (989), 222, 70); Add_Goto (Table.States (989), 232, 72); Add_Goto (Table.States (989), 239, 73); Add_Goto (Table.States (989), 257, 83); Add_Goto (Table.States (989), 261, 86); Add_Goto (Table.States (989), 272, 92); Add_Goto (Table.States (989), 276, 93); Add_Goto (Table.States (989), 290, 96); Add_Goto (Table.States (989), 293, 97); Add_Goto (Table.States (989), 294, 98); Add_Goto (Table.States (989), 298, 99); Add_Goto (Table.States (989), 299, 361); Add_Goto (Table.States (989), 300, 1107); Add_Goto (Table.States (989), 302, 100); Add_Goto (Table.States (989), 303, 101); Add_Goto (Table.States (989), 306, 363); Add_Goto (Table.States (989), 323, 114); Table.States (989).Kernel := To_Vector ((0 => (174, 68, 0, False))); Table.States (989).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (990), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (222, 3), 7, if_statement_3'Access, null); Table.States (990).Kernel := To_Vector ((0 => (222, 96, 0, False))); Table.States (990).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 222, 7))); Add_Action (Table.States (991), 24, 1108); Add_Error (Table.States (991)); Table.States (991).Kernel := To_Vector ((0 => (222, 300, 3, False))); Table.States (991).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1108))); Add_Action (Table.States (992), 96, 1109); Add_Error (Table.States (992)); Table.States (992).Kernel := To_Vector ((0 => (222, 32, 1, False))); Table.States (992).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1109))); Add_Action (Table.States (993), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (248, 0), 7, package_body_stub_0'Access, null); Table.States (993).Kernel := To_Vector ((0 => (248, 96, 0, False))); Table.States (993).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 248, 7))); Add_Action (Table.States (994), 4, 1); Add_Action (Table.States (994), 5, 2); Add_Action (Table.States (994), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (994), 15, 3); Add_Action (Table.States (994), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (994), 18, 4); Add_Action (Table.States (994), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (994), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (994), 27, 5); Add_Action (Table.States (994), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (994), 31, 9); Add_Action (Table.States (994), 32, 10); Add_Action (Table.States (994), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (994), 41, 13); Add_Action (Table.States (994), 48, 16); Add_Action (Table.States (994), 52, 20); Add_Action (Table.States (994), 57, 21); Add_Action (Table.States (994), 58, 22); Add_Action (Table.States (994), 61, 24); Add_Action (Table.States (994), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (994), 93, 31); Add_Action (Table.States (994), 104, 360); Add_Action (Table.States (994), 105, 33); Add_Action (Table.States (994), 106, 34); Add_Error (Table.States (994)); Add_Goto (Table.States (994), 113, 36); Add_Goto (Table.States (994), 123, 38); Add_Goto (Table.States (994), 126, 39); Add_Goto (Table.States (994), 128, 41); Add_Goto (Table.States (994), 131, 42); Add_Goto (Table.States (994), 132, 43); Add_Goto (Table.States (994), 133, 44); Add_Goto (Table.States (994), 139, 47); Add_Goto (Table.States (994), 151, 50); Add_Goto (Table.States (994), 152, 51); Add_Goto (Table.States (994), 161, 53); Add_Goto (Table.States (994), 190, 57); Add_Goto (Table.States (994), 196, 59); Add_Goto (Table.States (994), 217, 68); Add_Goto (Table.States (994), 218, 1110); Add_Goto (Table.States (994), 222, 70); Add_Goto (Table.States (994), 232, 72); Add_Goto (Table.States (994), 239, 73); Add_Goto (Table.States (994), 257, 83); Add_Goto (Table.States (994), 261, 86); Add_Goto (Table.States (994), 272, 92); Add_Goto (Table.States (994), 276, 93); Add_Goto (Table.States (994), 290, 96); Add_Goto (Table.States (994), 293, 97); Add_Goto (Table.States (994), 294, 98); Add_Goto (Table.States (994), 298, 99); Add_Goto (Table.States (994), 299, 361); Add_Goto (Table.States (994), 300, 390); Add_Goto (Table.States (994), 302, 100); Add_Goto (Table.States (994), 303, 101); Add_Goto (Table.States (994), 306, 363); Add_Goto (Table.States (994), 323, 114); Table.States (994).Kernel := To_Vector ((0 => (247, 13, 2, False))); Table.States (994).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (995), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (995), 104, 119); Add_Action (Table.States (995), 105, 33); Add_Action (Table.States (995), 106, 34); Add_Error (Table.States (995)); Add_Goto (Table.States (995), 128, 41); Add_Goto (Table.States (995), 239, 630); Add_Goto (Table.States (995), 240, 1111); Add_Goto (Table.States (995), 272, 92); Add_Goto (Table.States (995), 293, 97); Table.States (995).Kernel := To_Vector ((0 => (247, 24, 1, False))); Table.States (995).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (996), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (213, 0), 7, generic_instantiation_0'Access, null); Table.States (996).Kernel := To_Vector ((0 => (213, 96, 0, False))); Table.States (996).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 213, 7))); Add_Action (Table.States (997), (1 => 96), (251, 1), 7, package_specification_1'Access, package_specification_1_check'Access); Table.States (997).Kernel := To_Vector ((0 => (251, 240, 0, False))); Table.States (997).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 251, 7))); Add_Action (Table.States (998), 24, 1112); Add_Error (Table.States (998)); Table.States (998).Kernel := To_Vector ((0 => (251, 159, 1, False))); Table.States (998).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1112))); Add_Action (Table.States (999), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (265, 0), 7, protected_body_stub_0'Access, null); Table.States (999).Kernel := To_Vector ((0 => (265, 96, 0, False))); Table.States (999).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 265, 7))); Add_Action (Table.States (1000), 72, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (1000), 76, 1113); Add_Error (Table.States (1000)); Add_Goto (Table.States (1000), 177, 1114); Add_Goto (Table.States (1000), 199, 344); Add_Goto (Table.States (1000), 253, 1115); Table.States (1000).Kernel := To_Vector ((0 => (176, 104, 5, False))); Table.States (1000).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 177, 0))); Add_Action (Table.States (1001), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (1001), 74, 337); Add_Action (Table.States (1001), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1001)); Add_Goto (Table.States (1001), 122, 430); Table.States (1001).Kernel := To_Vector (((307, 312, 4, False), (309, 312, 1, False))); Table.States (1001).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1002), (24, 25, 28, 29, 40, 46, 50), (268, 0), 2, null, null); Table.States (1002).Kernel := To_Vector ((0 => (268, 267, 0, True))); Table.States (1002).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 268, 2))); Table.States (1002).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1003), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1003), 104, 149); Add_Error (Table.States (1003)); Add_Goto (Table.States (1003), 220, 1116); Table.States (1003).Kernel := To_Vector ((0 => (264, 24, 1, False))); Table.States (1003).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1004), 104, 119); Add_Action (Table.States (1004), 105, 33); Add_Action (Table.States (1004), 106, 34); Add_Error (Table.States (1004)); Add_Goto (Table.States (1004), 128, 41); Add_Goto (Table.States (1004), 227, 1117); Add_Goto (Table.States (1004), 239, 841); Add_Goto (Table.States (1004), 272, 92); Add_Goto (Table.States (1004), 293, 97); Table.States (1004).Kernel := To_Vector ((0 => (271, 39, 4, False))); Table.States (1004).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1005), 96, 1118); Add_Error (Table.States (1005)); Table.States (1005).Kernel := To_Vector ((0 => (271, 266, 1, False))); Table.States (1005).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1118))); Add_Action (Table.States (1006), 104, 119); Add_Action (Table.States (1006), 105, 33); Add_Action (Table.States (1006), 106, 34); Add_Error (Table.States (1006)); Add_Goto (Table.States (1006), 128, 41); Add_Goto (Table.States (1006), 239, 1119); Add_Goto (Table.States (1006), 272, 92); Add_Goto (Table.States (1006), 293, 97); Table.States (1006).Kernel := To_Vector ((0 => (227, 10, 1, True))); Table.States (1006).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (1006).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1007), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1007), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1007), 28, 183); Add_Action (Table.States (1007), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1007), 30, 8); Add_Action (Table.States (1007), 40, 12); Add_Action (Table.States (1007), 46, 14); Add_Action (Table.States (1007), 47, 15); Add_Action (Table.States (1007), 48, 16); Add_Action (Table.States (1007), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1007), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1007), 51, 19); Add_Action (Table.States (1007), 63, 25); Add_Action (Table.States (1007), 66, 26); Add_Action (Table.States (1007), 69, 27); Add_Action (Table.States (1007), 71, 28); Add_Action (Table.States (1007), 104, 185); Add_Error (Table.States (1007)); Add_Goto (Table.States (1007), 112, 35); Add_Goto (Table.States (1007), 121, 37); Add_Goto (Table.States (1007), 127, 40); Add_Goto (Table.States (1007), 134, 45); Add_Goto (Table.States (1007), 135, 46); Add_Goto (Table.States (1007), 157, 391); Add_Goto (Table.States (1007), 158, 392); Add_Goto (Table.States (1007), 159, 667); Add_Goto (Table.States (1007), 179, 54); Add_Goto (Table.States (1007), 182, 55); Add_Goto (Table.States (1007), 186, 56); Add_Goto (Table.States (1007), 193, 58); Add_Goto (Table.States (1007), 206, 60); Add_Goto (Table.States (1007), 207, 61); Add_Goto (Table.States (1007), 209, 62); Add_Goto (Table.States (1007), 210, 63); Add_Goto (Table.States (1007), 213, 64); Add_Goto (Table.States (1007), 214, 65); Add_Goto (Table.States (1007), 215, 66); Add_Goto (Table.States (1007), 216, 67); Add_Goto (Table.States (1007), 219, 69); Add_Goto (Table.States (1007), 223, 71); Add_Goto (Table.States (1007), 243, 74); Add_Goto (Table.States (1007), 244, 75); Add_Goto (Table.States (1007), 245, 76); Add_Goto (Table.States (1007), 246, 77); Add_Goto (Table.States (1007), 247, 78); Add_Goto (Table.States (1007), 248, 79); Add_Goto (Table.States (1007), 249, 80); Add_Goto (Table.States (1007), 250, 81); Add_Goto (Table.States (1007), 251, 82); Add_Goto (Table.States (1007), 257, 394); Add_Goto (Table.States (1007), 259, 84); Add_Goto (Table.States (1007), 260, 85); Add_Goto (Table.States (1007), 262, 87); Add_Goto (Table.States (1007), 263, 88); Add_Goto (Table.States (1007), 264, 89); Add_Goto (Table.States (1007), 265, 90); Add_Goto (Table.States (1007), 266, 1120); Add_Goto (Table.States (1007), 271, 91); Add_Goto (Table.States (1007), 281, 94); Add_Goto (Table.States (1007), 289, 95); Add_Goto (Table.States (1007), 304, 102); Add_Goto (Table.States (1007), 305, 103); Add_Goto (Table.States (1007), 307, 105); Add_Goto (Table.States (1007), 308, 106); Add_Goto (Table.States (1007), 309, 107); Add_Goto (Table.States (1007), 311, 108); Add_Goto (Table.States (1007), 313, 109); Add_Goto (Table.States (1007), 316, 111); Add_Goto (Table.States (1007), 317, 112); Add_Goto (Table.States (1007), 319, 113); Add_Goto (Table.States (1007), 325, 115); Add_Goto (Table.States (1007), 331, 116); Table.States (1007).Kernel := To_Vector ((0 => (304, 74, 2, False))); Table.States (1007).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (1008), (1 => 96), (266, 1), 3, protected_definition_1'Access, protected_definition_1_check'Access); Table.States (1008).Kernel := To_Vector ((0 => (266, 220, 0, False))); Table.States (1008).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 266, 3))); Add_Action (Table.States (1009), 24, 1121); Add_Error (Table.States (1009)); Table.States (1009).Kernel := To_Vector ((0 => (266, 159, 1, False))); Table.States (1009).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1121))); Add_Action (Table.States (1010), 3, 121); Add_Action (Table.States (1010), 21, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1010), 39, 122); Add_Action (Table.States (1010), 40, 123); Add_Action (Table.States (1010), 41, 124); Add_Action (Table.States (1010), 52, 125); Add_Action (Table.States (1010), 76, 126); Add_Action (Table.States (1010), 94, 127); Add_Action (Table.States (1010), 95, 128); Add_Action (Table.States (1010), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1010), 103, 129); Add_Action (Table.States (1010), 104, 119); Add_Action (Table.States (1010), 105, 33); Add_Action (Table.States (1010), 106, 34); Add_Error (Table.States (1010)); Add_Goto (Table.States (1010), 117, 130); Add_Goto (Table.States (1010), 128, 41); Add_Goto (Table.States (1010), 191, 131); Add_Goto (Table.States (1010), 192, 1122); Add_Goto (Table.States (1010), 197, 133); Add_Goto (Table.States (1010), 239, 134); Add_Goto (Table.States (1010), 258, 135); Add_Goto (Table.States (1010), 272, 92); Add_Goto (Table.States (1010), 275, 136); Add_Goto (Table.States (1010), 282, 137); Add_Goto (Table.States (1010), 283, 138); Add_Goto (Table.States (1010), 284, 139); Add_Goto (Table.States (1010), 285, 140); Add_Goto (Table.States (1010), 286, 141); Add_Goto (Table.States (1010), 287, 142); Add_Goto (Table.States (1010), 293, 97); Add_Goto (Table.States (1010), 301, 143); Add_Goto (Table.States (1010), 320, 144); Add_Goto (Table.States (1010), 321, 145); Add_Goto (Table.States (1010), 330, 146); Table.States (1010).Kernel := To_Vector ((0 => (194, 82, 0, False))); Table.States (1010).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1011), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (196, 0), 7, extended_return_statement_0'Access, null); Table.States (1011).Kernel := To_Vector ((0 => (196, 96, 0, False))); Table.States (1011).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 196, 7))); Add_Action (Table.States (1012), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (1012), 74, 337); Add_Action (Table.States (1012), 76, 235); Add_Action (Table.States (1012), 84, 237); Add_Action (Table.States (1012), 101, 239); Add_Action (Table.States (1012), 102, 240); Add_Error (Table.States (1012)); Add_Goto (Table.States (1012), 115, 241); Add_Goto (Table.States (1012), 122, 511); Add_Goto (Table.States (1012), 322, 242); Table.States (1012).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (247, 239, 4, False), (247, 239, 3, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1012).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1013), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (1013), 74, 337); Add_Error (Table.States (1013)); Add_Goto (Table.States (1013), 122, 520); Table.States (1013).Kernel := To_Vector ((0 => (264, 104, 3, False))); Table.States (1013).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1014), 35, Reduce, (122, 1), 0, null, null); Add_Action (Table.States (1014), 74, 337); Add_Error (Table.States (1014)); Add_Goto (Table.States (1014), 122, 540); Table.States (1014).Kernel := To_Vector ((0 => (316, 104, 4, False))); Table.States (1014).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1015), 35, 585); Add_Error (Table.States (1015)); Table.States (1015).Kernel := To_Vector ((0 => (307, 122, 4, False))); Table.States (1015).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 585))); Add_Action (Table.States (1016), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (152, 0), 7, conditional_entry_call_0'Access, null); Table.States (1016).Kernel := To_Vector ((0 => (152, 96, 0, False))); Table.States (1016).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 152, 7))); Add_Action (Table.States (1017), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (323, 0), 7, timed_entry_call_0'Access, null); Table.States (1017).Kernel := To_Vector ((0 => (323, 96, 0, False))); Table.States (1017).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 323, 7))); Add_Action (Table.States (1018), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (294, 0), 7, selective_accept_0'Access, null); Table.States (1018).Kernel := To_Vector ((0 => (294, 96, 0, False))); Table.States (1018).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 294, 7))); Add_Action (Table.States (1019), 96, 1123); Add_Error (Table.States (1019)); Table.States (1019).Kernel := To_Vector ((0 => (126, 61, 1, False))); Table.States (1019).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1123))); Add_Action (Table.States (1020), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (317, 0), 7, task_body_stub_0'Access, null); Table.States (1020).Kernel := To_Vector ((0 => (317, 96, 0, False))); Table.States (1020).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 317, 7))); Add_Action (Table.States (1021), 4, 1); Add_Action (Table.States (1021), 5, 2); Add_Action (Table.States (1021), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1021), 15, 3); Add_Action (Table.States (1021), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1021), 18, 4); Add_Action (Table.States (1021), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1021), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1021), 27, 5); Add_Action (Table.States (1021), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1021), 31, 9); Add_Action (Table.States (1021), 32, 10); Add_Action (Table.States (1021), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1021), 41, 13); Add_Action (Table.States (1021), 48, 16); Add_Action (Table.States (1021), 52, 20); Add_Action (Table.States (1021), 57, 21); Add_Action (Table.States (1021), 58, 22); Add_Action (Table.States (1021), 61, 24); Add_Action (Table.States (1021), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1021), 93, 31); Add_Action (Table.States (1021), 104, 360); Add_Action (Table.States (1021), 105, 33); Add_Action (Table.States (1021), 106, 34); Add_Error (Table.States (1021)); Add_Goto (Table.States (1021), 113, 36); Add_Goto (Table.States (1021), 123, 38); Add_Goto (Table.States (1021), 126, 39); Add_Goto (Table.States (1021), 128, 41); Add_Goto (Table.States (1021), 131, 42); Add_Goto (Table.States (1021), 132, 43); Add_Goto (Table.States (1021), 133, 44); Add_Goto (Table.States (1021), 139, 47); Add_Goto (Table.States (1021), 151, 50); Add_Goto (Table.States (1021), 152, 51); Add_Goto (Table.States (1021), 161, 53); Add_Goto (Table.States (1021), 190, 57); Add_Goto (Table.States (1021), 196, 59); Add_Goto (Table.States (1021), 217, 68); Add_Goto (Table.States (1021), 218, 1124); Add_Goto (Table.States (1021), 222, 70); Add_Goto (Table.States (1021), 232, 72); Add_Goto (Table.States (1021), 239, 73); Add_Goto (Table.States (1021), 257, 83); Add_Goto (Table.States (1021), 261, 86); Add_Goto (Table.States (1021), 272, 92); Add_Goto (Table.States (1021), 276, 93); Add_Goto (Table.States (1021), 290, 96); Add_Goto (Table.States (1021), 293, 97); Add_Goto (Table.States (1021), 294, 98); Add_Goto (Table.States (1021), 298, 99); Add_Goto (Table.States (1021), 299, 361); Add_Goto (Table.States (1021), 300, 390); Add_Goto (Table.States (1021), 302, 100); Add_Goto (Table.States (1021), 303, 101); Add_Goto (Table.States (1021), 306, 363); Add_Goto (Table.States (1021), 323, 114); Table.States (1021).Kernel := To_Vector ((0 => (316, 13, 2, False))); Table.States (1021).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (1022), 104, 119); Add_Action (Table.States (1022), 105, 33); Add_Action (Table.States (1022), 106, 34); Add_Error (Table.States (1022)); Add_Goto (Table.States (1022), 128, 41); Add_Goto (Table.States (1022), 227, 1125); Add_Goto (Table.States (1022), 239, 841); Add_Goto (Table.States (1022), 272, 92); Add_Goto (Table.States (1022), 293, 97); Table.States (1022).Kernel := To_Vector ((0 => (319, 39, 4, False))); Table.States (1022).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1023), 24, 1126); Add_Error (Table.States (1023)); Table.States (1023).Kernel := To_Vector ((0 => (319, 318, 2, False))); Table.States (1023).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1126))); Add_Action (Table.States (1024), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1024), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1024), 28, 183); Add_Action (Table.States (1024), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1024), 30, 8); Add_Action (Table.States (1024), 40, 12); Add_Action (Table.States (1024), 46, 14); Add_Action (Table.States (1024), 47, 15); Add_Action (Table.States (1024), 48, 16); Add_Action (Table.States (1024), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1024), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1024), 51, 19); Add_Action (Table.States (1024), 63, 25); Add_Action (Table.States (1024), 66, 26); Add_Action (Table.States (1024), 69, 27); Add_Action (Table.States (1024), 71, 28); Add_Action (Table.States (1024), 104, 185); Add_Error (Table.States (1024)); Add_Goto (Table.States (1024), 112, 35); Add_Goto (Table.States (1024), 121, 37); Add_Goto (Table.States (1024), 127, 40); Add_Goto (Table.States (1024), 134, 45); Add_Goto (Table.States (1024), 135, 46); Add_Goto (Table.States (1024), 157, 391); Add_Goto (Table.States (1024), 158, 392); Add_Goto (Table.States (1024), 159, 692); Add_Goto (Table.States (1024), 179, 54); Add_Goto (Table.States (1024), 182, 55); Add_Goto (Table.States (1024), 186, 56); Add_Goto (Table.States (1024), 193, 58); Add_Goto (Table.States (1024), 206, 60); Add_Goto (Table.States (1024), 207, 61); Add_Goto (Table.States (1024), 209, 62); Add_Goto (Table.States (1024), 210, 63); Add_Goto (Table.States (1024), 213, 64); Add_Goto (Table.States (1024), 214, 65); Add_Goto (Table.States (1024), 215, 66); Add_Goto (Table.States (1024), 216, 67); Add_Goto (Table.States (1024), 219, 69); Add_Goto (Table.States (1024), 223, 71); Add_Goto (Table.States (1024), 243, 74); Add_Goto (Table.States (1024), 244, 75); Add_Goto (Table.States (1024), 245, 76); Add_Goto (Table.States (1024), 246, 77); Add_Goto (Table.States (1024), 247, 78); Add_Goto (Table.States (1024), 248, 79); Add_Goto (Table.States (1024), 249, 80); Add_Goto (Table.States (1024), 250, 81); Add_Goto (Table.States (1024), 251, 82); Add_Goto (Table.States (1024), 257, 394); Add_Goto (Table.States (1024), 259, 84); Add_Goto (Table.States (1024), 260, 85); Add_Goto (Table.States (1024), 262, 87); Add_Goto (Table.States (1024), 263, 88); Add_Goto (Table.States (1024), 264, 89); Add_Goto (Table.States (1024), 265, 90); Add_Goto (Table.States (1024), 271, 91); Add_Goto (Table.States (1024), 281, 94); Add_Goto (Table.States (1024), 289, 95); Add_Goto (Table.States (1024), 304, 102); Add_Goto (Table.States (1024), 305, 103); Add_Goto (Table.States (1024), 307, 105); Add_Goto (Table.States (1024), 308, 106); Add_Goto (Table.States (1024), 309, 107); Add_Goto (Table.States (1024), 311, 108); Add_Goto (Table.States (1024), 313, 109); Add_Goto (Table.States (1024), 316, 111); Add_Goto (Table.States (1024), 317, 112); Add_Goto (Table.States (1024), 318, 1127); Add_Goto (Table.States (1024), 319, 113); Add_Goto (Table.States (1024), 325, 115); Add_Goto (Table.States (1024), 331, 116); Table.States (1024).Kernel := To_Vector ((0 => (305, 74, 2, False))); Table.States (1024).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 0))); end Subr_17; procedure Subr_18 is begin Add_Action (Table.States (1025), (1 => 24), (318, 0), 3, task_definition_0'Access, null); Table.States (1025).Kernel := To_Vector ((0 => (318, 159, 0, False))); Table.States (1025).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 3))); Add_Action (Table.States (1026), 96, 1128); Add_Error (Table.States (1026)); Table.States (1026).Kernel := To_Vector ((0 => (305, 220, 1, False))); Table.States (1026).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1128))); Add_Action (Table.States (1027), 7, Reduce, (241, 0), 2, null, null); Add_Action (Table.States (1027), 104, 1129); Add_Action (Table.States (1027), 105, 33); Add_Action (Table.States (1027), 106, 34); Add_Error (Table.States (1027)); Add_Goto (Table.States (1027), 128, 41); Add_Goto (Table.States (1027), 239, 871); Add_Goto (Table.States (1027), 272, 92); Add_Goto (Table.States (1027), 293, 1130); Table.States (1027).Kernel := To_Vector (((241, 41, 0, False), (242, 41, 1, False), (242, 41, 3, False))); Table.States (1027).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 241, 2))); Add_Action (Table.States (1028), 3, 121); Add_Action (Table.States (1028), 39, 122); Add_Action (Table.States (1028), 40, 123); Add_Action (Table.States (1028), 41, 124); Add_Action (Table.States (1028), 52, 125); Add_Action (Table.States (1028), 76, 126); Add_Action (Table.States (1028), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1028), 94, 127); Add_Action (Table.States (1028), 95, 128); Add_Action (Table.States (1028), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1028), 103, 129); Add_Action (Table.States (1028), 104, 119); Add_Action (Table.States (1028), 105, 33); Add_Action (Table.States (1028), 106, 34); Add_Error (Table.States (1028)); Add_Goto (Table.States (1028), 117, 130); Add_Goto (Table.States (1028), 128, 41); Add_Goto (Table.States (1028), 191, 131); Add_Goto (Table.States (1028), 192, 1131); Add_Goto (Table.States (1028), 197, 133); Add_Goto (Table.States (1028), 239, 134); Add_Goto (Table.States (1028), 258, 135); Add_Goto (Table.States (1028), 272, 92); Add_Goto (Table.States (1028), 275, 136); Add_Goto (Table.States (1028), 282, 137); Add_Goto (Table.States (1028), 283, 138); Add_Goto (Table.States (1028), 284, 139); Add_Goto (Table.States (1028), 285, 140); Add_Goto (Table.States (1028), 286, 141); Add_Goto (Table.States (1028), 287, 142); Add_Goto (Table.States (1028), 293, 97); Add_Goto (Table.States (1028), 301, 143); Add_Goto (Table.States (1028), 320, 144); Add_Goto (Table.States (1028), 321, 145); Add_Goto (Table.States (1028), 330, 146); Table.States (1028).Kernel := To_Vector ((0 => (170, 82, 0, False))); Table.States (1028).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1029), 3, 121); Add_Action (Table.States (1029), 39, 122); Add_Action (Table.States (1029), 40, 123); Add_Action (Table.States (1029), 41, 124); Add_Action (Table.States (1029), 52, 125); Add_Action (Table.States (1029), 76, 126); Add_Action (Table.States (1029), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1029), 94, 127); Add_Action (Table.States (1029), 95, 128); Add_Action (Table.States (1029), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1029), 103, 129); Add_Action (Table.States (1029), 104, 119); Add_Action (Table.States (1029), 105, 33); Add_Action (Table.States (1029), 106, 34); Add_Error (Table.States (1029)); Add_Goto (Table.States (1029), 117, 130); Add_Goto (Table.States (1029), 128, 41); Add_Goto (Table.States (1029), 191, 131); Add_Goto (Table.States (1029), 192, 1132); Add_Goto (Table.States (1029), 197, 133); Add_Goto (Table.States (1029), 239, 134); Add_Goto (Table.States (1029), 258, 135); Add_Goto (Table.States (1029), 272, 92); Add_Goto (Table.States (1029), 275, 136); Add_Goto (Table.States (1029), 282, 137); Add_Goto (Table.States (1029), 283, 138); Add_Goto (Table.States (1029), 284, 139); Add_Goto (Table.States (1029), 285, 140); Add_Goto (Table.States (1029), 286, 141); Add_Goto (Table.States (1029), 287, 142); Add_Goto (Table.States (1029), 293, 97); Add_Goto (Table.States (1029), 301, 143); Add_Goto (Table.States (1029), 320, 144); Add_Goto (Table.States (1029), 321, 145); Add_Goto (Table.States (1029), 330, 146); Table.States (1029).Kernel := To_Vector ((0 => (170, 82, 0, False))); Table.States (1029).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1030), (41, 49, 54), (111, 0), 3, null, null); Table.States (1030).Kernel := To_Vector ((0 => (111, 36, 0, False))); Table.States (1030).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 111, 3))); Add_Action (Table.States (1031), 77, 1133); Add_Action (Table.States (1031), 83, 959); Add_Error (Table.States (1031)); Table.States (1031).Kernel := To_Vector (((120, 168, 3, False), (168, 168, 2, True))); Table.States (1031).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1133))); Add_Action (Table.States (1032), (77, 83), (226, 1), 1, null, null); Table.States (1032).Kernel := To_Vector ((0 => (226, 225, 0, False))); Table.States (1032).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 226, 1))); Add_Action (Table.States (1033), 77, 1134); Add_Action (Table.States (1033), 83, 1135); Add_Error (Table.States (1033)); Table.States (1033).Kernel := To_Vector (((120, 226, 3, False), (226, 226, 4, True))); Table.States (1033).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1134))); Add_Action (Table.States (1034), 38, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 53, 1136); Add_Action (Table.States (1034), 55, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 76, 619); Add_Action (Table.States (1034), 77, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (1034), 78, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 83, Reduce, (314, 3), 1, subtype_indication_3'Access, null); Add_Action (Table.States (1034), 84, 237); Add_Action (Table.States (1034), 85, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 94, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 95, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 97, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 99, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 100, Reduce, (258, 3), 1, null, null); Add_Action (Table.States (1034), 101, 239); Add_Action (Table.States (1034), 102, 240); Add_Error (Table.States (1034)); Add_Goto (Table.States (1034), 115, 241); Add_Goto (Table.States (1034), 155, 620); Add_Goto (Table.States (1034), 224, 621); Add_Goto (Table.States (1034), 322, 448); Table.States (1034).Kernel := To_Vector (((128, 239, 2, True), (225, 239, 2, False), (239, 239, 5, True), (239, 239, 2, True), (258, 239, 0, False), (272, 239, 3, True), (277, 239, 4, False), (277, 239, 2, False), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (314, 239, 4, False), (314, 239, 0, False))); Table.States (1034).Minimal_Complete_Actions := To_Vector (((Reduce, 258, 1), (Reduce, 314, 1))); Add_Action (Table.States (1035), 3, 121); Add_Action (Table.States (1035), 39, 122); Add_Action (Table.States (1035), 40, 123); Add_Action (Table.States (1035), 41, 124); Add_Action (Table.States (1035), 52, 125); Add_Action (Table.States (1035), 53, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1035), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1035), 76, 126); Add_Action (Table.States (1035), 94, 127); Add_Action (Table.States (1035), 95, 128); Add_Action (Table.States (1035), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1035), 103, 129); Add_Action (Table.States (1035), 104, 119); Add_Action (Table.States (1035), 105, 33); Add_Action (Table.States (1035), 106, 34); Add_Error (Table.States (1035)); Add_Goto (Table.States (1035), 117, 130); Add_Goto (Table.States (1035), 128, 41); Add_Goto (Table.States (1035), 191, 131); Add_Goto (Table.States (1035), 192, 1137); Add_Goto (Table.States (1035), 197, 133); Add_Goto (Table.States (1035), 239, 134); Add_Goto (Table.States (1035), 258, 135); Add_Goto (Table.States (1035), 272, 92); Add_Goto (Table.States (1035), 275, 136); Add_Goto (Table.States (1035), 282, 137); Add_Goto (Table.States (1035), 283, 138); Add_Goto (Table.States (1035), 284, 139); Add_Goto (Table.States (1035), 285, 140); Add_Goto (Table.States (1035), 286, 141); Add_Goto (Table.States (1035), 287, 142); Add_Goto (Table.States (1035), 293, 97); Add_Goto (Table.States (1035), 301, 143); Add_Goto (Table.States (1035), 320, 144); Add_Goto (Table.States (1035), 321, 145); Add_Goto (Table.States (1035), 330, 146); Table.States (1035).Kernel := To_Vector ((0 => (326, 20, 0, False))); Table.States (1035).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1036), 3, 121); Add_Action (Table.States (1036), 39, 122); Add_Action (Table.States (1036), 40, 123); Add_Action (Table.States (1036), 41, 124); Add_Action (Table.States (1036), 76, 126); Add_Action (Table.States (1036), 94, 127); Add_Action (Table.States (1036), 95, 128); Add_Action (Table.States (1036), 103, 129); Add_Action (Table.States (1036), 104, 119); Add_Action (Table.States (1036), 105, 33); Add_Action (Table.States (1036), 106, 34); Add_Error (Table.States (1036)); Add_Goto (Table.States (1036), 117, 130); Add_Goto (Table.States (1036), 128, 41); Add_Goto (Table.States (1036), 197, 133); Add_Goto (Table.States (1036), 239, 134); Add_Goto (Table.States (1036), 258, 135); Add_Goto (Table.States (1036), 272, 92); Add_Goto (Table.States (1036), 293, 97); Add_Goto (Table.States (1036), 301, 1138); Add_Goto (Table.States (1036), 320, 144); Add_Goto (Table.States (1036), 321, 145); Add_Goto (Table.States (1036), 330, 146); Table.States (1036).Kernel := To_Vector ((0 => (279, 53, 3, False))); Table.States (1036).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (1037), (74, 96), (326, 5), 3, null, null); Table.States (1037).Kernel := To_Vector ((0 => (326, 279, 0, False))); Table.States (1037).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 3))); Add_Action (Table.States (1038), (74, 96), (326, 3), 3, null, null); Table.States (1038).Kernel := To_Vector ((0 => (326, 279, 0, False))); Table.States (1038).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 3))); Add_Action (Table.States (1039), 104, 119); Add_Action (Table.States (1039), 105, 33); Add_Action (Table.States (1039), 106, 34); Add_Error (Table.States (1039)); Add_Goto (Table.States (1039), 128, 41); Add_Goto (Table.States (1039), 227, 1139); Add_Goto (Table.States (1039), 239, 841); Add_Goto (Table.States (1039), 272, 92); Add_Goto (Table.States (1039), 293, 97); Table.States (1039).Kernel := To_Vector ((0 => (228, 10, 1, False))); Table.States (1039).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1040), 104, 119); Add_Action (Table.States (1040), 105, 33); Add_Action (Table.States (1040), 106, 34); Add_Error (Table.States (1040)); Add_Goto (Table.States (1040), 128, 41); Add_Goto (Table.States (1040), 227, 1140); Add_Goto (Table.States (1040), 239, 841); Add_Goto (Table.States (1040), 272, 92); Add_Goto (Table.States (1040), 293, 97); Table.States (1040).Kernel := To_Vector ((0 => (228, 10, 1, False))); Table.States (1040).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1041), 3, 121); Add_Action (Table.States (1041), 39, 122); Add_Action (Table.States (1041), 40, 123); Add_Action (Table.States (1041), 41, 124); Add_Action (Table.States (1041), 76, 126); Add_Action (Table.States (1041), 94, 127); Add_Action (Table.States (1041), 95, 128); Add_Action (Table.States (1041), 103, 129); Add_Action (Table.States (1041), 104, 119); Add_Action (Table.States (1041), 105, 33); Add_Action (Table.States (1041), 106, 34); Add_Error (Table.States (1041)); Add_Goto (Table.States (1041), 117, 130); Add_Goto (Table.States (1041), 128, 41); Add_Goto (Table.States (1041), 197, 133); Add_Goto (Table.States (1041), 239, 134); Add_Goto (Table.States (1041), 258, 135); Add_Goto (Table.States (1041), 272, 92); Add_Goto (Table.States (1041), 293, 97); Add_Goto (Table.States (1041), 301, 1141); Add_Goto (Table.States (1041), 320, 144); Add_Goto (Table.States (1041), 321, 145); Add_Goto (Table.States (1041), 330, 146); Table.States (1041).Kernel := To_Vector ((0 => (326, 85, 1, False))); Table.States (1041).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (1042), (1 => 35), (163, 0), 1, null, null); Table.States (1042).Kernel := To_Vector ((0 => (163, 104, 0, False))); Table.States (1042).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 163, 1))); Add_Action (Table.States (1043), (1 => 35), (163, 1), 1, null, null); Table.States (1043).Kernel := To_Vector ((0 => (163, 105, 0, False))); Table.States (1043).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 163, 1))); Add_Action (Table.States (1044), (1 => 35), (164, 0), 1, null, null); Table.States (1044).Kernel := To_Vector ((0 => (164, 163, 0, False))); Table.States (1044).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 164, 1))); Add_Action (Table.States (1045), 35, 1142); Add_Error (Table.States (1045)); Table.States (1045).Kernel := To_Vector ((0 => (327, 164, 6, False))); Table.States (1045).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 1142))); Add_Action (Table.States (1046), (15, 24, 28, 72, 104), (149, 4), 2, component_list_4'Access, null); Table.States (1046).Kernel := To_Vector ((0 => (149, 96, 0, False))); Table.States (1046).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 149, 2))); Add_Action (Table.States (1047), (15, 24, 28, 72, 104), (149, 0), 2, null, null); Table.States (1047).Kernel := To_Vector ((0 => (149, 148, 0, True))); Table.States (1047).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 149, 2))); Table.States (1047).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1048), (15, 24, 28, 72, 104), (149, 1), 2, null, null); Table.States (1048).Kernel := To_Vector ((0 => (149, 327, 0, True))); Table.States (1048).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 149, 2))); Table.States (1048).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1049), 54, 1143); Add_Error (Table.States (1049)); Table.States (1049).Kernel := To_Vector ((0 => (280, 24, 1, False))); Table.States (1049).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 54, 1143))); Add_Action (Table.States (1050), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (1050), 8, 1144); Add_Action (Table.States (1050), 40, 742); Add_Action (Table.States (1050), 104, 119); Add_Action (Table.States (1050), 105, 33); Add_Action (Table.States (1050), 106, 34); Add_Error (Table.States (1050)); Add_Goto (Table.States (1050), 114, 1145); Add_Goto (Table.States (1050), 128, 41); Add_Goto (Table.States (1050), 147, 1146); Add_Goto (Table.States (1050), 239, 484); Add_Goto (Table.States (1050), 241, 721); Add_Goto (Table.States (1050), 272, 92); Add_Goto (Table.States (1050), 293, 97); Add_Goto (Table.States (1050), 314, 1147); Table.States (1050).Kernel := To_Vector (((146, 81, 3, False), (146, 81, 2, False))); Table.States (1050).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1051), 104, 119); Add_Action (Table.States (1051), 105, 33); Add_Action (Table.States (1051), 106, 34); Add_Error (Table.States (1051)); Add_Goto (Table.States (1051), 128, 41); Add_Goto (Table.States (1051), 227, 1148); Add_Goto (Table.States (1051), 239, 841); Add_Goto (Table.States (1051), 272, 92); Add_Goto (Table.States (1051), 293, 97); Table.States (1051).Kernel := To_Vector ((0 => (228, 10, 1, False))); Table.States (1051).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1052), 104, 119); Add_Action (Table.States (1052), 105, 33); Add_Action (Table.States (1052), 106, 34); Add_Error (Table.States (1052)); Add_Goto (Table.States (1052), 128, 41); Add_Goto (Table.States (1052), 227, 1149); Add_Goto (Table.States (1052), 239, 841); Add_Goto (Table.States (1052), 272, 92); Add_Goto (Table.States (1052), 293, 97); Table.States (1052).Kernel := To_Vector ((0 => (228, 10, 1, False))); Table.States (1052).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1053), (74, 96), (183, 0), 3, enumeration_type_definition_0'Access, null); Table.States (1053).Kernel := To_Vector ((0 => (183, 77, 0, False))); Table.States (1053).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 183, 3))); Add_Action (Table.States (1054), 104, 898); Add_Action (Table.States (1054), 106, 899); Add_Error (Table.States (1054)); Add_Goto (Table.States (1054), 180, 1150); Table.States (1054).Kernel := To_Vector ((0 => (181, 83, 1, True))); Table.States (1054).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 898))); Table.States (1054).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1055), 10, 1151); Add_Action (Table.States (1055), 74, Reduce, (119, 1), 0, null, null); Add_Error (Table.States (1055)); Add_Goto (Table.States (1055), 119, 1152); Table.States (1055).Kernel := To_Vector ((0 => (259, 314, 3, False))); Table.States (1055).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 119, 0))); Add_Action (Table.States (1056), 10, 1151); Add_Action (Table.States (1056), 53, 618); Add_Action (Table.States (1056), 74, Reduce, (119, 1), 0, null, null); Add_Conflict (Table.States (1056), 74, (156, 1), 0, null, null); Add_Action (Table.States (1056), 76, 619); Add_Action (Table.States (1056), 84, 237); Add_Action (Table.States (1056), 96, Reduce, (156, 1), 0, null, null); Add_Action (Table.States (1056), 101, 239); Add_Action (Table.States (1056), 102, 240); Add_Error (Table.States (1056)); Add_Goto (Table.States (1056), 115, 241); Add_Goto (Table.States (1056), 119, 1153); Add_Goto (Table.States (1056), 155, 1154); Add_Goto (Table.States (1056), 156, 1155); Add_Goto (Table.States (1056), 224, 621); Add_Goto (Table.States (1056), 322, 242); Table.States (1056).Kernel := To_Vector (((128, 239, 2, True), (162, 239, 3, False), (162, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1056).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 156, 0))); Add_Action (Table.States (1057), 96, 1156); Add_Error (Table.States (1057)); Table.States (1057).Kernel := To_Vector ((0 => (260, 122, 1, False))); Table.States (1057).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1156))); Add_Action (Table.States (1058), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (206, 0), 7, full_type_declaration_0'Access, null); Table.States (1058).Kernel := To_Vector ((0 => (206, 96, 0, False))); Table.States (1058).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 206, 7))); Add_Action (Table.States (1059), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (245, 2), 7, object_renaming_declaration_2'Access, null); Table.States (1059).Kernel := To_Vector ((0 => (245, 96, 0, False))); Table.States (1059).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 245, 7))); Add_Action (Table.States (1060), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (245, 1), 7, object_renaming_declaration_1'Access, null); Table.States (1060).Kernel := To_Vector ((0 => (245, 96, 0, False))); Table.States (1060).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 245, 7))); Add_Action (Table.States (1061), (21, 35, 56, 74, 77, 82, 96), (114, 1), 5, access_definition_1'Access, null); Table.States (1061).Kernel := To_Vector ((0 => (114, 252, 0, True))); Table.States (1061).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 114, 5))); Table.States (1061).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1062), (21, 35, 56, 74, 77, 82, 96), (114, 0), 5, access_definition_0'Access, null); Table.States (1062).Kernel := To_Vector ((0 => (114, 253, 0, False))); Table.States (1062).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 114, 5))); Add_Action (Table.States (1063), 96, 1157); Add_Error (Table.States (1063)); Table.States (1063).Kernel := To_Vector ((0 => (245, 122, 1, False))); Table.States (1063).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1157))); Add_Action (Table.States (1064), 44, 914); Add_Action (Table.States (1064), 104, 119); Add_Action (Table.States (1064), 105, 33); Add_Action (Table.States (1064), 106, 34); Add_Error (Table.States (1064)); Add_Goto (Table.States (1064), 128, 41); Add_Goto (Table.States (1064), 184, 916); Add_Goto (Table.States (1064), 185, 1158); Add_Goto (Table.States (1064), 239, 918); Add_Goto (Table.States (1064), 272, 92); Add_Goto (Table.States (1064), 293, 97); Table.States (1064).Kernel := To_Vector ((0 => (187, 81, 2, False))); Table.States (1064).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1065), 44, 914); Add_Action (Table.States (1065), 104, 119); Add_Action (Table.States (1065), 105, 33); Add_Action (Table.States (1065), 106, 34); Add_Error (Table.States (1065)); Add_Goto (Table.States (1065), 128, 41); Add_Goto (Table.States (1065), 184, 1159); Add_Goto (Table.States (1065), 239, 918); Add_Goto (Table.States (1065), 272, 92); Add_Goto (Table.States (1065), 293, 97); Table.States (1065).Kernel := To_Vector ((0 => (185, 79, 1, True))); Table.States (1065).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (1065).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1066), 4, 1); Add_Action (Table.States (1066), 5, 2); Add_Action (Table.States (1066), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1066), 15, 3); Add_Action (Table.States (1066), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1066), 18, 4); Add_Action (Table.States (1066), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1066), 27, 5); Add_Action (Table.States (1066), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1066), 31, 9); Add_Action (Table.States (1066), 32, 10); Add_Action (Table.States (1066), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1066), 41, 13); Add_Action (Table.States (1066), 48, 16); Add_Action (Table.States (1066), 52, 20); Add_Action (Table.States (1066), 57, 21); Add_Action (Table.States (1066), 58, 22); Add_Action (Table.States (1066), 61, 24); Add_Action (Table.States (1066), 72, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1066), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1066), 93, 31); Add_Action (Table.States (1066), 104, 360); Add_Action (Table.States (1066), 105, 33); Add_Action (Table.States (1066), 106, 34); Add_Error (Table.States (1066)); Add_Goto (Table.States (1066), 113, 36); Add_Goto (Table.States (1066), 123, 38); Add_Goto (Table.States (1066), 126, 39); Add_Goto (Table.States (1066), 128, 41); Add_Goto (Table.States (1066), 131, 42); Add_Goto (Table.States (1066), 132, 43); Add_Goto (Table.States (1066), 133, 44); Add_Goto (Table.States (1066), 139, 47); Add_Goto (Table.States (1066), 151, 50); Add_Goto (Table.States (1066), 152, 51); Add_Goto (Table.States (1066), 161, 53); Add_Goto (Table.States (1066), 190, 57); Add_Goto (Table.States (1066), 196, 59); Add_Goto (Table.States (1066), 217, 68); Add_Goto (Table.States (1066), 222, 70); Add_Goto (Table.States (1066), 232, 72); Add_Goto (Table.States (1066), 239, 73); Add_Goto (Table.States (1066), 257, 83); Add_Goto (Table.States (1066), 261, 86); Add_Goto (Table.States (1066), 272, 92); Add_Goto (Table.States (1066), 276, 93); Add_Goto (Table.States (1066), 290, 96); Add_Goto (Table.States (1066), 293, 97); Add_Goto (Table.States (1066), 294, 98); Add_Goto (Table.States (1066), 298, 99); Add_Goto (Table.States (1066), 299, 361); Add_Goto (Table.States (1066), 300, 1160); Add_Goto (Table.States (1066), 302, 100); Add_Goto (Table.States (1066), 303, 101); Add_Goto (Table.States (1066), 306, 363); Add_Goto (Table.States (1066), 323, 114); Table.States (1066).Kernel := To_Vector ((0 => (187, 87, 0, False))); Table.States (1066).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (1067), 96, 1161); Add_Error (Table.States (1067)); Table.States (1067).Kernel := To_Vector ((0 => (133, 220, 1, False))); Table.States (1067).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1161))); Add_Action (Table.States (1068), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (232, 1), 7, loop_statement_1'Access, loop_statement_1_check'Access); Table.States (1068).Kernel := To_Vector ((0 => (232, 96, 0, False))); Table.States (1068).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 232, 7))); Add_Action (Table.States (1069), 96, 1162); Add_Error (Table.States (1069)); Table.States (1069).Kernel := To_Vector ((0 => (232, 220, 1, False))); Table.States (1069).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1162))); Add_Action (Table.States (1070), 74, 337); Add_Action (Table.States (1070), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1070)); Add_Goto (Table.States (1070), 122, 1163); Table.States (1070).Kernel := To_Vector ((0 => (244, 192, 1, False))); Table.States (1070).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1071), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 4), 7, object_declaration_4'Access, null); Table.States (1071).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1071).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 7))); Add_Action (Table.States (1072), 74, 337); Add_Action (Table.States (1072), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1072)); Add_Goto (Table.States (1072), 122, 1164); Table.States (1072).Kernel := To_Vector ((0 => (244, 192, 1, False))); Table.States (1072).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1073), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 5), 7, object_declaration_5'Access, null); Table.States (1073).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1073).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 7))); Add_Action (Table.States (1074), 74, 337); Add_Action (Table.States (1074), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1074)); Add_Goto (Table.States (1074), 122, 1165); Table.States (1074).Kernel := To_Vector ((0 => (244, 192, 1, False))); Table.States (1074).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1075), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 3), 7, object_declaration_3'Access, null); Table.States (1075).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1075).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 7))); Add_Action (Table.States (1076), 74, 337); Add_Action (Table.States (1076), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1076)); Add_Goto (Table.States (1076), 122, 1166); Table.States (1076).Kernel := To_Vector ((0 => (179, 253, 1, False))); Table.States (1076).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1077), 96, 1167); Add_Error (Table.States (1077)); Table.States (1077).Kernel := To_Vector ((0 => (213, 122, 1, False))); Table.States (1077).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1167))); Add_Action (Table.States (1078), 96, 1168); Add_Error (Table.States (1078)); Table.States (1078).Kernel := To_Vector ((0 => (213, 122, 1, False))); Table.States (1078).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1168))); Add_Action (Table.States (1079), 24, 1169); Add_Error (Table.States (1079)); Table.States (1079).Kernel := To_Vector ((0 => (307, 218, 2, False))); Table.States (1079).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1169))); Add_Action (Table.States (1080), 96, 1170); Add_Error (Table.States (1080)); Table.States (1080).Kernel := To_Vector ((0 => (113, 220, 1, False))); Table.States (1080).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1170))); Add_Action (Table.States (1081), 3, 121); Add_Action (Table.States (1081), 39, 122); Add_Action (Table.States (1081), 40, 123); Add_Action (Table.States (1081), 41, 124); Add_Action (Table.States (1081), 52, 125); Add_Action (Table.States (1081), 76, 126); Add_Action (Table.States (1081), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1081), 83, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1081), 94, 127); Add_Action (Table.States (1081), 95, 128); Add_Action (Table.States (1081), 103, 129); Add_Action (Table.States (1081), 104, 119); Add_Action (Table.States (1081), 105, 33); Add_Action (Table.States (1081), 106, 34); Add_Error (Table.States (1081)); Add_Goto (Table.States (1081), 117, 130); Add_Goto (Table.States (1081), 128, 41); Add_Goto (Table.States (1081), 191, 131); Add_Goto (Table.States (1081), 192, 1171); Add_Goto (Table.States (1081), 197, 133); Add_Goto (Table.States (1081), 239, 134); Add_Goto (Table.States (1081), 258, 135); Add_Goto (Table.States (1081), 272, 92); Add_Goto (Table.States (1081), 275, 136); Add_Goto (Table.States (1081), 282, 137); Add_Goto (Table.States (1081), 283, 138); Add_Goto (Table.States (1081), 284, 139); Add_Goto (Table.States (1081), 285, 140); Add_Goto (Table.States (1081), 286, 141); Add_Goto (Table.States (1081), 287, 142); Add_Goto (Table.States (1081), 293, 97); Add_Goto (Table.States (1081), 301, 143); Add_Goto (Table.States (1081), 320, 144); Add_Goto (Table.States (1081), 321, 145); Add_Goto (Table.States (1081), 330, 146); Table.States (1081).Kernel := To_Vector ((0 => (137, 87, 0, False))); Table.States (1081).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1082), (77, 83), (138, 0), 3, case_expression_alternative_list_0'Access, null); Table.States (1082).Kernel := To_Vector ((0 => (138, 137, 0, True))); Table.States (1082).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 138, 3))); Table.States (1082).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1083), (1 => 77), (221, 1), 6, if_expression_1'Access, null); Table.States (1083).Kernel := To_Vector ((0 => (221, 192, 0, False))); Table.States (1083).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 221, 6))); Add_Action (Table.States (1084), 68, 1172); Add_Error (Table.States (1084)); Table.States (1084).Kernel := To_Vector ((0 => (172, 192, 1, False))); Table.States (1084).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 68, 1172))); Add_Action (Table.States (1085), 3, 121); Add_Action (Table.States (1085), 39, 122); Add_Action (Table.States (1085), 40, 123); Add_Action (Table.States (1085), 41, 124); Add_Action (Table.States (1085), 52, 125); Add_Action (Table.States (1085), 76, 126); Add_Action (Table.States (1085), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1085), 94, 127); Add_Action (Table.States (1085), 95, 128); Add_Action (Table.States (1085), 103, 129); Add_Action (Table.States (1085), 104, 119); Add_Action (Table.States (1085), 105, 33); Add_Action (Table.States (1085), 106, 34); Add_Error (Table.States (1085)); Add_Goto (Table.States (1085), 117, 130); Add_Goto (Table.States (1085), 128, 41); Add_Goto (Table.States (1085), 191, 131); Add_Goto (Table.States (1085), 192, 1173); Add_Goto (Table.States (1085), 197, 133); Add_Goto (Table.States (1085), 239, 134); Add_Goto (Table.States (1085), 258, 135); Add_Goto (Table.States (1085), 272, 92); Add_Goto (Table.States (1085), 275, 136); Add_Goto (Table.States (1085), 282, 137); Add_Goto (Table.States (1085), 283, 138); Add_Goto (Table.States (1085), 284, 139); Add_Goto (Table.States (1085), 285, 140); Add_Goto (Table.States (1085), 286, 141); Add_Goto (Table.States (1085), 287, 142); Add_Goto (Table.States (1085), 293, 97); Add_Goto (Table.States (1085), 301, 143); Add_Goto (Table.States (1085), 320, 144); Add_Goto (Table.States (1085), 321, 145); Add_Goto (Table.States (1085), 330, 146); Table.States (1085).Kernel := To_Vector ((0 => (221, 22, 0, False))); Table.States (1085).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1086), (22, 23, 77), (173, 0), 2, null, null); Table.States (1086).Kernel := To_Vector ((0 => (173, 172, 0, True))); Table.States (1086).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 173, 2))); Table.States (1086).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1087), (10, 20, 21, 22, 23, 35, 37, 42, 43, 53, 68, 74, 75, 77, 79, 82, 83, 87, 96), (277, 0), 6, range_g_0'Access, null); Table.States (1087).Kernel := To_Vector ((0 => (277, 77, 0, False))); Table.States (1087).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 277, 6))); Add_Action (Table.States (1088), 53, 618); Add_Action (Table.States (1088), 76, 619); Add_Action (Table.States (1088), 77, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (1088), 79, Reduce, (165, 1), 3, null, null); Add_Action (Table.States (1088), 83, Reduce, (314, 1), 3, subtype_indication_1'Access, null); Add_Action (Table.States (1088), 84, 237); Add_Action (Table.States (1088), 87, Reduce, (165, 1), 3, null, null); Add_Action (Table.States (1088), 101, 239); Add_Action (Table.States (1088), 102, 240); Add_Error (Table.States (1088)); Add_Goto (Table.States (1088), 115, 241); Add_Goto (Table.States (1088), 155, 956); Add_Goto (Table.States (1088), 224, 621); Add_Goto (Table.States (1088), 322, 242); Table.States (1088).Kernel := To_Vector (((128, 239, 2, True), (165, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (314, 239, 4, False), (314, 239, 0, False))); Table.States (1088).Minimal_Complete_Actions := To_Vector (((Reduce, 165, 3), (Reduce, 314, 3))); Add_Action (Table.States (1089), (77, 83), (168, 0), 3, null, null); Table.States (1089).Kernel := To_Vector ((0 => (168, 167, 0, True))); Table.States (1089).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 168, 3))); Table.States (1089).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1090), (1 => 104), (235, 0), 4, null, null); Table.States (1090).Kernel := To_Vector ((0 => (235, 96, 0, False))); Table.States (1090).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 235, 4))); Add_Action (Table.States (1091), 53, 1174); Add_Error (Table.States (1091)); Table.States (1091).Kernel := To_Vector ((0 => (144, 301, 5, False))); Table.States (1091).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 53, 1174))); Add_Action (Table.States (1092), 96, 1175); Add_Error (Table.States (1092)); Table.States (1092).Kernel := To_Vector ((0 => (281, 54, 1, False))); Table.States (1092).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1175))); Add_Action (Table.States (1093), 3, 121); Add_Action (Table.States (1093), 39, 122); Add_Action (Table.States (1093), 40, 123); Add_Action (Table.States (1093), 41, 124); Add_Action (Table.States (1093), 52, 125); Add_Action (Table.States (1093), 76, 126); Add_Action (Table.States (1093), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1093), 94, 127); Add_Action (Table.States (1093), 95, 128); Add_Action (Table.States (1093), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1093), 103, 129); Add_Action (Table.States (1093), 104, 119); Add_Action (Table.States (1093), 105, 33); Add_Action (Table.States (1093), 106, 34); Add_Error (Table.States (1093)); Add_Goto (Table.States (1093), 117, 130); Add_Goto (Table.States (1093), 128, 41); Add_Goto (Table.States (1093), 191, 131); Add_Goto (Table.States (1093), 192, 1176); Add_Goto (Table.States (1093), 197, 133); Add_Goto (Table.States (1093), 239, 134); Add_Goto (Table.States (1093), 258, 135); Add_Goto (Table.States (1093), 272, 92); Add_Goto (Table.States (1093), 275, 136); Add_Goto (Table.States (1093), 282, 137); Add_Goto (Table.States (1093), 283, 138); Add_Goto (Table.States (1093), 284, 139); Add_Goto (Table.States (1093), 285, 140); Add_Goto (Table.States (1093), 286, 141); Add_Goto (Table.States (1093), 287, 142); Add_Goto (Table.States (1093), 293, 97); Add_Goto (Table.States (1093), 301, 143); Add_Goto (Table.States (1093), 320, 144); Add_Goto (Table.States (1093), 321, 145); Add_Goto (Table.States (1093), 330, 146); Table.States (1093).Kernel := To_Vector ((0 => (254, 82, 0, False))); Table.States (1093).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1094), 104, 119); Add_Action (Table.States (1094), 105, 33); Add_Action (Table.States (1094), 106, 34); Add_Error (Table.States (1094)); Add_Goto (Table.States (1094), 128, 41); Add_Goto (Table.States (1094), 239, 1177); Add_Goto (Table.States (1094), 272, 92); Add_Goto (Table.States (1094), 293, 97); Table.States (1094).Kernel := To_Vector (((254, 241, 2, False), (254, 241, 1, False))); Table.States (1094).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); end Subr_18; procedure Subr_19 is begin Add_Action (Table.States (1095), 80, 1178); Add_Error (Table.States (1095)); Table.States (1095).Kernel := To_Vector ((0 => (202, 20, 1, False))); Table.States (1095).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 1178))); Add_Action (Table.States (1096), (29, 47, 48, 50, 69, 71, 74, 104), (201, 1), 7, formal_type_declaration_1'Access, null); Table.States (1096).Kernel := To_Vector ((0 => (201, 96, 0, False))); Table.States (1096).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 201, 7))); Add_Action (Table.States (1097), (74, 96), (202, 2), 3, null, null); Table.States (1097).Kernel := To_Vector ((0 => (202, 77, 0, False))); Table.States (1097).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 3))); Add_Action (Table.States (1098), 10, 1151); Add_Action (Table.States (1098), 74, Reduce, (119, 1), 0, null, null); Add_Action (Table.States (1098), 76, 235); Add_Action (Table.States (1098), 84, 237); Add_Action (Table.States (1098), 96, Reduce, (119, 1), 0, null, null); Add_Action (Table.States (1098), 101, 239); Add_Action (Table.States (1098), 102, 240); Add_Error (Table.States (1098)); Add_Goto (Table.States (1098), 115, 241); Add_Goto (Table.States (1098), 119, 1179); Add_Goto (Table.States (1098), 322, 242); Table.States (1098).Kernel := To_Vector (((128, 239, 2, True), (203, 239, 2, False), (203, 239, 0, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1098).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 119, 0))); Add_Action (Table.States (1099), (29, 47, 48, 50, 69, 71, 74, 104), (201, 0), 7, formal_type_declaration_0'Access, null); Table.States (1099).Kernel := To_Vector ((0 => (201, 96, 0, False))); Table.States (1099).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 201, 7))); Add_Action (Table.States (1100), 3, 121); Add_Action (Table.States (1100), 15, 258); Add_Action (Table.States (1100), 28, 259); Add_Action (Table.States (1100), 32, 260); Add_Action (Table.States (1100), 39, 122); Add_Action (Table.States (1100), 40, 261); Add_Action (Table.States (1100), 41, 124); Add_Action (Table.States (1100), 44, 263); Add_Action (Table.States (1100), 52, 125); Add_Action (Table.States (1100), 76, 126); Add_Action (Table.States (1100), 77, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (1100), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (1100), 80, 1180); Add_Action (Table.States (1100), 83, Reduce, (124, 5), 0, null, null); Add_Action (Table.States (1100), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (1100), 94, 127); Add_Action (Table.States (1100), 95, 128); Add_Action (Table.States (1100), 103, 129); Add_Action (Table.States (1100), 104, 119); Add_Action (Table.States (1100), 105, 33); Add_Action (Table.States (1100), 106, 264); Add_Error (Table.States (1100)); Add_Goto (Table.States (1100), 117, 130); Add_Goto (Table.States (1100), 124, 265); Add_Goto (Table.States (1100), 125, 406); Add_Goto (Table.States (1100), 128, 41); Add_Goto (Table.States (1100), 136, 267); Add_Goto (Table.States (1100), 153, 407); Add_Goto (Table.States (1100), 165, 269); Add_Goto (Table.States (1100), 166, 270); Add_Goto (Table.States (1100), 191, 408); Add_Goto (Table.States (1100), 197, 133); Add_Goto (Table.States (1100), 221, 273); Add_Goto (Table.States (1100), 239, 274); Add_Goto (Table.States (1100), 258, 135); Add_Goto (Table.States (1100), 272, 92); Add_Goto (Table.States (1100), 273, 275); Add_Goto (Table.States (1100), 275, 136); Add_Goto (Table.States (1100), 277, 409); Add_Goto (Table.States (1100), 278, 410); Add_Goto (Table.States (1100), 282, 137); Add_Goto (Table.States (1100), 283, 138); Add_Goto (Table.States (1100), 284, 139); Add_Goto (Table.States (1100), 285, 140); Add_Goto (Table.States (1100), 286, 141); Add_Goto (Table.States (1100), 287, 142); Add_Goto (Table.States (1100), 293, 97); Add_Goto (Table.States (1100), 301, 277); Add_Goto (Table.States (1100), 320, 144); Add_Goto (Table.States (1100), 321, 145); Add_Goto (Table.States (1100), 330, 146); Table.States (1100).Kernel := To_Vector (((115, 76, 1, False), (115, 76, 3, False), (205, 76, 2, False), (239, 76, 4, True))); Table.States (1100).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 125, 0))); Table.States (1100).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1101), 74, 337); Add_Action (Table.States (1101), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1101)); Add_Goto (Table.States (1101), 122, 1181); Table.States (1101).Kernel := To_Vector ((0 => (204, 205, 1, False))); Table.States (1101).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1102), (29, 47, 48, 50, 69, 71, 74, 104), (200, 0), 7, formal_subprogram_declaration_0'Access, null); Table.States (1102).Kernel := To_Vector ((0 => (200, 96, 0, False))); Table.States (1102).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 200, 7))); Add_Action (Table.States (1103), 96, 1182); Add_Error (Table.States (1103)); Table.States (1103).Kernel := To_Vector ((0 => (198, 122, 1, False))); Table.States (1103).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1182))); Add_Action (Table.States (1104), 74, 337); Add_Action (Table.States (1104), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1104)); Add_Goto (Table.States (1104), 122, 1183); Table.States (1104).Kernel := To_Vector ((0 => (198, 192, 1, False))); Table.States (1104).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1105), (29, 47, 48, 50, 69, 71, 74, 104), (198, 2), 7, formal_object_declaration_2'Access, null); Table.States (1105).Kernel := To_Vector ((0 => (198, 96, 0, False))); Table.States (1105).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 198, 7))); Add_Action (Table.States (1106), 96, 1184); Add_Error (Table.States (1106)); Table.States (1106).Kernel := To_Vector ((0 => (222, 32, 1, False))); Table.States (1106).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1184))); Add_Action (Table.States (1107), (22, 23, 24), (174, 0), 4, elsif_statement_item_0'Access, null); Table.States (1107).Kernel := To_Vector ((0 => (174, 300, 0, False))); Table.States (1107).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 174, 4))); Add_Action (Table.States (1108), 32, 1185); Add_Error (Table.States (1108)); Table.States (1108).Kernel := To_Vector ((0 => (222, 24, 2, False))); Table.States (1108).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 32, 1185))); Add_Action (Table.States (1109), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (222, 2), 8, if_statement_2'Access, null); Table.States (1109).Kernel := To_Vector ((0 => (222, 96, 0, False))); Table.States (1109).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 222, 8))); Add_Action (Table.States (1110), 24, 1186); Add_Error (Table.States (1110)); Table.States (1110).Kernel := To_Vector ((0 => (247, 218, 2, False))); Table.States (1110).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1186))); Add_Action (Table.States (1111), 96, 1187); Add_Error (Table.States (1111)); Table.States (1111).Kernel := To_Vector ((0 => (247, 240, 1, False))); Table.States (1111).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1187))); Add_Action (Table.States (1112), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (1112), 104, 119); Add_Action (Table.States (1112), 105, 33); Add_Action (Table.States (1112), 106, 34); Add_Error (Table.States (1112)); Add_Goto (Table.States (1112), 128, 41); Add_Goto (Table.States (1112), 239, 630); Add_Goto (Table.States (1112), 240, 1188); Add_Goto (Table.States (1112), 272, 92); Add_Goto (Table.States (1112), 293, 97); Table.States (1112).Kernel := To_Vector ((0 => (251, 24, 0, False))); Table.States (1112).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (1113), 28, 1189); Add_Action (Table.States (1113), 77, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (1113), 96, Reduce, (254, 4), 0, null, null); Add_Action (Table.States (1113), 104, 164); Add_Error (Table.States (1113)); Add_Goto (Table.States (1113), 219, 493); Add_Goto (Table.States (1113), 254, 494); Add_Goto (Table.States (1113), 255, 495); Table.States (1113).Kernel := To_Vector (((177, 76, 5, False), (199, 76, 1, False))); Table.States (1113).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 255, 0))); Add_Action (Table.States (1114), 72, 1190); Add_Error (Table.States (1114)); Table.States (1114).Kernel := To_Vector ((0 => (176, 177, 5, False))); Table.States (1114).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 72, 1190))); Add_Action (Table.States (1115), (1 => 72), (177, 1), 1, null, null); Table.States (1115).Kernel := To_Vector ((0 => (177, 253, 0, False))); Table.States (1115).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 177, 1))); Add_Action (Table.States (1116), 96, 1191); Add_Error (Table.States (1116)); Table.States (1116).Kernel := To_Vector ((0 => (264, 220, 1, False))); Table.States (1116).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1191))); Add_Action (Table.States (1117), 10, 1006); Add_Action (Table.States (1117), 74, 1192); Add_Error (Table.States (1117)); Table.States (1117).Kernel := To_Vector (((227, 227, 2, True), (271, 227, 3, False))); Table.States (1117).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1192))); Add_Action (Table.States (1118), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (271, 1), 8, protected_type_declaration_1'Access, protected_type_declaration_1_check'Access); Table.States (1118).Kernel := To_Vector ((0 => (271, 96, 0, False))); Table.States (1118).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 271, 8))); Add_Action (Table.States (1119), 10, Reduce, (227, 0), 3, interface_list_0'Access, null); Add_Action (Table.States (1119), 74, Reduce, (227, 0), 3, interface_list_0'Access, null); Add_Action (Table.States (1119), 76, 235); Add_Action (Table.States (1119), 84, 237); Add_Action (Table.States (1119), 96, Reduce, (227, 0), 3, interface_list_0'Access, null); Add_Action (Table.States (1119), 101, 239); Add_Action (Table.States (1119), 102, 240); Add_Error (Table.States (1119)); Add_Goto (Table.States (1119), 115, 241); Add_Goto (Table.States (1119), 322, 242); Table.States (1119).Kernel := To_Vector (((128, 239, 2, True), (227, 239, 0, True), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1119).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 227, 3))); Table.States (1119).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1120), 96, 1193); Add_Error (Table.States (1120)); Table.States (1120).Kernel := To_Vector ((0 => (304, 266, 1, False))); Table.States (1120).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1193))); Add_Action (Table.States (1121), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1121), 104, 149); Add_Error (Table.States (1121)); Add_Goto (Table.States (1121), 220, 1194); Table.States (1121).Kernel := To_Vector ((0 => (266, 24, 0, False))); Table.States (1121).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1122), (21, 96), (194, 0), 7, extended_return_object_declaration_0'Access, null); Table.States (1122).Kernel := To_Vector ((0 => (194, 192, 0, False))); Table.States (1122).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 194, 7))); Add_Action (Table.States (1123), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (126, 0), 8, asynchronous_select_0'Access, null); Table.States (1123).Kernel := To_Vector ((0 => (126, 96, 0, False))); Table.States (1123).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 126, 8))); Add_Action (Table.States (1124), 24, 1195); Add_Error (Table.States (1124)); Table.States (1124).Kernel := To_Vector ((0 => (316, 218, 2, False))); Table.States (1124).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1195))); Add_Action (Table.States (1125), 10, 1006); Add_Action (Table.States (1125), 74, 1196); Add_Error (Table.States (1125)); Table.States (1125).Kernel := To_Vector (((227, 227, 2, True), (319, 227, 3, False))); Table.States (1125).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1196))); Add_Action (Table.States (1126), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1126), 104, 149); Add_Error (Table.States (1126)); Add_Goto (Table.States (1126), 220, 1197); Table.States (1126).Kernel := To_Vector ((0 => (319, 24, 1, False))); Table.States (1126).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1127), 24, 1198); Add_Error (Table.States (1127)); Table.States (1127).Kernel := To_Vector ((0 => (305, 318, 2, False))); Table.States (1127).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1198))); Add_Action (Table.States (1128), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (305, 1), 8, single_task_declaration_1'Access, single_task_declaration_1_check'Access); Table.States (1128).Kernel := To_Vector ((0 => (305, 96, 0, False))); Table.States (1128).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 305, 8))); Add_Action (Table.States (1129), 76, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (1129), 77, Reduce, (242, 2), 3, null_exclusion_opt_name_type_2'Access, null); Add_Action (Table.States (1129), 82, Reduce, (242, 2), 3, null_exclusion_opt_name_type_2'Access, null); Add_Action (Table.States (1129), 84, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (1129), 96, Reduce, (242, 2), 3, null_exclusion_opt_name_type_2'Access, null); Add_Action (Table.States (1129), 101, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Action (Table.States (1129), 102, Reduce, (239, 5), 1, name_5'Access, name_5_check'Access); Add_Error (Table.States (1129)); Table.States (1129).Kernel := To_Vector (((239, 104, 0, False), (242, 104, 0, False))); Table.States (1129).Minimal_Complete_Actions := To_Vector (((Reduce, 239, 1), (Reduce, 242, 3))); Add_Action (Table.States (1130), 76, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (1130), 77, Reduce, (242, 3), 3, null_exclusion_opt_name_type_3'Access, null); Add_Action (Table.States (1130), 82, Reduce, (242, 3), 3, null_exclusion_opt_name_type_3'Access, null); Add_Action (Table.States (1130), 84, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (1130), 96, Reduce, (242, 3), 3, null_exclusion_opt_name_type_3'Access, null); Add_Action (Table.States (1130), 101, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Action (Table.States (1130), 102, Reduce, (239, 2), 1, null, name_2_check'Access); Add_Error (Table.States (1130)); Table.States (1130).Kernel := To_Vector (((239, 293, 0, True), (242, 293, 0, False))); Table.States (1130).Minimal_Complete_Actions := To_Vector (((Reduce, 239, 1), (Reduce, 242, 3))); Table.States (1130).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1131), (77, 96), (170, 1), 5, null, null); Table.States (1131).Kernel := To_Vector ((0 => (170, 192, 0, False))); Table.States (1131).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 170, 5))); Add_Action (Table.States (1132), (77, 96), (170, 0), 5, null, null); Table.States (1132).Kernel := To_Vector ((0 => (170, 192, 0, False))); Table.States (1132).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 170, 5))); Add_Action (Table.States (1133), 42, 1199); Add_Error (Table.States (1133)); Table.States (1133).Kernel := To_Vector ((0 => (120, 77, 2, False))); Table.States (1133).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 42, 1199))); Add_Action (Table.States (1134), 42, 1200); Add_Error (Table.States (1134)); Table.States (1134).Kernel := To_Vector ((0 => (120, 77, 2, False))); Table.States (1134).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 42, 1200))); Add_Action (Table.States (1135), 104, 119); Add_Action (Table.States (1135), 105, 33); Add_Action (Table.States (1135), 106, 34); Add_Error (Table.States (1135)); Add_Goto (Table.States (1135), 128, 41); Add_Goto (Table.States (1135), 225, 1201); Add_Goto (Table.States (1135), 239, 1202); Add_Goto (Table.States (1135), 272, 92); Add_Goto (Table.States (1135), 293, 97); Table.States (1135).Kernel := To_Vector ((0 => (226, 83, 3, True))); Table.States (1135).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Table.States (1135).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1136), 3, 121); Add_Action (Table.States (1136), 39, 122); Add_Action (Table.States (1136), 40, 123); Add_Action (Table.States (1136), 41, 124); Add_Action (Table.States (1136), 76, 126); Add_Action (Table.States (1136), 80, 1203); Add_Action (Table.States (1136), 94, 127); Add_Action (Table.States (1136), 95, 128); Add_Action (Table.States (1136), 103, 129); Add_Action (Table.States (1136), 104, 119); Add_Action (Table.States (1136), 105, 33); Add_Action (Table.States (1136), 106, 34); Add_Error (Table.States (1136)); Add_Goto (Table.States (1136), 117, 130); Add_Goto (Table.States (1136), 128, 41); Add_Goto (Table.States (1136), 197, 133); Add_Goto (Table.States (1136), 239, 274); Add_Goto (Table.States (1136), 258, 135); Add_Goto (Table.States (1136), 272, 92); Add_Goto (Table.States (1136), 277, 773); Add_Goto (Table.States (1136), 293, 97); Add_Goto (Table.States (1136), 301, 479); Add_Goto (Table.States (1136), 320, 144); Add_Goto (Table.States (1136), 321, 145); Add_Goto (Table.States (1136), 330, 146); Table.States (1136).Kernel := To_Vector (((155, 53, 3, False), (225, 53, 1, False))); Table.States (1136).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 1203))); Add_Action (Table.States (1137), 53, 1036); Add_Action (Table.States (1137), 74, Reduce, (279, 1), 0, null, null); Add_Action (Table.States (1137), 96, Reduce, (279, 1), 0, null, null); Add_Error (Table.States (1137)); Add_Goto (Table.States (1137), 279, 1204); Table.States (1137).Kernel := To_Vector ((0 => (326, 192, 0, False))); Table.States (1137).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 279, 0))); Add_Action (Table.States (1138), 85, 1205); Add_Error (Table.States (1138)); Table.States (1138).Kernel := To_Vector ((0 => (279, 301, 2, False))); Table.States (1138).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 85, 1205))); Add_Action (Table.States (1139), 10, 1006); Add_Action (Table.States (1139), 74, Reduce, (228, 0), 4, null, null); Add_Action (Table.States (1139), 96, Reduce, (228, 0), 4, null, null); Add_Error (Table.States (1139)); Table.States (1139).Kernel := To_Vector (((227, 227, 2, True), (228, 227, 0, False))); Table.States (1139).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 4))); Add_Action (Table.States (1140), 10, 1006); Add_Action (Table.States (1140), 74, Reduce, (228, 2), 4, null, null); Add_Action (Table.States (1140), 96, Reduce, (228, 2), 4, null, null); Add_Error (Table.States (1140)); Table.States (1140).Kernel := To_Vector (((227, 227, 2, True), (228, 227, 0, False))); Table.States (1140).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 4))); Add_Action (Table.States (1141), (74, 96), (326, 1), 4, null, null); Table.States (1141).Kernel := To_Vector ((0 => (326, 301, 0, False))); Table.States (1141).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 4))); Add_Action (Table.States (1142), 72, 1206); Add_Error (Table.States (1142)); Add_Goto (Table.States (1142), 328, 1207); Add_Goto (Table.States (1142), 329, 1208); Table.States (1142).Kernel := To_Vector ((0 => (327, 35, 5, False))); Table.States (1142).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 72, 1206))); Add_Action (Table.States (1143), (74, 96), (280, 0), 4, record_definition_0'Access, null); Table.States (1143).Kernel := To_Vector ((0 => (280, 54, 0, False))); Table.States (1143).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 280, 4))); Add_Action (Table.States (1144), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (1144), 40, 742); Add_Action (Table.States (1144), 104, 119); Add_Action (Table.States (1144), 105, 33); Add_Action (Table.States (1144), 106, 34); Add_Error (Table.States (1144)); Add_Goto (Table.States (1144), 114, 1209); Add_Goto (Table.States (1144), 128, 41); Add_Goto (Table.States (1144), 239, 484); Add_Goto (Table.States (1144), 241, 721); Add_Goto (Table.States (1144), 272, 92); Add_Goto (Table.States (1144), 293, 97); Add_Goto (Table.States (1144), 314, 1210); Table.States (1144).Kernel := To_Vector (((147, 8, 1, False), (147, 8, 2, False))); Table.States (1144).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1145), (74, 82, 96), (147, 3), 1, null, null); Table.States (1145).Kernel := To_Vector ((0 => (147, 114, 0, False))); Table.States (1145).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 147, 1))); Add_Action (Table.States (1146), 74, 337); Add_Action (Table.States (1146), 82, 1211); Add_Action (Table.States (1146), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1146)); Add_Goto (Table.States (1146), 122, 1212); Table.States (1146).Kernel := To_Vector (((146, 147, 2, False), (146, 147, 1, False))); Table.States (1146).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1147), (74, 82, 96), (147, 1), 1, null, null); Table.States (1147).Kernel := To_Vector ((0 => (147, 314, 0, False))); Table.States (1147).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 147, 1))); Add_Action (Table.States (1148), 10, 1006); Add_Action (Table.States (1148), 74, Reduce, (228, 3), 4, null, null); Add_Action (Table.States (1148), 96, Reduce, (228, 3), 4, null, null); Add_Error (Table.States (1148)); Table.States (1148).Kernel := To_Vector (((227, 227, 2, True), (228, 227, 0, False))); Table.States (1148).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 4))); Add_Action (Table.States (1149), 10, 1006); Add_Action (Table.States (1149), 74, Reduce, (228, 1), 4, null, null); Add_Action (Table.States (1149), 96, Reduce, (228, 1), 4, null, null); Add_Error (Table.States (1149)); Table.States (1149).Kernel := To_Vector (((227, 227, 2, True), (228, 227, 0, False))); Table.States (1149).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 228, 4))); Add_Action (Table.States (1150), (77, 83), (181, 0), 3, null, null); Table.States (1150).Kernel := To_Vector ((0 => (181, 180, 0, True))); Table.States (1150).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 181, 3))); Table.States (1150).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1151), 104, 119); Add_Action (Table.States (1151), 105, 33); Add_Action (Table.States (1151), 106, 34); Add_Error (Table.States (1151)); Add_Goto (Table.States (1151), 128, 41); Add_Goto (Table.States (1151), 227, 1213); Add_Goto (Table.States (1151), 239, 841); Add_Goto (Table.States (1151), 272, 92); Add_Goto (Table.States (1151), 293, 97); Table.States (1151).Kernel := To_Vector ((0 => (119, 10, 1, False))); Table.States (1151).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1152), 74, 1214); Add_Error (Table.States (1152)); Table.States (1152).Kernel := To_Vector ((0 => (259, 119, 3, False))); Table.States (1152).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1214))); Add_Action (Table.States (1153), 74, 1215); Add_Error (Table.States (1153)); Table.States (1153).Kernel := To_Vector ((0 => (162, 119, 3, False))); Table.States (1153).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 74, 1215))); Add_Action (Table.States (1154), (74, 96), (156, 0), 1, null, null); Table.States (1154).Kernel := To_Vector ((0 => (156, 155, 0, False))); Table.States (1154).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 156, 1))); Add_Action (Table.States (1155), (74, 96), (162, 1), 4, derived_type_definition_1'Access, null); Table.States (1155).Kernel := To_Vector ((0 => (162, 156, 0, False))); Table.States (1155).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 162, 4))); Add_Action (Table.States (1156), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (260, 0), 8, private_type_declaration_0'Access, null); Table.States (1156).Kernel := To_Vector ((0 => (260, 96, 0, False))); Table.States (1156).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 260, 8))); Add_Action (Table.States (1157), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (245, 0), 8, object_renaming_declaration_0'Access, null); Table.States (1157).Kernel := To_Vector ((0 => (245, 96, 0, False))); Table.States (1157).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 245, 8))); Add_Action (Table.States (1158), 79, 1065); Add_Action (Table.States (1158), 87, 1216); Add_Error (Table.States (1158)); Table.States (1158).Kernel := To_Vector (((185, 185, 2, True), (187, 185, 1, False))); Table.States (1158).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 1216))); Add_Action (Table.States (1159), (79, 87), (185, 0), 3, null, null); Table.States (1159).Kernel := To_Vector ((0 => (185, 184, 0, True))); Table.States (1159).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 185, 3))); Table.States (1159).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1160), (24, 72), (187, 1), 4, exception_handler_1'Access, null); Table.States (1160).Kernel := To_Vector ((0 => (187, 300, 0, False))); Table.States (1160).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 187, 4))); Add_Action (Table.States (1161), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (133, 0), 8, block_statement_0'Access, block_statement_0_check'Access); Table.States (1161).Kernel := To_Vector ((0 => (133, 96, 0, False))); Table.States (1161).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 133, 8))); Add_Action (Table.States (1162), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (232, 0), 8, loop_statement_0'Access, loop_statement_0_check'Access); Table.States (1162).Kernel := To_Vector ((0 => (232, 96, 0, False))); Table.States (1162).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 232, 8))); Add_Action (Table.States (1163), 96, 1217); Add_Error (Table.States (1163)); Table.States (1163).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (1163).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1217))); Add_Action (Table.States (1164), 96, 1218); Add_Error (Table.States (1164)); Table.States (1164).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (1164).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1218))); Add_Action (Table.States (1165), 96, 1219); Add_Error (Table.States (1165)); Table.States (1165).Kernel := To_Vector ((0 => (244, 122, 1, False))); Table.States (1165).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1219))); Add_Action (Table.States (1166), 96, 1220); Add_Error (Table.States (1166)); Table.States (1166).Kernel := To_Vector ((0 => (179, 122, 1, False))); Table.States (1166).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1220))); Add_Action (Table.States (1167), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (213, 2), 8, generic_instantiation_2'Access, null); Table.States (1167).Kernel := To_Vector ((0 => (213, 96, 0, False))); Table.States (1167).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 213, 8))); Add_Action (Table.States (1168), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (213, 1), 8, generic_instantiation_1'Access, null); Table.States (1168).Kernel := To_Vector ((0 => (213, 96, 0, False))); Table.States (1168).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 213, 8))); Add_Action (Table.States (1169), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (1169), 104, 119); Add_Action (Table.States (1169), 105, 33); Add_Action (Table.States (1169), 106, 34); Add_Error (Table.States (1169)); Add_Goto (Table.States (1169), 128, 41); Add_Goto (Table.States (1169), 239, 630); Add_Goto (Table.States (1169), 240, 1221); Add_Goto (Table.States (1169), 272, 92); Add_Goto (Table.States (1169), 293, 97); Table.States (1169).Kernel := To_Vector ((0 => (307, 24, 1, False))); Table.States (1169).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (1170), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (113, 0), 9, accept_statement_0'Access, accept_statement_0_check'Access); Table.States (1170).Kernel := To_Vector ((0 => (113, 96, 0, False))); Table.States (1170).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 113, 9))); Add_Action (Table.States (1171), (77, 83), (137, 0), 4, case_expression_alternative_0'Access, null); Table.States (1171).Kernel := To_Vector ((0 => (137, 192, 0, False))); Table.States (1171).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 137, 4))); Add_Action (Table.States (1172), 3, 121); Add_Action (Table.States (1172), 22, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1172), 23, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1172), 39, 122); Add_Action (Table.States (1172), 40, 123); Add_Action (Table.States (1172), 41, 124); Add_Action (Table.States (1172), 52, 125); Add_Action (Table.States (1172), 76, 126); Add_Action (Table.States (1172), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1172), 94, 127); Add_Action (Table.States (1172), 95, 128); Add_Action (Table.States (1172), 103, 129); Add_Action (Table.States (1172), 104, 119); Add_Action (Table.States (1172), 105, 33); Add_Action (Table.States (1172), 106, 34); Add_Error (Table.States (1172)); Add_Goto (Table.States (1172), 117, 130); Add_Goto (Table.States (1172), 128, 41); Add_Goto (Table.States (1172), 191, 131); Add_Goto (Table.States (1172), 192, 1222); Add_Goto (Table.States (1172), 197, 133); Add_Goto (Table.States (1172), 239, 134); Add_Goto (Table.States (1172), 258, 135); Add_Goto (Table.States (1172), 272, 92); Add_Goto (Table.States (1172), 275, 136); Add_Goto (Table.States (1172), 282, 137); Add_Goto (Table.States (1172), 283, 138); Add_Goto (Table.States (1172), 284, 139); Add_Goto (Table.States (1172), 285, 140); Add_Goto (Table.States (1172), 286, 141); Add_Goto (Table.States (1172), 287, 142); Add_Goto (Table.States (1172), 293, 97); Add_Goto (Table.States (1172), 301, 143); Add_Goto (Table.States (1172), 320, 144); Add_Goto (Table.States (1172), 321, 145); Add_Goto (Table.States (1172), 330, 146); Table.States (1172).Kernel := To_Vector ((0 => (172, 68, 0, False))); Table.States (1172).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1173), (1 => 77), (221, 0), 7, if_expression_0'Access, null); Table.States (1173).Kernel := To_Vector ((0 => (221, 192, 0, False))); Table.States (1173).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 221, 7))); Add_Action (Table.States (1174), 3, 121); Add_Action (Table.States (1174), 39, 122); Add_Action (Table.States (1174), 40, 123); Add_Action (Table.States (1174), 41, 124); Add_Action (Table.States (1174), 76, 126); Add_Action (Table.States (1174), 94, 127); Add_Action (Table.States (1174), 95, 128); Add_Action (Table.States (1174), 103, 129); Add_Action (Table.States (1174), 104, 119); Add_Action (Table.States (1174), 105, 33); Add_Action (Table.States (1174), 106, 34); Add_Error (Table.States (1174)); Add_Goto (Table.States (1174), 117, 130); Add_Goto (Table.States (1174), 128, 41); Add_Goto (Table.States (1174), 197, 133); Add_Goto (Table.States (1174), 239, 134); Add_Goto (Table.States (1174), 258, 135); Add_Goto (Table.States (1174), 272, 92); Add_Goto (Table.States (1174), 293, 97); Add_Goto (Table.States (1174), 301, 1223); Add_Goto (Table.States (1174), 320, 144); Add_Goto (Table.States (1174), 321, 145); Add_Goto (Table.States (1174), 330, 146); Table.States (1174).Kernel := To_Vector ((0 => (144, 53, 4, False))); Table.States (1174).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (1175), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (281, 0), 9, record_representation_clause_0'Access, null); Table.States (1175).Kernel := To_Vector ((0 => (281, 96, 0, False))); Table.States (1175).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 281, 9))); Add_Action (Table.States (1176), (77, 96), (254, 2), 6, parameter_specification_2'Access, null); Table.States (1176).Kernel := To_Vector ((0 => (254, 192, 0, False))); Table.States (1176).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 254, 6))); Add_Action (Table.States (1177), 76, 235); Add_Action (Table.States (1177), 77, Reduce, (254, 1), 6, parameter_specification_1'Access, null); Add_Action (Table.States (1177), 82, 1224); Add_Action (Table.States (1177), 84, 237); Add_Action (Table.States (1177), 96, Reduce, (254, 1), 6, parameter_specification_1'Access, null); Add_Action (Table.States (1177), 101, 239); Add_Action (Table.States (1177), 102, 240); Add_Error (Table.States (1177)); Add_Goto (Table.States (1177), 115, 241); Add_Goto (Table.States (1177), 322, 242); Table.States (1177).Kernel := To_Vector (((128, 239, 2, True), (239, 239, 5, True), (239, 239, 2, True), (254, 239, 1, False), (254, 239, 0, False), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1177).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 254, 6))); Add_Action (Table.States (1178), (74, 96), (202, 6), 4, null, null); Table.States (1178).Kernel := To_Vector ((0 => (202, 80, 0, False))); Table.States (1178).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 202, 4))); Add_Action (Table.States (1179), 74, 1225); Add_Conflict (Table.States (1179), 74, (203, 1), 4, formal_derived_type_definition_1'Access, null); Add_Action (Table.States (1179), 96, Reduce, (203, 1), 4, formal_derived_type_definition_1'Access, null); Add_Error (Table.States (1179)); Table.States (1179).Kernel := To_Vector (((203, 119, 2, False), (203, 119, 0, False))); Table.States (1179).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 203, 4))); Add_Action (Table.States (1180), 77, 1226); Add_Error (Table.States (1180)); Table.States (1180).Kernel := To_Vector ((0 => (205, 80, 1, False))); Table.States (1180).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1226))); Add_Action (Table.States (1181), 96, 1227); Add_Error (Table.States (1181)); Table.States (1181).Kernel := To_Vector ((0 => (204, 122, 1, False))); Table.States (1181).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1227))); Add_Action (Table.States (1182), (29, 47, 48, 50, 69, 71, 74, 104), (198, 1), 8, formal_object_declaration_1'Access, null); Table.States (1182).Kernel := To_Vector ((0 => (198, 96, 0, False))); Table.States (1182).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 198, 8))); Add_Action (Table.States (1183), 96, 1228); Add_Error (Table.States (1183)); Table.States (1183).Kernel := To_Vector ((0 => (198, 122, 1, False))); Table.States (1183).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1228))); Add_Action (Table.States (1184), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (222, 1), 9, if_statement_1'Access, null); Table.States (1184).Kernel := To_Vector ((0 => (222, 96, 0, False))); Table.States (1184).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 222, 9))); Add_Action (Table.States (1185), 96, 1229); Add_Error (Table.States (1185)); Table.States (1185).Kernel := To_Vector ((0 => (222, 32, 1, False))); Table.States (1185).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1229))); Add_Action (Table.States (1186), 96, Reduce, (240, 1), 0, null, null); Add_Action (Table.States (1186), 104, 119); Add_Action (Table.States (1186), 105, 33); Add_Action (Table.States (1186), 106, 34); Add_Error (Table.States (1186)); Add_Goto (Table.States (1186), 128, 41); Add_Goto (Table.States (1186), 239, 630); Add_Goto (Table.States (1186), 240, 1230); Add_Goto (Table.States (1186), 272, 92); Add_Goto (Table.States (1186), 293, 97); Table.States (1186).Kernel := To_Vector ((0 => (247, 24, 1, False))); Table.States (1186).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 240, 0))); Add_Action (Table.States (1187), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (247, 1), 9, package_body_1'Access, package_body_1_check'Access); Table.States (1187).Kernel := To_Vector ((0 => (247, 96, 0, False))); Table.States (1187).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 247, 9))); Add_Action (Table.States (1188), (1 => 96), (251, 0), 9, package_specification_0'Access, package_specification_0_check'Access); Table.States (1188).Kernel := To_Vector ((0 => (251, 240, 0, False))); Table.States (1188).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 251, 9))); Add_Action (Table.States (1189), 104, 1231); Add_Error (Table.States (1189)); Table.States (1189).Kernel := To_Vector ((0 => (177, 28, 4, False))); Table.States (1189).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 1231))); Add_Action (Table.States (1190), 3, 121); Add_Action (Table.States (1190), 35, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1190), 39, 122); Add_Action (Table.States (1190), 40, 123); Add_Action (Table.States (1190), 41, 124); Add_Action (Table.States (1190), 52, 125); Add_Action (Table.States (1190), 76, 126); Add_Action (Table.States (1190), 94, 127); Add_Action (Table.States (1190), 95, 128); Add_Action (Table.States (1190), 103, 129); Add_Action (Table.States (1190), 104, 119); Add_Action (Table.States (1190), 105, 33); Add_Action (Table.States (1190), 106, 34); Add_Error (Table.States (1190)); Add_Goto (Table.States (1190), 117, 130); Add_Goto (Table.States (1190), 128, 41); Add_Goto (Table.States (1190), 191, 131); Add_Goto (Table.States (1190), 192, 1232); Add_Goto (Table.States (1190), 197, 133); Add_Goto (Table.States (1190), 239, 134); Add_Goto (Table.States (1190), 258, 135); Add_Goto (Table.States (1190), 272, 92); Add_Goto (Table.States (1190), 275, 136); Add_Goto (Table.States (1190), 282, 137); Add_Goto (Table.States (1190), 283, 138); Add_Goto (Table.States (1190), 284, 139); Add_Goto (Table.States (1190), 285, 140); Add_Goto (Table.States (1190), 286, 141); Add_Goto (Table.States (1190), 287, 142); Add_Goto (Table.States (1190), 293, 97); Add_Goto (Table.States (1190), 301, 143); Add_Goto (Table.States (1190), 320, 144); Add_Goto (Table.States (1190), 321, 145); Add_Goto (Table.States (1190), 330, 146); Table.States (1190).Kernel := To_Vector ((0 => (176, 72, 4, False))); Table.States (1190).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1191), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (264, 0), 9, protected_body_0'Access, protected_body_0_check'Access); Table.States (1191).Kernel := To_Vector ((0 => (264, 96, 0, False))); Table.States (1191).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 264, 9))); Add_Action (Table.States (1192), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1192), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1192), 28, 183); Add_Action (Table.States (1192), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1192), 30, 8); Add_Action (Table.States (1192), 40, 12); Add_Action (Table.States (1192), 46, 14); Add_Action (Table.States (1192), 47, 15); Add_Action (Table.States (1192), 48, 16); Add_Action (Table.States (1192), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1192), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1192), 51, 19); Add_Action (Table.States (1192), 63, 25); Add_Action (Table.States (1192), 66, 26); Add_Action (Table.States (1192), 69, 27); Add_Action (Table.States (1192), 71, 28); Add_Action (Table.States (1192), 104, 185); Add_Error (Table.States (1192)); Add_Goto (Table.States (1192), 112, 35); Add_Goto (Table.States (1192), 121, 37); Add_Goto (Table.States (1192), 127, 40); Add_Goto (Table.States (1192), 134, 45); Add_Goto (Table.States (1192), 135, 46); Add_Goto (Table.States (1192), 157, 391); Add_Goto (Table.States (1192), 158, 392); Add_Goto (Table.States (1192), 159, 667); Add_Goto (Table.States (1192), 179, 54); Add_Goto (Table.States (1192), 182, 55); Add_Goto (Table.States (1192), 186, 56); Add_Goto (Table.States (1192), 193, 58); Add_Goto (Table.States (1192), 206, 60); Add_Goto (Table.States (1192), 207, 61); Add_Goto (Table.States (1192), 209, 62); Add_Goto (Table.States (1192), 210, 63); Add_Goto (Table.States (1192), 213, 64); Add_Goto (Table.States (1192), 214, 65); Add_Goto (Table.States (1192), 215, 66); Add_Goto (Table.States (1192), 216, 67); Add_Goto (Table.States (1192), 219, 69); Add_Goto (Table.States (1192), 223, 71); Add_Goto (Table.States (1192), 243, 74); Add_Goto (Table.States (1192), 244, 75); Add_Goto (Table.States (1192), 245, 76); Add_Goto (Table.States (1192), 246, 77); Add_Goto (Table.States (1192), 247, 78); Add_Goto (Table.States (1192), 248, 79); Add_Goto (Table.States (1192), 249, 80); Add_Goto (Table.States (1192), 250, 81); Add_Goto (Table.States (1192), 251, 82); Add_Goto (Table.States (1192), 257, 394); Add_Goto (Table.States (1192), 259, 84); Add_Goto (Table.States (1192), 260, 85); Add_Goto (Table.States (1192), 262, 87); Add_Goto (Table.States (1192), 263, 88); Add_Goto (Table.States (1192), 264, 89); Add_Goto (Table.States (1192), 265, 90); Add_Goto (Table.States (1192), 266, 1233); Add_Goto (Table.States (1192), 271, 91); Add_Goto (Table.States (1192), 281, 94); Add_Goto (Table.States (1192), 289, 95); Add_Goto (Table.States (1192), 304, 102); Add_Goto (Table.States (1192), 305, 103); Add_Goto (Table.States (1192), 307, 105); Add_Goto (Table.States (1192), 308, 106); Add_Goto (Table.States (1192), 309, 107); Add_Goto (Table.States (1192), 311, 108); Add_Goto (Table.States (1192), 313, 109); Add_Goto (Table.States (1192), 316, 111); Add_Goto (Table.States (1192), 317, 112); Add_Goto (Table.States (1192), 319, 113); Add_Goto (Table.States (1192), 325, 115); Add_Goto (Table.States (1192), 331, 116); Table.States (1192).Kernel := To_Vector ((0 => (271, 74, 2, False))); Table.States (1192).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); end Subr_19; procedure Subr_20 is begin Add_Action (Table.States (1193), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (304, 0), 9, single_protected_declaration_0'Access, single_protected_declaration_0_check'Access); Table.States (1193).Kernel := To_Vector ((0 => (304, 96, 0, False))); Table.States (1193).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 304, 9))); Add_Action (Table.States (1194), (1 => 96), (266, 0), 5, protected_definition_0'Access, protected_definition_0_check'Access); Table.States (1194).Kernel := To_Vector ((0 => (266, 220, 0, False))); Table.States (1194).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 266, 5))); Add_Action (Table.States (1195), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1195), 104, 149); Add_Error (Table.States (1195)); Add_Goto (Table.States (1195), 220, 1234); Table.States (1195).Kernel := To_Vector ((0 => (316, 24, 1, False))); Table.States (1195).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1196), 24, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1196), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1196), 28, 183); Add_Action (Table.States (1196), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1196), 30, 8); Add_Action (Table.States (1196), 40, 12); Add_Action (Table.States (1196), 46, 14); Add_Action (Table.States (1196), 47, 15); Add_Action (Table.States (1196), 48, 16); Add_Action (Table.States (1196), 49, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1196), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1196), 51, 19); Add_Action (Table.States (1196), 63, 25); Add_Action (Table.States (1196), 66, 26); Add_Action (Table.States (1196), 69, 27); Add_Action (Table.States (1196), 71, 28); Add_Action (Table.States (1196), 104, 185); Add_Error (Table.States (1196)); Add_Goto (Table.States (1196), 112, 35); Add_Goto (Table.States (1196), 121, 37); Add_Goto (Table.States (1196), 127, 40); Add_Goto (Table.States (1196), 134, 45); Add_Goto (Table.States (1196), 135, 46); Add_Goto (Table.States (1196), 157, 391); Add_Goto (Table.States (1196), 158, 392); Add_Goto (Table.States (1196), 159, 692); Add_Goto (Table.States (1196), 179, 54); Add_Goto (Table.States (1196), 182, 55); Add_Goto (Table.States (1196), 186, 56); Add_Goto (Table.States (1196), 193, 58); Add_Goto (Table.States (1196), 206, 60); Add_Goto (Table.States (1196), 207, 61); Add_Goto (Table.States (1196), 209, 62); Add_Goto (Table.States (1196), 210, 63); Add_Goto (Table.States (1196), 213, 64); Add_Goto (Table.States (1196), 214, 65); Add_Goto (Table.States (1196), 215, 66); Add_Goto (Table.States (1196), 216, 67); Add_Goto (Table.States (1196), 219, 69); Add_Goto (Table.States (1196), 223, 71); Add_Goto (Table.States (1196), 243, 74); Add_Goto (Table.States (1196), 244, 75); Add_Goto (Table.States (1196), 245, 76); Add_Goto (Table.States (1196), 246, 77); Add_Goto (Table.States (1196), 247, 78); Add_Goto (Table.States (1196), 248, 79); Add_Goto (Table.States (1196), 249, 80); Add_Goto (Table.States (1196), 250, 81); Add_Goto (Table.States (1196), 251, 82); Add_Goto (Table.States (1196), 257, 394); Add_Goto (Table.States (1196), 259, 84); Add_Goto (Table.States (1196), 260, 85); Add_Goto (Table.States (1196), 262, 87); Add_Goto (Table.States (1196), 263, 88); Add_Goto (Table.States (1196), 264, 89); Add_Goto (Table.States (1196), 265, 90); Add_Goto (Table.States (1196), 271, 91); Add_Goto (Table.States (1196), 281, 94); Add_Goto (Table.States (1196), 289, 95); Add_Goto (Table.States (1196), 304, 102); Add_Goto (Table.States (1196), 305, 103); Add_Goto (Table.States (1196), 307, 105); Add_Goto (Table.States (1196), 308, 106); Add_Goto (Table.States (1196), 309, 107); Add_Goto (Table.States (1196), 311, 108); Add_Goto (Table.States (1196), 313, 109); Add_Goto (Table.States (1196), 316, 111); Add_Goto (Table.States (1196), 317, 112); Add_Goto (Table.States (1196), 318, 1235); Add_Goto (Table.States (1196), 319, 113); Add_Goto (Table.States (1196), 325, 115); Add_Goto (Table.States (1196), 331, 116); Table.States (1196).Kernel := To_Vector ((0 => (319, 74, 2, False))); Table.States (1196).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 318, 0))); Add_Action (Table.States (1197), 96, 1236); Add_Error (Table.States (1197)); Table.States (1197).Kernel := To_Vector ((0 => (319, 220, 1, False))); Table.States (1197).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1236))); Add_Action (Table.States (1198), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1198), 104, 149); Add_Error (Table.States (1198)); Add_Goto (Table.States (1198), 220, 1237); Table.States (1198).Kernel := To_Vector ((0 => (305, 24, 1, False))); Table.States (1198).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1199), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (1199), 8, 1144); Add_Action (Table.States (1199), 40, 742); Add_Action (Table.States (1199), 104, 119); Add_Action (Table.States (1199), 105, 33); Add_Action (Table.States (1199), 106, 34); Add_Error (Table.States (1199)); Add_Goto (Table.States (1199), 114, 1145); Add_Goto (Table.States (1199), 128, 41); Add_Goto (Table.States (1199), 147, 1238); Add_Goto (Table.States (1199), 239, 484); Add_Goto (Table.States (1199), 241, 721); Add_Goto (Table.States (1199), 272, 92); Add_Goto (Table.States (1199), 293, 97); Add_Goto (Table.States (1199), 314, 1147); Table.States (1199).Kernel := To_Vector ((0 => (120, 42, 1, False))); Table.States (1199).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1200), 7, Reduce, (241, 1), 0, null, null); Add_Action (Table.States (1200), 8, 1144); Add_Action (Table.States (1200), 40, 742); Add_Action (Table.States (1200), 104, 119); Add_Action (Table.States (1200), 105, 33); Add_Action (Table.States (1200), 106, 34); Add_Error (Table.States (1200)); Add_Goto (Table.States (1200), 114, 1145); Add_Goto (Table.States (1200), 128, 41); Add_Goto (Table.States (1200), 147, 1239); Add_Goto (Table.States (1200), 239, 484); Add_Goto (Table.States (1200), 241, 721); Add_Goto (Table.States (1200), 272, 92); Add_Goto (Table.States (1200), 293, 97); Add_Goto (Table.States (1200), 314, 1147); Table.States (1200).Kernel := To_Vector ((0 => (120, 42, 1, False))); Table.States (1200).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1201), (77, 83), (226, 0), 3, null, null); Table.States (1201).Kernel := To_Vector ((0 => (226, 225, 0, True))); Table.States (1201).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 226, 3))); Table.States (1201).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1202), 53, 1240); Add_Action (Table.States (1202), 76, 235); Add_Action (Table.States (1202), 84, 237); Add_Action (Table.States (1202), 101, 239); Add_Action (Table.States (1202), 102, 240); Add_Error (Table.States (1202)); Add_Goto (Table.States (1202), 115, 241); Add_Goto (Table.States (1202), 322, 242); Table.States (1202).Kernel := To_Vector (((128, 239, 2, True), (225, 239, 2, False), (239, 239, 5, True), (239, 239, 2, True), (272, 239, 3, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True), (293, 239, 2, True))); Table.States (1202).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 53, 1240))); Add_Action (Table.States (1203), (77, 83), (225, 0), 3, null, null); Table.States (1203).Kernel := To_Vector ((0 => (225, 80, 0, False))); Table.States (1203).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 225, 3))); Add_Action (Table.States (1204), (74, 96), (326, 4), 5, null, null); Table.States (1204).Kernel := To_Vector ((0 => (326, 279, 0, False))); Table.States (1204).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 326, 5))); Add_Action (Table.States (1205), 3, 121); Add_Action (Table.States (1205), 39, 122); Add_Action (Table.States (1205), 40, 123); Add_Action (Table.States (1205), 41, 124); Add_Action (Table.States (1205), 76, 126); Add_Action (Table.States (1205), 94, 127); Add_Action (Table.States (1205), 95, 128); Add_Action (Table.States (1205), 103, 129); Add_Action (Table.States (1205), 104, 119); Add_Action (Table.States (1205), 105, 33); Add_Action (Table.States (1205), 106, 34); Add_Error (Table.States (1205)); Add_Goto (Table.States (1205), 117, 130); Add_Goto (Table.States (1205), 128, 41); Add_Goto (Table.States (1205), 197, 133); Add_Goto (Table.States (1205), 239, 134); Add_Goto (Table.States (1205), 258, 135); Add_Goto (Table.States (1205), 272, 92); Add_Goto (Table.States (1205), 293, 97); Add_Goto (Table.States (1205), 301, 1241); Add_Goto (Table.States (1205), 320, 144); Add_Goto (Table.States (1205), 321, 145); Add_Goto (Table.States (1205), 330, 146); Table.States (1205).Kernel := To_Vector ((0 => (279, 85, 1, False))); Table.States (1205).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (1206), 3, 121); Add_Action (Table.States (1206), 39, 122); Add_Action (Table.States (1206), 40, 261); Add_Action (Table.States (1206), 41, 124); Add_Action (Table.States (1206), 44, 263); Add_Action (Table.States (1206), 52, 125); Add_Action (Table.States (1206), 76, 126); Add_Action (Table.States (1206), 79, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (1206), 87, Reduce, (166, 2), 0, null, null); Add_Action (Table.States (1206), 94, 127); Add_Action (Table.States (1206), 95, 128); Add_Action (Table.States (1206), 103, 129); Add_Action (Table.States (1206), 104, 119); Add_Action (Table.States (1206), 105, 33); Add_Action (Table.States (1206), 106, 34); Add_Error (Table.States (1206)); Add_Goto (Table.States (1206), 117, 130); Add_Goto (Table.States (1206), 128, 41); Add_Goto (Table.States (1206), 165, 269); Add_Goto (Table.States (1206), 166, 1242); Add_Goto (Table.States (1206), 191, 599); Add_Goto (Table.States (1206), 197, 133); Add_Goto (Table.States (1206), 239, 274); Add_Goto (Table.States (1206), 258, 135); Add_Goto (Table.States (1206), 272, 92); Add_Goto (Table.States (1206), 275, 136); Add_Goto (Table.States (1206), 277, 276); Add_Goto (Table.States (1206), 282, 137); Add_Goto (Table.States (1206), 283, 138); Add_Goto (Table.States (1206), 284, 139); Add_Goto (Table.States (1206), 285, 140); Add_Goto (Table.States (1206), 286, 141); Add_Goto (Table.States (1206), 287, 142); Add_Goto (Table.States (1206), 293, 97); Add_Goto (Table.States (1206), 301, 277); Add_Goto (Table.States (1206), 320, 144); Add_Goto (Table.States (1206), 321, 145); Add_Goto (Table.States (1206), 330, 146); Table.States (1206).Kernel := To_Vector ((0 => (329, 72, 1, False))); Table.States (1206).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 166, 0))); Add_Action (Table.States (1207), 24, 1243); Add_Action (Table.States (1207), 72, 1206); Add_Error (Table.States (1207)); Add_Goto (Table.States (1207), 329, 1244); Table.States (1207).Kernel := To_Vector (((327, 328, 3, False), (328, 328, 2, True))); Table.States (1207).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1243))); Add_Action (Table.States (1208), (24, 72), (328, 1), 1, null, null); Table.States (1208).Kernel := To_Vector ((0 => (328, 329, 0, False))); Table.States (1208).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 328, 1))); Add_Action (Table.States (1209), (74, 82, 96), (147, 2), 2, null, null); Table.States (1209).Kernel := To_Vector ((0 => (147, 114, 0, False))); Table.States (1209).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 147, 2))); Add_Action (Table.States (1210), (74, 82, 96), (147, 0), 2, null, null); Table.States (1210).Kernel := To_Vector ((0 => (147, 314, 0, False))); Table.States (1210).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 147, 2))); Add_Action (Table.States (1211), 3, 121); Add_Action (Table.States (1211), 39, 122); Add_Action (Table.States (1211), 40, 123); Add_Action (Table.States (1211), 41, 124); Add_Action (Table.States (1211), 52, 125); Add_Action (Table.States (1211), 74, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1211), 76, 126); Add_Action (Table.States (1211), 94, 127); Add_Action (Table.States (1211), 95, 128); Add_Action (Table.States (1211), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1211), 103, 129); Add_Action (Table.States (1211), 104, 119); Add_Action (Table.States (1211), 105, 33); Add_Action (Table.States (1211), 106, 34); Add_Error (Table.States (1211)); Add_Goto (Table.States (1211), 117, 130); Add_Goto (Table.States (1211), 128, 41); Add_Goto (Table.States (1211), 191, 131); Add_Goto (Table.States (1211), 192, 1245); Add_Goto (Table.States (1211), 197, 133); Add_Goto (Table.States (1211), 239, 134); Add_Goto (Table.States (1211), 258, 135); Add_Goto (Table.States (1211), 272, 92); Add_Goto (Table.States (1211), 275, 136); Add_Goto (Table.States (1211), 282, 137); Add_Goto (Table.States (1211), 283, 138); Add_Goto (Table.States (1211), 284, 139); Add_Goto (Table.States (1211), 285, 140); Add_Goto (Table.States (1211), 286, 141); Add_Goto (Table.States (1211), 287, 142); Add_Goto (Table.States (1211), 293, 97); Add_Goto (Table.States (1211), 301, 143); Add_Goto (Table.States (1211), 320, 144); Add_Goto (Table.States (1211), 321, 145); Add_Goto (Table.States (1211), 330, 146); Table.States (1211).Kernel := To_Vector ((0 => (146, 82, 1, False))); Table.States (1211).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1212), 96, 1246); Add_Error (Table.States (1212)); Table.States (1212).Kernel := To_Vector ((0 => (146, 122, 1, False))); Table.States (1212).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1246))); Add_Action (Table.States (1213), 10, 1006); Add_Action (Table.States (1213), 74, Reduce, (119, 0), 2, null, null); Add_Action (Table.States (1213), 96, Reduce, (119, 0), 2, null, null); Add_Error (Table.States (1213)); Table.States (1213).Kernel := To_Vector (((119, 227, 0, False), (227, 227, 2, True))); Table.States (1213).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 119, 2))); Add_Action (Table.States (1214), 49, 1247); Add_Error (Table.States (1214)); Table.States (1214).Kernel := To_Vector ((0 => (259, 74, 2, False))); Table.States (1214).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 49, 1247))); Add_Action (Table.States (1215), 41, 705); Add_Action (Table.States (1215), 54, 708); Add_Error (Table.States (1215)); Add_Goto (Table.States (1215), 280, 1248); Table.States (1215).Kernel := To_Vector ((0 => (162, 74, 2, False))); Table.States (1215).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 41, 705))); Add_Action (Table.States (1216), 4, 1); Add_Action (Table.States (1216), 5, 2); Add_Action (Table.States (1216), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1216), 15, 3); Add_Action (Table.States (1216), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1216), 18, 4); Add_Action (Table.States (1216), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1216), 27, 5); Add_Action (Table.States (1216), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1216), 31, 9); Add_Action (Table.States (1216), 32, 10); Add_Action (Table.States (1216), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1216), 41, 13); Add_Action (Table.States (1216), 48, 16); Add_Action (Table.States (1216), 52, 20); Add_Action (Table.States (1216), 57, 21); Add_Action (Table.States (1216), 58, 22); Add_Action (Table.States (1216), 61, 24); Add_Action (Table.States (1216), 72, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1216), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1216), 93, 31); Add_Action (Table.States (1216), 104, 360); Add_Action (Table.States (1216), 105, 33); Add_Action (Table.States (1216), 106, 34); Add_Error (Table.States (1216)); Add_Goto (Table.States (1216), 113, 36); Add_Goto (Table.States (1216), 123, 38); Add_Goto (Table.States (1216), 126, 39); Add_Goto (Table.States (1216), 128, 41); Add_Goto (Table.States (1216), 131, 42); Add_Goto (Table.States (1216), 132, 43); Add_Goto (Table.States (1216), 133, 44); Add_Goto (Table.States (1216), 139, 47); Add_Goto (Table.States (1216), 151, 50); Add_Goto (Table.States (1216), 152, 51); Add_Goto (Table.States (1216), 161, 53); Add_Goto (Table.States (1216), 190, 57); Add_Goto (Table.States (1216), 196, 59); Add_Goto (Table.States (1216), 217, 68); Add_Goto (Table.States (1216), 222, 70); Add_Goto (Table.States (1216), 232, 72); Add_Goto (Table.States (1216), 239, 73); Add_Goto (Table.States (1216), 257, 83); Add_Goto (Table.States (1216), 261, 86); Add_Goto (Table.States (1216), 272, 92); Add_Goto (Table.States (1216), 276, 93); Add_Goto (Table.States (1216), 290, 96); Add_Goto (Table.States (1216), 293, 97); Add_Goto (Table.States (1216), 294, 98); Add_Goto (Table.States (1216), 298, 99); Add_Goto (Table.States (1216), 299, 361); Add_Goto (Table.States (1216), 300, 1249); Add_Goto (Table.States (1216), 302, 100); Add_Goto (Table.States (1216), 303, 101); Add_Goto (Table.States (1216), 306, 363); Add_Goto (Table.States (1216), 323, 114); Table.States (1216).Kernel := To_Vector ((0 => (187, 87, 0, False))); Table.States (1216).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 300, 0))); Add_Action (Table.States (1217), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 1), 9, object_declaration_1'Access, null); Table.States (1217).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1217).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 9))); Add_Action (Table.States (1218), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 2), 9, object_declaration_2'Access, null); Table.States (1218).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1218).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 9))); Add_Action (Table.States (1219), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (244, 0), 9, object_declaration_0'Access, null); Table.States (1219).Kernel := To_Vector ((0 => (244, 96, 0, False))); Table.States (1219).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 244, 9))); Add_Action (Table.States (1220), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (179, 0), 9, entry_declaration_0'Access, null); Table.States (1220).Kernel := To_Vector ((0 => (179, 96, 0, False))); Table.States (1220).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 179, 9))); Add_Action (Table.States (1221), 96, 1250); Add_Error (Table.States (1221)); Table.States (1221).Kernel := To_Vector ((0 => (307, 240, 1, False))); Table.States (1221).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1250))); Add_Action (Table.States (1222), (22, 23, 77), (172, 0), 4, elsif_expression_item_0'Access, null); Table.States (1222).Kernel := To_Vector ((0 => (172, 192, 0, False))); Table.States (1222).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 172, 4))); Add_Action (Table.States (1223), 85, 1251); Add_Error (Table.States (1223)); Table.States (1223).Kernel := To_Vector ((0 => (144, 301, 3, False))); Table.States (1223).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 85, 1251))); Add_Action (Table.States (1224), 3, 121); Add_Action (Table.States (1224), 39, 122); Add_Action (Table.States (1224), 40, 123); Add_Action (Table.States (1224), 41, 124); Add_Action (Table.States (1224), 52, 125); Add_Action (Table.States (1224), 76, 126); Add_Action (Table.States (1224), 77, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1224), 94, 127); Add_Action (Table.States (1224), 95, 128); Add_Action (Table.States (1224), 96, Reduce, (192, 1), 0, null, null); Add_Action (Table.States (1224), 103, 129); Add_Action (Table.States (1224), 104, 119); Add_Action (Table.States (1224), 105, 33); Add_Action (Table.States (1224), 106, 34); Add_Error (Table.States (1224)); Add_Goto (Table.States (1224), 117, 130); Add_Goto (Table.States (1224), 128, 41); Add_Goto (Table.States (1224), 191, 131); Add_Goto (Table.States (1224), 192, 1252); Add_Goto (Table.States (1224), 197, 133); Add_Goto (Table.States (1224), 239, 134); Add_Goto (Table.States (1224), 258, 135); Add_Goto (Table.States (1224), 272, 92); Add_Goto (Table.States (1224), 275, 136); Add_Goto (Table.States (1224), 282, 137); Add_Goto (Table.States (1224), 283, 138); Add_Goto (Table.States (1224), 284, 139); Add_Goto (Table.States (1224), 285, 140); Add_Goto (Table.States (1224), 286, 141); Add_Goto (Table.States (1224), 287, 142); Add_Goto (Table.States (1224), 293, 97); Add_Goto (Table.States (1224), 301, 143); Add_Goto (Table.States (1224), 320, 144); Add_Goto (Table.States (1224), 321, 145); Add_Goto (Table.States (1224), 330, 146); Table.States (1224).Kernel := To_Vector ((0 => (254, 82, 0, False))); Table.States (1224).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 192, 0))); Add_Action (Table.States (1225), 49, 1253); Add_Error (Table.States (1225)); Table.States (1225).Kernel := To_Vector ((0 => (203, 74, 1, False))); Table.States (1225).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 49, 1253))); Add_Action (Table.States (1226), (74, 96), (205, 0), 3, null, null); Table.States (1226).Kernel := To_Vector ((0 => (205, 77, 0, False))); Table.States (1226).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 205, 3))); Add_Action (Table.States (1227), (29, 47, 48, 50, 69, 71, 74, 104), (204, 0), 9, formal_package_declaration_0'Access, null); Table.States (1227).Kernel := To_Vector ((0 => (204, 96, 0, False))); Table.States (1227).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 204, 9))); Add_Action (Table.States (1228), (29, 47, 48, 50, 69, 71, 74, 104), (198, 0), 9, formal_object_declaration_0'Access, null); Table.States (1228).Kernel := To_Vector ((0 => (198, 96, 0, False))); Table.States (1228).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 198, 9))); Add_Action (Table.States (1229), (4, 5, 13, 15, 17, 18, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 68, 69, 71, 72, 73, 74, 93, 104, 105, 106, 107), (222, 0), 10, if_statement_0'Access, null); Table.States (1229).Kernel := To_Vector ((0 => (222, 96, 0, False))); Table.States (1229).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 222, 10))); Add_Action (Table.States (1230), 96, 1254); Add_Error (Table.States (1230)); Table.States (1230).Kernel := To_Vector ((0 => (247, 240, 1, False))); Table.States (1230).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1254))); Add_Action (Table.States (1231), 33, 1255); Add_Error (Table.States (1231)); Table.States (1231).Kernel := To_Vector ((0 => (177, 104, 3, False))); Table.States (1231).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 33, 1255))); Add_Action (Table.States (1232), 35, 1256); Add_Error (Table.States (1232)); Table.States (1232).Kernel := To_Vector ((0 => (176, 192, 4, False))); Table.States (1232).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 35, 1256))); Add_Action (Table.States (1233), 96, 1257); Add_Error (Table.States (1233)); Table.States (1233).Kernel := To_Vector ((0 => (271, 266, 1, False))); Table.States (1233).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1257))); Add_Action (Table.States (1234), 96, 1258); Add_Error (Table.States (1234)); Table.States (1234).Kernel := To_Vector ((0 => (316, 220, 1, False))); Table.States (1234).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1258))); Add_Action (Table.States (1235), 24, 1259); Add_Error (Table.States (1235)); Table.States (1235).Kernel := To_Vector ((0 => (319, 318, 2, False))); Table.States (1235).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1259))); Add_Action (Table.States (1236), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (319, 1), 10, task_type_declaration_1'Access, task_type_declaration_1_check'Access); Table.States (1236).Kernel := To_Vector ((0 => (319, 96, 0, False))); Table.States (1236).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 319, 10))); Add_Action (Table.States (1237), 96, 1260); Add_Error (Table.States (1237)); Table.States (1237).Kernel := To_Vector ((0 => (305, 220, 1, False))); Table.States (1237).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1260))); Add_Action (Table.States (1238), (74, 82, 96), (120, 1), 6, array_type_definition_1'Access, null); Table.States (1238).Kernel := To_Vector ((0 => (120, 147, 0, False))); Table.States (1238).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 120, 6))); Add_Action (Table.States (1239), (74, 82, 96), (120, 0), 6, array_type_definition_0'Access, null); Table.States (1239).Kernel := To_Vector ((0 => (120, 147, 0, False))); Table.States (1239).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 120, 6))); Add_Action (Table.States (1240), 80, 1203); Add_Error (Table.States (1240)); Table.States (1240).Kernel := To_Vector ((0 => (225, 53, 1, False))); Table.States (1240).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 80, 1203))); Add_Action (Table.States (1241), (74, 96), (279, 0), 4, null, null); Table.States (1241).Kernel := To_Vector ((0 => (279, 301, 0, False))); Table.States (1241).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 279, 4))); Add_Action (Table.States (1242), 79, 445); Add_Action (Table.States (1242), 87, 1261); Add_Error (Table.States (1242)); Table.States (1242).Kernel := To_Vector (((166, 166, 2, True), (329, 166, 1, False))); Table.States (1242).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 87, 1261))); Add_Action (Table.States (1243), 15, 1262); Add_Error (Table.States (1243)); Table.States (1243).Kernel := To_Vector ((0 => (327, 24, 2, False))); Table.States (1243).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 15, 1262))); Add_Action (Table.States (1244), (24, 72), (328, 0), 2, null, null); Table.States (1244).Kernel := To_Vector ((0 => (328, 329, 0, True))); Table.States (1244).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 328, 2))); Table.States (1244).Minimal_Complete_Actions_Recursive := True; Add_Action (Table.States (1245), 74, 337); Add_Action (Table.States (1245), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1245)); Add_Goto (Table.States (1245), 122, 1263); Table.States (1245).Kernel := To_Vector ((0 => (146, 192, 1, False))); Table.States (1245).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1246), (15, 24, 28, 72, 104), (146, 1), 5, component_declaration_1'Access, null); Table.States (1246).Kernel := To_Vector ((0 => (146, 96, 0, False))); Table.States (1246).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 146, 5))); Add_Action (Table.States (1247), 74, 337); Add_Action (Table.States (1247), 96, Reduce, (122, 1), 0, null, null); Add_Error (Table.States (1247)); Add_Goto (Table.States (1247), 122, 1264); Table.States (1247).Kernel := To_Vector ((0 => (259, 49, 1, False))); Table.States (1247).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 122, 0))); Add_Action (Table.States (1248), (74, 96), (162, 0), 6, derived_type_definition_0'Access, null); Table.States (1248).Kernel := To_Vector ((0 => (162, 280, 0, False))); Table.States (1248).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 162, 6))); Add_Action (Table.States (1249), (24, 72), (187, 0), 6, exception_handler_0'Access, null); Table.States (1249).Kernel := To_Vector ((0 => (187, 300, 0, False))); Table.States (1249).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 187, 6))); Add_Action (Table.States (1250), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (307, 0), 10, subprogram_body_0'Access, subprogram_body_0_check'Access); Table.States (1250).Kernel := To_Vector ((0 => (307, 96, 0, False))); Table.States (1250).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 307, 10))); Add_Action (Table.States (1251), 3, 121); Add_Action (Table.States (1251), 39, 122); Add_Action (Table.States (1251), 40, 123); Add_Action (Table.States (1251), 41, 124); Add_Action (Table.States (1251), 76, 126); Add_Action (Table.States (1251), 94, 127); Add_Action (Table.States (1251), 95, 128); Add_Action (Table.States (1251), 103, 129); Add_Action (Table.States (1251), 104, 119); Add_Action (Table.States (1251), 105, 33); Add_Action (Table.States (1251), 106, 34); Add_Error (Table.States (1251)); Add_Goto (Table.States (1251), 117, 130); Add_Goto (Table.States (1251), 128, 41); Add_Goto (Table.States (1251), 197, 133); Add_Goto (Table.States (1251), 239, 134); Add_Goto (Table.States (1251), 258, 135); Add_Goto (Table.States (1251), 272, 92); Add_Goto (Table.States (1251), 293, 97); Add_Goto (Table.States (1251), 301, 1265); Add_Goto (Table.States (1251), 320, 144); Add_Goto (Table.States (1251), 321, 145); Add_Goto (Table.States (1251), 330, 146); Table.States (1251).Kernel := To_Vector ((0 => (144, 85, 2, False))); Table.States (1251).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 103, 129))); Add_Action (Table.States (1252), (77, 96), (254, 0), 8, parameter_specification_0'Access, null); Table.States (1252).Kernel := To_Vector ((0 => (254, 192, 0, False))); Table.States (1252).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 254, 8))); Add_Action (Table.States (1253), (74, 96), (203, 0), 6, formal_derived_type_definition_0'Access, null); Table.States (1253).Kernel := To_Vector ((0 => (203, 49, 0, False))); Table.States (1253).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 203, 6))); Add_Action (Table.States (1254), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (247, 0), 11, package_body_0'Access, package_body_0_check'Access); Table.States (1254).Kernel := To_Vector ((0 => (247, 96, 0, False))); Table.States (1254).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 247, 11))); Add_Action (Table.States (1255), 3, 121); Add_Action (Table.States (1255), 39, 122); Add_Action (Table.States (1255), 40, 474); Add_Action (Table.States (1255), 41, 124); Add_Action (Table.States (1255), 76, 126); Add_Action (Table.States (1255), 94, 127); Add_Action (Table.States (1255), 95, 128); Add_Action (Table.States (1255), 103, 129); Add_Action (Table.States (1255), 104, 119); Add_Action (Table.States (1255), 105, 33); Add_Action (Table.States (1255), 106, 34); Add_Error (Table.States (1255)); Add_Goto (Table.States (1255), 117, 130); Add_Goto (Table.States (1255), 128, 41); Add_Goto (Table.States (1255), 167, 1266); Add_Goto (Table.States (1255), 197, 133); Add_Goto (Table.States (1255), 239, 477); Add_Goto (Table.States (1255), 258, 135); Add_Goto (Table.States (1255), 272, 92); Add_Goto (Table.States (1255), 277, 478); Add_Goto (Table.States (1255), 293, 97); Add_Goto (Table.States (1255), 301, 479); Add_Goto (Table.States (1255), 314, 480); Add_Goto (Table.States (1255), 320, 144); Add_Goto (Table.States (1255), 321, 145); Add_Goto (Table.States (1255), 330, 146); Table.States (1255).Kernel := To_Vector ((0 => (177, 33, 2, False))); Table.States (1255).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 104, 119))); Add_Action (Table.States (1256), 13, Reduce, (159, 1), 0, null, null); Add_Action (Table.States (1256), 25, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1256), 28, 183); Add_Action (Table.States (1256), 29, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1256), 30, 8); Add_Action (Table.States (1256), 40, 12); Add_Action (Table.States (1256), 46, 14); Add_Action (Table.States (1256), 47, 15); Add_Action (Table.States (1256), 48, 16); Add_Action (Table.States (1256), 50, Reduce, (246, 2), 0, null, null); Add_Action (Table.States (1256), 51, 19); Add_Action (Table.States (1256), 63, 25); Add_Action (Table.States (1256), 66, 26); Add_Action (Table.States (1256), 69, 27); Add_Action (Table.States (1256), 71, 28); Add_Action (Table.States (1256), 104, 185); Add_Error (Table.States (1256)); Add_Goto (Table.States (1256), 112, 35); Add_Goto (Table.States (1256), 121, 37); Add_Goto (Table.States (1256), 127, 40); Add_Goto (Table.States (1256), 134, 45); Add_Goto (Table.States (1256), 135, 46); Add_Goto (Table.States (1256), 157, 391); Add_Goto (Table.States (1256), 158, 392); Add_Goto (Table.States (1256), 159, 1267); Add_Goto (Table.States (1256), 179, 54); Add_Goto (Table.States (1256), 182, 55); Add_Goto (Table.States (1256), 186, 56); Add_Goto (Table.States (1256), 193, 58); Add_Goto (Table.States (1256), 206, 60); Add_Goto (Table.States (1256), 207, 61); Add_Goto (Table.States (1256), 209, 62); Add_Goto (Table.States (1256), 210, 63); Add_Goto (Table.States (1256), 213, 64); Add_Goto (Table.States (1256), 214, 65); Add_Goto (Table.States (1256), 215, 66); Add_Goto (Table.States (1256), 216, 67); Add_Goto (Table.States (1256), 219, 69); Add_Goto (Table.States (1256), 223, 71); Add_Goto (Table.States (1256), 243, 74); Add_Goto (Table.States (1256), 244, 75); Add_Goto (Table.States (1256), 245, 76); Add_Goto (Table.States (1256), 246, 77); Add_Goto (Table.States (1256), 247, 78); Add_Goto (Table.States (1256), 248, 79); Add_Goto (Table.States (1256), 249, 80); Add_Goto (Table.States (1256), 250, 81); Add_Goto (Table.States (1256), 251, 82); Add_Goto (Table.States (1256), 257, 394); Add_Goto (Table.States (1256), 259, 84); Add_Goto (Table.States (1256), 260, 85); Add_Goto (Table.States (1256), 262, 87); Add_Goto (Table.States (1256), 263, 88); Add_Goto (Table.States (1256), 264, 89); Add_Goto (Table.States (1256), 265, 90); Add_Goto (Table.States (1256), 271, 91); Add_Goto (Table.States (1256), 281, 94); Add_Goto (Table.States (1256), 289, 95); Add_Goto (Table.States (1256), 304, 102); Add_Goto (Table.States (1256), 305, 103); Add_Goto (Table.States (1256), 307, 105); Add_Goto (Table.States (1256), 308, 106); Add_Goto (Table.States (1256), 309, 107); Add_Goto (Table.States (1256), 311, 108); Add_Goto (Table.States (1256), 313, 109); Add_Goto (Table.States (1256), 316, 111); Add_Goto (Table.States (1256), 317, 112); Add_Goto (Table.States (1256), 319, 113); Add_Goto (Table.States (1256), 325, 115); Add_Goto (Table.States (1256), 331, 116); Table.States (1256).Kernel := To_Vector ((0 => (176, 35, 3, False))); Table.States (1256).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 159, 0))); Add_Action (Table.States (1257), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (271, 0), 11, protected_type_declaration_0'Access, protected_type_declaration_0_check'Access); Table.States (1257).Kernel := To_Vector ((0 => (271, 96, 0, False))); Table.States (1257).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 271, 11))); Add_Action (Table.States (1258), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (316, 0), 11, task_body_0'Access, task_body_0_check'Access); Table.States (1258).Kernel := To_Vector ((0 => (316, 96, 0, False))); Table.States (1258).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 316, 11))); Add_Action (Table.States (1259), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1259), 104, 149); Add_Error (Table.States (1259)); Add_Goto (Table.States (1259), 220, 1268); Table.States (1259).Kernel := To_Vector ((0 => (319, 24, 1, False))); Table.States (1259).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1260), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (305, 0), 11, single_task_declaration_0'Access, single_task_declaration_0_check'Access); Table.States (1260).Kernel := To_Vector ((0 => (305, 96, 0, False))); Table.States (1260).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 305, 11))); Add_Action (Table.States (1261), 15, 885); Add_Action (Table.States (1261), 24, Reduce, (150, 1), 0, null, null); Add_Action (Table.States (1261), 28, 183); Add_Action (Table.States (1261), 41, 886); Add_Action (Table.States (1261), 72, Reduce, (150, 1), 0, null, null); Add_Action (Table.States (1261), 104, 164); Add_Error (Table.States (1261)); Add_Goto (Table.States (1261), 121, 887); Add_Goto (Table.States (1261), 127, 40); Add_Goto (Table.States (1261), 146, 888); Add_Goto (Table.States (1261), 148, 889); Add_Goto (Table.States (1261), 149, 890); Add_Goto (Table.States (1261), 150, 1269); Add_Goto (Table.States (1261), 182, 55); Add_Goto (Table.States (1261), 219, 892); Add_Goto (Table.States (1261), 281, 94); Add_Goto (Table.States (1261), 327, 893); Table.States (1261).Kernel := To_Vector ((0 => (329, 87, 0, False))); Table.States (1261).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 150, 0))); Add_Action (Table.States (1262), 96, 1270); Add_Error (Table.States (1262)); Table.States (1262).Kernel := To_Vector ((0 => (327, 15, 1, False))); Table.States (1262).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1270))); Add_Action (Table.States (1263), 96, 1271); Add_Error (Table.States (1263)); Table.States (1263).Kernel := To_Vector ((0 => (146, 122, 1, False))); Table.States (1263).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1271))); Add_Action (Table.States (1264), 96, 1272); Add_Error (Table.States (1264)); Table.States (1264).Kernel := To_Vector ((0 => (259, 122, 1, False))); Table.States (1264).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1272))); Add_Action (Table.States (1265), 96, 1273); Add_Error (Table.States (1265)); Table.States (1265).Kernel := To_Vector ((0 => (144, 301, 1, False))); Table.States (1265).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1273))); Add_Action (Table.States (1266), 77, 1274); Add_Error (Table.States (1266)); Table.States (1266).Kernel := To_Vector ((0 => (177, 167, 1, False))); Table.States (1266).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 77, 1274))); Add_Action (Table.States (1267), 13, 1275); Add_Error (Table.States (1267)); Table.States (1267).Kernel := To_Vector ((0 => (176, 159, 3, False))); Table.States (1267).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 13, 1275))); Add_Action (Table.States (1268), 96, 1276); Add_Error (Table.States (1268)); Table.States (1268).Kernel := To_Vector ((0 => (319, 220, 1, False))); Table.States (1268).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1276))); end Subr_20; procedure Subr_21 is begin Add_Action (Table.States (1269), (24, 72), (329, 0), 4, variant_0'Access, null); Table.States (1269).Kernel := To_Vector ((0 => (329, 150, 0, False))); Table.States (1269).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 329, 4))); Add_Action (Table.States (1270), (15, 24, 28, 72, 104), (327, 0), 7, variant_part_0'Access, null); Table.States (1270).Kernel := To_Vector ((0 => (327, 96, 0, False))); Table.States (1270).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 327, 7))); Add_Action (Table.States (1271), (15, 24, 28, 72, 104), (146, 0), 7, component_declaration_0'Access, null); Table.States (1271).Kernel := To_Vector ((0 => (146, 96, 0, False))); Table.States (1271).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 146, 7))); Add_Action (Table.States (1272), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (259, 0), 12, private_extension_declaration_0'Access, null); Table.States (1272).Kernel := To_Vector ((0 => (259, 96, 0, False))); Table.States (1272).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 259, 12))); Add_Action (Table.States (1273), (24, 104), (144, 0), 8, component_clause_0'Access, null); Table.States (1273).Kernel := To_Vector ((0 => (144, 96, 0, False))); Table.States (1273).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 144, 8))); Add_Action (Table.States (1274), 72, Reduce, (253, 1), 0, null, null); Add_Action (Table.States (1274), 76, 431); Add_Error (Table.States (1274)); Add_Goto (Table.States (1274), 199, 344); Add_Goto (Table.States (1274), 253, 1277); Table.States (1274).Kernel := To_Vector ((0 => (177, 77, 0, False))); Table.States (1274).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 253, 0))); Add_Action (Table.States (1275), 4, 1); Add_Action (Table.States (1275), 5, 2); Add_Action (Table.States (1275), 13, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1275), 15, 3); Add_Action (Table.States (1275), 17, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1275), 18, 4); Add_Action (Table.States (1275), 24, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1275), 26, Reduce, (300, 1), 0, null, null); Add_Action (Table.States (1275), 27, 5); Add_Action (Table.States (1275), 28, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1275), 31, 9); Add_Action (Table.States (1275), 32, 10); Add_Action (Table.States (1275), 37, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1275), 41, 13); Add_Action (Table.States (1275), 48, 16); Add_Action (Table.States (1275), 52, 20); Add_Action (Table.States (1275), 57, 21); Add_Action (Table.States (1275), 58, 22); Add_Action (Table.States (1275), 61, 24); Add_Action (Table.States (1275), 73, Reduce, (132, 1), 0, null, null); Add_Action (Table.States (1275), 93, 31); Add_Action (Table.States (1275), 104, 360); Add_Action (Table.States (1275), 105, 33); Add_Action (Table.States (1275), 106, 34); Add_Error (Table.States (1275)); Add_Goto (Table.States (1275), 113, 36); Add_Goto (Table.States (1275), 123, 38); Add_Goto (Table.States (1275), 126, 39); Add_Goto (Table.States (1275), 128, 41); Add_Goto (Table.States (1275), 131, 42); Add_Goto (Table.States (1275), 132, 43); Add_Goto (Table.States (1275), 133, 44); Add_Goto (Table.States (1275), 139, 47); Add_Goto (Table.States (1275), 151, 50); Add_Goto (Table.States (1275), 152, 51); Add_Goto (Table.States (1275), 161, 53); Add_Goto (Table.States (1275), 190, 57); Add_Goto (Table.States (1275), 196, 59); Add_Goto (Table.States (1275), 217, 68); Add_Goto (Table.States (1275), 218, 1278); Add_Goto (Table.States (1275), 222, 70); Add_Goto (Table.States (1275), 232, 72); Add_Goto (Table.States (1275), 239, 73); Add_Goto (Table.States (1275), 257, 83); Add_Goto (Table.States (1275), 261, 86); Add_Goto (Table.States (1275), 272, 92); Add_Goto (Table.States (1275), 276, 93); Add_Goto (Table.States (1275), 290, 96); Add_Goto (Table.States (1275), 293, 97); Add_Goto (Table.States (1275), 294, 98); Add_Goto (Table.States (1275), 298, 99); Add_Goto (Table.States (1275), 299, 361); Add_Goto (Table.States (1275), 300, 390); Add_Goto (Table.States (1275), 302, 100); Add_Goto (Table.States (1275), 303, 101); Add_Goto (Table.States (1275), 306, 363); Add_Goto (Table.States (1275), 323, 114); Table.States (1275).Kernel := To_Vector ((0 => (176, 13, 2, False))); Table.States (1275).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 218, 0))); Add_Action (Table.States (1276), (4, 5, 13, 15, 17, 18, 24, 25, 27, 28, 29, 30, 31, 32, 36, 37, 40, 41, 46, 47, 48, 49, 50, 51, 52, 57, 58, 60, 61, 63, 66, 69, 71, 73, 74, 93, 104, 105, 106, 107), (319, 0), 13, task_type_declaration_0'Access, task_type_declaration_0_check'Access); Table.States (1276).Kernel := To_Vector ((0 => (319, 96, 0, False))); Table.States (1276).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 319, 13))); Add_Action (Table.States (1277), (1 => 72), (177, 0), 7, entry_body_formal_part_0'Access, null); Table.States (1277).Kernel := To_Vector ((0 => (177, 253, 0, False))); Table.States (1277).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 177, 7))); Add_Action (Table.States (1278), 24, 1279); Add_Error (Table.States (1278)); Table.States (1278).Kernel := To_Vector ((0 => (176, 218, 2, False))); Table.States (1278).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 24, 1279))); Add_Action (Table.States (1279), 96, Reduce, (220, 1), 0, null, null); Add_Action (Table.States (1279), 104, 149); Add_Error (Table.States (1279)); Add_Goto (Table.States (1279), 220, 1280); Table.States (1279).Kernel := To_Vector ((0 => (176, 24, 1, False))); Table.States (1279).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 220, 0))); Add_Action (Table.States (1280), 96, 1281); Add_Error (Table.States (1280)); Table.States (1280).Kernel := To_Vector ((0 => (176, 220, 1, False))); Table.States (1280).Minimal_Complete_Actions := To_Vector ((0 => (Shift, 96, 1281))); Add_Action (Table.States (1281), (24, 25, 28, 29, 40, 46, 50), (176, 0), 12, entry_body_0'Access, entry_body_0_check'Access); Table.States (1281).Kernel := To_Vector ((0 => (176, 96, 0, False))); Table.States (1281).Minimal_Complete_Actions := To_Vector ((0 => (Reduce, 176, 12))); end Subr_21; begin Subr_1; Subr_2; Subr_3; Subr_4; Subr_5; Subr_6; Subr_7; Subr_8; Subr_9; Subr_10; Subr_11; Subr_12; Subr_13; Subr_14; Subr_15; Subr_16; Subr_17; Subr_18; Subr_19; Subr_20; Subr_21; end; WisiToken.Parse.LR.Parser.New_Parser (Parser, Trace, Lexer.New_Lexer (Trace.Descriptor), Table, Language_Fixes, Language_Matching_Begin_Tokens, Language_String_ID_Set, User_Data, Max_Parallel => 15, Terminate_Same_State => True); end Create_Parser; end Ada_Process_LALR_Main;
-- This package will provide declarations for devices -- and configuration routines on the Flip32cc3df4revo board with System; with STM32; use STM32; with STM32.Device; use STM32.Device; with STM32.GPIO; use STM32.GPIO; -- with STM32.USARTs; use STM32.USARTs; -- with STM32.Timers; use STM32.Timers; -- with STM32.PWM; use STM32.PWM; with Interfaces; use Interfaces; with Interfaces.C; with Ada.Strings.Bounded; -- with Ravenscar_Time; package cc3df4revo.Board is package ASB32 is new Ada.Strings.Bounded.Generic_Bounded_Length (Max => 32); -- -- Devices -- -- mpu -- usart (for s.bus) -- type SBUS_RXTX (USART_Ptr : not null access USART) is limited null record; -- SBUS1 : SBUS_RXTX (USART_Ptr => USART_1'Access); -- SBUS1 : USART renames USART_1; -- SBUS_TX : GPIO_Point renames PA9; -- SBUS_RX : GPIO_Point renames PA10; -- SBUS_AF : GPIO_Alternate_Function renames GPIO_AF_USART1_7; -- M1 : PWM_Modulator; -- -- Board initialization -- procedure Initialize; -- Doing receive procedure usb_receive (message : out ASB32.Bounded_String); -- Doing transmission procedure usb_transmit (message : String); private function ada_usbapi_rx (buffer : out Interfaces.C.char_array) return Interfaces.C.unsigned_short with Import => True, Convention => C, External_Name => "usbapi_rx"; procedure ada_usbapi_tx (buffer : System.Address; len : Interfaces.C.unsigned_short) with Import => True, Convention => C, External_Name => "usbapi_tx"; -- -- USB util -- function ada_usbapi_setup return Interfaces.C.int with Import => True, Convention => C, External_Name => "usbapi_setup"; -- -- Motor pins -- -- MOTOR_123_Timer : Timer renames Timer_2; -- MOTOR_4_Timer : Timer renames Timer_4; -- MOTOR_1 : GPIO_Point renames PB0; -- MOTOR_1_AF : GPIO_Alternate_Function renames GPIO_AF_TIM2_1; -- MOTOR_1_Channel : Timer_Channel renames Channel_2; -- MOTOR_2 : GPIO_Point renames PB1; -- MOTOR_2_AF : GPIO_Alternate_Function renames GPIO_AF_TIM2_1; -- MOTOR_2_Channel : Timer_Channel renames Channel_4; -- MOTOR_3 : GPIO_Point renames PA3; -- MOTOR_3_AF : GPIO_Alternate_Function renames GPIO_AF_TIM2_1; -- MOTOR_3_Channel : Timer_Channel renames Channel_1; -- MOTOR_4 : GPIO_Point renames PA2; -- MOTOR_4_AF : GPIO_Alternate_Function renames GPIO_AF_TIM4_2; -- MOTOR_4_Channel : Timer_Channel renames Channel_4; end cc3df4revo.Board;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the VxWorks version of this package -- This package contains all the GNULL primitives that interface directly -- with the underlying OS. pragma Polling (Off); -- Turn off polling, we do not want ATC polling to take place during -- tasking operations. It causes infinite loops and other problems. with System.Tasking.Debug; -- used for Known_Tasks with System.Interrupt_Management; -- used for Keep_Unmasked -- Abort_Task_Signal -- Signal_ID -- Initialize_Interrupts with Interfaces.C; with System.Soft_Links; -- used for Abort_Defer/Undefer -- We use System.Soft_Links instead of System.Tasking.Initialization -- because the later is a higher level package that we shouldn't depend on. -- For example when using the restricted run time, it is replaced by -- System.Tasking.Restricted.Stages. with Unchecked_Conversion; with Unchecked_Deallocation; package body System.Task_Primitives.Operations is package SSL renames System.Soft_Links; use System.Tasking.Debug; use System.Tasking; use System.OS_Interface; use System.Parameters; use type Interfaces.C.int; subtype int is System.OS_Interface.int; Relative : constant := 0; ---------------- -- Local Data -- ---------------- -- The followings are logically constants, but need to be initialized at -- run time. Single_RTS_Lock : aliased RTS_Lock; -- This is a lock to allow only one thread of control in the RTS at a -- time; it is used to execute in mutual exclusion from all other tasks. -- Used mainly in Single_Lock mode, but also to protect All_Tasks_List Environment_Task_Id : Task_Id; -- A variable to hold Task_Id for the environment task Unblocked_Signal_Mask : aliased sigset_t; -- The set of signals that should unblocked in all tasks -- The followings are internal configuration constants needed Time_Slice_Val : Integer; pragma Import (C, Time_Slice_Val, "__gl_time_slice_val"); Locking_Policy : Character; pragma Import (C, Locking_Policy, "__gl_locking_policy"); Dispatching_Policy : Character; pragma Import (C, Dispatching_Policy, "__gl_task_dispatching_policy"); Mutex_Protocol : Priority_Type; Foreign_Task_Elaborated : aliased Boolean := True; -- Used to identified fake tasks (i.e., non-Ada Threads) -------------------- -- Local Packages -- -------------------- package Specific is procedure Initialize; pragma Inline (Initialize); -- Initialize task specific data function Is_Valid_Task return Boolean; pragma Inline (Is_Valid_Task); -- Does executing thread have a TCB? procedure Set (Self_Id : Task_Id); pragma Inline (Set); -- Set the self id for the current task procedure Delete; pragma Inline (Delete); -- Delete the task specific data associated with the current task function Self return Task_Id; pragma Inline (Self); -- Return a pointer to the Ada Task Control Block of the calling task end Specific; package body Specific is separate; -- The body of this package is target specific --------------------------------- -- Support for foreign threads -- --------------------------------- function Register_Foreign_Thread (Thread : Thread_Id) return Task_Id; -- Allocate and Initialize a new ATCB for the current Thread function Register_Foreign_Thread (Thread : Thread_Id) return Task_Id is separate; ----------------------- -- Local Subprograms -- ----------------------- procedure Abort_Handler (signo : Signal); -- Handler for the abort (SIGABRT) signal to handle asynchronous abort procedure Install_Signal_Handlers; -- Install the default signal handlers for the current task function To_Address is new Unchecked_Conversion (Task_Id, System.Address); ------------------- -- Abort_Handler -- ------------------- procedure Abort_Handler (signo : Signal) is pragma Unreferenced (signo); Self_ID : constant Task_Id := Self; Result : int; Old_Set : aliased sigset_t; begin -- It is not safe to raise an exception when using ZCX and the GCC -- exception handling mechanism. if ZCX_By_Default and then GCC_ZCX_Support then return; end if; if Self_ID.Deferral_Level = 0 and then Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level and then not Self_ID.Aborting then Self_ID.Aborting := True; -- Make sure signals used for RTS internal purpose are unmasked Result := pthread_sigmask (SIG_UNBLOCK, Unblocked_Signal_Mask'Unchecked_Access, Old_Set'Unchecked_Access); pragma Assert (Result = 0); raise Standard'Abort_Signal; end if; end Abort_Handler; ----------------- -- Stack_Guard -- ----------------- procedure Stack_Guard (T : ST.Task_Id; On : Boolean) is pragma Unreferenced (T); pragma Unreferenced (On); begin -- Nothing needed (why not???) null; end Stack_Guard; ------------------- -- Get_Thread_Id -- ------------------- function Get_Thread_Id (T : ST.Task_Id) return OSI.Thread_Id is begin return T.Common.LL.Thread; end Get_Thread_Id; ---------- -- Self -- ---------- function Self return Task_Id renames Specific.Self; ----------------------------- -- Install_Signal_Handlers -- ----------------------------- procedure Install_Signal_Handlers is act : aliased struct_sigaction; old_act : aliased struct_sigaction; Tmp_Set : aliased sigset_t; Result : int; begin act.sa_flags := 0; act.sa_handler := Abort_Handler'Address; Result := sigemptyset (Tmp_Set'Access); pragma Assert (Result = 0); act.sa_mask := Tmp_Set; Result := sigaction (Signal (Interrupt_Management.Abort_Task_Signal), act'Unchecked_Access, old_act'Unchecked_Access); pragma Assert (Result = 0); Interrupt_Management.Initialize_Interrupts; end Install_Signal_Handlers; --------------------- -- Initialize_Lock -- --------------------- procedure Initialize_Lock (Prio : System.Any_Priority; L : access Lock) is begin L.Mutex := semMCreate (SEM_Q_PRIORITY + SEM_INVERSION_SAFE); L.Prio_Ceiling := int (Prio); L.Protocol := Mutex_Protocol; pragma Assert (L.Mutex /= 0); end Initialize_Lock; procedure Initialize_Lock (L : access RTS_Lock; Level : Lock_Level) is pragma Unreferenced (Level); begin L.Mutex := semMCreate (SEM_Q_PRIORITY + SEM_INVERSION_SAFE); L.Prio_Ceiling := int (System.Any_Priority'Last); L.Protocol := Mutex_Protocol; pragma Assert (L.Mutex /= 0); end Initialize_Lock; ------------------- -- Finalize_Lock -- ------------------- procedure Finalize_Lock (L : access Lock) is Result : int; begin Result := semDelete (L.Mutex); pragma Assert (Result = 0); end Finalize_Lock; procedure Finalize_Lock (L : access RTS_Lock) is Result : int; begin Result := semDelete (L.Mutex); pragma Assert (Result = 0); end Finalize_Lock; ---------------- -- Write_Lock -- ---------------- procedure Write_Lock (L : access Lock; Ceiling_Violation : out Boolean) is Result : int; begin if L.Protocol = Prio_Protect and then int (Self.Common.Current_Priority) > L.Prio_Ceiling then Ceiling_Violation := True; return; else Ceiling_Violation := False; end if; Result := semTake (L.Mutex, WAIT_FOREVER); pragma Assert (Result = 0); end Write_Lock; procedure Write_Lock (L : access RTS_Lock; Global_Lock : Boolean := False) is Result : int; begin if not Single_Lock or else Global_Lock then Result := semTake (L.Mutex, WAIT_FOREVER); pragma Assert (Result = 0); end if; end Write_Lock; procedure Write_Lock (T : Task_Id) is Result : int; begin if not Single_Lock then Result := semTake (T.Common.LL.L.Mutex, WAIT_FOREVER); pragma Assert (Result = 0); end if; end Write_Lock; --------------- -- Read_Lock -- --------------- procedure Read_Lock (L : access Lock; Ceiling_Violation : out Boolean) is begin Write_Lock (L, Ceiling_Violation); end Read_Lock; ------------ -- Unlock -- ------------ procedure Unlock (L : access Lock) is Result : int; begin Result := semGive (L.Mutex); pragma Assert (Result = 0); end Unlock; procedure Unlock (L : access RTS_Lock; Global_Lock : Boolean := False) is Result : int; begin if not Single_Lock or else Global_Lock then Result := semGive (L.Mutex); pragma Assert (Result = 0); end if; end Unlock; procedure Unlock (T : Task_Id) is Result : int; begin if not Single_Lock then Result := semGive (T.Common.LL.L.Mutex); pragma Assert (Result = 0); end if; end Unlock; ----------- -- Sleep -- ----------- procedure Sleep (Self_ID : Task_Id; Reason : System.Tasking.Task_States) is pragma Unreferenced (Reason); Result : int; begin pragma Assert (Self_ID = Self); -- Release the mutex before sleeping if Single_Lock then Result := semGive (Single_RTS_Lock.Mutex); else Result := semGive (Self_ID.Common.LL.L.Mutex); end if; pragma Assert (Result = 0); -- Perform a blocking operation to take the CV semaphore. Note that a -- blocking operation in VxWorks will reenable task scheduling. When we -- are no longer blocked and control is returned, task scheduling will -- again be disabled. Result := semTake (Self_ID.Common.LL.CV, WAIT_FOREVER); pragma Assert (Result = 0); -- Take the mutex back if Single_Lock then Result := semTake (Single_RTS_Lock.Mutex, WAIT_FOREVER); else Result := semTake (Self_ID.Common.LL.L.Mutex, WAIT_FOREVER); end if; pragma Assert (Result = 0); end Sleep; ----------------- -- Timed_Sleep -- ----------------- -- This is for use within the run-time system, so abort is assumed to be -- already deferred, and the caller should be holding its own ATCB lock. procedure Timed_Sleep (Self_ID : Task_Id; Time : Duration; Mode : ST.Delay_Modes; Reason : System.Tasking.Task_States; Timedout : out Boolean; Yielded : out Boolean) is pragma Unreferenced (Reason); Orig : constant Duration := Monotonic_Clock; Absolute : Duration; Ticks : int; Result : int; Wakeup : Boolean := False; begin Timedout := False; Yielded := True; if Mode = Relative then Absolute := Orig + Time; -- Systematically add one since the first tick will delay *at most* -- 1 / Rate_Duration seconds, so we need to add one to be on the -- safe side. Ticks := To_Clock_Ticks (Time); if Ticks > 0 and then Ticks < int'Last then Ticks := Ticks + 1; end if; else Absolute := Time; Ticks := To_Clock_Ticks (Time - Monotonic_Clock); end if; if Ticks > 0 then loop -- Release the mutex before sleeping if Single_Lock then Result := semGive (Single_RTS_Lock.Mutex); else Result := semGive (Self_ID.Common.LL.L.Mutex); end if; pragma Assert (Result = 0); -- Perform a blocking operation to take the CV semaphore. Note -- that a blocking operation in VxWorks will reenable task -- scheduling. When we are no longer blocked and control is -- returned, task scheduling will again be disabled. Result := semTake (Self_ID.Common.LL.CV, Ticks); if Result = 0 then -- Somebody may have called Wakeup for us Wakeup := True; else if errno /= S_objLib_OBJ_TIMEOUT then Wakeup := True; else -- If Ticks = int'last, it was most probably truncated so -- let's make another round after recomputing Ticks from -- the the absolute time. if Ticks /= int'Last then Timedout := True; else Ticks := To_Clock_Ticks (Absolute - Monotonic_Clock); if Ticks < 0 then Timedout := True; end if; end if; end if; end if; -- Take the mutex back if Single_Lock then Result := semTake (Single_RTS_Lock.Mutex, WAIT_FOREVER); else Result := semTake (Self_ID.Common.LL.L.Mutex, WAIT_FOREVER); end if; pragma Assert (Result = 0); exit when Timedout or Wakeup; end loop; else Timedout := True; -- Should never hold a lock while yielding if Single_Lock then Result := semGive (Single_RTS_Lock.Mutex); taskDelay (0); Result := semTake (Single_RTS_Lock.Mutex, WAIT_FOREVER); else Result := semGive (Self_ID.Common.LL.L.Mutex); taskDelay (0); Result := semTake (Self_ID.Common.LL.L.Mutex, WAIT_FOREVER); end if; end if; end Timed_Sleep; ----------------- -- Timed_Delay -- ----------------- -- This is for use in implementing delay statements, so we assume the -- caller is holding no locks. procedure Timed_Delay (Self_ID : Task_Id; Time : Duration; Mode : ST.Delay_Modes) is Orig : constant Duration := Monotonic_Clock; Absolute : Duration; Ticks : int; Timedout : Boolean; Result : int; Aborted : Boolean := False; begin if Mode = Relative then Absolute := Orig + Time; Ticks := To_Clock_Ticks (Time); if Ticks > 0 and then Ticks < int'Last then -- First tick will delay anytime between 0 and 1 / sysClkRateGet -- seconds, so we need to add one to be on the safe side. Ticks := Ticks + 1; end if; else Absolute := Time; Ticks := To_Clock_Ticks (Time - Orig); end if; if Ticks > 0 then -- Modifying State and Pending_Priority_Change, locking the TCB if Single_Lock then Result := semTake (Single_RTS_Lock.Mutex, WAIT_FOREVER); else Result := semTake (Self_ID.Common.LL.L.Mutex, WAIT_FOREVER); end if; pragma Assert (Result = 0); Self_ID.Common.State := Delay_Sleep; Timedout := False; loop if Self_ID.Pending_Priority_Change then Self_ID.Pending_Priority_Change := False; Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority; Set_Priority (Self_ID, Self_ID.Common.Base_Priority); end if; Aborted := Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level; -- Release the TCB before sleeping if Single_Lock then Result := semGive (Single_RTS_Lock.Mutex); else Result := semGive (Self_ID.Common.LL.L.Mutex); end if; pragma Assert (Result = 0); exit when Aborted; Result := semTake (Self_ID.Common.LL.CV, Ticks); if Result /= 0 then -- If Ticks = int'last, it was most probably truncated -- so let's make another round after recomputing Ticks -- from the the absolute time. if errno = S_objLib_OBJ_TIMEOUT and then Ticks /= int'Last then Timedout := True; else Ticks := To_Clock_Ticks (Absolute - Monotonic_Clock); if Ticks < 0 then Timedout := True; end if; end if; end if; -- Take back the lock after having slept, to protect further -- access to Self_ID. if Single_Lock then Result := semTake (Single_RTS_Lock.Mutex, WAIT_FOREVER); else Result := semTake (Self_ID.Common.LL.L.Mutex, WAIT_FOREVER); end if; pragma Assert (Result = 0); exit when Timedout; end loop; Self_ID.Common.State := Runnable; if Single_Lock then Result := semGive (Single_RTS_Lock.Mutex); else Result := semGive (Self_ID.Common.LL.L.Mutex); end if; else taskDelay (0); end if; end Timed_Delay; --------------------- -- Monotonic_Clock -- --------------------- function Monotonic_Clock return Duration is TS : aliased timespec; Result : int; begin Result := clock_gettime (CLOCK_REALTIME, TS'Unchecked_Access); pragma Assert (Result = 0); return To_Duration (TS); end Monotonic_Clock; ------------------- -- RT_Resolution -- ------------------- function RT_Resolution return Duration is begin return 1.0 / Duration (sysClkRateGet); end RT_Resolution; ------------ -- Wakeup -- ------------ procedure Wakeup (T : Task_Id; Reason : System.Tasking.Task_States) is pragma Unreferenced (Reason); Result : int; begin Result := semGive (T.Common.LL.CV); pragma Assert (Result = 0); end Wakeup; ----------- -- Yield -- ----------- procedure Yield (Do_Yield : Boolean := True) is pragma Unreferenced (Do_Yield); Result : int; pragma Unreferenced (Result); begin Result := taskDelay (0); end Yield; ------------------ -- Set_Priority -- ------------------ type Prio_Array_Type is array (System.Any_Priority) of Integer; pragma Atomic_Components (Prio_Array_Type); Prio_Array : Prio_Array_Type; -- Global array containing the id of the currently running task for -- each priority. Note that we assume that we are on a single processor -- with run-till-blocked scheduling. procedure Set_Priority (T : Task_Id; Prio : System.Any_Priority; Loss_Of_Inheritance : Boolean := False) is Array_Item : Integer; Result : int; begin Result := taskPrioritySet (T.Common.LL.Thread, To_VxWorks_Priority (int (Prio))); pragma Assert (Result = 0); if Dispatching_Policy = 'F' then -- Annex D requirement [RM D.2.2 par. 9]: -- If the task drops its priority due to the loss of inherited -- priority, it is added at the head of the ready queue for its -- new active priority. if Loss_Of_Inheritance and then Prio < T.Common.Current_Priority then Array_Item := Prio_Array (T.Common.Base_Priority) + 1; Prio_Array (T.Common.Base_Priority) := Array_Item; loop -- Give some processes a chance to arrive taskDelay (0); -- Then wait for our turn to proceed exit when Array_Item = Prio_Array (T.Common.Base_Priority) or else Prio_Array (T.Common.Base_Priority) = 1; end loop; Prio_Array (T.Common.Base_Priority) := Prio_Array (T.Common.Base_Priority) - 1; end if; end if; T.Common.Current_Priority := Prio; end Set_Priority; ------------------ -- Get_Priority -- ------------------ function Get_Priority (T : Task_Id) return System.Any_Priority is begin return T.Common.Current_Priority; end Get_Priority; ---------------- -- Enter_Task -- ---------------- procedure Enter_Task (Self_ID : Task_Id) is procedure Init_Float; pragma Import (C, Init_Float, "__gnat_init_float"); -- Properly initializes the FPU for PPC/MIPS systems begin Self_ID.Common.LL.Thread := taskIdSelf; Specific.Set (Self_ID); Init_Float; -- Install the signal handlers -- This is called for each task since there is no signal inheritance -- between VxWorks tasks. Install_Signal_Handlers; Lock_RTS; for J in Known_Tasks'Range loop if Known_Tasks (J) = null then Known_Tasks (J) := Self_ID; Self_ID.Known_Tasks_Index := J; exit; end if; end loop; Unlock_RTS; end Enter_Task; -------------- -- New_ATCB -- -------------- function New_ATCB (Entry_Num : Task_Entry_Index) return Task_Id is begin return new Ada_Task_Control_Block (Entry_Num); end New_ATCB; ------------------- -- Is_Valid_Task -- ------------------- function Is_Valid_Task return Boolean renames Specific.Is_Valid_Task; ----------------------------- -- Register_Foreign_Thread -- ----------------------------- function Register_Foreign_Thread return Task_Id is begin if Is_Valid_Task then return Self; else return Register_Foreign_Thread (taskIdSelf); end if; end Register_Foreign_Thread; -------------------- -- Initialize_TCB -- -------------------- procedure Initialize_TCB (Self_ID : Task_Id; Succeeded : out Boolean) is begin Self_ID.Common.LL.CV := semBCreate (SEM_Q_PRIORITY, SEM_EMPTY); Self_ID.Common.LL.Thread := 0; if Self_ID.Common.LL.CV = 0 then Succeeded := False; else Succeeded := True; if not Single_Lock then Initialize_Lock (Self_ID.Common.LL.L'Access, ATCB_Level); end if; end if; end Initialize_TCB; ----------------- -- Create_Task -- ----------------- procedure Create_Task (T : Task_Id; Wrapper : System.Address; Stack_Size : System.Parameters.Size_Type; Priority : System.Any_Priority; Succeeded : out Boolean) is Adjusted_Stack_Size : size_t; begin -- Ask for four extra bytes of stack space so that the ATCB pointer can -- be stored below the stack limit, plus extra space for the frame of -- Task_Wrapper. This is so the user gets the amount of stack requested -- exclusive of the needs. -- We also have to allocate n more bytes for the task name storage and -- enough space for the Wind Task Control Block which is around 0x778 -- bytes. VxWorks also seems to carve out additional space, so use 2048 -- as a nice round number. We might want to increment to the nearest -- page size in case we ever support VxVMI. -- ??? - we should come back and visit this so we can set the task name -- to something appropriate. Adjusted_Stack_Size := size_t (Stack_Size) + 2048; -- Since the initial signal mask of a thread is inherited from the -- creator, and the Environment task has all its signals masked, we do -- not need to manipulate caller's signal mask at this point. All tasks -- in RTS will have All_Tasks_Mask initially. if T.Common.Task_Image_Len = 0 then T.Common.LL.Thread := taskSpawn (System.Null_Address, To_VxWorks_Priority (int (Priority)), VX_FP_TASK, Adjusted_Stack_Size, Wrapper, To_Address (T)); else declare Name : aliased String (1 .. T.Common.Task_Image_Len + 1); begin Name (1 .. Name'Last - 1) := T.Common.Task_Image (1 .. T.Common.Task_Image_Len); Name (Name'Last) := ASCII.NUL; T.Common.LL.Thread := taskSpawn (Name'Address, To_VxWorks_Priority (int (Priority)), VX_FP_TASK, Adjusted_Stack_Size, Wrapper, To_Address (T)); end; end if; if T.Common.LL.Thread = -1 then Succeeded := False; else Succeeded := True; end if; Task_Creation_Hook (T.Common.LL.Thread); Set_Priority (T, Priority); end Create_Task; ------------------ -- Finalize_TCB -- ------------------ procedure Finalize_TCB (T : Task_Id) is Result : int; Tmp : Task_Id := T; Is_Self : constant Boolean := (T = Self); procedure Free is new Unchecked_Deallocation (Ada_Task_Control_Block, Task_Id); begin if not Single_Lock then Result := semDelete (T.Common.LL.L.Mutex); pragma Assert (Result = 0); end if; T.Common.LL.Thread := 0; Result := semDelete (T.Common.LL.CV); pragma Assert (Result = 0); if T.Known_Tasks_Index /= -1 then Known_Tasks (T.Known_Tasks_Index) := null; end if; Free (Tmp); if Is_Self then Specific.Delete; end if; end Finalize_TCB; --------------- -- Exit_Task -- --------------- procedure Exit_Task is begin Specific.Set (null); end Exit_Task; ---------------- -- Abort_Task -- ---------------- procedure Abort_Task (T : Task_Id) is Result : int; begin Result := kill (T.Common.LL.Thread, Signal (Interrupt_Management.Abort_Task_Signal)); pragma Assert (Result = 0); end Abort_Task; ---------------- -- Initialize -- ---------------- procedure Initialize (S : in out Suspension_Object) is begin -- Initialize internal state. It is always initialized to False (ARM -- D.10 par. 6). S.State := False; S.Waiting := False; -- Initialize internal mutex -- Use simpler binary semaphore instead of VxWorks -- mutual exclusion semaphore, because we don't need -- the fancier semantics and their overhead. S.L := semBCreate (SEM_Q_FIFO, SEM_FULL); -- Initialize internal condition variable S.CV := semBCreate (SEM_Q_FIFO, SEM_EMPTY); end Initialize; -------------- -- Finalize -- -------------- procedure Finalize (S : in out Suspension_Object) is Result : STATUS; begin -- Destroy internal mutex Result := semDelete (S.L); pragma Assert (Result = OK); -- Destroy internal condition variable Result := semDelete (S.CV); pragma Assert (Result = OK); end Finalize; ------------------- -- Current_State -- ------------------- function Current_State (S : Suspension_Object) return Boolean is begin -- We do not want to use lock on this read operation. State is marked -- as Atomic so that we ensure that the value retrieved is correct. return S.State; end Current_State; --------------- -- Set_False -- --------------- procedure Set_False (S : in out Suspension_Object) is Result : STATUS; begin SSL.Abort_Defer.all; Result := semTake (S.L, WAIT_FOREVER); pragma Assert (Result = OK); S.State := False; Result := semGive (S.L); pragma Assert (Result = OK); SSL.Abort_Undefer.all; end Set_False; -------------- -- Set_True -- -------------- procedure Set_True (S : in out Suspension_Object) is Result : STATUS; begin SSL.Abort_Defer.all; Result := semTake (S.L, WAIT_FOREVER); pragma Assert (Result = OK); -- If there is already a task waiting on this suspension object then -- we resume it, leaving the state of the suspension object to False, -- as it is specified in ARM D.10 par. 9. Otherwise, it just leaves -- the state to True. if S.Waiting then S.Waiting := False; S.State := False; Result := semGive (S.CV); pragma Assert (Result = OK); else S.State := True; end if; Result := semGive (S.L); pragma Assert (Result = OK); SSL.Abort_Undefer.all; end Set_True; ------------------------ -- Suspend_Until_True -- ------------------------ procedure Suspend_Until_True (S : in out Suspension_Object) is Result : STATUS; begin SSL.Abort_Defer.all; Result := semTake (S.L, WAIT_FOREVER); if S.Waiting then -- Program_Error must be raised upon calling Suspend_Until_True -- if another task is already waiting on that suspension object -- (ARM D.10 par. 10). Result := semGive (S.L); pragma Assert (Result = OK); SSL.Abort_Undefer.all; raise Program_Error; else -- Suspend the task if the state is False. Otherwise, the task -- continues its execution, and the state of the suspension object -- is set to False (ARM D.10 par. 9). if S.State then S.State := False; Result := semGive (S.L); pragma Assert (Result = 0); SSL.Abort_Undefer.all; else S.Waiting := True; -- Release the mutex before sleeping Result := semGive (S.L); pragma Assert (Result = OK); SSL.Abort_Undefer.all; Result := semTake (S.CV, WAIT_FOREVER); pragma Assert (Result = 0); end if; end if; end Suspend_Until_True; ---------------- -- Check_Exit -- ---------------- -- Dummy version function Check_Exit (Self_ID : ST.Task_Id) return Boolean is pragma Unreferenced (Self_ID); begin return True; end Check_Exit; -------------------- -- Check_No_Locks -- -------------------- function Check_No_Locks (Self_ID : ST.Task_Id) return Boolean is pragma Unreferenced (Self_ID); begin return True; end Check_No_Locks; ---------------------- -- Environment_Task -- ---------------------- function Environment_Task return Task_Id is begin return Environment_Task_Id; end Environment_Task; -------------- -- Lock_RTS -- -------------- procedure Lock_RTS is begin Write_Lock (Single_RTS_Lock'Access, Global_Lock => True); end Lock_RTS; ---------------- -- Unlock_RTS -- ---------------- procedure Unlock_RTS is begin Unlock (Single_RTS_Lock'Access, Global_Lock => True); end Unlock_RTS; ------------------ -- Suspend_Task -- ------------------ function Suspend_Task (T : ST.Task_Id; Thread_Self : Thread_Id) return Boolean is begin if T.Common.LL.Thread /= 0 and then T.Common.LL.Thread /= Thread_Self then return taskSuspend (T.Common.LL.Thread) = 0; else return True; end if; end Suspend_Task; ----------------- -- Resume_Task -- ----------------- function Resume_Task (T : ST.Task_Id; Thread_Self : Thread_Id) return Boolean is begin if T.Common.LL.Thread /= 0 and then T.Common.LL.Thread /= Thread_Self then return taskResume (T.Common.LL.Thread) = 0; else return True; end if; end Resume_Task; ---------------- -- Initialize -- ---------------- procedure Initialize (Environment_Task : Task_Id) is Result : int; begin Environment_Task_Id := Environment_Task; Interrupt_Management.Initialize; Specific.Initialize; if Locking_Policy = 'C' then Mutex_Protocol := Prio_Protect; elsif Locking_Policy = 'I' then Mutex_Protocol := Prio_Inherit; else Mutex_Protocol := Prio_None; end if; if Time_Slice_Val > 0 then Result := Set_Time_Slice (To_Clock_Ticks (Duration (Time_Slice_Val) / Duration (1_000_000.0))); end if; Result := sigemptyset (Unblocked_Signal_Mask'Access); pragma Assert (Result = 0); for J in Interrupt_Management.Signal_ID loop if System.Interrupt_Management.Keep_Unmasked (J) then Result := sigaddset (Unblocked_Signal_Mask'Access, Signal (J)); pragma Assert (Result = 0); end if; end loop; -- Initialize the lock used to synchronize chain of all ATCBs Initialize_Lock (Single_RTS_Lock'Access, RTS_Lock_Level); Enter_Task (Environment_Task); end Initialize; end System.Task_Primitives.Operations;
-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" with Ada.Command_Line; with Ada.Containers.Indefinite_Vectors; with Ada.Directories; use Ada.Directories; with Ada.Exceptions; use Ada.Exceptions; with Ada.Text_IO; with Specs; procedure Generate is Proc : Specs.Processor; package Spec_Vectors is new Ada.Containers.Indefinite_Vectors (Positive, String); Spec_Paths : Spec_Vectors.Vector; package Path_Sorting is new Spec_Vectors.Generic_Sorting; Source_Folder : constant String := "src/specs"; Target_Folder : constant String := "src/generated"; Interface_Folder : constant String := "src/interface"; procedure Process_File (Directory_Entry : in Directory_Entry_Type) is Path : constant String := Full_Name (Directory_Entry); begin Ada.Text_IO.Put_Line ("Processing " & Path & " ..."); Spec_Paths.Append (Path); Ada.Text_IO.Put_Line ("Done processing " & Path & " ."); end Process_File; begin Search (Source_Folder, "*.spec", (Ordinary_File => True, others => False), Process_File'Access); Path_Sorting.Sort (Spec_Paths); for Path of Spec_Paths loop Specs.Parse_File (Proc, Path); end loop; Create_Path (Target_Folder); declare use type Specs.Spec; Cur : Specs.Spec := Specs.First (Proc); begin while Cur /= Specs.No_Spec loop Specs.Write_API (Proc, Cur, Target_Folder); Cur := Specs.Next (Proc, Cur); end loop; end; Specs.Write_Init (Proc, Target_Folder); Specs.Write_Wrapper_Table (Proc, Target_Folder, Interface_Folder); exception when Error : Specs.Parsing_Error => Ada.Text_IO.Put_Line (Exception_Message (Error)); Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure); end Generate;
-- C37405A.ADA -- Grant of Unlimited Rights -- -- 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 -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- 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 -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT WHEN ASSIGNING TO A CONSTRAINED OR UNCONSTRAINED -- OBJECT OR FORMAL PARAMETER OF A TYPE DECLARED WITH DEFAULT -- DISCRIMINANTS, THE ASSIGNMENT DOES NOT CHANGE THE 'CONSTRAINED -- ATTRIBUTE VALUE ASSOCIATED WITH THE OBJECT OR PARAMETER. -- ASL 7/21/81 -- TBN 1/20/86 RENAMED FROM C37209A.ADA AND REVISED THE ASSIGNMENTS -- OF CONSTRAINED AND UNCONSTRAINED OBJECTS TO ARRAY AND -- RECORD COMPONENTS. WITH REPORT; USE REPORT; PROCEDURE C37405A IS TYPE REC(DISC : INTEGER := 25) IS RECORD COMP : INTEGER; END RECORD; SUBTYPE CONSTR IS REC(10); SUBTYPE UNCONSTR IS REC; TYPE REC_C IS RECORD COMP: CONSTR; END RECORD; TYPE REC_U IS RECORD COMP: UNCONSTR; END RECORD; C1,C2 : CONSTR; U1,U2 : UNCONSTR; -- C2 AND U2 ARE NOT PASSED TO EITHER PROC1 OR PROC2. ARR_C : ARRAY (1..5) OF CONSTR; ARR_U : ARRAY (1..5) OF UNCONSTR; REC_COMP_C : REC_C; REC_COMP_U : REC_U; PROCEDURE PROC11(PARM : IN OUT UNCONSTR; B : IN BOOLEAN) IS BEGIN PARM := C2; IF IDENT_BOOL(B) /= PARM'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY " & "ASSIGNMENT - 1"); END IF; END PROC11; PROCEDURE PROC12(PARM : IN OUT UNCONSTR; B : IN BOOLEAN) IS BEGIN PARM := U2; IF B /= PARM'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY " & "ASSIGNMENT - 2"); END IF; END PROC12; PROCEDURE PROC1(PARM : IN OUT UNCONSTR; B : IN BOOLEAN) IS BEGIN IF B /= PARM'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY " & "PASSING PARAMETER"); END IF; PROC11(PARM, B); PROC12(PARM, B); END PROC1; PROCEDURE PROC2(PARM : IN OUT CONSTR) IS BEGIN COMMENT ("CALLING PROC1 FROM PROC2"); -- IN CASE TEST FAILS. PROC1(PARM,TRUE); PARM := U2; IF NOT PARM'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY " & "ASSIGNMENT - 3"); END IF; END PROC2; BEGIN TEST("C37405A", "'CONSTRAINED ATTRIBUTE OF OBJECTS, FORMAL " & "PARAMETERS CANNOT BE CHANGED BY ASSIGNMENT"); C2 := (DISC => IDENT_INT(10), COMP => 3); U2 := (DISC => IDENT_INT(10), COMP => 4); ARR_C := (1..5 => U2); ARR_U := (1..5 => C2); REC_COMP_C := (COMP => U2); REC_COMP_U := (COMP => C2); C1 := U2; U1 := C2; IF U1'CONSTRAINED OR NOT C1'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY ASSIGNMENT - 4"); END IF; IF ARR_U(3)'CONSTRAINED OR NOT ARR_C(4)'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY ASSIGNMENT - 5"); END IF; IF REC_COMP_U.COMP'CONSTRAINED OR NOT REC_COMP_C.COMP'CONSTRAINED THEN FAILED ("'CONSTRAINED ATTRIBUTE CHANGED BY ASSIGNMENT - 6"); END IF; COMMENT("CALLING PROC1 DIRECTLY"); PROC1(C1,TRUE); PROC2(C1); COMMENT("CALLING PROC1 DIRECTLY"); PROC1(U1,FALSE); PROC2(U1); COMMENT("CALLING PROC1 DIRECTLY"); PROC1(ARR_C(4), TRUE); PROC2(ARR_C(5)); COMMENT("CALLING PROC1 DIRECTLY"); PROC1(ARR_U(2), FALSE); PROC2(ARR_U(3)); COMMENT("CALLING PROC1 DIRECTLY"); PROC1(REC_COMP_C.COMP, TRUE); PROC2(REC_COMP_C.COMP); COMMENT("CALLING PROC1 DIRECTLY"); PROC1(REC_COMP_U.COMP, FALSE); PROC2(REC_COMP_U.COMP); RESULT; END C37405A;
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>call_Loop_LB2D_shift_1</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>slice_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>in_stream.V.value.V</originalName> <rtlName></rtlName> <coreName>FIFO_SRL</coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>out_stream_V_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_stream.V.value.V</originalName> <rtlName></rtlName> <coreName>FIFO_SRL</coreName> </Obj> <bitwidth>128</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>26</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_3"> <Value> <Obj> <type>0</type> <id>3</id> <name>buffer_0_value_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>buffer[0].value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>52</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>8</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>53</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>10</id> <name>n1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>n1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>54</item> <item>55</item> <item>57</item> <item>58</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>11</id> <name>tmp_6</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>216</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>59</item> <item>61</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>13</id> <name>n1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>216</second> </item> </second> </item> </inlineStackInfo> <originalName>n1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>62</item> <item>64</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>14</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>216</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>65</item> <item>66</item> <item>67</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>18</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>32</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>81</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>20</id> <name>i_0_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>69</item> <item>70</item> <item>71</item> <item>72</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>21</id> <name>tmp_8</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>32</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>73</item> <item>75</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>23</id> <name>i</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>32</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>76</item> <item>77</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>24</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>32</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>78</item> <item>79</item> <item>80</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>29</id> <name>tmp_value_V_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>40</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>40</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>86</item> <item>87</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>30</id> <name>tmp_9</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>42</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>42</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>88</item> <item>89</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>31</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>42</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>42</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>90</item> <item>91</item> <item>92</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>33</id> <name>buffer_0_value_V_lo</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>93</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>94</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>35</id> <name>tmp_2</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>95</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>36</id> <name>p_Result_11_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>97</item> <item>98</item> <item>100</item> <item>102</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>37</id> <name>p_Result_11_1_1</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>103</item> <item>104</item> <item>105</item> <item>106</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_value_V</name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>50</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>50</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.value.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>108</item> <item>109</item> <item>110</item> <item>111</item> <item>112</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>39</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>52</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>114</item> <item>115</item> <item>116</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>40</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>53</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>53</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>117</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>43</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>40</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>40</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>82</item> <item>83</item> <item>231</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>44</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>32</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>32</second> </item> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>linebuffer_1D&amp;lt;1918, 2, 1, 1, 1, 2, int&amp;gt;</second> </first> <second>143</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>84</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>47</id> <name></name> <fileName>../../../lib_files/Linebuffer.h</fileName> <fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</fileDirectory> <lineNumber>216</lineNumber> <contextFuncName>call</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>../../../lib_files/Linebuffer.h</first> <second>call</second> </first> <second>216</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>68</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>49</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_29"> <Value> <Obj> <type>2</type> <id>51</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_30"> <Value> <Obj> <type>2</type> <id>56</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_31"> <Value> <Obj> <type>2</type> <id>60</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1077</content> </item> <item class_id_reference="16" object_id="_32"> <Value> <Obj> <type>2</type> <id>63</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_33"> <Value> <Obj> <type>2</type> <id>74</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <const_type>0</const_type> <content>1918</content> </item> <item class_id_reference="16" object_id="_34"> <Value> <Obj> <type>2</type> <id>99</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>32</content> </item> <item class_id_reference="16" object_id="_35"> <Value> <Obj> <type>2</type> <id>101</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_36"> <Obj> <type>3</type> <id>9</id> <name>newFuncRoot</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>3</item> <item>8</item> </node_objs> </item> <item class_id_reference="18" object_id="_37"> <Obj> <type>3</type> <id>15</id> <name>.preheader</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>10</item> <item>11</item> <item>13</item> <item>14</item> </node_objs> </item> <item class_id_reference="18" object_id="_38"> <Obj> <type>3</type> <id>19</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>18</item> </node_objs> </item> <item class_id_reference="18" object_id="_39"> <Obj> <type>3</type> <id>25</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>20</item> <item>21</item> <item>23</item> <item>24</item> </node_objs> </item> <item class_id_reference="18" object_id="_40"> <Obj> <type>3</type> <id>32</id> <name>.critedge.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>29</item> <item>30</item> <item>31</item> </node_objs> </item> <item class_id_reference="18" object_id="_41"> <Obj> <type>3</type> <id>41</id> <name>.preheader.i.i.preheader.0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>8</count> <item_version>0</item_version> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> </node_objs> </item> <item class_id_reference="18" object_id="_42"> <Obj> <type>3</type> <id>45</id> <name>._crit_edge.i.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>43</item> <item>44</item> </node_objs> </item> <item class_id_reference="18" object_id="_43"> <Obj> <type>3</type> <id>48</id> <name>linebuffer_1D&lt;1918ul, 2ul, 1ul, 1ul, 1ul, 2ul, int&gt;.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>47</item> </node_objs> </item> <item class_id_reference="18" object_id="_44"> <Obj> <type>3</type> <id>50</id> <name>.exitStub</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>49</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>63</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_45"> <id>52</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>3</sink_obj> </item> <item class_id_reference="20" object_id="_46"> <id>53</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>8</sink_obj> </item> <item class_id_reference="20" object_id="_47"> <id>54</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_48"> <id>55</id> <edge_type>2</edge_type> <source_obj>48</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_49"> <id>57</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_50"> <id>58</id> <edge_type>2</edge_type> <source_obj>9</source_obj> <sink_obj>10</sink_obj> </item> <item class_id_reference="20" object_id="_51"> <id>59</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_52"> <id>61</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>11</sink_obj> </item> <item class_id_reference="20" object_id="_53"> <id>62</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_54"> <id>64</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>13</sink_obj> </item> <item class_id_reference="20" object_id="_55"> <id>65</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_56"> <id>66</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_57"> <id>67</id> <edge_type>2</edge_type> <source_obj>50</source_obj> <sink_obj>14</sink_obj> </item> <item class_id_reference="20" object_id="_58"> <id>68</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_59"> <id>69</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_60"> <id>70</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_61"> <id>71</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_62"> <id>72</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_63"> <id>73</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_64"> <id>75</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_65"> <id>76</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_66"> <id>77</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_67"> <id>78</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_68"> <id>79</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_69"> <id>80</id> <edge_type>2</edge_type> <source_obj>48</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_70"> <id>81</id> <edge_type>2</edge_type> <source_obj>25</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_71"> <id>82</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_72"> <id>83</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_73"> <id>84</id> <edge_type>2</edge_type> <source_obj>25</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_74"> <id>87</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_75"> <id>88</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_76"> <id>89</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_77"> <id>90</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_78"> <id>91</id> <edge_type>2</edge_type> <source_obj>41</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_79"> <id>92</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_80"> <id>93</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_81"> <id>94</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>34</sink_obj> </item> <item class_id_reference="20" object_id="_82"> <id>95</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>35</sink_obj> </item> <item class_id_reference="20" object_id="_83"> <id>98</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_84"> <id>100</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_85"> <id>102</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>36</sink_obj> </item> <item class_id_reference="20" object_id="_86"> <id>104</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_87"> <id>105</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_88"> <id>106</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_89"> <id>109</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_90"> <id>110</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_91"> <id>111</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_92"> <id>112</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_93"> <id>115</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_94"> <id>116</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_95"> <id>117</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_96"> <id>220</id> <edge_type>2</edge_type> <source_obj>9</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_97"> <id>221</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_98"> <id>222</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>19</sink_obj> </item> <item class_id_reference="20" object_id="_99"> <id>223</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_100"> <id>224</id> <edge_type>2</edge_type> <source_obj>25</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_101"> <id>225</id> <edge_type>2</edge_type> <source_obj>25</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_102"> <id>226</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_103"> <id>227</id> <edge_type>2</edge_type> <source_obj>32</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_104"> <id>228</id> <edge_type>2</edge_type> <source_obj>41</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_105"> <id>229</id> <edge_type>2</edge_type> <source_obj>45</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_106"> <id>230</id> <edge_type>2</edge_type> <source_obj>48</source_obj> <sink_obj>15</sink_obj> </item> <item class_id_reference="20" object_id="_107"> <id>231</id> <edge_type>4</edge_type> <source_obj>33</source_obj> <sink_obj>43</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_108"> <mId>1</mId> <mTag>call_Loop_LB2D_shift.1</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>7</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2068918</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_109"> <mId>2</mId> <mTag>Entry</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>9</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_110"> <mId>3</mId> <mTag>LB2D_shift</mTag> <mType>1</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>4</item> <item>5</item> <item>6</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>1077</mMinTripCount> <mMaxTripCount>1077</mMaxTripCount> <mMinLatency>2068917</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_111"> <mId>4</mId> <mTag>Region 1</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>15</item> <item>19</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_112"> <mId>5</mId> <mTag>LB1D_shiftreg</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>25</item> <item>32</item> <item>41</item> <item>45</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>1918</mMinTripCount> <mMaxTripCount>1918</mMaxTripCount> <mMinLatency>1918</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_113"> <mId>6</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>48</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_114"> <mId>7</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>50</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_115"> <states class_id="25" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_116"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_117"> <id>3</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_118"> <id>4</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_119"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_120"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_121"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_122"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_123"> <id>2</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_124"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_125"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_126"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_127"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_128"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_129"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_130"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_131"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_132"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_133"> <id>3</id> <operations> <count>7</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_134"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_135"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_136"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_137"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_138"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_139"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_140"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_141"> <id>4</id> <operations> <count>15</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_142"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_143"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_144"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_145"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_146"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_147"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_148"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_149"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_150"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_151"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_152"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_153"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_154"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_155"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_156"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_157"> <id>5</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_158"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_159"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>6</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_160"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>30</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_161"> <inState>2</inState> <outState>3</outState> <condition> <id>32</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>11</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_162"> <inState>5</inState> <outState>2</outState> <condition> <id>40</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_163"> <inState>4</inState> <outState>3</outState> <condition> <id>42</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_164"> <inState>3</inState> <outState>5</outState> <condition> <id>41</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>21</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_165"> <inState>3</inState> <outState>4</outState> <condition> <id>43</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>21</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="37" tracking_level="0" version="0"> <count>26</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>3</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>8</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>10</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>1</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>9</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>19</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>25</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>32</first> <second> <first>2</first> <second>3</second> </second> </item> <item> <first>41</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>45</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>48</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>50</first> <second> <first>1</first> <second>1</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="44" tracking_level="1" version="0" object_id="_166"> <region_name>LB1D_shiftreg</region_name> <basic_blocks> <count>4</count> <item_version>0</item_version> <item>25</item> <item>32</item> <item>41</item> <item>45</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>2</pipe_depth> </item> </regions> <dp_fu_nodes class_id="45" tracking_level="0" version="0"> <count>17</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>62</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>66</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>72</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>83</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>101</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>107</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>113</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>119</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>125</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>131</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>134</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>138</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>152</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>162</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>175</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="48" tracking_level="0" version="0"> <count>13</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>buffer_0_value_V_fu_62</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>i_0_i_i_phi_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>i_fu_119</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>n1_1_fu_107</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>n1_phi_fu_83</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>p_Result_11_1_1_fu_152</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>p_Result_11_1_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>36</item> </second> </item> <item> <first>tmp_2_fu_138</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>tmp_6_fu_101</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_8_fu_113</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>tmp_9_fu_125</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>tmp_fu_134</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>tmp_value_V_fu_162</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>4</count> <item_version>0</item_version> <item> <first>StgValue_38_write_fu_72</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>StgValue_41_store_fu_175</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>buffer_0_value_V_lo_load_fu_131</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>tmp_value_V_1_read_fu_66</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="50" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>8</count> <item_version>0</item_version> <item> <first>79</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>90</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>186</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>195</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>199</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>204</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>8</count> <item_version>0</item_version> <item> <first>buffer_0_value_V_reg_180</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>i_0_i_i_reg_90</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>i_reg_199</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>n1_1_reg_190</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>n1_reg_79</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>tmp_6_reg_186</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>tmp_8_reg_195</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>tmp_9_reg_204</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>2</count> <item_version>0</item_version> <item> <first>79</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>90</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>2</count> <item_version>0</item_version> <item> <first>i_0_i_i_reg_90</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>n1_reg_79</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="51" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>out_stream_V_value_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> </second> </item> <item> <first>slice_stream_V_value_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="53" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>1</first> <second>FIFO_SRL</second> </item> <item> <first>2</first> <second>FIFO_SRL</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P R J . E N V -- -- -- -- B o d y -- -- -- -- Copyright (C) 2001-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Fmap; with Makeutl; use Makeutl; with Opt; with Osint; use Osint; with Output; use Output; with Prj.Com; use Prj.Com; with Sdefault; with Tempdir; with Ada.Text_IO; use Ada.Text_IO; with GNAT.Directory_Operations; use GNAT.Directory_Operations; package body Prj.Env is Buffer_Initial : constant := 1_000; -- Initial arbitrary size of buffers Uninitialized_Prefix : constant String := '#' & Path_Separator; -- Prefix to indicate that the project path has not been initialized yet. -- Must be two characters long No_Project_Default_Dir : constant String := "-"; -- Indicator in the project path to indicate that the default search -- directories should not be added to the path ----------------------- -- Local Subprograms -- ----------------------- package Source_Path_Table is new GNAT.Dynamic_Tables (Table_Component_Type => Name_Id, Table_Index_Type => Natural, Table_Low_Bound => 1, Table_Initial => 50, Table_Increment => 100); -- A table to store the source dirs before creating the source path file package Object_Path_Table is new GNAT.Dynamic_Tables (Table_Component_Type => Path_Name_Type, Table_Index_Type => Natural, Table_Low_Bound => 1, Table_Initial => 50, Table_Increment => 100); -- A table to store the object dirs, before creating the object path file procedure Add_To_Buffer (S : String; Buffer : in out String_Access; Buffer_Last : in out Natural); -- Add a string to Buffer, extending Buffer if needed procedure Add_To_Path (Source_Dirs : String_List_Id; Shared : Shared_Project_Tree_Data_Access; Buffer : in out String_Access; Buffer_Last : in out Natural); -- Add to Ada_Path_Buffer all the source directories in string list -- Source_Dirs, if any. procedure Add_To_Path (Dir : String; Buffer : in out String_Access; Buffer_Last : in out Natural); -- If Dir is not already in the global variable Ada_Path_Buffer, add it. -- If Buffer_Last /= 0, prepend a Path_Separator character to Path. procedure Add_To_Source_Path (Source_Dirs : String_List_Id; Shared : Shared_Project_Tree_Data_Access; Source_Paths : in out Source_Path_Table.Instance); -- Add to Ada_Path_B all the source directories in string list -- Source_Dirs, if any. Increment Ada_Path_Length. procedure Add_To_Object_Path (Object_Dir : Path_Name_Type; Object_Paths : in out Object_Path_Table.Instance); -- Add Object_Dir to object path table. Make sure it is not duplicate -- and it is the last one in the current table. ---------------------- -- Ada_Include_Path -- ---------------------- function Ada_Include_Path (Project : Project_Id; In_Tree : Project_Tree_Ref; Recursive : Boolean := False) return String is Buffer : String_Access; Buffer_Last : Natural := 0; procedure Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean); -- Add source dirs of Project to the path --------- -- Add -- --------- procedure Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean) is begin Add_To_Path (Project.Source_Dirs, In_Tree.Shared, Buffer, Buffer_Last); end Add; procedure For_All_Projects is new For_Every_Project_Imported (Boolean, Add); Dummy : Boolean := False; -- Start of processing for Ada_Include_Path begin if Recursive then -- If it is the first time we call this function for this project, -- compute the source path. if Project.Ada_Include_Path = null then Buffer := new String (1 .. Buffer_Initial); For_All_Projects (Project, In_Tree, Dummy, Include_Aggregated => True); Project.Ada_Include_Path := new String'(Buffer (1 .. Buffer_Last)); Free (Buffer); end if; return Project.Ada_Include_Path.all; else Buffer := new String (1 .. Buffer_Initial); Add_To_Path (Project.Source_Dirs, In_Tree.Shared, Buffer, Buffer_Last); declare Result : constant String := Buffer (1 .. Buffer_Last); begin Free (Buffer); return Result; end; end if; end Ada_Include_Path; ---------------------- -- Ada_Objects_Path -- ---------------------- function Ada_Objects_Path (Project : Project_Id; In_Tree : Project_Tree_Ref; Including_Libraries : Boolean := True) return String_Access is Buffer : String_Access; Buffer_Last : Natural := 0; procedure Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean); -- Add all the object directories of a project to the path --------- -- Add -- --------- procedure Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean) is pragma Unreferenced (In_Tree); Path : constant Path_Name_Type := Get_Object_Directory (Project, Including_Libraries => Including_Libraries, Only_If_Ada => False); begin if Path /= No_Path then Add_To_Path (Get_Name_String (Path), Buffer, Buffer_Last); end if; end Add; procedure For_All_Projects is new For_Every_Project_Imported (Boolean, Add); Dummy : Boolean := False; Result : String_Access; -- Start of processing for Ada_Objects_Path begin -- If it is the first time we call this function for -- this project, compute the objects path if Including_Libraries and then Project.Ada_Objects_Path /= null then return Project.Ada_Objects_Path; elsif not Including_Libraries and then Project.Ada_Objects_Path_No_Libs /= null then return Project.Ada_Objects_Path_No_Libs; else Buffer := new String (1 .. Buffer_Initial); For_All_Projects (Project, In_Tree, Dummy); Result := new String'(Buffer (1 .. Buffer_Last)); Free (Buffer); if Including_Libraries then Project.Ada_Objects_Path := Result; else Project.Ada_Objects_Path_No_Libs := Result; end if; return Result; end if; end Ada_Objects_Path; ------------------- -- Add_To_Buffer -- ------------------- procedure Add_To_Buffer (S : String; Buffer : in out String_Access; Buffer_Last : in out Natural) is Last : constant Natural := Buffer_Last + S'Length; begin while Last > Buffer'Last loop declare New_Buffer : constant String_Access := new String (1 .. 2 * Buffer'Last); begin New_Buffer (1 .. Buffer_Last) := Buffer (1 .. Buffer_Last); Free (Buffer); Buffer := New_Buffer; end; end loop; Buffer (Buffer_Last + 1 .. Last) := S; Buffer_Last := Last; end Add_To_Buffer; ------------------------ -- Add_To_Object_Path -- ------------------------ procedure Add_To_Object_Path (Object_Dir : Path_Name_Type; Object_Paths : in out Object_Path_Table.Instance) is begin -- Check if the directory is already in the table for Index in Object_Path_Table.First .. Object_Path_Table.Last (Object_Paths) loop -- If it is, remove it, and add it as the last one if Object_Paths.Table (Index) = Object_Dir then for Index2 in Index + 1 .. Object_Path_Table.Last (Object_Paths) loop Object_Paths.Table (Index2 - 1) := Object_Paths.Table (Index2); end loop; Object_Paths.Table (Object_Path_Table.Last (Object_Paths)) := Object_Dir; return; end if; end loop; -- The directory is not already in the table, add it Object_Path_Table.Append (Object_Paths, Object_Dir); end Add_To_Object_Path; ----------------- -- Add_To_Path -- ----------------- procedure Add_To_Path (Source_Dirs : String_List_Id; Shared : Shared_Project_Tree_Data_Access; Buffer : in out String_Access; Buffer_Last : in out Natural) is Current : String_List_Id; Source_Dir : String_Element; begin Current := Source_Dirs; while Current /= Nil_String loop Source_Dir := Shared.String_Elements.Table (Current); Add_To_Path (Get_Name_String (Source_Dir.Display_Value), Buffer, Buffer_Last); Current := Source_Dir.Next; end loop; end Add_To_Path; procedure Add_To_Path (Dir : String; Buffer : in out String_Access; Buffer_Last : in out Natural) is Len : Natural; New_Buffer : String_Access; Min_Len : Natural; function Is_Present (Path : String; Dir : String) return Boolean; -- Return True if Dir is part of Path ---------------- -- Is_Present -- ---------------- function Is_Present (Path : String; Dir : String) return Boolean is Last : constant Integer := Path'Last - Dir'Length + 1; begin for J in Path'First .. Last loop -- Note: the order of the conditions below is important, since -- it ensures a minimal number of string comparisons. if (J = Path'First or else Path (J - 1) = Path_Separator) and then (J + Dir'Length > Path'Last or else Path (J + Dir'Length) = Path_Separator) and then Dir = Path (J .. J + Dir'Length - 1) then return True; end if; end loop; return False; end Is_Present; -- Start of processing for Add_To_Path begin if Is_Present (Buffer (1 .. Buffer_Last), Dir) then -- Dir is already in the path, nothing to do return; end if; Min_Len := Buffer_Last + Dir'Length; if Buffer_Last > 0 then -- Add 1 for the Path_Separator character Min_Len := Min_Len + 1; end if; -- If Ada_Path_Buffer is too small, increase it Len := Buffer'Last; if Len < Min_Len then loop Len := Len * 2; exit when Len >= Min_Len; end loop; New_Buffer := new String (1 .. Len); New_Buffer (1 .. Buffer_Last) := Buffer (1 .. Buffer_Last); Free (Buffer); Buffer := New_Buffer; end if; if Buffer_Last > 0 then Buffer_Last := Buffer_Last + 1; Buffer (Buffer_Last) := Path_Separator; end if; Buffer (Buffer_Last + 1 .. Buffer_Last + Dir'Length) := Dir; Buffer_Last := Buffer_Last + Dir'Length; end Add_To_Path; ------------------------ -- Add_To_Source_Path -- ------------------------ procedure Add_To_Source_Path (Source_Dirs : String_List_Id; Shared : Shared_Project_Tree_Data_Access; Source_Paths : in out Source_Path_Table.Instance) is Current : String_List_Id; Source_Dir : String_Element; Add_It : Boolean; begin -- Add each source directory Current := Source_Dirs; while Current /= Nil_String loop Source_Dir := Shared.String_Elements.Table (Current); Add_It := True; -- Check if the source directory is already in the table for Index in Source_Path_Table.First .. Source_Path_Table.Last (Source_Paths) loop -- If it is already, no need to add it if Source_Paths.Table (Index) = Source_Dir.Value then Add_It := False; exit; end if; end loop; if Add_It then Source_Path_Table.Append (Source_Paths, Source_Dir.Display_Value); end if; -- Next source directory Current := Source_Dir.Next; end loop; end Add_To_Source_Path; -------------------------------- -- Create_Config_Pragmas_File -- -------------------------------- procedure Create_Config_Pragmas_File (For_Project : Project_Id; In_Tree : Project_Tree_Ref) is type Naming_Id is new Nat; package Naming_Table is new GNAT.Dynamic_Tables (Table_Component_Type => Lang_Naming_Data, Table_Index_Type => Naming_Id, Table_Low_Bound => 1, Table_Initial => 5, Table_Increment => 100); Default_Naming : constant Naming_Id := Naming_Table.First; Namings : Naming_Table.Instance; -- Table storing the naming data for gnatmake/gprmake Buffer : String_Access := new String (1 .. Buffer_Initial); Buffer_Last : Natural := 0; File_Name : Path_Name_Type := No_Path; File : File_Descriptor := Invalid_FD; Current_Naming : Naming_Id; procedure Check (Project : Project_Id; In_Tree : Project_Tree_Ref; State : in out Integer); -- Recursive procedure that put in the config pragmas file any non -- standard naming schemes, if it is not already in the file, then call -- itself for any imported project. procedure Put (Source : Source_Id); -- Put an SFN pragma in the temporary file procedure Put (S : String); procedure Put_Line (S : String); -- Output procedures, analogous to normal Text_IO procs of same name. -- The text is put in Buffer, then it will be written into a temporary -- file with procedure Write_Temp_File below. procedure Write_Temp_File; -- Create a temporary file and put the content of the buffer in it ----------- -- Check -- ----------- procedure Check (Project : Project_Id; In_Tree : Project_Tree_Ref; State : in out Integer) is pragma Unreferenced (State); Lang : constant Language_Ptr := Get_Language_From_Name (Project, "ada"); Naming : Lang_Naming_Data; Iter : Source_Iterator; Source : Source_Id; begin if Current_Verbosity = High then Debug_Output ("Checking project file:", Project.Name); end if; if Lang = null then if Current_Verbosity = High then Debug_Output ("Languages does not contain Ada, nothing to do"); end if; return; end if; -- Visit all the files and process those that need an SFN pragma Iter := For_Each_Source (In_Tree, Project); while Element (Iter) /= No_Source loop Source := Element (Iter); if not Source.Locally_Removed and then Source.Unit /= null and then (Source.Index >= 1 or else Source.Naming_Exception /= No) then Put (Source); end if; Next (Iter); end loop; Naming := Lang.Config.Naming_Data; -- Is the naming scheme of this project one that we know? Current_Naming := Default_Naming; while Current_Naming <= Naming_Table.Last (Namings) and then Namings.Table (Current_Naming).Dot_Replacement = Naming.Dot_Replacement and then Namings.Table (Current_Naming).Casing = Naming.Casing and then Namings.Table (Current_Naming).Separate_Suffix = Naming.Separate_Suffix loop Current_Naming := Current_Naming + 1; end loop; -- If we don't know it, add it if Current_Naming > Naming_Table.Last (Namings) then Naming_Table.Increment_Last (Namings); Namings.Table (Naming_Table.Last (Namings)) := Naming; -- Put the SFN pragmas for the naming scheme -- Spec Put_Line ("pragma Source_File_Name_Project"); Put_Line (" (Spec_File_Name => ""*" & Get_Name_String (Naming.Spec_Suffix) & ""","); Put_Line (" Casing => " & Image (Naming.Casing) & ","); Put_Line (" Dot_Replacement => """ & Get_Name_String (Naming.Dot_Replacement) & """);"); -- and body Put_Line ("pragma Source_File_Name_Project"); Put_Line (" (Body_File_Name => ""*" & Get_Name_String (Naming.Body_Suffix) & ""","); Put_Line (" Casing => " & Image (Naming.Casing) & ","); Put_Line (" Dot_Replacement => """ & Get_Name_String (Naming.Dot_Replacement) & """);"); -- and maybe separate if Naming.Body_Suffix /= Naming.Separate_Suffix then Put_Line ("pragma Source_File_Name_Project"); Put_Line (" (Subunit_File_Name => ""*" & Get_Name_String (Naming.Separate_Suffix) & ""","); Put_Line (" Casing => " & Image (Naming.Casing) & ","); Put_Line (" Dot_Replacement => """ & Get_Name_String (Naming.Dot_Replacement) & """);"); end if; end if; end Check; --------- -- Put -- --------- procedure Put (Source : Source_Id) is begin -- Put the pragma SFN for the unit kind (spec or body) Put ("pragma Source_File_Name_Project ("); Put (Namet.Get_Name_String (Source.Unit.Name)); if Source.Kind = Spec then Put (", Spec_File_Name => """); else Put (", Body_File_Name => """); end if; Put (Namet.Get_Name_String (Source.File)); Put (""""); if Source.Index /= 0 then Put (", Index =>"); Put (Source.Index'Img); end if; Put_Line (");"); end Put; procedure Put (S : String) is begin Add_To_Buffer (S, Buffer, Buffer_Last); if Current_Verbosity = High then Write_Str (S); end if; end Put; -------------- -- Put_Line -- -------------- procedure Put_Line (S : String) is begin -- Add an ASCII.LF to the string. As this config file is supposed to -- be used only by the compiler, we don't care about the characters -- for the end of line. In fact we could have put a space, but -- it is more convenient to be able to read gnat.adc during -- development, for which the ASCII.LF is fine. Put (S); Put (S => (1 => ASCII.LF)); end Put_Line; --------------------- -- Write_Temp_File -- --------------------- procedure Write_Temp_File is Status : Boolean := False; Last : Natural; begin Tempdir.Create_Temp_File (File, File_Name); if File /= Invalid_FD then Last := Write (File, Buffer (1)'Address, Buffer_Last); if Last = Buffer_Last then Close (File, Status); end if; end if; if not Status then Prj.Com.Fail ("unable to create temporary file"); end if; end Write_Temp_File; procedure Check_Imported_Projects is new For_Every_Project_Imported (Integer, Check); Dummy : Integer := 0; -- Start of processing for Create_Config_Pragmas_File begin if not For_Project.Config_Checked then Naming_Table.Init (Namings); -- Check the naming schemes Check_Imported_Projects (For_Project, In_Tree, Dummy, Imported_First => False); -- If there are no non standard naming scheme, issue the GNAT -- standard naming scheme. This will tell the compiler that -- a project file is used and will forbid any pragma SFN. if Buffer_Last = 0 then Put_Line ("pragma Source_File_Name_Project"); Put_Line (" (Spec_File_Name => ""*.ads"","); Put_Line (" Dot_Replacement => ""-"","); Put_Line (" Casing => lowercase);"); Put_Line ("pragma Source_File_Name_Project"); Put_Line (" (Body_File_Name => ""*.adb"","); Put_Line (" Dot_Replacement => ""-"","); Put_Line (" Casing => lowercase);"); end if; -- Close the temporary file Write_Temp_File; if Opt.Verbose_Mode then Write_Str ("Created configuration file """); Write_Str (Get_Name_String (File_Name)); Write_Line (""""); end if; For_Project.Config_File_Name := File_Name; For_Project.Config_File_Temp := True; For_Project.Config_Checked := True; end if; Free (Buffer); end Create_Config_Pragmas_File; -------------------- -- Create_Mapping -- -------------------- procedure Create_Mapping (In_Tree : Project_Tree_Ref) is Data : Source_Id; Iter : Source_Iterator; begin Fmap.Reset_Tables; Iter := For_Each_Source (In_Tree); loop Data := Element (Iter); exit when Data = No_Source; if Data.Unit /= No_Unit_Index then if Data.Locally_Removed and then not Data.Suppressed then Fmap.Add_Forbidden_File_Name (Data.File); else Fmap.Add_To_File_Map (Unit_Name => Unit_Name_Type (Data.Unit.Name), File_Name => Data.File, Path_Name => File_Name_Type (Data.Path.Display_Name)); end if; end if; Next (Iter); end loop; end Create_Mapping; ------------------------- -- Create_Mapping_File -- ------------------------- procedure Create_Mapping_File (Project : Project_Id; Language : Name_Id; In_Tree : Project_Tree_Ref; Name : out Path_Name_Type) is File : File_Descriptor := Invalid_FD; Buffer : String_Access := new String (1 .. Buffer_Initial); Buffer_Last : Natural := 0; procedure Put_Name_Buffer; -- Put the line contained in the Name_Buffer in the global buffer procedure Process (Project : Project_Id; In_Tree : Project_Tree_Ref; State : in out Integer); -- Generate the mapping file for Project (not recursively) --------------------- -- Put_Name_Buffer -- --------------------- procedure Put_Name_Buffer is begin if Current_Verbosity = High then Debug_Output (Name_Buffer (1 .. Name_Len)); end if; Name_Len := Name_Len + 1; Name_Buffer (Name_Len) := ASCII.LF; Add_To_Buffer (Name_Buffer (1 .. Name_Len), Buffer, Buffer_Last); end Put_Name_Buffer; ------------- -- Process -- ------------- procedure Process (Project : Project_Id; In_Tree : Project_Tree_Ref; State : in out Integer) is pragma Unreferenced (State); Source : Source_Id; Suffix : File_Name_Type; Iter : Source_Iterator; begin Debug_Output ("Add mapping for project", Project.Name); Iter := For_Each_Source (In_Tree, Project, Language => Language); loop Source := Prj.Element (Iter); exit when Source = No_Source; if not Source.Suppressed and then Source.Replaced_By = No_Source and then Source.Path.Name /= No_Path and then (Source.Language.Config.Kind = File_Based or else Source.Unit /= No_Unit_Index) then if Source.Unit /= No_Unit_Index then -- Put the encoded unit name in the name buffer declare Uname : constant String := Get_Name_String (Source.Unit.Name); begin Name_Len := 0; for J in Uname'Range loop if Uname (J) in Upper_Half_Character then Store_Encoded_Character (Get_Char_Code (Uname (J))); else Add_Char_To_Name_Buffer (Uname (J)); end if; end loop; end; if Source.Language.Config.Kind = Unit_Based then -- ??? Mapping_Spec_Suffix could be set in the case of -- gnatmake as well Add_Char_To_Name_Buffer ('%'); if Source.Kind = Spec then Add_Char_To_Name_Buffer ('s'); else Add_Char_To_Name_Buffer ('b'); end if; else case Source.Kind is when Spec => Suffix := Source.Language.Config.Mapping_Spec_Suffix; when Impl | Sep => Suffix := Source.Language.Config.Mapping_Body_Suffix; end case; if Suffix /= No_File then Add_Str_To_Name_Buffer (Get_Name_String (Suffix)); end if; end if; Put_Name_Buffer; end if; Get_Name_String (Source.Display_File); Put_Name_Buffer; if Source.Locally_Removed then Name_Len := 1; Name_Buffer (1) := '/'; else Get_Name_String (Source.Path.Display_Name); end if; Put_Name_Buffer; end if; Next (Iter); end loop; end Process; procedure For_Every_Imported_Project is new For_Every_Project_Imported (State => Integer, Action => Process); -- Local variables Dummy : Integer := 0; -- Start of processing for Create_Mapping_File begin if Current_Verbosity = High then Debug_Output ("Create mapping file for", Debug_Name (In_Tree)); end if; Create_Temp_File (In_Tree.Shared, File, Name, "mapping"); if Current_Verbosity = High then Debug_Increase_Indent ("Create mapping file ", Name_Id (Name)); end if; For_Every_Imported_Project (Project, In_Tree, Dummy, Include_Aggregated => False); declare Last : Natural; Status : Boolean := False; begin if File /= Invalid_FD then Last := Write (File, Buffer (1)'Address, Buffer_Last); if Last = Buffer_Last then GNAT.OS_Lib.Close (File, Status); end if; end if; if not Status then Prj.Com.Fail ("could not write mapping file"); end if; end; Free (Buffer); Debug_Decrease_Indent ("Done create mapping file"); end Create_Mapping_File; ---------------------- -- Create_Temp_File -- ---------------------- procedure Create_Temp_File (Shared : Shared_Project_Tree_Data_Access; Path_FD : out File_Descriptor; Path_Name : out Path_Name_Type; File_Use : String) is begin Tempdir.Create_Temp_File (Path_FD, Path_Name); if Path_Name /= No_Path then if Current_Verbosity = High then Write_Line ("Create temp file (" & File_Use & ") " & Get_Name_String (Path_Name)); end if; Record_Temp_File (Shared, Path_Name); else Prj.Com.Fail ("unable to create temporary " & File_Use & " file"); end if; end Create_Temp_File; -------------------------- -- Create_New_Path_File -- -------------------------- procedure Create_New_Path_File (Shared : Shared_Project_Tree_Data_Access; Path_FD : out File_Descriptor; Path_Name : out Path_Name_Type) is begin Create_Temp_File (Shared, Path_FD, Path_Name, "path file"); end Create_New_Path_File; ------------------------------------ -- File_Name_Of_Library_Unit_Body -- ------------------------------------ function File_Name_Of_Library_Unit_Body (Name : String; Project : Project_Id; In_Tree : Project_Tree_Ref; Main_Project_Only : Boolean := True; Full_Path : Boolean := False) return String is Lang : constant Language_Ptr := Get_Language_From_Name (Project, "ada"); The_Project : Project_Id := Project; Original_Name : String := Name; Unit : Unit_Index; The_Original_Name : Name_Id; The_Spec_Name : Name_Id; The_Body_Name : Name_Id; begin -- ??? Same block in Project_Of Canonical_Case_File_Name (Original_Name); Name_Len := Original_Name'Length; Name_Buffer (1 .. Name_Len) := Original_Name; The_Original_Name := Name_Find; if Lang /= null then declare Naming : constant Lang_Naming_Data := Lang.Config.Naming_Data; Extended_Spec_Name : String := Name & Namet.Get_Name_String (Naming.Spec_Suffix); Extended_Body_Name : String := Name & Namet.Get_Name_String (Naming.Body_Suffix); begin Canonical_Case_File_Name (Extended_Spec_Name); Name_Len := Extended_Spec_Name'Length; Name_Buffer (1 .. Name_Len) := Extended_Spec_Name; The_Spec_Name := Name_Find; Canonical_Case_File_Name (Extended_Body_Name); Name_Len := Extended_Body_Name'Length; Name_Buffer (1 .. Name_Len) := Extended_Body_Name; The_Body_Name := Name_Find; end; else Name_Len := Name'Length; Name_Buffer (1 .. Name_Len) := Name; Canonical_Case_File_Name (Name_Buffer); The_Spec_Name := Name_Find; The_Body_Name := The_Spec_Name; end if; if Current_Verbosity = High then Write_Str ("Looking for file name of """); Write_Str (Name); Write_Char ('"'); Write_Eol; Write_Str (" Extended Spec Name = """); Write_Str (Get_Name_String (The_Spec_Name)); Write_Char ('"'); Write_Eol; Write_Str (" Extended Body Name = """); Write_Str (Get_Name_String (The_Body_Name)); Write_Char ('"'); Write_Eol; end if; -- For extending project, search in the extended project if the source -- is not found. For non extending projects, this loop will be run only -- once. loop -- Loop through units Unit := Units_Htable.Get_First (In_Tree.Units_HT); while Unit /= null loop -- Check for body if not Main_Project_Only or else (Unit.File_Names (Impl) /= null and then Unit.File_Names (Impl).Project = The_Project) then declare Current_Name : File_Name_Type; begin -- Case of a body present if Unit.File_Names (Impl) /= null then Current_Name := Unit.File_Names (Impl).File; if Current_Verbosity = High then Write_Str (" Comparing with """); Write_Str (Get_Name_String (Current_Name)); Write_Char ('"'); Write_Eol; end if; -- If it has the name of the original name, return the -- original name. if Unit.Name = The_Original_Name or else Current_Name = File_Name_Type (The_Original_Name) then if Current_Verbosity = High then Write_Line (" OK"); end if; if Full_Path then return Get_Name_String (Unit.File_Names (Impl).Path.Name); else return Get_Name_String (Current_Name); end if; -- If it has the name of the extended body name, -- return the extended body name elsif Current_Name = File_Name_Type (The_Body_Name) then if Current_Verbosity = High then Write_Line (" OK"); end if; if Full_Path then return Get_Name_String (Unit.File_Names (Impl).Path.Name); else return Get_Name_String (The_Body_Name); end if; else if Current_Verbosity = High then Write_Line (" not good"); end if; end if; end if; end; end if; -- Check for spec if not Main_Project_Only or else (Unit.File_Names (Spec) /= null and then Unit.File_Names (Spec).Project = The_Project) then declare Current_Name : File_Name_Type; begin -- Case of spec present if Unit.File_Names (Spec) /= null then Current_Name := Unit.File_Names (Spec).File; if Current_Verbosity = High then Write_Str (" Comparing with """); Write_Str (Get_Name_String (Current_Name)); Write_Char ('"'); Write_Eol; end if; -- If name same as original name, return original name if Unit.Name = The_Original_Name or else Current_Name = File_Name_Type (The_Original_Name) then if Current_Verbosity = High then Write_Line (" OK"); end if; if Full_Path then return Get_Name_String (Unit.File_Names (Spec).Path.Name); else return Get_Name_String (Current_Name); end if; -- If it has the same name as the extended spec name, -- return the extended spec name. elsif Current_Name = File_Name_Type (The_Spec_Name) then if Current_Verbosity = High then Write_Line (" OK"); end if; if Full_Path then return Get_Name_String (Unit.File_Names (Spec).Path.Name); else return Get_Name_String (The_Spec_Name); end if; else if Current_Verbosity = High then Write_Line (" not good"); end if; end if; end if; end; end if; Unit := Units_Htable.Get_Next (In_Tree.Units_HT); end loop; -- If we are not in an extending project, give up exit when not Main_Project_Only or else The_Project.Extends = No_Project; -- Otherwise, look in the project we are extending The_Project := The_Project.Extends; end loop; -- We don't know this file name, return an empty string return ""; end File_Name_Of_Library_Unit_Body; ------------------------- -- For_All_Object_Dirs -- ------------------------- procedure For_All_Object_Dirs (Project : Project_Id; Tree : Project_Tree_Ref) is procedure For_Project (Prj : Project_Id; Tree : Project_Tree_Ref; Dummy : in out Integer); -- Get all object directories of Prj ----------------- -- For_Project -- ----------------- procedure For_Project (Prj : Project_Id; Tree : Project_Tree_Ref; Dummy : in out Integer) is pragma Unreferenced (Tree); begin -- ??? Set_Ada_Paths has a different behavior for library project -- files, should we have the same ? if Prj.Object_Directory /= No_Path_Information then Get_Name_String (Prj.Object_Directory.Display_Name); Action (Name_Buffer (1 .. Name_Len)); end if; end For_Project; procedure Get_Object_Dirs is new For_Every_Project_Imported (Integer, For_Project); Dummy : Integer := 1; -- Start of processing for For_All_Object_Dirs begin Get_Object_Dirs (Project, Tree, Dummy); end For_All_Object_Dirs; ------------------------- -- For_All_Source_Dirs -- ------------------------- procedure For_All_Source_Dirs (Project : Project_Id; In_Tree : Project_Tree_Ref) is procedure For_Project (Prj : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Integer); -- Get all object directories of Prj ----------------- -- For_Project -- ----------------- procedure For_Project (Prj : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Integer) is Current : String_List_Id := Prj.Source_Dirs; The_String : String_Element; begin -- If there are Ada sources, call action with the name of every -- source directory. if Has_Ada_Sources (Prj) then while Current /= Nil_String loop The_String := In_Tree.Shared.String_Elements.Table (Current); Action (Get_Name_String (The_String.Display_Value)); Current := The_String.Next; end loop; end if; end For_Project; procedure Get_Source_Dirs is new For_Every_Project_Imported (Integer, For_Project); Dummy : Integer := 1; -- Start of processing for For_All_Source_Dirs begin Get_Source_Dirs (Project, In_Tree, Dummy); end For_All_Source_Dirs; ------------------- -- Get_Reference -- ------------------- procedure Get_Reference (Source_File_Name : String; In_Tree : Project_Tree_Ref; Project : out Project_Id; Path : out Path_Name_Type) is begin -- Body below could use some comments ??? if Current_Verbosity > Default then Write_Str ("Getting Reference_Of ("""); Write_Str (Source_File_Name); Write_Str (""") ... "); end if; declare Original_Name : String := Source_File_Name; Unit : Unit_Index; begin Canonical_Case_File_Name (Original_Name); Unit := Units_Htable.Get_First (In_Tree.Units_HT); while Unit /= null loop if Unit.File_Names (Spec) /= null and then not Unit.File_Names (Spec).Locally_Removed and then Unit.File_Names (Spec).File /= No_File and then (Namet.Get_Name_String (Unit.File_Names (Spec).File) = Original_Name or else (Unit.File_Names (Spec).Path /= No_Path_Information and then Namet.Get_Name_String (Unit.File_Names (Spec).Path.Name) = Original_Name)) then Project := Ultimate_Extending_Project_Of (Unit.File_Names (Spec).Project); Path := Unit.File_Names (Spec).Path.Display_Name; if Current_Verbosity > Default then Write_Str ("Done: Spec."); Write_Eol; end if; return; elsif Unit.File_Names (Impl) /= null and then Unit.File_Names (Impl).File /= No_File and then not Unit.File_Names (Impl).Locally_Removed and then (Namet.Get_Name_String (Unit.File_Names (Impl).File) = Original_Name or else (Unit.File_Names (Impl).Path /= No_Path_Information and then Namet.Get_Name_String (Unit.File_Names (Impl).Path.Name) = Original_Name)) then Project := Ultimate_Extending_Project_Of (Unit.File_Names (Impl).Project); Path := Unit.File_Names (Impl).Path.Display_Name; if Current_Verbosity > Default then Write_Str ("Done: Body."); Write_Eol; end if; return; end if; Unit := Units_Htable.Get_Next (In_Tree.Units_HT); end loop; end; Project := No_Project; Path := No_Path; if Current_Verbosity > Default then Write_Str ("Cannot be found."); Write_Eol; end if; end Get_Reference; ---------------------- -- Get_Runtime_Path -- ---------------------- function Get_Runtime_Path (Self : Project_Search_Path; Name : String) return String_Access is function Find_Rts_In_Path is new Prj.Env.Find_Name_In_Path (Check_Filename => Is_Directory); begin return Find_Rts_In_Path (Self, Name); end Get_Runtime_Path; ---------------- -- Initialize -- ---------------- procedure Initialize (In_Tree : Project_Tree_Ref) is begin In_Tree.Shared.Private_Part.Current_Source_Path_File := No_Path; In_Tree.Shared.Private_Part.Current_Object_Path_File := No_Path; end Initialize; ------------------- -- Print_Sources -- ------------------- -- Could use some comments in this body ??? procedure Print_Sources (In_Tree : Project_Tree_Ref) is Unit : Unit_Index; begin Write_Line ("List of Sources:"); Unit := Units_Htable.Get_First (In_Tree.Units_HT); while Unit /= No_Unit_Index loop Write_Str (" "); Write_Line (Namet.Get_Name_String (Unit.Name)); if Unit.File_Names (Spec).File /= No_File then if Unit.File_Names (Spec).Project = No_Project then Write_Line (" No project"); else Write_Str (" Project: "); Get_Name_String (Unit.File_Names (Spec).Project.Path.Name); Write_Line (Name_Buffer (1 .. Name_Len)); end if; Write_Str (" spec: "); Write_Line (Namet.Get_Name_String (Unit.File_Names (Spec).File)); end if; if Unit.File_Names (Impl).File /= No_File then if Unit.File_Names (Impl).Project = No_Project then Write_Line (" No project"); else Write_Str (" Project: "); Get_Name_String (Unit.File_Names (Impl).Project.Path.Name); Write_Line (Name_Buffer (1 .. Name_Len)); end if; Write_Str (" body: "); Write_Line (Namet.Get_Name_String (Unit.File_Names (Impl).File)); end if; Unit := Units_Htable.Get_Next (In_Tree.Units_HT); end loop; Write_Line ("end of List of Sources."); end Print_Sources; ---------------- -- Project_Of -- ---------------- function Project_Of (Name : String; Main_Project : Project_Id; In_Tree : Project_Tree_Ref) return Project_Id is Result : Project_Id := No_Project; Original_Name : String := Name; Lang : constant Language_Ptr := Get_Language_From_Name (Main_Project, "ada"); Unit : Unit_Index; Current_Name : File_Name_Type; The_Original_Name : File_Name_Type; The_Spec_Name : File_Name_Type; The_Body_Name : File_Name_Type; begin -- ??? Same block in File_Name_Of_Library_Unit_Body Canonical_Case_File_Name (Original_Name); Name_Len := Original_Name'Length; Name_Buffer (1 .. Name_Len) := Original_Name; The_Original_Name := Name_Find; if Lang /= null then declare Naming : Lang_Naming_Data renames Lang.Config.Naming_Data; Extended_Spec_Name : String := Name & Namet.Get_Name_String (Naming.Spec_Suffix); Extended_Body_Name : String := Name & Namet.Get_Name_String (Naming.Body_Suffix); begin Canonical_Case_File_Name (Extended_Spec_Name); Name_Len := Extended_Spec_Name'Length; Name_Buffer (1 .. Name_Len) := Extended_Spec_Name; The_Spec_Name := Name_Find; Canonical_Case_File_Name (Extended_Body_Name); Name_Len := Extended_Body_Name'Length; Name_Buffer (1 .. Name_Len) := Extended_Body_Name; The_Body_Name := Name_Find; end; else The_Spec_Name := The_Original_Name; The_Body_Name := The_Original_Name; end if; Unit := Units_Htable.Get_First (In_Tree.Units_HT); while Unit /= null loop -- Case of a body present if Unit.File_Names (Impl) /= null then Current_Name := Unit.File_Names (Impl).File; -- If it has the name of the original name or the body name, -- we have found the project. if Unit.Name = Name_Id (The_Original_Name) or else Current_Name = The_Original_Name or else Current_Name = The_Body_Name then Result := Unit.File_Names (Impl).Project; exit; end if; end if; -- Check for spec if Unit.File_Names (Spec) /= null then Current_Name := Unit.File_Names (Spec).File; -- If name same as the original name, or the spec name, we have -- found the project. if Unit.Name = Name_Id (The_Original_Name) or else Current_Name = The_Original_Name or else Current_Name = The_Spec_Name then Result := Unit.File_Names (Spec).Project; exit; end if; end if; Unit := Units_Htable.Get_Next (In_Tree.Units_HT); end loop; return Ultimate_Extending_Project_Of (Result); end Project_Of; ------------------- -- Set_Ada_Paths -- ------------------- procedure Set_Ada_Paths (Project : Project_Id; In_Tree : Project_Tree_Ref; Including_Libraries : Boolean; Include_Path : Boolean := True; Objects_Path : Boolean := True) is Shared : constant Shared_Project_Tree_Data_Access := In_Tree.Shared; Source_Paths : Source_Path_Table.Instance; Object_Paths : Object_Path_Table.Instance; -- List of source or object dirs. Only computed the first time this -- procedure is called (since Source_FD is then reused) Source_FD : File_Descriptor := Invalid_FD; Object_FD : File_Descriptor := Invalid_FD; -- The temporary files to store the paths. These are only created the -- first time this procedure is called, and reused from then on. Process_Source_Dirs : Boolean := False; Process_Object_Dirs : Boolean := False; Status : Boolean; -- For calls to Close Last : Natural; Buffer : String_Access := new String (1 .. Buffer_Initial); Buffer_Last : Natural := 0; procedure Recursive_Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean); -- Recursive procedure to add the source/object paths of extended/ -- imported projects. ------------------- -- Recursive_Add -- ------------------- procedure Recursive_Add (Project : Project_Id; In_Tree : Project_Tree_Ref; Dummy : in out Boolean) is pragma Unreferenced (In_Tree); Path : Path_Name_Type; begin if Process_Source_Dirs then -- Add to path all source directories of this project if there are -- Ada sources. if Has_Ada_Sources (Project) then Add_To_Source_Path (Project.Source_Dirs, Shared, Source_Paths); end if; end if; if Process_Object_Dirs then Path := Get_Object_Directory (Project, Including_Libraries => Including_Libraries, Only_If_Ada => True); if Path /= No_Path then Add_To_Object_Path (Path, Object_Paths); end if; end if; end Recursive_Add; procedure For_All_Projects is new For_Every_Project_Imported (Boolean, Recursive_Add); Dummy : Boolean := False; -- Start of processing for Set_Ada_Paths begin -- If it is the first time we call this procedure for this project, -- compute the source path and/or the object path. if Include_Path and then Project.Include_Path_File = No_Path then Source_Path_Table.Init (Source_Paths); Process_Source_Dirs := True; Create_New_Path_File (Shared, Source_FD, Project.Include_Path_File); end if; -- For the object path, we make a distinction depending on -- Including_Libraries. if Objects_Path and Including_Libraries then if Project.Objects_Path_File_With_Libs = No_Path then Object_Path_Table.Init (Object_Paths); Process_Object_Dirs := True; Create_New_Path_File (Shared, Object_FD, Project.Objects_Path_File_With_Libs); end if; elsif Objects_Path then if Project.Objects_Path_File_Without_Libs = No_Path then Object_Path_Table.Init (Object_Paths); Process_Object_Dirs := True; Create_New_Path_File (Shared, Object_FD, Project.Objects_Path_File_Without_Libs); end if; end if; -- If there is something to do, set Seen to False for all projects, -- then call the recursive procedure Add for Project. if Process_Source_Dirs or Process_Object_Dirs then For_All_Projects (Project, In_Tree, Dummy); end if; -- Write and close any file that has been created. Source_FD is not set -- when this subprogram is called a second time or more, since we reuse -- the previous version of the file. if Source_FD /= Invalid_FD then Buffer_Last := 0; for Index in Source_Path_Table.First .. Source_Path_Table.Last (Source_Paths) loop Get_Name_String (Source_Paths.Table (Index)); Name_Len := Name_Len + 1; Name_Buffer (Name_Len) := ASCII.LF; Add_To_Buffer (Name_Buffer (1 .. Name_Len), Buffer, Buffer_Last); end loop; Last := Write (Source_FD, Buffer (1)'Address, Buffer_Last); if Last = Buffer_Last then Close (Source_FD, Status); else Status := False; end if; if not Status then Prj.Com.Fail ("could not write temporary file"); end if; end if; if Object_FD /= Invalid_FD then Buffer_Last := 0; for Index in Object_Path_Table.First .. Object_Path_Table.Last (Object_Paths) loop Get_Name_String (Object_Paths.Table (Index)); Name_Len := Name_Len + 1; Name_Buffer (Name_Len) := ASCII.LF; Add_To_Buffer (Name_Buffer (1 .. Name_Len), Buffer, Buffer_Last); end loop; Last := Write (Object_FD, Buffer (1)'Address, Buffer_Last); if Last = Buffer_Last then Close (Object_FD, Status); else Status := False; end if; if not Status then Prj.Com.Fail ("could not write temporary file"); end if; end if; -- Set the env vars, if they need to be changed, and set the -- corresponding flags. if Include_Path and then Shared.Private_Part.Current_Source_Path_File /= Project.Include_Path_File then Shared.Private_Part.Current_Source_Path_File := Project.Include_Path_File; Set_Path_File_Var (Project_Include_Path_File, Get_Name_String (Shared.Private_Part.Current_Source_Path_File)); end if; if Objects_Path then if Including_Libraries then if Shared.Private_Part.Current_Object_Path_File /= Project.Objects_Path_File_With_Libs then Shared.Private_Part.Current_Object_Path_File := Project.Objects_Path_File_With_Libs; Set_Path_File_Var (Project_Objects_Path_File, Get_Name_String (Shared.Private_Part.Current_Object_Path_File)); end if; else if Shared.Private_Part.Current_Object_Path_File /= Project.Objects_Path_File_Without_Libs then Shared.Private_Part.Current_Object_Path_File := Project.Objects_Path_File_Without_Libs; Set_Path_File_Var (Project_Objects_Path_File, Get_Name_String (Shared.Private_Part.Current_Object_Path_File)); end if; end if; end if; Free (Buffer); end Set_Ada_Paths; --------------------- -- Add_Directories -- --------------------- procedure Add_Directories (Self : in out Project_Search_Path; Path : String; Prepend : Boolean := False) is Tmp : String_Access; begin if Self.Path = null then Self.Path := new String'(Uninitialized_Prefix & Path); else Tmp := Self.Path; if Prepend then Self.Path := new String'(Path & Path_Separator & Tmp.all); else Self.Path := new String'(Tmp.all & Path_Separator & Path); end if; Free (Tmp); end if; if Current_Verbosity = High then Debug_Output ("Adding directories to Project_Path: """ & Path & '"'); end if; end Add_Directories; -------------------- -- Is_Initialized -- -------------------- function Is_Initialized (Self : Project_Search_Path) return Boolean is begin return Self.Path /= null and then (Self.Path'Length = 0 or else Self.Path (Self.Path'First) /= '#'); end Is_Initialized; ---------------------- -- Initialize_Empty -- ---------------------- procedure Initialize_Empty (Self : in out Project_Search_Path) is begin Free (Self.Path); Self.Path := new String'(""); end Initialize_Empty; ------------------------------------- -- Initialize_Default_Project_Path -- ------------------------------------- procedure Initialize_Default_Project_Path (Self : in out Project_Search_Path; Target_Name : String; Runtime_Name : String := "") is Add_Default_Dir : Boolean := Target_Name /= "-"; First : Positive; Last : Positive; Ada_Project_Path : constant String := "ADA_PROJECT_PATH"; Gpr_Project_Path : constant String := "GPR_PROJECT_PATH"; Gpr_Project_Path_File : constant String := "GPR_PROJECT_PATH_FILE"; -- Names of alternate env. variable that contain path name(s) of -- directories where project files may reside. They are taken into -- account in this order: GPR_PROJECT_PATH_FILE, GPR_PROJECT_PATH, -- ADA_PROJECT_PATH. Gpr_Prj_Path_File : String_Access; Gpr_Prj_Path : String_Access; Ada_Prj_Path : String_Access; -- The path name(s) of directories where project files may reside. -- May be empty. Prefix : String_Ptr; Runtime : String_Ptr; procedure Add_Target; -- Add :<prefix>/<target> to the project path ---------------- -- Add_Target -- ---------------- procedure Add_Target is begin Add_Str_To_Name_Buffer (Path_Separator & Prefix.all & Target_Name); -- Note: Target_Name has a trailing / when it comes from Sdefault if Name_Buffer (Name_Len) /= '/' then Add_Char_To_Name_Buffer (Directory_Separator); end if; end Add_Target; -- Start of processing for Initialize_Default_Project_Path begin if Is_Initialized (Self) then return; end if; -- The current directory is always first in the search path. Since the -- Project_Path currently starts with '#:' as a sign that it isn't -- initialized, we simply replace '#' with '.' if Self.Path = null then Self.Path := new String'('.' & Path_Separator); else Self.Path (Self.Path'First) := '.'; end if; -- Then the reset of the project path (if any) currently contains the -- directories added through Add_Search_Project_Directory -- If environment variables are defined and not empty, add their content Gpr_Prj_Path_File := Getenv (Gpr_Project_Path_File); Gpr_Prj_Path := Getenv (Gpr_Project_Path); Ada_Prj_Path := Getenv (Ada_Project_Path); if Gpr_Prj_Path_File.all /= "" then declare File : Ada.Text_IO.File_Type; Line : String (1 .. 10_000); Last : Natural; Tmp : String_Access; begin Open (File, In_File, Gpr_Prj_Path_File.all); while not End_Of_File (File) loop Get_Line (File, Line, Last); if Last /= 0 and then (Last = 1 or else Line (1 .. 2) /= "--") then Tmp := Self.Path; Self.Path := new String' (Tmp.all & Path_Separator & Line (1 .. Last)); Free (Tmp); end if; if Current_Verbosity = High then Debug_Output ("Adding directory to Project_Path: """ & Line (1 .. Last) & '"'); end if; end loop; Close (File); exception when others => Write_Str ("warning: could not read project path file """); Write_Str (Gpr_Prj_Path_File.all); Write_Line (""""); end; end if; if Gpr_Prj_Path.all /= "" then Add_Directories (Self, Gpr_Prj_Path.all); end if; Free (Gpr_Prj_Path); if Ada_Prj_Path.all /= "" then Add_Directories (Self, Ada_Prj_Path.all); end if; Free (Ada_Prj_Path); -- Copy to Name_Buffer, since we will need to manipulate the path Name_Len := Self.Path'Length; Name_Buffer (1 .. Name_Len) := Self.Path.all; -- Scan the directory path to see if "-" is one of the directories. -- Remove each occurrence of "-" and set Add_Default_Dir to False. -- Also resolve relative paths and symbolic links. First := 3; loop while First <= Name_Len and then (Name_Buffer (First) = Path_Separator) loop First := First + 1; end loop; exit when First > Name_Len; Last := First; while Last < Name_Len and then Name_Buffer (Last + 1) /= Path_Separator loop Last := Last + 1; end loop; -- If the directory is "-", set Add_Default_Dir to False and -- remove from path. if Name_Buffer (First .. Last) = No_Project_Default_Dir then Add_Default_Dir := False; for J in Last + 1 .. Name_Len loop Name_Buffer (J - No_Project_Default_Dir'Length - 1) := Name_Buffer (J); end loop; Name_Len := Name_Len - No_Project_Default_Dir'Length - 1; -- After removing the '-', go back one character to get the next -- directory correctly. Last := Last - 1; else declare New_Dir : constant String := Normalize_Pathname (Name_Buffer (First .. Last), Resolve_Links => Opt.Follow_Links_For_Dirs); New_Len : Positive; New_Last : Positive; begin -- If the absolute path was resolved and is different from -- the original, replace original with the resolved path. if New_Dir /= Name_Buffer (First .. Last) and then New_Dir'Length /= 0 then New_Len := Name_Len + New_Dir'Length - (Last - First + 1); New_Last := First + New_Dir'Length - 1; Name_Buffer (New_Last + 1 .. New_Len) := Name_Buffer (Last + 1 .. Name_Len); Name_Buffer (First .. New_Last) := New_Dir; Name_Len := New_Len; Last := New_Last; end if; end; end if; First := Last + 1; end loop; Free (Self.Path); -- Set the initial value of Current_Project_Path if Add_Default_Dir then if Sdefault.Search_Dir_Prefix = null then -- gprbuild case Prefix := new String'(Executable_Prefix_Path); else Prefix := new String'(Sdefault.Search_Dir_Prefix.all & ".." & Dir_Separator & ".." & Dir_Separator & ".." & Dir_Separator & ".." & Dir_Separator); end if; if Prefix.all /= "" then if Target_Name /= "" then if Runtime_Name /= "" then if Base_Name (Runtime_Name) = Runtime_Name then -- $prefix/$target/$runtime/lib/gnat Add_Target; Add_Str_To_Name_Buffer (Runtime_Name & Directory_Separator & "lib" & Directory_Separator & "gnat"); -- $prefix/$target/$runtime/share/gpr Add_Target; Add_Str_To_Name_Buffer (Runtime_Name & Directory_Separator & "share" & Directory_Separator & "gpr"); else Runtime := new String'(Normalize_Pathname (Runtime_Name)); -- $runtime_dir/lib/gnat Add_Str_To_Name_Buffer (Path_Separator & Runtime.all & Directory_Separator & "lib" & Directory_Separator & "gnat"); -- $runtime_dir/share/gpr Add_Str_To_Name_Buffer (Path_Separator & Runtime.all & Directory_Separator & "share" & Directory_Separator & "gpr"); end if; end if; -- $prefix/$target/lib/gnat Add_Target; Add_Str_To_Name_Buffer ("lib" & Directory_Separator & "gnat"); -- $prefix/$target/share/gpr Add_Target; Add_Str_To_Name_Buffer ("share" & Directory_Separator & "gpr"); end if; -- $prefix/share/gpr Add_Str_To_Name_Buffer (Path_Separator & Prefix.all & "share" & Directory_Separator & "gpr"); -- $prefix/lib/gnat Add_Str_To_Name_Buffer (Path_Separator & Prefix.all & "lib" & Directory_Separator & "gnat"); end if; Free (Prefix); end if; Self.Path := new String'(Name_Buffer (1 .. Name_Len)); end Initialize_Default_Project_Path; -------------- -- Get_Path -- -------------- procedure Get_Path (Self : Project_Search_Path; Path : out String_Access) is begin pragma Assert (Is_Initialized (Self)); Path := Self.Path; end Get_Path; -------------- -- Set_Path -- -------------- procedure Set_Path (Self : in out Project_Search_Path; Path : String) is begin Free (Self.Path); Self.Path := new String'(Path); Projects_Paths.Reset (Self.Cache); end Set_Path; ----------------------- -- Find_Name_In_Path -- ----------------------- function Find_Name_In_Path (Self : Project_Search_Path; Path : String) return String_Access is First : Natural; Last : Natural; begin if Current_Verbosity = High then Debug_Output ("Trying " & Path); end if; if Is_Absolute_Path (Path) then if Check_Filename (Path) then return new String'(Path); else return null; end if; else -- Because we don't want to resolve symbolic links, we cannot use -- Locate_Regular_File. So, we try each possible path successively. First := Self.Path'First; while First <= Self.Path'Last loop while First <= Self.Path'Last and then Self.Path (First) = Path_Separator loop First := First + 1; end loop; exit when First > Self.Path'Last; Last := First; while Last < Self.Path'Last and then Self.Path (Last + 1) /= Path_Separator loop Last := Last + 1; end loop; Name_Len := 0; if not Is_Absolute_Path (Self.Path (First .. Last)) then Add_Str_To_Name_Buffer (Get_Current_Dir); -- ??? System call Add_Char_To_Name_Buffer (Directory_Separator); end if; Add_Str_To_Name_Buffer (Self.Path (First .. Last)); Add_Char_To_Name_Buffer (Directory_Separator); Add_Str_To_Name_Buffer (Path); if Current_Verbosity = High then Debug_Output ("Testing file " & Name_Buffer (1 .. Name_Len)); end if; if Check_Filename (Name_Buffer (1 .. Name_Len)) then return new String'(Name_Buffer (1 .. Name_Len)); end if; First := Last + 1; end loop; end if; return null; end Find_Name_In_Path; ------------------ -- Find_Project -- ------------------ procedure Find_Project (Self : in out Project_Search_Path; Project_File_Name : String; Directory : String; Path : out Namet.Path_Name_Type) is Result : String_Access; Has_Dot : Boolean := False; Key : Name_Id; File : constant String := Project_File_Name; -- Have to do a copy, in case the parameter is Name_Buffer, which we -- modify below. Cached_Path : Namet.Path_Name_Type; -- This should be commented rather than making us guess from the name??? function Try_Path_Name is new Find_Name_In_Path (Check_Filename => Is_Regular_File); -- Find a file in the project search path -- Start of processing for Find_Project begin pragma Assert (Is_Initialized (Self)); if Current_Verbosity = High then Debug_Increase_Indent ("Searching for project """ & File & """ in """ & Directory & '"'); end if; -- Check the project cache Name_Len := File'Length; Name_Buffer (1 .. Name_Len) := File; Key := Name_Find; Cached_Path := Projects_Paths.Get (Self.Cache, Key); -- Check if File contains an extension (a dot before a -- directory separator). If it is the case we do not try project file -- with an added extension as it is not possible to have multiple dots -- on a project file name. Check_Dot : for K in reverse File'Range loop if File (K) = '.' then Has_Dot := True; exit Check_Dot; end if; exit Check_Dot when Is_Directory_Separator (File (K)); end loop Check_Dot; if not Is_Absolute_Path (File) then -- If we have found project in the cache, check if in the directory if Cached_Path /= No_Path then declare Cached : constant String := Get_Name_String (Cached_Path); begin if (not Has_Dot and then Cached = GNAT.OS_Lib.Normalize_Pathname (File & Project_File_Extension, Directory => Directory, Resolve_Links => Opt.Follow_Links_For_Files, Case_Sensitive => True)) or else Cached = GNAT.OS_Lib.Normalize_Pathname (File, Directory => Directory, Resolve_Links => Opt.Follow_Links_For_Files, Case_Sensitive => True) then Path := Cached_Path; Debug_Decrease_Indent; return; end if; end; end if; -- First we try <directory>/<file_name>.<extension> if not Has_Dot then Result := Try_Path_Name (Self, Directory & Directory_Separator & File & Project_File_Extension); end if; -- Then we try <directory>/<file_name> if Result = null then Result := Try_Path_Name (Self, Directory & Directory_Separator & File); end if; end if; -- If we found the path in the cache, this is the one if Result = null and then Cached_Path /= No_Path then Path := Cached_Path; Debug_Decrease_Indent; return; end if; -- Then we try <file_name>.<extension> if Result = null and then not Has_Dot then Result := Try_Path_Name (Self, File & Project_File_Extension); end if; -- Then we try <file_name> if Result = null then Result := Try_Path_Name (Self, File); end if; -- If we cannot find the project file, we return an empty string if Result = null then Path := Namet.No_Path; return; else declare Final_Result : constant String := GNAT.OS_Lib.Normalize_Pathname (Result.all, Directory => Directory, Resolve_Links => Opt.Follow_Links_For_Files, Case_Sensitive => True); begin Free (Result); Name_Len := Final_Result'Length; Name_Buffer (1 .. Name_Len) := Final_Result; Path := Name_Find; Projects_Paths.Set (Self.Cache, Key, Path); end; end if; Debug_Decrease_Indent; end Find_Project; ---------- -- Free -- ---------- procedure Free (Self : in out Project_Search_Path) is begin Free (Self.Path); Projects_Paths.Reset (Self.Cache); end Free; ---------- -- Copy -- ---------- procedure Copy (From : Project_Search_Path; To : out Project_Search_Path) is begin Free (To); if From.Path /= null then To.Path := new String'(From.Path.all); end if; -- No need to copy the Cache, it will be recomputed as needed end Copy; end Prj.Env;
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Menu_Demo.Handler -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998,2004 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control -- $Revision: 1.15 $ -- $Date: 2004/08/21 21:37:00 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with Sample.Menu_Demo.Aux; with Sample.Manifest; use Sample.Manifest; with Terminal_Interface.Curses.Mouse; use Terminal_Interface.Curses.Mouse; package body Sample.Menu_Demo.Handler is package Aux renames Sample.Menu_Demo.Aux; procedure Drive_Me (M : in Menu; Title : in String := "") is L : Line_Count; C : Column_Count; Y : Line_Position; X : Column_Position; begin Aux.Geometry (M, L, C, Y, X); Drive_Me (M, Y, X, Title); end Drive_Me; procedure Drive_Me (M : in Menu; Lin : in Line_Position; Col : in Column_Position; Title : in String := "") is Mask : Event_Mask := No_Events; Old : Event_Mask; Pan : Panel := Aux.Create (M, Title, Lin, Col); V : Cursor_Visibility := Invisible; begin -- We are only interested in Clicks with the left button Register_Reportable_Events (Left, All_Clicks, Mask); Old := Start_Mouse (Mask); Set_Cursor_Visibility (V); loop declare K : Key_Code := Aux.Get_Request (M, Pan); R : constant Driver_Result := Driver (M, K); begin case R is when Menu_Ok => null; when Unknown_Request => declare I : constant Item := Current (M); O : Item_Option_Set; begin if K = Key_Mouse then K := SELECT_ITEM; end if; Get_Options (I, O); if K = SELECT_ITEM and then not O.Selectable then Beep; else if My_Driver (M, K, Pan) then exit; end if; end if; end; when others => Beep; end case; end; end loop; End_Mouse (Old); Aux.Destroy (M, Pan); end Drive_Me; end Sample.Menu_Demo.Handler;
-- Copyright 2017 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. name = "Brute Forcing" type = "brute" probes = {"www", "online", "webserver", "ns", "ns1", "mail", "smtp", "webmail", "shop", "dev", "prod", "test", "vpn", "ftp", "ssh", "secure", "whm", "admin", "webdisk", "mobile", "remote", "server", "cpanel", "cloud", "autodiscover", "api", "m", "blog"} function vertical(ctx, domain) local cfg = config(ctx) if cfg.mode == "passive" then return end if cfg['brute_forcing'].active then makenames(ctx, domain) end end function resolved(ctx, name, domain, records) local nparts = split(name, ".") local dparts = split(domain, ".") -- Do not process resolved root domain names if #nparts == #dparts then return end -- Do not generate names from CNAMEs or names without A/AAAA records if (#records == 0 or (has_cname(records) or not has_addr(records))) then return end local cfg = config(ctx) if cfg.mode == "passive" then return end local bf = cfg['brute_forcing'] if (bf.active and bf.recursive and (bf['min_for_recursive'] == 0)) then makenames(ctx, name) end end function subdomain(ctx, name, domain, times) local cfg = config(ctx) if cfg.mode == "passive" then return end local bf = cfg['brute_forcing'] if (bf.active and bf.recursive and (bf['min_for_recursive'] == times)) then makenames(ctx, name) end end function makenames(ctx, base) local wordlist = brute_wordlist(ctx) for i, word in pairs(wordlist) do newname(ctx, word .. "." .. base) end end function has_cname(records) if #records == 0 then return false end for i, rec in pairs(records) do if rec.rrtype == 5 then return true end end return false end function has_addr(records) if #records == 0 then return false end for i, rec in pairs(records) do if (rec.rrtype == 1 or rec.rrtype == 28) then return true end end return false end function split(str, delim) local result = {} local pattern = "[^%" .. delim .. "]+" local matches = find(str, pattern) if (matches == nil or #matches == 0) then return result end for i, match in pairs(matches) do table.insert(result, match) end return result end
with Ada.Text_IO; use Ada.Text_IO; procedure Main is begin Put_Line ("Hello, World!"); end Main;
-- CE3402A.ADA -- Grant of Unlimited Rights -- -- 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 -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- 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 -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT NEW_LINE RAISES MODE_ERROR WHEN THE FILE MODE -- IS IN_FILE. -- APPLICABILITY CRITERIA: -- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT -- TEXT FILES. -- HISTORY: -- ABW 08/26/82 -- SPS 09/16/82 -- TBN 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE -- RESULT WHEN FILES ARE NOT SUPPORTED. -- DWC 08/19/87 ADDED ATTEMPT TO DELETE THE FILE AND REPLACED -- RESET WITH CLOSE AND OPEN. WITH REPORT; USE REPORT; WITH TEXT_IO; USE TEXT_IO; PROCEDURE CE3402A IS INCOMPLETE : EXCEPTION; FILE1 : FILE_TYPE; SPAC : CONSTANT POSITIVE_COUNT := POSITIVE_COUNT (IDENT_INT(1)); BEGIN TEST ("CE3402A" , "CHECK THAT NEW_LINE RAISES MODE_ERROR " & "WHEN THE FILE MODE IS IN_FILE"); BEGIN CREATE (FILE1, OUT_FILE, LEGAL_FILE_NAME); EXCEPTION WHEN USE_ERROR => NOT_APPLICABLE ("USE_ERROR RAISED; TEXT CREATE " & "WITH OUT_FILE MODE"); RAISE INCOMPLETE; WHEN NAME_ERROR => NOT_APPLICABLE ("NAME_ERROR RAISED; TEXT CREATE " & "WITH OUT_FILE MODE"); RAISE INCOMPLETE; WHEN OTHERS => FAILED ("UNEXPECTED EXCEPTION RAISED; TEXT CREATE"); RAISE INCOMPLETE; END; BEGIN PUT_LINE (FILE1, "STUFF"); CLOSE (FILE1); OPEN (FILE1, IN_FILE, LEGAL_FILE_NAME); EXCEPTION WHEN USE_ERROR => NOT_APPLICABLE ("USE_ERROR RAISED FOR OPEN " & "WITH IN_FILE MODE"); RAISE INCOMPLETE; END; BEGIN NEW_LINE (FILE1,SPAC); FAILED ("MODE_ERROR NOT RAISED FOR IN_FILE"); EXCEPTION WHEN MODE_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED FOR IN_FILE"); END; BEGIN NEW_LINE (STANDARD_INPUT,SPAC); FAILED ("MODE_ERROR NOT RAISED FOR STANDARD_INPUT"); EXCEPTION WHEN MODE_ERROR => NULL; WHEN OTHERS => FAILED ("WRONG EXCEPTION RAISED FOR STANDARD_INPUT"); END; BEGIN DELETE (FILE1); EXCEPTION WHEN USE_ERROR => NULL; END; RESULT; EXCEPTION WHEN INCOMPLETE => RESULT; END CE3402A;
-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2017 onox <denkpadje@gmail.com> -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. with Ada.Characters.Latin_1; with Ada.Strings.Fixed; package body Orka.Strings is package L renames Ada.Characters.Latin_1; package SF renames Ada.Strings.Fixed; function Trim (Value : String) return String is (SF.Trim (Value, Ada.Strings.Both)); function Strip_Line_Term (Value : String) return String is Last_Index : Natural := Value'Last; begin for Index in reverse Value'Range loop exit when Value (Index) not in L.LF | L.CR; Last_Index := Last_Index - 1; end loop; return Value (Value'First .. Last_Index); end Strip_Line_Term; function Lines (Value : String) return Positive is (SF.Count (Strip_Line_Term (Value), "" & L.LF) + 1); function Split (Value : String; Separator : String := " "; Maximum : Natural := 0) return String_List is Lines : constant String := Strip_Line_Term (Value); Index : Positive := Lines'First; Auto_Count : constant Positive := SF.Count (Lines, Separator) + 1; Count : constant Positive := (if Maximum > 0 then Positive'Min (Maximum, Auto_Count) else Auto_Count); begin return Result : String_List (1 .. Count) do for I in Result'First .. Result'Last - 1 loop declare Next_Index : constant Positive := SF.Index (Lines, Separator, Index); begin Result (I) := SU.To_Unbounded_String (Lines (Index .. Next_Index - 1)); Index := Next_Index + Separator'Length; end; end loop; Result (Result'Last) := SU.To_Unbounded_String (Lines (Index .. Lines'Last)); end return; end Split; function Join (List : String_List; Separator : String) return String is Result : SU.Unbounded_String; begin for Index in List'First .. List'Last - 1 loop SU.Append (Result, List (Index)); SU.Append (Result, Separator); end loop; SU.Append (Result, List (List'Last)); return +Result; end Join; end Orka.Strings;
----------------------------------------------------------------------- -- servlet-rest-operation -- REST API Operation Definition -- Copyright (C) 2017 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package body Servlet.Rest.Operation is URI_Mapping : aliased String := URI; Desc : aliased Static_Descriptor := (Next => null, Method => Method, Handler => Handler, Pattern => URI_Mapping'Access, Permission => Permission); function Definition return Descriptor_Access is begin return Desc'Access; end Definition; end Servlet.Rest.Operation;
-- Copyright 2017 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. name = "BuiltWith" type = "scrape" function start() setratelimit(3) end function vertical(ctx, domain) scrape(ctx, {url=buildurl(domain)}) end function buildurl(domain) return "https://builtwith.com/relationships/" .. domain end
---------------------------------------------------------------- -- ZLib for Ada thick binding. -- -- -- -- Copyright (C) 2002-2003 Dmitriy Anisimkov -- -- -- -- Open source license information is in the zlib.ads file. -- ---------------------------------------------------------------- -- Id: zlib-thin.adb,v 1.8 2003/12/14 18:27:31 vagul Exp package body ZLib.Thin is ZLIB_VERSION : constant Chars_Ptr := zlibVersion; Z_Stream_Size : constant Int := Z_Stream'Size / System.Storage_Unit; -------------- -- Avail_In -- -------------- function Avail_In (Strm : in Z_Stream) return UInt is begin return Strm.Avail_In; end Avail_In; --------------- -- Avail_Out -- --------------- function Avail_Out (Strm : in Z_Stream) return UInt is begin return Strm.Avail_Out; end Avail_Out; ------------------ -- Deflate_Init -- ------------------ function Deflate_Init (strm : Z_Streamp; level : Int; method : Int; windowBits : Int; memLevel : Int; strategy : Int) return Int is begin return deflateInit2 (strm, level, method, windowBits, memLevel, strategy, ZLIB_VERSION, Z_Stream_Size); end Deflate_Init; ------------------ -- Inflate_Init -- ------------------ function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int is begin return inflateInit2 (strm, windowBits, ZLIB_VERSION, Z_Stream_Size); end Inflate_Init; ------------------------ -- Last_Error_Message -- ------------------------ function Last_Error_Message (Strm : in Z_Stream) return String is use Interfaces.C.Strings; begin if Strm.msg = Null_Ptr then return ""; else return Value (Strm.msg); end if; end Last_Error_Message; ------------ -- Set_In -- ------------ procedure Set_In (Strm : in out Z_Stream; Buffer : in Voidp; Size : in UInt) is begin Strm.Next_In := Buffer; Strm.Avail_In := Size; end Set_In; ------------------ -- Set_Mem_Func -- ------------------ procedure Set_Mem_Func (Strm : in out Z_Stream; Opaque : in Voidp; Alloc : in alloc_func; Free : in free_func) is begin Strm.opaque := Opaque; Strm.zalloc := Alloc; Strm.zfree := Free; end Set_Mem_Func; ------------- -- Set_Out -- ------------- procedure Set_Out (Strm : in out Z_Stream; Buffer : in Voidp; Size : in UInt) is begin Strm.Next_Out := Buffer; Strm.Avail_Out := Size; end Set_Out; -------------- -- Total_In -- -------------- function Total_In (Strm : in Z_Stream) return ULong is begin return Strm.Total_In; end Total_In; --------------- -- Total_Out -- --------------- function Total_Out (Strm : in Z_Stream) return ULong is begin return Strm.Total_Out; end Total_Out; end ZLib.Thin;
-- This spec has been automatically generated from STM32WB55x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.LPTIM2 is pragma Preelaborate; --------------- -- Registers -- --------------- type ISR_Register is record CMPM : Boolean := False; ARRM : Boolean := False; EXTTRIG : Boolean := False; CMPOK : Boolean := False; ARROK : Boolean := False; UP : Boolean := False; DOWN : Boolean := False; -- unspecified Reserved_7_31 : HAL.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record CMPM at 0 range 0 .. 0; ARRM at 0 range 1 .. 1; EXTTRIG at 0 range 2 .. 2; CMPOK at 0 range 3 .. 3; ARROK at 0 range 4 .. 4; UP at 0 range 5 .. 5; DOWN at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; type ICR_Register is record CMPMCF : Boolean := False; ARRMCF : Boolean := False; EXTTRIGCF : Boolean := False; CMPOKCF : Boolean := False; ARROKCF : Boolean := False; UPCF : Boolean := False; DOWNCF : Boolean := False; -- unspecified Reserved_7_31 : HAL.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record CMPMCF at 0 range 0 .. 0; ARRMCF at 0 range 1 .. 1; EXTTRIGCF at 0 range 2 .. 2; CMPOKCF at 0 range 3 .. 3; ARROKCF at 0 range 4 .. 4; UPCF at 0 range 5 .. 5; DOWNCF at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; type IER_Register is record CMPMIE : Boolean := False; ARRMIE : Boolean := False; EXTTRIGIE : Boolean := False; CMPOKIE : Boolean := False; ARROKIE : Boolean := False; UPIE : Boolean := False; DOWNIE : Boolean := False; -- unspecified Reserved_7_31 : HAL.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IER_Register use record CMPMIE at 0 range 0 .. 0; ARRMIE at 0 range 1 .. 1; EXTTRIGIE at 0 range 2 .. 2; CMPOKIE at 0 range 3 .. 3; ARROKIE at 0 range 4 .. 4; UPIE at 0 range 5 .. 5; DOWNIE at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; subtype CFGR_CKPOL_Field is HAL.UInt2; subtype CFGR_CKFLT_Field is HAL.UInt2; subtype CFGR_TRGFLT_Field is HAL.UInt2; subtype CFGR_PRESC_Field is HAL.UInt3; subtype CFGR_TRIGSEL_Field is HAL.UInt3; subtype CFGR_TRIGEN_Field is HAL.UInt2; type CFGR_Register is record CKSEL : Boolean := False; CKPOL : CFGR_CKPOL_Field := 16#0#; CKFLT : CFGR_CKFLT_Field := 16#0#; -- unspecified Reserved_5_5 : HAL.Bit := 16#0#; TRGFLT : CFGR_TRGFLT_Field := 16#0#; -- unspecified Reserved_8_8 : HAL.Bit := 16#0#; PRESC : CFGR_PRESC_Field := 16#0#; -- unspecified Reserved_12_12 : HAL.Bit := 16#0#; TRIGSEL : CFGR_TRIGSEL_Field := 16#0#; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; TRIGEN : CFGR_TRIGEN_Field := 16#0#; TIMOUT : Boolean := False; WAVE : Boolean := False; WAVEPOL : Boolean := False; PRELOAD : Boolean := False; COUNTMODE : Boolean := False; ENC : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record CKSEL at 0 range 0 .. 0; CKPOL at 0 range 1 .. 2; CKFLT at 0 range 3 .. 4; Reserved_5_5 at 0 range 5 .. 5; TRGFLT at 0 range 6 .. 7; Reserved_8_8 at 0 range 8 .. 8; PRESC at 0 range 9 .. 11; Reserved_12_12 at 0 range 12 .. 12; TRIGSEL at 0 range 13 .. 15; Reserved_16_16 at 0 range 16 .. 16; TRIGEN at 0 range 17 .. 18; TIMOUT at 0 range 19 .. 19; WAVE at 0 range 20 .. 20; WAVEPOL at 0 range 21 .. 21; PRELOAD at 0 range 22 .. 22; COUNTMODE at 0 range 23 .. 23; ENC at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; type CR_Register is record ENABLE : Boolean := False; SNGSTRT : Boolean := False; CNTSTRT : Boolean := False; COUNTRST : Boolean := False; RSTARE : Boolean := False; -- unspecified Reserved_5_31 : HAL.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record ENABLE at 0 range 0 .. 0; SNGSTRT at 0 range 1 .. 1; CNTSTRT at 0 range 2 .. 2; COUNTRST at 0 range 3 .. 3; RSTARE at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; subtype CMP_CMP_Field is HAL.UInt16; type CMP_Register is record CMP : CMP_CMP_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CMP_Register use record CMP at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype ARR_ARR_Field is HAL.UInt16; type ARR_Register is record ARR : ARR_ARR_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ARR_Register use record ARR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CNT_CNT_Field is HAL.UInt16; type CNT_Register is record CNT : CNT_CNT_Field := 16#0#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CNT_Register use record CNT at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; type OR_Register is record OR_0 : Boolean := False; OR_1 : Boolean := False; -- unspecified Reserved_2_31 : HAL.UInt30 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for OR_Register use record OR_0 at 0 range 0 .. 0; OR_1 at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; ----------------- -- Peripherals -- ----------------- type LPTIM2_Peripheral is record ISR : aliased ISR_Register; ICR : aliased ICR_Register; IER : aliased IER_Register; CFGR : aliased CFGR_Register; CR : aliased CR_Register; CMP : aliased CMP_Register; ARR : aliased ARR_Register; CNT : aliased CNT_Register; OR_k : aliased OR_Register; end record with Volatile; for LPTIM2_Peripheral use record ISR at 16#0# range 0 .. 31; ICR at 16#4# range 0 .. 31; IER at 16#8# range 0 .. 31; CFGR at 16#C# range 0 .. 31; CR at 16#10# range 0 .. 31; CMP at 16#14# range 0 .. 31; ARR at 16#18# range 0 .. 31; CNT at 16#1C# range 0 .. 31; OR_k at 16#20# range 0 .. 31; end record; LPTIM2_Periph : aliased LPTIM2_Peripheral with Import, Address => System'To_Address (16#40008000#); end STM32_SVD.LPTIM2;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ package AMF.Internals.Tables.UML_Metamodel.Objects is procedure Initialize; private procedure Initialize_1 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_5 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_6 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_7 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_8 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_9 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_10 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_11 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_12 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_13 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_14 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_15 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_16 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_17 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_18 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_19 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_20 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_21 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_22 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_23 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_24 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_25 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_26 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_27 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_28 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_29 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_30 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_31 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_32 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_33 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_34 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_35 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_36 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_37 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_38 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_39 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_40 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_41 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_42 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_43 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_44 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_45 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_46 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_47 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_48 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_49 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_50 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_51 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_52 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_53 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_54 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_55 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_56 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_57 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_58 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_59 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_60 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_61 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_62 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_63 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_64 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_65 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_66 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_67 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_68 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_69 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_70 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_71 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_72 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_73 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_74 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_75 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_76 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_77 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_78 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_79 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_80 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_81 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_82 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_83 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_84 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_85 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_86 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_87 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_88 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_89 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_90 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_91 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_92 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_93 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_94 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_95 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_96 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_97 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_98 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_99 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_100 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_101 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_102 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_103 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_104 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_105 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_106 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_107 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_108 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_109 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_110 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_111 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_112 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_113 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_114 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_115 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_116 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_117 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_118 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_119 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_120 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_121 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_122 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_123 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_124 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_125 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_126 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_127 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_128 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_129 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_130 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_131 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_132 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_133 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_134 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_135 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_136 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_137 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_138 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_139 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_140 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_141 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_142 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_143 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_144 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_145 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_146 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_147 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_148 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_149 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_150 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_151 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_152 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_153 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_154 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_155 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_156 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_157 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_158 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_159 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_160 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_161 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_162 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_163 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_164 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_165 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_166 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_167 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_168 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_169 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_170 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_171 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_172 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_173 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_174 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_175 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_176 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_177 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_178 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_179 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_180 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_181 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_182 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_183 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_184 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_185 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_186 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_187 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_188 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_189 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_190 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_191 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_192 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_193 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_194 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_195 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_196 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_197 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_198 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_199 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_200 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_201 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_202 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_203 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_204 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_205 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_206 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_207 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_208 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_209 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_210 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_211 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_212 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_213 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_214 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_215 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_216 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_217 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_218 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_219 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_220 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_221 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_222 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_223 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_224 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_225 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_226 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_227 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_228 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_229 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_230 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_231 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_232 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_233 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_234 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_235 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_236 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_237 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_238 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_239 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_240 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_241 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_242 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_243 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_244 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_245 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_246 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_247 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_248 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_249 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_250 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_251 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_252 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_253 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_254 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_255 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_256 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_257 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_258 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_259 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_260 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_261 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_262 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_263 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_264 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_265 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_266 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_267 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_268 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_269 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_270 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_271 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_272 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_273 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_274 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_275 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_276 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_277 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_278 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_279 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_280 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_281 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_282 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_283 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_284 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_285 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_286 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_287 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_288 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_289 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_290 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_291 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_292 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_293 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_294 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_295 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_296 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_297 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_298 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_299 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_300 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_301 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_302 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_303 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_304 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_305 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_306 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_307 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_308 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_309 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_310 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_311 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_312 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_313 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_314 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_315 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_316 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_317 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_318 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_319 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_320 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_321 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_322 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_323 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_324 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_325 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_326 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_327 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_328 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_329 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_330 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_331 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_332 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_333 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_334 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_335 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_336 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_337 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_338 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_339 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_340 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_341 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_342 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_343 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_344 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_345 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_346 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_347 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_348 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_349 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_350 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_351 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_352 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_353 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_354 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_355 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_356 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_357 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_358 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_359 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_360 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_361 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_362 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_363 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_364 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_365 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_366 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_367 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_368 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_369 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_370 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_371 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_372 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_373 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_374 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_375 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_376 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_377 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_378 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_379 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_380 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_381 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_382 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_383 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_384 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_385 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_386 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_387 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_388 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_389 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_390 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_391 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_392 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_393 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_394 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_395 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_396 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_397 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_398 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_399 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_400 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_401 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_402 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_403 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_404 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_405 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_406 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_407 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_408 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_409 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_410 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_411 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_412 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_413 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_414 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_415 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_416 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_417 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_418 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_419 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_420 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_421 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_422 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_423 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_424 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_425 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_426 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_427 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_428 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_429 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_430 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_431 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_432 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_433 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_434 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_435 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_436 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_437 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_438 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_439 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_440 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_441 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_442 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_443 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_444 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_445 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_446 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_447 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_448 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_449 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_450 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_451 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_452 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_453 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_454 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_455 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_456 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_457 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_458 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_459 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_460 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_461 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_462 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_463 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_464 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_465 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_466 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_467 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_468 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_469 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_470 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_471 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_472 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_473 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_474 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_475 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_476 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_477 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_478 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_479 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_480 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_481 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_482 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_483 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_484 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_485 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_486 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_487 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_488 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_489 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_490 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_491 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_492 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_493 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_494 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_495 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_496 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_497 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_498 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_499 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_500 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_501 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_502 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_503 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_504 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_505 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_506 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_507 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_508 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_509 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_510 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_511 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_512 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_513 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_514 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_515 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_516 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_517 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_518 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_519 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_520 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_521 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_522 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_523 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_524 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_525 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_526 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_527 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_528 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_529 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_530 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_531 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_532 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_533 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_534 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_535 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_536 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_537 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_538 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_539 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_540 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_541 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_542 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_543 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_544 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_545 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_546 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_547 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_548 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_549 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_550 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_551 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_552 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_553 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_554 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_555 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_556 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_557 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_558 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_559 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_560 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_561 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_562 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_563 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_564 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_565 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_566 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_567 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_568 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_569 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_570 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_571 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_572 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_573 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_574 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_575 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_576 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_577 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_578 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_579 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_580 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_581 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_582 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_583 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_584 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_585 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_586 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_587 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_588 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_589 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_590 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_591 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_592 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_593 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_594 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_595 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_596 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_597 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_598 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_599 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_600 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_601 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_602 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_603 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_604 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_605 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_606 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_607 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_608 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_609 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_610 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_611 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_612 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_613 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_614 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_615 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_616 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_617 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_618 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_619 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_620 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_621 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_622 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_623 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_624 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_625 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_626 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_627 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_628 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_629 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_630 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_631 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_632 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_633 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_634 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_635 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_636 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_637 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_638 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_639 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_640 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_641 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_642 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_643 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_644 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_645 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_646 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_647 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_648 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_649 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_650 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_651 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_652 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_653 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_654 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_655 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_656 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_657 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_658 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_659 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_660 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_661 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_662 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_663 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_664 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_665 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_666 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_667 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_668 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_669 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_670 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_671 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_672 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_673 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_674 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_675 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_676 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_677 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_678 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_679 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_680 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_681 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_682 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_683 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_684 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_685 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_686 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_687 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_688 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_689 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_690 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_691 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_692 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_693 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_694 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_695 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_696 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_697 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_698 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_699 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_700 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_701 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_702 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_703 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_704 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_705 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_706 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_707 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_708 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_709 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_710 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_711 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_712 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_713 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_714 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_715 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_716 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_717 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_718 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_719 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_720 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_721 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_722 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_723 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_724 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_725 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_726 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_727 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_728 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_729 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_730 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_731 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_732 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_733 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_734 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_735 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_736 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_737 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_738 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_739 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_740 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_741 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_742 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_743 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_744 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_745 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_746 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_747 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_748 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_749 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_750 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_751 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_752 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_753 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_754 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_755 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_756 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_757 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_758 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_759 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_760 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_761 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_762 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_763 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_764 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_765 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_766 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_767 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_768 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_769 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_770 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_771 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_772 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_773 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_774 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_775 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_776 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_777 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_778 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_779 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_780 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_781 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_782 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_783 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_784 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_785 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_786 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_787 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_788 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_789 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_790 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_791 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_792 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_793 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_794 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_795 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_796 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_797 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_798 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_799 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_800 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_801 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_802 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_803 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_804 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_805 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_806 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_807 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_808 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_809 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_810 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_811 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_812 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_813 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_814 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_815 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_816 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_817 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_818 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_819 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_820 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_821 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_822 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_823 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_824 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_825 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_826 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_827 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_828 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_829 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_830 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_831 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_832 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_833 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_834 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_835 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_836 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_837 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_838 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_839 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_840 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_841 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_842 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_843 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_844 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_845 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_846 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_847 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_848 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_849 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_850 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_851 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_852 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_853 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_854 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_855 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_856 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_857 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_858 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_859 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_860 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_861 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_862 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_863 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_864 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_865 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_866 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_867 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_868 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_869 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_870 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_871 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_872 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_873 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_874 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_875 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_876 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_877 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_878 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_879 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_880 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_881 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_882 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_883 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_884 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_885 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_886 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_887 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_888 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_889 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_890 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_891 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_892 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_893 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_894 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_895 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_896 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_897 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_898 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_899 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_900 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_901 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_902 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_903 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_904 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_905 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_906 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_907 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_908 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_909 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_910 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_911 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_912 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_913 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_914 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_915 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_916 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_917 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_918 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_919 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_920 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_921 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_922 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_923 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_924 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_925 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_926 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_927 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_928 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_929 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_930 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_931 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_932 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_933 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_934 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_935 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_936 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_937 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_938 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_939 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_940 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_941 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_942 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_943 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_944 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_945 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_946 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_947 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_948 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_949 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_950 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_951 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_952 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_953 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_954 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_955 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_956 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_957 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_958 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_959 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_960 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_961 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_962 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_963 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_964 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_965 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_966 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_967 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_968 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_969 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_970 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_971 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_972 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_973 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_974 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_975 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_976 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_977 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_978 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_979 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_980 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_981 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_982 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_983 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_984 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_985 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_986 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_987 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_988 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_989 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_990 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_991 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_992 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_993 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_994 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_995 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_996 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_997 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_998 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_999 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1000 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1001 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1002 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1003 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1004 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1005 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1006 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1007 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1008 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1009 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1010 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1011 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1012 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1013 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1014 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1015 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1016 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1017 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1018 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1019 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1020 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1021 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1022 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1023 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1024 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1025 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1026 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1027 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1028 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1029 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1030 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1031 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1032 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1033 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1034 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1035 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1036 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1037 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1038 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1039 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1040 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1041 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1042 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1043 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1044 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1045 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1046 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1047 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1048 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1049 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1050 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1051 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1052 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1053 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1054 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1055 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1056 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1057 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1058 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1059 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1060 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1061 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1062 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1063 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1064 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1065 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1066 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1067 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1068 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1069 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1070 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1071 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1072 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1073 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1074 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1075 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1076 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1077 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1078 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1079 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1080 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1081 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1082 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1083 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1084 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1085 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1086 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1087 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1088 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1089 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1090 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1091 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1092 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1093 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1094 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1095 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1096 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1097 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1098 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1099 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1100 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1101 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1102 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1103 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1104 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1105 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1106 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1107 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1108 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1109 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1110 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1111 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1112 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1113 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1114 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1115 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1116 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1117 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1118 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1119 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1120 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1121 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1122 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1123 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1124 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1125 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1126 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1127 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1128 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1129 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1130 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1131 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1132 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1133 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1134 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1135 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1136 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1137 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1138 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1139 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1140 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1141 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1142 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1143 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1144 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1145 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1146 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1147 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1148 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1149 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1150 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1151 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1152 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1153 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1154 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1155 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1156 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1157 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1158 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1159 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1160 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1161 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1162 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1163 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1164 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1165 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1166 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1167 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1168 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1169 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1170 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1171 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1172 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1173 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1174 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1175 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1176 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1177 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1178 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1179 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1180 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1181 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1182 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1183 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1184 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1185 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1186 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1187 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1188 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1189 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1190 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1191 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1192 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1193 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1194 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1195 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1196 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1197 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1198 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1199 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1200 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1201 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1202 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1203 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1204 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1205 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1206 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1207 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1208 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1209 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1210 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1211 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1212 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1213 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1214 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1215 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1216 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1217 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1218 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1219 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1220 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1221 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1222 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1223 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1224 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1225 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1226 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1227 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1228 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1229 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1230 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1231 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1232 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1233 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1234 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1235 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1236 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1237 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1238 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1239 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1240 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1241 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1242 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1243 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1244 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1245 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1246 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1247 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1248 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1249 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1250 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1251 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1252 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1253 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1254 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1255 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1256 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1257 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1258 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1259 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1260 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1261 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1262 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1263 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1264 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1265 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1266 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1267 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1268 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1269 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1270 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1271 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1272 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1273 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1274 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1275 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1276 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1277 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1278 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1279 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1280 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1281 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1282 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1283 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1284 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1285 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1286 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1287 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1288 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1289 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1290 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1291 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1292 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1293 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1294 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1295 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1296 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1297 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1298 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1299 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1300 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1301 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1302 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1303 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1304 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1305 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1306 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1307 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1308 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1309 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1310 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1311 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1312 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1313 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1314 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1315 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1316 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1317 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1318 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1319 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1320 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1321 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1322 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1323 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1324 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1325 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1326 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1327 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1328 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1329 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1330 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1331 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1332 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1333 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1334 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1335 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1336 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1337 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1338 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1339 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1340 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1341 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1342 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1343 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1344 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1345 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1346 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1347 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1348 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1349 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1350 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1351 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1352 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1353 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1354 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1355 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1356 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1357 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1358 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1359 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1360 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1361 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1362 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1363 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1364 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1365 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1366 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1367 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1368 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1369 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1370 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1371 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1372 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1373 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1374 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1375 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1376 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1377 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1378 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1379 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1380 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1381 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1382 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1383 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1384 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1385 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1386 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1387 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1388 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1389 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1390 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1391 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1392 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1393 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1394 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1395 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1396 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1397 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1398 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1399 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1400 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1401 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1402 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1403 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1404 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1405 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1406 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1407 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1408 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1409 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1410 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1411 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1412 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1413 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1414 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1415 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1416 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1417 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1418 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1419 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1420 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1421 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1422 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1423 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1424 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1425 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1426 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1427 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1428 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1429 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1430 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1431 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1432 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1433 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1434 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1435 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1436 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1437 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1438 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1439 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1440 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1441 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1442 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1443 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1444 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1445 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1446 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1447 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1448 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1449 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1450 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1451 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1452 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1453 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1454 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1455 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1456 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1457 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1458 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1459 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1460 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1461 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1462 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1463 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1464 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1465 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1466 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1467 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1468 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1469 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1470 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1471 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1472 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1473 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1474 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1475 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1476 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1477 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1478 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1479 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1480 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1481 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1482 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1483 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1484 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1485 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1486 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1487 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1488 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1489 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1490 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1491 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1492 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1493 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1494 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1495 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1496 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1497 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1498 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1499 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1500 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1501 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1502 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1503 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1504 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1505 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1506 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1507 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1508 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1509 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1510 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1511 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1512 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1513 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1514 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1515 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1516 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1517 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1518 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1519 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1520 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1521 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1522 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1523 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1524 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1525 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1526 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1527 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1528 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1529 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1530 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1531 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1532 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1533 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1534 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1535 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1536 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1537 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1538 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1539 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1540 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1541 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1542 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1543 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1544 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1545 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1546 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1547 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1548 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1549 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1550 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1551 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1552 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1553 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1554 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1555 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1556 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1557 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1558 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1559 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1560 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1561 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1562 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1563 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1564 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1565 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1566 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1567 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1568 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1569 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1570 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1571 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1572 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1573 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1574 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1575 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1576 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1577 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1578 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1579 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1580 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1581 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1582 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1583 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1584 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1585 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1586 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1587 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1588 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1589 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1590 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1591 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1592 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1593 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1594 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1595 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1596 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1597 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1598 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1599 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1600 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1601 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1602 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1603 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1604 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1605 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1606 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1607 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1608 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1609 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1610 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1611 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1612 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1613 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1614 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1615 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1616 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1617 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1618 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1619 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1620 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1621 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1622 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1623 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1624 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1625 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1626 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1627 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1628 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1629 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1630 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1631 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1632 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1633 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1634 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1635 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1636 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1637 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1638 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1639 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1640 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1641 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1642 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1643 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1644 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1645 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1646 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1647 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1648 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1649 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1650 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1651 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1652 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1653 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1654 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1655 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1656 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1657 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1658 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1659 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1660 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1661 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1662 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1663 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1664 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1665 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1666 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1667 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1668 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1669 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1670 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1671 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1672 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1673 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1674 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1675 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1676 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1677 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1678 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1679 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1680 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1681 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1682 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1683 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1684 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1685 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1686 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1687 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1688 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1689 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1690 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1691 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1692 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1693 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1694 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1695 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1696 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1697 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1698 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1699 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1700 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1701 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1702 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1703 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1704 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1705 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1706 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1707 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1708 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1709 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1710 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1711 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1712 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1713 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1714 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1715 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1716 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1717 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1718 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1719 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1720 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1721 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1722 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1723 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1724 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1725 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1726 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1727 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1728 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1729 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1730 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1731 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1732 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1733 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1734 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1735 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1736 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1737 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1738 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1739 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1740 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1741 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1742 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1743 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1744 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1745 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1746 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1747 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1748 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1749 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1750 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1751 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1752 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1753 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1754 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1755 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1756 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1757 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1758 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1759 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1760 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1761 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1762 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1763 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1764 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1765 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1766 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1767 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1768 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1769 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1770 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1771 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1772 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1773 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1774 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1775 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1776 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1777 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1778 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1779 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1780 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1781 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1782 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1783 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1784 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1785 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1786 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1787 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1788 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1789 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1790 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1791 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1792 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1793 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1794 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1795 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1796 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1797 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1798 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1799 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1800 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1801 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1802 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1803 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1804 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1805 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1806 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1807 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1808 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1809 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1810 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1811 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1812 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1813 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1814 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1815 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1816 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1817 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1818 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1819 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1820 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1821 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1822 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1823 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1824 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1825 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1826 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1827 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1828 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1829 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1830 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1831 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1832 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1833 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1834 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1835 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1836 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1837 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1838 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1839 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1840 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1841 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1842 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1843 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1844 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1845 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1846 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1847 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1848 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1849 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1850 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1851 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1852 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1853 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1854 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1855 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1856 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1857 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1858 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1859 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1860 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1861 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1862 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1863 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1864 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1865 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1866 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1867 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1868 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1869 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1870 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1871 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1872 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1873 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1874 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1875 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1876 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1877 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1878 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1879 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1880 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1881 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1882 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1883 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1884 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1885 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1886 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1887 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1888 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1889 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1890 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1891 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1892 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1893 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1894 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1895 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1896 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1897 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1898 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1899 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1900 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1901 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1902 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1903 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1904 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1905 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1906 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1907 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1908 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1909 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1910 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1911 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1912 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1913 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1914 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1915 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1916 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1917 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1918 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1919 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1920 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1921 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1922 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1923 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1924 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1925 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1926 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1927 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1928 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1929 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1930 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1931 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1932 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1933 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1934 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1935 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1936 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1937 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1938 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1939 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1940 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1941 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1942 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1943 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1944 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1945 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1946 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1947 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1948 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1949 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1950 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1951 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1952 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1953 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1954 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1955 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1956 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1957 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1958 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1959 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1960 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1961 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1962 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1963 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1964 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1965 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1966 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1967 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1968 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1969 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1970 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1971 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1972 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1973 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1974 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1975 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1976 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1977 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1978 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1979 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1980 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1981 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1982 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1983 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1984 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1985 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1986 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1987 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1988 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1989 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1990 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1991 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1992 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1993 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1994 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1995 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1996 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1997 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1998 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_1999 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2000 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2001 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2002 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2003 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2004 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2005 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2006 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2007 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2008 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2009 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2010 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2011 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2012 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2013 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2014 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2015 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2016 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2017 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2018 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2019 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2020 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2021 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2022 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2023 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2024 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2025 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2026 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2027 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2028 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2029 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2030 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2031 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2032 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2033 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2034 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2035 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2036 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2037 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2038 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2039 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2040 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2041 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2042 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2043 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2044 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2045 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2046 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2047 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2048 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2049 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2050 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2051 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2052 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2053 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2054 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2055 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2056 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2057 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2058 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2059 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2060 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2061 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2062 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2063 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2064 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2065 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2066 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2067 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2068 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2069 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2070 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2071 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2072 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2073 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2074 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2075 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2076 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2077 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2078 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2079 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2080 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2081 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2082 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2083 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2084 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2085 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2086 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2087 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2088 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2089 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2090 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2091 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2092 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2093 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2094 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2095 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2096 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2097 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2098 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2099 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2100 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2101 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2102 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2103 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2104 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2105 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2106 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2107 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2108 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2109 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2110 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2111 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2112 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2113 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2114 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2115 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2116 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2117 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2118 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2119 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2120 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2121 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2122 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2123 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2124 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2125 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2126 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2127 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2128 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2129 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2130 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2131 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2132 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2133 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2134 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2135 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2136 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2137 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2138 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2139 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2140 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2141 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2142 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2143 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2144 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2145 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2146 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2147 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2148 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2149 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2150 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2151 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2152 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2153 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2154 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2155 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2156 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2157 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2158 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2159 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2160 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2161 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2162 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2163 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2164 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2165 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2166 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2167 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2168 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2169 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2170 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2171 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2172 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2173 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2174 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2175 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2176 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2177 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2178 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2179 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2180 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2181 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2182 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2183 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2184 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2185 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2186 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2187 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2188 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2189 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2190 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2191 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2192 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2193 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2194 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2195 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2196 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2197 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2198 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2199 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2200 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2201 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2202 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2203 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2204 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2205 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2206 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2207 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2208 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2209 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2210 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2211 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2212 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2213 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2214 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2215 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2216 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2217 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2218 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2219 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2220 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2221 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2222 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2223 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2224 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2225 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2226 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2227 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2228 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2229 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2230 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2231 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2232 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2233 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2234 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2235 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2236 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2237 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2238 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2239 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2240 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2241 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2242 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2243 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2244 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2245 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2246 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2247 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2248 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2249 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2250 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2251 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2252 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2253 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2254 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2255 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2256 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2257 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2258 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2259 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2260 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2261 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2262 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2263 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2264 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2265 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2266 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2267 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2268 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2269 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2270 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2271 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2272 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2273 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2274 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2275 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2276 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2277 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2278 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2279 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2280 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2281 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2282 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2283 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2284 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2285 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2286 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2287 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2288 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2289 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2290 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2291 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2292 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2293 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2294 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2295 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2296 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2297 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2298 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2299 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2300 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2301 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2302 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2303 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2304 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2305 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2306 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2307 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2308 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2309 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2310 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2311 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2312 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2313 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2314 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2315 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2316 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2317 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2318 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2319 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2320 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2321 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2322 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2323 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2324 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2325 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2326 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2327 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2328 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2329 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2330 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2331 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2332 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2333 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2334 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2335 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2336 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2337 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2338 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2339 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2340 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2341 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2342 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2343 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2344 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2345 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2346 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2347 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2348 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2349 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2350 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2351 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2352 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2353 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2354 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2355 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2356 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2357 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2358 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2359 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2360 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2361 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2362 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2363 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2364 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2365 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2366 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2367 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2368 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2369 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2370 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2371 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2372 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2373 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2374 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2375 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2376 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2377 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2378 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2379 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2380 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2381 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2382 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2383 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2384 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2385 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2386 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2387 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2388 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2389 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2390 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2391 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2392 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2393 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2394 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2395 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2396 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2397 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2398 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2399 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2400 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2401 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2402 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2403 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2404 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2405 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2406 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2407 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2408 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2409 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2410 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2411 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2412 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2413 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2414 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2415 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2416 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2417 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2418 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2419 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2420 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2421 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2422 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2423 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2424 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2425 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2426 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2427 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2428 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2429 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2430 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2431 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2432 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2433 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2434 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2435 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2436 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2437 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2438 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2439 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2440 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2441 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2442 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2443 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2444 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2445 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2446 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2447 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2448 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2449 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2450 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2451 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2452 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2453 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2454 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2455 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2456 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2457 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2458 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2459 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2460 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2461 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2462 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2463 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2464 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2465 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2466 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2467 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2468 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2469 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2470 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2471 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2472 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2473 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2474 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2475 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2476 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2477 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2478 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2479 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2480 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2481 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2482 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2483 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2484 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2485 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2486 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2487 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2488 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2489 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2490 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2491 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2492 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2493 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2494 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2495 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2496 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2497 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2498 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2499 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2500 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2501 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2502 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2503 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2504 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2505 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2506 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2507 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2508 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2509 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2510 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2511 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2512 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2513 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2514 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2515 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2516 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2517 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2518 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2519 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2520 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2521 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2522 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2523 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2524 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2525 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2526 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2527 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2528 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2529 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2530 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2531 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2532 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2533 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2534 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2535 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2536 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2537 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2538 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2539 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2540 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2541 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2542 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2543 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2544 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2545 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2546 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2547 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2548 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2549 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2550 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2551 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2552 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2553 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2554 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2555 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2556 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2557 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2558 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2559 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2560 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2561 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2562 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2563 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2564 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2565 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2566 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2567 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2568 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2569 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2570 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2571 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2572 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2573 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2574 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2575 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2576 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2577 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2578 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2579 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2580 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2581 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2582 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2583 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2584 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2585 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2586 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2587 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2588 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2589 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2590 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2591 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2592 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2593 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2594 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2595 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2596 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2597 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2598 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2599 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2600 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2601 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2602 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2603 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2604 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2605 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2606 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2607 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2608 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2609 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2610 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2611 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2612 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2613 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2614 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2615 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2616 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2617 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2618 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2619 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2620 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2621 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2622 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2623 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2624 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2625 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2626 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2627 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2628 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2629 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2630 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2631 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2632 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2633 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2634 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2635 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2636 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2637 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2638 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2639 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2640 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2641 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2642 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2643 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2644 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2645 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2646 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2647 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2648 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2649 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2650 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2651 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2652 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2653 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2654 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2655 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2656 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2657 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2658 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2659 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2660 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2661 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2662 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2663 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2664 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2665 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2666 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2667 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2668 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2669 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2670 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2671 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2672 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2673 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2674 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2675 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2676 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2677 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2678 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2679 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2680 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2681 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2682 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2683 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2684 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2685 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2686 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2687 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2688 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2689 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2690 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2691 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2692 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2693 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2694 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2695 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2696 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2697 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2698 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2699 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2700 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2701 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2702 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2703 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2704 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2705 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2706 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2707 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2708 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2709 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2710 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2711 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2712 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2713 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2714 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2715 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2716 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2717 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2718 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2719 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2720 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2721 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2722 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2723 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2724 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2725 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2726 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2727 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2728 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2729 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2730 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2731 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2732 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2733 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2734 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2735 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2736 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2737 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2738 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2739 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2740 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2741 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2742 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2743 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2744 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2745 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2746 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2747 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2748 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2749 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2750 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2751 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2752 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2753 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2754 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2755 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2756 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2757 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2758 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2759 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2760 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2761 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2762 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2763 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2764 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2765 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2766 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2767 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2768 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2769 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2770 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2771 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2772 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2773 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2774 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2775 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2776 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2777 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2778 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2779 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2780 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2781 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2782 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2783 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2784 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2785 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2786 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2787 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2788 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2789 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2790 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2791 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2792 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2793 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2794 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2795 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2796 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2797 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2798 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2799 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2800 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2801 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2802 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2803 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2804 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2805 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2806 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2807 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2808 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2809 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2810 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2811 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2812 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2813 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2814 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2815 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2816 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2817 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2818 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2819 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2820 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2821 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2822 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2823 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2824 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2825 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2826 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2827 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2828 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2829 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2830 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2831 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2832 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2833 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2834 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2835 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2836 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2837 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2838 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2839 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2840 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2841 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2842 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2843 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2844 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2845 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2846 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2847 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2848 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2849 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2850 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2851 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2852 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2853 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2854 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2855 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2856 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2857 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2858 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2859 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2860 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2861 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2862 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2863 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2864 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2865 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2866 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2867 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2868 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2869 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2870 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2871 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2872 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2873 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2874 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2875 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2876 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2877 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2878 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2879 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2880 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2881 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2882 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2883 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2884 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2885 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2886 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2887 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2888 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2889 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2890 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2891 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2892 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2893 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2894 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2895 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2896 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2897 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2898 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2899 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2900 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2901 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2902 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2903 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2904 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2905 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2906 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2907 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2908 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2909 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2910 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2911 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2912 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2913 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2914 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2915 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2916 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2917 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2918 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2919 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2920 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2921 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2922 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2923 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2924 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2925 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2926 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2927 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2928 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2929 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2930 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2931 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2932 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2933 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2934 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2935 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2936 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2937 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2938 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2939 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2940 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2941 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2942 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2943 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2944 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2945 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2946 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2947 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2948 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2949 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2950 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2951 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2952 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2953 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2954 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2955 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2956 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2957 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2958 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2959 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2960 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2961 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2962 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2963 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2964 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2965 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2966 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2967 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2968 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2969 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2970 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2971 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2972 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2973 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2974 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2975 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2976 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2977 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2978 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2979 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2980 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2981 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2982 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2983 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2984 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2985 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2986 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2987 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2988 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2989 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2990 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2991 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2992 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2993 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2994 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2995 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2996 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2997 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2998 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_2999 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3000 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3001 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3002 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3003 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3004 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3005 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3006 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3007 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3008 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3009 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3010 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3011 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3012 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3013 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3014 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3015 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3016 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3017 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3018 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3019 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3020 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3021 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3022 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3023 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3024 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3025 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3026 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3027 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3028 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3029 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3030 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3031 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3032 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3033 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3034 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3035 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3036 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3037 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3038 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3039 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3040 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3041 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3042 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3043 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3044 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3045 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3046 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3047 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3048 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3049 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3050 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3051 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3052 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3053 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3054 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3055 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3056 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3057 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3058 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3059 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3060 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3061 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3062 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3063 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3064 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3065 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3066 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3067 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3068 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3069 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3070 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3071 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3072 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3073 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3074 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3075 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3076 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3077 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3078 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3079 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3080 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3081 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3082 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3083 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3084 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3085 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3086 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3087 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3088 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3089 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3090 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3091 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3092 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3093 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3094 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3095 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3096 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3097 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3098 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3099 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3100 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3101 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3102 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3103 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3104 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3105 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3106 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3107 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3108 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3109 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3110 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3111 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3112 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3113 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3114 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3115 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3116 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3117 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3118 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3119 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3120 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3121 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3122 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3123 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3124 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3125 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3126 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3127 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3128 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3129 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3130 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3131 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3132 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3133 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3134 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3135 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3136 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3137 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3138 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3139 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3140 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3141 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3142 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3143 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3144 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3145 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3146 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3147 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3148 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3149 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3150 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3151 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3152 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3153 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3154 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3155 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3156 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3157 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3158 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3159 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3160 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3161 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3162 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3163 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3164 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3165 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3166 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3167 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3168 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3169 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3170 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3171 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3172 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3173 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3174 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3175 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3176 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3177 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3178 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3179 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3180 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3181 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3182 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3183 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3184 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3185 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3186 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3187 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3188 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3189 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3190 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3191 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3192 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3193 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3194 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3195 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3196 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3197 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3198 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3199 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3200 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3201 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3202 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3203 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3204 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3205 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3206 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3207 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3208 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3209 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3210 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3211 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3212 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3213 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3214 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3215 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3216 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3217 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3218 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3219 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3220 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3221 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3222 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3223 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3224 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3225 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3226 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3227 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3228 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3229 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3230 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3231 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3232 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3233 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3234 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3235 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3236 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3237 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3238 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3239 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3240 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3241 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3242 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3243 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3244 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3245 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3246 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3247 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3248 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3249 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3250 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3251 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3252 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3253 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3254 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3255 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3256 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3257 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3258 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3259 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3260 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3261 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3262 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3263 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3264 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3265 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3266 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3267 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3268 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3269 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3270 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3271 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3272 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3273 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3274 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3275 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3276 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3277 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3278 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3279 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3280 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3281 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3282 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3283 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3284 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3285 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3286 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3287 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3288 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3289 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3290 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3291 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3292 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3293 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3294 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3295 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3296 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3297 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3298 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3299 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3300 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3301 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3302 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3303 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3304 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3305 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3306 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3307 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3308 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3309 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3310 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3311 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3312 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3313 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3314 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3315 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3316 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3317 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3318 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3319 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3320 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3321 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3322 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3323 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3324 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3325 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3326 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3327 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3328 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3329 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3330 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3331 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3332 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3333 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3334 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3335 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3336 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3337 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3338 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3339 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3340 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3341 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3342 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3343 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3344 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3345 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3346 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3347 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3348 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3349 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3350 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3351 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3352 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3353 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3354 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3355 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3356 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3357 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3358 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3359 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3360 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3361 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3362 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3363 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3364 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3365 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3366 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3367 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3368 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3369 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3370 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3371 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3372 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3373 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3374 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3375 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3376 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3377 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3378 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3379 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3380 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3381 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3382 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3383 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3384 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3385 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3386 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3387 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3388 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3389 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3390 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3391 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3392 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3393 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3394 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3395 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3396 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3397 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3398 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3399 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3400 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3401 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3402 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3403 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3404 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3405 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3406 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3407 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3408 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3409 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3410 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3411 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3412 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3413 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3414 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3415 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3416 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3417 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3418 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3419 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3420 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3421 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3422 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3423 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3424 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3425 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3426 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3427 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3428 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3429 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3430 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3431 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3432 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3433 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3434 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3435 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3436 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3437 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3438 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3439 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3440 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3441 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3442 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3443 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3444 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3445 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3446 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3447 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3448 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3449 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3450 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3451 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3452 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3453 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3454 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3455 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3456 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3457 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3458 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3459 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3460 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3461 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3462 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3463 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3464 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3465 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3466 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3467 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3468 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3469 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3470 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3471 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3472 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3473 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3474 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3475 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3476 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3477 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3478 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3479 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3480 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3481 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3482 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3483 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3484 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3485 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3486 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3487 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3488 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3489 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3490 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3491 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3492 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3493 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3494 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3495 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3496 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3497 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3498 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3499 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3500 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3501 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3502 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3503 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3504 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3505 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3506 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3507 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3508 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3509 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3510 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3511 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3512 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3513 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3514 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3515 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3516 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3517 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3518 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3519 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3520 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3521 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3522 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3523 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3524 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3525 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3526 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3527 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3528 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3529 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3530 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3531 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3532 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3533 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3534 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3535 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3536 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3537 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3538 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3539 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3540 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3541 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3542 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3543 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3544 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3545 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3546 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3547 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3548 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3549 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3550 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3551 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3552 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3553 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3554 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3555 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3556 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3557 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3558 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3559 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3560 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3561 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3562 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3563 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3564 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3565 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3566 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3567 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3568 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3569 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3570 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3571 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3572 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3573 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3574 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3575 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3576 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3577 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3578 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3579 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3580 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3581 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3582 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3583 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3584 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3585 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3586 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3587 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3588 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3589 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3590 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3591 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3592 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3593 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3594 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3595 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3596 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3597 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3598 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3599 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3600 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3601 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3602 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3603 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3604 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3605 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3606 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3607 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3608 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3609 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3610 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3611 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3612 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3613 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3614 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3615 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3616 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3617 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3618 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3619 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3620 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3621 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3622 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3623 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3624 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3625 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3626 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3627 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3628 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3629 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3630 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3631 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3632 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3633 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3634 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3635 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3636 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3637 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3638 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3639 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3640 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3641 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3642 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3643 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3644 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3645 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3646 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3647 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3648 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3649 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3650 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3651 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3652 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3653 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3654 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3655 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3656 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3657 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3658 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3659 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3660 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3661 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3662 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3663 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3664 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3665 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3666 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3667 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3668 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3669 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3670 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3671 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3672 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3673 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3674 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3675 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3676 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3677 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3678 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3679 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3680 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3681 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3682 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3683 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3684 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3685 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3686 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3687 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3688 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3689 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3690 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3691 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3692 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3693 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3694 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3695 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3696 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3697 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3698 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3699 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3700 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3701 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3702 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3703 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3704 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3705 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3706 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3707 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3708 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3709 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3710 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3711 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3712 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3713 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3714 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3715 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3716 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3717 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3718 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3719 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3720 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3721 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3722 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3723 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3724 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3725 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3726 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3727 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3728 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3729 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3730 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3731 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3732 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3733 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3734 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3735 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3736 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3737 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3738 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3739 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3740 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3741 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3742 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3743 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3744 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3745 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3746 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3747 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3748 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3749 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3750 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3751 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3752 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3753 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3754 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3755 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3756 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3757 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3758 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3759 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3760 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3761 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3762 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3763 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3764 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3765 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3766 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3767 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3768 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3769 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3770 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3771 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3772 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3773 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3774 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3775 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3776 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3777 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3778 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3779 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3780 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3781 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3782 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3783 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3784 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3785 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3786 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3787 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3788 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3789 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3790 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3791 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3792 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3793 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3794 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3795 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3796 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3797 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3798 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3799 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3800 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3801 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3802 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3803 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3804 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3805 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3806 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3807 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3808 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3809 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3810 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3811 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3812 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3813 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3814 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3815 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3816 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3817 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3818 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3819 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3820 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3821 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3822 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3823 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3824 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3825 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3826 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3827 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3828 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3829 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3830 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3831 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3832 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3833 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3834 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3835 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3836 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3837 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3838 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3839 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3840 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3841 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3842 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3843 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3844 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3845 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3846 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3847 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3848 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3849 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3850 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3851 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3852 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3853 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3854 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3855 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3856 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3857 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3858 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3859 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3860 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3861 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3862 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3863 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3864 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3865 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3866 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3867 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3868 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3869 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3870 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3871 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3872 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3873 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3874 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3875 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3876 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3877 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3878 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3879 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3880 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3881 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3882 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3883 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3884 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3885 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3886 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3887 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3888 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3889 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3890 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3891 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3892 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3893 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3894 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3895 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3896 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3897 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3898 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3899 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3900 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3901 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3902 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3903 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3904 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3905 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3906 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3907 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3908 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3909 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3910 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3911 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3912 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3913 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3914 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3915 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3916 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3917 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3918 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3919 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3920 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3921 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3922 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3923 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3924 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3925 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3926 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3927 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3928 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3929 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3930 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3931 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3932 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3933 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3934 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3935 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3936 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3937 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3938 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3939 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3940 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3941 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3942 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3943 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3944 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3945 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3946 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3947 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3948 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3949 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3950 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3951 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3952 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3953 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3954 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3955 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3956 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3957 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3958 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3959 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3960 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3961 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3962 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3963 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3964 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3965 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3966 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3967 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3968 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3969 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3970 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3971 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3972 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3973 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3974 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3975 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3976 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3977 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3978 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3979 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3980 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3981 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3982 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3983 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3984 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3985 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3986 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3987 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3988 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3989 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3990 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3991 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3992 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3993 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3994 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3995 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3996 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3997 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3998 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_3999 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4000 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4001 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4002 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4003 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4004 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4005 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4006 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4007 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4008 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4009 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4010 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4011 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4012 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4013 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4014 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4015 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4016 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4017 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4018 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4019 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4020 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4021 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4022 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4023 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4024 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4025 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4026 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4027 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4028 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4029 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4030 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4031 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4032 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4033 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4034 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4035 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4036 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4037 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4038 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4039 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4040 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4041 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4042 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4043 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4044 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4045 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4046 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4047 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4048 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4049 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4050 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4051 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4052 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4053 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4054 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4055 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4056 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4057 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4058 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4059 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4060 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4061 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4062 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4063 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4064 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4065 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4066 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4067 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4068 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4069 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4070 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4071 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4072 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4073 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4074 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4075 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4076 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4077 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4078 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4079 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4080 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4081 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4082 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4083 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4084 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4085 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4086 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4087 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4088 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4089 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4090 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4091 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4092 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4093 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4094 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4095 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4096 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4097 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4098 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4099 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4100 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4101 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4102 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4103 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4104 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4105 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4106 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4107 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4108 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4109 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4110 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4111 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4112 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4113 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4114 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4115 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4116 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4117 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4118 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4119 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4120 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4121 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4122 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4123 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4124 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4125 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4126 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4127 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4128 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4129 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4130 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4131 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4132 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4133 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4134 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4135 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4136 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4137 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4138 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4139 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4140 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4141 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4142 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4143 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4144 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4145 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4146 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4147 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4148 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4149 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4150 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4151 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4152 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4153 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4154 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4155 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4156 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4157 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4158 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4159 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4160 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4161 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4162 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4163 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4164 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4165 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4166 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4167 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4168 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4169 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4170 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4171 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4172 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4173 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4174 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4175 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4176 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4177 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4178 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4179 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4180 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4181 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4182 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4183 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4184 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4185 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4186 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4187 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4188 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4189 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4190 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4191 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4192 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4193 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4194 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4195 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4196 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4197 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4198 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4199 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4200 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4201 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4202 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4203 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4204 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4205 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4206 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4207 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4208 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4209 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4210 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4211 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4212 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4213 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4214 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4215 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4216 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4217 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4218 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4219 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4220 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4221 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4222 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4223 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4224 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4225 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4226 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4227 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4228 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4229 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4230 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4231 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4232 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4233 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4234 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4235 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4236 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4237 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4238 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4239 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4240 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4241 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4242 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4243 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4244 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4245 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4246 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4247 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4248 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4249 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4250 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4251 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4252 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4253 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4254 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4255 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4256 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4257 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4258 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4259 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4260 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4261 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4262 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4263 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4264 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4265 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4266 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4267 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4268 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4269 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4270 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4271 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4272 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4273 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4274 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4275 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4276 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4277 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4278 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4279 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4280 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4281 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4282 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4283 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4284 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4285 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4286 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4287 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4288 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4289 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4290 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4291 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4292 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4293 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4294 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4295 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4296 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4297 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4298 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4299 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4300 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4301 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4302 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4303 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4304 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4305 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4306 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4307 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4308 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4309 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4310 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4311 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4312 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4313 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4314 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4315 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4316 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4317 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4318 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4319 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4320 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4321 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4322 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4323 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4324 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4325 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4326 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4327 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4328 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4329 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4330 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4331 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4332 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4333 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4334 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4335 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4336 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4337 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4338 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4339 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4340 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4341 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4342 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4343 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4344 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4345 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4346 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4347 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4348 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4349 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4350 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4351 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4352 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4353 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4354 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4355 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4356 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4357 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4358 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4359 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4360 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4361 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4362 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4363 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4364 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4365 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4366 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4367 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4368 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4369 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4370 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4371 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4372 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4373 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4374 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4375 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4376 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4377 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4378 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4379 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4380 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4381 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4382 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4383 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4384 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4385 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4386 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4387 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4388 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4389 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4390 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4391 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4392 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4393 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4394 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4395 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4396 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4397 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4398 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4399 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4400 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4401 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4402 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4403 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4404 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4405 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4406 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4407 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4408 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4409 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4410 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4411 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4412 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4413 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4414 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4415 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4416 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4417 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4418 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4419 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4420 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4421 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4422 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4423 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4424 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4425 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4426 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4427 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4428 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4429 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4430 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4431 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4432 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4433 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4434 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4435 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4436 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4437 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4438 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4439 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4440 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4441 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4442 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4443 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4444 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4445 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4446 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4447 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4448 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4449 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4450 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4451 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4452 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4453 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4454 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4455 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4456 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4457 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4458 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4459 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4460 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4461 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4462 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4463 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4464 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4465 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4466 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4467 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4468 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4469 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4470 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4471 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4472 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4473 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4474 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4475 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4476 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4477 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4478 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4479 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4480 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4481 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4482 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4483 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4484 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4485 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4486 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4487 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4488 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4489 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4490 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4491 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4492 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4493 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4494 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4495 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4496 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4497 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4498 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4499 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4500 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4501 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4502 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4503 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4504 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4505 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4506 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4507 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4508 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4509 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4510 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4511 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4512 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4513 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4514 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4515 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4516 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4517 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4518 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4519 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4520 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4521 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4522 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4523 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4524 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4525 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4526 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4527 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4528 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4529 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4530 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4531 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4532 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4533 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4534 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4535 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4536 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4537 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4538 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4539 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4540 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4541 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4542 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4543 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4544 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4545 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4546 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4547 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4548 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4549 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4550 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4551 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4552 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4553 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4554 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4555 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4556 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4557 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4558 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4559 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4560 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4561 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4562 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4563 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4564 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4565 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4566 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4567 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4568 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4569 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4570 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4571 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4572 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4573 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4574 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4575 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4576 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4577 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4578 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4579 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4580 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4581 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4582 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4583 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4584 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4585 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4586 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4587 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4588 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4589 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4590 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4591 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4592 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4593 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4594 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4595 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4596 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4597 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4598 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4599 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4600 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4601 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4602 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4603 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4604 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4605 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4606 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4607 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4608 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4609 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4610 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4611 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4612 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4613 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4614 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4615 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4616 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4617 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4618 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4619 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4620 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4621 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4622 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4623 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4624 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4625 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4626 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4627 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4628 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4629 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4630 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4631 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4632 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4633 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4634 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4635 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4636 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4637 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4638 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4639 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4640 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4641 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4642 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4643 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4644 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4645 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4646 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4647 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4648 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4649 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4650 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4651 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4652 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4653 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4654 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4655 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4656 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4657 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4658 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4659 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4660 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4661 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4662 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4663 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4664 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4665 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4666 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4667 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4668 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4669 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4670 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4671 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4672 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4673 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4674 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4675 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4676 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4677 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4678 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4679 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4680 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4681 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4682 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4683 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4684 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4685 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4686 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4687 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4688 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4689 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4690 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4691 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4692 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4693 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4694 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4695 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4696 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4697 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4698 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4699 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4700 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4701 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4702 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4703 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4704 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4705 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4706 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4707 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4708 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4709 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4710 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4711 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4712 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4713 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4714 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4715 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4716 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4717 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4718 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4719 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4720 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4721 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4722 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4723 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4724 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4725 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4726 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4727 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4728 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4729 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4730 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4731 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4732 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4733 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4734 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4735 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4736 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4737 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4738 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4739 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4740 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4741 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4742 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4743 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4744 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4745 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4746 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4747 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4748 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4749 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4750 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4751 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4752 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4753 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4754 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4755 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4756 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4757 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4758 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4759 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4760 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4761 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4762 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4763 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4764 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4765 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4766 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4767 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4768 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4769 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4770 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4771 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4772 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4773 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4774 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4775 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4776 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4777 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4778 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4779 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4780 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4781 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4782 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4783 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4784 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4785 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4786 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4787 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4788 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4789 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4790 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4791 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4792 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4793 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4794 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4795 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4796 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4797 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4798 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4799 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4800 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4801 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4802 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4803 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4804 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4805 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4806 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4807 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4808 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4809 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4810 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4811 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4812 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4813 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4814 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4815 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4816 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4817 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4818 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4819 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4820 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4821 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4822 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4823 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4824 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4825 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4826 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4827 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4828 (Extent : AMF.Internals.AMF_Extent); procedure Initialize_4829 (Extent : AMF.Internals.AMF_Extent); end AMF.Internals.Tables.UML_Metamodel.Objects;
with openGL.Primitive.indexed, openGL.Primitive, ada.unchecked_Deallocation; package body openGL.Model.segment_line is function to_segment_line_Model (Color : in openGL.Color) return Item is Self : constant Item := (Model.item with +Color, site_Vectors.empty_Vector, others => <>); begin return Self; end to_segment_line_Model; function new_segment_line_Model (Color : in openGL.Color) return View is begin return new Item' (to_segment_line_Model (Color)); end new_segment_line_Model; overriding function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class; Fonts : in Font.font_id_Map_of_font) return Geometry.views is pragma unreferenced (Textures, Fonts); use Geometry.colored, Primitive, Primitive.indexed, ada.Containers; vertex_Count : constant Index_t := Index_t (Self.Points.Length); indices_Count : constant long_Index_t := long_Index_t (vertex_Count); the_Indices : aliased Indices := (1 .. indices_Count => <>); begin if Self.Points.Length <= 2 then return (1..0 => <>); end if; for i in the_Indices'Range loop the_Indices (i) := Index_t (i); end loop; Self.Geometry := Geometry.colored.new_Geometry; Self.Geometry.is_Transparent (False); Self.Geometry.Vertices_are (Self.Vertices (1 .. Index_t (Self.vertex_Count))); Self.Geometry.add (Primitive.view (new_Primitive (Line_Strip, the_Indices))); return (1 => Self.Geometry.all'Access); end to_GL_Geometries; function Site (Self : in Item; for_End : in Integer) return Vector_3 is begin return Self.Vertices (Index_t (for_End)).Site; end Site; function segment_Count (Self : in Item) return Natural is begin return Natural (Self.Points.Length) - 1; end segment_Count; procedure add_1st_Segment (Self : in out Item; start_Site : in Vector_3; end_Site : in Vector_3) is use site_Vectors; begin pragma assert (Self.Points.Is_Empty); Self.Points.append (start_Site); Self.Points.append (end_Site); Self.vertex_Count := Self.vertex_Count + 1; Self.Vertices (Index_t (Self.vertex_Count)).Site := start_Site; Self.Vertices (Index_t (Self.vertex_Count)).Color := (Self.Color, opaque_Value); Self.vertex_Count := Self.vertex_Count + 1; Self.Vertices (Index_t (Self.vertex_Count)).Site := end_Site; Self.Vertices (Index_t (Self.vertex_Count)).Color := (Self.Color, opaque_Value); Self.needs_Rebuild := True; end add_1st_Segment; procedure add_Segment (Self : in out Item; end_Site : in Vector_3) is use type ada.Containers.Count_type; procedure deallocate is new ada.unchecked_Deallocation (Geometry.colored.Vertex_array, vertex_Array_view); begin pragma assert (not Self.Points.is_Empty); Self.Points.append (end_Site); if Self.Points.Length > Self.Vertices'Length then declare new_Vertices : constant vertex_Array_view := new Geometry.colored.Vertex_array (1 .. 2 * Self.Vertices'Length); begin new_Vertices (1 .. Self.Vertices'Length) := Self.Vertices.all; deallocate (Self.Vertices); Self.Vertices := new_Vertices; end; end if; Self.vertex_Count := Self.vertex_Count + 1; Self.Vertices (Index_t (Self.vertex_Count)).Site := end_Site; Self.Vertices (Index_t (Self.vertex_Count)).Color := (Self.Color, opaque_Value); Self.needs_Rebuild := True; end add_Segment; procedure Site_is (Self : in out Item; Now : in Vector_3; for_End : in Integer) is begin Self.Vertices (Index_t (for_End)).Site := Now; Self.Points.replace_Element (for_End, Now); set_Bounds (Self); Self.needs_Rebuild := True; end Site_is; procedure Color_is (Self : in out Item; Now : in Color; for_End : in Integer) is begin Self.Vertices (Index_t (for_End)).Color := (+Now, opaque_Value); Self.needs_Rebuild := True; end Color_is; function Segments (Self : in Item) return Segments_t is the_Segments : Segments_t (1 .. Integer (Self.Points.Length) - 1); begin for Each in the_Segments'Range loop the_Segments (Each) := (First => Self.Points.Element (Each), Last => Self.Points.Element (Each + 1)); end loop; return the_Segments; end Segments; function Angle_in_xz_plane (the_Segment : in Segment) return Radians is use real_Functions; the_Vector : constant Vector_3 := the_Segment.Last - the_Segment.First; begin return arcTan (the_Vector (3) / the_Vector (1)); end Angle_in_xz_plane; end openGL.Model.segment_line;
------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G . S T A G E S -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1991-2001 Florida State University -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. It is -- -- now maintained by Ada Core Technologies Inc. in cooperation with Florida -- -- State University (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ pragma Polling (Off); -- Turn off polling, we do not want ATC polling to take place during -- tasking operations. It causes infinite loops and other problems. with Ada.Exceptions; -- used for Raise_Exception with System.Tasking.Debug; pragma Warnings (Off, System.Tasking.Debug); -- used for enabling tasking facilities with gdb with System.Address_Image; -- used for the function itself. with System.Parameters; -- used for Size_Type with System.Task_Info; -- used for Task_Info_Type -- Task_Image_Type with System.Task_Primitives.Operations; -- used for Finalize_Lock -- Enter_Task -- Write_Lock -- Unlock -- Sleep -- Wakeup -- Get_Priority -- Lock/Unlock_All_Tasks_List -- New_ATCB with System.Soft_Links; -- These are procedure pointers to non-tasking routines that use -- task specific data. In the absence of tasking, these routines -- refer to global data. In the presense of tasking, they must be -- replaced with pointers to task-specific versions. -- Also used for Create_TSD, Destroy_TSD, Get_Current_Excep with System.Tasking.Initialization; -- Used for Remove_From_All_Tasks_List -- Defer_Abort -- Undefer_Abort -- Initialization.Poll_Base_Priority_Change -- Finalize_Attributes_Link -- Initialize_Attributes_Link pragma Elaborate_All (System.Tasking.Initialization); -- This insures that tasking is initialized if any tasks are created. with System.Tasking.Utilities; -- Used for Make_Passive -- Abort_One_Task with System.Tasking.Queuing; -- Used for Dequeue_Head with System.Tasking.Rendezvous; -- Used for Call_Simple with System.OS_Primitives; -- Used for Delay_Modes with System.Finalization_Implementation; -- Used for System.Finalization_Implementation.Finalize_Global_List with Interfaces.C; -- Used for type Unsigned. with System.Secondary_Stack; -- used for SS_Init; with System.Storage_Elements; -- used for Storage_Array; with System.Standard_Library; -- used for Exception_Trace package body System.Tasking.Stages is package STPO renames System.Task_Primitives.Operations; package SSL renames System.Soft_Links; package SSE renames System.Storage_Elements; package SST renames System.Secondary_Stack; use Ada.Exceptions; use System.Task_Primitives; use System.Task_Primitives.Operations; use System.Task_Info; procedure Wakeup_Entry_Caller (Self_ID : Task_ID; Entry_Call : Entry_Call_Link; New_State : Entry_Call_State) renames Initialization.Wakeup_Entry_Caller; procedure Cancel_Queued_Entry_Calls (T : Task_ID) renames Utilities.Cancel_Queued_Entry_Calls; procedure Abort_One_Task (Self_ID : Task_ID; T : Task_ID) renames Utilities.Abort_One_Task; ----------------------- -- Local Subprograms -- ----------------------- procedure Notify_Exception (Self_Id : Task_ID; Excep : Exception_Occurrence); -- This procedure will output the task ID and the exception information, -- including traceback if available. procedure Task_Wrapper (Self_ID : Task_ID); -- This is the procedure that is called by the GNULL from the -- new context when a task is created. It waits for activation -- and then calls the task body procedure. When the task body -- procedure completes, it terminates the task. procedure Vulnerable_Complete_Task (Self_ID : Task_ID); -- Complete the calling task. -- This procedure must be called with abort deferred. -- It should only be called by Complete_Task and -- Finalizate_Global_Tasks (for the environment task). procedure Vulnerable_Complete_Master (Self_ID : Task_ID); -- Complete the current master of the calling task. -- This procedure must be called with abort deferred. -- It should only be called by Vulnerable_Complete_Task and -- Complete_Master. procedure Vulnerable_Complete_Activation (Self_ID : Task_ID); -- Signal to Self_ID's activator that Self_ID has -- completed activation. -- -- Does not defer abortion (unlike Complete_Activation). procedure Abort_Dependents (Self_ID : Task_ID); -- Abort all the dependents of Self at our current master -- nesting level. procedure Vulnerable_Free_Task (T : Task_ID); -- Recover all runtime system storage associated with the task T. -- This should only be called after T has terminated and will no -- longer be referenced. -- -- For tasks created by an allocator that fails, due to an exception, -- it is called from Expunge_Unactivated_Tasks. -- -- It is also called from Unchecked_Deallocation, for objects that -- are or contain tasks. -- -- Different code is used at master completion, in Terminate_Dependents, -- due to a need for tighter synchronization with the master. procedure Terminate_Task (Self_ID : Task_ID); -- Terminate the calling task. -- This should only be called by the Task_Wrapper procedure. ---------------------- -- Abort_Dependents -- ---------------------- -- Abort all the direct dependents of Self at its current master -- nesting level, plus all of their dependents, transitively. -- No locks should be held when this routine is called. procedure Abort_Dependents (Self_ID : Task_ID) is C : Task_ID; P : Task_ID; begin Lock_All_Tasks_List; C := All_Tasks_List; while C /= null loop P := C.Common.Parent; while P /= null loop if P = Self_ID then -- ??? C is supposed to take care of its own dependents, so -- there should be no need to take worry about them. Need to -- double check this. if C.Master_of_Task = Self_ID.Master_Within then Abort_One_Task (Self_ID, C); C.Dependents_Aborted := True; end if; exit; end if; P := P.Common.Parent; end loop; C := C.Common.All_Tasks_Link; end loop; Self_ID.Dependents_Aborted := True; Unlock_All_Tasks_List; end Abort_Dependents; ----------------- -- Abort_Tasks -- ----------------- procedure Abort_Tasks (Tasks : Task_List) is begin Utilities.Abort_Tasks (Tasks); end Abort_Tasks; -------------------- -- Activate_Tasks -- -------------------- -- Note that locks of activator and activated task are both locked -- here. This is necessary because C.Common.State and -- Self.Common.Wait_Count have to be synchronized. This is safe from -- deadlock because the activator is always created before the activated -- task. That satisfies our in-order-of-creation ATCB locking policy. -- At one point, we may also lock the parent, if the parent is -- different from the activator. That is also consistent with the -- lock ordering policy, since the activator cannot be created -- before the parent. -- Since we are holding both the activator's lock, and Task_Wrapper -- locks that before it does anything more than initialize the -- low-level ATCB components, it should be safe to wait to update -- the counts until we see that the thread creation is successful. -- If the thread creation fails, we do need to close the entries -- of the task. The first phase, of dequeuing calls, only requires -- locking the acceptor's ATCB, but the waking up of the callers -- requires locking the caller's ATCB. We cannot safely do this -- while we are holding other locks. Therefore, the queue-clearing -- operation is done in a separate pass over the activation chain. procedure Activate_Tasks (Chain_Access : Activation_Chain_Access) is Self_ID : constant Task_ID := STPO.Self; P : Task_ID; C : Task_ID; Next_C, Last_C : Task_ID; Activate_Prio : System.Any_Priority; Success : Boolean; All_Elaborated : Boolean := True; begin pragma Debug (Debug.Trace (Self_ID, "Activate_Tasks", 'C')); Initialization.Defer_Abort_Nestable (Self_ID); pragma Assert (Self_ID.Common.Wait_Count = 0); -- Lock All_Tasks_L, to prevent activated tasks -- from racing ahead before we finish activating the chain. -- ????? -- Is there some less heavy-handed way? -- In an earlier version, we used the activator's lock here, -- but that violated the locking order rule when we had -- to lock the parent later. Lock_All_Tasks_List; -- Check that all task bodies have been elaborated. C := Chain_Access.T_ID; Last_C := null; while C /= null loop if C.Common.Elaborated /= null and then not C.Common.Elaborated.all then All_Elaborated := False; end if; -- Reverse the activation chain so that tasks are -- activated in the same order they're declared. Next_C := C.Common.Activation_Link; C.Common.Activation_Link := Last_C; Last_C := C; C := Next_C; end loop; Chain_Access.T_ID := Last_C; if not All_Elaborated then Unlock_All_Tasks_List; Initialization.Undefer_Abort_Nestable (Self_ID); Raise_Exception (Program_Error'Identity, "Some tasks have not been elaborated"); end if; -- Activate all the tasks in the chain. -- Creation of the thread of control was deferred until -- activation. So create it now. C := Chain_Access.T_ID; while C /= null loop if C.Common.State /= Terminated then pragma Assert (C.Common.State = Unactivated); P := C.Common.Parent; Write_Lock (P); Write_Lock (C); if C.Common.Base_Priority < Get_Priority (Self_ID) then Activate_Prio := Get_Priority (Self_ID); else Activate_Prio := C.Common.Base_Priority; end if; System.Task_Primitives.Operations.Create_Task (C, Task_Wrapper'Address, Parameters.Size_Type (C.Common.Compiler_Data.Pri_Stack_Info.Size), Activate_Prio, Success); -- There would be a race between the created task and -- the creator to do the following initialization, -- if we did not have a Lock/Unlock_All_Tasks_List pair -- in the task wrapper, to prevent it from racing ahead. if Success then C.Common.State := Runnable; C.Awake_Count := 1; C.Alive_Count := 1; P.Awake_Count := P.Awake_Count + 1; P.Alive_Count := P.Alive_Count + 1; if P.Common.State = Master_Completion_Sleep and then C.Master_of_Task = P.Master_Within then pragma Assert (Self_ID /= P); P.Common.Wait_Count := P.Common.Wait_Count + 1; end if; Unlock (C); Unlock (P); else -- No need to set Awake_Count, State, etc. here since the loop -- below will do that for any Unactivated tasks. Unlock (C); Unlock (P); Self_ID.Common.Activation_Failed := True; end if; end if; C := C.Common.Activation_Link; end loop; Unlock_All_Tasks_List; -- Close the entries of any tasks that failed thread creation, -- and count those that have not finished activation. Write_Lock (Self_ID); Self_ID.Common.State := Activator_Sleep; C := Chain_Access.T_ID; while C /= null loop Write_Lock (C); if C.Common.State = Unactivated then C.Common.Activator := null; C.Common.State := Terminated; C.Callable := False; Cancel_Queued_Entry_Calls (C); elsif C.Common.Activator /= null then Self_ID.Common.Wait_Count := Self_ID.Common.Wait_Count + 1; end if; Unlock (C); P := C.Common.Activation_Link; C.Common.Activation_Link := null; C := P; end loop; -- Wait for the activated tasks to complete activation. -- It is unsafe to abort any of these tasks until the count goes to -- zero. loop Initialization.Poll_Base_Priority_Change (Self_ID); exit when Self_ID.Common.Wait_Count = 0; Sleep (Self_ID, Activator_Sleep); end loop; Self_ID.Common.State := Runnable; Unlock (Self_ID); -- Remove the tasks from the chain. Chain_Access.T_ID := null; Initialization.Undefer_Abort_Nestable (Self_ID); if Self_ID.Common.Activation_Failed then Self_ID.Common.Activation_Failed := False; Raise_Exception (Tasking_Error'Identity, "Failure during activation"); end if; end Activate_Tasks; ------------------------- -- Complete_Activation -- ------------------------- procedure Complete_Activation is Self_ID : constant Task_ID := STPO.Self; begin Initialization.Defer_Abort_Nestable (Self_ID); Vulnerable_Complete_Activation (Self_ID); Initialization.Undefer_Abort_Nestable (Self_ID); -- ????? -- Why do we need to allow for nested deferral here? end Complete_Activation; --------------------- -- Complete_Master -- --------------------- procedure Complete_Master is Self_ID : Task_ID := STPO.Self; begin pragma Assert (Self_ID.Deferral_Level > 0); Vulnerable_Complete_Master (Self_ID); end Complete_Master; ------------------- -- Complete_Task -- ------------------- -- See comments on Vulnerable_Complete_Task for details. procedure Complete_Task is Self_ID : constant Task_ID := STPO.Self; begin pragma Assert (Self_ID.Deferral_Level > 0); Vulnerable_Complete_Task (Self_ID); -- All of our dependents have terminated. -- Never undefer abort again! end Complete_Task; ----------------- -- Create_Task -- ----------------- -- Compiler interface only. Do not call from within the RTS. -- This must be called to create a new task. procedure Create_Task (Priority : Integer; Size : System.Parameters.Size_Type; Task_Info : System.Task_Info.Task_Info_Type; Num_Entries : Task_Entry_Index; Master : Master_Level; State : Task_Procedure_Access; Discriminants : System.Address; Elaborated : Access_Boolean; Chain : in out Activation_Chain; Task_Image : System.Task_Info.Task_Image_Type; Created_Task : out Task_ID) is T, P : Task_ID; Self_ID : constant Task_ID := STPO.Self; Success : Boolean; Base_Priority : System.Any_Priority; begin pragma Debug (Debug.Trace (Self_ID, "Create_Task", 'C')); if Priority = Unspecified_Priority then Base_Priority := Self_ID.Common.Base_Priority; else Base_Priority := System.Any_Priority (Priority); end if; -- Find parent P of new Task, via master level number. P := Self_ID; if P /= null then while P.Master_of_Task >= Master loop P := P.Common.Parent; exit when P = null; end loop; end if; Initialization.Defer_Abort_Nestable (Self_ID); begin T := New_ATCB (Num_Entries); exception when others => Initialization.Undefer_Abort_Nestable (Self_ID); Raise_Exception (Storage_Error'Identity, "Cannot allocate task"); end; -- All_Tasks_L is used by Abort_Dependents and Abort_Tasks. -- Up to this point, it is possible that we may be part of -- a family of tasks that is being aborted. Lock_All_Tasks_List; Write_Lock (Self_ID); -- Now, we must check that we have not been aborted. -- If so, we should give up on creating this task, -- and simply return. if not Self_ID.Callable then pragma Assert (Self_ID.Pending_ATC_Level = 0); pragma Assert (Self_ID.Pending_Action); pragma Assert (Chain.T_ID = null or else Chain.T_ID.Common.State = Unactivated); Unlock (Self_ID); Unlock_All_Tasks_List; Initialization.Undefer_Abort_Nestable (Self_ID); -- ??? Should never get here pragma Assert (False); raise Standard'Abort_Signal; end if; Initialize_ATCB (Self_ID, State, Discriminants, P, Elaborated, Base_Priority, Task_Info, Size, T, Success); if not Success then Unlock (Self_ID); Unlock_All_Tasks_List; Initialization.Undefer_Abort_Nestable (Self_ID); Raise_Exception (Storage_Error'Identity, "Failed to initialize task"); end if; T.Master_of_Task := Master; T.Master_Within := T.Master_of_Task + 1; for L in T.Entry_Calls'Range loop T.Entry_Calls (L).Self := T; T.Entry_Calls (L).Level := L; end loop; T.Common.Task_Image := Task_Image; Unlock (Self_ID); Unlock_All_Tasks_List; -- Create TSD as early as possible in the creation of a task, since it -- may be used by the operation of Ada code within the task. SSL.Create_TSD (T.Common.Compiler_Data); T.Common.Activation_Link := Chain.T_ID; Chain.T_ID := T; Initialization.Initialize_Attributes_Link.all (T); Created_Task := T; Initialization.Undefer_Abort_Nestable (Self_ID); end Create_Task; -------------------- -- Current_Master -- -------------------- function Current_Master return Master_Level is Self_ID : constant Task_ID := STPO.Self; begin return Self_ID.Master_Within; end Current_Master; ------------------ -- Enter_Master -- ------------------ procedure Enter_Master is Self_ID : constant Task_ID := STPO.Self; begin Self_ID.Master_Within := Self_ID.Master_Within + 1; end Enter_Master; ------------------------------- -- Expunge_Unactivated_Tasks -- ------------------------------- -- See procedure Close_Entries for the general case. procedure Expunge_Unactivated_Tasks (Chain : in out Activation_Chain) is Self_ID : constant Task_ID := STPO.Self; C : Task_ID; Call : Entry_Call_Link; Temp : Task_ID; begin pragma Debug (Debug.Trace (Self_ID, "Expunge_Unactivated_Tasks", 'C')); Initialization.Defer_Abort_Nestable (Self_ID); -- ???? -- Experimentation has shown that abort is sometimes (but not -- always) already deferred when this is called. -- That may indicate an error. Find out what is going on. C := Chain.T_ID; while C /= null loop pragma Assert (C.Common.State = Unactivated); Temp := C.Common.Activation_Link; if C.Common.State = Unactivated then Write_Lock (C); for J in 1 .. C.Entry_Num loop Queuing.Dequeue_Head (C.Entry_Queues (J), Call); pragma Assert (Call = null); end loop; Unlock (C); Initialization.Remove_From_All_Tasks_List (C); Vulnerable_Free_Task (C); C := Temp; end if; end loop; Chain.T_ID := null; Initialization.Undefer_Abort_Nestable (Self_ID); end Expunge_Unactivated_Tasks; --------------------------- -- Finalize_Global_Tasks -- --------------------------- -- ???? -- We have a potential problem here if finalization of global -- objects does anything with signals or the timer server, since -- by that time those servers have terminated. -- It is hard to see how that would occur. -- However, a better solution might be to do all this finalization -- using the global finalization chain. procedure Finalize_Global_Tasks is Self_ID : constant Task_ID := STPO.Self; Zero_Independent : Boolean; begin if Self_ID.Deferral_Level = 0 then -- ?????? -- In principle, we should be able to predict whether -- abort is already deferred here (and it should not be deferred -- yet but in practice it seems Finalize_Global_Tasks is being -- called sometimes, from RTS code for exceptions, with abort already -- deferred. Initialization.Defer_Abort_Nestable (Self_ID); -- Never undefer again!!! end if; -- This code is only executed by the environment task pragma Assert (Self_ID = Environment_Task); -- Set Environment_Task'Callable to false to notify library-level tasks -- that it is waiting for them (cf 5619-003). Self_ID.Callable := False; -- Exit level 2 master, for normal tasks in library-level packages. Complete_Master; -- Force termination of "independent" library-level server tasks. Abort_Dependents (Self_ID); -- We need to explicitly wait for the task to be -- terminated here because on true concurrent system, we -- may end this procedure before the tasks are really -- terminated. loop Write_Lock (Self_ID); Zero_Independent := Utilities.Independent_Task_Count = 0; Unlock (Self_ID); -- We used to yield here, but this did not take into account -- low priority tasks that would cause dead lock in some cases. -- See 8126-020. Timed_Delay (Self_ID, 0.01, System.OS_Primitives.Relative); exit when Zero_Independent; end loop; -- ??? On multi-processor environments, it seems that the above loop -- isn't sufficient, so we need to add an additional delay. Timed_Delay (Self_ID, 0.1, System.OS_Primitives.Relative); -- Complete the environment task. Vulnerable_Complete_Task (Self_ID); System.Finalization_Implementation.Finalize_Global_List; SSL.Abort_Defer := SSL.Abort_Defer_NT'Access; SSL.Abort_Undefer := SSL.Abort_Undefer_NT'Access; SSL.Lock_Task := SSL.Task_Lock_NT'Access; SSL.Unlock_Task := SSL.Task_Unlock_NT'Access; SSL.Get_Jmpbuf_Address := SSL.Get_Jmpbuf_Address_NT'Access; SSL.Set_Jmpbuf_Address := SSL.Set_Jmpbuf_Address_NT'Access; SSL.Get_Sec_Stack_Addr := SSL.Get_Sec_Stack_Addr_NT'Access; SSL.Set_Sec_Stack_Addr := SSL.Set_Sec_Stack_Addr_NT'Access; SSL.Get_Exc_Stack_Addr := SSL.Get_Exc_Stack_Addr_NT'Access; SSL.Set_Exc_Stack_Addr := SSL.Set_Exc_Stack_Addr_NT'Access; SSL.Check_Abort_Status := SSL.Check_Abort_Status_NT'Access; SSL.Get_Stack_Info := SSL.Get_Stack_Info_NT'Access; -- Don't bother trying to finalize Initialization.Global_Task_Lock -- and System.Task_Primitives.All_Tasks_L. end Finalize_Global_Tasks; --------------- -- Free_Task -- --------------- procedure Free_Task (T : Task_ID) is Self_Id : constant Task_ID := Self; begin if T.Common.State = Terminated then -- It is not safe to call Abort_Defer or Write_Lock at this stage Initialization.Task_Lock (Self_Id); if T.Common.Task_Image /= null then Free_Task_Image (T.Common.Task_Image); end if; Initialization.Remove_From_All_Tasks_List (T); Initialization.Task_Unlock (Self_Id); System.Task_Primitives.Operations.Finalize_TCB (T); -- If the task is not terminated, then we simply ignore the call. This -- happens when a user program attempts an unchecked deallocation on -- a non-terminated task. else null; end if; end Free_Task; ---------------------- -- Notify_Exception -- ---------------------- procedure Notify_Exception (Self_Id : Task_ID; Excep : Exception_Occurrence) is procedure To_Stderr (S : String); pragma Import (Ada, To_Stderr, "__gnat_to_stderr"); use System.Task_Info; use System.Soft_Links; function To_Address is new Unchecked_Conversion (Task_ID, System.Address); function Tailored_Exception_Information (E : Exception_Occurrence) return String; pragma Import (Ada, Tailored_Exception_Information, "__gnat_tailored_exception_information"); begin To_Stderr ("task "); if Self_Id.Common.Task_Image /= null then To_Stderr (Self_Id.Common.Task_Image.all); To_Stderr ("_"); end if; To_Stderr (System.Address_Image (To_Address (Self_Id))); To_Stderr (" terminated by unhandled exception"); To_Stderr ((1 => ASCII.LF)); To_Stderr (Tailored_Exception_Information (Excep)); end Notify_Exception; ------------------ -- Task_Wrapper -- ------------------ -- The task wrapper is a procedure that is called first for each task -- task body, and which in turn calls the compiler-generated task body -- procedure. The wrapper's main job is to do initialization for the task. -- It also has some locally declared objects that server as per-task local -- data. Task finalization is done by Complete_Task, which is called from -- an at-end handler that the compiler generates. -- The variable ID in the task wrapper is used to implement the Self -- function on targets where there is a fast way to find the stack base -- of the current thread, since it should be at a fixed offset from the -- stack base. -- The variable Magic_Number is also used in such implementations -- of Self, to check whether the current task is an Ada task, as -- compared to other-language threads. -- Both act as constants, once initialized, but need to be marked as -- volatile or aliased to prevent the compiler from optimizing away the -- storage. See System.Task_Primitives.Operations.Self for more info. procedure Task_Wrapper (Self_ID : Task_ID) is ID : Task_ID := Self_ID; pragma Volatile (ID); -- Do not delete this variable. -- In some targets, we need this variable to implement a fast Self. Magic_Number : Interfaces.C.unsigned := 16#ADAADAAD#; pragma Volatile (Magic_Number); -- We use this to verify that we are looking at an Ada task, -- inside of System.Task_Primitives.Operations.Self. use type System.Parameters.Size_Type; use type SSE.Storage_Offset; use System.Standard_Library; Secondary_Stack : aliased SSE.Storage_Array (1 .. ID.Common.Compiler_Data.Pri_Stack_Info.Size * SSE.Storage_Offset (Parameters.Sec_Stack_Ratio) / 100); Secondary_Stack_Address : System.Address := Secondary_Stack'Address; begin pragma Assert (Self_ID.Deferral_Level = 1); if not Parameters.Sec_Stack_Dynamic then ID.Common.Compiler_Data.Sec_Stack_Addr := Secondary_Stack'Address; SST.SS_Init (Secondary_Stack_Address, Integer (Secondary_Stack'Last)); end if; -- Set the guard page at the bottom of the stack. -- The call to unprotect the page is done in Terminate_Task Stack_Guard (Self_ID, True); -- Initialize low-level TCB components, that -- cannot be initialized by the creator. -- Enter_Task sets Self_ID.Known_Tasks_Index -- and Self_ID.LL.Thread Enter_Task (Self_ID); -- We lock All_Tasks_L to wait for activator to finish activating -- the rest of the chain, so that everyone in the chain comes out -- in priority order. -- This also protects the value of -- Self_ID.Common.Activator.Common.Wait_Count. Lock_All_Tasks_List; Unlock_All_Tasks_List; begin -- We are separating the following portion of the code in order to -- place the exception handlers in a different block. -- In this way we do not call Set_Jmpbuf_Address (which needs -- Self) before we set Self in Enter_Task -- Call the task body procedure. -- The task body is called with abort still deferred. That -- eliminates a dangerous window, for which we had to patch-up in -- Terminate_Task. -- During the expansion of the task body, we insert an RTS-call -- to Abort_Undefer, at the first point where abort should be -- allowed. Self_ID.Common.Task_Entry_Point (Self_ID.Common.Task_Arg); Terminate_Task (Self_ID); exception when Standard'Abort_Signal => Terminate_Task (Self_ID); when others => -- ??? Using an E : others here causes CD2C11A to fail on -- DEC Unix, see 7925-005. if Exception_Trace = Unhandled_Raise then Notify_Exception (Self_ID, SSL.Get_Current_Excep.all.all); end if; Terminate_Task (Self_ID); end; end Task_Wrapper; -------------------- -- Terminate_Task -- -------------------- -- Before we allow the thread to exit, we must clean up. This is a -- a delicate job. We must wake up the task's master, who may immediately -- try to deallocate the ATCB out from under the current task WHILE IT IS -- STILL EXECUTING. -- To avoid this, the parent task must be blocked up to the last thing -- done before the call to Exit_Task. The trouble is that we have another -- step that we also want to postpone to the very end, i.e., calling -- SSL.Destroy_TSD. We have to postpone that until the end because -- compiler-generated code is likely to try to access that data at just -- about any point. -- We can't call Destroy_TSD while we are holding any other locks, because -- it locks Global_Task_Lock, and our deadlock prevention rules require -- that to be the outermost lock. Our first "solution" was to just lock -- Global_Task_Lock in addition to the other locks, and force the parent -- to also lock this lock between its wakeup and its freeing of the ATCB. -- See Complete_Task for the parent-side of the code that has the matching -- calls to Task_Lock and Task_Unlock. That was not really a solution, -- since the operation Task_Unlock continued to access the ATCB after -- unlocking, after which the parent was observed to race ahead, -- deallocate the ATCB, and then reallocate it to another task. The -- call to Undefer_Abortion in Task_Unlock by the "terminated" task was -- overwriting the data of the new task that reused the ATCB! To solve -- this problem, we introduced the new operation Final_Task_Unlock. procedure Terminate_Task (Self_ID : Task_ID) is Environment_Task : constant Task_ID := STPO.Environment_Task; begin pragma Assert (Self_ID.Common.Activator = null); -- Since GCC cannot allocate stack chunks efficiently without reordering -- some of the allocations, we have to handle this unexpected situation -- here. We should normally never have to call Vulnerable_Complete_Task -- here. See 6602-003 for more details. if Self_ID.Common.Activator /= null then Vulnerable_Complete_Task (Self_ID); end if; -- Check if the current task is an independent task -- If so, decrement the Independent_Task_Count value. if Self_ID.Master_of_Task = 2 then Write_Lock (Environment_Task); Utilities.Independent_Task_Count := Utilities.Independent_Task_Count - 1; Unlock (Environment_Task); end if; -- Unprotect the guard page if needed. Stack_Guard (Self_ID, False); Initialization.Task_Lock (Self_ID); Utilities.Make_Passive (Self_ID, Task_Completed => True); pragma Assert (Check_Exit (Self_ID)); SSL.Destroy_TSD (Self_ID.Common.Compiler_Data); Initialization.Final_Task_Unlock (Self_ID); -- WARNING -- past this point, this thread must assume that the ATCB -- has been deallocated. It should not be accessed again. STPO.Exit_Task; end Terminate_Task; ---------------- -- Terminated -- ---------------- function Terminated (T : Task_ID) return Boolean is Result : Boolean; Self_ID : Task_ID := STPO.Self; begin Initialization.Defer_Abort_Nestable (Self_ID); Write_Lock (T); Result := T.Common.State = Terminated; Unlock (T); Initialization.Undefer_Abort_Nestable (Self_ID); return Result; end Terminated; ------------------------------------ -- Vulnerable_Complete_Activation -- ------------------------------------ -- Only call this procedure with abortion deferred. -- As in several other places, the locks of the activator and activated -- task are both locked here. This follows our deadlock prevention lock -- ordering policy, since the activated task must be created after the -- activator. procedure Vulnerable_Complete_Activation (Self_ID : Task_ID) is Activator : Task_ID := Self_ID.Common.Activator; begin pragma Debug (Debug.Trace (Self_ID, "V_Complete_Activation", 'C')); Write_Lock (Activator); Write_Lock (Self_ID); pragma Assert (Self_ID.Common.Activator /= null); -- Remove dangling reference to Activator, -- since a task may outlive its activator. Self_ID.Common.Activator := null; -- Wake up the activator, if it is waiting for a chain -- of tasks to activate, and we are the last in the chain -- to complete activation if Activator.Common.State = Activator_Sleep then Activator.Common.Wait_Count := Activator.Common.Wait_Count - 1; if Activator.Common.Wait_Count = 0 then Wakeup (Activator, Activator_Sleep); end if; end if; -- The activator raises a Tasking_Error if any task -- it is activating is completed before the activation is -- done. However, if the reason for the task completion is -- an abortion, we do not raise an exception. ARM 9.2(5). if not Self_ID.Callable and then Self_ID.Pending_ATC_Level /= 0 then Activator.Common.Activation_Failed := True; end if; Unlock (Self_ID); Unlock (Activator); -- After the activation, active priority should be the same -- as base priority. We must unlock the Activator first, -- though, since it should not wait if we have lower priority. if Get_Priority (Self_ID) /= Self_ID.Common.Base_Priority then Write_Lock (Self_ID); Set_Priority (Self_ID, Self_ID.Common.Base_Priority); Unlock (Self_ID); end if; end Vulnerable_Complete_Activation; -------------------------------- -- Vulnerable_Complete_Master -- -------------------------------- procedure Vulnerable_Complete_Master (Self_ID : Task_ID) is C : Task_ID; P : Task_ID; CM : Master_Level := Self_ID.Master_Within; T : aliased Task_ID; To_Be_Freed : Task_ID; -- This is a list of ATCBs to be freed, after we have released -- all RTS locks. This is necessary because of the locking order -- rules, since the storage manager uses Global_Task_Lock. pragma Warnings (Off); function Check_Unactivated_Tasks return Boolean; pragma Warnings (On); -- Temporary error-checking code below. This is part of the checks -- added in the new run time. Call it only inside a pragma Assert. function Check_Unactivated_Tasks return Boolean is begin Lock_All_Tasks_List; Write_Lock (Self_ID); C := All_Tasks_List; while C /= null loop if C.Common.Activator = Self_ID then return False; end if; if C.Common.Parent = Self_ID and then C.Master_of_Task = CM then Write_Lock (C); if C.Common.State = Unactivated then return False; end if; Unlock (C); end if; C := C.Common.All_Tasks_Link; end loop; Unlock (Self_ID); Unlock_All_Tasks_List; return True; end Check_Unactivated_Tasks; -- Start of processing for Vulnerable_Complete_Master begin pragma Debug (Debug.Trace (Self_ID, "V_Complete_Master", 'C')); pragma Assert (Self_ID.Common.Wait_Count = 0); pragma Assert (Self_ID.Deferral_Level > 0); -- Count how many active dependent tasks this master currently -- has, and record this in Wait_Count. -- This count should start at zero, since it is initialized to -- zero for new tasks, and the task should not exit the -- sleep-loops that use this count until the count reaches zero. Lock_All_Tasks_List; Write_Lock (Self_ID); C := All_Tasks_List; while C /= null loop if C.Common.Activator = Self_ID then pragma Assert (C.Common.State = Unactivated); Write_Lock (C); C.Common.Activator := null; C.Common.State := Terminated; C.Callable := False; Cancel_Queued_Entry_Calls (C); Unlock (C); end if; if C.Common.Parent = Self_ID and then C.Master_of_Task = CM then Write_Lock (C); if C.Awake_Count /= 0 then Self_ID.Common.Wait_Count := Self_ID.Common.Wait_Count + 1; end if; Unlock (C); end if; C := C.Common.All_Tasks_Link; end loop; Self_ID.Common.State := Master_Completion_Sleep; Unlock (Self_ID); Unlock_All_Tasks_List; -- Wait until dependent tasks are all terminated or ready to terminate. -- While waiting, the task may be awakened if the task's priority needs -- changing, or this master is aborted. In the latter case, we want -- to abort the dependents, and resume waiting until Wait_Count goes -- to zero. Write_Lock (Self_ID); loop Initialization.Poll_Base_Priority_Change (Self_ID); exit when Self_ID.Common.Wait_Count = 0; -- Here is a difference as compared to Complete_Master if Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level and then not Self_ID.Dependents_Aborted then Unlock (Self_ID); Abort_Dependents (Self_ID); Write_Lock (Self_ID); else Sleep (Self_ID, Master_Completion_Sleep); end if; end loop; Self_ID.Common.State := Runnable; Unlock (Self_ID); -- Dependents are all terminated or on terminate alternatives. -- Now, force those on terminate alternatives to terminate, by -- aborting them. pragma Assert (Check_Unactivated_Tasks); if Self_ID.Alive_Count > 1 then -- ????? -- Consider finding a way to skip the following extra steps if -- there are no dependents with terminate alternatives. This -- could be done by adding another count to the ATCB, similar to -- Awake_Count, but keeping track of count of tasks that are on -- terminate alternatives. pragma Assert (Self_ID.Common.Wait_Count = 0); -- Force any remaining dependents to terminate, by aborting them. Abort_Dependents (Self_ID); -- Above, when we "abort" the dependents we are simply using this -- operation for convenience. We are not required to support the full -- abort-statement semantics; in particular, we are not required to -- immediately cancel any queued or in-service entry calls. That is -- good, because if we tried to cancel a call we would need to lock -- the caller, in order to wake the caller up. Our anti-deadlock -- rules prevent us from doing that without releasing the locks on C -- and Self_ID. Releasing and retaking those locks would be -- wasteful, at best, and should not be considered further without -- more detailed analysis of potential concurrent accesses to the -- ATCBs of C and Self_ID. -- Count how many "alive" dependent tasks this master currently -- has, and record this in Wait_Count. -- This count should start at zero, since it is initialized to -- zero for new tasks, and the task should not exit the -- sleep-loops that use this count until the count reaches zero. pragma Assert (Self_ID.Common.Wait_Count = 0); Lock_All_Tasks_List; Write_Lock (Self_ID); C := All_Tasks_List; while C /= null loop if C.Common.Parent = Self_ID and then C.Master_of_Task = CM then Write_Lock (C); pragma Assert (C.Awake_Count = 0); if C.Alive_Count > 0 then pragma Assert (C.Terminate_Alternative); Self_ID.Common.Wait_Count := Self_ID.Common.Wait_Count + 1; end if; Unlock (C); end if; C := C.Common.All_Tasks_Link; end loop; Self_ID.Common.State := Master_Phase_2_Sleep; Unlock (Self_ID); Unlock_All_Tasks_List; -- Wait for all counted tasks to finish terminating themselves. Write_Lock (Self_ID); loop Initialization.Poll_Base_Priority_Change (Self_ID); exit when Self_ID.Common.Wait_Count = 0; Sleep (Self_ID, Master_Phase_2_Sleep); end loop; Self_ID.Common.State := Runnable; Unlock (Self_ID); end if; -- We don't wake up for abortion here. We are already terminating -- just as fast as we can, so there is no point. -- ???? -- Consider whether we want to bother checking for priority -- changes in the loop above, though. -- Remove terminated tasks from the list of Self_ID's dependents, but -- don't free their ATCBs yet, because of lock order restrictions, -- which don't allow us to call "free" or "malloc" while holding any -- other locks. Instead, we put those ATCBs to be freed onto a -- temporary list, called To_Be_Freed. Lock_All_Tasks_List; C := All_Tasks_List; P := null; while C /= null loop if C.Common.Parent = Self_ID and then C.Master_of_Task >= CM then if P /= null then P.Common.All_Tasks_Link := C.Common.All_Tasks_Link; else All_Tasks_List := C.Common.All_Tasks_Link; end if; T := C.Common.All_Tasks_Link; C.Common.All_Tasks_Link := To_Be_Freed; To_Be_Freed := C; C := T; else P := C; C := C.Common.All_Tasks_Link; end if; end loop; Unlock_All_Tasks_List; -- Free all the ATCBs on the list To_Be_Freed. -- The ATCBs in the list are no longer in All_Tasks_List, and after -- any interrupt entries are detached from them they should no longer -- be referenced. -- Global_Task_Lock (Task_Lock/Unlock) is locked in the loop below to -- avoid a race between a terminating task and its parent. The parent -- might try to deallocate the ACTB out from underneath the exiting -- task. Note that Free will also lock Global_Task_Lock, but that is -- OK, since this is the *one* lock for which we have a mechanism to -- support nested locking. See Task_Wrapper and its finalizer for more -- explanation. -- ??? -- The check "T.Common.Parent /= null ..." below is to prevent dangling -- references to terminated library-level tasks, which could -- otherwise occur during finalization of library-level objects. -- A better solution might be to hook task objects into the -- finalization chain and deallocate the ATCB when the task -- object is deallocated. However, this change is not likely -- to gain anything significant, since all this storage should -- be recovered en-masse when the process exits. while To_Be_Freed /= null loop T := To_Be_Freed; To_Be_Freed := T.Common.All_Tasks_Link; -- ??? On SGI there is currently no Interrupt_Manager, that's -- why we need to check if the Interrupt_Manager_ID is null if T.Interrupt_Entry and Interrupt_Manager_ID /= null then declare Detach_Interrupt_Entries_Index : Task_Entry_Index := 6; -- Corresponds to the entry index of System.Interrupts. -- Interrupt_Manager.Detach_Interrupt_Entries. -- Be sure to update this value when changing -- Interrupt_Manager specs. type Param_Type is access all Task_ID; Param : aliased Param_Type := T'Access; begin System.Tasking.Rendezvous.Call_Simple (Interrupt_Manager_ID, Detach_Interrupt_Entries_Index, Param'Address); end; end if; if (T.Common.Parent /= null and then T.Common.Parent.Common.Parent /= null) or else T.Master_of_Task > 3 then Initialization.Task_Lock (Self_ID); -- If Sec_Stack_Addr is not null, it means that Destroy_TSD -- has not been called yet (case of an unactivated task). if T.Common.Compiler_Data.Sec_Stack_Addr /= Null_Address then SSL.Destroy_TSD (T.Common.Compiler_Data); end if; Vulnerable_Free_Task (T); Initialization.Task_Unlock (Self_ID); end if; end loop; -- It might seem nice to let the terminated task deallocate -- its own ATCB. That would not cover the case of unactivated -- tasks. It also would force us to keep the underlying thread -- around past termination, since references to the ATCB are -- possible past termination. Currently, we get rid of the -- thread as soon as the task terminates, and let the parent -- recover the ATCB later. -- ???? -- Some day, if we want to recover the ATCB earlier, at task -- termination, we could consider using "fat task IDs", that -- include the serial number with the ATCB pointer, to catch -- references to tasks that no longer have ATCBs. It is not -- clear how much this would gain, since the user-level task -- object would still be occupying storage. -- Make next master level up active. -- We don't need to lock the ATCB, since the value is only -- updated by each task for itself. Self_ID.Master_Within := CM - 1; end Vulnerable_Complete_Master; ------------------------------ -- Vulnerable_Complete_Task -- ------------------------------ -- Complete the calling task. -- This procedure must be called with abort deferred. (That's why the -- name has "Vulnerable" in it.) It should only be called by Complete_Task -- and Finalizate_Global_Tasks (for the environment task). -- The effect is similar to that of Complete_Master. Differences include -- the closing of entries here, and computation of the number of active -- dependent tasks in Complete_Master. -- We don't lock Self_ID before the call to Vulnerable_Complete_Activation, -- because that does its own locking, and because we do not need the lock -- to test Self_ID.Common.Activator. That value should only be read and -- modified by Self. procedure Vulnerable_Complete_Task (Self_ID : Task_ID) is begin pragma Assert (Self_ID.Deferral_Level > 0); pragma Assert (Self_ID = Self); pragma Assert (Self_ID.Master_Within = Self_ID.Master_of_Task + 1 or else Self_ID.Master_Within = Self_ID.Master_of_Task + 2); pragma Assert (Self_ID.Common.Wait_Count = 0); pragma Assert (Self_ID.Open_Accepts = null); pragma Assert (Self_ID.ATC_Nesting_Level = 1); pragma Debug (Debug.Trace (Self_ID, "V_Complete_Task", 'C')); Write_Lock (Self_ID); Self_ID.Callable := False; -- In theory, Self should have no pending entry calls -- left on its call-stack. Each async. select statement should -- clean its own call, and blocking entry calls should -- defer abort until the calls are cancelled, then clean up. Cancel_Queued_Entry_Calls (Self_ID); Unlock (Self_ID); if Self_ID.Common.Activator /= null then Vulnerable_Complete_Activation (Self_ID); end if; -- If Self_ID.Master_Within = Self_ID.Master_of_Task + 2 -- we may have dependent tasks for which we need to wait. -- Otherwise, we can just exit. if Self_ID.Master_Within = Self_ID.Master_of_Task + 2 then Vulnerable_Complete_Master (Self_ID); end if; end Vulnerable_Complete_Task; -------------------------- -- Vulnerable_Free_Task -- -------------------------- -- Recover all runtime system storage associated with the task T. -- This should only be called after T has terminated and will no -- longer be referenced. -- For tasks created by an allocator that fails, due to an exception, -- it is called from Expunge_Unactivated_Tasks. -- For tasks created by elaboration of task object declarations it -- is called from the finalization code of the Task_Wrapper procedure. -- It is also called from Unchecked_Deallocation, for objects that -- are or contain tasks. procedure Vulnerable_Free_Task (T : Task_ID) is begin pragma Debug (Debug.Trace ("Vulnerable_Free_Task", T, 'C')); Write_Lock (T); Initialization.Finalize_Attributes_Link.all (T); Unlock (T); if T.Common.Task_Image /= null then Free_Task_Image (T.Common.Task_Image); end if; System.Task_Primitives.Operations.Finalize_TCB (T); end Vulnerable_Free_Task; begin -- Establish the Adafinal softlink. -- This is not done inside the central RTS initialization routine -- to avoid with-ing this package from System.Tasking.Initialization. SSL.Adafinal := Finalize_Global_Tasks'Access; -- Establish soft links for subprograms that manipulate master_id's. -- This cannot be done when the RTS is initialized, because of various -- elaboration constraints. SSL.Current_Master := Stages.Current_Master'Access; SSL.Enter_Master := Stages.Enter_Master'Access; SSL.Complete_Master := Stages.Complete_Master'Access; end System.Tasking.Stages;
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- package body Program.Nodes.Formal_Constrained_Array_Types is function Create (Array_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Left_Bracket_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Index_Subtypes : not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access; Right_Bracket_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Of_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access) return Formal_Constrained_Array_Type is begin return Result : Formal_Constrained_Array_Type := (Array_Token => Array_Token, Left_Bracket_Token => Left_Bracket_Token, Index_Subtypes => Index_Subtypes, Right_Bracket_Token => Right_Bracket_Token, Of_Token => Of_Token, Component_Definition => Component_Definition, Enclosing_Element => null) do Initialize (Result); end return; end Create; function Create (Index_Subtypes : not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access; Component_Definition : not null Program.Elements.Component_Definitions .Component_Definition_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Formal_Constrained_Array_Type is begin return Result : Implicit_Formal_Constrained_Array_Type := (Index_Subtypes => Index_Subtypes, Component_Definition => Component_Definition, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null) do Initialize (Result); end return; end Create; overriding function Index_Subtypes (Self : Base_Formal_Constrained_Array_Type) return not null Program.Elements.Discrete_Ranges .Discrete_Range_Vector_Access is begin return Self.Index_Subtypes; end Index_Subtypes; overriding function Component_Definition (Self : Base_Formal_Constrained_Array_Type) return not null Program.Elements.Component_Definitions .Component_Definition_Access is begin return Self.Component_Definition; end Component_Definition; overriding function Array_Token (Self : Formal_Constrained_Array_Type) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Array_Token; end Array_Token; overriding function Left_Bracket_Token (Self : Formal_Constrained_Array_Type) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Left_Bracket_Token; end Left_Bracket_Token; overriding function Right_Bracket_Token (Self : Formal_Constrained_Array_Type) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Right_Bracket_Token; end Right_Bracket_Token; overriding function Of_Token (Self : Formal_Constrained_Array_Type) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Of_Token; end Of_Token; overriding function Is_Part_Of_Implicit (Self : Implicit_Formal_Constrained_Array_Type) return Boolean is begin return Self.Is_Part_Of_Implicit; end Is_Part_Of_Implicit; overriding function Is_Part_Of_Inherited (Self : Implicit_Formal_Constrained_Array_Type) return Boolean is begin return Self.Is_Part_Of_Inherited; end Is_Part_Of_Inherited; overriding function Is_Part_Of_Instance (Self : Implicit_Formal_Constrained_Array_Type) return Boolean is begin return Self.Is_Part_Of_Instance; end Is_Part_Of_Instance; procedure Initialize (Self : aliased in out Base_Formal_Constrained_Array_Type'Class) is begin for Item in Self.Index_Subtypes.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; Set_Enclosing_Element (Self.Component_Definition, Self'Unchecked_Access); null; end Initialize; overriding function Is_Formal_Constrained_Array_Type_Element (Self : Base_Formal_Constrained_Array_Type) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Formal_Constrained_Array_Type_Element; overriding function Is_Formal_Type_Definition_Element (Self : Base_Formal_Constrained_Array_Type) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Formal_Type_Definition_Element; overriding function Is_Definition_Element (Self : Base_Formal_Constrained_Array_Type) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Definition_Element; overriding procedure Visit (Self : not null access Base_Formal_Constrained_Array_Type; Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is begin Visitor.Formal_Constrained_Array_Type (Self); end Visit; overriding function To_Formal_Constrained_Array_Type_Text (Self : aliased in out Formal_Constrained_Array_Type) return Program.Elements.Formal_Constrained_Array_Types .Formal_Constrained_Array_Type_Text_Access is begin return Self'Unchecked_Access; end To_Formal_Constrained_Array_Type_Text; overriding function To_Formal_Constrained_Array_Type_Text (Self : aliased in out Implicit_Formal_Constrained_Array_Type) return Program.Elements.Formal_Constrained_Array_Types .Formal_Constrained_Array_Type_Text_Access is pragma Unreferenced (Self); begin return null; end To_Formal_Constrained_Array_Type_Text; end Program.Nodes.Formal_Constrained_Array_Types;
----------------------------------------------------------------------- -- Regtests.Images.Model -- Regtests.Images.Model ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-body.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 166 ----------------------------------------------------------------------- -- Copyright (C) 2011 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Unchecked_Deallocation; with Util.Beans.Objects.Time; package body Regtests.Images.Model is use type ADO.Objects.Object_Record_Access; use type ADO.Objects.Object_Ref; use type ADO.Objects.Object_Record; function Image_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_STRING, Of_Class => IMAGE_TABLE'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Image_Key; function Image_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_STRING, Of_Class => IMAGE_TABLE'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Image_Key; function "=" (Left, Right : Image_Ref'Class) return Boolean is begin return ADO.Objects.Object_Ref'Class (Left) = ADO.Objects.Object_Ref'Class (Right); end "="; procedure Set_Field (Object : in out Image_Ref'Class; Impl : out Image_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Image_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Image_Ref) is Impl : Image_Access; begin Impl := new Image_Impl; Impl.Version := 0; Impl.Create_Date := ADO.DEFAULT_TIME; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Image -- ---------------------------------------- procedure Set_Id (Object : in out Image_Ref; Value : in ADO.Identifier) is Impl : Image_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Image_Ref) return ADO.Identifier is Impl : constant Image_Access := Image_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Image_Ref) return Integer is Impl : constant Image_Access := Image_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Create_Date (Object : in out Image_Ref; Value : in Ada.Calendar.Time) is Impl : Image_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 3, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Image_Ref) return Ada.Calendar.Time is Impl : constant Image_Access := Image_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Image (Object : in out Image_Ref; Value : in ADO.Blob_Ref) is Impl : Image_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Blob (Impl.all, 4, Impl.Image, Value); end Set_Image; function Get_Image (Object : in Image_Ref) return ADO.Blob_Ref is Impl : constant Image_Access := Image_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Image; end Get_Image; -- Copy of the object. procedure Copy (Object : in Image_Ref; Into : in out Image_Ref) is Result : Image_Ref; begin if not Object.Is_Null then declare Impl : constant Image_Access := Image_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Image_Access := new Image_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Version := Impl.Version; Copy.Create_Date := Impl.Create_Date; Copy.Image := Impl.Image; end; end if; Into := Result; end Copy; procedure Find (Object : in out Image_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Image_Access := new Image_Impl; begin Impl.Find (Session, Query, Found); if Found then ADO.Objects.Set_Object (Object, Impl.all'Access); else ADO.Objects.Set_Object (Object, null); Destroy (Impl); end if; end Find; procedure Load (Object : in out Image_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Image_Access := new Image_Impl; Found : Boolean; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); raise ADO.Objects.NOT_FOUND; end if; ADO.Objects.Set_Object (Object, Impl.all'Access); end Load; procedure Load (Object : in out Image_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Image_Access := new Image_Impl; Query : ADO.SQL.Query; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Impl.Find (Session, Query, Found); if not Found then Destroy (Impl); else ADO.Objects.Set_Object (Object, Impl.all'Access); end if; end Load; procedure Save (Object : in out Image_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl = null then Impl := new Image_Impl; ADO.Objects.Set_Object (Object, Impl); end if; if not ADO.Objects.Is_Created (Impl.all) then Impl.Create (Session); else Impl.Save (Session); end if; end Save; procedure Delete (Object : in out Image_Ref; Session : in out ADO.Sessions.Master_Session'Class) is Impl : constant ADO.Objects.Object_Record_Access := Object.Get_Object; begin if Impl /= null then Impl.Delete (Session); end if; end Delete; -- -------------------- -- Free the object -- -------------------- procedure Destroy (Object : access Image_Impl) is type Image_Impl_Ptr is access all Image_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Image_Impl, Image_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Image_Impl_Ptr := Image_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Image_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (IMAGE_TABLE'Access); begin Stmt.Set_Parameters (Query); Stmt.Execute; if Stmt.Has_Elements then Object.Load (Stmt, Session); Stmt.Next; Found := not Stmt.Has_Elements; else Found := False; end if; end Find; overriding procedure Load (Object : in out Image_Impl; Session : in out ADO.Sessions.Session'Class) is Found : Boolean; Query : ADO.SQL.Query; Id : constant ADO.Identifier := Object.Get_Key_Value; begin Query.Bind_Param (Position => 1, Value => Id); Query.Set_Filter ("id = ?"); Object.Find (Session, Query, Found); if not Found then raise ADO.Objects.NOT_FOUND; end if; end Load; procedure Save (Object : in out Image_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (IMAGE_TABLE'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_1_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_1_NAME, -- image Value => Object.Image); Object.Clear_Modified (4); end if; if Stmt.Has_Save_Fields then Object.Version := Object.Version + 1; Stmt.Save_Field (Name => "version", Value => Object.Version); Stmt.Set_Filter (Filter => "id = ? and version = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Add_Param (Value => Object.Version - 1); declare Result : Integer; begin Stmt.Execute (Result); if Result /= 1 then if Result /= 0 then raise ADO.Objects.UPDATE_ERROR; else raise ADO.Objects.LAZY_LOCK; end if; end if; end; end if; end Save; procedure Create (Object : in out Image_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (IMAGE_TABLE'Access); Result : Integer; begin Object.Version := 1; Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_1_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_1_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_2_1_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_3_1_NAME, -- image Value => Object.Image); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); end Create; procedure Delete (Object : in out Image_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (IMAGE_TABLE'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; function Get_Value (Item : in Image_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : constant ADO.Objects.Object_Record_Access := Item.Get_Load_Object; Impl : access Image_Impl; begin if Obj = null then return Util.Beans.Objects.Null_Object; end if; Impl := Image_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); end if; if Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); end if; return Util.Beans.Objects.Null_Object; end Get_Value; procedure List (Object : in out Image_Vector; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (IMAGE_TABLE'Access); begin Stmt.Set_Parameters (Query); Stmt.Execute; Image_Vectors.Clear (Object); while Stmt.Has_Elements loop declare Item : Image_Ref; Impl : constant Image_Access := new Image_Impl; begin Impl.Load (Stmt, Session); ADO.Objects.Set_Object (Item, Impl.all'Access); Object.Append (Item); end; Stmt.Next; end loop; end List; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Image_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is pragma Unreferenced (Session); begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Create_Date := Stmt.Get_Time (2); Object.Image := Stmt.Get_Blob (3); Object.Version := Stmt.Get_Integer (1); ADO.Objects.Set_Created (Object); end Load; end Regtests.Images.Model;
-- with Ada.Text_IO; use Ada.Text_IO; with Atomic; use Atomic; package body BBqueue with SPARK_Mode => On is ----------- -- Grant -- ----------- procedure Grant (This : in out Offsets_Only; G : in out Write_Grant; Size : Count) is Read, Write, Start : Count; Max : constant Count := This.Size; Already_Inverted : Boolean; In_Progress : Boolean; begin if Size = 0 then G.Result := Empty; G.Slice := Empty_Slice; return; end if; Test_And_Set (This.Write_In_Progress, In_Progress, Acq_Rel); if In_Progress then G.Result := Grant_In_Progress; G.Slice := Empty_Slice; return; end if; if Size > This.Size then Clear (This.Write_In_Progress, Release); G.Result := Insufficient_Size; G.Slice := Empty_Slice; return; end if; -- Writer component. Must never write to `read`, -- be careful writing to `load` Write := Atomic_Count.Load (This.Write, Acquire); Read := Atomic_Count.Load (This.Read, Acquire); Already_Inverted := Write < Read; if Already_Inverted then -- The original comparison is ((Write + Size) < Read), it is modified -- to avoid integer overflow. if Count'Last - Size >= Write and then (Write + Size) < Read then -- Inverted, room is still available Start := Write; else -- Inverted, no room is available Clear (This.Write_In_Progress, Release); G.Result := Insufficient_Size; G.Slice := Empty_Slice; This.Granted_Write_Size := 0; return; end if; else -- The original comparison is ((Write + Size) <= Max), it is modified -- to avoid integer overflow. if Count'Last - Size >= Write and then (Write + Size) <= Max then -- Non inverted condition Start := Write; else -- Not inverted, but need to go inverted -- NOTE: We check Size < Read, NOT <=, because -- write must never == read in an inverted condition, since -- we will then not be able to tell if we are inverted or not if Size < Read then Start := 0; else -- Inverted, no room is available Clear (This.Write_In_Progress, Release); G.Result := Insufficient_Size; G.Slice := Empty_Slice; This.Granted_Write_Size := 0; return; end if; end if; end if; -- This is what we want to prove: the granted slice is in the writeable -- area. pragma Assert (Size /= 0); pragma Assert (In_Writable_Area (This, Start)); pragma Assert (In_Writable_Area (This, Start + Size - 1)); Atomic_Count.Store (This.Reserve, Start + Size, Release); This.Granted_Write_Size := Size; G.Result := Valid; G.Slice := (Size, Start, Start + Size - 1); end Grant; ------------ -- Commit -- ------------ procedure Commit (This : in out Offsets_Only; G : in out Write_Grant; Size : Count := Count'Last) is Used, Write, Last, New_Write : Count; Max : constant Count := This.Size; Len : constant Count := This.Granted_Write_Size; begin -- If there is no grant in progress, return early. This -- generally means we are dropping the grant within a -- wrapper structure if not Set (This.Write_In_Progress, Acquire) then return; end if; -- Writer component. Must never write to READ, -- be careful writing to LAST -- Saturate the grant commit Used := Count'Min (Len, Size); Write := Atomic_Count.Load (This.Write, Acquire); Atomic_Count.Sub (This.Reserve, Len - Used, Acq_Rel); Last := Atomic_Count.Load (This.Last, Acquire); New_Write := Atomic_Count.Load (This.Reserve, Acquire); if (New_Write < Write) and then (Write /= Max) then -- We have already wrapped, but we are skipping some bytes at the end -- of the ring. Mark `last` where the write pointer used to be to hold -- the line here Atomic_Count.Store (This.Last, Write, Release); elsif New_Write > Last then -- We're about to pass the last pointer, which was previously the -- artificial end of the ring. Now that we've passed it, we can -- "unlock" the section that was previously skipped. -- -- Since new_write is strictly larger than last, it is safe to move -- this as the other thread will still be halted by the (about to be -- updated) write value Atomic_Count.Store (This.Last, Max, Release); end if; -- else: If new_write == last, either: -- * last == max, so no need to write, OR -- * If we write in the end chunk again, we'll update last to max next -- time -- * If we write to the start chunk in a wrap, we'll update last when we -- move write backwards -- Write must be updated AFTER last, otherwise read could think it was -- time to invert early! Atomic_Count.Store (This.Write, New_Write, Release); -- Nothing granted anymore This.Granted_Write_Size := 0; G.Result := Empty; G.Slice := Empty_Slice; -- Allow subsequent grants Clear (This.Write_In_Progress, Release); end Commit; ---------- -- Read -- ---------- procedure Read (This : in out Offsets_Only; G : in out Read_Grant; Max : Count := Count'Last) is Read, Write, Last, Size : Count; In_Progress : Boolean; begin Test_And_Set (This.Read_In_Progress, In_Progress, Acq_Rel); if In_Progress then G.Result := Grant_In_Progress; G.Slice := Empty_Slice; return; end if; Write := Atomic_Count.Load (This.Write, Acquire); Read := Atomic_Count.Load (This.Read, Acquire); Last := Atomic_Count.Load (This.Last, Acquire); -- Resolve the inverted case or end of read if Read = Last and then Write < Read then Read := 0; -- This has some room for error, the other thread reads this -- Impact to Grant: -- Grant checks if read < write to see if inverted. If not -- inverted, but no space left, Grant will initiate an inversion, -- but will not trigger it -- Impact to Commit: -- Commit does not check read, but if Grant has started an -- inversion, grant could move Last to the prior write position -- MOVING READ BACKWARDS! Atomic_Count.Store (This.Read, 0, Release); end if; Size := (if Write < Read then Last - Read else Write - Read); -- Bound the slice with the maximum size requested by the user Size := Count'Min (Size, Max); if Size = 0 then Clear (This.Read_In_Progress); G.Result := Empty; G.Slice := Empty_Slice; return; end if; -- This is what we want to prove: the granted slice is in the readable -- area. pragma Assert (Size /= 0); pragma Assert (In_Readable_Area (This, Read)); pragma Assert (In_Readable_Area (This, Read + Size - 1)); This.Granted_Read_Size := Size; G.Result := Valid; G.Slice := (Size, Read, Read + Size - 1); end Read; ------------- -- Release -- ------------- procedure Release (This : in out Offsets_Only; G : in out Read_Grant; Size : Count := Count'Last) is Used : Count; begin -- Saturate the grant commit Used := Count'Min (This.Granted_Read_Size, Size); -- If there is no grant in progress, return early. This -- generally means we are dropping the grant within a -- wrapper structure if not Set (This.Read_In_Progress, Acquire) then return; end if; -- This should always be checked by the public interfaces -- debug_assert! (used <= self.buf.len ()); -- This should be fine, purely incrementing Atomic_Count.Add (This.Read, Used, Release); -- Nothing granted anymore This.Granted_Read_Size := 0; G.Result := Empty; G.Slice := Empty_Slice; -- Allow subsequent read Clear (This.Read_In_Progress, Release); end Release; end BBqueue;
-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2016 onox <denkpadje@gmail.com> -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. with Orka.SIMD.SSE2.Doubles; package Orka.SIMD.SSE4_1.Doubles.Math is pragma Pure; use Orka.SIMD.SSE2.Doubles; function Round (Elements : m128d; Rounding : Unsigned_32) return m128d with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_roundpd"; function Round_Nearest_Integer (Elements : m128d) return m128d is (Round (Elements, 0)); -- Round each element to the nearest integer function Floor (Elements : m128d) return m128d is (Round (Elements, 1)); -- Round each element down to an integer value function Ceil (Elements : m128d) return m128d is (Round (Elements, 2)); -- Round each element up to an integer value function Round_Truncate (Elements : m128d) return m128d is (Round (Elements, 3)); -- Round each element to zero end Orka.SIMD.SSE4_1.Doubles.Math;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Generic_Collections; package AMF.UML.Time_Events.Collections is pragma Preelaborate; package UML_Time_Event_Collections is new AMF.Generic_Collections (UML_Time_Event, UML_Time_Event_Access); type Set_Of_UML_Time_Event is new UML_Time_Event_Collections.Set with null record; Empty_Set_Of_UML_Time_Event : constant Set_Of_UML_Time_Event; type Ordered_Set_Of_UML_Time_Event is new UML_Time_Event_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_UML_Time_Event : constant Ordered_Set_Of_UML_Time_Event; type Bag_Of_UML_Time_Event is new UML_Time_Event_Collections.Bag with null record; Empty_Bag_Of_UML_Time_Event : constant Bag_Of_UML_Time_Event; type Sequence_Of_UML_Time_Event is new UML_Time_Event_Collections.Sequence with null record; Empty_Sequence_Of_UML_Time_Event : constant Sequence_Of_UML_Time_Event; private Empty_Set_Of_UML_Time_Event : constant Set_Of_UML_Time_Event := (UML_Time_Event_Collections.Set with null record); Empty_Ordered_Set_Of_UML_Time_Event : constant Ordered_Set_Of_UML_Time_Event := (UML_Time_Event_Collections.Ordered_Set with null record); Empty_Bag_Of_UML_Time_Event : constant Bag_Of_UML_Time_Event := (UML_Time_Event_Collections.Bag with null record); Empty_Sequence_Of_UML_Time_Event : constant Sequence_Of_UML_Time_Event := (UML_Time_Event_Collections.Sequence with null record); end AMF.UML.Time_Events.Collections;
------------------------------------------------------------------------------ -- Copyright (c) 2015, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Natools.Web.Filters.Pass_Through provides a filter which copies directly -- -- input into output, without any change. -- ------------------------------------------------------------------------------ with Natools.S_Expressions.Lockable; package Natools.Web.Filters.Pass_Through is pragma Preelaborate; type Filter is new Filters.Filter with private; overriding procedure Apply (Object : in Filter; Output : in out Ada.Streams.Root_Stream_Type'Class; Data : in Ada.Streams.Stream_Element_Array); -- Transform Data into basic HTML and append it to Output function Create (Arguments : in out S_Expressions.Lockable.Descriptor'Class) return Filters.Filter'Class; -- Build a text block filter private type Filter is new Filters.Filter with null record; end Natools.Web.Filters.Pass_Through;
----------------------------------------------------------------------- -- el-expressions-nodes -- Expression Nodes -- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2020, 2021 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- The 'ELNode' describes an expression that can later be evaluated -- on an expression context. Expressions are parsed and translated -- to a read-only tree. with EL.Functions; with Ada.Strings.Wide_Wide_Unbounded; private with Ada.Strings.Unbounded; with Util.Concurrent.Counters; private package EL.Expressions.Nodes is pragma Preelaborate; use EL.Functions; use Ada.Strings.Wide_Wide_Unbounded; use Ada.Strings.Unbounded; type Reduction; type ELNode is abstract tagged limited record Ref_Counter : Util.Concurrent.Counters.Counter; end record; type ELNode_Access is access all ELNode'Class; type Reduction is record Node : ELNode_Access; Value : EL.Objects.Object; end record; -- Evaluate a node on a given context. If function Get_Safe_Value (Expr : in ELNode; Context : in ELContext'Class) return Object; -- Evaluate a node on a given context. function Get_Value (Expr : in ELNode; Context : in ELContext'Class) return Object is abstract; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. function Reduce (Expr : access ELNode; Context : in ELContext'Class) return Reduction is abstract; -- Delete the expression tree (calls Delete (ELNode_Access) recursively). procedure Delete (Node : in out ELNode) is abstract; -- Delete the expression tree. Free the memory allocated by nodes -- of the expression tree. Clears the node pointer. procedure Delete (Node : in out ELNode_Access); -- ------------------------------ -- Unary expression node -- ------------------------------ type ELUnary is new ELNode with private; type Unary_Node is (EL_VOID, EL_NOT, EL_MINUS, EL_EMPTY); -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELUnary; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELUnary; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELUnary); -- ------------------------------ -- Binary expression node -- ------------------------------ type ELBinary is new ELNode with private; type Binary_Node is (EL_EQ, EL_NE, EL_LE, EL_LT, EL_GE, EL_GT, EL_ADD, EL_SUB, EL_MUL, EL_DIV, EL_MOD, EL_AND, EL_OR, EL_LAND, EL_LOR, EL_CONCAT); -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELBinary; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELBinary; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELBinary); -- ------------------------------ -- Ternary expression node -- ------------------------------ type ELTernary is new ELNode with private; -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELTernary; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELTernary; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELTernary); -- ------------------------------ -- Variable to be looked at in the expression context -- ------------------------------ type ELVariable is new ELNode with private; -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELVariable; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELVariable; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELVariable); -- ------------------------------ -- Value property referring to a variable -- ------------------------------ type ELValue (Len : Natural) is new ELNode with private; type ELValue_Access is access all ELValue'Class; -- Check if the target bean is a readonly bean. function Is_Readonly (Node : in ELValue; Context : in ELContext'Class) return Boolean; -- Get the variable name. function Get_Variable_Name (Node : in ELValue) return String; -- Evaluate the node and return a method info with -- the bean object and the method binding. function Get_Method_Info (Node : in ELValue; Context : in ELContext'Class) return Method_Info; -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELValue; Context : ELContext'Class) return Object; -- Evaluate the node and set the value on the associated bean. -- Raises Invalid_Variable if the target object is not a bean. -- Raises Invalid_Expression if the target bean is not writeable. procedure Set_Value (Node : in ELValue; Context : in ELContext'Class; Value : in Objects.Object); -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELValue; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELValue); -- ------------------------------ -- Literal object (integer, boolean, float, string) -- ------------------------------ type ELObject is new ELNode with private; -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELObject; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELObject; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELObject); -- ------------------------------ -- Function call with up to 4 arguments -- ------------------------------ type ELFunction is new ELNode with private; -- Evaluate a node on a given context. overriding function Get_Value (Expr : ELFunction; Context : ELContext'Class) return Object; -- Reduce the expression by eliminating variables which are known -- and computing constant expressions. Returns either a new expression -- tree or a constant value. overriding function Reduce (Expr : access ELFunction; Context : in ELContext'Class) return Reduction; overriding procedure Delete (Node : in out ELFunction); -- Create constant nodes function Create_Node (Value : Boolean) return ELNode_Access; function Create_Node (Value : Long_Long_Integer) return ELNode_Access; function Create_Node (Value : String) return ELNode_Access; function Create_Node (Value : Wide_Wide_String) return ELNode_Access; function Create_Node (Value : Long_Float) return ELNode_Access; function Create_Node (Value : Unbounded_Wide_Wide_String) return ELNode_Access; function Create_Variable (Name : in Wide_Wide_String) return ELNode_Access; function Create_Value (Variable : in ELNode_Access; Name : in Wide_Wide_String) return ELNode_Access; -- Create unary expressions function Create_Node (Of_Type : Unary_Node; Expr : ELNode_Access) return ELNode_Access; -- Create binary expressions function Create_Node (Of_Type : Binary_Node; Left : ELNode_Access; Right : ELNode_Access) return ELNode_Access; -- Create a ternary expression. function Create_Node (Cond : ELNode_Access; Left : ELNode_Access; Right : ELNode_Access) return ELNode_Access; -- Create a function call function Create_Node (Func : EL.Functions.Function_Access; Arg1 : ELNode_Access) return ELNode_Access; -- Create a function call function Create_Node (Func : EL.Functions.Function_Access; Arg1 : ELNode_Access; Arg2 : ELNode_Access) return ELNode_Access; -- Create a function call function Create_Node (Func : EL.Functions.Function_Access; Arg1 : ELNode_Access; Arg2 : ELNode_Access; Arg3 : ELNode_Access) return ELNode_Access; -- Create a function call function Create_Node (Func : EL.Functions.Function_Access; Arg1 : ELNode_Access; Arg2 : ELNode_Access; Arg3 : ELNode_Access; Arg4 : ELNode_Access) return ELNode_Access; private type ELUnary is new ELNode with record Kind : Unary_Node; Node : ELNode_Access; end record; -- ------------------------------ -- Binary nodes -- ------------------------------ type ELBinary is new ELNode with record Kind : Binary_Node; Left : ELNode_Access; Right : ELNode_Access; end record; -- ------------------------------ -- Ternary expression -- ------------------------------ type ELTernary is new ELNode with record Cond : ELNode_Access; Left : ELNode_Access; Right : ELNode_Access; end record; -- #{bean.name} - Bean name, Bean property -- #{bean[12]} - Bean name, -- Variable to be looked at in the expression context type ELVariable is new ELNode with record Name : Unbounded_String; end record; type ELVariable_Access is access all ELVariable; type ELValue (Len : Natural) is new ELNode with record Variable : ELNode_Access; Name : String (1 .. Len); end record; -- A literal object (integer, boolean, float, String) type ELObject is new ELNode with record Value : Object; end record; -- A function call with up to 4 arguments. type ELFunction is new ELNode with record Func : EL.Functions.Function_Access; Arg1 : ELNode_Access; Arg2 : ELNode_Access; Arg3 : ELNode_Access; Arg4 : ELNode_Access; end record; end EL.Expressions.Nodes;
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="11"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>dct_Loop_Col_DCT_Loop_proc</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>col_inbuf_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>col_inbuf_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>col_inbuf_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>col_inbuf_3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>col_inbuf_4</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>col_inbuf_5</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>col_inbuf_6</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>col_inbuf_7</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>1</if_type> <array_size>8</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>col_outbuf_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>dst</originalName> <rtlName></rtlName> <coreName>RAM</coreName> </Obj> <bitwidth>16</bitwidth> </Value> <direction>1</direction> <if_type>1</if_type> <array_size>64</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>88</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_10"> <Value> <Obj> <type>0</type> <id>18</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>116</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>20</id> <name>indvar_flatten</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>118</item> <item>119</item> <item>120</item> <item>121</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>21</id> <name>i_2_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second class_id="12" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="13" tracking_level="0" version="0"> <first class_id="14" tracking_level="0" version="0"> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>123</item> <item>124</item> <item>125</item> <item>126</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>22</id> <name>k_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>k</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>127</item> <item>128</item> <item>129</item> <item>130</item> </oprand_edges> <opcode>phi</opcode> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>23</id> <name>exitcond_flatten</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>131</item> <item>133</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>24</id> <name>indvar_flatten_next</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>134</item> <item>136</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>25</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>137</item> <item>138</item> <item>139</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>29</id> <name>exitcond1_i4</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>140</item> <item>142</item> </oprand_edges> <opcode>icmp</opcode> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>30</id> <name>k_i_mid2</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>143</item> <item>144</item> <item>145</item> </oprand_edges> <opcode>select</opcode> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>31</id> <name>i2</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>87</lineNumber> <contextFuncName>dct_2d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>87</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>146</item> <item>148</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>32</id> <name>i_2_i_mid2</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>149</item> <item>150</item> <item>151</item> </oprand_edges> <opcode>select</opcode> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>33</id> <name>tmp_71_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>152</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>37</id> <name>tmp_i_10</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>153</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>38</id> <name>dct_coeff_table_0_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>154</item> <item>156</item> <item>157</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>39</id> <name>dct_coeff_table_0_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>14</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>158</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>40</id> <name>coeff_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>159</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>41</id> <name>col_inbuf_0_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>160</item> <item>161</item> <item>162</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>42</id> <name>col_inbuf_0_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>163</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>43</id> <name>tmp_72_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>164</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>44</id> <name>tmp_8_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>165</item> <item>166</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>45</id> <name>dct_coeff_table_1_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>167</item> <item>168</item> <item>169</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>46</id> <name>dct_coeff_table_1_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>170</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>47</id> <name>coeff_1_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>171</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>48</id> <name>col_inbuf_1_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>172</item> <item>173</item> <item>174</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>49</id> <name>col_inbuf_1_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>175</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>50</id> <name>tmp_72_1_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>176</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>51</id> <name>tmp_8_1_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>177</item> <item>178</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>52</id> <name>dct_coeff_table_2_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>179</item> <item>180</item> <item>181</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>53</id> <name>dct_coeff_table_2_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>182</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>54</id> <name>coeff_2_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>183</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>55</id> <name>col_inbuf_2_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>184</item> <item>185</item> <item>186</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>56</id> <name>col_inbuf_2_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>187</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>57</id> <name>tmp_72_2_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>188</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>58</id> <name>tmp_8_2_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>189</item> <item>190</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>59</id> <name>dct_coeff_table_3_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>191</item> <item>192</item> <item>193</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>60</id> <name>dct_coeff_table_3_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>194</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>61</id> <name>coeff_3_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>195</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>62</id> <name>col_inbuf_3_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>196</item> <item>197</item> <item>198</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>63</id> <name>col_inbuf_3_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>199</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>64</id> <name>tmp_72_3_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>200</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>65</id> <name>tmp_8_3_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>201</item> <item>202</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>66</id> <name>dct_coeff_table_4_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>203</item> <item>204</item> <item>205</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>67</id> <name>dct_coeff_table_4_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>206</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>68</id> <name>coeff_4_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>207</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>69</id> <name>col_inbuf_4_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>208</item> <item>209</item> <item>210</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>70</id> <name>col_inbuf_4_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>211</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>71</id> <name>tmp_72_4_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>212</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>72</id> <name>tmp_8_4_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>213</item> <item>214</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>73</id> <name>dct_coeff_table_5_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>215</item> <item>216</item> <item>217</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>74</id> <name>dct_coeff_table_5_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>218</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>75</id> <name>coeff_5_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>219</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>76</id> <name>col_inbuf_5_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>220</item> <item>221</item> <item>222</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>77</id> <name>col_inbuf_5_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>223</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>78</id> <name>tmp_72_5_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>224</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>79</id> <name>tmp_8_5_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>225</item> <item>226</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>80</id> <name>dct_coeff_table_6_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>227</item> <item>228</item> <item>229</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>81</id> <name>dct_coeff_table_6_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>230</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>82</id> <name>coeff_6_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>231</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>83</id> <name>col_inbuf_6_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>232</item> <item>233</item> <item>234</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>84</id> <name>col_inbuf_6_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>235</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>85</id> <name>tmp_72_6_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>236</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>86</id> <name>tmp_8_6_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>237</item> <item>238</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>87</id> <name>dct_coeff_table_7_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>239</item> <item>240</item> <item>241</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>88</id> <name>dct_coeff_table_7_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>15</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>242</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>89</id> <name>coeff_7_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>60</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>243</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>90</id> <name>col_inbuf_7_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>244</item> <item>245</item> <item>246</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>91</id> <name>col_inbuf_7_load</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>247</item> </oprand_edges> <opcode>load</opcode> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>92</id> <name>tmp_72_7_cast_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>248</item> </oprand_edges> <opcode>sext</opcode> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>93</id> <name>tmp_8_7_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>61</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>249</item> <item>250</item> </oprand_edges> <opcode>mul</opcode> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>94</id> <name>tmp1</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>251</item> <item>252</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>95</id> <name>tmp2</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>253</item> <item>254</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>96</id> <name>tmp</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>255</item> <item>256</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>97</id> <name>tmp4</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>257</item> <item>258</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>98</id> <name>tmp6</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>259</item> <item>261</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>99</id> <name>tmp5</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>262</item> <item>263</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>100</id> <name>tmp3</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>264</item> <item>265</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>101</id> <name>tmp_2_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>266</item> <item>267</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>102</id> <name>tmp_4_i</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>269</item> <item>270</item> <item>272</item> <item>274</item> </oprand_edges> <opcode>partselect</opcode> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>103</id> <name>tmp_i_trn_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>275</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>104</id> <name>tmp_8</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>277</item> <item>278</item> <item>280</item> </oprand_edges> <opcode>bitconcatenate</opcode> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>105</id> <name>p_addr_cast</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>281</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>106</id> <name>p_addr1</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>282</item> <item>283</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>107</id> <name>tmp_9</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>284</item> </oprand_edges> <opcode>zext</opcode> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>108</id> <name>col_outbuf_i_addr</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>6</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>285</item> <item>286</item> <item>287</item> </oprand_edges> <opcode>getelementptr</opcode> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>109</id> <name></name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>63</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>63</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>288</item> <item>289</item> </oprand_edges> <opcode>store</opcode> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>111</id> <name>k</name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName>k</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>290</item> <item>291</item> </oprand_edges> <opcode>add</opcode> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>112</id> <name></name> <fileName>dct.cpp</fileName> <fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory> <lineNumber>57</lineNumber> <contextFuncName>dct_1d</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>dct.cpp</first> <second>dct</second> </first> <second>130</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_1d</second> </first> <second>57</second> </item> <item> <first> <first>dct.cpp</first> <second>dct_2d</second> </first> <second>88</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>292</item> </oprand_edges> <opcode>br</opcode> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>114</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_98"> <Value> <Obj> <type>2</type> <id>117</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_99"> <Value> <Obj> <type>2</type> <id>122</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_100"> <Value> <Obj> <type>2</type> <id>132</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>64</content> </item> <item class_id_reference="16" object_id="_101"> <Value> <Obj> <type>2</type> <id>135</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_102"> <Value> <Obj> <type>2</type> <id>141</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_103"> <Value> <Obj> <type>2</type> <id>147</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_104"> <Value> <Obj> <type>2</type> <id>155</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_105"> <Value> <Obj> <type>2</type> <id>260</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>29</bitwidth> </Value> <const_type>0</const_type> <content>4096</content> </item> <item class_id_reference="16" object_id="_106"> <Value> <Obj> <type>2</type> <id>271</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>13</content> </item> <item class_id_reference="16" object_id="_107"> <Value> <Obj> <type>2</type> <id>273</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>28</content> </item> <item class_id_reference="16" object_id="_108"> <Value> <Obj> <type>2</type> <id>279</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_109"> <Obj> <type>3</type> <id>19</id> <name>newFuncRoot</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>18</item> </node_objs> </item> <item class_id_reference="18" object_id="_110"> <Obj> <type>3</type> <id>26</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>20</item> <item>21</item> <item>22</item> <item>23</item> <item>24</item> <item>25</item> </node_objs> </item> <item class_id_reference="18" object_id="_111"> <Obj> <type>3</type> <id>113</id> <name>dct_1d.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>80</count> <item_version>0</item_version> <item>29</item> <item>30</item> <item>31</item> <item>32</item> <item>33</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <item>41</item> <item>42</item> <item>43</item> <item>44</item> <item>45</item> <item>46</item> <item>47</item> <item>48</item> <item>49</item> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> <item>60</item> <item>61</item> <item>62</item> <item>63</item> <item>64</item> <item>65</item> <item>66</item> <item>67</item> <item>68</item> <item>69</item> <item>70</item> <item>71</item> <item>72</item> <item>73</item> <item>74</item> <item>75</item> <item>76</item> <item>77</item> <item>78</item> <item>79</item> <item>80</item> <item>81</item> <item>82</item> <item>83</item> <item>84</item> <item>85</item> <item>86</item> <item>87</item> <item>88</item> <item>89</item> <item>90</item> <item>91</item> <item>92</item> <item>93</item> <item>94</item> <item>95</item> <item>96</item> <item>97</item> <item>98</item> <item>99</item> <item>100</item> <item>101</item> <item>102</item> <item>103</item> <item>104</item> <item>105</item> <item>106</item> <item>107</item> <item>108</item> <item>109</item> <item>111</item> <item>112</item> </node_objs> </item> <item class_id_reference="18" object_id="_112"> <Obj> <type>3</type> <id>115</id> <name>.preheader.i.exitStub</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>114</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>166</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_113"> <id>116</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>18</sink_obj> </item> <item class_id_reference="20" object_id="_114"> <id>118</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_115"> <id>119</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_116"> <id>120</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_117"> <id>121</id> <edge_type>2</edge_type> <source_obj>113</source_obj> <sink_obj>20</sink_obj> </item> <item class_id_reference="20" object_id="_118"> <id>123</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_119"> <id>124</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_120"> <id>125</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_121"> <id>126</id> <edge_type>2</edge_type> <source_obj>113</source_obj> <sink_obj>21</sink_obj> </item> <item class_id_reference="20" object_id="_122"> <id>127</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_123"> <id>128</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_124"> <id>129</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_125"> <id>130</id> <edge_type>2</edge_type> <source_obj>113</source_obj> <sink_obj>22</sink_obj> </item> <item class_id_reference="20" object_id="_126"> <id>131</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_127"> <id>133</id> <edge_type>1</edge_type> <source_obj>132</source_obj> <sink_obj>23</sink_obj> </item> <item class_id_reference="20" object_id="_128"> <id>134</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_129"> <id>136</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>24</sink_obj> </item> <item class_id_reference="20" object_id="_130"> <id>137</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_131"> <id>138</id> <edge_type>2</edge_type> <source_obj>113</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_132"> <id>139</id> <edge_type>2</edge_type> <source_obj>115</source_obj> <sink_obj>25</sink_obj> </item> <item class_id_reference="20" object_id="_133"> <id>140</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_134"> <id>142</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>29</sink_obj> </item> <item class_id_reference="20" object_id="_135"> <id>143</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_136"> <id>144</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_137"> <id>145</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>30</sink_obj> </item> <item class_id_reference="20" object_id="_138"> <id>146</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_139"> <id>148</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>31</sink_obj> </item> <item class_id_reference="20" object_id="_140"> <id>149</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_141"> <id>150</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_142"> <id>151</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>32</sink_obj> </item> <item class_id_reference="20" object_id="_143"> <id>152</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> </item> <item class_id_reference="20" object_id="_144"> <id>153</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>37</sink_obj> </item> <item class_id_reference="20" object_id="_145"> <id>154</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_146"> <id>156</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_147"> <id>157</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>38</sink_obj> </item> <item class_id_reference="20" object_id="_148"> <id>158</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> </item> <item class_id_reference="20" object_id="_149"> <id>159</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> </item> <item class_id_reference="20" object_id="_150"> <id>160</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_151"> <id>161</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_152"> <id>162</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>41</sink_obj> </item> <item class_id_reference="20" object_id="_153"> <id>163</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>42</sink_obj> </item> <item class_id_reference="20" object_id="_154"> <id>164</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>43</sink_obj> </item> <item class_id_reference="20" object_id="_155"> <id>165</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_156"> <id>166</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>44</sink_obj> </item> <item class_id_reference="20" object_id="_157"> <id>167</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_158"> <id>168</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_159"> <id>169</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>45</sink_obj> </item> <item class_id_reference="20" object_id="_160"> <id>170</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> </item> <item class_id_reference="20" object_id="_161"> <id>171</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> </item> <item class_id_reference="20" object_id="_162"> <id>172</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_163"> <id>173</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_164"> <id>174</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>48</sink_obj> </item> <item class_id_reference="20" object_id="_165"> <id>175</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> </item> <item class_id_reference="20" object_id="_166"> <id>176</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>50</sink_obj> </item> <item class_id_reference="20" object_id="_167"> <id>177</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_168"> <id>178</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>51</sink_obj> </item> <item class_id_reference="20" object_id="_169"> <id>179</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_170"> <id>180</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_171"> <id>181</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>52</sink_obj> </item> <item class_id_reference="20" object_id="_172"> <id>182</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> </item> <item class_id_reference="20" object_id="_173"> <id>183</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>54</sink_obj> </item> <item class_id_reference="20" object_id="_174"> <id>184</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_175"> <id>185</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_176"> <id>186</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>55</sink_obj> </item> <item class_id_reference="20" object_id="_177"> <id>187</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>56</sink_obj> </item> <item class_id_reference="20" object_id="_178"> <id>188</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> </item> <item class_id_reference="20" object_id="_179"> <id>189</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_180"> <id>190</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>58</sink_obj> </item> <item class_id_reference="20" object_id="_181"> <id>191</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_182"> <id>192</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_183"> <id>193</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>59</sink_obj> </item> <item class_id_reference="20" object_id="_184"> <id>194</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>60</sink_obj> </item> <item class_id_reference="20" object_id="_185"> <id>195</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> </item> <item class_id_reference="20" object_id="_186"> <id>196</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_187"> <id>197</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_188"> <id>198</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>62</sink_obj> </item> <item class_id_reference="20" object_id="_189"> <id>199</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>63</sink_obj> </item> <item class_id_reference="20" object_id="_190"> <id>200</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>64</sink_obj> </item> <item class_id_reference="20" object_id="_191"> <id>201</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_192"> <id>202</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>65</sink_obj> </item> <item class_id_reference="20" object_id="_193"> <id>203</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_194"> <id>204</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_195"> <id>205</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>66</sink_obj> </item> <item class_id_reference="20" object_id="_196"> <id>206</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> </item> <item class_id_reference="20" object_id="_197"> <id>207</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>68</sink_obj> </item> <item class_id_reference="20" object_id="_198"> <id>208</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_199"> <id>209</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_200"> <id>210</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>69</sink_obj> </item> <item class_id_reference="20" object_id="_201"> <id>211</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>70</sink_obj> </item> <item class_id_reference="20" object_id="_202"> <id>212</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>71</sink_obj> </item> <item class_id_reference="20" object_id="_203"> <id>213</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_204"> <id>214</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>72</sink_obj> </item> <item class_id_reference="20" object_id="_205"> <id>215</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_206"> <id>216</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_207"> <id>217</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>73</sink_obj> </item> <item class_id_reference="20" object_id="_208"> <id>218</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> </item> <item class_id_reference="20" object_id="_209"> <id>219</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> </item> <item class_id_reference="20" object_id="_210"> <id>220</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_211"> <id>221</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_212"> <id>222</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>76</sink_obj> </item> <item class_id_reference="20" object_id="_213"> <id>223</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>77</sink_obj> </item> <item class_id_reference="20" object_id="_214"> <id>224</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>78</sink_obj> </item> <item class_id_reference="20" object_id="_215"> <id>225</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_216"> <id>226</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>79</sink_obj> </item> <item class_id_reference="20" object_id="_217"> <id>227</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_218"> <id>228</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_219"> <id>229</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>80</sink_obj> </item> <item class_id_reference="20" object_id="_220"> <id>230</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>81</sink_obj> </item> <item class_id_reference="20" object_id="_221"> <id>231</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> </item> <item class_id_reference="20" object_id="_222"> <id>232</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_223"> <id>233</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_224"> <id>234</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>83</sink_obj> </item> <item class_id_reference="20" object_id="_225"> <id>235</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> </item> <item class_id_reference="20" object_id="_226"> <id>236</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> </item> <item class_id_reference="20" object_id="_227"> <id>237</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_228"> <id>238</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>86</sink_obj> </item> <item class_id_reference="20" object_id="_229"> <id>239</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_230"> <id>240</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_231"> <id>241</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>87</sink_obj> </item> <item class_id_reference="20" object_id="_232"> <id>242</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>88</sink_obj> </item> <item class_id_reference="20" object_id="_233"> <id>243</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> </item> <item class_id_reference="20" object_id="_234"> <id>244</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_235"> <id>245</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_236"> <id>246</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>90</sink_obj> </item> <item class_id_reference="20" object_id="_237"> <id>247</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>91</sink_obj> </item> <item class_id_reference="20" object_id="_238"> <id>248</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>92</sink_obj> </item> <item class_id_reference="20" object_id="_239"> <id>249</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_240"> <id>250</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>93</sink_obj> </item> <item class_id_reference="20" object_id="_241"> <id>251</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_242"> <id>252</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>94</sink_obj> </item> <item class_id_reference="20" object_id="_243"> <id>253</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_244"> <id>254</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>95</sink_obj> </item> <item class_id_reference="20" object_id="_245"> <id>255</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_246"> <id>256</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>96</sink_obj> </item> <item class_id_reference="20" object_id="_247"> <id>257</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>97</sink_obj> </item> <item class_id_reference="20" object_id="_248"> <id>258</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>97</sink_obj> </item> <item class_id_reference="20" object_id="_249"> <id>259</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_250"> <id>261</id> <edge_type>1</edge_type> <source_obj>260</source_obj> <sink_obj>98</sink_obj> </item> <item class_id_reference="20" object_id="_251"> <id>262</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_252"> <id>263</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>99</sink_obj> </item> <item class_id_reference="20" object_id="_253"> <id>264</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>100</sink_obj> </item> <item class_id_reference="20" object_id="_254"> <id>265</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>100</sink_obj> </item> <item class_id_reference="20" object_id="_255"> <id>266</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_256"> <id>267</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>101</sink_obj> </item> <item class_id_reference="20" object_id="_257"> <id>270</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_258"> <id>272</id> <edge_type>1</edge_type> <source_obj>271</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_259"> <id>274</id> <edge_type>1</edge_type> <source_obj>273</source_obj> <sink_obj>102</sink_obj> </item> <item class_id_reference="20" object_id="_260"> <id>275</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>103</sink_obj> </item> <item class_id_reference="20" object_id="_261"> <id>278</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_262"> <id>280</id> <edge_type>1</edge_type> <source_obj>279</source_obj> <sink_obj>104</sink_obj> </item> <item class_id_reference="20" object_id="_263"> <id>281</id> <edge_type>1</edge_type> <source_obj>104</source_obj> <sink_obj>105</sink_obj> </item> <item class_id_reference="20" object_id="_264"> <id>282</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_265"> <id>283</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>106</sink_obj> </item> <item class_id_reference="20" object_id="_266"> <id>284</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>107</sink_obj> </item> <item class_id_reference="20" object_id="_267"> <id>285</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_268"> <id>286</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_269"> <id>287</id> <edge_type>1</edge_type> <source_obj>107</source_obj> <sink_obj>108</sink_obj> </item> <item class_id_reference="20" object_id="_270"> <id>288</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_271"> <id>289</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>109</sink_obj> </item> <item class_id_reference="20" object_id="_272"> <id>290</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_273"> <id>291</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>111</sink_obj> </item> <item class_id_reference="20" object_id="_274"> <id>292</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>112</sink_obj> </item> <item class_id_reference="20" object_id="_275"> <id>323</id> <edge_type>2</edge_type> <source_obj>19</source_obj> <sink_obj>26</sink_obj> </item> <item class_id_reference="20" object_id="_276"> <id>324</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>115</sink_obj> </item> <item class_id_reference="20" object_id="_277"> <id>325</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>113</sink_obj> </item> <item class_id_reference="20" object_id="_278"> <id>326</id> <edge_type>2</edge_type> <source_obj>113</source_obj> <sink_obj>26</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_279"> <mId>1</mId> <mTag>dct_Loop_Col_DCT_Loop_proc</mTag> <mType>0</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>69</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_280"> <mId>2</mId> <mTag>Entry</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>19</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_281"> <mId>3</mId> <mTag>Col_DCT_Loop_DCT_Outer_Loop</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>26</item> <item>113</item> </basic_blocks> <mII>1</mII> <mDepth>5</mDepth> <mMinTripCount>64</mMinTripCount> <mMaxTripCount>64</mMaxTripCount> <mMinLatency>67</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_282"> <mId>4</mId> <mTag>Return</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>115</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_283"> <states class_id="25" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_284"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_285"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_286"> <id>2</id> <operations> <count>45</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_287"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_288"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_289"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_290"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_291"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_292"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_293"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_294"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_295"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_296"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_297"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_298"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_299"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_300"> <id>39</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_301"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_302"> <id>42</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_303"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_304"> <id>46</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_305"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_306"> <id>49</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_307"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_308"> <id>53</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_309"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_310"> <id>56</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_311"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_312"> <id>60</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_313"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_314"> <id>63</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_315"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_316"> <id>67</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_317"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_318"> <id>70</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_319"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_320"> <id>74</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_321"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_322"> <id>77</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_323"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_324"> <id>81</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_325"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_326"> <id>84</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_327"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_328"> <id>88</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_329"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_330"> <id>91</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_331"> <id>111</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_332"> <id>3</id> <operations> <count>16</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_333"> <id>39</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_334"> <id>42</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_335"> <id>46</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_336"> <id>49</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_337"> <id>53</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_338"> <id>56</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_339"> <id>60</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_340"> <id>63</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_341"> <id>67</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_342"> <id>70</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_343"> <id>74</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_344"> <id>77</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_345"> <id>81</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_346"> <id>84</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_347"> <id>88</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_348"> <id>91</id> <stage>1</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_349"> <id>4</id> <operations> <count>17</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_350"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_351"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_352"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_353"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_354"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_355"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_356"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_357"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_358"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_359"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_360"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_361"> <id>86</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_362"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_363"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_364"> <id>93</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_365"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_366"> <id>99</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_367"> <id>5</id> <operations> <count>16</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_368"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_369"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_370"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_371"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_372"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_373"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_374"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_375"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_376"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_377"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_378"> <id>95</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_379"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_380"> <id>97</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_381"> <id>100</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_382"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_383"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_384"> <id>6</id> <operations> <count>14</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_385"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_386"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_387"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_388"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_389"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_390"> <id>103</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_391"> <id>104</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_392"> <id>105</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_393"> <id>106</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_394"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_395"> <id>108</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_396"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_397"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_398"> <id>112</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_399"> <id>7</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_400"> <id>114</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>7</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_401"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>23</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_402"> <inState>3</inState> <outState>4</outState> <condition> <id>34</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_403"> <inState>4</inState> <outState>5</outState> <condition> <id>35</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_404"> <inState>5</inState> <outState>6</outState> <condition> <id>36</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_405"> <inState>6</inState> <outState>2</outState> <condition> <id>37</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_406"> <inState>2</inState> <outState>7</outState> <condition> <id>33</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first class_id="35" tracking_level="0" version="0"> <first>23</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_407"> <inState>2</inState> <outState>3</outState> <condition> <id>38</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>23</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="36" tracking_level="1" version="0" object_id="_408"> <dp_component_resource class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>0</count> <item_version>0</item_version> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>0</count> <item_version>0</item_version> </dp_multiplexer_resource> <dp_register_resource> <count>0</count> <item_version>0</item_version> </dp_register_resource> <dp_component_map class_id="38" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>0</count> <item_version>0</item_version> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="39" tracking_level="0" version="0"> <count>88</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>18</first> <second class_id="41" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>40</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>43</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>47</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>50</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>54</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>57</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>61</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>64</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>68</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>71</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>75</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>78</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>81</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>82</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>85</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>89</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>92</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>95</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>96</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>97</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>98</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>100</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>104</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>105</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>106</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>108</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>109</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="42" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="43" tracking_level="0" version="0"> <first>19</first> <second class_id="44" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>113</first> <second> <first>1</first> <second>5</second> </second> </item> <item> <first>115</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="45" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="46" tracking_level="1" version="0" object_id="_409"> <region_name>Col_DCT_Loop_DCT_Outer_Loop</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>26</item> <item>113</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>5</pipe_depth> </item> </regions> <dp_fu_nodes class_id="47" tracking_level="0" version="0"> <count>79</count> <item_version>0</item_version> <item class_id="48" tracking_level="0" version="0"> <first>82</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>89</first> <second> <count>2</count> <item_version>0</item_version> <item>39</item> <item>39</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>101</first> <second> <count>2</count> <item_version>0</item_version> <item>42</item> <item>42</item> </second> </item> <item> <first>106</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>113</first> <second> <count>2</count> <item_version>0</item_version> <item>46</item> <item>46</item> </second> </item> <item> <first>118</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>125</first> <second> <count>2</count> <item_version>0</item_version> <item>49</item> <item>49</item> </second> </item> <item> <first>130</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>137</first> <second> <count>2</count> <item_version>0</item_version> <item>53</item> <item>53</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>149</first> <second> <count>2</count> <item_version>0</item_version> <item>56</item> <item>56</item> </second> </item> <item> <first>154</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>161</first> <second> <count>2</count> <item_version>0</item_version> <item>60</item> <item>60</item> </second> </item> <item> <first>166</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>173</first> <second> <count>2</count> <item_version>0</item_version> <item>63</item> <item>63</item> </second> </item> <item> <first>178</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>185</first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>197</first> <second> <count>2</count> <item_version>0</item_version> <item>70</item> <item>70</item> </second> </item> <item> <first>202</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>209</first> <second> <count>2</count> <item_version>0</item_version> <item>74</item> <item>74</item> </second> </item> <item> <first>214</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>221</first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>77</item> </second> </item> <item> <first>226</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>233</first> <second> <count>2</count> <item_version>0</item_version> <item>81</item> <item>81</item> </second> </item> <item> <first>238</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>245</first> <second> <count>2</count> <item_version>0</item_version> <item>84</item> <item>84</item> </second> </item> <item> <first>250</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>257</first> <second> <count>2</count> <item_version>0</item_version> <item>88</item> <item>88</item> </second> </item> <item> <first>262</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>269</first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>91</item> </second> </item> <item> <first>274</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>281</first> <second> <count>1</count> <item_version>0</item_version> <item>109</item> </second> </item> <item> <first>290</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>301</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>312</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>319</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>325</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>331</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>337</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>345</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>351</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>359</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>371</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>383</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>389</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>392</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>395</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>401</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>404</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>407</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>413</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>416</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>419</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>425</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>428</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>431</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>434</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>437</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>440</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>443</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>446</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>449</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>452</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>455</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>459</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>463</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>469</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>479</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>482</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>489</first> <second> <count>1</count> <item_version>0</item_version> <item>105</item> </second> </item> <item> <first>493</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>499</first> <second> <count>1</count> <item_version>0</item_version> <item>107</item> </second> </item> <item> <first>504</first> <second> <count>2</count> <item_version>0</item_version> <item>86</item> <item>99</item> </second> </item> <item> <first>511</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>95</item> </second> </item> <item> <first>519</first> <second> <count>2</count> <item_version>0</item_version> <item>79</item> <item>97</item> </second> </item> <item> <first>527</first> <second> <count>2</count> <item_version>0</item_version> <item>93</item> <item>98</item> </second> </item> <item> <first>536</first> <second> <count>2</count> <item_version>0</item_version> <item>51</item> <item>94</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="50" tracking_level="0" version="0"> <count>62</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first>coeff_1_cast_i_fu_437</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>coeff_2_cast_i_fu_401</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>coeff_3_cast_i_fu_443</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>coeff_4_cast_i_fu_413</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>coeff_5_cast_i_fu_449</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>coeff_6_cast_i_fu_425</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>coeff_7_cast_i_fu_431</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>coeff_cast_i_fu_389</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>col_inbuf_0_addr_gep_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>col_inbuf_1_addr_gep_fu_118</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>col_inbuf_2_addr_gep_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>col_inbuf_3_addr_gep_fu_166</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>col_inbuf_4_addr_gep_fu_190</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>col_inbuf_5_addr_gep_fu_214</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>col_inbuf_6_addr_gep_fu_238</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>col_inbuf_7_addr_gep_fu_262</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>col_outbuf_i_addr_gep_fu_274</first> <second> <count>1</count> <item_version>0</item_version> <item>108</item> </second> </item> <item> <first>dct_coeff_table_0_addr_gep_fu_82</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>dct_coeff_table_1_addr_gep_fu_106</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>dct_coeff_table_2_addr_gep_fu_130</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>dct_coeff_table_3_addr_gep_fu_154</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>dct_coeff_table_4_addr_gep_fu_178</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>dct_coeff_table_5_addr_gep_fu_202</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>dct_coeff_table_6_addr_gep_fu_226</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>dct_coeff_table_7_addr_gep_fu_250</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>exitcond1_i4_fu_331</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>exitcond_flatten_fu_319</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>grp_fu_504</first> <second> <count>2</count> <item_version>0</item_version> <item>86</item> <item>99</item> </second> </item> <item> <first>grp_fu_511</first> <second> <count>2</count> <item_version>0</item_version> <item>65</item> <item>95</item> </second> </item> <item> <first>grp_fu_519</first> <second> <count>2</count> <item_version>0</item_version> <item>79</item> <item>97</item> </second> </item> <item> <first>grp_fu_527</first> <second> <count>2</count> <item_version>0</item_version> <item>93</item> <item>98</item> </second> </item> <item> <first>grp_fu_536</first> <second> <count>2</count> <item_version>0</item_version> <item>51</item> <item>94</item> </second> </item> <item> <first>i2_fu_345</first> <second> <count>1</count> <item_version>0</item_version> <item>31</item> </second> </item> <item> <first>i_2_i_mid2_fu_351</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>i_2_i_phi_fu_301</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>indvar_flatten_next_fu_325</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>indvar_flatten_phi_fu_290</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>k_fu_383</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>k_i_mid2_fu_337</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>k_i_phi_fu_312</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>p_addr1_fu_493</first> <second> <count>1</count> <item_version>0</item_version> <item>106</item> </second> </item> <item> <first>p_addr_cast_fu_489</first> <second> <count>1</count> <item_version>0</item_version> <item>105</item> </second> </item> <item> <first>tmp3_fu_459</first> <second> <count>1</count> <item_version>0</item_version> <item>100</item> </second> </item> <item> <first>tmp_2_i_fu_463</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>tmp_4_i_fu_469</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>tmp_71_cast_i_fu_359</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>tmp_72_1_cast_i_fu_440</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>tmp_72_2_cast_i_fu_404</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>tmp_72_3_cast_i_fu_446</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>tmp_72_4_cast_i_fu_416</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>tmp_72_5_cast_i_fu_452</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>tmp_72_6_cast_i_fu_428</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>tmp_72_7_cast_i_fu_434</first> <second> <count>1</count> <item_version>0</item_version> <item>92</item> </second> </item> <item> <first>tmp_72_cast_i_fu_392</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>tmp_8_2_i_fu_407</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>tmp_8_4_i_fu_419</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>tmp_8_fu_482</first> <second> <count>1</count> <item_version>0</item_version> <item>104</item> </second> </item> <item> <first>tmp_8_i_fu_395</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>tmp_9_fu_499</first> <second> <count>1</count> <item_version>0</item_version> <item>107</item> </second> </item> <item> <first>tmp_fu_455</first> <second> <count>1</count> <item_version>0</item_version> <item>96</item> </second> </item> <item> <first>tmp_i_10_fu_371</first> <second> <count>1</count> <item_version>0</item_version> <item>37</item> </second> </item> <item> <first>tmp_i_trn_cast_fu_479</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="52" tracking_level="0" version="0"> <count>17</count> <item_version>0</item_version> <item class_id="53" tracking_level="0" version="0"> <first class_id="54" tracking_level="0" version="0"> <first>col_inbuf_0</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>42</item> <item>42</item> </second> </item> <item> <first> <first>col_inbuf_1</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>49</item> <item>49</item> </second> </item> <item> <first> <first>col_inbuf_2</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>56</item> <item>56</item> </second> </item> <item> <first> <first>col_inbuf_3</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>63</item> <item>63</item> </second> </item> <item> <first> <first>col_inbuf_4</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>70</item> <item>70</item> </second> </item> <item> <first> <first>col_inbuf_5</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>77</item> </second> </item> <item> <first> <first>col_inbuf_6</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>84</item> <item>84</item> </second> </item> <item> <first> <first>col_inbuf_7</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>91</item> </second> </item> <item> <first> <first>col_outbuf_i</first> <second>0</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>109</item> </second> </item> <item> <first> <first>dct_coeff_table_0</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>39</item> <item>39</item> </second> </item> <item> <first> <first>dct_coeff_table_1</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>46</item> <item>46</item> </second> </item> <item> <first> <first>dct_coeff_table_2</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>53</item> <item>53</item> </second> </item> <item> <first> <first>dct_coeff_table_3</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>60</item> <item>60</item> </second> </item> <item> <first> <first>dct_coeff_table_4</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>67</item> <item>67</item> </second> </item> <item> <first> <first>dct_coeff_table_5</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>74</item> <item>74</item> </second> </item> <item> <first> <first>dct_coeff_table_6</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>81</item> <item>81</item> </second> </item> <item> <first> <first>dct_coeff_table_7</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>88</item> <item>88</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>45</count> <item_version>0</item_version> <item> <first>286</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>297</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>308</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>544</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>548</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>553</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>558</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>564</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>569</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>574</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>579</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>584</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>589</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>594</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>599</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>604</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>609</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>614</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>619</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>624</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>629</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>634</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>639</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>644</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>649</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>654</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>659</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>664</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>669</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>674</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>679</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>684</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>689</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>694</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>699</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>704</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>709</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>714</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>719</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>724</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>729</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>734</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>739</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>744</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>749</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>45</count> <item_version>0</item_version> <item> <first>col_inbuf_0_addr_reg_569</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>col_inbuf_0_load_reg_654</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>col_inbuf_1_addr_reg_579</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>col_inbuf_1_load_reg_664</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>col_inbuf_2_addr_reg_589</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>col_inbuf_2_load_reg_674</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>col_inbuf_3_addr_reg_599</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>col_inbuf_3_load_reg_684</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>col_inbuf_4_addr_reg_609</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>col_inbuf_4_load_reg_694</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>col_inbuf_5_addr_reg_619</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>col_inbuf_5_load_reg_704</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>col_inbuf_6_addr_reg_629</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>col_inbuf_6_load_reg_714</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>col_inbuf_7_addr_reg_639</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>col_inbuf_7_load_reg_724</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>dct_coeff_table_0_addr_reg_564</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>dct_coeff_table_0_load_reg_649</first> <second> <count>1</count> <item_version>0</item_version> <item>39</item> </second> </item> <item> <first>dct_coeff_table_1_addr_reg_574</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>dct_coeff_table_1_load_reg_659</first> <second> <count>1</count> <item_version>0</item_version> <item>46</item> </second> </item> <item> <first>dct_coeff_table_2_addr_reg_584</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>dct_coeff_table_2_load_reg_669</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>dct_coeff_table_3_addr_reg_594</first> <second> <count>1</count> <item_version>0</item_version> <item>59</item> </second> </item> <item> <first>dct_coeff_table_3_load_reg_679</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>dct_coeff_table_4_addr_reg_604</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>dct_coeff_table_4_load_reg_689</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>dct_coeff_table_5_addr_reg_614</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>dct_coeff_table_5_load_reg_699</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>dct_coeff_table_6_addr_reg_624</first> <second> <count>1</count> <item_version>0</item_version> <item>80</item> </second> </item> <item> <first>dct_coeff_table_6_load_reg_709</first> <second> <count>1</count> <item_version>0</item_version> <item>81</item> </second> </item> <item> <first>dct_coeff_table_7_addr_reg_634</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>dct_coeff_table_7_load_reg_719</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>exitcond_flatten_reg_544</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>i_2_i_mid2_reg_558</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>i_2_i_reg_297</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>indvar_flatten_next_reg_548</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>indvar_flatten_reg_286</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>k_i_mid2_reg_553</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>k_i_reg_308</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>k_reg_644</first> <second> <count>1</count> <item_version>0</item_version> <item>111</item> </second> </item> <item> <first>tmp5_reg_744</first> <second> <count>1</count> <item_version>0</item_version> <item>99</item> </second> </item> <item> <first>tmp_4_i_reg_749</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>tmp_8_2_i_reg_734</first> <second> <count>1</count> <item_version>0</item_version> <item>58</item> </second> </item> <item> <first>tmp_8_4_i_reg_739</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>tmp_8_i_reg_729</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>3</count> <item_version>0</item_version> <item> <first>286</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>297</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>308</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>3</count> <item_version>0</item_version> <item> <first>i_2_i_reg_297</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>indvar_flatten_reg_286</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>k_i_reg_308</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="55" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="56" tracking_level="0" version="0"> <first>col_inbuf_0(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>42</item> <item>42</item> </second> </item> </second> </item> <item> <first>col_inbuf_1(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>49</item> <item>49</item> </second> </item> </second> </item> <item> <first>col_inbuf_2(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>56</item> <item>56</item> </second> </item> </second> </item> <item> <first>col_inbuf_3(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>63</item> <item>63</item> </second> </item> </second> </item> <item> <first>col_inbuf_4(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>70</item> <item>70</item> </second> </item> </second> </item> <item> <first>col_inbuf_5(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>77</item> <item>77</item> </second> </item> </second> </item> <item> <first>col_inbuf_6(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>84</item> <item>84</item> </second> </item> </second> </item> <item> <first>col_inbuf_7(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>load</first> <second> <count>2</count> <item_version>0</item_version> <item>91</item> <item>91</item> </second> </item> </second> </item> <item> <first>col_outbuf_i(p0)</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>store</first> <second> <count>1</count> <item_version>0</item_version> <item>109</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="57" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="58" tracking_level="0" version="0"> <first>1</first> <second>RAM</second> </item> <item> <first>2</first> <second>RAM</second> </item> <item> <first>3</first> <second>RAM</second> </item> <item> <first>4</first> <second>RAM</second> </item> <item> <first>5</first> <second>RAM</second> </item> <item> <first>6</first> <second>RAM</second> </item> <item> <first>7</first> <second>RAM</second> </item> <item> <first>8</first> <second>RAM</second> </item> <item> <first>9</first> <second>RAM</second> </item> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2017, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- -- -- -- This file is based on: -- -- -- -- @file stm32l43[5|7]xx.h -- -- @author MCD Application Team -- -- @version V1.1.0 -- -- @date 19-June-2014 -- -- @brief CMSIS STM32F407xx Device Peripheral Access Layer Header File. -- -- -- -- COPYRIGHT(c) 2014 STMicroelectronics -- ------------------------------------------------------------------------------ -- This file provides declarations for devices on the STM32F40xxx MCUs -- manufactured by ST Microelectronics. For example, an STM32F405. with STM32_SVD; use STM32_SVD; with STM32.GPIO; use STM32.GPIO; with STM32.DAC; use STM32.DAC; with STM32.SPI; use STM32.SPI; with STM32.I2C; use STM32.I2C; with System; package STM32.Device is pragma Elaborate_Body; Unknown_Device : exception; -- Raised by the routines below for a device passed as an actual parameter -- when that device is not present on the given hardware instance. procedure Enable_Clock (This : aliased in out GPIO_Port); procedure Enable_Clock (Point : GPIO_Point); procedure Enable_Clock (Points : GPIO_Points); procedure Disable_Clock (This : aliased in out GPIO_Port); procedure Disable_Clock (Point : GPIO_Point); procedure Disable_Clock (Points : GPIO_Points); procedure Reset (This : aliased in out GPIO_Port) with Inline; procedure Reset (Point : GPIO_Point) with Inline; procedure Reset (Points : GPIO_Points) with Inline; function GPIO_Port_Representation (Port : GPIO_Port) return UInt4 with Inline; function S_NS_Periph (Addr : System.Address) return System.Address with Inline; GPIO_A : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOA_Base); GPIO_B : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOB_Base); GPIO_C : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOC_Base); GPIO_D : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOD_Base); GPIO_E : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOE_Base); GPIO_F : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOF_Base); GPIO_G : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOG_Base); GPIO_H : aliased GPIO_Port with Import, Volatile, Address => S_NS_Periph (GPIOH_Base); PA0 : aliased GPIO_Point := (GPIO_A'Access, Pin_0); PA1 : aliased GPIO_Point := (GPIO_A'Access, Pin_1); PA2 : aliased GPIO_Point := (GPIO_A'Access, Pin_2); PA3 : aliased GPIO_Point := (GPIO_A'Access, Pin_3); PA4 : aliased GPIO_Point := (GPIO_A'Access, Pin_4); PA5 : aliased GPIO_Point := (GPIO_A'Access, Pin_5); PA6 : aliased GPIO_Point := (GPIO_A'Access, Pin_6); PA7 : aliased GPIO_Point := (GPIO_A'Access, Pin_7); PA8 : aliased GPIO_Point := (GPIO_A'Access, Pin_8); PA9 : aliased GPIO_Point := (GPIO_A'Access, Pin_9); PA10 : aliased GPIO_Point := (GPIO_A'Access, Pin_10); PA11 : aliased GPIO_Point := (GPIO_A'Access, Pin_11); PA12 : aliased GPIO_Point := (GPIO_A'Access, Pin_12); PA13 : aliased GPIO_Point := (GPIO_A'Access, Pin_13); PA14 : aliased GPIO_Point := (GPIO_A'Access, Pin_14); PA15 : aliased GPIO_Point := (GPIO_A'Access, Pin_15); PB0 : aliased GPIO_Point := (GPIO_B'Access, Pin_0); PB1 : aliased GPIO_Point := (GPIO_B'Access, Pin_1); PB2 : aliased GPIO_Point := (GPIO_B'Access, Pin_2); PB3 : aliased GPIO_Point := (GPIO_B'Access, Pin_3); PB4 : aliased GPIO_Point := (GPIO_B'Access, Pin_4); PB5 : aliased GPIO_Point := (GPIO_B'Access, Pin_5); PB6 : aliased GPIO_Point := (GPIO_B'Access, Pin_6); PB7 : aliased GPIO_Point := (GPIO_B'Access, Pin_7); PB8 : aliased GPIO_Point := (GPIO_B'Access, Pin_8); PB9 : aliased GPIO_Point := (GPIO_B'Access, Pin_9); PB10 : aliased GPIO_Point := (GPIO_B'Access, Pin_10); PB11 : aliased GPIO_Point := (GPIO_B'Access, Pin_11); PB12 : aliased GPIO_Point := (GPIO_B'Access, Pin_12); PB13 : aliased GPIO_Point := (GPIO_B'Access, Pin_13); PB14 : aliased GPIO_Point := (GPIO_B'Access, Pin_14); PB15 : aliased GPIO_Point := (GPIO_B'Access, Pin_15); PC0 : aliased GPIO_Point := (GPIO_C'Access, Pin_0); PC1 : aliased GPIO_Point := (GPIO_C'Access, Pin_1); PC2 : aliased GPIO_Point := (GPIO_C'Access, Pin_2); PC3 : aliased GPIO_Point := (GPIO_C'Access, Pin_3); PC4 : aliased GPIO_Point := (GPIO_C'Access, Pin_4); PC5 : aliased GPIO_Point := (GPIO_C'Access, Pin_5); PC6 : aliased GPIO_Point := (GPIO_C'Access, Pin_6); PC7 : aliased GPIO_Point := (GPIO_C'Access, Pin_7); PC8 : aliased GPIO_Point := (GPIO_C'Access, Pin_8); PC9 : aliased GPIO_Point := (GPIO_C'Access, Pin_9); PC10 : aliased GPIO_Point := (GPIO_C'Access, Pin_10); PC11 : aliased GPIO_Point := (GPIO_C'Access, Pin_11); PC12 : aliased GPIO_Point := (GPIO_C'Access, Pin_12); PC13 : aliased GPIO_Point := (GPIO_C'Access, Pin_13); PC14 : aliased GPIO_Point := (GPIO_C'Access, Pin_14); PC15 : aliased GPIO_Point := (GPIO_C'Access, Pin_15); PD0 : aliased GPIO_Point := (GPIO_D'Access, Pin_0); PD1 : aliased GPIO_Point := (GPIO_D'Access, Pin_1); PD2 : aliased GPIO_Point := (GPIO_D'Access, Pin_2); PD3 : aliased GPIO_Point := (GPIO_D'Access, Pin_3); PD4 : aliased GPIO_Point := (GPIO_D'Access, Pin_4); PD5 : aliased GPIO_Point := (GPIO_D'Access, Pin_5); PD6 : aliased GPIO_Point := (GPIO_D'Access, Pin_6); PD7 : aliased GPIO_Point := (GPIO_D'Access, Pin_7); PD8 : aliased GPIO_Point := (GPIO_D'Access, Pin_8); PD9 : aliased GPIO_Point := (GPIO_D'Access, Pin_9); PD10 : aliased GPIO_Point := (GPIO_D'Access, Pin_10); PD11 : aliased GPIO_Point := (GPIO_D'Access, Pin_11); PD12 : aliased GPIO_Point := (GPIO_D'Access, Pin_12); PD13 : aliased GPIO_Point := (GPIO_D'Access, Pin_13); PD14 : aliased GPIO_Point := (GPIO_D'Access, Pin_14); PD15 : aliased GPIO_Point := (GPIO_D'Access, Pin_15); PE0 : aliased GPIO_Point := (GPIO_E'Access, Pin_0); PE1 : aliased GPIO_Point := (GPIO_E'Access, Pin_1); PE2 : aliased GPIO_Point := (GPIO_E'Access, Pin_2); PE3 : aliased GPIO_Point := (GPIO_E'Access, Pin_3); PE4 : aliased GPIO_Point := (GPIO_E'Access, Pin_4); PE5 : aliased GPIO_Point := (GPIO_E'Access, Pin_5); PE6 : aliased GPIO_Point := (GPIO_E'Access, Pin_6); PE7 : aliased GPIO_Point := (GPIO_E'Access, Pin_7); PE8 : aliased GPIO_Point := (GPIO_E'Access, Pin_8); PE9 : aliased GPIO_Point := (GPIO_E'Access, Pin_9); PE10 : aliased GPIO_Point := (GPIO_E'Access, Pin_10); PE11 : aliased GPIO_Point := (GPIO_E'Access, Pin_11); PE12 : aliased GPIO_Point := (GPIO_E'Access, Pin_12); PE13 : aliased GPIO_Point := (GPIO_E'Access, Pin_13); PE14 : aliased GPIO_Point := (GPIO_E'Access, Pin_14); PE15 : aliased GPIO_Point := (GPIO_E'Access, Pin_15); PF0 : aliased GPIO_Point := (GPIO_F'Access, Pin_0); PF1 : aliased GPIO_Point := (GPIO_F'Access, Pin_1); PF2 : aliased GPIO_Point := (GPIO_F'Access, Pin_2); PF3 : aliased GPIO_Point := (GPIO_F'Access, Pin_3); PF4 : aliased GPIO_Point := (GPIO_F'Access, Pin_4); PF5 : aliased GPIO_Point := (GPIO_F'Access, Pin_5); PF6 : aliased GPIO_Point := (GPIO_F'Access, Pin_6); PF7 : aliased GPIO_Point := (GPIO_F'Access, Pin_7); PF8 : aliased GPIO_Point := (GPIO_F'Access, Pin_8); PF9 : aliased GPIO_Point := (GPIO_F'Access, Pin_9); PF10 : aliased GPIO_Point := (GPIO_F'Access, Pin_10); PF11 : aliased GPIO_Point := (GPIO_F'Access, Pin_11); PF12 : aliased GPIO_Point := (GPIO_F'Access, Pin_12); PF13 : aliased GPIO_Point := (GPIO_F'Access, Pin_13); PF14 : aliased GPIO_Point := (GPIO_F'Access, Pin_14); PF15 : aliased GPIO_Point := (GPIO_F'Access, Pin_15); PG0 : aliased GPIO_Point := (GPIO_G'Access, Pin_0); PG1 : aliased GPIO_Point := (GPIO_G'Access, Pin_1); PG2 : aliased GPIO_Point := (GPIO_G'Access, Pin_2); PG3 : aliased GPIO_Point := (GPIO_G'Access, Pin_3); PG4 : aliased GPIO_Point := (GPIO_G'Access, Pin_4); PG5 : aliased GPIO_Point := (GPIO_G'Access, Pin_5); PG6 : aliased GPIO_Point := (GPIO_G'Access, Pin_6); PG7 : aliased GPIO_Point := (GPIO_G'Access, Pin_7); PG8 : aliased GPIO_Point := (GPIO_G'Access, Pin_8); PG9 : aliased GPIO_Point := (GPIO_G'Access, Pin_9); PG10 : aliased GPIO_Point := (GPIO_G'Access, Pin_10); PG11 : aliased GPIO_Point := (GPIO_G'Access, Pin_11); PG12 : aliased GPIO_Point := (GPIO_G'Access, Pin_12); PG13 : aliased GPIO_Point := (GPIO_G'Access, Pin_13); PG14 : aliased GPIO_Point := (GPIO_G'Access, Pin_14); PG15 : aliased GPIO_Point := (GPIO_G'Access, Pin_15); PH0 : aliased GPIO_Point := (GPIO_H'Access, Pin_0); PH1 : aliased GPIO_Point := (GPIO_H'Access, Pin_1); PH2 : aliased GPIO_Point := (GPIO_H'Access, Pin_2); PH3 : aliased GPIO_Point := (GPIO_H'Access, Pin_3); PH4 : aliased GPIO_Point := (GPIO_H'Access, Pin_4); PH5 : aliased GPIO_Point := (GPIO_H'Access, Pin_5); PH6 : aliased GPIO_Point := (GPIO_H'Access, Pin_6); PH7 : aliased GPIO_Point := (GPIO_H'Access, Pin_7); PH8 : aliased GPIO_Point := (GPIO_H'Access, Pin_8); PH9 : aliased GPIO_Point := (GPIO_H'Access, Pin_9); PH10 : aliased GPIO_Point := (GPIO_H'Access, Pin_10); PH11 : aliased GPIO_Point := (GPIO_H'Access, Pin_11); PH12 : aliased GPIO_Point := (GPIO_H'Access, Pin_12); PH13 : aliased GPIO_Point := (GPIO_H'Access, Pin_13); PH14 : aliased GPIO_Point := (GPIO_H'Access, Pin_14); PH15 : aliased GPIO_Point := (GPIO_H'Access, Pin_15); GPIO_AF_RTC_50Hz_0 : constant GPIO_Alternate_Function; GPIO_AF_MCO_0 : constant GPIO_Alternate_Function; GPIO_AF_TAMPER_0 : constant GPIO_Alternate_Function; GPIO_AF_SWJ_0 : constant GPIO_Alternate_Function; GPIO_AF_TRACE_0 : constant GPIO_Alternate_Function; GPIO_AF_TIM1_1 : constant GPIO_Alternate_Function; GPIO_AF_TIM2_1 : constant GPIO_Alternate_Function; GPIO_AF_TIM3_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM4_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM5_2 : constant GPIO_Alternate_Function; GPIO_AF_TIM8_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM9_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM10_3 : constant GPIO_Alternate_Function; GPIO_AF_TIM11_3 : constant GPIO_Alternate_Function; GPIO_AF_I2C1_4 : constant GPIO_Alternate_Function; GPIO_AF_I2C2_4 : constant GPIO_Alternate_Function; GPIO_AF_I2C3_4 : constant GPIO_Alternate_Function; GPIO_AF_SPI1_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI2_5 : constant GPIO_Alternate_Function; GPIO_AF_I2S2_5 : constant GPIO_Alternate_Function; GPIO_AF_I2S2ext_5 : constant GPIO_Alternate_Function; GPIO_AF_SPI3_6 : constant GPIO_Alternate_Function; GPIO_AF_I2S3_6 : constant GPIO_Alternate_Function; GPIO_AF_I2Sext_6 : constant GPIO_Alternate_Function; GPIO_AF_I2S3ext_7 : constant GPIO_Alternate_Function; GPIO_AF_USART1_7 : constant GPIO_Alternate_Function; GPIO_AF_USART2_7 : constant GPIO_Alternate_Function; GPIO_AF_USART3_7 : constant GPIO_Alternate_Function; GPIO_AF_UART4_8 : constant GPIO_Alternate_Function; GPIO_AF_UART5_8 : constant GPIO_Alternate_Function; GPIO_AF_USART6_8 : constant GPIO_Alternate_Function; GPIO_AF_CAN1_9 : constant GPIO_Alternate_Function; GPIO_AF_CAN2_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM12_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM13_9 : constant GPIO_Alternate_Function; GPIO_AF_TIM14_9 : constant GPIO_Alternate_Function; GPIO_AF_OTG_FS_10 : constant GPIO_Alternate_Function; GPIO_AF_OTG_HS_10 : constant GPIO_Alternate_Function; GPIO_AF_ETH_11 : constant GPIO_Alternate_Function; GPIO_AF_FMC_12 : constant GPIO_Alternate_Function; GPIO_AF_OTG_FS_12 : constant GPIO_Alternate_Function; GPIO_AF_DCMI_13 : constant GPIO_Alternate_Function; GPIO_AF_EVENTOUT_15 : constant GPIO_Alternate_Function; DAC : aliased Digital_To_Analog_Converter with Import, Volatile, Address => DAC_Base; DAC_Channel_1_IO : GPIO_Point renames PA4; DAC_Channel_2_IO : GPIO_Point renames PA5; procedure Enable_Clock (This : aliased in out Digital_To_Analog_Converter); procedure Reset (This : aliased in out Digital_To_Analog_Converter); Internal_I2C_Port_1 : aliased Internal_I2C_Port with Import, Volatile, Address => S_NS_Periph (I2C1_Base); Internal_I2C_Port_2 : aliased Internal_I2C_Port with Import, Volatile, Address => S_NS_Periph (I2C2_Base); Internal_I2C_Port_3 : aliased Internal_I2C_Port with Import, Volatile, Address => S_NS_Periph (I2C3_Base); I2C_1 : aliased I2C_Port (Internal_I2C_Port_1'Access); I2C_2 : aliased I2C_Port (Internal_I2C_Port_2'Access); I2C_3 : aliased I2C_Port (Internal_I2C_Port_3'Access); type I2C_Port_Id is (I2C_Id_1, I2C_Id_2, I2C_Id_3); function As_Port_Id (Port : I2C_Port) return I2C_Port_Id with Inline; procedure Enable_Clock (This : I2C_Port); procedure Enable_Clock (This : I2C_Port_Id); procedure Reset (This : I2C_Port); procedure Reset (This : I2C_Port_Id); Internal_SPI_1 : aliased Internal_SPI_Port with Import, Volatile, Address => S_NS_Periph (SPI1_Base); Internal_SPI_2 : aliased Internal_SPI_Port with Import, Volatile, Address => S_NS_Periph (SPI2_Base); Internal_SPI_3 : aliased Internal_SPI_Port with Import, Volatile, Address => S_NS_Periph (SPI3_Base); SPI_1 : aliased SPI_Port (Internal_SPI_1'Access); SPI_2 : aliased SPI_Port (Internal_SPI_2'Access); SPI_3 : aliased SPI_Port (Internal_SPI_3'Access); procedure Enable_Clock (This : SPI_Port); procedure Reset (This : in out SPI_Port); private GPIO_AF_RTC_50Hz_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_MCO_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TAMPER_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_SWJ_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TRACE_0 : constant GPIO_Alternate_Function := 0; GPIO_AF_TIM1_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_TIM2_1 : constant GPIO_Alternate_Function := 1; GPIO_AF_TIM3_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM4_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM5_2 : constant GPIO_Alternate_Function := 2; GPIO_AF_TIM8_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM9_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM10_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_TIM11_3 : constant GPIO_Alternate_Function := 3; GPIO_AF_I2C1_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_I2C2_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_I2C3_4 : constant GPIO_Alternate_Function := 4; GPIO_AF_SPI1_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI2_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_I2S2_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_I2S2ext_5 : constant GPIO_Alternate_Function := 5; GPIO_AF_SPI3_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_I2S3_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_I2Sext_6 : constant GPIO_Alternate_Function := 6; GPIO_AF_I2S3ext_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART1_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART2_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_USART3_7 : constant GPIO_Alternate_Function := 7; GPIO_AF_UART4_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_UART5_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_USART6_8 : constant GPIO_Alternate_Function := 8; GPIO_AF_CAN1_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_CAN2_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM12_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM13_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_TIM14_9 : constant GPIO_Alternate_Function := 9; GPIO_AF_OTG_FS_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_OTG_HS_10 : constant GPIO_Alternate_Function := 10; GPIO_AF_ETH_11 : constant GPIO_Alternate_Function := 11; GPIO_AF_FMC_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_OTG_FS_12 : constant GPIO_Alternate_Function := 12; GPIO_AF_DCMI_13 : constant GPIO_Alternate_Function := 13; GPIO_AF_EVENTOUT_15 : constant GPIO_Alternate_Function := 15; end STM32.Device;
-- { dg-do run } -- { dg-options "-gnatws" } with Address_Null_Init; use Address_Null_Init; with Ada.Text_IO; use Ada.Text_IO; procedure Test_Address_Null_Init is begin if B /= null then Put_Line ("ERROR: B was not default initialized to null!"); end if; if A /= null then Put_Line ("ERROR: A was not reinitialized to null!"); end if; end Test_Address_Null_Init;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S . C -- -- -- -- S p e c -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. In accordance with the copyright of that document, you can freely -- -- copy and modify this specification, provided that if you redistribute a -- -- modified version, any changes that you have made are clearly indicated. -- -- -- ------------------------------------------------------------------------------ with System.Parameters; package Interfaces.C is pragma Pure; -- Declaration's based on C's <limits.h> CHAR_BIT : constant := 8; SCHAR_MIN : constant := -128; SCHAR_MAX : constant := 127; UCHAR_MAX : constant := 255; -- Signed and Unsigned Integers. Note that in GNAT, we have ensured that -- the standard predefined Ada types correspond to the standard C types -- Note: the Integer qualifications used in the declaration of type long -- avoid ambiguities when compiling in the presence of s-auxdec.ads and -- a non-private system.address type. type int is new Integer; type short is new Short_Integer; type long is range -(2 ** (System.Parameters.long_bits - Integer'(1))) .. +(2 ** (System.Parameters.long_bits - Integer'(1))) - 1; type signed_char is range SCHAR_MIN .. SCHAR_MAX; for signed_char'Size use CHAR_BIT; type unsigned is mod 2 ** int'Size; type unsigned_short is mod 2 ** short'Size; type unsigned_long is mod 2 ** long'Size; type unsigned_char is mod (UCHAR_MAX + 1); for unsigned_char'Size use CHAR_BIT; subtype plain_char is unsigned_char; -- ??? should be parametrized -- Note: the Integer qualifications used in the declaration of ptrdiff_t -- avoid ambiguities when compiling in the presence of s-auxdec.ads and -- a non-private system.address type. type ptrdiff_t is range -(2 ** (Standard'Address_Size - Integer'(1))) .. +(2 ** (Standard'Address_Size - Integer'(1)) - 1); type size_t is mod 2 ** Standard'Address_Size; -- Floating-Point type C_float is new Float; type double is new Standard.Long_Float; type long_double is new Standard.Long_Long_Float; ---------------------------- -- Characters and Strings -- ---------------------------- type char is new Character; nul : constant char := char'First; function To_C (Item : Character) return char; function To_Ada (Item : char) return Character; type char_array is array (size_t range <>) of aliased char; for char_array'Component_Size use CHAR_BIT; function Is_Nul_Terminated (Item : char_array) return Boolean; function To_C (Item : String; Append_Nul : Boolean := True) return char_array; function To_Ada (Item : char_array; Trim_Nul : Boolean := True) return String; procedure To_C (Item : String; Target : out char_array; Count : out size_t; Append_Nul : Boolean := True); procedure To_Ada (Item : char_array; Target : out String; Count : out Natural; Trim_Nul : Boolean := True); ------------------------------------ -- Wide Character and Wide String -- ------------------------------------ type wchar_t is new Wide_Character; for wchar_t'Size use Standard'Wchar_T_Size; wide_nul : constant wchar_t := wchar_t'First; function To_C (Item : Wide_Character) return wchar_t; function To_Ada (Item : wchar_t) return Wide_Character; type wchar_array is array (size_t range <>) of aliased wchar_t; function Is_Nul_Terminated (Item : wchar_array) return Boolean; function To_C (Item : Wide_String; Append_Nul : Boolean := True) return wchar_array; function To_Ada (Item : wchar_array; Trim_Nul : Boolean := True) return Wide_String; procedure To_C (Item : Wide_String; Target : out wchar_array; Count : out size_t; Append_Nul : Boolean := True); procedure To_Ada (Item : wchar_array; Target : out Wide_String; Count : out Natural; Trim_Nul : Boolean := True); Terminator_Error : exception; -- The remaining declarations are for Ada 2005 (AI-285) -- ISO/IEC 10646:2003 compatible types defined by SC22/WG14 document N1010 type char16_t is new Wide_Character; pragma Ada_05 (char16_t); char16_nul : constant char16_t := char16_t'Val (0); pragma Ada_05 (char16_nul); function To_C (Item : Wide_Character) return char16_t; pragma Ada_05 (To_C); function To_Ada (Item : char16_t) return Wide_Character; pragma Ada_05 (To_Ada); type char16_array is array (size_t range <>) of aliased char16_t; pragma Ada_05 (char16_array); function Is_Nul_Terminated (Item : char16_array) return Boolean; pragma Ada_05 (Is_Nul_Terminated); function To_C (Item : Wide_String; Append_Nul : Boolean := True) return char16_array; pragma Ada_05 (To_C); function To_Ada (Item : char16_array; Trim_Nul : Boolean := True) return Wide_String; pragma Ada_05 (To_Ada); procedure To_C (Item : Wide_String; Target : out char16_array; Count : out size_t; Append_Nul : Boolean := True); pragma Ada_05 (To_C); procedure To_Ada (Item : char16_array; Target : out Wide_String; Count : out Natural; Trim_Nul : Boolean := True); pragma Ada_05 (To_Ada); type char32_t is new Wide_Wide_Character; pragma Ada_05 (char32_t); char32_nul : constant char32_t := char32_t'Val (0); pragma Ada_05 (char32_nul); function To_C (Item : Wide_Wide_Character) return char32_t; pragma Ada_05 (To_C); function To_Ada (Item : char32_t) return Wide_Wide_Character; pragma Ada_05 (To_Ada); type char32_array is array (size_t range <>) of aliased char32_t; pragma Ada_05 (char32_array); function Is_Nul_Terminated (Item : char32_array) return Boolean; pragma Ada_05 (Is_Nul_Terminated); function To_C (Item : Wide_Wide_String; Append_Nul : Boolean := True) return char32_array; pragma Ada_05 (To_C); function To_Ada (Item : char32_array; Trim_Nul : Boolean := True) return Wide_Wide_String; pragma Ada_05 (To_Ada); procedure To_C (Item : Wide_Wide_String; Target : out char32_array; Count : out size_t; Append_Nul : Boolean := True); pragma Ada_05 (To_C); procedure To_Ada (Item : char32_array; Target : out Wide_Wide_String; Count : out Natural; Trim_Nul : Boolean := True); pragma Ada_05 (To_Ada); end Interfaces.C;
generic type Real is digits <>; package Generic_Quaternions is type Quaternion is record W : Real; X : Real; Y : Real; Z : Real; end record; function "-" (Q : Quaternion) return Quaternion; function "+" (L, R : Quaternion) return Quaternion; function "-" (L, R : Quaternion) return Quaternion; function "*" (L : Quaternion; R : Real) return Quaternion; function "*" (L : Real; R : Quaternion) return Quaternion; function "*" (L : Quaternion; R : Quaternion) return Quaternion; function "/" (L : Quaternion; R : Real) return Quaternion; function Conjugate (Q : Quaternion) return Quaternion; function Norm (Q : Quaternion) return Real; function Normalize (Q : Quaternion) return Quaternion; end Generic_Quaternions;
-- { dg-do run } procedure range_check is function ident (x : integer) return integer is begin return x; end ident; guard1 : Integer; r : array (1 .. ident (10)) of integer; pragma Suppress (Index_Check, r); guard2 : Integer; begin guard1 := 0; guard2 := 0; r (11) := 3; end;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 1 3 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2009, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Handling of packed arrays with Component_Size = 13 package System.Pack_13 is pragma Preelaborate; Bits : constant := 13; type Bits_13 is mod 2 ** Bits; for Bits_13'Size use Bits; function Get_13 (Arr : System.Address; N : Natural) return Bits_13; -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is extracted and returned. procedure Set_13 (Arr : System.Address; N : Natural; E : Bits_13); -- Arr is the address of the packed array, N is the zero-based -- subscript. This element is set to the given value. end System.Pack_13;
------------------------------------------------------------------------------ -- Copyright (C) 2020 by Heisenbug Ltd. (gh+spat@heisenbug.eu) -- -- This work is free. You can redistribute it and/or modify it under the -- terms of the Do What The Fuck You Want To Public License, Version 2, -- as published by Sam Hocevar. See the LICENSE file for more details. ------------------------------------------------------------------------------ pragma License (Unrestricted); package body SPAT.Stop_Watch is use type Ada.Real_Time.Time; --------------------------------------------------------------------------- -- Image --------------------------------------------------------------------------- function Image (TS : in Ada.Real_Time.Time_Span) return String is (Image (Value => Ada.Real_Time.To_Duration (TS => TS))); --------------------------------------------------------------------------- -- Create --------------------------------------------------------------------------- function Create return T is begin return Result : T do Result.Reset; end return; end Create; --------------------------------------------------------------------------- -- Elapsed --------------------------------------------------------------------------- function Elapsed (This : in T) return String is (Image (TS => Ada.Real_Time.Clock - This.Lap_Time)); --------------------------------------------------------------------------- -- Elapsed_Total --------------------------------------------------------------------------- function Elapsed_Total (This : in T) return String is (Image (TS => Ada.Real_Time.Clock - This.Start_Time)); --------------------------------------------------------------------------- -- Reset --------------------------------------------------------------------------- procedure Reset (This : in out T) is Now : constant Ada.Real_Time.Time := Ada.Real_Time.Clock; begin This.Start_Time := Now; This.Lap_Time := Now; end Reset; --------------------------------------------------------------------------- -- Start -- -- Starts a new lap measurement. --------------------------------------------------------------------------- procedure Start (This : in out T) is begin This.Lap_Time := Ada.Real_Time.Clock; end Start; end SPAT.Stop_Watch;
-- This spec has been automatically generated from STM32F429x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma SPARK_Mode (Off); with HAL; with System; package STM32_SVD.GPIO is pragma Preelaborate; --------------- -- Registers -- --------------- -------------------- -- MODER_Register -- -------------------- -- MODER array element subtype MODER_Element is HAL.UInt2; -- MODER array type MODER_Field_Array is array (0 .. 15) of MODER_Element with Component_Size => 2, Size => 32; -- GPIO port mode register type MODER_Register (As_Array : Boolean := False) is record case As_Array is when False => -- MODER as a value Val : HAL.Word; when True => -- MODER as an array Arr : MODER_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for MODER_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; --------------------- -- OTYPER_Register -- --------------------- --------------- -- OTYPER.OT -- --------------- -- OTYPER_OT array type OTYPER_OT_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for OTYPER_OT type OTYPER_OT_Field (As_Array : Boolean := False) is record case As_Array is when False => -- OT as a value Val : HAL.Short; when True => -- OT as an array Arr : OTYPER_OT_Field_Array; end case; end record with Unchecked_Union, Size => 16; for OTYPER_OT_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; -- GPIO port output type register type OTYPER_Register is record -- Port x configuration bits (y = 0..15) OT : OTYPER_OT_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for OTYPER_Register use record OT at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ---------------------- -- OSPEEDR_Register -- ---------------------- -- OSPEEDR array element subtype OSPEEDR_Element is HAL.UInt2; -- OSPEEDR array type OSPEEDR_Field_Array is array (0 .. 15) of OSPEEDR_Element with Component_Size => 2, Size => 32; -- GPIO port output speed register type OSPEEDR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- OSPEEDR as a value Val : HAL.Word; when True => -- OSPEEDR as an array Arr : OSPEEDR_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for OSPEEDR_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; -------------------- -- PUPDR_Register -- -------------------- -- PUPDR array element subtype PUPDR_Element is HAL.UInt2; -- PUPDR array type PUPDR_Field_Array is array (0 .. 15) of PUPDR_Element with Component_Size => 2, Size => 32; -- GPIO port pull-up/pull-down register type PUPDR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- PUPDR as a value Val : HAL.Word; when True => -- PUPDR as an array Arr : PUPDR_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for PUPDR_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; ------------------ -- IDR_Register -- ------------------ ------------- -- IDR.IDR -- ------------- -- IDR array type IDR_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for IDR type IDR_Field (As_Array : Boolean := False) is record case As_Array is when False => -- IDR as a value Val : HAL.Short; when True => -- IDR as an array Arr : IDR_Field_Array; end case; end record with Unchecked_Union, Size => 16; for IDR_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; -- GPIO port input data register type IDR_Register is record -- Read-only. Port input data (y = 0..15) IDR : IDR_Field; -- unspecified Reserved_16_31 : HAL.Short; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for IDR_Register use record IDR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ------------------ -- ODR_Register -- ------------------ ------------- -- ODR.ODR -- ------------- -- ODR array type ODR_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for ODR type ODR_Field (As_Array : Boolean := False) is record case As_Array is when False => -- ODR as a value Val : HAL.Short; when True => -- ODR as an array Arr : ODR_Field_Array; end case; end record with Unchecked_Union, Size => 16; for ODR_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; -- GPIO port output data register type ODR_Register is record -- Port output data (y = 0..15) ODR : ODR_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_16_31 : HAL.Short := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ODR_Register use record ODR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ------------------- -- BSRR_Register -- ------------------- ------------- -- BSRR.BS -- ------------- -- BSRR_BS array type BSRR_BS_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for BSRR_BS type BSRR_BS_Field (As_Array : Boolean := False) is record case As_Array is when False => -- BS as a value Val : HAL.Short; when True => -- BS as an array Arr : BSRR_BS_Field_Array; end case; end record with Unchecked_Union, Size => 16; for BSRR_BS_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; ------------- -- BSRR.BR -- ------------- -- BSRR_BR array type BSRR_BR_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for BSRR_BR type BSRR_BR_Field (As_Array : Boolean := False) is record case As_Array is when False => -- BR as a value Val : HAL.Short; when True => -- BR as an array Arr : BSRR_BR_Field_Array; end case; end record with Unchecked_Union, Size => 16; for BSRR_BR_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; -- GPIO port bit set/reset register type BSRR_Register is record -- Write-only. Port x set bit y (y= 0..15) BS : BSRR_BS_Field := (As_Array => False, Val => 16#0#); -- Write-only. Port x set bit y (y= 0..15) BR : BSRR_BR_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for BSRR_Register use record BS at 0 range 0 .. 15; BR at 0 range 16 .. 31; end record; ------------------- -- LCKR_Register -- ------------------- -------------- -- LCKR.LCK -- -------------- -- LCKR_LCK array type LCKR_LCK_Field_Array is array (0 .. 15) of Boolean with Component_Size => 1, Size => 16; -- Type definition for LCKR_LCK type LCKR_LCK_Field (As_Array : Boolean := False) is record case As_Array is when False => -- LCK as a value Val : HAL.Short; when True => -- LCK as an array Arr : LCKR_LCK_Field_Array; end case; end record with Unchecked_Union, Size => 16; for LCKR_LCK_Field use record Val at 0 range 0 .. 15; Arr at 0 range 0 .. 15; end record; -- GPIO port configuration lock register type LCKR_Register is record -- Port x lock bit y (y= 0..15) LCK : LCKR_LCK_Field := (As_Array => False, Val => 16#0#); -- Port x lock bit y (y= 0..15) LCKK : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for LCKR_Register use record LCK at 0 range 0 .. 15; LCKK at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; ------------------- -- AFRL_Register -- ------------------- -- AFRL array element subtype AFRL_Element is HAL.UInt4; -- AFRL array type AFRL_Field_Array is array (0 .. 7) of AFRL_Element with Component_Size => 4, Size => 32; -- GPIO alternate function low register type AFRL_Register (As_Array : Boolean := False) is record case As_Array is when False => -- AFRL as a value Val : HAL.Word; when True => -- AFRL as an array Arr : AFRL_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for AFRL_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; ------------------- -- AFRH_Register -- ------------------- -- AFRH array element subtype AFRH_Element is HAL.UInt4; -- AFRH array type AFRH_Field_Array is array (8 .. 15) of AFRH_Element with Component_Size => 4, Size => 32; -- GPIO alternate function high register type AFRH_Register (As_Array : Boolean := False) is record case As_Array is when False => -- AFRH as a value Val : HAL.Word; when True => -- AFRH as an array Arr : AFRH_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Bit_Order => System.Low_Order_First; for AFRH_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- General-purpose I/Os type GPIO_Peripheral is record -- GPIO port mode register MODER : MODER_Register; -- GPIO port output type register OTYPER : OTYPER_Register; -- GPIO port output speed register OSPEEDR : OSPEEDR_Register; -- GPIO port pull-up/pull-down register PUPDR : PUPDR_Register; -- GPIO port input data register IDR : IDR_Register; -- GPIO port output data register ODR : ODR_Register; -- GPIO port bit set/reset register BSRR : BSRR_Register; -- GPIO port configuration lock register LCKR : LCKR_Register; -- GPIO alternate function low register AFRL : AFRL_Register; -- GPIO alternate function high register AFRH : AFRH_Register; end record with Volatile; for GPIO_Peripheral use record MODER at 0 range 0 .. 31; OTYPER at 4 range 0 .. 31; OSPEEDR at 8 range 0 .. 31; PUPDR at 12 range 0 .. 31; IDR at 16 range 0 .. 31; ODR at 20 range 0 .. 31; BSRR at 24 range 0 .. 31; LCKR at 28 range 0 .. 31; AFRL at 32 range 0 .. 31; AFRH at 36 range 0 .. 31; end record; -- General-purpose I/Os GPIOA_Periph : aliased GPIO_Peripheral with Import, Address => GPIOA_Base; -- General-purpose I/Os GPIOB_Periph : aliased GPIO_Peripheral with Import, Address => GPIOB_Base; -- General-purpose I/Os GPIOC_Periph : aliased GPIO_Peripheral with Import, Address => GPIOC_Base; -- General-purpose I/Os GPIOD_Periph : aliased GPIO_Peripheral with Import, Address => GPIOD_Base; -- General-purpose I/Os GPIOE_Periph : aliased GPIO_Peripheral with Import, Address => GPIOE_Base; -- General-purpose I/Os GPIOF_Periph : aliased GPIO_Peripheral with Import, Address => GPIOF_Base; -- General-purpose I/Os GPIOG_Periph : aliased GPIO_Peripheral with Import, Address => GPIOG_Base; -- General-purpose I/Os GPIOH_Periph : aliased GPIO_Peripheral with Import, Address => GPIOH_Base; -- General-purpose I/Os GPIOI_Periph : aliased GPIO_Peripheral with Import, Address => GPIOI_Base; -- General-purpose I/Os GPIOJ_Periph : aliased GPIO_Peripheral with Import, Address => GPIOJ_Base; -- General-purpose I/Os GPIOK_Periph : aliased GPIO_Peripheral with Import, Address => GPIOK_Base; end STM32_SVD.GPIO;
with Ada.Text_IO; use Ada.Text_IO; with Ada.Text_IO.Text_Streams; use Ada.Text_IO; with Ada.Streams; use Ada.Streams; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Ada.Command_Line; use Ada.Command_Line; with AWS.Default; with AWS.Net; use AWS; with AWS.Net.SSL; use AWS.Net; with Aids.Env; use Aids; procedure Freenode is type Irc_Credentials is record Host : Unbounded_String; Port : Positive; Nick : Unbounded_String; Pass : Unbounded_String; Channel : Unbounded_String; end record; procedure Print_Irc_Credentials(C: in Irc_Credentials) is begin Put_Line("Host: " & To_String(C.Host)); Put_Line("Port: " & Positive'Image(C.Port)); Put_Line("Nick: " & To_String(C.Nick)); Put_Line("Pass: [REDACTED]"); Put_Line("Channel: " & To_String(C.Channel)); end; function Irc_Credentials_From_File(File_Path: String) return Irc_Credentials is E: Env.Typ := Env.Slurp(File_Path); Result: Irc_Credentials; Env_Key_Not_Found : exception; procedure Extract_String(Key: in Unbounded_String; Value: out Unbounded_String) is begin if not Env.Find(E, Key, Value) then raise Env_Key_Not_Found with (File_Path & ": key `" & To_String(Key) & "` not found"); end if; end; procedure Extract_Positive(Key: in Unbounded_String; Value: out Positive) is S: Unbounded_String; begin if not Env.Find(E, Key, s) then raise Env_Key_Not_Found with (File_Path & ": key `" & To_String(Key) & "` not found"); end if; Value := Positive'Value(To_String(S)); end; begin Extract_String(To_Unbounded_String("HOST"), Result.Host); Extract_Positive(To_Unbounded_String("PORT"), Result.Port); Extract_String(To_Unbounded_String("NICK"), Result.Nick); Extract_String(To_Unbounded_String("PASS"), Result.Pass); Extract_String(To_Unbounded_String("CHANNEL"), Result.Channel); return Result; end; function Chunk_Image(Chunk: Stream_Element_Array) return String is Result : String(1..Integer(Chunk'Length)); Index : Natural := 1; begin for I in Chunk'Range loop Result(Index) := Character'Val(Natural(Chunk(I))); Index := Index + 1; end loop; return Result; end; function String_To_Chunk(S: in String) return Stream_Element_Array is First: Stream_Element_Offset := Stream_Element_Offset(S'First); Last: Stream_Element_Offset := Stream_Element_Offset(S'Last); Result: Stream_Element_Array(First..Last); begin for Index in S'Range loop Result(Stream_Element_Offset(Index)) := Stream_Element(Character'Pos(S(Index))); end loop; return Result; end; procedure Send_Line(Client: in out SSL.Socket_Type; Line: in String) is begin Client.Send(String_To_Chunk(Line & Character'Val(13) & Character'Val(10))); end; -- NOTE: stolen from https://github.com/AdaCore/aws/blob/master/regtests/0243_sshort/sshort.adb#L156 procedure Secure_Connection(Credentials: Irc_Credentials) is Client: SSL.Socket_Type; Config: SSL.Config; begin Put_Line("Establishing secure (Kapp) connection to " & To_String(Credentials.Host) & ":" & Integer'Image(Credentials.Port)); SSL.Initialize(Config, ""); Client.Set_Config(Config); Client.Connect(To_String(Credentials.Host), Credentials.Port); Send_Line(Client, "PASS oauth:" & To_String(Credentials.Pass)); Send_Line(Client, "NICK " & To_String(Credentials.Nick)); Send_Line(Client, "JOIN " & To_String(Credentials.Channel)); Send_Line(Client, "PRIVMSG " & To_String(Credentials.Channel) & " :tsodinPog"); while true loop declare Chunk: Stream_Element_Array := Client.Receive; begin Put(Chunk_Image(Chunk)); end; end loop; end; Not_Enough_Arguments: exception; begin if Argument_Count < 1 then raise Not_Enough_Arguments; end if; declare Twitch: Irc_Credentials := Irc_Credentials_From_File(Argument(1)); begin Secure_Connection(Twitch); end; end;
with Ada.Assertions; use Ada.Assertions; with Ada.Strings; use Ada.Strings; -- Debug includes: -- with Ada.Strings.Fixed; use Ada.Strings.Fixed; -- with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Ada.Text_IO; use Ada.Text_IO; with Rejuvenation.File_Utils; use Rejuvenation.File_Utils; with Rejuvenation.Navigation; use Rejuvenation.Navigation; package body Rejuvenation.Text_Rewrites is -- Public: Collect rewrite operation (node) -------- function Prepend (TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String; Before : Node_Location := No_Trivia; Charset : String := "") return Boolean is First : constant Positive := Start_Offset (Node, Before); WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin Assert (Check => TR.Is_Initialized, Message => "Text Rewrite used uninitialized"); Assert (Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node), Message => "Text Rewrite does not contain provided Node - " & Langkit_Support.Text.Image (Node.Text)); Assert (Check => TR.First <= First, Message => "Text Rewrite - prepend before part"); return Replace (TR, First, First - 1, WText); end Prepend; function Append (TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String; After : Node_Location := No_Trivia; Charset : String := "") return Boolean is Last : constant Positive := End_Offset (Node, After); WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin Assert (Check => TR.Is_Initialized, Message => "Text Rewrite used uninitialized"); Assert (Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node), Message => "Text Rewrite Node does not contain provided Node - " & Langkit_Support.Text.Image (Node.Text)); Assert (Check => Last <= TR.Last, Message => "Text Rewrite - append after part"); return Replace (TR, Last + 1, Last, WText); end Append; procedure Remove (TR : in out Text_Rewrite; Node : Ada_Node'Class; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia) is Dummy : Boolean; begin Dummy := TR.Remove (Node, Before, After); end Remove; procedure Prepend (TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String; Before : Node_Location := No_Trivia; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Prepend (Node, Text, Before, Charset); end Prepend; procedure Append (TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String; After : Node_Location := No_Trivia; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Append (Node, Text, After, Charset); end Append; procedure Replace (TR : in out Text_Rewrite; Node : Ada_Node'Class; Text : String; Before, After : Node_Location := No_Trivia; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Replace (Node, Text, Before, After, Charset); end Replace; procedure Restore (TR : in out Text_Rewrite; Node : Ada_Node'Class) is Dummy : Boolean; begin Dummy := TR.Restore (Node); end Restore; procedure ReplaceAround (TR : in out Text_Rewrite; Node : Ada_Node'Class; Before_Text : String; Innernode : Ada_Node'Class; After_Text : String; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia; Charset : String := "") is NodeStartOffset : constant Positive := Start_Offset (Node, Before); NodeEndOffset : constant Positive := End_Offset (Node, After); InnernodeStartOffset : constant Positive := Start_Offset (Innernode, Before); InnernodeEndOffset : constant Positive := End_Offset (Innernode, After); Before_WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Before_Text, Charset); After_WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (After_Text, Charset); Dummy_Before, Dummy_After : Boolean; begin Assert (Check => TR.Is_Initialized, Message => "Text Rewrite used uninitialized"); Assert (Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Node), Message => "Text Rewrite Node does not contain provided Node - " & Langkit_Support.Text.Image (Node.Text)); Assert (Check => TR.First <= NodeStartOffset, Message => "Text Rewrite - start of node outside part"); Assert (Check => NodeEndOffset <= TR.Last, Message => "Text Rewrite - end of node outside part"); Assert (Check => Is_Reflexive_Ancestor (Node, Innernode), Message => "Innernode should be contained in node"); Log ("ReplaceAround - Before"); Dummy_Before := Replace (TR, NodeStartOffset, InnernodeStartOffset - 1, Before_WText); Log ("ReplaceAround - After"); Dummy_After := Replace (TR, InnernodeEndOffset + 1, NodeEndOffset, After_WText); Assert (Check => Dummy_Before = Dummy_After, Message => Langkit_Support.Text.Image (Node.Full_Sloc_Image) & "How to handle only one of the two is accepted?" & ASCII.LF & "Before = " & Boolean'Image (Dummy_Before) & ASCII.LF & "After = " & Boolean'Image (Dummy_After)); end ReplaceAround; -- Collect rewrite operation (nodes) --------------- function Replace (TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class; Text : String; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia; Charset : String := "") return Boolean is First : constant Positive := Start_Offset (First_Node, Before); Last : constant Positive := End_Offset (Last_Node, After); WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin Assert (Check => TR.Is_Initialized, Message => "Text Rewrite used uninitialized"); -- TODO: First and Last node might be the same node -- How to check it efficiently? -- Options [at least] -- * Move Assert upwards (before duplication happens) -- * add check "First_Node = Last_Node or else .." Assert (Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, First_Node), Message => "Text Rewrite Node does not contain provided First Node - " & Langkit_Support.Text.Image (First_Node.Text)); Assert (Check => TR.First <= First, Message => "Text Rewrite - start of first node outside part"); Assert (Check => Is_Reflexive_Ancestor (TR.Get_Unit.Root, Last_Node), Message => "Text Rewrite Node does not contain provided Last Node - " & Langkit_Support.Text.Image (Last_Node.Text)); Assert (Check => Last <= TR.Last, Message => "Text Rewrite - end of last node outside part"); return Replace (TR, First, Last, WText); end Replace; procedure Remove (TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia) is Dummy : Boolean; begin Dummy := Remove (TR, First_Node, Last_Node, Before, After); end Remove; procedure Replace (TR : in out Text_Rewrite; First_Node, Last_Node : Ada_Node'Class; Text : String; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia; Charset : String := "") is Dummy : Boolean; begin Dummy := Replace (TR, First_Node, Last_Node, Text, Before, After, Charset); end Replace; -- Public: Collect rewrite operation (token) -------- function Prepend (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") return Boolean is First : constant Integer := Raw_Data (Token).Source_First; WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin return Replace (TR, First, First - 1, WText); end Prepend; function Append (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") return Boolean is Last : constant Integer := Raw_Data (Token).Source_Last; WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin return Replace (TR, Last + 1, Last, WText); end Append; function Replace (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") return Boolean is First : constant Integer := Raw_Data (Token).Source_First; Last : constant Integer := Raw_Data (Token).Source_Last; WText : constant Wide_Wide_String := Langkit_Support.Text.Decode (Text, Charset); begin return Replace (TR, First, Last, WText); end Replace; procedure Remove (TR : in out Text_Rewrite; Token : Token_Reference) is Dummy : Boolean; begin Dummy := TR.Remove (Token); end Remove; procedure Prepend (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Prepend (Token, Text, Charset); end Prepend; procedure Append (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Append (Token, Text, Charset); end Append; procedure Replace (TR : in out Text_Rewrite; Token : Token_Reference; Text : String; Charset : String := "") is Dummy : Boolean; begin Dummy := TR.Replace (Token, Text, Charset); end Replace; -- Public: Inspect rewrite operations -------- function HasReplacements (TR : Text_Rewrite) return Boolean is begin return not TR.Entries.Is_Empty; end HasReplacements; -- Public: Apply rewrite operations -------- function ApplyToString (TR : Text_Rewrite) return String is use Replacement_List; Txt : constant Langkit_Support.Text.Text_Type := TR.Get_Unit.Text (TR.First .. TR.Last); Str : Unbounded_Wide_Wide_String := To_Unbounded_Wide_Wide_String (Txt); Str_First : constant Positive := 1; -- lower bound of an Unbounded_Wide_Wide_String is 1 C : Cursor := TR.Entries.Last; begin Assert (Check => TR.Is_Initialized, Message => "Text Rewrite used uninitialized"); Log ("ApplyToString -" & TR.Entries.Length'Image & " Slices"); while Has_Element (C) loop declare RE : constant Replacement_Entry := Element (C); From : constant Positive := RE.First - TR.First + Str_First; To : constant Natural := RE.Last - TR.First + Str_First; Replacement : constant Wide_Wide_String := To_Wide_Wide_String (RE.Text); begin Log ("Slice #" & To_Index (C)'Image & " [" & From'Image & ":" & To'Image & " ]"); Replace_Slice (Str, From, To, Replacement); end; Previous (C); end loop; return Langkit_Support.Text.Encode (To_Wide_Wide_String (Str), TR.Get_Unit.Get_Charset); exception when others => Put_Line ("Error in ApplyToString - " & TR.Get_Unit.Get_Filename); raise; end ApplyToString; function Make_Text_Rewrite_Nodes (First_Node, Last_Node : Ada_Node'Class; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia) return Text_Rewrite is First : constant Positive := Start_Offset (First_Node, Before); Last : constant Positive := End_Offset (Last_Node, After); begin Assert (Check => First <= Last, Message => "Make_Text_Rewrite_Nodes - not a sequence"); Assert (Check => "=" (First_Node.Unit, Last_Node.Unit), Message => "Make_Text_Rewrite_Nodes - not same unit"); return (Entries => Replacement_List.Empty_Vector, Unit => First_Node.Unit, First => First, Last => Last); end Make_Text_Rewrite_Nodes; function Make_Text_Rewrite_Unit (Unit : Analysis_Unit) return Text_Rewrite_Unit is begin return (Entries => Replacement_List.Empty_Vector, Unit => Unit, First => 1, Last => Length (To_Unbounded_Wide_Wide_String (Unit.Text))); end Make_Text_Rewrite_Unit; procedure Apply (TR : Text_Rewrite_Unit) is begin if TR.HasReplacements then Write_String_To_File (TR.ApplyToString, TR.Get_Unit.Get_Filename); end if; end Apply; procedure Apply_And_Reparse (TR : in out Text_Rewrite_Unit) is begin if TR.HasReplacements then declare Unit : constant Analysis_Unit := TR.Get_Unit; begin Write_String_To_File (TR.ApplyToString, Unit.Get_Filename); Unit.Reparse; TR := Make_Text_Rewrite_Unit (Unit); end; end if; end Apply_And_Reparse; -- Private: Collect rewrite operation -------- function Replace_Inner (TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String) return Boolean; -- Return value indicates whether replacement is accepted. function Replace_Inner (TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String) return Boolean is use Replacement_List; New_Text : Unbounded_Wide_Wide_String := To_Unbounded_Wide_Wide_String (Text); C : Cursor := TR.Entries.First; begin while Has_Element (C) loop declare RE : Replacement_Entry := Element (C); begin if First = RE.First then if RE.First - RE.Last = 1 then Log ("Merge insert/replacement with earlier insertion"); New_Text := RE.Text & New_Text; -- Might cover multiple earlier inserted replacements if TR.Entries.Last = C then Delete (TR.Entries, C); else declare Dummy : Cursor := C; begin Delete (TR.Entries, Dummy); end; end if; elsif First - Last = 1 then Log ("Merge insertion with earlier replacement"); RE.Text := New_Text & RE.Text; Replace_Element (TR.Entries, C, RE); return True; elsif Last < RE.Last then Log ("Replacements at the same offset; keep the earlier"); return False; elsif RE.Last < Last then Log ("Replacements at the same offset; keep the current"); -- Might cover multiple earlier inserted replacements if TR.Entries.Last = C then Delete (TR.Entries, C); else declare Dummy : Cursor := C; begin Delete (TR.Entries, Dummy); end; end if; else if RE.Text = New_Text then Log ("Identical replacements"); return True; -- TODO: Why return False / True? -- Both the current is accepted and the old is kept -- (since both are identical) else Log ("Conflicting replacements of equal length; " & "keep the current"); RE.Text := New_Text; Replace_Element (TR.Entries, C, RE); return True; end if; end if; elsif First < RE.First then if RE.Last = Last then -- length != 0 if RE.First - RE.Last = 1 then Log ("Merging of operation with insert operation"); RE.First := First; RE.Text := New_Text & RE.Text; Replace_Element (TR.Entries, C, RE); return True; else Log ("Replacements at the same end-offset; " & "keep the current"); RE.First := First; RE.Text := New_Text; Replace_Element (TR.Entries, C, RE); return True; end if; elsif RE.Last < Last then Log ("Earlier replacement is completely covered " & "by the current"); -- Might cover multiple earlier inserted replacements if TR.Entries.Last = C then Delete (TR.Entries, C); else declare Dummy : Cursor := C; begin Delete (TR.Entries, Dummy); end; end if; elsif RE.First - 1 < Last then Log ("Overlapping edit operations (1)"); return False; else Log ("Insert current operation before earlier operation"); exit; end if; else -- RE.First < First if Last = RE.Last then -- entry.length != 0 if First - Last = 1 then Log ("Merging of operation with insert operation"); RE.Text := RE.Text & New_Text; Replace_Element (TR.Entries, C, RE); return True; else Log ("Replacements at the same end-offset; " & "keep the earlier"); return False; end if; elsif Last < RE.Last then Log ("Current replacement is completely covered " & "by the earlier"); return False; elsif First - 1 < RE.Last then Log ("Overlapping edit operations (2)"); return False; else Next (C); end if; end if; end; end loop; -- To have "the largest replacement wins" independent of the order -- we cannot check for trivial replacements -- since by removing the replacement, -- a later smaller replacement can unexpectedly win! declare RE : Replacement_Entry; begin RE.First := First; RE.Last := Last; RE.Text := New_Text; Log ("Add replacement"); Insert (TR.Entries, C, RE); end; return True; end Replace_Inner; -- -- Debug functionality to check replace -- -- Max_Length_Text : constant Integer := 30; -- -- function Image (TR : Text_Rewrite) return String -- is -- Return_Value : Unbounded_String; -- begin -- for E of TR.Entries loop -- Return_Value := Return_Value & E.First'Image & "-" -- & E.Last'Image & ":" -- & Head (Image (To_Text (E.Text)), Max_Length_Text) -- & ASCII.CR & ASCII.LF; -- end loop; -- -- return To_String (Return_Value); -- end Image; -- -- function Is_Internally_Consistent (TR : Text_Rewrite) return Boolean -- is -- Last : Integer := -1; -- begin -- for E of TR.Entries loop -- if Last > E.First then -- return False; -- else -- Last := E.Last; -- end if; -- end loop; -- return True; -- end Is_Internally_Consistent; -- -- function Replace (TR : in out Text_Rewrite; -- First, Last : Natural; -- Text : Wide_Wide_String) -- return Boolean -- is -- Return_Value : Boolean; -- begin -- Log ("Replace " & First'Image & "-" & Last'Image & ":" & -- Head (Image (To_Text (To_Unbounded_Wide_Wide_String (Text))), -- Max_Length_Text)); -- Return_Value := Replace_Inner (TR, First, Last, Text); -- Assert (Check => Is_Internally_Consistent (TR), -- Message => "Text Rewrite no longer internally consistent" & -- ASCII.CR & ASCII.LF & Image (TR)); -- return Return_Value; -- end Replace; function Replace (TR : in out Text_Rewrite; First, Last : Natural; Text : Wide_Wide_String) return Boolean is (Replace_Inner (TR, First, Last, Text)); -- Proxy to allow easy switching to debug variant -- Private: Debugging utilities -------- procedure Log (Str : String) is begin if DEBUG then Put_Line (Str); end if; end Log; end Rejuvenation.Text_Rewrites;
with Ada.Real_Time; use Ada.Real_Time; with STM32_SVD; use STM32_SVD; with STM32_SVD.TIM; use STM32_SVD.TIM; with STM32_SVD.RCC; use STM32_SVD.RCC; package body STM32GD.Timer.Peripheral is Timer_Callback : Timer_Callback_Type := null; Frequency : constant Natural := 1_000; CK_INT : constant Natural := 8_000_000; Repeat : Boolean; First : Boolean; procedure Start (Time : Time_Span; Callback : Timer_Callback_Type); protected body IRQ_Handler is procedure Handler is begin if Timer = Timer_14 then TIM14_Periph.SR.UIF := 0; end if; if Timer_Callback /= null then if not First then if not Repeat then Stop; end if; Timer_Callback.all; else First := False; end if; end if; end Handler; end IRQ_Handler; procedure Init is begin if Timer = Timer_14 then RCC_Periph.APB1ENR.TIM14EN := 1; TIM14_Periph.PSC.PSC := UInt16 (CK_INT / Frequency); TIM14_Periph.CR1.ARPE := 1; end if; end Init; procedure Start (Time : Time_Span; Callback : Timer_Callback_Type) is MS : UInt16; begin MS := UInt16 (To_Duration (Time) * 1_000); Timer_Callback := Callback; First := True; if Timer = Timer_14 then TIM14_Periph.CNT.CNT := 0; TIM14_Periph.ARR.ARR := MS; TIM14_Periph.CR1.CEN := 1; TIM14_Periph.DIER.UIE := 1; end if; end Start; procedure Stop is begin if Timer = Timer_14 then TIM14_Periph.CR1.CEN := 0; TIM14_Periph.DIER.UIE := 0; end if; end Stop; procedure After (Time : Time_Span; Callback : Timer_Callback_Type) is begin Repeat := False; Start (Time, Callback); end After; procedure Every (Interval : Time_Span; Callback : Timer_Callback_Type) is begin Repeat := True; Start (Interval, Callback); end Every; end STM32GD.Timer.Peripheral;
----------------------------------------------------------------------- -- AWA.Changelogs.Models -- AWA.Changelogs.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-spec.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- pragma Warnings (Off); with ADO.Sessions; with ADO.Objects; with ADO.Statements; with ADO.SQL; with ADO.Schemas; with Ada.Calendar; with Ada.Containers.Vectors; with Ada.Strings.Unbounded; with Util.Beans.Objects; with Util.Beans.Basic.Lists; with AWA.Users.Models; pragma Warnings (On); package AWA.Changelogs.Models is pragma Style_Checks ("-mr"); type Changelog_Ref is new ADO.Objects.Object_Ref with null record; -- Create an object key for Changelog. function Changelog_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Changelog from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Changelog_Key (Id : in String) return ADO.Objects.Object_Key; Null_Changelog : constant Changelog_Ref; function "=" (Left, Right : Changelog_Ref'Class) return Boolean; -- Set the changelog identifier. procedure Set_Id (Object : in out Changelog_Ref; Value : in ADO.Identifier); -- Get the changelog identifier. function Get_Id (Object : in Changelog_Ref) return ADO.Identifier; -- Set the changelog date. procedure Set_Date (Object : in out Changelog_Ref; Value : in Ada.Calendar.Time); -- Get the changelog date. function Get_Date (Object : in Changelog_Ref) return Ada.Calendar.Time; -- Set the changelog text. procedure Set_Text (Object : in out Changelog_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String); procedure Set_Text (Object : in out Changelog_Ref; Value : in String); -- Get the changelog text. function Get_Text (Object : in Changelog_Ref) return Ada.Strings.Unbounded.Unbounded_String; function Get_Text (Object : in Changelog_Ref) return String; -- Set the optional entity to which the changelog is associated. procedure Set_For_Entity_Id (Object : in out Changelog_Ref; Value : in ADO.Identifier); -- Get the optional entity to which the changelog is associated. function Get_For_Entity_Id (Object : in Changelog_Ref) return ADO.Identifier; -- procedure Set_User (Object : in out Changelog_Ref; Value : in AWA.Users.Models.User_Ref'Class); -- function Get_User (Object : in Changelog_Ref) return AWA.Users.Models.User_Ref'Class; -- procedure Set_Entity_Type (Object : in out Changelog_Ref; Value : in ADO.Entity_Type); -- function Get_Entity_Type (Object : in Changelog_Ref) return ADO.Entity_Type; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in <b>Found</b> if the object was found and False if it does not exist. procedure Load (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Changelog_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Changelog_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition CHANGELOG_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Changelog_Ref); -- Copy of the object. procedure Copy (Object : in Changelog_Ref; Into : in out Changelog_Ref); private CHANGELOG_NAME : aliased constant String := "awa_changelog"; COL_0_1_NAME : aliased constant String := "id"; COL_1_1_NAME : aliased constant String := "date"; COL_2_1_NAME : aliased constant String := "text"; COL_3_1_NAME : aliased constant String := "for_entity_id"; COL_4_1_NAME : aliased constant String := "user_id"; COL_5_1_NAME : aliased constant String := "entity_type"; CHANGELOG_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 6, Table => CHANGELOG_NAME'Access, Members => ( 1 => COL_0_1_NAME'Access, 2 => COL_1_1_NAME'Access, 3 => COL_2_1_NAME'Access, 4 => COL_3_1_NAME'Access, 5 => COL_4_1_NAME'Access, 6 => COL_5_1_NAME'Access) ); CHANGELOG_TABLE : constant ADO.Schemas.Class_Mapping_Access := CHANGELOG_DEF'Access; Null_Changelog : constant Changelog_Ref := Changelog_Ref'(ADO.Objects.Object_Ref with null record); type Changelog_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => CHANGELOG_DEF'Access) with record Date : Ada.Calendar.Time; Text : Ada.Strings.Unbounded.Unbounded_String; For_Entity_Id : ADO.Identifier; User : AWA.Users.Models.User_Ref; Entity_Type : ADO.Entity_Type; end record; type Changelog_Access is access all Changelog_Impl; overriding procedure Destroy (Object : access Changelog_Impl); overriding procedure Find (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Changelog_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Changelog_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Changelog_Ref'Class; Impl : out Changelog_Access); end AWA.Changelogs.Models;
with physics.Space, physics.Shape, physics.Object, physics.Forge, physics.Engine, ada.text_IO; procedure launch_test_Engine -- -- Simply exercises the physics engine. -- is use physics.Math, physics.Forge, ada.text_IO; the_Space : physics.Space.view := physics.Space .view (new_Space (Physics.Box2d)); the_Sphere : physics.Shape .view := the_Space.new_circle_Shape; the_Box : physics.Shape .view := the_Space.new_circle_Shape; the_Ball : physics.Object.view := the_Space.new_Object (of_shape => the_Sphere, of_mass => 1.0, friction => 0.5, restitution => 0.5, at_site => (0.0, 10.0, 0.0), is_kinematic => False); the_Ground : physics.Object.view := the_Space.new_Object (of_shape => the_Box, of_mass => 0.0, friction => 0.5, restitution => 0.5, at_site => (0.0, 0.0, 0.0), is_kinematic => False); the_Engine : aliased physics.Engine.item; begin -- the_Engine.start (space_Kind => Physics.Box2d); the_Engine.start (the_Space); -- the_Engine.add (the_Ground); the_Engine.add (the_Ball); -- for Count in 1 .. 100 loop -- the_Space.evolve (by => 1.0/60.0); delay 1.0/500.0; put_Line ( "Sites ~ Ball => " & Image (the_Ball .Site) & " Ground => " & Image (the_Ground.Site)); end loop; the_Engine.stop; -- for Count in 1 .. 100 -- loop -- the_Space.evolve (by => 1.0/60.0); -- -- put_Line ( "Sites ~ Ball => " & Image (the_Ball .Site) -- & " Ground => " & Image (the_Ground.Site)); -- end loop; end launch_test_Engine;
-- Mojang Session API -- No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator) -- ------------ EDIT NOTE ------------ -- This file was generated with openapi-generator. You can modify it to implement -- the server. After you modify this file, you should add the following line -- to the .openapi-generator-ignore file: -- -- src/com-github-asyncmc-mojang-sessions-ada-server-model.ads -- -- Then, you can drop this edit note comment. -- ------------ EDIT NOTE ------------ package com.github is end com.github;