bigcode/the-stack-smol-xl · Datasets at Hugging Face

0e82e0b6afde8b7d856c36b7e8b6ecb54a16d997

3,027

ads

Ada

source/stm32-f4-address_map.ads

Vovanium/stm32-ada

e0833747326d89fb16e492cd396bf49ba5a6734a

[ "MIT" ]

1

2019-04-13T12:56:08.000Z

source/stm32-f4-address_map.ads

Vovanium/stm32-ada

e0833747326d89fb16e492cd396bf49ba5a6734a

[ "MIT" ]

null

source/stm32-f4-address_map.ads

Vovanium/stm32-ada

e0833747326d89fb16e492cd396bf49ba5a6734a

[ "MIT" ]

null

package STM32.F4.Address_Map is pragma Pure; TIM2: constant := 16#4000_0000#; TIM3: constant := 16#4000_0400#; TIM4: constant := 16#4000_0800#; TIM5: constant := 16#4000_0C00#; TIM6: constant := 16#4000_1000#; TIM7: constant := 16#4000_1400#; TIM12: constant := 16#4000_1800#; TIM13: constant := 16#4000_1C00#; TIM14: constant := 16#4000_2000#; RTC_and_BKP: constant := 16#4000_2800#; WWDG: constant := 16#4000_2C00#; IWDG: constant := 16#4000_3000#; I2S2ext: constant := 16#4000_3400#; SPI2_I2S2: constant := 16#4000_3800#; SPI3_I2S3: constant := 16#4000_3C00#; I2S3ext: constant := 16#4000_4000#; USART2: constant := 16#4000_4400#; USART3: constant := 16#4000_4800#; UART4: constant := 16#4000_4C00#; UART5: constant := 16#4000_5000#; I2C1: constant := 16#4000_5400#; I2C2: constant := 16#4000_5800#; I2C3: constant := 16#4000_5C00#; CAN1: constant := 16#4000_6400#; CAN2: constant := 16#4000_6800#; PWR: constant := 16#4000_7000#; DAC: constant := 16#4000_7400#; UART7: constant := 14#4000_7800#; UART8: constant := 14#4000_7C00#; TIM1: constant := 16#4001_0000#; TIM8: constant := 16#4001_0400#; USART1: constant := 16#4001_1000#; USART6: constant := 16#4001_1400#; ADC1_2_3: constant := 16#4001_2000#; SDIO: constant := 16#4001_2C00#; SPI1: constant := 16#4001_3000#; SPI4: constant := 16#4001_3400#; SYSCFG: constant := 16#4001_3800#; EXTI: constant := 16#4001_3C00#; TIM9: constant := 16#4001_4000#; TIM10: constant := 16#4001_4400#; TIM11: constant := 16#4001_4800#; GPIOA: constant := 16#4002_0000#; GPIOB: constant := 16#4002_0400#; GPIOC: constant := 16#4002_0800#; GPIOD: constant := 16#4002_0C00#; GPIOE: constant := 16#4002_1000#; GPIOF: constant := 16#4002_1400#; GPIOG: constant := 16#4002_1800#; GPIOH: constant := 16#4002_1C00#; GPIOI: constant := 16#4002_2000#; GPIOJ: constant := 16#4002_2400#; GPIOK: constant := 16#4002_2800#; CRC: constant := 16#4002_3000#; RCC: constant := 16#4002_3800#; Flash_IR: constant := 16#4002_3C00#; BKPSRAM: constant := 16#4002_4000#; DMA1: constant := 16#4002_6000#; DMA2: constant := 16#4002_6400#; Ethernet_MAC:constant := 16#4002_8000#; DMA2D: constant := 16#4002_B000#; USB_OTG_HS: constant := 16#4004_0000#; USB_OTG_FS: constant := 16#5000_0000#; DCMI: constant := 16#5005_0000#; CRYP: constant := 16#5006_0000#; HASH: constant := 16#5006_0400#; RNG: constant := 16#5006_0800#; FSMC_Bank1: constant := 16#6000_0000#; FSMC_Bank2: constant := 16#7000_0000#; FSMC_Bank3: constant := 16#8000_0000#; FSMC_Bank4: constant := 16#9000_0000#; FMC_FSMC: constant := 16#A000_0000#; end STM32.F4.Address_Map;

38.316456

40

0.601916

18e31b9a37523bf77cc6f174c114efebea4dbeb5

525

ads

Ada

src/fltk-images-pixmaps-gif.ads

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

1

2020-12-18T15:20:13.000Z

src/fltk-images-pixmaps-gif.ads

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

null

src/fltk-images-pixmaps-gif.ads

micahwelf/FLTK-Ada

83e0c58ea98e5ede2cbbb158b42eae44196c3ba7

[ "Unlicense" ]

null

package FLTK.Images.Pixmaps.GIF is type GIF_Image is new Pixmap with private; type GIF_Image_Reference (Data : not null access GIF_Image'Class) is limited null record with Implicit_Dereference => Data; package Forge is function Create (Filename : in String) return GIF_Image; end Forge; private type GIF_Image is new Pixmap with null record; overriding procedure Finalize (This : in out GIF_Image); end FLTK.Images.Pixmaps.GIF;

15.441176

72

0.657143

234bec781735d70f9d2be154692aac2bb19f1c70

7,364

adb

Ada

components/src/screen/lcd/lcd_hd44780.adb

RREE/Ada_Drivers_Library

791616adf3c742de256e37717d3376393e6f407a

[ "BSD-3-Clause" ]

null

components/src/screen/lcd/lcd_hd44780.adb

RREE/Ada_Drivers_Library

791616adf3c742de256e37717d3376393e6f407a

[ "BSD-3-Clause" ]

null

components/src/screen/lcd/lcd_hd44780.adb

RREE/Ada_Drivers_Library

791616adf3c742de256e37717d3376393e6f407a

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2022, 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. -- -- -- ------------------------------------------------------------------------------ -- -- From the Hitachi HD44780U data sheet: -- -- The HD44780U has two 8-bit registers, an instruction register (IR) -- and a data register (DR). -- -- The IR stores instruction codes, such as display clear and cursor -- shift, and address information for display data RAM (DDRAM) and -- character generator RAM (CGRAM). The IR can only be written from -- the MPU. -- -- The DR temporarily stores data to be written into DDRAM or CGRAM -- and temporarily stores data to be read from DDRAM or CGRAM. Data -- written into the DR from the MPU is automatically written into -- DDRAM or CGRAM by an internal operation. The DR is also used for -- data storage when reading data from DDRAM or CGRAM. When address -- information is written into the IR, data is read and then stored -- into the DR from DDRAM or CGRAM by an internal operation. Data -- transfer between the MPU is then completed when the MPU reads the -- DR. After the read, data in DDRAM or CGRAM at the next address is -- sent to the DR for the next read from the MPU. By the register -- selector (RS) signal, these two registers can be selected package body LCD_HD44780 is ---------------- -- Initialize -- ---------------- procedure Initialize (This : in out LCD_Module) is Dispatch : constant Any_LCD_Module := This'Unchecked_Access; begin Dispatch.Init_4bit_Mode; -- now we can use the standard Command routine for set up Dispatch.Command (Commands.Display_On); -- implies blink off and cursor off This.Clear_Screen; Dispatch.Command (Commands.Entry_Inc); end Initialize; --------- -- Put -- --------- -- output at the current cursor location procedure Put (This : in out LCD_Module; C : Character) is Dispatch : constant Any_LCD_Module := This'Unchecked_Access; begin Dispatch.Output (Character'Pos (C), Is_Data => True); end Put; -- output at the current cursor location procedure Put (This : in out LCD_Module; Text : String) is begin for C of Text loop This.Put (C); end loop; end Put; -- output at the specified cursor location procedure Put (This : in out LCD_Module; X : Char_Position; Y : Line_Position; Text : String) is begin This.Goto_XY (X, Y); This.Put (Text); end Put; ------------- -- Command -- ------------- -- output the command code Cmd to the display procedure Command (This : in out LCD_Module; Cmd : Command_Type) is Dispatch : constant Any_LCD_Module := This'Unchecked_Access; begin Dispatch.Output (UInt8 (Cmd), Is_Data => False); end Command; ------------------ -- Clear_Screen -- ------------------ -- clear display and move cursor to home position procedure Clear_Screen (This : in out LCD_Module) is begin This.Command (Commands.Clear); This.Time.Delay_Microseconds (1_500); end Clear_Screen; ---------- -- Home -- ---------- -- move cursor to home position procedure Home (This : in out LCD_Module) is begin This.Command (16#02#); end Home; ------------- -- Goto_XY -- ------------- -- move cursor into line Y and before character position X. Lines -- are numbered 1 to 2 (or 1 to 4 on big displays). The left most -- character position is Y = 1. The right most position is -- defined by Lcd.Display.Width; procedure Goto_XY (This : in out LCD_Module; X : Char_Position; Y : Line_Position) is begin if X > This.Display_Width then return; end if; if Y > This.Display_Height then return; end if; case Y is when 1 => Command (This, 16#80# + Command_Type (X) - 1); when 2 => Command (This, 16#C0# + Command_Type (X) - 1); when 3 => Command (This, 16#80# + Command_Type (X + This.Display_Width) - 1); when 4 => Command (This, 16#C0# + Command_Type (X + This.Display_Width) - 1); end case; end Goto_XY; ----------------------------- -- Create_Custom_Character -- ----------------------------- procedure Create_Custom_Character (This : in out LCD_Module; Position : Custom_Character_Index; Definition : Custom_Character_Definition) is Start_Address : constant := 16#40#; Dispatch : constant Any_LCD_Module := This'Unchecked_Access; begin Dispatch.Output (UInt8 (Start_Address + 8 * Position), Is_Data => False); for Line of Definition loop Dispatch.Output (UInt8 (Line), Is_Data => True); end loop; end Create_Custom_Character; ----------------- -- Custom_Char -- ----------------- function Custom_Char (From_Index : Custom_Character_Index) return Character is begin return Character'Val (From_Index); end Custom_Char; end LCD_HD44780;

39.805405

86

0.573737

200f8d7989cab56d69283f9d2f8df0493a64962d

50,223

adb

Ada

src/model/jason-projects-models.adb

stcarrez/jason

eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc

[ "Apache-2.0" ]

2

2019-01-26T22:14:55.000Z

2019-01-28T10:49:46.000Z

src/model/jason-projects-models.adb

stcarrez/jason

eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc

[ "Apache-2.0" ]

null

src/model/jason-projects-models.adb

stcarrez/jason

eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- Jason.Projects.Models -- Jason.Projects.Models ----------------------------------------------------------------------- -- 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 1095 ----------------------------------------------------------------------- -- Copyright (C) 2020 Stephane.Carrez -- Written by Stephane.Carrez ([email protected]) -- -- 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; with ASF.Events.Faces.Actions; package body Jason.Projects.Models is use type ADO.Objects.Object_Record_Access; use type ADO.Objects.Object_Ref; pragma Warnings (Off, "formal parameter * is not referenced"); function Project_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => PROJECT_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Project_Key; function Project_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => PROJECT_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Project_Key; function "=" (Left, Right : Project_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 Project_Ref'Class; Impl : out Project_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Project_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Project_Ref) is Impl : Project_Access; begin Impl := new Project_Impl; Impl.Version := 0; Impl.Create_Date := ADO.DEFAULT_TIME; Impl.Status := Jason.Projects.Models.Status_Type'First; Impl.Last_Ticket := 0; Impl.Update_Date := ADO.DEFAULT_TIME; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Project -- ---------------------------------------- procedure Set_Id (Object : in out Project_Ref; Value : in ADO.Identifier) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Project_Ref) return ADO.Identifier is Impl : constant Project_Access := Project_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Project_Ref) return Integer is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Name (Object : in out Project_Ref; Value : in String) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Name, Value); end Set_Name; procedure Set_Name (Object : in out Project_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Name, Value); end Set_Name; function Get_Name (Object : in Project_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Name); end Get_Name; function Get_Name (Object : in Project_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Name; end Get_Name; procedure Set_Create_Date (Object : in out Project_Ref; Value : in Ada.Calendar.Time) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 4, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Project_Ref) return Ada.Calendar.Time is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Status (Object : in out Project_Ref; Value : in Jason.Projects.Models.Status_Type) is procedure Set_Field_Enum is new ADO.Objects.Set_Field_Operation (Status_Type); Impl : Project_Access; begin Set_Field (Object, Impl); Set_Field_Enum (Impl.all, 5, Impl.Status, Value); end Set_Status; function Get_Status (Object : in Project_Ref) return Jason.Projects.Models.Status_Type is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Status; end Get_Status; procedure Set_Last_Ticket (Object : in out Project_Ref; Value : in Integer) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Integer (Impl.all, 6, Impl.Last_Ticket, Value); end Set_Last_Ticket; function Get_Last_Ticket (Object : in Project_Ref) return Integer is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Last_Ticket; end Get_Last_Ticket; procedure Set_Update_Date (Object : in out Project_Ref; Value : in Ada.Calendar.Time) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 7, Impl.Update_Date, Value); end Set_Update_Date; function Get_Update_Date (Object : in Project_Ref) return Ada.Calendar.Time is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Update_Date; end Get_Update_Date; procedure Set_Description (Object : in out Project_Ref; Value : in String) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 8, Impl.Description, Value); end Set_Description; procedure Set_Description (Object : in out Project_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 8, Impl.Description, Value); end Set_Description; function Get_Description (Object : in Project_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Description); end Get_Description; function Get_Description (Object : in Project_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Description; end Get_Description; procedure Set_Wiki (Object : in out Project_Ref; Value : in AWA.Wikis.Models.Wiki_Space_Ref'Class) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 9, Impl.Wiki, Value); end Set_Wiki; function Get_Wiki (Object : in Project_Ref) return AWA.Wikis.Models.Wiki_Space_Ref'Class is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Wiki; end Get_Wiki; procedure Set_Owner (Object : in out Project_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Project_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 10, Impl.Owner, Value); end Set_Owner; function Get_Owner (Object : in Project_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Owner; end Get_Owner; -- Copy of the object. procedure Copy (Object : in Project_Ref; Into : in out Project_Ref) is Result : Project_Ref; begin if not Object.Is_Null then declare Impl : constant Project_Access := Project_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Project_Access := new Project_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Version := Impl.Version; Copy.Name := Impl.Name; Copy.Create_Date := Impl.Create_Date; Copy.Status := Impl.Status; Copy.Last_Ticket := Impl.Last_Ticket; Copy.Update_Date := Impl.Update_Date; Copy.Description := Impl.Description; Copy.Wiki := Impl.Wiki; Copy.Owner := Impl.Owner; end; end if; Into := Result; end Copy; procedure Find (Object : in out Project_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Project_Access := new Project_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 Project_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Project_Access := new Project_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 Project_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Project_Access := new Project_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 Project_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 Project_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 Project_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 Project_Impl) is type Project_Impl_Ptr is access all Project_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Project_Impl, Project_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Project_Impl_Ptr := Project_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Project_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 (Query, PROJECT_DEF'Access); begin 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 Project_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 Project_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (PROJECT_DEF'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 (3) then Stmt.Save_Field (Name => COL_2_1_NAME, -- name Value => Object.Name); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_1_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_1_NAME, -- status Value => Integer (Status_Type'Pos (Object.Status))); Object.Clear_Modified (5); end if; if Object.Is_Modified (6) then Stmt.Save_Field (Name => COL_5_1_NAME, -- last_ticket Value => Object.Last_Ticket); Object.Clear_Modified (6); end if; if Object.Is_Modified (7) then Stmt.Save_Field (Name => COL_6_1_NAME, -- update_date Value => Object.Update_Date); Object.Clear_Modified (7); end if; if Object.Is_Modified (8) then Stmt.Save_Field (Name => COL_7_1_NAME, -- description Value => Object.Description); Object.Clear_Modified (8); end if; if Object.Is_Modified (9) then Stmt.Save_Field (Name => COL_8_1_NAME, -- wiki_id Value => Object.Wiki); Object.Clear_Modified (9); end if; if Object.Is_Modified (10) then Stmt.Save_Field (Name => COL_9_1_NAME, -- owner_id Value => Object.Owner); Object.Clear_Modified (10); 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 Project_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (PROJECT_DEF'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, -- name Value => Object.Name); Query.Save_Field (Name => COL_3_1_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_4_1_NAME, -- status Value => Integer (Status_Type'Pos (Object.Status))); Query.Save_Field (Name => COL_5_1_NAME, -- last_ticket Value => Object.Last_Ticket); Query.Save_Field (Name => COL_6_1_NAME, -- update_date Value => Object.Update_Date); Query.Save_Field (Name => COL_7_1_NAME, -- description Value => Object.Description); Query.Save_Field (Name => COL_8_1_NAME, -- wiki_id Value => Object.Wiki); Query.Save_Field (Name => COL_9_1_NAME, -- owner_id Value => Object.Owner); 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 Project_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (PROJECT_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Project_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Project_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Project_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "name" then return Util.Beans.Objects.To_Object (Impl.Name); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); elsif Name = "status" then return Jason.Projects.Models.Status_Type_Objects.To_Object (Impl.Status); elsif Name = "last_ticket" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Last_Ticket)); elsif Name = "update_date" then return Util.Beans.Objects.Time.To_Object (Impl.Update_Date); elsif Name = "description" then return Util.Beans.Objects.To_Object (Impl.Description); end if; return Util.Beans.Objects.Null_Object; end Get_Value; procedure List (Object : in out Project_Vector; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, PROJECT_DEF'Access); begin Stmt.Execute; Project_Vectors.Clear (Object); while Stmt.Has_Elements loop declare Item : Project_Ref; Impl : constant Project_Access := new Project_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 Project_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Name := Stmt.Get_Unbounded_String (2); Object.Create_Date := Stmt.Get_Time (3); Object.Status := Status_Type'Val (Stmt.Get_Integer (4)); Object.Last_Ticket := Stmt.Get_Integer (5); Object.Update_Date := Stmt.Get_Time (6); Object.Description := Stmt.Get_Unbounded_String (7); if not Stmt.Is_Null (8) then Object.Wiki.Set_Key_Value (Stmt.Get_Identifier (8), Session); end if; if not Stmt.Is_Null (9) then Object.Owner.Set_Key_Value (Stmt.Get_Identifier (9), Session); end if; Object.Version := Stmt.Get_Integer (1); ADO.Objects.Set_Created (Object); end Load; function Attribute_Definition_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => ATTRIBUTE_DEFINITION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Attribute_Definition_Key; function Attribute_Definition_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => ATTRIBUTE_DEFINITION_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Attribute_Definition_Key; function "=" (Left, Right : Attribute_Definition_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 Attribute_Definition_Ref'Class; Impl : out Attribute_Definition_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Attribute_Definition_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Attribute_Definition_Ref) is Impl : Attribute_Definition_Access; begin Impl := new Attribute_Definition_Impl; Impl.Version := 0; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Attribute_Definition -- ---------------------------------------- procedure Set_Id (Object : in out Attribute_Definition_Ref; Value : in ADO.Identifier) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 1, Value); end Set_Id; function Get_Id (Object : in Attribute_Definition_Ref) return ADO.Identifier is Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Attribute_Definition_Ref) return Integer is Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Name (Object : in out Attribute_Definition_Ref; Value : in String) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 3, Impl.Name, Value); end Set_Name; procedure Set_Name (Object : in out Attribute_Definition_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 3, Impl.Name, Value); end Set_Name; function Get_Name (Object : in Attribute_Definition_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Name); end Get_Name; function Get_Name (Object : in Attribute_Definition_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Name; end Get_Name; procedure Set_Default_Value (Object : in out Attribute_Definition_Ref; Value : in String) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_String (Impl.all, 4, Impl.Default_Value, Value); end Set_Default_Value; procedure Set_Default_Value (Object : in out Attribute_Definition_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Unbounded_String (Impl.all, 4, Impl.Default_Value, Value); end Set_Default_Value; function Get_Default_Value (Object : in Attribute_Definition_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Default_Value); end Get_Default_Value; function Get_Default_Value (Object : in Attribute_Definition_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Default_Value; end Get_Default_Value; procedure Set_Project (Object : in out Attribute_Definition_Ref; Value : in Jason.Projects.Models.Project_Ref'Class) is Impl : Attribute_Definition_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 5, Impl.Project, Value); end Set_Project; function Get_Project (Object : in Attribute_Definition_Ref) return Jason.Projects.Models.Project_Ref'Class is Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Project; end Get_Project; -- Copy of the object. procedure Copy (Object : in Attribute_Definition_Ref; Into : in out Attribute_Definition_Ref) is Result : Attribute_Definition_Ref; begin if not Object.Is_Null then declare Impl : constant Attribute_Definition_Access := Attribute_Definition_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Attribute_Definition_Access := new Attribute_Definition_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Version := Impl.Version; Copy.Name := Impl.Name; Copy.Default_Value := Impl.Default_Value; Copy.Project := Impl.Project; end; end if; Into := Result; end Copy; procedure Find (Object : in out Attribute_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Attribute_Definition_Access := new Attribute_Definition_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 Attribute_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Attribute_Definition_Access := new Attribute_Definition_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 Attribute_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Attribute_Definition_Access := new Attribute_Definition_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 Attribute_Definition_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 Attribute_Definition_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 Attribute_Definition_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 Attribute_Definition_Impl) is type Attribute_Definition_Impl_Ptr is access all Attribute_Definition_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Attribute_Definition_Impl, Attribute_Definition_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Attribute_Definition_Impl_Ptr := Attribute_Definition_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Attribute_Definition_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 (Query, ATTRIBUTE_DEFINITION_DEF'Access); begin 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 Attribute_Definition_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 Attribute_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (ATTRIBUTE_DEFINITION_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_2_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (1); end if; if Object.Is_Modified (3) then Stmt.Save_Field (Name => COL_2_2_NAME, -- name Value => Object.Name); Object.Clear_Modified (3); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_2_NAME, -- default_value Value => Object.Default_Value); Object.Clear_Modified (4); end if; if Object.Is_Modified (5) then Stmt.Save_Field (Name => COL_4_2_NAME, -- project_id Value => Object.Project); Object.Clear_Modified (5); 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 Attribute_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (ATTRIBUTE_DEFINITION_DEF'Access); Result : Integer; begin Object.Version := 1; Session.Allocate (Id => Object); Query.Save_Field (Name => COL_0_2_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_1_2_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_2_2_NAME, -- name Value => Object.Name); Query.Save_Field (Name => COL_3_2_NAME, -- default_value Value => Object.Default_Value); Query.Save_Field (Name => COL_4_2_NAME, -- project_id Value => Object.Project); 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 Attribute_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (ATTRIBUTE_DEFINITION_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Attribute_Definition_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Attribute_Definition_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Attribute_Definition_Impl (Obj.all)'Access; if Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "name" then return Util.Beans.Objects.To_Object (Impl.Name); elsif Name = "default_value" then return Util.Beans.Objects.To_Object (Impl.Default_Value); end if; return Util.Beans.Objects.Null_Object; end Get_Value; procedure List (Object : in out Attribute_Definition_Vector; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class) is Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Query, ATTRIBUTE_DEFINITION_DEF'Access); begin Stmt.Execute; Attribute_Definition_Vectors.Clear (Object); while Stmt.Has_Elements loop declare Item : Attribute_Definition_Ref; Impl : constant Attribute_Definition_Access := new Attribute_Definition_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 Attribute_Definition_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Set_Key_Value (Stmt.Get_Identifier (0)); Object.Name := Stmt.Get_Unbounded_String (2); Object.Default_Value := Stmt.Get_Unbounded_String (3); if not Stmt.Is_Null (4) then Object.Project.Set_Key_Value (Stmt.Get_Identifier (4), Session); end if; Object.Version := Stmt.Get_Integer (1); ADO.Objects.Set_Created (Object); end Load; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in List_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "title" then return Util.Beans.Objects.To_Object (From.Title); elsif Name = "status" then return Jason.Projects.Models.Status_Type_Objects.To_Object (From.Status); elsif Name = "create_date" then return Util.Beans.Objects.Time.To_Object (From.Create_Date); elsif Name = "total_duration" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Total_Duration)); elsif Name = "total_done" then return Util.Beans.Objects.To_Object (From.Total_Done); elsif Name = "close_count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Close_Count)); elsif Name = "open_count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Open_Count)); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out List_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "title" then Item.Title := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "status" then Item.Status := Jason.Projects.Models.Status_Type_Objects.To_Value (Value); elsif Name = "create_date" then Item.Create_Date := Util.Beans.Objects.Time.To_Time (Value); elsif Name = "total_duration" then Item.Total_Duration := Util.Beans.Objects.To_Integer (Value); elsif Name = "total_done" then Item.Total_Done := Util.Beans.Objects.To_Float (Value); elsif Name = "close_count" then Item.Close_Count := Util.Beans.Objects.To_Integer (Value); elsif Name = "open_count" then Item.Open_Count := Util.Beans.Objects.To_Integer (Value); end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out List_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The list of projects. -- -------------------- procedure List (Object : in out List_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out List_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out List_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.Title := Stmt.Get_Unbounded_String (1); Into.Status := Jason.Projects.Models.Status_Type'Val (Stmt.Get_Integer (2)); Into.Create_Date := Stmt.Get_Time (3); Into.Total_Duration := Stmt.Get_Natural (4); Into.Total_Done := Stmt.Get_Float (5); Into.Close_Count := Stmt.Get_Natural (6); Into.Open_Count := Stmt.Get_Natural (7); end Read; begin Stmt.Execute; List_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; procedure Op_Load (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Project_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_Bean, Method => Op_Load, Name => "load"); procedure Op_Create (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Create (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_Bean'Class (Bean).Create (Outcome); end Op_Create; package Binding_Project_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_Bean, Method => Op_Create, Name => "create"); procedure Op_Save (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Save (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_Bean'Class (Bean).Save (Outcome); end Op_Save; package Binding_Project_Bean_3 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_Bean, Method => Op_Save, Name => "save"); procedure Op_Create_Wiki (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Create_Wiki (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_Bean'Class (Bean).Create_Wiki (Outcome); end Op_Create_Wiki; package Binding_Project_Bean_4 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_Bean, Method => Op_Create_Wiki, Name => "create_wiki"); procedure Op_Load_Wiki (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load_Wiki (Bean : in out Project_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_Bean'Class (Bean).Load_Wiki (Outcome); end Op_Load_Wiki; package Binding_Project_Bean_5 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_Bean, Method => Op_Load_Wiki, Name => "load_wiki"); Binding_Project_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Project_Bean_1.Proxy'Access, 2 => Binding_Project_Bean_2.Proxy'Access, 3 => Binding_Project_Bean_3.Proxy'Access, 4 => Binding_Project_Bean_4.Proxy'Access, 5 => Binding_Project_Bean_5.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Project_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Project_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Project_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "name" then Item.Set_Name (Util.Beans.Objects.To_String (Value)); elsif Name = "create_date" then Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "status" then Item.Set_Status (Status_Type_Objects.To_Value (Value)); elsif Name = "last_ticket" then Item.Set_Last_Ticket (Util.Beans.Objects.To_Integer (Value)); elsif Name = "update_date" then Item.Set_Update_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "description" then Item.Set_Description (Util.Beans.Objects.To_String (Value)); end if; end Set_Value; procedure Op_Load (Bean : in out Project_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Load (Bean : in out Project_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Project_List_Bean'Class (Bean).Load (Outcome); end Op_Load; package Binding_Project_List_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Project_List_Bean, Method => Op_Load, Name => "load"); Binding_Project_List_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Project_List_Bean_1.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Project_List_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Project_List_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Project_List_Bean; Name : in String) return Util.Beans.Objects.Object is begin if Name = "page" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page)); elsif Name = "page_size" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Page_Size)); elsif Name = "count" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Count)); elsif Name = "tag" then return Util.Beans.Objects.To_Object (From.Tag); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Project_List_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "page" then Item.Page := Util.Beans.Objects.To_Integer (Value); elsif Name = "page_size" then Item.Page_Size := Util.Beans.Objects.To_Integer (Value); elsif Name = "count" then Item.Count := Util.Beans.Objects.To_Integer (Value); elsif Name = "tag" then Item.Tag := Util.Beans.Objects.To_Unbounded_String (Value); end if; end Set_Value; end Jason.Projects.Models;

38.45559

94

0.600681

cb41e03bda297bb82052a086fabe24b026df02a8

1,498

ads

Ada

lib/aflexnat/command_line_interface.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

1

2018-08-11T01:51:27.000Z

lib/aflexnat/command_line_interface.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

null

lib/aflexnat/command_line_interface.ads

alvaromb/Compilemon

de5f88f084705868d38e301d95bb4a19a46a1156

[ "MIT" ]

null

-- Copyright (c) 1990 Regents of the University of California. -- All rights reserved. -- -- This software was developed by John Self of the Arcadia project -- at the University of California, Irvine. -- -- Redistribution and use in source and binary forms are permitted -- provided that the above copyright notice and this paragraph are -- duplicated in all such forms and that any documentation, -- advertising materials, and other materials related to such -- distribution and use acknowledge that the software was developed -- by the University of California, Irvine. The name of the -- University may not be used to endorse or promote products derived -- from this software without specific prior written permission. -- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR -- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED -- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. -- TITLE command line interface -- AUTHOR: John Self (UCI) -- DESCRIPTION command line interface body for use with the VERDIX VADS system. -- NOTES this file is system dependent -- $Header: /co/ua/self/arcadia/aflex/ada/src/RCS/command_lineS.a,v 1.3 90/01/12 15:19:46 self Exp Locker: self $ with tstring; use tstring; package command_line_interface is MAX_NUMBER_ARGS : INTEGER := 32; type COMMAND_VECTOR is array(0 .. MAX_NUMBER_ARGS) of VSTRING; procedure INITIALIZE_COMMAND_LINE; ARGV : COMMAND_VECTOR; ARGC : INTEGER; end command_line_interface;

45.393939

114

0.769693

18df779fac661a0af9c845793f5a7a9929bf8bf6

349,501

adb

Ada

project_xilinx/tmp.hw/memWrite/memWrite/memWrite/solution/.autopilot/db/memWrite.sched.adb

zjw49246/PipeCNN_aws

10a55031bcc9edfc949e966a123d3efcd685d45a

[ "Apache-2.0" ]

null

project_xilinx/tmp.hw/memWrite/memWrite/memWrite/solution/.autopilot/db/memWrite.sched.adb

zjw49246/PipeCNN_aws

10a55031bcc9edfc949e966a123d3efcd685d45a

[ "Apache-2.0" ]

null

project_xilinx/tmp.hw/memWrite/memWrite/memWrite/solution/.autopilot/db/memWrite.sched.adb

zjw49246/PipeCNN_aws

10a55031bcc9edfc949e966a123d3efcd685d45a

[ "Apache-2.0" ]

1

2022-01-09T19:45:49.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <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>memWrite</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>17</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>gmem0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>1</direction> <if_type>4</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_dim1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>out_dim2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim2</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>out_dim3</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim3</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>out_dim1xbatch</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1xbatch</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>out_dim1x2xbatch</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1x2xbatch</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>batch_indx_dim1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>batch_indx_dim1</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1667855973</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>batch_indx_dim2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>batch_indx_dim2</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</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>padd_offset</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>padd_offset</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>pool_on</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>pool_on</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>pool_size</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>pool_size</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>129</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_12"> <Value> <Obj> <type>1</type> <id>12</id> <name>pool_stride</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>pool_stride</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>145</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_13"> <Value> <Obj> <type>1</type> <id>13</id> <name>top</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>top</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>145</coreId> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_14"> <Value> <Obj> <type>1</type> <id>14</id> <name>conv_in_V_data_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>conv_in</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>161</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_15"> <Value> <Obj> <type>1</type> <id>15</id> <name>conv_in_V_keep_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>conv_in</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>2</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_16"> <Value> <Obj> <type>1</type> <id>16</id> <name>conv_in_V_strb_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>conv_in</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>193</coreId> </Obj> <bitwidth>2</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_17"> <Value> <Obj> <type>1</type> <id>17</id> <name>conv_in_V_last_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>conv_in</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1886221359</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <direction>0</direction> <if_type>0</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>147</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_18"> <Value> <Obj> <type>0</type> <id>18</id> <name>buffer_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>buffer[0]</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>224</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>19</id> <name>buffer_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>buffer[1]</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>225</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>65</id> <name>top_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>top</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>227</item> <item>228</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>66</id> <name>pool_on_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>pool_on</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>230</item> <item>231</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>67</id> <name>padd_offset_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>padd_offset</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>232</item> <item>233</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>68</id> <name>batch_indx_dim2_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>batch_indx_dim2</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>234</item> <item>235</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>69</id> <name>batch_indx_dim1_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>batch_indx_dim1</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>236</item> <item>237</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>70</id> <name>out_dim1x2xbatch_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1x2xbatch</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>689</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>239</item> <item>240</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>71</id> <name>out_dim1xbatch_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1xbatch</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>242</item> <item>243</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>72</id> <name>out_dim3_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim3</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>145</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>244</item> <item>245</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>73</id> <name>out_dim2_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim2</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1025</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>246</item> <item>247</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>74</id> <name>out_dim1_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_dim1</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>248</item> <item>249</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>75</id> <name>out_dim1_cast11</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>250</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>76</id> <name>out_dim1_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3290932</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>251</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>77</id> <name>out_dim2_cast10</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>449</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>252</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>78</id> <name>out_dim2_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>253</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>79</id> <name>out_dim3_cast14</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446838712</coreId> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>254</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>80</id> <name>out_dim3_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>808924209</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>255</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>81</id> <name>padd_offset_cast12</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>2097</coreId> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>256</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>82</id> <name>padd_offset_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>257</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>83</id> <name>mul4</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>259</item> <item>260</item> <item>262</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>84</id> <name>mul4_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>263</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>85</id> <name>add</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>264</item> <item>265</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>86</id> <name>add_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1521</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>266</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>87</id> <name>cmp26</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1869182051</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>267</item> <item>269</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.58</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>88</id> <name>batch_indx_dim2_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>808595283</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>270</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>89</id> <name>mul33</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>271</item> <item>272</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.55</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>90</id> <name>mul33_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446802176</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>273</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>32</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>91</id> <name>conv35</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>2190531680</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>274</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>33</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>92</id> <name>batch_indx_dim1_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>275</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>34</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>93</id> <name>mul42</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>276</item> <item>277</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.55</m_delay> <m_topoIndex>35</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>94</id> <name>mul42_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446814272</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>278</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>36</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>95</id> <name>div</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3825</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>280</item> <item>281</item> <item>282</item> <item>284</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>96</id> <name>div_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1210203513</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>285</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>37</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>97</id> <name>sub107</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>286</item> <item>288</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>38</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>98</id> <name>sub111</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>289</item> <item>291</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.70</m_delay> <m_topoIndex>39</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>99</id> <name>sub111_cast</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>292</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>40</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>100</id> <name>sub115</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>791817776</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>293</item> <item>294</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.70</m_delay> <m_topoIndex>41</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>101</id> <name>sext_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="11" tracking_level="0" version="0"> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</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>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1952917046</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>295</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>42</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>102</id> <name>mul_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>296</item> <item>297</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.55</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>103</id> <name>zext_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1948262961</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>298</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>104</id> <name>mul_ln96_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>775036986</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>299</item> <item>300</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.53</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>105</id> <name>trunc_ln149</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>875769394</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>301</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>43</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>106</id> <name>trunc_ln154</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1563505457</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>302</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>44</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>107</id> <name>br_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1952917046</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>303</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.38</m_delay> <m_topoIndex>45</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>109</id> <name>i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>997485606</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>305</item> <item>306</item> <item>307</item> <item>308</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>46</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>110</id> <name>lane_num_idx</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>lane_num_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1768713327</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>310</item> <item>311</item> <item>312</item> <item>313</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>47</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>111</id> <name>lane_item_idx</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>lane_item_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>840979276</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>315</item> <item>316</item> <item>317</item> <item>318</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>48</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>112</id> <name>out_idx_y</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_idx_y</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>824195705</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>319</item> <item>320</item> <item>321</item> <item>322</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>1</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>49</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>113</id> <name>out_idx_x</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>out_idx_x</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1747920928</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>323</item> <item>324</item> <item>325</item> <item>326</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>50</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>114</id> <name>i_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1970235514</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>327</item> <item>328</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.88</m_delay> <m_topoIndex>51</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>116</id> <name>icmp_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>807418469</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>329</item> <item>330</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.85</m_delay> <m_topoIndex>52</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>117</id> <name>br_ln96</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>96</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>96</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1852793632</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>331</item> <item>332</item> <item>333</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>53</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>120</id> <name>zext_ln103</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>103</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>103</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1411398176</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>334</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>121</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>121</id> <name>zext_ln103_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>103</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>103</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>539454581</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>335</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>54</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>122</id> <name>icmp_ln103</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>103</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>103</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>336</item> <item>337</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.58</m_delay> <m_topoIndex>55</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>123</id> <name>br_ln103</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>103</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>103</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>338</item> <item>339</item> <item>340</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>56</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>125</id> <name>empty</name> <fileName>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_axi_sdata.h</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>293</lineNumber> <contextFuncName>read</contextFuncName> <contextNormFuncName>read</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_axi_sdata.h</first> <second>read</second> </first> <second>293</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446831289</coreId> </Obj> <bitwidth>21</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>342</item> <item>343</item> <item>344</item> <item>345</item> <item>346</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>57</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>126</id> <name>conv_in_tmp_data_V</name> <fileName>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_axi_sdata.h</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>293</lineNumber> <contextFuncName>read</contextFuncName> <contextNormFuncName>read</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_axi_sdata.h</first> <second>read</second> </first> <second>293</second> </item> </second> </item> </inlineStackInfo> <originalName>conv_in_tmp.data.V</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>347</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>58</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>127</id> <name>output_lane</name> <fileName>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_int_ref.h</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>708</lineNumber> <contextFuncName>to_uint64</contextFuncName> <contextNormFuncName>to_uint64</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_int_ref.h</first> <second>to_uint64</second> </first> <second>708</second> </item> </second> </item> </inlineStackInfo> <originalName>output.lane</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>348</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>59</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>128</id> <name>output_lane_2</name> <fileName>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_int_ref.h</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>708</lineNumber> <contextFuncName>to_uint64</contextFuncName> <contextNormFuncName>to_uint64</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/mnt/storage/gefeizuo/Xilinx/Vitis_HLS/2020.2/common/technology/autopilot/ap_int_ref.h</first> <second>to_uint64</second> </first> <second>708</second> </item> </second> </item> </inlineStackInfo> <originalName>output.lane</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446834968</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>350</item> <item>351</item> <item>353</item> <item>355</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>60</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>129</id> <name>buffer_1_write_ln144</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>144</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>144</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>573125938</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>356</item> <item>357</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>61</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>130</id> <name>buffer_0_write_ln144</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>144</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>144</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>543450472</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>358</item> <item>359</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>62</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>131</id> <name>br_ln144</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>144</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>144</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1818304628</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>360</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>63</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>133</id> <name>zext_ln149</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>361</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>64</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>134</id> <name>zext_ln149_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>362</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>65</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>135</id> <name>add_ln149</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>363</item> <item>364</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.33</m_delay> <m_topoIndex>66</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>136</id> <name>zext_ln149_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>365</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>67</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>137</id> <name>mul_ln149</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446777808</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>366</item> <item>367</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>1</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.99</m_delay> <m_topoIndex>68</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>138</id> <name>trunc_ln149_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>368</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>118</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>139</id> <name>trunc_ln149_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>13185</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>369</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>119</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>140</id> <name>zext_ln149_3</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446781072</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>370</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>69</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>141</id> <name>add_ln149_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446782264</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>371</item> <item>372</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>70</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>142</id> <name>zext_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446783504</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>373</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>122</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>143</id> <name>shl_ln</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>8273</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>375</item> <item>376</item> <item>377</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>71</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>144</id> <name>zext_ln159_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446785984</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>378</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>72</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>145</id> <name>add_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>4294967295</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>379</item> <item>380</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.79</m_delay> <m_topoIndex>73</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>146</id> <name>zext_ln159_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>381</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>74</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>147</id> <name>sub_ln152_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>19</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>382</item> <item>383</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.79</m_delay> <m_topoIndex>75</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>148</id> <name>trunc_ln148</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>148</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>148</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>4294967295</coreId> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>384</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>76</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>149</id> <name>br_ln148</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>148</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>148</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>385</item> <item>386</item> <item>387</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>77</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>151</id> <name>trunc_ln152</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>403</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>103</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>152</id> <name>tmp_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446843040</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>405</item> <item>406</item> <item>408</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>104</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>153</id> <name>sub_ln152</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>410</item> <item>411</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.79</m_delay> <m_topoIndex>105</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>154</id> <name>trunc_ln152_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>413</item> <item>414</item> <item>416</item> <item>418</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>106</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>155</id> <name>sub_ln152_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446846016</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>419</item> <item>420</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>107</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>156</id> <name>trunc_ln152_3</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>422</item> <item>423</item> <item>424</item> <item>425</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>108</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>157</id> <name>index_z_group</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>152</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>152</second> </item> </second> </item> </inlineStackInfo> <originalName>index_z_group</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>426</item> <item>427</item> <item>428</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.24</m_delay> <m_topoIndex>109</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>158</id> <name>sub_ln153</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446849896</coreId> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>430</item> <item>431</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.43</m_delay> <m_topoIndex>120</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>159</id> <name>p_and_t_cast</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>433</item> <item>435</item> <item>436</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>123</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>160</id> <name>sub_ln153_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>437</item> <item>438</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.70</m_delay> <m_topoIndex>124</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>161</id> <name>zext_ln154</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>439</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>114</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>162</id> <name>mul_ln154</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>440</item> <item>441</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.29</m_delay> <m_topoIndex>115</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>163</id> <name>tmp_4</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>4294967295</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>442</item> <item>443</item> <item>444</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>125</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>164</id> <name>select_ln153</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>153</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>153</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>445</item> <item>446</item> <item>447</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>126</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>165</id> <name>zext_ln154_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>448</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>127</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_114"> <Value> <Obj> <type>0</type> <id>166</id> <name>tmp6</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>449</item> <item>450</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>128</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_115"> <Value> <Obj> <type>0</type> <id>167</id> <name>tmp43</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446861088</coreId> </Obj> <bitwidth>30</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>451</item> <item>452</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.72</m_delay> <m_topoIndex>129</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_116"> <Value> <Obj> <type>0</type> <id>168</id> <name>tmp5</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>454</item> <item>455</item> <item>456</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>130</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_117"> <Value> <Obj> <type>0</type> <id>169</id> <name>top_addr_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>154</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>154</second> </item> </second> </item> </inlineStackInfo> <originalName>top_addr</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446862936</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>457</item> <item>458</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.88</m_delay> <m_topoIndex>131</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_118"> <Value> <Obj> <type>0</type> <id>170</id> <name>br_ln0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446862936</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>459</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.38</m_delay> <m_topoIndex>132</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_119"> <Value> <Obj> <type>0</type> <id>172</id> <name>zext_ln149_4</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>388</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>116</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_120"> <Value> <Obj> <type>0</type> <id>173</id> <name>mul_ln149_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>389</item> <item>390</item> </oprand_edges> <opcode>mul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.29</m_delay> <m_topoIndex>117</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_121"> <Value> <Obj> <type>0</type> <id>174</id> <name>tmp</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>391</item> <item>392</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>133</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_122"> <Value> <Obj> <type>0</type> <id>175</id> <name>add_ln149_1_cast18</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446868800</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>393</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>134</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_123"> <Value> <Obj> <type>0</type> <id>176</id> <name>tmp11</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>31</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>394</item> <item>395</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.72</m_delay> <m_topoIndex>135</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_124"> <Value> <Obj> <type>0</type> <id>177</id> <name>tmp2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446871232</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>397</item> <item>398</item> <item>399</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>136</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_125"> <Value> <Obj> <type>0</type> <id>178</id> <name>top_addr</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>149</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>149</second> </item> </second> </item> </inlineStackInfo> <originalName>top_addr</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446873624</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>400</item> <item>401</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.88</m_delay> <m_topoIndex>137</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_126"> <Value> <Obj> <type>0</type> <id>179</id> <name>br_ln150</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>150</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>150</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446873320</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>402</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.38</m_delay> <m_topoIndex>138</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_127"> <Value> <Obj> <type>0</type> <id>181</id> <name>top_addr_2</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>top_addr</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1946157184</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>460</item> <item>461</item> <item>462</item> <item>463</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>139</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_128"> <Value> <Obj> <type>0</type> <id>182</id> <name>icmp_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>464</item> <item>465</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.71</m_delay> <m_topoIndex>78</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_129"> <Value> <Obj> <type>0</type> <id>183</id> <name>icmp_ln159_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446880784</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>466</item> <item>467</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.69</m_delay> <m_topoIndex>79</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_130"> <Value> <Obj> <type>0</type> <id>184</id> <name>xor_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>34</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>468</item> <item>470</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>80</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_131"> <Value> <Obj> <type>0</type> <id>185</id> <name>and_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446883008</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>471</item> <item>472</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.12</m_delay> <m_topoIndex>81</m_topoIndex> <m_clusterGroupNumber>2</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_132"> <Value> <Obj> <type>0</type> <id>186</id> <name>br_ln159</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>473</item> <item>474</item> <item>475</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>82</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_133"> <Value> <Obj> <type>0</type> <id>188</id> <name>buffer_0_load</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>476</item> <item>1145</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>110</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_134"> <Value> <Obj> <type>0</type> <id>189</id> <name>buffer_1_load</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446885360</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>477</item> <item>1144</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>111</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_135"> <Value> <Obj> <type>0</type> <id>190</id> <name>trunc_ln167</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>478</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>112</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_136"> <Value> <Obj> <type>0</type> <id>191</id> <name>select_ln167</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>479</item> <item>480</item> <item>481</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.30</m_delay> <m_topoIndex>113</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_137"> <Value> <Obj> <type>0</type> <id>192</id> <name>zext_ln167</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>482</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>140</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_138"> <Value> <Obj> <type>0</type> <id>193</id> <name>add_ln167</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>483</item> <item>484</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.14</m_delay> <m_topoIndex>141</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_139"> <Value> <Obj> <type>0</type> <id>194</id> <name>gmem0_addr</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>485</item> <item>486</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>142</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_140"> <Value> <Obj> <type>0</type> <id>195</id> <name>gmem0_addr_req</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446894240</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>488</item> <item>489</item> <item>490</item> </oprand_edges> <opcode>writereq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.43</m_delay> <m_topoIndex>143</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_141"> <Value> <Obj> <type>0</type> <id>196</id> <name>gmem0_addr_write_ln167</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>492</item> <item>493</item> <item>494</item> <item>495</item> <item>1143</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.43</m_delay> <m_topoIndex>144</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_142"> <Value> <Obj> <type>0</type> <id>197</id> <name>gmem0_addr_resp</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>167</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>167</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>497</item> <item>498</item> <item>1142</item> </oprand_edges> <opcode>writeresp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.43</m_delay> <m_topoIndex>145</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_143"> <Value> <Obj> <type>0</type> <id>198</id> <name>br_ln176</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>176</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>176</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>499</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>146</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_144"> <Value> <Obj> <type>0</type> <id>200</id> <name>icmp_ln186</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>500</item> <item>501</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.68</m_delay> <m_topoIndex>83</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_145"> <Value> <Obj> <type>0</type> <id>201</id> <name>icmp_ln186_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>502</item> <item>503</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.67</m_delay> <m_topoIndex>84</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_146"> <Value> <Obj> <type>0</type> <id>202</id> <name>icmp_ln186_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>504</item> <item>505</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.67</m_delay> <m_topoIndex>85</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_147"> <Value> <Obj> <type>0</type> <id>203</id> <name>icmp_ln186_3</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>506</item> <item>507</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.58</m_delay> <m_topoIndex>86</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_148"> <Value> <Obj> <type>0</type> <id>204</id> <name>and_ln186</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>508</item> <item>509</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>87</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_149"> <Value> <Obj> <type>0</type> <id>205</id> <name>and_ln186_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>510</item> <item>511</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.12</m_delay> <m_topoIndex>88</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_150"> <Value> <Obj> <type>0</type> <id>206</id> <name>and_ln186_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>512</item> <item>513</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>89</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_151"> <Value> <Obj> <type>0</type> <id>207</id> <name>and_ln191</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>191</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>191</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>514</item> <item>515</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.12</m_delay> <m_topoIndex>90</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_152"> <Value> <Obj> <type>0</type> <id>208</id> <name>lane_num_idx_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>189</second> </item> </second> </item> </inlineStackInfo> <originalName>lane_num_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>516</item> <item>518</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>91</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_153"> <Value> <Obj> <type>0</type> <id>209</id> <name>select_ln188</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>188</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>188</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>519</item> <item>520</item> <item>521</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>92</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_154"> <Value> <Obj> <type>0</type> <id>210</id> <name>lane_num_idx_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>186</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>186</second> </item> </second> </item> </inlineStackInfo> <originalName>lane_num_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>522</item> <item>523</item> <item>524</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.24</m_delay> <m_topoIndex>93</m_topoIndex> <m_clusterGroupNumber>3</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_155"> <Value> <Obj> <type>0</type> <id>211</id> <name>out_idx_y_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>194</second> </item> </second> </item> </inlineStackInfo> <originalName>out_idx_y</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>525</item> <item>526</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>94</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_156"> <Value> <Obj> <type>0</type> <id>212</id> <name>select_ln193</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>193</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>193</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>527</item> <item>528</item> <item>529</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>95</m_topoIndex> <m_clusterGroupNumber>4</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_157"> <Value> <Obj> <type>0</type> <id>213</id> <name>out_idx_y_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>191</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>191</second> </item> </second> </item> </inlineStackInfo> <originalName>out_idx_y</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>530</item> <item>531</item> <item>532</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.24</m_delay> <m_topoIndex>96</m_topoIndex> <m_clusterGroupNumber>4</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_158"> <Value> <Obj> <type>0</type> <id>214</id> <name>add_ln199</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>199</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>199</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>533</item> <item>534</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.78</m_delay> <m_topoIndex>97</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_159"> <Value> <Obj> <type>0</type> <id>215</id> <name>out_idx_x_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>198</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>198</second> </item> </second> </item> </inlineStackInfo> <originalName>out_idx_x</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>535</item> <item>536</item> <item>537</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>98</m_topoIndex> <m_clusterGroupNumber>5</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_160"> <Value> <Obj> <type>0</type> <id>216</id> <name>out_idx_x_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>196</second> </item> </second> </item> </inlineStackInfo> <originalName>out_idx_x</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>538</item> <item>539</item> <item>540</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.24</m_delay> <m_topoIndex>99</m_topoIndex> <m_clusterGroupNumber>5</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_161"> <Value> <Obj> <type>0</type> <id>217</id> <name>lane_item_idx_1</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>204</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>204</second> </item> </second> </item> </inlineStackInfo> <originalName>lane_item_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>541</item> <item>542</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.70</m_delay> <m_topoIndex>100</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_162"> <Value> <Obj> <type>0</type> <id>218</id> <name>lane_item_idx_2</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>201</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>201</second> </item> </second> </item> </inlineStackInfo> <originalName>lane_item_idx</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>543</item> <item>544</item> <item>545</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.30</m_delay> <m_topoIndex>101</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_163"> <Value> <Obj> <type>0</type> <id>219</id> <name>br_ln0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>546</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>102</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_164"> <Value> <Obj> <type>0</type> <id>221</id> <name>_ln210</name> <fileName>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</fileName> <fileDirectory>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</fileDirectory> <lineNumber>210</lineNumber> <contextFuncName>memWrite</contextFuncName> <contextNormFuncName>memWrite</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/tmp.hw/memWrite/memWrite</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/zhoujw/FPGA/PipeCNN/project_xilinx/device/memWrite.cpp</first> <second>memWrite</second> </first> <second>210</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </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> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>147</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>19</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_165"> <Value> <Obj> <type>2</type> <id>223</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_166"> <Value> <Obj> <type>2</type> <id>261</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_167"> <Value> <Obj> <type>2</type> <id>268</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_168"> <Value> <Obj> <type>2</type> <id>283</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>16</content> </item> <item class_id_reference="16" object_id="_169"> <Value> <Obj> <type>2</type> <id>287</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>17</bitwidth> </Value> <const_type>0</const_type> <content>131071</content> </item> <item class_id_reference="16" object_id="_170"> <Value> <Obj> <type>2</type> <id>290</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>9</bitwidth> </Value> <const_type>0</const_type> <content>511</content> </item> <item class_id_reference="16" object_id="_171"> <Value> <Obj> <type>2</type> <id>304</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_172"> <Value> <Obj> <type>2</type> <id>309</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_173"> <Value> <Obj> <type>2</type> <id>314</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_174"> <Value> <Obj> <type>2</type> <id>352</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_175"> <Value> <Obj> <type>2</type> <id>354</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>15</content> </item> <item class_id_reference="16" object_id="_176"> <Value> <Obj> <type>2</type> <id>407</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>18</content> </item> <item class_id_reference="16" object_id="_177"> <Value> <Obj> <type>2</type> <id>409</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446270040</coreId> </Obj> <bitwidth>18</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_178"> <Value> <Obj> <type>2</type> <id>415</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446813296</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_179"> <Value> <Obj> <type>2</type> <id>417</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>17</content> </item> <item class_id_reference="16" object_id="_180"> <Value> <Obj> <type>2</type> <id>429</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>2</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_181"> <Value> <Obj> <type>2</type> <id>434</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>6</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_182"> <Value> <Obj> <type>2</type> <id>469</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_183"> <Value> <Obj> <type>2</type> <id>517</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>16</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_184"> <Obj> <type>3</type> <id>108</id> <name>.lr.ph</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>321</coreId> </Obj> <node_objs> <count>45</count> <item_version>0</item_version> <item>18</item> <item>19</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> </node_objs> </item> <item class_id_reference="18" object_id="_185"> <Obj> <type>3</type> <id>118</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1919950882</coreId> </Obj> <node_objs> <count>8</count> <item_version>0</item_version> <item>109</item> <item>110</item> <item>111</item> <item>112</item> <item>113</item> <item>114</item> <item>116</item> <item>117</item> </node_objs> </item> <item class_id_reference="18" object_id="_186"> <Obj> <type>3</type> <id>124</id> <name>.split</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>2037672306</coreId> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>120</item> <item>121</item> <item>122</item> <item>123</item> </node_objs> </item> <item class_id_reference="18" object_id="_187"> <Obj> <type>3</type> <id>132</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <node_objs> <count>7</count> <item_version>0</item_version> <item>125</item> <item>126</item> <item>127</item> <item>128</item> <item>129</item> <item>130</item> <item>131</item> </node_objs> </item> <item class_id_reference="18" object_id="_188"> <Obj> <type>3</type> <id>150</id> <name>.split._crit_edge</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446772568</coreId> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>135</item> <item>136</item> <item>137</item> <item>138</item> <item>139</item> <item>140</item> <item>141</item> <item>142</item> <item>143</item> <item>144</item> <item>145</item> <item>146</item> <item>147</item> <item>148</item> <item>149</item> </node_objs> </item> <item class_id_reference="18" object_id="_189"> <Obj> <type>3</type> <id>171</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>446836024</coreId> </Obj> <node_objs> <count>20</count> <item_version>0</item_version> <item>151</item> <item>152</item> <item>153</item> <item>154</item> <item>155</item> <item>156</item> <item>157</item> <item>158</item> <item>159</item> <item>160</item> <item>161</item> <item>162</item> <item>163</item> <item>164</item> <item>165</item> <item>166</item> <item>167</item> <item>168</item> <item>169</item> <item>170</item> </node_objs> </item> <item class_id_reference="18" object_id="_190"> <Obj> <type>3</type> <id>180</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>9</coreId> </Obj> <node_objs> <count>8</count> <item_version>0</item_version> <item>172</item> <item>173</item> <item>174</item> <item>175</item> <item>176</item> <item>177</item> <item>178</item> <item>179</item> </node_objs> </item> <item class_id_reference="18" object_id="_191"> <Obj> <type>3</type> <id>187</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>181</item> <item>182</item> <item>183</item> <item>184</item> <item>185</item> <item>186</item> </node_objs> </item> <item class_id_reference="18" object_id="_192"> <Obj> <type>3</type> <id>199</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <node_objs> <count>11</count> <item_version>0</item_version> <item>188</item> <item>189</item> <item>190</item> <item>191</item> <item>192</item> <item>193</item> <item>194</item> <item>195</item> <item>196</item> <item>197</item> <item>198</item> </node_objs> </item> <item class_id_reference="18" object_id="_193"> <Obj> <type>3</type> <id>220</id> <name>._crit_edge</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <node_objs> <count>20</count> <item_version>0</item_version> <item>200</item> <item>201</item> <item>202</item> <item>203</item> <item>204</item> <item>205</item> <item>206</item> <item>207</item> <item>208</item> <item>209</item> <item>210</item> <item>211</item> <item>212</item> <item>213</item> <item>214</item> <item>215</item> <item>216</item> <item>217</item> <item>218</item> <item>219</item> </node_objs> </item> <item class_id_reference="18" object_id="_194"> <Obj> <type>3</type> <id>222</id> <name>._crit_edge.loopexit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>221</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>280</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_195"> <id>224</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>225</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>228</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>231</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>233</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>235</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>237</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>240</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>243</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>245</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>247</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>249</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>250</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>251</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>252</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>253</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>254</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>255</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>256</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>257</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>260</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>262</id> <edge_type>1</edge_type> <source_obj>261</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>263</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>264</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_219"> <id>265</id> <edge_type>1</edge_type> <source_obj>80</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_220"> <id>266</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_221"> <id>267</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_222"> <id>269</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_223"> <id>270</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_224"> <id>271</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_225"> <id>272</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>89</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_226"> <id>273</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_227"> <id>274</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>91</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_228"> <id>275</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_229"> <id>276</id> <edge_type>1</edge_type> <source_obj>92</source_obj> <sink_obj>93</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_230"> <id>277</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>93</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_231"> <id>278</id> <edge_type>1</edge_type> <source_obj>93</source_obj> <sink_obj>94</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_232"> <id>281</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>95</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_233"> <id>282</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>95</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_234"> <id>284</id> <edge_type>1</edge_type> <source_obj>283</source_obj> <sink_obj>95</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_235"> <id>285</id> <edge_type>1</edge_type> <source_obj>95</source_obj> <sink_obj>96</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_236"> <id>286</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>97</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_237"> <id>288</id> <edge_type>1</edge_type> <source_obj>287</source_obj> <sink_obj>97</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_238"> <id>289</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>98</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_239"> <id>291</id> <edge_type>1</edge_type> <source_obj>290</source_obj> <sink_obj>98</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_240"> <id>292</id> <edge_type>1</edge_type> <source_obj>98</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_241"> <id>293</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>100</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_242"> <id>294</id> <edge_type>1</edge_type> <source_obj>290</source_obj> <sink_obj>100</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_243"> <id>295</id> <edge_type>1</edge_type> <source_obj>100</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_244"> <id>296</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_245"> <id>297</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_246"> <id>298</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_247"> <id>299</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_248"> <id>300</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_249"> <id>301</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>105</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_250"> <id>302</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>106</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_251"> <id>303</id> <edge_type>2</edge_type> <source_obj>118</source_obj> <sink_obj>107</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_252"> <id>305</id> <edge_type>1</edge_type> <source_obj>304</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_253"> <id>306</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_254"> <id>307</id> <edge_type>1</edge_type> <source_obj>114</source_obj> <sink_obj>109</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_255"> <id>308</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>109</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_256"> <id>310</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>110</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_257"> <id>311</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>110</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_258"> <id>312</id> <edge_type>1</edge_type> <source_obj>210</source_obj> <sink_obj>110</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_259"> <id>313</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>110</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_260"> <id>315</id> <edge_type>1</edge_type> <source_obj>314</source_obj> <sink_obj>111</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_261"> <id>316</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>111</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_262"> <id>317</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>111</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_263"> <id>318</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>111</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_264"> <id>319</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_265"> <id>320</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_266"> <id>321</id> <edge_type>1</edge_type> <source_obj>213</source_obj> <sink_obj>112</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_267"> <id>322</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>112</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_268"> <id>323</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>113</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_269"> <id>324</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>113</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_270"> <id>325</id> <edge_type>1</edge_type> <source_obj>216</source_obj> <sink_obj>113</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_271"> <id>326</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>113</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_272"> <id>327</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_273"> <id>328</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_274"> <id>329</id> <edge_type>1</edge_type> <source_obj>109</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_275"> <id>330</id> <edge_type>1</edge_type> <source_obj>104</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_276"> <id>331</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_277"> <id>332</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_278"> <id>333</id> <edge_type>2</edge_type> <source_obj>222</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_279"> <id>334</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_280"> <id>335</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_281"> <id>336</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_282"> <id>337</id> <edge_type>1</edge_type> <source_obj>314</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_283"> <id>338</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_284"> <id>339</id> <edge_type>2</edge_type> <source_obj>150</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_285"> <id>340</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_286"> <id>343</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_287"> <id>344</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_288"> <id>345</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_289"> <id>346</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_290"> <id>347</id> <edge_type>1</edge_type> <source_obj>125</source_obj> <sink_obj>126</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_291"> <id>348</id> <edge_type>1</edge_type> <source_obj>126</source_obj> <sink_obj>127</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_292"> <id>351</id> <edge_type>1</edge_type> <source_obj>126</source_obj> <sink_obj>128</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_293"> <id>353</id> <edge_type>1</edge_type> <source_obj>352</source_obj> <sink_obj>128</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_294"> <id>355</id> <edge_type>1</edge_type> <source_obj>354</source_obj> <sink_obj>128</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_295"> <id>356</id> <edge_type>1</edge_type> <source_obj>128</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_296"> <id>357</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_297"> <id>358</id> <edge_type>1</edge_type> <source_obj>127</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_298"> <id>359</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_299"> <id>360</id> <edge_type>2</edge_type> <source_obj>150</source_obj> <sink_obj>131</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_300"> <id>361</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_301"> <id>362</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_302"> <id>363</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_303"> <id>364</id> <edge_type>1</edge_type> <source_obj>134</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_304"> <id>365</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_305"> <id>366</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_306"> <id>367</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_307"> <id>368</id> <edge_type>1</edge_type> <source_obj>137</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_308"> <id>369</id> <edge_type>1</edge_type> <source_obj>137</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_309"> <id>370</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_310"> <id>371</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_311"> <id>372</id> <edge_type>1</edge_type> <source_obj>140</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_312"> <id>373</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_313"> <id>376</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_314"> <id>377</id> <edge_type>1</edge_type> <source_obj>261</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_315"> <id>378</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>144</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_316"> <id>379</id> <edge_type>1</edge_type> <source_obj>144</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_317"> <id>380</id> <edge_type>1</edge_type> <source_obj>121</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_318"> <id>381</id> <edge_type>1</edge_type> <source_obj>145</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_319"> <id>382</id> <edge_type>1</edge_type> <source_obj>146</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_320"> <id>383</id> <edge_type>1</edge_type> <source_obj>81</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_321"> <id>384</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_322"> <id>385</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_323"> <id>386</id> <edge_type>2</edge_type> <source_obj>171</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_324"> <id>387</id> <edge_type>2</edge_type> <source_obj>180</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_325"> <id>388</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>172</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_326"> <id>389</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_327"> <id>390</id> <edge_type>1</edge_type> <source_obj>105</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_328"> <id>391</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_329"> <id>392</id> <edge_type>1</edge_type> <source_obj>173</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_330"> <id>393</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>175</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_331"> <id>394</id> <edge_type>1</edge_type> <source_obj>174</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_332"> <id>395</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_333"> <id>398</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>177</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_334"> <id>399</id> <edge_type>1</edge_type> <source_obj>261</source_obj> <sink_obj>177</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_335"> <id>400</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_336"> <id>401</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_337"> <id>402</id> <edge_type>2</edge_type> <source_obj>187</source_obj> <sink_obj>179</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_338"> <id>403</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>151</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_339"> <id>406</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>152</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_340"> <id>408</id> <edge_type>1</edge_type> <source_obj>407</source_obj> <sink_obj>152</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_341"> <id>410</id> <edge_type>1</edge_type> <source_obj>409</source_obj> <sink_obj>153</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_342"> <id>411</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>153</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_343"> <id>414</id> <edge_type>1</edge_type> <source_obj>153</source_obj> <sink_obj>154</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_344"> <id>416</id> <edge_type>1</edge_type> <source_obj>415</source_obj> <sink_obj>154</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_345"> <id>418</id> <edge_type>1</edge_type> <source_obj>417</source_obj> <sink_obj>154</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_346"> <id>419</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_347"> <id>420</id> <edge_type>1</edge_type> <source_obj>154</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_348"> <id>423</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_349"> <id>424</id> <edge_type>1</edge_type> <source_obj>415</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_350"> <id>425</id> <edge_type>1</edge_type> <source_obj>417</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_351"> <id>426</id> <edge_type>1</edge_type> <source_obj>152</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_352"> <id>427</id> <edge_type>1</edge_type> <source_obj>155</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_353"> <id>428</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_354"> <id>430</id> <edge_type>1</edge_type> <source_obj>429</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_355"> <id>431</id> <edge_type>1</edge_type> <source_obj>148</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_356"> <id>435</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_357"> <id>436</id> <edge_type>1</edge_type> <source_obj>158</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_358"> <id>437</id> <edge_type>1</edge_type> <source_obj>314</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_359"> <id>438</id> <edge_type>1</edge_type> <source_obj>159</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_360"> <id>439</id> <edge_type>1</edge_type> <source_obj>157</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_361"> <id>440</id> <edge_type>1</edge_type> <source_obj>161</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_362"> <id>441</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_363"> <id>443</id> <edge_type>1</edge_type> <source_obj>434</source_obj> <sink_obj>163</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_364"> <id>444</id> <edge_type>1</edge_type> <source_obj>148</source_obj> <sink_obj>163</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_365"> <id>445</id> <edge_type>1</edge_type> <source_obj>152</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_366"> <id>446</id> <edge_type>1</edge_type> <source_obj>160</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_367"> <id>447</id> <edge_type>1</edge_type> <source_obj>163</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_368"> <id>448</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_369"> <id>449</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_370"> <id>450</id> <edge_type>1</edge_type> <source_obj>162</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_371"> <id>451</id> <edge_type>1</edge_type> <source_obj>166</source_obj> <sink_obj>167</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_372"> <id>452</id> <edge_type>1</edge_type> <source_obj>138</source_obj> <sink_obj>167</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_373"> <id>455</id> <edge_type>1</edge_type> <source_obj>167</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_374"> <id>456</id> <edge_type>1</edge_type> <source_obj>429</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_375"> <id>457</id> <edge_type>1</edge_type> <source_obj>168</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_376"> <id>458</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_377"> <id>459</id> <edge_type>2</edge_type> <source_obj>187</source_obj> <sink_obj>170</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_378"> <id>460</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_379"> <id>461</id> <edge_type>2</edge_type> <source_obj>180</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_380"> <id>462</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_381"> <id>463</id> <edge_type>2</edge_type> <source_obj>171</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_382"> <id>464</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_383"> <id>465</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_384"> <id>466</id> <edge_type>1</edge_type> <source_obj>145</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_385"> <id>467</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_386"> <id>468</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>184</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_387"> <id>470</id> <edge_type>1</edge_type> <source_obj>469</source_obj> <sink_obj>184</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_388"> <id>471</id> <edge_type>1</edge_type> <source_obj>182</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_389"> <id>472</id> <edge_type>1</edge_type> <source_obj>184</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_390"> <id>473</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_391"> <id>474</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_392"> <id>475</id> <edge_type>2</edge_type> <source_obj>199</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_393"> <id>476</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>188</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_394"> <id>477</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_395"> <id>478</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_396"> <id>479</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_397"> <id>480</id> <edge_type>1</edge_type> <source_obj>189</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_398"> <id>481</id> <edge_type>1</edge_type> <source_obj>188</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_399"> <id>482</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_400"> <id>483</id> <edge_type>1</edge_type> <source_obj>192</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_401"> <id>484</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_402"> <id>485</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_403"> <id>486</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_404"> <id>489</id> <edge_type>1</edge_type> <source_obj>194</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_405"> <id>490</id> <edge_type>1</edge_type> <source_obj>223</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_406"> <id>493</id> <edge_type>1</edge_type> <source_obj>194</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_407"> <id>494</id> <edge_type>1</edge_type> <source_obj>191</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_408"> <id>495</id> <edge_type>1</edge_type> <source_obj>469</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_409"> <id>498</id> <edge_type>1</edge_type> <source_obj>194</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_410"> <id>499</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_411"> <id>500</id> <edge_type>1</edge_type> <source_obj>133</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_412"> <id>501</id> <edge_type>1</edge_type> <source_obj>97</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_413"> <id>502</id> <edge_type>1</edge_type> <source_obj>134</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_414"> <id>503</id> <edge_type>1</edge_type> <source_obj>99</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_415"> <id>504</id> <edge_type>1</edge_type> <source_obj>140</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_416"> <id>505</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_417"> <id>506</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_418"> <id>507</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_419"> <id>508</id> <edge_type>1</edge_type> <source_obj>200</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_420"> <id>509</id> <edge_type>1</edge_type> <source_obj>201</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_421"> <id>510</id> <edge_type>1</edge_type> <source_obj>202</source_obj> <sink_obj>205</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_422"> <id>511</id> <edge_type>1</edge_type> <source_obj>203</source_obj> <sink_obj>205</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_423"> <id>512</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_424"> <id>513</id> <edge_type>1</edge_type> <source_obj>204</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_425"> <id>514</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_426"> <id>515</id> <edge_type>1</edge_type> <source_obj>201</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_427"> <id>516</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_428"> <id>518</id> <edge_type>1</edge_type> <source_obj>517</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_429"> <id>519</id> <edge_type>1</edge_type> <source_obj>207</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_430"> <id>520</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_431"> <id>521</id> <edge_type>1</edge_type> <source_obj>110</source_obj> <sink_obj>209</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_432"> <id>522</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_433"> <id>523</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_434"> <id>524</id> <edge_type>1</edge_type> <source_obj>209</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_435"> <id>525</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_436"> <id>526</id> <edge_type>1</edge_type> <source_obj>517</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_437"> <id>527</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_438"> <id>528</id> <edge_type>1</edge_type> <source_obj>211</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_439"> <id>529</id> <edge_type>1</edge_type> <source_obj>112</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_440"> <id>530</id> <edge_type>1</edge_type> <source_obj>207</source_obj> <sink_obj>213</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_441"> <id>531</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>213</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_442"> <id>532</id> <edge_type>1</edge_type> <source_obj>212</source_obj> <sink_obj>213</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_443"> <id>533</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_444"> <id>534</id> <edge_type>1</edge_type> <source_obj>517</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_445"> <id>535</id> <edge_type>1</edge_type> <source_obj>203</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_446"> <id>536</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_447"> <id>537</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_448"> <id>538</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_449"> <id>539</id> <edge_type>1</edge_type> <source_obj>309</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_450"> <id>540</id> <edge_type>1</edge_type> <source_obj>215</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_451"> <id>541</id> <edge_type>1</edge_type> <source_obj>111</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_452"> <id>542</id> <edge_type>1</edge_type> <source_obj>268</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_453"> <id>543</id> <edge_type>1</edge_type> <source_obj>203</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_454"> <id>544</id> <edge_type>1</edge_type> <source_obj>314</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_455"> <id>545</id> <edge_type>1</edge_type> <source_obj>217</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_456"> <id>546</id> <edge_type>2</edge_type> <source_obj>118</source_obj> <sink_obj>219</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_457"> <id>1128</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_458"> <id>1129</id> <edge_type>2</edge_type> <source_obj>118</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_459"> <id>1130</id> <edge_type>2</edge_type> <source_obj>118</source_obj> <sink_obj>124</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_460"> <id>1131</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>132</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_461"> <id>1132</id> <edge_type>2</edge_type> <source_obj>124</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_462"> <id>1133</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_463"> <id>1134</id> <edge_type>2</edge_type> <source_obj>150</source_obj> <sink_obj>180</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_464"> <id>1135</id> <edge_type>2</edge_type> <source_obj>150</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_465"> <id>1136</id> <edge_type>2</edge_type> <source_obj>171</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_466"> <id>1137</id> <edge_type>2</edge_type> <source_obj>180</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_467"> <id>1138</id> <edge_type>2</edge_type> <source_obj>187</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_468"> <id>1139</id> <edge_type>2</edge_type> <source_obj>187</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_469"> <id>1140</id> <edge_type>2</edge_type> <source_obj>199</source_obj> <sink_obj>220</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_470"> <id>1141</id> <edge_type>2</edge_type> <source_obj>220</source_obj> <sink_obj>118</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_471"> <id>1142</id> <edge_type>4</edge_type> <source_obj>196</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_472"> <id>1143</id> <edge_type>4</edge_type> <source_obj>195</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_473"> <id>1144</id> <edge_type>4</edge_type> <source_obj>129</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_474"> <id>1145</id> <edge_type>4</edge_type> <source_obj>130</source_obj> <sink_obj>188</sink_obj> <is_back_edge>0</is_back_edge> </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="_475"> <mId>1</mId> <mTag>memWrite</mTag> <mNormTag>memWrite</mNormTag> <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>-1</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_476"> <mId>2</mId> <mTag>Entry</mTag> <mNormTag>Entry</mNormTag> <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>108</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>4</mMinLatency> <mMaxLatency>4</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_477"> <mId>3</mId> <mTag>VITIS_LOOP_96_1</mTag> <mNormTag>VITIS_LOOP_96_1</mNormTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>9</count> <item_version>0</item_version> <item>118</item> <item>124</item> <item>132</item> <item>150</item> <item>171</item> <item>180</item> <item>187</item> <item>199</item> <item>220</item> </basic_blocks> <mII>1</mII> <mDepth>76</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>-1</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_478"> <mId>4</mId> <mTag>Return</mTag> <mNormTag>Return</mNormTag> <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>222</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>147</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>18</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</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>4</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>0</first> <second>0</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>4</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>1</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>4</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>4</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>0</second> </second> </item> <item> <first>85</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>93</first> <second> <first>4</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>1</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>4</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>4</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>1</first> <second>0</second> </second> </item> <item> <first>103</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>104</first> <second> <first>1</first> <second>3</second> </second> </item> <item> <first>105</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>106</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>107</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>109</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>110</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>111</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>114</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>116</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>117</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>120</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>122</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>125</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>126</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>127</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>128</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>129</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>130</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>131</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>133</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>134</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>135</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>136</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>137</first> <second> <first>5</first> <second>3</second> </second> </item> <item> <first>138</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>139</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>140</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>141</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>142</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>143</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>144</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>145</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>146</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>147</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>148</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>149</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>151</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>152</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>153</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>154</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>155</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>156</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>157</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>158</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>159</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>160</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>161</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>162</first> <second> <first>7</first> <second>1</second> </second> </item> <item> <first>163</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>164</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>166</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>167</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>168</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>169</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>170</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>172</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>173</first> <second> <first>7</first> <second>1</second> </second> </item> <item> <first>174</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>175</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>176</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>177</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>178</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>179</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>181</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>182</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>183</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>184</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>185</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>186</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>188</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>189</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>190</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>191</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>192</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>193</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>194</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>195</first> <second> <first>11</first> <second>0</second> </second> </item> <item> <first>196</first> <second> <first>12</first> <second>0</second> </second> </item> <item> <first>197</first> <second> <first>13</first> <second>67</second> </second> </item> <item> <first>198</first> <second> <first>80</first> <second>0</second> </second> </item> <item> <first>200</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>201</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>202</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>203</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>204</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>205</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>206</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>207</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>208</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>209</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>210</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>211</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>212</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>213</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>214</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>215</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>216</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>217</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>218</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>219</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>221</first> <second> <first>81</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>108</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>4</second> </second> </item> <item> <first>118</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>124</first> <second> <first>5</first> <second>9</second> </second> </item> <item> <first>132</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>150</first> <second> <first>5</first> <second>9</second> </second> </item> <item> <first>171</first> <second> <first>6</first> <second>9</second> </second> </item> <item> <first>180</first> <second> <first>7</first> <second>9</second> </second> </item> <item> <first>187</first> <second> <first>5</first> <second>10</second> </second> </item> <item> <first>199</first> <second> <first>6</first> <second>80</second> </second> </item> <item> <first>220</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>222</first> <second> <first>6</first> <second>6</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="1" version="0" object_id="_479"> <region_name>VITIS_LOOP_96_1</region_name> <basic_blocks> <count>9</count> <item_version>0</item_version> <item>118</item> <item>124</item> <item>132</item> <item>150</item> <item>171</item> <item>180</item> <item>187</item> <item>199</item> <item>220</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>76</pipe_depth> </item> </regions> <dp_fu_nodes class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </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="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>

28.827202

115

0.619641

20bd76d3a6cedbd9b3865106c58ebc8cf7a24efd

29,636

adb

Ada

orka_plugin_gltf/src/orka-resources-models-gltf.adb

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

52

2016-07-30T23:00:28.000Z

2022-02-05T11:54:55.000Z

orka_plugin_gltf/src/orka-resources-models-gltf.adb

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

79

2016-08-01T18:36:48.000Z

2022-02-27T12:14:20.000Z

orka_plugin_gltf/src/orka-resources-models-gltf.adb

onox/orka

9edf99559a16ffa96dfdb208322f4d18efbcbac6

[ "Apache-2.0" ]

4

2018-04-28T22:36:26.000Z

2020-11-14T23:00:29.000Z

-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2016 onox <[email protected]> -- -- 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 System; with Ada.Containers.Indefinite_Hashed_Maps; with Ada.Directories; with Ada.Strings.Hash; with Ada.Unchecked_Deallocation; with JSON.Parsers; with GL.Types.Indirect; with Orka.glTF.Buffers; with Orka.glTF.Accessors; with Orka.glTF.Meshes; with Orka.glTF.Scenes; with Orka.OS; with Orka.Jobs; with Orka.Logging; with Orka.Resources.Locations; with Orka.Strings; with Orka.Types; package body Orka.Resources.Models.glTF is use all type Orka.Logging.Source; use all type Orka.Logging.Severity; package Messages is new Orka.Logging.Messages (Resource_Loader); Default_Root_Name : constant String := "root"; package String_Maps is new Ada.Containers.Indefinite_Hashed_Maps (Key_Type => String, Element_Type => Natural, Hash => Ada.Strings.Hash, Equivalent_Keys => "="); ----------------------------------------------------------------------------- type Time_Kind is (Time_Reading, Time_Parsing, Time_Processing, Time_Buffers, Time_Views, Time_Accessors, Time_Meshes, Time_Nodes, Time_Scenes, Time_Scene_Tree, Time_Write_Buffers); type Times_Data is array (Time_Kind) of Duration; type GLTF_Data (Maximum_Nodes, Maximum_Accessors : Natural) is limited record Directory : SU.Unbounded_String; Location : Locations.Location_Ptr; Buffers : Orka.glTF.Buffers.Buffer_Vectors.Vector (Capacity => 8); Views : Orka.glTF.Buffers.Buffer_View_Vectors.Vector (Capacity => Maximum_Accessors); Accessors : Orka.glTF.Accessors.Accessor_Vectors.Vector (Capacity => Maximum_Accessors); Meshes : Orka.glTF.Meshes.Mesh_Vectors.Vector (Capacity => Maximum_Nodes); Nodes : Orka.glTF.Scenes.Node_Vectors.Vector (Capacity => Maximum_Nodes); Scenes : Orka.glTF.Scenes.Scene_Vectors.Vector (Capacity => 8); Default_Scene : Long_Integer; Times : Times_Data := (others => 0.0); Start_Time : Time; Manager : Managers.Manager_Ptr; end record; type GLTF_Data_Access is access GLTF_Data; procedure Free_Data is new Ada.Unchecked_Deallocation (Object => GLTF_Data, Name => GLTF_Data_Access); package GLTF_Data_Pointers is new Orka.Smart_Pointers (GLTF_Data, GLTF_Data_Access, Free_Data); ----------------------------------------------------------------------------- type GLTF_Parse_Job is new Jobs.Abstract_Job with record Data : Loaders.Resource_Data; Manager : Managers.Manager_Ptr; Location : Locations.Location_Ptr; end record; type GLTF_Finish_Processing_Job is new Jobs.Abstract_Job with record Data : GLTF_Data_Pointers.Mutable_Pointer; Path : SU.Unbounded_String; end record; type GLTF_Create_Model_Job is new Jobs.Abstract_Job and Jobs.GPU_Job with record Data : GLTF_Data_Pointers.Mutable_Pointer; Path : SU.Unbounded_String; Scene : Model_Scene_Ptr; Vertices, Indices : Natural; end record; type GLTF_Write_Buffers_Job is new Jobs.Abstract_Job with record Data : GLTF_Data_Pointers.Mutable_Pointer; Model : Model_Ptr; end record; type GLTF_Finish_Loading_Job is new Jobs.Abstract_Job and Jobs.GPU_Job with record Data : GLTF_Data_Pointers.Mutable_Pointer; Path : SU.Unbounded_String; Model : Model_Ptr; Parts, Vertices, Indices : Natural; Start_Time : Time; end record; ----------------------------------------------------------------------------- -- EXECUTE PROCEDURES -- ----------------------------------------------------------------------------- overriding procedure Execute (Object : GLTF_Parse_Job; Context : Jobs.Execution_Context'Class); overriding procedure Execute (Object : GLTF_Finish_Processing_Job; Context : Jobs.Execution_Context'Class); overriding procedure Execute (Object : GLTF_Create_Model_Job; Context : Jobs.Execution_Context'Class); overriding procedure Execute (Object : GLTF_Write_Buffers_Job; Context : Jobs.Execution_Context'Class); overriding procedure Execute (Object : GLTF_Finish_Loading_Job; Context : Jobs.Execution_Context'Class); ----------------------------------------------------------------------------- procedure Add_Nodes (Scene : in out Trees.Tree; Parts : in out String_Maps.Map; Nodes : in out Orka.glTF.Scenes.Node_Vectors.Vector; Parents : Orka.glTF.Scenes.Natural_Vectors.Vector) is Current_Parents, Next_Parents : Orka.glTF.Scenes.Natural_Vectors.Vector; begin -- Initialize Current_Parents with the elements in Parents for Parent_Index of Parents loop Current_Parents.Append (Parent_Index); end loop; -- Add the children of Current_Parents, and then the -- children of those children, etc. etc. loop for Parent_Index of Current_Parents loop declare Parent_Node : Orka.glTF.Scenes.Node renames Nodes (Parent_Index); Parent_Name : String renames Orka.glTF.To_String (Parent_Node.Name); use type Orka.glTF.Scenes.Transform_Kind; begin -- Use "matrix" or TRS for the local transform if Parent_Node.Transform = Orka.glTF.Scenes.Matrix then Scene.Set_Local_Transform (Scene.To_Cursor (Parent_Name), Parent_Node.Matrix); else declare PN : Orka.glTF.Scenes.Node renames Parent_Node; use Transforms; begin Scene.Set_Local_Transform (Scene.To_Cursor (Parent_Name), T (PN.Translation) * R (PN.Rotation) * S (PN.Scale)); end; end if; -- Add the children to the scene as nodes for Child_Index of Parent_Node.Children loop Scene.Add_Node (Orka.glTF.To_String (Nodes (Child_Index).Name), Parent_Name); Next_Parents.Append (Child_Index); end loop; -- Add mesh as MDI part by mapping the parent (a node) to the mesh index if Parent_Node.Mesh /= Orka.glTF.Undefined then Parts.Insert (Parent_Name, Parent_Node.Mesh); end if; end; end loop; exit when Next_Parents.Is_Empty; Current_Parents := Next_Parents; Next_Parents.Clear; end loop; end Add_Nodes; function Mesh_Node_Cursors (Parts : String_Maps.Map; Scene : Trees.Tree) return Cursor_Array_Holder.Holder is Shapes : Cursor_Array (1 .. Positive (Parts.Length)); procedure Set_Name (Position : String_Maps.Cursor) is Mesh_Index : Natural renames String_Maps.Element (Position); Node_Name : String renames String_Maps.Key (Position); begin Shapes (Mesh_Index + 1) := Scene.To_Cursor (Node_Name); end Set_Name; begin Parts.Iterate (Set_Name'Access); return Cursor_Array_Holder.To_Holder (Shapes); end Mesh_Node_Cursors; function Bounds_List (Accessors : Orka.glTF.Accessors.Accessor_Vectors.Vector; Meshes : in out Orka.glTF.Meshes.Mesh_Vectors.Vector) return Orka.Types.Singles.Vector4_Array is use type GL.Types.Size; use Orka.glTF.Accessors; use all type Orka.glTF.Meshes.Attribute_Kind; Mesh_Index : GL.Types.Size := 1; begin return Result : Orka.Types.Singles.Vector4_Array (1 .. GL.Types.Size (Meshes.Length) * 2) do for Mesh of Meshes loop declare First_Primitive : Orka.glTF.Meshes.Primitive renames Mesh.Primitives; Attribute_Position : constant Natural := First_Primitive.Attributes (Position); Accessor_Position : Accessor renames Accessors (Attribute_Position); pragma Assert (Accessor_Position.Bounds); begin Result (Mesh_Index + 0) := Accessor_Position.Min_Bounds; Result (Mesh_Index + 1) := Accessor_Position.Max_Bounds; Mesh_Index := Mesh_Index + 2; end; end loop; end return; end Bounds_List; generic type Target_Type is private; type Target_Array is array (GL.Types.Size range <>) of aliased Target_Type; type Target_Array_Access is access Target_Array; package Buffer_View_Conversions is generic type Source_Type is private; type Source_Array is array (GL.Types.Size range <>) of aliased Source_Type; with procedure Cast (Value : Source_Type; Result : out Target_Type); procedure Convert_Array (Elements : Source_Array; Result : out Target_Array); generic type Source_Type is private; type Source_Array is array (GL.Types.Size range <>) of aliased Source_Type; with procedure Convert_Array (Elements : Source_Array; Result : out Target_Array); procedure Get_Array (Accessor : Orka.glTF.Accessors.Accessor; Buffers : Orka.glTF.Buffers.Buffer_Vectors.Vector; View : Orka.glTF.Buffers.Buffer_View; Target : not null Target_Array_Access); end Buffer_View_Conversions; package body Buffer_View_Conversions is procedure Convert_Array (Elements : Source_Array; Result : out Target_Array) is begin for Index in Elements'Range loop Cast (Elements (Index), Result (Index)); end loop; end Convert_Array; procedure Get_Array (Accessor : Orka.glTF.Accessors.Accessor; Buffers : Orka.glTF.Buffers.Buffer_Vectors.Vector; View : Orka.glTF.Buffers.Buffer_View; Target : not null Target_Array_Access) is use Orka.glTF.Accessors; Count : constant Positive := Attribute_Length (Accessor.Kind) * Accessor.Count; Bytes_Per_Element : constant Positive := Bytes_Element (Accessor.Component); pragma Assert (View.Length / Bytes_Per_Element = Count); pragma Assert (Source_Type'Size / System.Storage_Unit = Bytes_Per_Element); procedure Extract is new Orka.glTF.Buffers.Extract_From_Buffer (Source_Type, Source_Array); type Source_Array_Access is access Source_Array; procedure Free_Array is new Ada.Unchecked_Deallocation (Object => Source_Array, Name => Source_Array_Access); Source : Source_Array_Access := new Source_Array (Target.all'Range); begin Extract (Buffers, View, Source.all); Convert_Array (Source.all, Target.all); Free_Array (Source); end Get_Array; end Buffer_View_Conversions; procedure Count_Parts (Index_Kind : GL.Types.Index_Type; Accessors : Orka.glTF.Accessors.Accessor_Vectors.Vector; Meshes : in out Orka.glTF.Meshes.Mesh_Vectors.Vector; Vertices, Indices : out Natural) is use type Ada.Containers.Count_Type; use type Orka.glTF.Accessors.Component_Kind; use type GL.Types.Index_Type; use Orka.glTF.Accessors; use all type Orka.glTF.Meshes.Attribute_Kind; Count_Vertices : Natural := 0; Count_Indices : Natural := 0; begin for Mesh of Meshes loop declare Mesh_Name : String renames Orka.glTF.To_String (Mesh.Name); First_Primitive : Orka.glTF.Meshes.Primitive renames Mesh.Primitives; Attribute_Position : constant Natural := First_Primitive.Attributes (Position); Attribute_Normal : constant Natural := First_Primitive.Attributes (Normal); Attribute_UV : constant Natural := First_Primitive.Attributes (Texcoord_0); pragma Assert (First_Primitive.Indices /= Orka.glTF.Undefined); Attribute_Index : constant Natural := First_Primitive.Indices; Accessor_Position : Accessor renames Accessors (Attribute_Position); Accessor_Normal : Accessor renames Accessors (Attribute_Normal); Accessor_UV : Accessor renames Accessors (Attribute_UV); pragma Assert (Accessor_Position.Component = Orka.glTF.Accessors.Float and then Accessor_Normal.Component = Orka.glTF.Accessors.Float and then Accessor_UV.Component = Orka.glTF.Accessors.Float); pragma Assert (Accessor_Position.Kind = Orka.glTF.Accessors.Vector3 and then Accessor_Normal.Kind = Orka.glTF.Accessors.Vector3 and then Accessor_UV.Kind = Orka.glTF.Accessors.Vector2); pragma Assert (Accessor_Position.Count = Accessor_Normal.Count and then Accessor_Position.Count = Accessor_UV.Count); Accessor_Index : Accessor renames Accessors (Attribute_Index); pragma Assert (Accessor_Index.Kind = Orka.glTF.Accessors.Scalar); pragma Assert (Unsigned_Type (Accessor_Index.Component) <= Index_Kind, "Index of mesh " & Mesh_Name & " has type " & GL.Types.Index_Type'Image (Unsigned_Type (Accessor_Index.Component)) & " but expected " & Index_Kind'Image & " or lower"); begin Count_Vertices := Count_Vertices + Accessor_Position.Count; Count_Indices := Count_Indices + Accessor_Index.Count; end; end loop; Vertices := Count_Vertices; Indices := Count_Indices; end Count_Parts; procedure Add_Parts (Batch : in out Rendering.Buffers.MDI.Batch; Buffers : Orka.glTF.Buffers.Buffer_Vectors.Vector; Views : Orka.glTF.Buffers.Buffer_View_Vectors.Vector; Accessors : Orka.glTF.Accessors.Accessor_Vectors.Vector; Meshes : in out Orka.glTF.Meshes.Mesh_Vectors.Vector) is use GL.Types; use Orka.glTF.Accessors; use Orka.glTF.Buffers; use all type Orka.glTF.Meshes.Attribute_Kind; package Index_Conversions is new Buffer_View_Conversions (UInt, UInt_Array, Indirect.UInt_Array_Access); package Vertex_Conversions is new Buffer_View_Conversions (Half, Half_Array, Indirect.Half_Array_Access); procedure Get_Singles is new Vertex_Conversions.Get_Array (Single, Single_Array, Orka.Types.Convert); procedure Cast (Value : UShort; Result : out UInt) is begin Result := UInt (Value); end Cast; procedure Cast (Value : UInt; Result : out UInt) is begin Result := Value; end Cast; procedure Convert is new Index_Conversions.Convert_Array (UShort, UShort_Array, Cast); procedure Convert is new Index_Conversions.Convert_Array (UInt, UInt_Array, Cast); procedure Get_UShorts is new Index_Conversions.Get_Array (UShort, UShort_Array, Convert); procedure Get_UInts is new Index_Conversions.Get_Array (UInt, UInt_Array, Convert); begin for Mesh of Meshes loop declare First_Primitive : Orka.glTF.Meshes.Primitive renames Mesh.Primitives; Attribute_Position : constant Natural := First_Primitive.Attributes (Position); Attribute_Normal : constant Natural := First_Primitive.Attributes (Normal); Attribute_UV : constant Natural := First_Primitive.Attributes (Texcoord_0); Attribute_Index : constant Natural := First_Primitive.Indices; Accessor_Position : Accessor renames Accessors (Attribute_Position); Accessor_Normal : Accessor renames Accessors (Attribute_Normal); Accessor_UV : Accessor renames Accessors (Attribute_UV); Accessor_Index : Accessor renames Accessors (Attribute_Index); View_Position : Buffer_View renames Views (Accessor_Position.View); View_Normal : Buffer_View renames Views (Accessor_Normal.View); View_UV : Buffer_View renames Views (Accessor_UV.View); View_Index : Buffer_View renames Views (Accessor_Index.View); Positions : Indirect.Half_Array_Access := new Half_Array (1 .. Int (Accessor_Position.Count * Attribute_Length (Accessor_Position.Kind))); Normals : Indirect.Half_Array_Access := new Half_Array (1 .. Int (Accessor_Normal.Count * Attribute_Length (Accessor_Normal.Kind))); UVs : Indirect.Half_Array_Access := new Half_Array (1 .. Int (Accessor_UV.Count * Attribute_Length (Accessor_UV.Kind))); Indices : Indirect.UInt_Array_Access := new UInt_Array (1 .. Int (Accessor_Index.Count)); -- TODO Use Conversions.Target_Array? begin -- Convert attributes Get_Singles (Accessor_Position, Buffers, View_Position, Positions); Get_Singles (Accessor_Normal, Buffers, View_Normal, Normals); Get_Singles (Accessor_UV, Buffers, View_UV, UVs); -- Convert indices case Unsigned_Type (Accessor_Index.Component) is when GL.Types.UShort_Type => Get_UShorts (Accessor_Index, Buffers, View_Index, Indices); when GL.Types.UInt_Type => Get_UInts (Accessor_Index, Buffers, View_Index, Indices); end case; Batch.Append (Positions, Normals, UVs, Indices); -- Deallocate buffers after use Indirect.Free_Array (Positions); Indirect.Free_Array (Normals); Indirect.Free_Array (UVs); Indirect.Free_Array (Indices); end; end loop; end Add_Parts; ----------------------------------------------------------------------------- -- Loader -- ----------------------------------------------------------------------------- type GLTF_Loader is limited new Loaders.Loader with record Manager : Managers.Manager_Ptr; end record; overriding function Extension (Object : GLTF_Loader) return Loaders.Extension_String is ("gltf"); overriding procedure Load (Object : GLTF_Loader; Data : Loaders.Resource_Data; Enqueue : not null access procedure (Element : Jobs.Job_Ptr); Location : Locations.Location_Ptr) is Job : constant Jobs.Job_Ptr := new GLTF_Parse_Job' (Jobs.Abstract_Job with Data => Data, Manager => Object.Manager, Location => Location); begin Enqueue (Job); end Load; function Create_Loader (Manager : Managers.Manager_Ptr) return Loaders.Loader_Ptr is (new GLTF_Loader'(Manager => Manager)); ----------------------------------------------------------------------------- package Parsers is new JSON.Parsers (Orka.glTF.Types); overriding procedure Execute (Object : GLTF_Parse_Job; Context : Jobs.Execution_Context'Class) is use Orka.glTF.Types; use Orka.Strings; Path : constant String := +Object.Data.Path; Parser : Parsers.Parser := Parsers.Create (Object.Data.Bytes.Get.Value); begin declare T1 : constant Duration := Orka.OS.Monotonic_Clock; JSON : constant Orka.glTF.Types.JSON_Value := Parser.Parse; T2 : constant Duration := Orka.OS.Monotonic_Clock; Buffers : constant JSON_Value := JSON ("buffers"); Views : constant JSON_Value := JSON ("bufferViews"); Accessors : constant JSON_Value := JSON ("accessors"); Meshes : constant JSON_Value := JSON ("meshes"); Nodes : constant JSON_Value := JSON ("nodes"); Scenes : constant JSON_Value := JSON ("scenes"); Maximum_Nodes : constant Natural := Nodes.Length; -- Tokenize and parse JSON data Data : constant GLTF_Data_Access := new GLTF_Data' (Maximum_Nodes => Maximum_Nodes, Maximum_Accessors => Maximum_Nodes * 4, Directory => +Ada.Directories.Containing_Directory (Path), Location => Object.Location, Manager => Object.Manager, Start_Time => Object.Data.Start_Time, others => <>); Asset : constant JSON_Value := JSON ("asset"); Scene : constant JSON_Value := JSON ("scene"); function Load_Data (Path : String) return Byte_Array_Pointers.Pointer is begin return Data.Location.Read_Data (+Data.Directory & Locations.Path_Separator & Path); end Load_Data; Pointer : GLTF_Data_Pointers.Mutable_Pointer; T3, T4, T5, T6, T7, T8, T9 : Duration; begin -- Require glTF 2.x if Asset.Get ("version").Value /= "2.0" then raise Model_Load_Error with "glTF file '" & Path & "' does not use glTF 2.0"; end if; -- TODO Check minVersion -- Process buffers, nodes, meshes, and scenes T3 := Orka.OS.Monotonic_Clock; Data.Buffers.Append (Orka.glTF.Buffers.Get_Buffers (Buffers, Load_Data'Access)); T4 := Orka.OS.Monotonic_Clock; Data.Views.Append (Orka.glTF.Buffers.Get_Buffer_Views (Data.Buffers, Views)); T5 := Orka.OS.Monotonic_Clock; Data.Accessors.Append (Orka.glTF.Accessors.Get_Accessors (Accessors)); T6 := Orka.OS.Monotonic_Clock; Data.Meshes.Append (Orka.glTF.Meshes.Get_Meshes (Meshes)); T7 := Orka.OS.Monotonic_Clock; Data.Nodes.Append (Orka.glTF.Scenes.Get_Nodes (Nodes)); T8 := Orka.OS.Monotonic_Clock; Data.Scenes.Append (Orka.glTF.Scenes.Get_Scenes (Scenes)); T9 := Orka.OS.Monotonic_Clock; Data.Times (Time_Buffers) := T4 - T3; Data.Times (Time_Views) := T5 - T4; Data.Times (Time_Accessors) := T6 - T5; Data.Times (Time_Meshes) := T7 - T6; Data.Times (Time_Nodes) := T8 - T7; Data.Times (Time_Scenes) := T9 - T8; Data.Default_Scene := Scene.Value; Data.Times (Time_Reading) := Object.Data.Reading_Time; Data.Times (Time_Parsing) := T2 - T1; Data.Times (Time_Processing) := Orka.OS.Monotonic_Clock - T2; Pointer.Set (Data); declare Finish_Job : constant Jobs.Job_Ptr := new GLTF_Finish_Processing_Job' (Jobs.Abstract_Job with Data => Pointer, Path => Object.Data.Path); begin Context.Enqueue (Finish_Job); end; end; end Execute; overriding procedure Execute (Object : GLTF_Finish_Processing_Job; Context : Jobs.Execution_Context'Class) is Data : GLTF_Data renames Object.Data.Get; -- TODO Textures, Images, Samplers, Materials, Cameras Default_Scene_Index : constant Long_Integer := Data.Default_Scene; Default_Scene : constant Orka.glTF.Scenes.Scene := Data.Scenes (Natural (Default_Scene_Index)); -- Cannot be "renames" because freeing Object.Data results in cursor tampering Path : String renames SU.To_String (Object.Path); begin if Default_Scene.Nodes.Is_Empty then raise Model_Load_Error with "glTF file '" & Path & "' has an empty scene"; end if; declare Scene_Data : constant Model_Scene_Ptr := new Model_Scene' (Scene => Trees.Create_Tree (Default_Root_Name), others => <>); Scene : Trees.Tree renames Scene_Data.Scene; Parts : String_Maps.Map; Start_Time : constant Duration := Orka.OS.Monotonic_Clock; Vertices, Indices : Natural; begin -- Link the nodes in the default scene to the root node and -- then add all the other nodes that are reachable for Node_Index of Default_Scene.Nodes loop Scene.Add_Node (Orka.glTF.To_String (Data.Nodes (Node_Index).Name), Scene.Root_Name); end loop; Add_Nodes (Scene, Parts, Data.Nodes, Default_Scene.Nodes); -- Collect an array of cursors to nodes in the scene for nodes -- that have a corresponding mesh part. This is needed so that, -- after updating the whole scene tree, the world transforms of -- these nodes can be copied to a GPU buffer before rendering. Scene_Data.Shapes := Mesh_Node_Cursors (Parts, Scene); if Scene_Data.Shapes.Element'Length = 0 then -- TODO Free Scene_Data raise Model_Load_Error with "glTF file '" & Path & "' has no mesh parts"; end if; Data.Times (Time_Scene_Tree) := Orka.OS.Monotonic_Clock - Start_Time; -- Count total number of vertices and indices Count_Parts (GL.Types.UInt_Type, Data.Accessors, Data.Meshes, Vertices, Indices); declare Create_Job : constant Jobs.Job_Ptr := new GLTF_Create_Model_Job' (Jobs.Abstract_Job with Data => Object.Data, Path => Object.Path, Scene => Scene_Data, Vertices => Vertices, Indices => Indices); begin Context.Enqueue (Create_Job); end; end; end Execute; overriding procedure Execute (Object : GLTF_Create_Model_Job; Context : Jobs.Execution_Context'Class) is Data : GLTF_Data renames Object.Data.Get; Parts : constant Positive := Object.Scene.Shapes.Element'Length; Start_Time : constant Time := Orka.OS.Monotonic_Clock; Model_Data : constant Model_Ptr := new Model' (Scene => Object.Scene, Batch => Rendering.Buffers.MDI.Create_Batch (Parts, Object.Vertices, Object.Indices), -- Bounding boxes for culling Bounds => Rendering.Buffers.Create_Buffer (Flags => (others => False), Data => Bounds_List (Data.Accessors, Data.Meshes))); Buffers_Job : constant Jobs.Job_Ptr := new GLTF_Write_Buffers_Job' (Jobs.Abstract_Job with Data => Object.Data, Model => Model_Data); Finish_Job : constant Jobs.Job_Ptr := new GLTF_Finish_Loading_Job' (Jobs.Abstract_Job with Data => Object.Data, Path => Object.Path, Model => Model_Data, Start_Time => Start_Time, Parts => Parts, Vertices => Object.Vertices, Indices => Object.Indices); begin Orka.Jobs.Chain ((Buffers_Job, Finish_Job)); Context.Enqueue (Buffers_Job); end Execute; overriding procedure Execute (Object : GLTF_Write_Buffers_Job; Context : Jobs.Execution_Context'Class) is Data : GLTF_Data renames Object.Data.Get; begin Add_Parts (Object.Model.Batch, Data.Buffers, Data.Views, Data.Accessors, Data.Meshes); end Execute; overriding procedure Execute (Object : GLTF_Finish_Loading_Job; Context : Jobs.Execution_Context'Class) is Data : GLTF_Data renames Object.Data.Get; Path : String renames SU.To_String (Object.Path); begin Object.Model.Batch.Finish_Batch; Data.Times (Time_Write_Buffers) := Orka.OS.Monotonic_Clock - Object.Start_Time; -- Register the model at the resource manager Data.Manager.Add_Resource (Path, Resource_Ptr (Object.Model)); declare Times : Times_Data renames Data.Times; begin Messages.Log (Info, "Loaded model " & Path & " in " & Logging.Trim (Logging.Image (Orka.OS.Monotonic_Clock - Data.Start_Time))); Messages.Log (Info, " " & Object.Parts'Image & " parts," & Object.Vertices'Image & " vertices," & Object.Indices'Image & " indices"); Messages.Log (Info, " timing:"); Messages.Log (Info, " reading file: " & Logging.Image (Times (Time_Reading))); Messages.Log (Info, " parsing JSON: " & Logging.Image (Times (Time_Parsing))); Messages.Log (Info, " processing glTF: " & Logging.Image (Times (Time_Processing))); Messages.Log (Info, " buffers: " & Logging.Image (Times (Time_Buffers))); Messages.Log (Info, " views: " & Logging.Image (Times (Time_Views))); Messages.Log (Info, " accessors: " & Logging.Image (Times (Time_Accessors))); Messages.Log (Info, " meshes: " & Logging.Image (Times (Time_Meshes))); Messages.Log (Info, " nodes: " & Logging.Image (Times (Time_Nodes))); Messages.Log (Info, " scenes: " & Logging.Image (Times (Time_Scenes))); Messages.Log (Info, " scene tree: " & Logging.Image (Times (Time_Scene_Tree))); Messages.Log (Info, " buffers: " & Logging.Image (Times (Time_Write_Buffers))); end; end Execute; end Orka.Resources.Models.glTF;

38.388601

99

0.626974

0e02881d663c6eadf69d593e90bbcaf9a81b8e4a

1,869

ads

Ada

stack/stack.ads

zorodc/true-libs

2023abbf457d576ede7efe9bcbbd87c0b1a8b94e

[ "0BSD" ]

null

stack/stack.ads

zorodc/true-libs

2023abbf457d576ede7efe9bcbbd87c0b1a8b94e

[ "0BSD" ]

null

stack/stack.ads

zorodc/true-libs

2023abbf457d576ede7efe9bcbbd87c0b1a8b94e

[ "0BSD" ]

null

pragma SPARK_Mode(On); generic type Thing is private; Basic:in Thing; package Stack is subtype Count is Natural; subtype Index is Count range 1 .. Count'Last; type Stack (Max_Capacity : Count) is private; type Store is array (Index range<>) of Thing; -- "Models": For peeking into internals in the spec. function Buffer (S : Stack) return Store with Ghost; -- Underlying buffer. function Pushes (S : Stack) return Count with Ghost; -- # of items pushed. ----------------------- -- Primary interface -- ----------------------- function Has_Space (S : Stack) return Boolean; function Has_Items (S : Stack) return Boolean; function Top (S : in Stack) return Thing with Pre => Has_Items (S), Post => Top'Result = Buffer (S)(Pushes (S)); procedure Pop (S : in out Stack) with Pre => Has_Items (S), Post => Has_Space (S) and Pushes (S) = Pushes (S)'Old -1 and Buffer (S) = Buffer (S)'Old (1..Pushes(S)); procedure Put (S : in out Stack; E : Thing) with Pre => Has_Space (S), Post => Has_Items (S) and Pushes (S) = Pushes (S)'Old + 1 and Buffer (S) = Buffer (S)'Old & E; private type Stack (Max_Capacity : Count) is record Elements : Store (1 .. Max_Capacity) := (others => Basic); Quantity : Count := 0; -- ^ UNNEEDED end record with Dynamic_Predicate => (Stack.Quantity <= Stack.Max_Capacity); function Has_Items(S: Stack) return Boolean is (S.Quantity > 0); function Has_Space(S: Stack) return Boolean is (S.Quantity < S.Max_Capacity); function Buffer (S: Stack) return Store is (S.Elements(1 .. S.Quantity)); function Pushes (S: Stack) return Count is (S.Quantity ); end Stack;

36.647059

80

0.575709

d0a6bd26960ce6f854b7cf2604eead5e9378a201

990

adb

Ada

src/simple_blockchain_demo.adb

tomekw/simple_blockchain

141bca753bbccd5db55ccc587a10af46eeebc9f6

[ "MIT" ]

23

2018-06-20T13:36:43.000Z

2021-01-30T11:31:56.000Z

src/simple_blockchain_demo.adb

avujic/simple_blockchain

33320e6bf0545bf52c069f5945c24148b12f45e5

[ "MIT" ]

3

2018-06-17T13:46:17.000Z

2018-07-02T16:48:06.000Z

src/simple_blockchain_demo.adb

avujic/simple_blockchain

33320e6bf0545bf52c069f5945c24148b12f45e5

[ "MIT" ]

6

2018-06-20T19:06:25.000Z

2021-02-26T21:11:59.000Z

with Ada.Text_IO; use Ada.Text_IO; with Simple_Blockchain.Block; with Simple_Blockchain.Blockchain; use Simple_Blockchain; function Simple_Blockchain_Demo return Integer is The_Blockchain : Blockchain.Object := Blockchain.Make (Difficulty => 6); begin Put_Line ("Simple blockchain demo"); New_Line; Put_Line ("Mining first block..."); Blockchain.Mine_Block (The_Blockchain, Data => "First block"); Put_Line ("Block mined."); New_Line; Put_Line ("Mining second block..."); Blockchain.Mine_Block (The_Blockchain, Data => "Second block"); Put_Line ("Block mined."); New_Line; Put_Line ("Mining third block..."); Blockchain.Mine_Block (The_Blockchain, Data => "Third block"); Put_Line ("Block mined."); New_Line; Put_Line ("Is blockchain valid? " & Blockchain.Is_Valid (The_Blockchain)'Image); New_Line; Put_Line ("Printing blockchain..."); Put_Line (Blockchain.Image (The_Blockchain)); return 0; end Simple_Blockchain_Demo;

26.756757

83

0.713131

183c01e26dcf1cefa5af89523f6ec82fc9ee2add

13,023

ads

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbdlli.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbdlli.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbdlli.ads

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- 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;

31.609223

79

0.618214

4a52fa16eb48daac05cba0c4c5d7d6aeb85f4ce3

25,930

adb

Ada

source/slim-players.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-players.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-players.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Ada.Streams; with Ada.Streams.Stream_IO; with Ada.Unchecked_Deallocation; with Ada.Wide_Wide_Text_IO; with Interfaces; with System; with League.IRIs; with League.Settings; with League.String_Vectors; with League.Holders; with Slim.Menu_Models.JSON; with Slim.Message_Decoders; with Slim.Message_Visiters; with Slim.Messages.audg; with Slim.Messages.strm; with Slim.Players.Connected_State_Visiters; with Slim.Players.Displays; with Slim.Players.Idle_State_Visiters; with Slim.Players.Play_Radio_Visiters; with Slim.Players.Play_Files_Visiters; package body Slim.Players is Hearbeat_Period : constant := 5.0; procedure Read_Message (Socket : GNAT.Sockets.Socket_Type; Message : out Slim.Messages.Message_Access); procedure Send_Hearbeat (Self : in out Player'Class); procedure Read_Splash (Splash : out League.Stream_Element_Vectors.Stream_Element_Vector; File : League.Strings.Universal_String); procedure Free is new Ada.Unchecked_Deallocation (Slim.Messages.Message'Class, Slim.Messages.Message_Access); function Seconds_To_Bytes (File : League.Strings.Universal_String; Skip : Positive) return League.Strings.Universal_String; ---------------- -- First_Menu -- ---------------- function First_Menu (Self : Player'Class) return Slim.Menu_Views.Menu_View is Ignore : Boolean; begin return Result : Slim.Menu_Views.Menu_View do Result.Initialize (Menu => Slim.Menu_Models.Menu_Model_Access (Self.Menu), Font => Self.Font'Unchecked_Access); end return; end First_Menu; ----------------- -- Get_Display -- ----------------- function Get_Display (Self : Player; Height : Positive := 32; Width : Positive := 160) return Slim.Players.Displays.Display is Size : constant Ada.Streams.Stream_Element_Offset := Ada.Streams.Stream_Element_Offset (Height * Width / 8); begin return Result : Slim.Players.Displays.Display (Size) do Slim.Players.Displays.Initialize (Result, Self); end return; end Get_Display; ------------------ -- Get_Position -- ------------------ procedure Get_Position (Self : in out Player'Class; M3U : League.Strings.Universal_String; Index : out Positive; Skip : out Natural) is pragma Unreferenced (Self); Setting : League.Settings.Settings; Key : League.Strings.Universal_String; Value : League.Holders.Holder; begin Key.Append ("Pause/Index."); Key.Append (M3U); Value := Setting.Value (Key); if League.Holders.Is_Universal_String (Value) then Key := League.Holders.Element (Value); Index := Positive'Wide_Wide_Value (Key.To_Wide_Wide_String); else Index := 1; end if; Key.Clear; Key.Append ("Pause/Skip."); Key.Append (M3U); Value := Setting.Value (Key); if League.Holders.Is_Universal_String (Value) then Key := League.Holders.Element (Value); Skip := Natural'Wide_Wide_Value (Key.To_Wide_Wide_String); else Skip := 0; end if; end Get_Position; ---------------- -- Initialize -- ---------------- procedure Initialize (Self : in out Player'Class; Socket : GNAT.Sockets.Socket_Type; Font : League.Strings.Universal_String; Splash : League.Strings.Universal_String; Menu : League.Strings.Universal_String) is begin Self.Socket := Socket; GNAT.Sockets.Set_Socket_Option (Self.Socket, GNAT.Sockets.Socket_Level, (GNAT.Sockets.Receive_Timeout, Hearbeat_Period)); Slim.Fonts.Read (Self.Font, Font); Read_Splash (Self.Splash, Splash); Self.Menu := new Slim.Menu_Models.JSON.JSON_Menu_Model (Self'Unchecked_Access); Slim.Menu_Models.JSON.JSON_Menu_Model (Self.Menu.all).Initialize (File => Menu); end Initialize; ---------------- -- Play_Files -- ---------------- procedure Play_Files (Self : in out Player'Class; Root : League.Strings.Universal_String; M3U : League.Strings.Universal_String; List : Song_Array; From : Positive; Skip : Natural) is use type Ada.Calendar.Time; Playlist : Song_Vectors.Vector; begin for X of List loop Playlist.Append (X); end loop; Self.State := (Play_Files, (Volume => 30, Volume_Set_Time => Ada.Calendar.Clock - 60.0, Current_Song => List (From).Title, Paused => False, Seconds => 0), Root, M3U, Playlist, From, Skip); Self.Request_Next_File; end Play_Files; -------------------- -- Play_Next_File -- -------------------- procedure Play_Next_File (Self : in out Player'Class; Immediate : Boolean := True) is begin if Self.State.Kind /= Play_Files then return; elsif Immediate then declare strm : Slim.Messages.strm.Strm_Message; begin strm.Simple_Command (Command => Slim.Messages.strm.Flush); Write_Message (Self.Socket, strm); end; end if; if Self.State.Index < Self.State.Playlist.Last_Index then Self.State.Index := Self.State.Index + 1; Self.State.Offset := 0; Self.Request_Next_File; else Self.Stop; end if; end Play_Next_File; ------------------------ -- Play_Previous_File -- ------------------------ procedure Play_Previous_File (Self : in out Player'Class; Immediate : Boolean := True) is begin if Self.State.Kind /= Play_Files then return; elsif Immediate then declare strm : Slim.Messages.strm.Strm_Message; begin strm.Simple_Command (Command => Slim.Messages.strm.Flush); Write_Message (Self.Socket, strm); end; end if; if Self.State.Index > 1 then Self.State.Index := Self.State.Index - 1; Self.Request_Next_File; else Self.Stop; end if; end Play_Previous_File; ---------------- -- Play_Radio -- ---------------- procedure Play_Radio (Self : in out Player'Class; URL : League.Strings.Universal_String) is use type Ada.Calendar.Time; IRI : constant League.IRIs.IRI := League.IRIs.From_Universal_String (URL); Host : League.Strings.Universal_String := IRI.Get_Host; Port : constant Natural := IRI.Get_Port; Port_Image : Wide_Wide_String := Integer'Wide_Wide_Image (Port); Addr : GNAT.Sockets.Inet_Addr_Type; Strm : Slim.Messages.strm.Strm_Message; Request : League.String_Vectors.Universal_String_Vector; Line : League.Strings.Universal_String; begin Self.Stop; declare Host_Entry : constant GNAT.Sockets.Host_Entry_Type := GNAT.Sockets.Get_Host_By_Name (Host.To_UTF_8_String); begin for J in 1 .. Host_Entry.Addresses_Length loop Addr := GNAT.Sockets.Addresses (Host_Entry, J); exit when Addr.Family in GNAT.Sockets.Family_Inet; end loop; end; if Addr.Family not in GNAT.Sockets.Family_Inet then return; end if; if Port /= 0 then Port_Image (1) := ':'; Host.Append (Port_Image); end if; Line := +"GET /"; Line.Append (IRI.Get_Path.Join ('/')); Line.Append (" HTTP/1.0"); Ada.Wide_Wide_Text_IO.Put_Line (Line.To_Wide_Wide_String); Request.Append (Line); Line := +"Host: "; Line.Append (Host); Request.Append (Line); Request.Append (+"Icy-Metadata: 1"); Request.Append (+""); Request.Append (+""); Strm.Start (Server => (GNAT.Sockets.Family_Inet, Addr, Port => GNAT.Sockets.Port_Type (Port)), Request => Request); Write_Message (Self.Socket, Strm); Self.State := (Play_Radio, (Volume => 30, Volume_Set_Time => Ada.Calendar.Clock - 60.0, Current_Song => League.Strings.Empty_Universal_String, Paused => False, Seconds => 0)); exception when GNAT.Sockets.Host_Error => return; end Play_Radio; --------------------- -- Process_Message -- --------------------- not overriding procedure Process_Message (Self : in out Player) is use type Ada.Calendar.Time; function Get_Visiter return Slim.Message_Visiters.Visiter'Class; function Get_Visiter return Slim.Message_Visiters.Visiter'Class is begin case Self.State.Kind is when Connected => return V : Connected_State_Visiters.Visiter (Self'Unchecked_Access); when Idle => return V : Idle_State_Visiters.Visiter (Self'Unchecked_Access); when Play_Radio => return V : Play_Radio_Visiters.Visiter (Self'Unchecked_Access); when Play_Files => return V : Play_Files_Visiters.Visiter (Self'Unchecked_Access); end case; end Get_Visiter; V : Slim.Message_Visiters.Visiter'Class := Get_Visiter; begin if Self.State.Kind /= Connected and then Ada.Calendar.Clock - Self.Ping > 5.0 then Send_Hearbeat (Self); end if; declare Message : Slim.Messages.Message_Access; begin Read_Message (Self.Socket, Message); Message.Visit (V); Free (Message); exception when E : GNAT.Sockets.Socket_Error => case GNAT.Sockets.Resolve_Exception (E) is when GNAT.Sockets.Resource_Temporarily_Unavailable => Send_Hearbeat (Self); when others => raise; end case; end; end Process_Message; ------------------ -- Read_Message -- ------------------ procedure Read_Message (Socket : GNAT.Sockets.Socket_Type; Message : out Slim.Messages.Message_Access) is use type Ada.Streams.Stream_Element_Offset; Tag : Slim.Messages.Message_Tag; Raw_Tag : Ada.Streams.Stream_Element_Array (1 .. 4) with Address => Tag'Address; Word : Ada.Streams.Stream_Element_Array (1 .. 4); Length : Ada.Streams.Stream_Element_Offset := 0; Last : Ada.Streams.Stream_Element_Offset; Data : aliased League.Stream_Element_Vectors.Stream_Element_Vector; Decoder : Slim.Message_Decoders.Decoder; begin GNAT.Sockets.Receive_Socket (Socket, Raw_Tag, Last); if Last = 0 then -- Timeout return; end if; pragma Assert (Last = Raw_Tag'Length); GNAT.Sockets.Receive_Socket (Socket, Word, Last); pragma Assert (Last = Word'Length); for Byte of Word loop Length := Length * 256 + Ada.Streams.Stream_Element_Offset (Byte); end loop; while Length > 0 loop declare Piece : constant Ada.Streams.Stream_Element_Offset := Ada.Streams.Stream_Element_Offset'Min (Length, 256); Input : Ada.Streams.Stream_Element_Array (1 .. Piece); begin GNAT.Sockets.Receive_Socket (Socket, Input, Last); pragma Assert (Last = Input'Length); Data.Append (Input); Length := Length - Last; end; end loop; Decoder.Decode (Tag, Data'Unchecked_Access, Message); end Read_Message; ----------------- -- Read_Splash -- ----------------- procedure Read_Splash (Splash : out League.Stream_Element_Vectors.Stream_Element_Vector; File : League.Strings.Universal_String) is Size : constant := 32 * 160 / 8; Data : Ada.Streams.Stream_Element_Array (1 .. Size); Last : Ada.Streams.Stream_Element_Offset; Input : Ada.Streams.Stream_IO.File_Type; begin Ada.Streams.Stream_IO.Open (Input, Mode => Ada.Streams.Stream_IO.In_File, Name => File.To_UTF_8_String); Ada.Streams.Stream_IO.Read (Input, Data, Last); pragma Assert (Last in Data'Last); Ada.Streams.Stream_IO.Close (Input); Splash.Clear; Splash.Append (Data); end Read_Splash; ----------------------- -- Request_Next_File -- ----------------------- procedure Request_Next_File (Self : in out Player'Class) is use type League.Strings.Universal_String; Item : constant Song := Self.State.Playlist (Self.State.Index); File : constant League.Strings.Universal_String := Item.File; Strm : Slim.Messages.strm.Strm_Message; Request : League.String_Vectors.Universal_String_Vector; Line : League.Strings.Universal_String; begin Line.Append ("GET /Music/"); Line.Append (File); Line.Append (" HTTP/1.0"); Ada.Wide_Wide_Text_IO.Put_Line (Line.To_Wide_Wide_String); Request.Append (Line); if Self.State.Offset > 0 then Line.Clear; Line.Append ("Range: "); Line.Append (Seconds_To_Bytes (Self.State.Root & File, Self.State.Offset)); Request.Append (Line); Ada.Wide_Wide_Text_IO.Put_Line (Line.To_Wide_Wide_String); end if; Request.Append (+""); Request.Append (+""); Strm.Start (Server => (GNAT.Sockets.Family_Inet, GNAT.Sockets.Inet_Addr ("0.0.0.0"), Port => 8080), Request => Request); Write_Message (Self.Socket, Strm); Self.State.Play_State.Current_Song := Item.Title; end Request_Next_File; ------------------- -- Save_Position -- ------------------- procedure Save_Position (Self : in out Player'Class) is use type League.Strings.Universal_String; Setting : League.Settings.Settings; Value : League.Strings.Universal_String; Skip : constant Natural := Self.State.Offset + Self.State.Play_State.Seconds; begin if Self.State.Kind /= Play_Files or else Self.State.M3U_Name.Is_Empty then return; end if; Value.Append (Integer'Wide_Wide_Image (Self.State.Index)); Value := Value.Tail_From (2); Setting.Set_Value ("Pause/Index." & Self.State.M3U_Name, League.Holders.To_Holder (Value)); Value.Clear; Value.Append (Integer'Wide_Wide_Image (Skip)); Value := Value.Tail_From (2); Setting.Set_Value ("Pause/Skip." & Self.State.M3U_Name, League.Holders.To_Holder (Value)); end Save_Position; ---------------------- -- Seconds_To_Bytes -- ---------------------- function Seconds_To_Bytes (File : League.Strings.Universal_String; Skip : Positive) return League.Strings.Universal_String is procedure Read_ID3 (Input : in out Ada.Streams.Stream_IO.File_Type); -- Skip ID3 header if any procedure Read_MP3_Header (Input : in out Ada.Streams.Stream_IO.File_Type; Bit_Rate : out Ada.Streams.Stream_Element_Count); function Image (Value : Ada.Streams.Stream_Element_Count) return Wide_Wide_String; ----------- -- Image -- ----------- function Image (Value : Ada.Streams.Stream_Element_Count) return Wide_Wide_String is Img : constant Wide_Wide_String := Ada.Streams.Stream_Element_Count'Wide_Wide_Image (Value); begin return Img (2 .. Img'Last); end Image; -------------- -- Read_ID3 -- -------------- procedure Read_ID3 (Input : in out Ada.Streams.Stream_IO.File_Type) is use type Ada.Streams.Stream_Element; use type Ada.Streams.Stream_Element_Count; use type Ada.Streams.Stream_IO.Count; Index : constant Ada.Streams.Stream_IO.Positive_Count := Ada.Streams.Stream_IO.Index (Input); Data : Ada.Streams.Stream_Element_Array (1 .. 10); Last : Ada.Streams.Stream_Element_Count; Skip : Ada.Streams.Stream_IO.Count := 0; begin Ada.Streams.Stream_IO.Read (Input, Data, Last); if Last = Data'Last and then Data (1) = Character'Pos ('I') and then Data (2) = Character'Pos ('D') and then Data (3) = Character'Pos ('3') then for J of Data (7 .. 10) loop Skip := Skip * 128 + Ada.Streams.Stream_IO.Count (J); end loop; Ada.Streams.Stream_IO.Set_Index (Input, Index + Data'Length + Skip); else Ada.Streams.Stream_IO.Set_Index (Input, Index); end if; end Read_ID3; --------------------- -- Read_MP3_Header -- --------------------- procedure Read_MP3_Header (Input : in out Ada.Streams.Stream_IO.File_Type; Bit_Rate : out Ada.Streams.Stream_Element_Count) is use type Interfaces.Unsigned_16; use type Ada.Streams.Stream_IO.Count; type MPEG_Version is (MPEG_2_5, Wrong, MPEG_2, MPEG_1); pragma Unreferenced (Wrong); for MPEG_Version use (0, 1, 2, 3); type MPEG_Layer is (Wrong, Layer_III, Layer_II, Layer_I); pragma Unreferenced (Wrong); for MPEG_Layer use (0, 1, 2, 3); type MPEG_Mode is (Stereo, Joint_Stereo, Dual_Channel, Mono); pragma Unreferenced (Stereo, Joint_Stereo, Dual_Channel, Mono); for MPEG_Mode use (0, 1, 2, 3); type MP3_Header is record Sync_Word : Interfaces.Unsigned_16 range 0 .. 2 ** 11 - 1; Version : MPEG_Version; Layer : MPEG_Layer; Protection : Boolean; Bit_Rate : Interfaces.Unsigned_8 range 0 .. 15; Frequency : Interfaces.Unsigned_8 range 0 .. 3; Padding : Boolean; Is_Private : Boolean; Mode : MPEG_Mode; Extension : Interfaces.Unsigned_8 range 0 .. 3; Copy : Boolean; Original : Boolean; Emphasis : Interfaces.Unsigned_8 range 0 .. 3; end record; for MP3_Header'Object_Size use 32; for MP3_Header'Bit_Order use System.High_Order_First; for MP3_Header use record Sync_Word at 0 range 0 .. 10; Version at 0 range 11 .. 12; Layer at 0 range 13 .. 14; Protection at 0 range 15 .. 15; Bit_Rate at 0 range 16 .. 19; Frequency at 0 range 20 .. 21; Padding at 0 range 22 .. 22; Is_Private at 0 range 23 .. 23; Mode at 0 range 24 .. 25; Extension at 0 range 26 .. 27; Copy at 0 range 28 .. 28; Original at 0 range 29 .. 29; Emphasis at 0 range 30 .. 31; end record; procedure Read_Header (Header : out MP3_Header); MPEG_1_Bit_Rate : constant array (MPEG_Layer range Layer_III .. Layer_I, Interfaces.Unsigned_8 range 1 .. 14) of Ada.Streams.Stream_Element_Count := (Layer_I => (32_000, 64_000, 96_000, 128_000, 160_000, 192_000, 224_000, 256_000, 288_000, 320_000, 352_000, 384_000, 416_000, 448_000), Layer_II => (32_000, 48_000, 56_000, 64_000, 80_000, 96_000, 112_000, 128_000, 160_000, 192_000, 224_000, 256_000, 320_000, 384_000), Layer_III => (32_000, 40_000, 48_000, 56_000, 64_000, 80_000, 96_000, 112_000, 128_000, 160_000, 192_000, 224_000, 256_000, 320_000)); MPEG_2_Bit_Rate : constant array (MPEG_Layer range Layer_II .. Layer_I, Interfaces.Unsigned_8 range 1 .. 14) of Ada.Streams.Stream_Element_Count := (Layer_I => (32_000, 48_000, 56_000, 64_000, 80_000, 96_000, 112_000, 128_000, 144_000, 160_000, 176_000, 192_000, 224_000, 256_000), Layer_II => (8_000, 16_000, 24_000, 32_000, 40_000, 48_000, 56_000, 64_000, 80_000, 96_000, 112_000, 128_000, 144_000, 160_000)); ----------------- -- Read_Header -- ----------------- procedure Read_Header (Header : out MP3_Header) is use type System.Bit_Order; Stream : constant Ada.Streams.Stream_IO.Stream_Access := Ada.Streams.Stream_IO.Stream (Input); Data : Ada.Streams.Stream_Element_Array (1 .. 4) with Import, Address => Header'Address; begin if MP3_Header'Bit_Order = System.Default_Bit_Order then Ada.Streams.Stream_Element_Array'Read (Stream, Data); else for X of reverse Data loop Ada.Streams.Stream_Element'Read (Stream, X); end loop; end if; end Read_Header; Header : MP3_Header := (Sync_Word => 0, others => <>); begin while not Ada.Streams.Stream_IO.End_Of_File (Input) loop Read_Header (Header); exit when Header.Sync_Word = 16#7FF#; Ada.Streams.Stream_IO.Set_Index (Input, Ada.Streams.Stream_IO.Index (Input) - 3); end loop; if Header.Sync_Word /= 16#7FF# then Bit_Rate := 0; elsif Header.Version = MPEG_1 and Header.Layer in MPEG_1_Bit_Rate'Range (1) and Header.Bit_Rate in MPEG_1_Bit_Rate'Range (2) then Bit_Rate := MPEG_1_Bit_Rate (Header.Layer, Header.Bit_Rate); elsif Header.Version in MPEG_2 .. MPEG_2_5 and Header.Layer in Layer_III .. Layer_I and Header.Bit_Rate in MPEG_2_Bit_Rate'Range (2) then Bit_Rate := MPEG_2_Bit_Rate (MPEG_Layer'Max (Header.Layer, Layer_II), Header.Bit_Rate); else Bit_Rate := 0; end if; end Read_MP3_Header; use type Ada.Streams.Stream_Element_Count; Input : Ada.Streams.Stream_IO.File_Type; Bit_Rate : Ada.Streams.Stream_Element_Count; Offset : Ada.Streams.Stream_Element_Count; Result : League.Strings.Universal_String; begin Ada.Streams.Stream_IO.Open (Input, Ada.Streams.Stream_IO.In_File, File.To_UTF_8_String); Read_ID3 (Input); Read_MP3_Header (Input, Bit_Rate); Offset := Bit_Rate * Ada.Streams.Stream_Element_Count (Skip) / 8; Result.Append ("bytes="); Result.Append (Image (Offset)); Result.Append ("-"); Ada.Streams.Stream_IO.Close (Input); return Result; end Seconds_To_Bytes; ------------------- -- Send_Hearbeat -- ------------------- procedure Send_Hearbeat (Self : in out Player'Class) is strm : Slim.Messages.strm.Strm_Message; begin strm.Simple_Command (Command => Slim.Messages.strm.Status); Write_Message (Self.Socket, strm); Self.Ping := Ada.Calendar.Clock; end Send_Hearbeat; ---------- -- Stop -- ---------- procedure Stop (Self : in out Player'Class) is use type Ada.Calendar.Time; Strm : Slim.Messages.strm.Strm_Message; begin if Self.State.Kind in Play_Radio | Play_Files then Strm.Simple_Command (Slim.Messages.strm.Stop); Write_Message (Self.Socket, Strm); Self.State := (Idle, Ada.Calendar.Clock - 60.0, Self.First_Menu); Self.Send_Hearbeat; -- A reply to this will update display end if; end Stop; ------------ -- Volume -- ------------ procedure Volume (Self : in out Player'Class; Value : Natural) is Audg : Slim.Messages.audg.Audg_Message; begin if Self.State.Kind in Play_Radio | Play_Files then Self.State.Play_State.Volume := Value; Self.State.Play_State.Volume_Set_Time := Ada.Calendar.Clock; end if; Audg.Set_Volume (Value); Write_Message (Self.Socket, Audg); end Volume; ------------------- -- Write_Message -- ------------------- procedure Write_Message (Socket : GNAT.Sockets.Socket_Type; Message : Slim.Messages.Message'Class) is use type Ada.Streams.Stream_Element_Offset; use type Ada.Streams.Stream_Element_Array; Data : League.Stream_Element_Vectors.Stream_Element_Vector; Tag : Slim.Messages.Message_Tag; Raw_Tag : Ada.Streams.Stream_Element_Array (1 .. 4) with Address => Tag'Address; Word : Ada.Streams.Stream_Element_Array (1 .. 2); Length : Ada.Streams.Stream_Element_Offset; Last : Ada.Streams.Stream_Element_Offset; begin Message.Write (Tag, Data); Length := Raw_Tag'Length + Data.Length; Word (1) := Ada.Streams.Stream_Element (Length / Ada.Streams.Stream_Element'Modulus); Word (2) := Ada.Streams.Stream_Element (Length mod Ada.Streams.Stream_Element'Modulus); GNAT.Sockets.Send_Socket (Socket, Word & Raw_Tag & Data.To_Stream_Element_Array, Last); pragma Assert (Last = Length + Word'Length); end Write_Message; end Slim.Players;

32.051916

79

0.580447

2099ca6bbda49d8bffb5cf82e14d038860d9f900

5,236

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c46042a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c46042a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c46042a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C46042A.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 ARRAY CONVERSIONS WHEN THE TARGET TYPE IS A CONSTRAINED -- ARRAY TYPE AND THE OPERAND TYPE HAS BOUNDS THAT DO NOT BELONG TO -- THE BASE TYPE OF THE TARGET TYPE'S INDEX SUBTYPE. -- R.WILLIAMS 9/8/86 WITH REPORT; USE REPORT; PROCEDURE C46042A IS TYPE INT IS RANGE -100 .. 100; TYPE NEWINTEGER IS NEW INTEGER; TYPE DAY IS (SUN, MON, TUE, WED, THU, FRI, SAT); TYPE NDAY1 IS NEW DAY RANGE MON .. FRI; TYPE NDAY2 IS NEW DAY RANGE MON .. FRI; TYPE NNDAY1 IS NEW NDAY1; FUNCTION IDENT (X : INT) RETURN INT IS BEGIN RETURN INT'VAL (IDENT_INT (INT'POS (X))); END IDENT; FUNCTION IDENT (X : NEWINTEGER) RETURN NEWINTEGER IS BEGIN RETURN NEWINTEGER'VAL (IDENT_INT (NEWINTEGER'POS (X))); END IDENT; FUNCTION IDENT (X : NDAY1) RETURN NDAY1 IS BEGIN RETURN NDAY1'VAL (IDENT_INT (NDAY1'POS (X))); END IDENT; FUNCTION IDENT (X : NDAY2) RETURN NDAY2 IS BEGIN RETURN NDAY2'VAL (IDENT_INT (NDAY2'POS (X))); END IDENT; FUNCTION IDENT (X : NNDAY1) RETURN NNDAY1 IS BEGIN RETURN NNDAY1'VAL (IDENT_INT (NNDAY1'POS (X))); END IDENT; BEGIN TEST ( "C46042A", "CHECK ARRAY CONVERSIONS WHEN THE TARGET " & "TYPE IS A CONSTRAINED ARRAY TYPE AND THE " & "OPERAND TYPE HAS BOUNDS THAT DO NOT " & "BELONG TO THE BASE TYPE OF THE TARGET " & "TYPE'S INDEX SUBTYPE" ); DECLARE TYPE UNARR1 IS ARRAY (INTEGER RANGE <>) OF INTEGER; SUBTYPE CONARR1 IS UNARR1 (IDENT_INT (1) .. IDENT_INT (10)); TYPE UNARR2 IS ARRAY (INTEGER RANGE <>, NDAY1 RANGE <>) OF INTEGER; SUBTYPE CONARR2 IS UNARR2 (IDENT_INT (1) .. IDENT_INT (10), IDENT (MON) .. IDENT (TUE)); TYPE ARR1 IS ARRAY (INT RANGE <>) OF INTEGER; A1 : ARR1 (IDENT (11) .. IDENT (20)) := (IDENT (11) .. IDENT (20) => 0); TYPE ARR2 IS ARRAY (INT RANGE <>, NDAY2 RANGE <>) OF INTEGER; A2 : ARR2 (IDENT (11) .. IDENT (20), IDENT (WED) .. IDENT (THU)) := (IDENT (11) .. IDENT (20) => (IDENT (WED) .. IDENT (THU) => 0)); TYPE ARR3 IS ARRAY (NEWINTEGER RANGE <>, NNDAY1 RANGE <>) OF INTEGER; A3 : ARR3 (IDENT (11) .. IDENT (20), IDENT (WED) .. IDENT (THU)) := (IDENT (11) .. IDENT (20) => (IDENT (WED) .. IDENT (THU) => 0)); PROCEDURE CHECK (A : UNARR1) IS BEGIN IF A'FIRST /= 1 OR A'LAST /= 10 THEN FAILED ( "INCORRECT CONVERSION OF UNARR1 (A1)" ); END IF; END CHECK; PROCEDURE CHECK (A : UNARR2; STR : STRING) IS BEGIN IF A'FIRST (1) /= 1 OR A'LAST /= 10 OR A'FIRST (2) /= MON OR A'LAST (2) /= TUE THEN FAILED ( "INCORRECT CONVERSION OF UNARR2 (A" & STR & ")" ); END IF; END CHECK; BEGIN BEGIN CHECK (CONARR1 (A1)); EXCEPTION WHEN OTHERS => FAILED ( "EXCEPTION RAISED BY 'CONARR1 (A1)'" ); END; BEGIN CHECK (CONARR2 (A2), "2"); EXCEPTION WHEN OTHERS => FAILED ( "EXCEPTION RAISED BY 'CONARR2 (A2)'" ); END; BEGIN CHECK (CONARR2 (A3), "3"); EXCEPTION WHEN OTHERS => FAILED ( "EXCEPTION RAISED BY 'CONARR2 (A3)'" ); END; END; RESULT; END C46042A;

35.619048

79

0.519862

23380034625d2f27bee56f9fbd4909bc2011ec0b

1,290

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/a-stfiha.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/a-stfiha.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/a-stfiha.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . S T R I N G S . F I X E D . H A S H -- -- -- -- S p e c -- -- -- -- This specification is adapted 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 Ada.Containers, Ada.Strings.Hash; function Ada.Strings.Fixed.Hash (Key : String) return Containers.Hash_Type renames Ada.Strings.Hash; pragma Pure (Ada.Strings.Fixed.Hash);

58.636364

78

0.328682

0edafde52a1da552a2e47fe8fe16ef9696dae75c

2,552

ads

Ada

src/formatted_output-modular_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

src/formatted_output-modular_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

src/formatted_output-modular_output.ads

VitalijBondarenko/Formatted_Output_NG

91fbdba8b2c720d9769a52f2b2152c14236adaa0

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- Copyright (c) 2016-2021 Vitalii Bondarenko <[email protected]> -- -- -- ------------------------------------------------------------------------------ -- -- -- The MIT License (MIT) -- -- -- -- 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. -- ------------------------------------------------------------------------------ generic type Item_Type is mod <>; package Formatted_Output.Modular_Output is function "&" (Fmt : Format_Type; Value : Item_Type) return Format_Type; -- Replaces leftmost formatting sequence in Fmt with formatted Value image, -- then returns Fmt. Raises exception Format_Error when invalid formatting -- sequence is found or no formatting sequence found at all end Formatted_Output.Modular_Output;

63.8

79

0.476097

205b4d8cef8fb083f881624a61472ddf2a990aea

2,593

adb

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szuzha.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szuzha.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-szuzha.adb

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . S T R I N G S . W I D E _ U N B O U N D E D . W I D E _ H A S H -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with System.String_Hash; function Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash (Key : Unbounded_Wide_Wide_String) return Containers.Hash_Type is use Ada.Containers; function Hash is new System.String_Hash.Hash (Wide_Wide_Character, Wide_Wide_String, Hash_Type); begin return Hash (To_Wide_Wide_String (Key)); end Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash;

63.243902

78

0.369071

20e552fee41898615c1e527c2ae2fc241ac90b43

2,212

adb

Ada

src/latin_utils/latin_utils-inflections_package-prefix_record_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

204

2015-06-12T21:22:55.000Z

2022-03-28T10:50:16.000Z

src/latin_utils/latin_utils-inflections_package-prefix_record_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

98

2015-06-15T22:17:04.000Z

2021-10-01T18:17:55.000Z

src/latin_utils/latin_utils-inflections_package-prefix_record_io.adb

Alex-Vasile/whitakers-words

9fa16606d97842746fea0379839f40c959c53d56

[ "FTL" ]

50

2015-06-16T22:42:24.000Z

2021-12-29T16:53:08.000Z

-- 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 Prefix_Record_IO is --------------------------------------------------------------------------- procedure Get (File : in File_Type; Item : out Prefix_Record) is pragma Unreferenced (File); begin Item := Null_Prefix_Record; end Get; --------------------------------------------------------------------------- procedure Get (Item : out Prefix_Record) is begin Item := Null_Prefix_Record; end Get; --------------------------------------------------------------------------- procedure Put (File : in File_Type; Item : in Prefix_Record) is begin null; end Put; --------------------------------------------------------------------------- procedure Put (Item : in Prefix_Record) is begin null; end Put; --------------------------------------------------------------------------- procedure Get (Source : in String; Target : out Prefix_Record; Last : out Integer ) is begin Target := Null_Prefix_Record; Last := Source'First - 1; end Get; --------------------------------------------------------------------------- procedure Put (Target : out String; Item : in Prefix_Record) is pragma Unreferenced (Item); begin Target := (others => ' '); end Put; --------------------------------------------------------------------------- end Prefix_Record_IO;

29.493333

78

0.507233

2341d2e4f0761258273df385149e2caa76c52793

429,174

adb

Ada

SDSoC_Workspace/bitirme_v4/Release/_sds/vhls/sobel_accel/solution/.autopilot/db/xFSobelFilter3x3.bind.adb

ykpgrr/Lane-Detection-on-FPGA-SW-part-with-SDSoC

6f2ed805ad74cee995162458d516a921bf2b434b

[ "Apache-2.0" ]

1

2020-03-06T07:41:37.000Z

SDSoC_Workspace/bitirme_v4/Release/_sds/vhls/sobel_accel/solution/.autopilot/db/xFSobelFilter3x3.bind.adb

ykpgrr/Lane-Detection-on-FPGA-SW-part-with-SDSoC

6f2ed805ad74cee995162458d516a921bf2b434b

[ "Apache-2.0" ]

null

SDSoC_Workspace/bitirme_v4/Release/_sds/vhls/sobel_accel/solution/.autopilot/db/xFSobelFilter3x3.bind.adb

ykpgrr/Lane-Detection-on-FPGA-SW-part-with-SDSoC

6f2ed805ad74cee995162458d516a921bf2b434b

[ "Apache-2.0" ]

2

2020-10-05T11:06:37.000Z

2021-05-09T08:15:38.000Z

<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <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>xFSobelFilter3x3</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>5</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>p_src_mat_V_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>_src_mat.V.V</originalName> <rtlName></rtlName> <coreName>FIFO</coreName> </Obj> <bitwidth>8</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>p_gradx_mat_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>_gradx_mat.V.V</originalName> <rtlName></rtlName> <coreName>FIFO</coreName> </Obj> <bitwidth>8</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> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>p_grady_mat_V_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>_grady_mat.V.V</originalName> <rtlName></rtlName> <coreName>FIFO</coreName> </Obj> <bitwidth>8</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> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>p_src_mat_rows_read</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>FIFO</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</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>p_src_mat_cols_read</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>FIFO</coreName> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</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>120</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_6"> <Value> <Obj> <type>0</type> <id>9</id> <name>buf_0_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>286</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second class_id="11" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="12" tracking_level="0" version="0"> <first class_id="13" tracking_level="0" version="0"> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>286</second> </item> </second> </item> </inlineStackInfo> <originalName>buf[0].V</originalName> <rtlName></rtlName> <coreName>RAM_S2P_BRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>170</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>10</id> <name>buf_1_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>286</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>286</second> </item> </second> </item> </inlineStackInfo> <originalName>buf[1].V</originalName> <rtlName></rtlName> <coreName>RAM_S2P_BRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>171</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>11</id> <name>buf_2_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>286</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>286</second> </item> </second> </item> </inlineStackInfo> <originalName>buf[2].V</originalName> <rtlName></rtlName> <coreName>RAM_S2P_BRAM</coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>172</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>14</id> <name>p_src_mat_rows_read_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></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>174</item> <item>175</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>15</id> <name>p_src_mat_cols_read_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></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>176</item> <item>177</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp_1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>1474</lineNumber> <contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> </second> </item> </inlineStackInfo> <originalName>img_height</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>178</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>17</id> <name>tmp_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>1474</lineNumber> <contextFuncName>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> </second> </item> </inlineStackInfo> <originalName>img_width</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>179</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>19</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>180</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.76</m_delay> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>21</id> <name>p_1_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>col.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>182</item> <item>183</item> <item>184</item> <item>185</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>22</id> <name>tmp_1_cast_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>186</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>23</id> <name>tmp_2_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>187</item> <item>188</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.42</m_delay> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>24</id> <name>col_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</second> </item> </second> </item> </inlineStackInfo> <originalName>col.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>189</item> <item>191</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.67</m_delay> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>25</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>192</item> <item>193</item> <item>194</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>27</id> <name>tmp_1_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>203</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>32</id> <name>buf_0_V_addr</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>204</item> <item>206</item> <item>207</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>33</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>296</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>296</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>209</item> <item>210</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>34</id> <name>tmp_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>297</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>297</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>212</item> <item>213</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>35</id> <name>buf_1_V_addr</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>214</item> <item>215</item> <item>216</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>36</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>297</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>297</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>217</item> <item>218</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>38</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>292</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>292</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>219</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>40</id> <name>p_5_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> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>195</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>41</id> <name>p_4_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> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>196</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>42</id> <name>p_3_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> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>197</item> </oprand_edges> <opcode>alloca</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>43</id> <name>tmp_5_cast100_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>198</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>44</id> <name>op2_assign</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</second> </item> </second> </item> </inlineStackInfo> <originalName>op2</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>199</item> <item>201</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.07</m_delay> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>45</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</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>202</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.76</m_delay> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>47</id> <name>p_2_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>364</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>364</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>221</item> <item>222</item> <item>223</item> <item>224</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>48</id> <name>p_6_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>row.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>225</item> <item>226</item> <item>227</item> <item>228</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>49</id> <name>tmp_6_cast_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>17</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>229</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>50</id> <name>tmp_7_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</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>230</item> <item>231</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.43</m_delay> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>51</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</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>232</item> <item>233</item> <item>234</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>53</id> <name>p_5_i_i_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>235</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>54</id> <name>p_4_i_i_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>236</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>55</id> <name>p_3_i_i_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>237</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_6_cast99_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</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>238</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>60</id> <name>tmp_8_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>305</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>305</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>239</item> <item>240</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.09</m_delay> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>61</id> <name>tmp_9_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>241</item> <item>242</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.09</m_delay> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>62</id> <name>tmp_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</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>243</item> <item>244</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.09</m_delay> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>63</id> <name>p_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>245</item> <item>247</item> <item>248</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>64</id> <name>p_1_i_i_12</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>249</item> <item>251</item> <item>252</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>65</id> <name>p_2_i_i_13</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>313</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>313</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>253</item> <item>255</item> <item>256</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>66</id> <name>sel_tmp1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>305</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>305</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>257</item> <item>259</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>67</id> <name>sel_tmp2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>260</item> <item>261</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.97</m_delay> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>68</id> <name>sel_tmp</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>262</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>69</id> <name>tmp</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>263</item> <item>264</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.97</m_delay> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>70</id> <name>p_0455_3_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>265</item> <item>266</item> <item>267</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.99</m_delay> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>71</id> <name>sel_tmp4</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>268</item> <item>269</item> <item>270</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>72</id> <name>p_0449_3_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>271</item> <item>272</item> <item>273</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.99</m_delay> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>73</id> <name>sel_tmp8</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>274</item> <item>275</item> <item>276</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>74</id> <name>p_0443_3_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>277</item> <item>278</item> <item>279</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.99</m_delay> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>75</id> <name>tmp_3_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>193</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>193</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>280</item> <item>281</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.42</m_delay> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>76</id> <name>tmp_3</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>364</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>364</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>282</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>77</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>283</item> <item>284</item> <item>671</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>78</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>285</item> <item>286</item> <item>672</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>79</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>309</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>309</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>287</item> <item>288</item> <item>673</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>80</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>289</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.76</m_delay> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>82</id> <name>src_buf3_V_0_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf3[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>290</item> <item>291</item> <item>292</item> <item>293</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>83</id> <name>src_buf2_0_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf2[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>294</item> <item>295</item> <item>296</item> <item>297</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>84</id> <name>src_buf2_V_0_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf2[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>298</item> <item>299</item> <item>300</item> <item>301</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_65"> <Value> <Obj> <type>0</type> <id>85</id> <name>src_buf3_0_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf3[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>302</item> <item>303</item> <item>304</item> <item>305</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>86</id> <name>src_buf1_0_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf1[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>306</item> <item>307</item> <item>308</item> <item>309</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>87</id> <name>src_buf1_V_0_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>src_buf1[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>310</item> <item>311</item> <item>312</item> <item>313</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>88</id> <name>p_0177_0_i_i_i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>col.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>314</item> <item>315</item> <item>316</item> <item>317</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>89</id> <name>tmp_11_cast_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>318</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>90</id> <name>tmp_12_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>319</item> <item>320</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.42</m_delay> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>91</id> <name>col_V_1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>col.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>321</item> <item>322</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.67</m_delay> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>92</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>323</item> <item>324</item> <item>325</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>94</id> <name>tmp_11_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>326</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>99</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>193</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>193</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>327</item> <item>328</item> <item>329</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>101</id> <name>buf_0_V_addr_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>348</item> <item>349</item> <item>350</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>102</id> <name>buf_1_V_addr_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>351</item> <item>352</item> <item>353</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>103</id> <name>buf_2_V_addr_1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>354</item> <item>355</item> <item>356</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>104</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>357</item> <item>358</item> <item>359</item> <item>360</item> <item>361</item> <item>362</item> </oprand_edges> <opcode>switch</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.13</m_delay> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>106</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>463</item> <item>464</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>107</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>465</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>109</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>460</item> <item>461</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>110</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>462</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>112</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>466</item> <item>467</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>113</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>196</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>196</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>468</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>115</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>363</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>117</id> <name>tmp_V_3</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>330</item> <item>331</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>118</id> <name>buf_0_V_addr_1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>332</item> <item>333</item> <item>334</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>119</id> <name>buf_1_V_addr_1</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>335</item> <item>336</item> <item>337</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>120</id> <name>buf_2_V_addr</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>338</item> <item>339</item> <item>340</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>121</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>341</item> <item>342</item> <item>343</item> <item>344</item> <item>345</item> <item>346</item> </oprand_edges> <opcode>switch</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.13</m_delay> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>123</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>454</item> <item>455</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>124</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>456</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>126</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>451</item> <item>452</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>127</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>453</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>129</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>457</item> <item>458</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>130</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>459</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>132</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>194</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>194</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>347</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>134</id> <name>buf_0_V_addr_3</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>364</item> <item>365</item> <item>366</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>135</id> <name>buf_0_V_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>367</item> <item>666</item> <item>669</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>136</id> <name>buf_1_V_addr_3</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>368</item> <item>369</item> <item>370</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>137</id> <name>buf_1_V_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>371</item> <item>665</item> <item>668</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>138</id> <name>buf_2_V_addr_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>10</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>372</item> <item>373</item> <item>374</item> </oprand_edges> <opcode>getelementptr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>139</id> <name>buf_2_V_load</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>375</item> <item>667</item> <item>670</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.25</m_delay> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>140</id> <name>buf0_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>buf0.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>377</item> <item>378</item> <item>379</item> <item>380</item> <item>381</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.77</m_delay> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>141</id> <name>buf1_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>buf1.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>382</item> <item>383</item> <item>384</item> <item>385</item> <item>386</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.77</m_delay> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>142</id> <name>buf2_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>buf2.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>387</item> <item>388</item> <item>389</item> <item>390</item> <item>391</item> </oprand_edges> <opcode>mux</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.77</m_delay> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>143</id> <name>call_ret_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>215</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>215</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>16</bitwidth> </Value> <oprand_edges> <count>9</count> <item_version>0</item_version> <item>393</item> <item>394</item> <item>395</item> <item>396</item> <item>397</item> <item>398</item> <item>399</item> <item>400</item> <item>401</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>144</id> <name>GradientValuesX_0_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>215</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>215</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>GradientValuesX[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>402</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>145</id> <name>GradientValuesY_0_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>215</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>215</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</second> </item> </second> </item> </inlineStackInfo> <originalName>GradientValuesY[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>403</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>146</id> <name>tmp_15_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>218</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>218</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>404</item> <item>405</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.09</m_delay> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>147</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>218</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>218</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>406</item> <item>407</item> <item>408</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>149</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>232</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>232</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>410</item> <item>411</item> <item>412</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>150</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>233</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>233</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>413</item> <item>414</item> <item>415</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_114"> <Value> <Obj> <type>0</type> <id>151</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>416</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_115"> <Value> <Obj> <type>0</type> <id>154</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>189</lineNumber> <contextFuncName>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>ProcessSobel3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>189</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>324</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>417</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_116"> <Value> <Obj> <type>0</type> <id>156</id> <name>GradientValuesX_0_V_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>346</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>346</second> </item> </second> </item> </inlineStackInfo> <originalName>GradientValuesX[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>7</count> <item_version>0</item_version> <item>419</item> <item>420</item> <item>421</item> <item>422</item> <item>423</item> <item>424</item> <item>425</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.91</m_delay> </item> <item class_id_reference="9" object_id="_117"> <Value> <Obj> <type>0</type> <id>157</id> <name>GradientValuesY_0_V_2</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>351</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>351</second> </item> </second> </item> </inlineStackInfo> <originalName>GradientValuesY[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>7</count> <item_version>0</item_version> <item>427</item> <item>428</item> <item>429</item> <item>430</item> <item>431</item> <item>432</item> <item>433</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.91</m_delay> </item> <item class_id_reference="9" object_id="_118"> <Value> <Obj> <type>0</type> <id>158</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>357</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>357</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>434</item> <item>435</item> <item>436</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_119"> <Value> <Obj> <type>0</type> <id>159</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>358</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>358</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>437</item> <item>438</item> <item>439</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>3.63</m_delay> </item> <item class_id_reference="9" object_id="_120"> <Value> <Obj> <type>0</type> <id>160</id> <name>row_ind_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>363</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>363</second> </item> </second> </item> </inlineStackInfo> <originalName>row_ind.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>440</item> <item>441</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.67</m_delay> </item> <item class_id_reference="9" object_id="_121"> <Value> <Obj> <type>0</type> <id>161</id> <name>tmp_14_i_i</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>364</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>364</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>442</item> <item>444</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>2.09</m_delay> </item> <item class_id_reference="9" object_id="_122"> <Value> <Obj> <type>0</type> <id>162</id> <name>p_i_i_15</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>364</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>364</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>445</item> <item>446</item> <item>447</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.69</m_delay> </item> <item class_id_reference="9" object_id="_123"> <Value> <Obj> <type>0</type> <id>164</id> <name>row_V</name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</second> </item> </second> </item> </inlineStackInfo> <originalName>row.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>13</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>448</item> <item>449</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>1.67</m_delay> </item> <item class_id_reference="9" object_id="_124"> <Value> <Obj> <type>0</type> <id>165</id> <name></name> <fileName>C:/xfopencv/include\imgproc/xf_sobel.hpp</fileName> <fileDirectory>C:/Users/yakup/workspace/bitirme_v4/Release</fileDirectory> <lineNumber>302</lineNumber> <contextFuncName>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>C:/Users/yakup/workspace/bitirme_v4/Release</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>Sobel&lt;0, 3, 0, 0, 480, 640, 1&gt;</second> </first> <second>1474</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter&lt;480, 640, 0, 0, 1, 0, 0&gt;</second> </first> <second>1422</second> </item> <item> <first> <first>C:/xfopencv/include\imgproc/xf_sobel.hpp</first> <second>xFSobelFilter3x3&lt;480, 640, 0, 0, 1, 0, 0, 640&gt;</second> </first> <second>302</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>450</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_125"> <Value> <Obj> <type>0</type> <id>167</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> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_delay>0.00</m_delay> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>15</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_126"> <Value> <Obj> <type>2</type> <id>169</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="_127"> <Value> <Obj> <type>2</type> <id>181</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>13</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_128"> <Value> <Obj> <type>2</type> <id>190</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>13</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_129"> <Value> <Obj> <type>2</type> <id>200</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>17</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_130"> <Value> <Obj> <type>2</type> <id>205</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>0</content> </item> <item class_id_reference="16" object_id="_131"> <Value> <Obj> <type>2</type> <id>208</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>8</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_132"> <Value> <Obj> <type>2</type> <id>220</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>13</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_133"> <Value> <Obj> <type>2</type> <id>246</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>2</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_134"> <Value> <Obj> <type>2</type> <id>250</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>2</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_135"> <Value> <Obj> <type>2</type> <id>254</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>2</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_136"> <Value> <Obj> <type>2</type> <id>258</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>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_137"> <Value> <Obj> <type>2</type> <id>392</id> <name>xFSobel3x3_1_0_0_s</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>16</bitwidth> </Value> <const_type>6</const_type> <content><constant:xFSobel3x3<1, 0, 0>></content> </item> <item class_id_reference="16" object_id="_138"> <Value> <Obj> <type>2</type> <id>418</id> <name>xFGradientX3x3_0_0_s</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>8</bitwidth> </Value> <const_type>6</const_type> <content><constant:xFGradientX3x3<0, 0>></content> </item> <item class_id_reference="16" object_id="_139"> <Value> <Obj> <type>2</type> <id>426</id> <name>xFGradientY3x3_0_0_s</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>8</bitwidth> </Value> <const_type>6</const_type> <content><constant:xFGradientY3x3<0, 0>></content> </item> <item class_id_reference="16" object_id="_140"> <Value> <Obj> <type>2</type> <id>443</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>13</bitwidth> </Value> <const_type>0</const_type> <content>3</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_141"> <Obj> <type>3</type> <id>20</id> <name>entry</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>9</item> <item>10</item> <item>11</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>19</item> </node_objs> </item> <item class_id_reference="18" object_id="_142"> <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>5</count> <item_version>0</item_version> <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="_143"> <Obj> <type>3</type> <id>39</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>7</count> <item_version>0</item_version> <item>27</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>38</item> </node_objs> </item> <item class_id_reference="18" object_id="_144"> <Obj> <type>3</type> <id>46</id> <name>.preheader.preheader.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>6</count> <item_version>0</item_version> <item>40</item> <item>41</item> <item>42</item> <item>43</item> <item>44</item> <item>45</item> </node_objs> </item> <item class_id_reference="18" object_id="_145"> <Obj> <type>3</type> <id>52</id> <name>.preheader.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>5</count> <item_version>0</item_version> <item>47</item> <item>48</item> <item>49</item> <item>50</item> <item>51</item> </node_objs> </item> <item class_id_reference="18" object_id="_146"> <Obj> <type>3</type> <id>81</id> <name>_ifconv</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>25</count> <item_version>0</item_version> <item>53</item> <item>54</item> <item>55</item> <item>56</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> </node_objs> </item> <item class_id_reference="18" object_id="_147"> <Obj> <type>3</type> <id>93</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>11</count> <item_version>0</item_version> <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> </node_objs> </item> <item class_id_reference="18" object_id="_148"> <Obj> <type>3</type> <id>100</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>2</count> <item_version>0</item_version> <item>94</item> <item>99</item> </node_objs> </item> <item class_id_reference="18" object_id="_149"> <Obj> <type>3</type> <id>105</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>101</item> <item>102</item> <item>103</item> <item>104</item> </node_objs> </item> <item class_id_reference="18" object_id="_150"> <Obj> <type>3</type> <id>108</id> <name>branch4.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>106</item> <item>107</item> </node_objs> </item> <item class_id_reference="18" object_id="_151"> <Obj> <type>3</type> <id>111</id> <name>branch3.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>109</item> <item>110</item> </node_objs> </item> <item class_id_reference="18" object_id="_152"> <Obj> <type>3</type> <id>114</id> <name>branch5.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>112</item> <item>113</item> </node_objs> </item> <item class_id_reference="18" object_id="_153"> <Obj> <type>3</type> <id>116</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>115</item> </node_objs> </item> <item class_id_reference="18" object_id="_154"> <Obj> <type>3</type> <id>122</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>5</count> <item_version>0</item_version> <item>117</item> <item>118</item> <item>119</item> <item>120</item> <item>121</item> </node_objs> </item> <item class_id_reference="18" object_id="_155"> <Obj> <type>3</type> <id>125</id> <name>branch1.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>123</item> <item>124</item> </node_objs> </item> <item class_id_reference="18" object_id="_156"> <Obj> <type>3</type> <id>128</id> <name>branch0.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>126</item> <item>127</item> </node_objs> </item> <item class_id_reference="18" object_id="_157"> <Obj> <type>3</type> <id>131</id> <name>branch2.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>129</item> <item>130</item> </node_objs> </item> <item class_id_reference="18" object_id="_158"> <Obj> <type>3</type> <id>133</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>132</item> </node_objs> </item> <item class_id_reference="18" object_id="_159"> <Obj> <type>3</type> <id>148</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>14</count> <item_version>0</item_version> <item>134</item> <item>135</item> <item>136</item> <item>137</item> <item>138</item> <item>139</item> <item>140</item> <item>141</item> <item>142</item> <item>143</item> <item>144</item> <item>145</item> <item>146</item> <item>147</item> </node_objs> </item> <item class_id_reference="18" object_id="_160"> <Obj> <type>3</type> <id>152</id> <name>.preheader851.0.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>149</item> <item>150</item> <item>151</item> </node_objs> </item> <item class_id_reference="18" object_id="_161"> <Obj> <type>3</type> <id>155</id> <name>xfPackPixels<1, 0, 0>.exit393.i.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>1</count> <item_version>0</item_version> <item>154</item> </node_objs> </item> <item class_id_reference="18" object_id="_162"> <Obj> <type>3</type> <id>166</id> <name>ProcessSobel3x3<480, 640, 0, 0, 1, 0, 0, 640>.exit.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>9</count> <item_version>0</item_version> <item>156</item> <item>157</item> <item>158</item> <item>159</item> <item>160</item> <item>161</item> <item>162</item> <item>164</item> <item>165</item> </node_objs> </item> <item class_id_reference="18" object_id="_163"> <Obj> <type>3</type> <id>168</id> <name>.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>167</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>310</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_164"> <id>170</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_165"> <id>171</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_166"> <id>172</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_167"> <id>175</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_168"> <id>177</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_169"> <id>178</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_170"> <id>179</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_171"> <id>180</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_172"> <id>182</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_173"> <id>183</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_174"> <id>184</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>21</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_175"> <id>185</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>21</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_176"> <id>186</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_177"> <id>187</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_178"> <id>188</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_179"> <id>189</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_180"> <id>191</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_181"> <id>192</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_182"> <id>193</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_183"> <id>194</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_184"> <id>195</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_185"> <id>196</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_186"> <id>197</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_187"> <id>198</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_188"> <id>199</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_189"> <id>201</id> <edge_type>1</edge_type> <source_obj>200</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_190"> <id>202</id> <edge_type>2</edge_type> <source_obj>52</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_191"> <id>203</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_192"> <id>204</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_193"> <id>206</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_194"> <id>207</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_195"> <id>209</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>210</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>213</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>214</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>215</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>216</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>217</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>218</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>219</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>221</id> <edge_type>1</edge_type> <source_obj>220</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>222</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>223</id> <edge_type>1</edge_type> <source_obj>162</source_obj> <sink_obj>47</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>224</id> <edge_type>2</edge_type> <source_obj>166</source_obj> <sink_obj>47</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>225</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>226</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>227</id> <edge_type>1</edge_type> <source_obj>164</source_obj> <sink_obj>48</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>228</id> <edge_type>2</edge_type> <source_obj>166</source_obj> <sink_obj>48</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>229</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>230</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>231</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>232</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>233</id> <edge_type>2</edge_type> <source_obj>168</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>234</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>235</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_219"> <id>236</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_220"> <id>237</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_221"> <id>238</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_222"> <id>239</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_223"> <id>240</id> <edge_type>1</edge_type> <source_obj>220</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_224"> <id>241</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_225"> <id>242</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_226"> <id>243</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_227"> <id>244</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_228"> <id>245</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_229"> <id>247</id> <edge_type>1</edge_type> <source_obj>246</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_230"> <id>248</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_231"> <id>249</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_232"> <id>251</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_233"> <id>252</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_234"> <id>253</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_235"> <id>255</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_236"> <id>256</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_237"> <id>257</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_238"> <id>259</id> <edge_type>1</edge_type> <source_obj>258</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_239"> <id>260</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_240"> <id>261</id> <edge_type>1</edge_type> <source_obj>66</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_241"> <id>262</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_242"> <id>263</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_243"> <id>264</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_244"> <id>265</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_245"> <id>266</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_246"> <id>267</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_247"> <id>268</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_248"> <id>269</id> <edge_type>1</edge_type> <source_obj>246</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_249"> <id>270</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_250"> <id>271</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_251"> <id>272</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_252"> <id>273</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_253"> <id>274</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_254"> <id>275</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_255"> <id>276</id> <edge_type>1</edge_type> <source_obj>246</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_256"> <id>277</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_257"> <id>278</id> <edge_type>1</edge_type> <source_obj>73</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_258"> <id>279</id> <edge_type>1</edge_type> <source_obj>65</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_259"> <id>280</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_260"> <id>281</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_261"> <id>282</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_262"> <id>283</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_263"> <id>284</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_264"> <id>285</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_265"> <id>286</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_266"> <id>287</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_267"> <id>288</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_268"> <id>289</id> <edge_type>2</edge_type> <source_obj>93</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_269"> <id>290</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_270"> <id>291</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>82</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_271"> <id>292</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>82</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_272"> <id>293</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>82</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_273"> <id>294</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_274"> <id>295</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>83</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_275"> <id>296</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>83</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_276"> <id>297</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>83</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_277"> <id>298</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_278"> <id>299</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>84</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_279"> <id>300</id> <edge_type>1</edge_type> <source_obj>83</source_obj> <sink_obj>84</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_280"> <id>301</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>84</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_281"> <id>302</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_282"> <id>303</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>85</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_283"> <id>304</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>85</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_284"> <id>305</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>85</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_285"> <id>306</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_286"> <id>307</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>86</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_287"> <id>308</id> <edge_type>1</edge_type> <source_obj>140</source_obj> <sink_obj>86</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_288"> <id>309</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>86</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_289"> <id>310</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_290"> <id>311</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>87</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_291"> <id>312</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>87</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_292"> <id>313</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>87</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_293"> <id>314</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_294"> <id>315</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>88</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_295"> <id>316</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>88</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_296"> <id>317</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>88</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_297"> <id>318</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>89</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_298"> <id>319</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_299"> <id>320</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>90</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_300"> <id>321</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>91</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_301"> <id>322</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>91</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_302"> <id>323</id> <edge_type>1</edge_type> <source_obj>90</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_303"> <id>324</id> <edge_type>2</edge_type> <source_obj>166</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_304"> <id>325</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>92</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_305"> <id>326</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>94</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_306"> <id>327</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_307"> <id>328</id> <edge_type>2</edge_type> <source_obj>105</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_308"> <id>329</id> <edge_type>2</edge_type> <source_obj>122</source_obj> <sink_obj>99</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_309"> <id>331</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>117</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_310"> <id>332</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_311"> <id>333</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_312"> <id>334</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>118</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_313"> <id>335</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>119</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_314"> <id>336</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>119</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_315"> <id>337</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>119</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_316"> <id>338</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_317"> <id>339</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_318"> <id>340</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>120</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_319"> <id>341</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_320"> <id>342</id> <edge_type>2</edge_type> <source_obj>131</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_321"> <id>343</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_322"> <id>344</id> <edge_type>2</edge_type> <source_obj>128</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_323"> <id>345</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_324"> <id>346</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>121</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_325"> <id>347</id> <edge_type>2</edge_type> <source_obj>148</source_obj> <sink_obj>132</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_326"> <id>348</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_327"> <id>349</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_328"> <id>350</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>101</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_329"> <id>351</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_330"> <id>352</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_331"> <id>353</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>102</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_332"> <id>354</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_333"> <id>355</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_334"> <id>356</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>103</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_335"> <id>357</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_336"> <id>358</id> <edge_type>2</edge_type> <source_obj>114</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_337"> <id>359</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_338"> <id>360</id> <edge_type>2</edge_type> <source_obj>111</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_339"> <id>361</id> <edge_type>1</edge_type> <source_obj>254</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_340"> <id>362</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>104</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_341"> <id>363</id> <edge_type>2</edge_type> <source_obj>148</source_obj> <sink_obj>115</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_342"> <id>364</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_343"> <id>365</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_344"> <id>366</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_345"> <id>367</id> <edge_type>1</edge_type> <source_obj>134</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_346"> <id>368</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_347"> <id>369</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_348"> <id>370</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_349"> <id>371</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_350"> <id>372</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_351"> <id>373</id> <edge_type>1</edge_type> <source_obj>205</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_352"> <id>374</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_353"> <id>375</id> <edge_type>1</edge_type> <source_obj>138</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_354"> <id>378</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_355"> <id>379</id> <edge_type>1</edge_type> <source_obj>137</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_356"> <id>380</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_357"> <id>381</id> <edge_type>1</edge_type> <source_obj>70</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_358"> <id>383</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_359"> <id>384</id> <edge_type>1</edge_type> <source_obj>137</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_360"> <id>385</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_361"> <id>386</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_362"> <id>388</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_363"> <id>389</id> <edge_type>1</edge_type> <source_obj>137</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_364"> <id>390</id> <edge_type>1</edge_type> <source_obj>139</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_365"> <id>391</id> <edge_type>1</edge_type> <source_obj>74</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_366"> <id>393</id> <edge_type>1</edge_type> <source_obj>392</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_367"> <id>394</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_368"> <id>395</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_369"> <id>396</id> <edge_type>1</edge_type> <source_obj>140</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_370"> <id>397</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_371"> <id>398</id> <edge_type>1</edge_type> <source_obj>141</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_372"> <id>399</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_373"> <id>400</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_374"> <id>401</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>143</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_375"> <id>402</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>144</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_376"> <id>403</id> <edge_type>1</edge_type> <source_obj>143</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_377"> <id>404</id> <edge_type>1</edge_type> <source_obj>88</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_378"> <id>405</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_379"> <id>406</id> <edge_type>1</edge_type> <source_obj>146</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_380"> <id>407</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_381"> <id>408</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_382"> <id>411</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_383"> <id>412</id> <edge_type>1</edge_type> <source_obj>144</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_384"> <id>414</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_385"> <id>415</id> <edge_type>1</edge_type> <source_obj>145</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_386"> <id>416</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>151</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_387"> <id>417</id> <edge_type>2</edge_type> <source_obj>93</source_obj> <sink_obj>154</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_388"> <id>419</id> <edge_type>1</edge_type> <source_obj>418</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_389"> <id>420</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_390"> <id>421</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_391"> <id>422</id> <edge_type>1</edge_type> <source_obj>84</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_392"> <id>423</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_393"> <id>424</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_394"> <id>425</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_395"> <id>427</id> <edge_type>1</edge_type> <source_obj>426</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_396"> <id>428</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_397"> <id>429</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_398"> <id>430</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_399"> <id>431</id> <edge_type>1</edge_type> <source_obj>82</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_400"> <id>432</id> <edge_type>1</edge_type> <source_obj>85</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_401"> <id>433</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_402"> <id>435</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_403"> <id>436</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_404"> <id>438</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_405"> <id>439</id> <edge_type>1</edge_type> <source_obj>157</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_406"> <id>440</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_407"> <id>441</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>160</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_408"> <id>442</id> <edge_type>1</edge_type> <source_obj>160</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_409"> <id>444</id> <edge_type>1</edge_type> <source_obj>443</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_410"> <id>445</id> <edge_type>1</edge_type> <source_obj>161</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_411"> <id>446</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_412"> <id>447</id> <edge_type>1</edge_type> <source_obj>160</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_413"> <id>448</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_414"> <id>449</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>164</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_415"> <id>450</id> <edge_type>2</edge_type> <source_obj>52</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_416"> <id>451</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>126</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_417"> <id>452</id> <edge_type>1</edge_type> <source_obj>118</source_obj> <sink_obj>126</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_418"> <id>453</id> <edge_type>2</edge_type> <source_obj>133</source_obj> <sink_obj>127</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_419"> <id>454</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_420"> <id>455</id> <edge_type>1</edge_type> <source_obj>119</source_obj> <sink_obj>123</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_421"> <id>456</id> <edge_type>2</edge_type> <source_obj>133</source_obj> <sink_obj>124</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_422"> <id>457</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_423"> <id>458</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>129</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_424"> <id>459</id> <edge_type>2</edge_type> <source_obj>133</source_obj> <sink_obj>130</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_425"> <id>460</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_426"> <id>461</id> <edge_type>1</edge_type> <source_obj>101</source_obj> <sink_obj>109</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_427"> <id>462</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>110</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_428"> <id>463</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>106</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_429"> <id>464</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>106</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_430"> <id>465</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>107</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_431"> <id>466</id> <edge_type>1</edge_type> <source_obj>208</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_432"> <id>467</id> <edge_type>1</edge_type> <source_obj>103</source_obj> <sink_obj>112</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_433"> <id>468</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>113</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_434"> <id>633</id> <edge_type>2</edge_type> <source_obj>20</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_435"> <id>634</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_436"> <id>635</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_437"> <id>636</id> <edge_type>2</edge_type> <source_obj>39</source_obj> <sink_obj>26</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_438"> <id>637</id> <edge_type>2</edge_type> <source_obj>46</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_439"> <id>638</id> <edge_type>2</edge_type> <source_obj>52</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_440"> <id>639</id> <edge_type>2</edge_type> <source_obj>52</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_441"> <id>640</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>93</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_442"> <id>641</id> <edge_type>2</edge_type> <source_obj>93</source_obj> <sink_obj>100</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_443"> <id>642</id> <edge_type>2</edge_type> <source_obj>93</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_444"> <id>643</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>122</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_445"> <id>644</id> <edge_type>2</edge_type> <source_obj>100</source_obj> <sink_obj>105</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_446"> <id>645</id> <edge_type>2</edge_type> <source_obj>105</source_obj> <sink_obj>114</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_447"> <id>646</id> <edge_type>2</edge_type> <source_obj>105</source_obj> <sink_obj>111</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_448"> <id>647</id> <edge_type>2</edge_type> <source_obj>105</source_obj> <sink_obj>108</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_449"> <id>648</id> <edge_type>2</edge_type> <source_obj>108</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_450"> <id>649</id> <edge_type>2</edge_type> <source_obj>111</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_451"> <id>650</id> <edge_type>2</edge_type> <source_obj>114</source_obj> <sink_obj>116</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_452"> <id>651</id> <edge_type>2</edge_type> <source_obj>116</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_453"> <id>652</id> <edge_type>2</edge_type> <source_obj>122</source_obj> <sink_obj>131</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_454"> <id>653</id> <edge_type>2</edge_type> <source_obj>122</source_obj> <sink_obj>128</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_455"> <id>654</id> <edge_type>2</edge_type> <source_obj>122</source_obj> <sink_obj>125</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_456"> <id>655</id> <edge_type>2</edge_type> <source_obj>125</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_457"> <id>656</id> <edge_type>2</edge_type> <source_obj>128</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_458"> <id>657</id> <edge_type>2</edge_type> <source_obj>131</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_459"> <id>658</id> <edge_type>2</edge_type> <source_obj>133</source_obj> <sink_obj>148</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_460"> <id>659</id> <edge_type>2</edge_type> <source_obj>148</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_461"> <id>660</id> <edge_type>2</edge_type> <source_obj>148</source_obj> <sink_obj>152</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_462"> <id>661</id> <edge_type>2</edge_type> <source_obj>152</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_463"> <id>662</id> <edge_type>2</edge_type> <source_obj>155</source_obj> <sink_obj>93</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_464"> <id>663</id> <edge_type>2</edge_type> <source_obj>166</source_obj> <sink_obj>52</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_465"> <id>665</id> <edge_type>4</edge_type> <source_obj>106</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_466"> <id>666</id> <edge_type>4</edge_type> <source_obj>109</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_467"> <id>667</id> <edge_type>4</edge_type> <source_obj>112</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_468"> <id>668</id> <edge_type>4</edge_type> <source_obj>123</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_469"> <id>669</id> <edge_type>4</edge_type> <source_obj>126</source_obj> <sink_obj>135</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_470"> <id>670</id> <edge_type>4</edge_type> <source_obj>129</source_obj> <sink_obj>139</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_471"> <id>671</id> <edge_type>4</edge_type> <source_obj>55</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_472"> <id>672</id> <edge_type>4</edge_type> <source_obj>54</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_473"> <id>673</id> <edge_type>4</edge_type> <source_obj>53</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>9</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_474"> <mId>1</mId> <mTag>xFSobelFilter3x3</mTag> <mType>0</mType> <sub_regions> <count>5</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> <item>5</item> <item>9</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>312163</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_475"> <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>20</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="_476"> <mId>3</mId> <mTag>Clear_Row_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>39</item> </basic_blocks> <mII>1</mII> <mDepth>2</mDepth> <mMinTripCount>640</mMinTripCount> <mMaxTripCount>640</mMaxTripCount> <mMinLatency>640</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_477"> <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>1</count> <item_version>0</item_version> <item>46</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="_478"> <mId>5</mId> <mTag>Row_Loop</mTag> <mType>1</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>6</item> <item>7</item> <item>8</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>480</mMinTripCount> <mMaxTripCount>480</mMaxTripCount> <mMinLatency>311520</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_479"> <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>2</count> <item_version>0</item_version> <item>52</item> <item>81</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="_480"> <mId>7</mId> <mTag>Col_Loop</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>15</count> <item_version>0</item_version> <item>93</item> <item>100</item> <item>105</item> <item>108</item> <item>111</item> <item>114</item> <item>116</item> <item>122</item> <item>125</item> <item>128</item> <item>131</item> <item>133</item> <item>148</item> <item>152</item> <item>155</item> </basic_blocks> <mII>1</mII> <mDepth>6</mDepth> <mMinTripCount>640</mMinTripCount> <mMaxTripCount>640</mMaxTripCount> <mMinLatency>644</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_481"> <mId>8</mId> <mTag>Region 3</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>166</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_482"> <mId>9</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>168</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="_483"> <states class_id="25" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_484"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_485"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_486"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_487"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_488"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_489"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_490"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_491"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_492"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_493"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_494"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_495"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_496"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_497"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_498"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_499"> <id>2</id> <operations> <count>5</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_500"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_501"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_502"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_503"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_504"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_505"> <id>3</id> <operations> <count>12</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_506"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_507"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_508"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_509"> <id>30</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_510"> <id>31</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_511"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_512"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_513"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_514"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_515"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_516"> <id>37</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_517"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_518"> <id>4</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_519"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_520"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_521"> <id>42</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_522"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_523"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_524"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_525"> <id>5</id> <operations> <count>34</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_526"> <id>47</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_527"> <id>48</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_528"> <id>49</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_529"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_530"> <id>51</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_531"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_532"> <id>54</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_533"> <id>55</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_534"> <id>56</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_535"> <id>57</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_536"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_537"> <id>59</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_538"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_539"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_540"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_541"> <id>63</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_542"> <id>64</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_543"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_544"> <id>66</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_545"> <id>67</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_546"> <id>68</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_547"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_548"> <id>70</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_549"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_550"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_551"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_552"> <id>74</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_553"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_554"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_555"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_556"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_557"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_558"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_559"> <id>167</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_560"> <id>6</id> <operations> <count>8</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_561"> <id>88</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_562"> <id>89</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_563"> <id>90</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_564"> <id>91</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_565"> <id>99</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_566"> <id>115</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_567"> <id>121</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_568"> <id>132</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_569"> <id>7</id> <operations> <count>23</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_570"> <id>94</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_571"> <id>101</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_572"> <id>102</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_573"> <id>103</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_574"> <id>104</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_575"> <id>106</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_576"> <id>107</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_577"> <id>109</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_578"> <id>110</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_579"> <id>112</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_580"> <id>113</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_581"> <id>117</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_582"> <id>118</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_583"> <id>119</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_584"> <id>120</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_585"> <id>123</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_586"> <id>124</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_587"> <id>126</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_588"> <id>127</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_589"> <id>129</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_590"> <id>130</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_591"> <id>146</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_592"> <id>147</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_593"> <id>8</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_594"> <id>134</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_595"> <id>135</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_596"> <id>136</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_597"> <id>137</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_598"> <id>138</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_599"> <id>139</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_600"> <id>9</id> <operations> <count>14</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_601"> <id>82</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_602"> <id>83</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_603"> <id>84</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_604"> <id>85</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_605"> <id>86</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_606"> <id>87</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_607"> <id>92</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_608"> <id>135</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_609"> <id>137</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_610"> <id>139</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_611"> <id>140</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_612"> <id>141</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_613"> <id>142</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_614"> <id>143</id> <stage>2</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_615"> <id>10</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_616"> <id>143</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_617"> <id>144</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_618"> <id>145</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_619"> <id>11</id> <operations> <count>9</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_620"> <id>95</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_621"> <id>96</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_622"> <id>97</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_623"> <id>98</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_624"> <id>149</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_625"> <id>150</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_626"> <id>151</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_627"> <id>153</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_628"> <id>154</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_629"> <id>12</id> <operations> <count>6</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_630"> <id>156</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_631"> <id>157</id> <stage>2</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_632"> <id>160</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_633"> <id>161</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_634"> <id>162</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_635"> <id>164</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_636"> <id>13</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_637"> <id>156</id> <stage>1</stage> <latency>2</latency> </item> <item class_id_reference="28" object_id="_638"> <id>157</id> <stage>1</stage> <latency>2</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_639"> <id>14</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_640"> <id>158</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_641"> <id>159</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_642"> <id>163</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_643"> <id>165</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>16</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_644"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>115</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="_645"> <inState>4</inState> <outState>5</outState> <condition> <id>122</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="_646"> <inState>5</inState> <outState>6</outState> <condition> <id>124</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>50</first> <second>0</second> </first> <second>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_647"> <inState>12</inState> <outState>13</outState> <condition> <id>145</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="_648"> <inState>13</inState> <outState>14</outState> <condition> <id>146</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="_649"> <inState>14</inState> <outState>5</outState> <condition> <id>148</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="_650"> <inState>3</inState> <outState>2</outState> <condition> <id>150</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="_651"> <inState>2</inState> <outState>4</outState> <condition> <id>149</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> <item class_id_reference="30" object_id="_652"> <inState>2</inState> <outState>3</outState> <condition> <id>151</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>0</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_653"> <inState>6</inState> <outState>7</outState> <condition> <id>152</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="_654"> <inState>7</inState> <outState>8</outState> <condition> <id>153</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="_655"> <inState>8</inState> <outState>9</outState> <condition> <id>154</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="_656"> <inState>10</inState> <outState>11</outState> <condition> <id>156</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="_657"> <inState>11</inState> <outState>6</outState> <condition> <id>157</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="_658"> <inState>9</inState> <outState>12</outState> <condition> <id>155</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>90</first> <second>0</second> </first> <second>1</second> </item> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_659"> <inState>9</inState> <outState>10</outState> <condition> <id>158</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>1</count> <item_version>0</item_version> <item> <first> <first>90</first> <second>0</second> </first> <second>0</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>120</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>9</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>10</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>11</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>15</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</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>27</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>65</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>3</first> <second>0</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>3</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>82</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>83</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>84</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>85</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>86</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>87</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>88</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>89</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>90</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>91</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>92</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>94</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>99</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>101</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>102</first> <second> <first>5</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>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>109</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>110</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>112</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>113</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>115</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>117</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>118</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>119</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>120</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>121</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>123</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>124</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>126</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>127</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>129</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>130</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>132</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>134</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>135</first> <second> <first>6</first> <second>1</second> </second> </item> <item> <first>136</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>137</first> <second> <first>6</first> <second>1</second> </second> </item> <item> <first>138</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>139</first> <second> <first>6</first> <second>1</second> </second> </item> <item> <first>140</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>141</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>142</first> <second> <first>7</first> <second>0</second> </second> </item> <item> <first>143</first> <second> <first>7</first> <second>1</second> </second> </item> <item> <first>144</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>145</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>146</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>147</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>149</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>150</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>151</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>154</first> <second> <first>9</first> <second>0</second> </second> </item> <item> <first>156</first> <second> <first>8</first> <second>1</second> </second> </item> <item> <first>157</first> <second> <first>8</first> <second>1</second> </second> </item> <item> <first>158</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>159</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>160</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>161</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>162</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>164</first> <second> <first>8</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>10</first> <second>0</second> </second> </item> <item> <first>167</first> <second> <first>3</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>20</first> <second class_id="42" 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>39</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>46</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>52</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>81</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>93</first> <second> <first>4</first> <second>7</second> </second> </item> <item> <first>100</first> <second> <first>4</first> <second>9</second> </second> </item> <item> <first>105</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>108</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>111</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>114</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>116</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>122</first> <second> <first>4</first> <second>5</second> </second> </item> <item> <first>125</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>128</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>131</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>133</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>148</first> <second> <first>5</first> <second>8</second> </second> </item> <item> <first>152</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>155</first> <second> <first>9</first> <second>9</second> </second> </item> <item> <first>166</first> <second> <first>8</first> <second>10</second> </second> </item> <item> <first>168</first> <second> <first>3</first> <second>3</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="44" tracking_level="1" version="0" object_id="_660"> <region_name>Clear_Row_Loop</region_name> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>26</item> <item>39</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> <item class_id_reference="44" object_id="_661"> <region_name>Col_Loop</region_name> <basic_blocks> <count>15</count> <item_version>0</item_version> <item>93</item> <item>100</item> <item>105</item> <item>108</item> <item>111</item> <item>114</item> <item>116</item> <item>122</item> <item>125</item> <item>128</item> <item>131</item> <item>133</item> <item>148</item> <item>152</item> <item>155</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>6</pipe_depth> </item> </regions> <dp_fu_nodes class_id="45" tracking_level="0" version="0"> <count>86</count> <item_version>0</item_version> <item class_id="46" tracking_level="0" version="0"> <first>84</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>92</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>96</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>100</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>104</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>108</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>114</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>120</first> <second> <count>2</count> <item_version>0</item_version> <item>34</item> <item>117</item> </second> </item> <item> <first>126</first> <second> <count>2</count> <item_version>0</item_version> <item>149</item> <item>158</item> </second> </item> <item> <first>133</first> <second> <count>2</count> <item_version>0</item_version> <item>150</item> <item>159</item> </second> </item> <item> <first>140</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>146</first> <second> <count>5</count> <item_version>0</item_version> <item>33</item> <item>109</item> <item>126</item> <item>135</item> <item>135</item> </second> </item> <item> <first>155</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>161</first> <second> <count>5</count> <item_version>0</item_version> <item>36</item> <item>106</item> <item>123</item> <item>137</item> <item>137</item> </second> </item> <item> <first>170</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>176</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>182</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>191</first> <second> <count>4</count> <item_version>0</item_version> <item>112</item> <item>129</item> <item>139</item> <item>139</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>206</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>212</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>223</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>230</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>237</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>248</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>260</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>272</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>284</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>296</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>308</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>320</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>334</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>346</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>358</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>367</first> <second> <count>2</count> <item_version>0</item_version> <item>143</item> <item>143</item> </second> </item> <item> <first>384</first> <second> <count>2</count> <item_version>0</item_version> <item>156</item> <item>156</item> </second> </item> <item> <first>400</first> <second> <count>2</count> <item_version>0</item_version> <item>157</item> <item>157</item> </second> </item> <item> <first>416</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>420</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>424</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>428</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>433</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>439</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>445</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>448</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>454</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>458</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>463</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>466</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>469</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>472</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>476</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>482</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>488</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>494</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>502</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>510</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>518</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>524</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>530</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>534</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>540</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>548</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>556</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>564</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>572</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>580</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>585</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>589</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>594</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>599</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>604</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>608</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>613</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>619</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>629</first> <second> <count>1</count> <item_version>0</item_version> <item>146</item> </second> </item> <item> <first>635</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>647</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>659</first> <second> <count>1</count> <item_version>0</item_version> <item>142</item> </second> </item> <item> <first>671</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>675</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>679</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>685</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>691</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>699</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="48" tracking_level="0" version="0"> <count>69</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first>GradientValuesX_0_V_fu_671</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>GradientValuesY_0_V_fu_675</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>buf0_V_fu_635</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>buf1_V_fu_647</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>buf2_V_fu_659</first> <second> <count>1</count> <item_version>0</item_version> <item>142</item> </second> </item> <item> <first>buf_0_V_addr_1_gep_fu_200</first> <second> <count>1</count> <item_version>0</item_version> <item>118</item> </second> </item> <item> <first>buf_0_V_addr_2_gep_fu_170</first> <second> <count>1</count> <item_version>0</item_version> <item>101</item> </second> </item> <item> <first>buf_0_V_addr_3_gep_fu_223</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>buf_0_V_addr_gep_fu_140</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>buf_0_V_alloca_fu_84</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>buf_1_V_addr_1_gep_fu_206</first> <second> <count>1</count> <item_version>0</item_version> <item>119</item> </second> </item> <item> <first>buf_1_V_addr_2_gep_fu_176</first> <second> <count>1</count> <item_version>0</item_version> <item>102</item> </second> </item> <item> <first>buf_1_V_addr_3_gep_fu_230</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>buf_1_V_addr_gep_fu_155</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>buf_1_V_alloca_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>buf_2_V_addr_1_gep_fu_182</first> <second> <count>1</count> <item_version>0</item_version> <item>103</item> </second> </item> <item> <first>buf_2_V_addr_2_gep_fu_237</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>buf_2_V_addr_gep_fu_212</first> <second> <count>1</count> <item_version>0</item_version> <item>120</item> </second> </item> <item> <first>buf_2_V_alloca_fu_92</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>col_V_1_fu_613</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>col_V_fu_433</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>op2_assign_fu_448</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>p_0177_0_i_i_i_phi_fu_284</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>p_0443_3_i_i_fu_572</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>p_0449_3_i_i_fu_556</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>p_0455_3_i_i_fu_540</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>p_1_i_i_12_fu_502</first> <second> <count>1</count> <item_version>0</item_version> <item>64</item> </second> </item> <item> <first>p_1_i_i_phi_fu_248</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_2_i_i_13_fu_510</first> <second> <count>1</count> <item_version>0</item_version> <item>65</item> </second> </item> <item> <first>p_2_i_i_phi_fu_260</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_3_i_i_fu_104</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>p_4_i_i_fu_100</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>p_5_i_i_fu_96</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>p_6_i_i_phi_fu_272</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>p_i_i_15_fu_691</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>p_i_i_fu_494</first> <second> <count>1</count> <item_version>0</item_version> <item>63</item> </second> </item> <item> <first>row_V_fu_699</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>row_ind_V_fu_679</first> <second> <count>1</count> <item_version>0</item_version> <item>160</item> </second> </item> <item> <first>sel_tmp1_fu_518</first> <second> <count>1</count> <item_version>0</item_version> <item>66</item> </second> </item> <item> <first>sel_tmp2_fu_524</first> <second> <count>1</count> <item_version>0</item_version> <item>67</item> </second> </item> <item> <first>sel_tmp4_fu_548</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>sel_tmp8_fu_564</first> <second> <count>1</count> <item_version>0</item_version> <item>73</item> </second> </item> <item> <first>sel_tmp_fu_530</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>src_buf1_0_V_phi_fu_346</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>src_buf1_V_0_i_i_phi_fu_358</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>src_buf2_0_V_phi_fu_308</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>src_buf2_V_0_i_i_phi_fu_320</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>src_buf3_0_V_phi_fu_334</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>src_buf3_V_0_i_i_phi_fu_296</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>tmp_11_cast_i_i_fu_604</first> <second> <count>1</count> <item_version>0</item_version> <item>89</item> </second> </item> <item> <first>tmp_11_i_i_fu_619</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>tmp_12_i_i_fu_608</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>tmp_14_i_i_fu_685</first> <second> <count>1</count> <item_version>0</item_version> <item>161</item> </second> </item> <item> <first>tmp_15_i_i_fu_629</first> <second> <count>1</count> <item_version>0</item_version> <item>146</item> </second> </item> <item> <first>tmp_1_cast_i_i_fu_424</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>tmp_1_fu_416</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_1_i_i_fu_439</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>tmp_2_fu_420</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_2_i_i_fu_428</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>tmp_3_fu_585</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>tmp_3_i_i_fu_580</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>tmp_5_cast100_i_i_fu_445</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>tmp_6_cast99_i_i_fu_472</first> <second> <count>1</count> <item_version>0</item_version> <item>56</item> </second> </item> <item> <first>tmp_6_cast_i_i_fu_454</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>tmp_7_i_i_fu_458</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>tmp_8_i_i_fu_476</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>tmp_9_i_i_fu_482</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>tmp_fu_534</first> <second> <count>1</count> <item_version>0</item_version> <item>69</item> </second> </item> <item> <first>tmp_i_i_fu_488</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>3</count> <item_version>0</item_version> <item> <first>grp_xFGradientX3x3_0_0_s_fu_384</first> <second> <count>2</count> <item_version>0</item_version> <item>156</item> <item>156</item> </second> </item> <item> <first>grp_xFGradientY3x3_0_0_s_fu_400</first> <second> <count>2</count> <item_version>0</item_version> <item>157</item> <item>157</item> </second> </item> <item> <first>grp_xFSobel3x3_1_0_0_s_fu_367</first> <second> <count>2</count> <item_version>0</item_version> <item>143</item> <item>143</item> </second> </item> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>11</count> <item_version>0</item_version> <item> <first>StgValue_81_store_fu_589</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>StgValue_82_store_fu_594</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>StgValue_83_store_fu_599</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>grp_read_fu_120</first> <second> <count>2</count> <item_version>0</item_version> <item>34</item> <item>117</item> </second> </item> <item> <first>grp_write_fu_126</first> <second> <count>2</count> <item_version>0</item_version> <item>149</item> <item>158</item> </second> </item> <item> <first>grp_write_fu_133</first> <second> <count>2</count> <item_version>0</item_version> <item>150</item> <item>159</item> </second> </item> <item> <first>p_3_i_i_load_load_fu_469</first> <second> <count>1</count> <item_version>0</item_version> <item>55</item> </second> </item> <item> <first>p_4_i_i_load_load_fu_466</first> <second> <count>1</count> <item_version>0</item_version> <item>54</item> </second> </item> <item> <first>p_5_i_i_load_load_fu_463</first> <second> <count>1</count> <item_version>0</item_version> <item>53</item> </second> </item> <item> <first>p_src_mat_cols_read_1_read_fu_114</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>p_src_mat_rows_read_1_read_fu_108</first> <second> <count>1</count> <item_version>0</item_version> <item>14</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>6</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first class_id="52" tracking_level="0" version="0"> <first>buf_0_V</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>135</item> <item>135</item> </second> </item> <item> <first> <first>buf_0_V</first> <second>1</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>33</item> <item>109</item> <item>126</item> </second> </item> <item> <first> <first>buf_1_V</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>137</item> <item>137</item> </second> </item> <item> <first> <first>buf_1_V</first> <second>1</second> </first> <second> <count>3</count> <item_version>0</item_version> <item>36</item> <item>106</item> <item>123</item> </second> </item> <item> <first> <first>buf_2_V</first> <second>0</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>139</item> <item>139</item> </second> </item> <item> <first> <first>buf_2_V</first> <second>1</second> </first> <second> <count>2</count> <item_version>0</item_version> <item>112</item> <item>129</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>40</count> <item_version>0</item_version> <item> <first>244</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>268</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>280</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>292</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>304</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>316</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>329</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>342</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>354</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>705</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>711</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>717</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>721</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>726</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>732</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>738</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>744</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>749</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> <item> <first>753</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>758</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>763</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>768</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>772</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>776</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>780</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>785</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>792</first> <second> <count>1</count> <item_version>0</item_version> <item>146</item> </second> </item> <item> <first>796</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>801</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>806</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>811</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>817</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>823</first> <second> <count>1</count> <item_version>0</item_version> <item>142</item> </second> </item> <item> <first>829</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>834</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>839</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>844</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>849</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>854</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>40</count> <item_version>0</item_version> <item> <first>GradientValuesX_0_V_2_reg_849</first> <second> <count>1</count> <item_version>0</item_version> <item>156</item> </second> </item> <item> <first>GradientValuesX_0_V_reg_829</first> <second> <count>1</count> <item_version>0</item_version> <item>144</item> </second> </item> <item> <first>GradientValuesY_0_V_2_reg_854</first> <second> <count>1</count> <item_version>0</item_version> <item>157</item> </second> </item> <item> <first>GradientValuesY_0_V_reg_834</first> <second> <count>1</count> <item_version>0</item_version> <item>145</item> </second> </item> <item> <first>buf0_V_reg_811</first> <second> <count>1</count> <item_version>0</item_version> <item>140</item> </second> </item> <item> <first>buf1_V_reg_817</first> <second> <count>1</count> <item_version>0</item_version> <item>141</item> </second> </item> <item> <first>buf2_V_reg_823</first> <second> <count>1</count> <item_version>0</item_version> <item>142</item> </second> </item> <item> <first>buf_0_V_addr_3_reg_796</first> <second> <count>1</count> <item_version>0</item_version> <item>134</item> </second> </item> <item> <first>buf_1_V_addr_3_reg_801</first> <second> <count>1</count> <item_version>0</item_version> <item>136</item> </second> </item> <item> <first>buf_2_V_addr_2_reg_806</first> <second> <count>1</count> <item_version>0</item_version> <item>138</item> </second> </item> <item> <first>col_V_1_reg_780</first> <second> <count>1</count> <item_version>0</item_version> <item>91</item> </second> </item> <item> <first>col_V_reg_721</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>op2_assign_reg_744</first> <second> <count>1</count> <item_version>0</item_version> <item>44</item> </second> </item> <item> <first>p_0177_0_i_i_i_reg_280</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>p_0443_3_i_i_reg_763</first> <second> <count>1</count> <item_version>0</item_version> <item>74</item> </second> </item> <item> <first>p_0449_3_i_i_reg_758</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>p_0455_3_i_i_reg_753</first> <second> <count>1</count> <item_version>0</item_version> <item>70</item> </second> </item> <item> <first>p_1_i_i_reg_244</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_2_i_i_reg_256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_3_i_i_reg_738</first> <second> <count>1</count> <item_version>0</item_version> <item>42</item> </second> </item> <item> <first>p_4_i_i_reg_732</first> <second> <count>1</count> <item_version>0</item_version> <item>41</item> </second> </item> <item> <first>p_5_i_i_reg_726</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>p_6_i_i_reg_268</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>p_i_i_15_reg_839</first> <second> <count>1</count> <item_version>0</item_version> <item>162</item> </second> </item> <item> <first>row_V_reg_844</first> <second> <count>1</count> <item_version>0</item_version> <item>164</item> </second> </item> <item> <first>src_buf1_0_V_reg_342</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>src_buf1_V_0_i_i_reg_354</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>src_buf2_0_V_reg_304</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>src_buf2_V_0_i_i_reg_316</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>src_buf3_0_V_reg_329</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>src_buf3_V_0_i_i_reg_292</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>tmp_11_i_i_reg_785</first> <second> <count>1</count> <item_version>0</item_version> <item>94</item> </second> </item> <item> <first>tmp_12_i_i_reg_776</first> <second> <count>1</count> <item_version>0</item_version> <item>90</item> </second> </item> <item> <first>tmp_15_i_i_reg_792</first> <second> <count>1</count> <item_version>0</item_version> <item>146</item> </second> </item> <item> <first>tmp_1_reg_705</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_2_i_i_reg_717</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>tmp_2_reg_711</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>tmp_3_i_i_reg_768</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>tmp_3_reg_772</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>tmp_7_i_i_reg_749</first> <second> <count>1</count> <item_version>0</item_version> <item>50</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>10</count> <item_version>0</item_version> <item> <first>244</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>268</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>280</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>292</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> <item> <first>304</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>316</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>329</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>342</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>354</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>10</count> <item_version>0</item_version> <item> <first>p_0177_0_i_i_i_reg_280</first> <second> <count>1</count> <item_version>0</item_version> <item>88</item> </second> </item> <item> <first>p_1_i_i_reg_244</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_2_i_i_reg_256</first> <second> <count>1</count> <item_version>0</item_version> <item>47</item> </second> </item> <item> <first>p_6_i_i_reg_268</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>src_buf1_0_V_reg_342</first> <second> <count>1</count> <item_version>0</item_version> <item>86</item> </second> </item> <item> <first>src_buf1_V_0_i_i_reg_354</first> <second> <count>1</count> <item_version>0</item_version> <item>87</item> </second> </item> <item> <first>src_buf2_0_V_reg_304</first> <second> <count>1</count> <item_version>0</item_version> <item>83</item> </second> </item> <item> <first>src_buf2_V_0_i_i_reg_316</first> <second> <count>1</count> <item_version>0</item_version> <item>84</item> </second> </item> <item> <first>src_buf3_0_V_reg_329</first> <second> <count>1</count> <item_version>0</item_version> <item>85</item> </second> </item> <item> <first>src_buf3_V_0_i_i_reg_292</first> <second> <count>1</count> <item_version>0</item_version> <item>82</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="53" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="54" tracking_level="0" version="0"> <first>p_gradx_mat_V_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>2</count> <item_version>0</item_version> <item>149</item> <item>158</item> </second> </item> </second> </item> <item> <first>p_grady_mat_V_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>write</first> <second> <count>2</count> <item_version>0</item_version> <item>150</item> <item>159</item> </second> </item> </second> </item> <item> <first>p_src_mat_V_V</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>2</count> <item_version>0</item_version> <item>34</item> <item>117</item> </second> </item> </second> </item> <item> <first>p_src_mat_cols_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> </second> </item> <item> <first>p_src_mat_rows_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="55" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="56" tracking_level="0" version="0"> <first>1</first> <second>FIFO</second> </item> <item> <first>2</first> <second>FIFO</second> </item> <item> <first>3</first> <second>FIFO</second> </item> <item> <first>4</first> <second>FIFO</second> </item> <item> <first>5</first> <second>FIFO</second> </item> </port2core> <node2core> <count>3</count> <item_version>0</item_version> <item> <first>9</first> <second>RAM_S2P_BRAM</second> </item> <item> <first>10</first> <second>RAM_S2P_BRAM</second> </item> <item> <first>11</first> <second>RAM_S2P_BRAM</second> </item> </node2core> </syndb> </boost_serialization>

28.461702

102

0.558613

0e1960cfca933b8282ea024385b0832e5f08c916

24,799

ads

Ada

stm32f0/stm32f072x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

1

2021-04-06T07:57:56.000Z

stm32f0/stm32f072x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

null

stm32f0/stm32f072x/svd/stm32_svd-usart.ads

ekoeppen/STM32_Generic_Ada_Drivers

4ff29c3026c4b24280baf22a5b81ea9969375466

[ "MIT" ]

2

2018-05-29T13:59:31.000Z

2019-02-03T19:48:08.000Z

-- This spec has been automatically generated from STM32F072x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.USART is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR1_UE_Field is STM32_SVD.Bit; subtype CR1_UESM_Field is STM32_SVD.Bit; subtype CR1_RE_Field is STM32_SVD.Bit; subtype CR1_TE_Field is STM32_SVD.Bit; subtype CR1_IDLEIE_Field is STM32_SVD.Bit; subtype CR1_RXNEIE_Field is STM32_SVD.Bit; subtype CR1_TCIE_Field is STM32_SVD.Bit; subtype CR1_TXEIE_Field is STM32_SVD.Bit; subtype CR1_PEIE_Field is STM32_SVD.Bit; subtype CR1_PS_Field is STM32_SVD.Bit; subtype CR1_PCE_Field is STM32_SVD.Bit; subtype CR1_WAKE_Field is STM32_SVD.Bit; subtype CR1_M_Field is STM32_SVD.Bit; subtype CR1_MME_Field is STM32_SVD.Bit; subtype CR1_CMIE_Field is STM32_SVD.Bit; subtype CR1_OVER8_Field is STM32_SVD.Bit; subtype CR1_DEDT_Field is STM32_SVD.UInt5; subtype CR1_DEAT_Field is STM32_SVD.UInt5; subtype CR1_RTOIE_Field is STM32_SVD.Bit; subtype CR1_EOBIE_Field is STM32_SVD.Bit; subtype CR1_M1_Field is STM32_SVD.Bit; -- Control register 1 type CR1_Register is record -- USART enable UE : CR1_UE_Field := 16#0#; -- USART enable in Stop mode UESM : CR1_UESM_Field := 16#0#; -- Receiver enable RE : CR1_RE_Field := 16#0#; -- Transmitter enable TE : CR1_TE_Field := 16#0#; -- IDLE interrupt enable IDLEIE : CR1_IDLEIE_Field := 16#0#; -- RXNE interrupt enable RXNEIE : CR1_RXNEIE_Field := 16#0#; -- Transmission complete interrupt enable TCIE : CR1_TCIE_Field := 16#0#; -- interrupt enable TXEIE : CR1_TXEIE_Field := 16#0#; -- PE interrupt enable PEIE : CR1_PEIE_Field := 16#0#; -- Parity selection PS : CR1_PS_Field := 16#0#; -- Parity control enable PCE : CR1_PCE_Field := 16#0#; -- Receiver wakeup method WAKE : CR1_WAKE_Field := 16#0#; -- Word length M : CR1_M_Field := 16#0#; -- Mute mode enable MME : CR1_MME_Field := 16#0#; -- Character match interrupt enable CMIE : CR1_CMIE_Field := 16#0#; -- Oversampling mode OVER8 : CR1_OVER8_Field := 16#0#; -- Driver Enable deassertion time DEDT : CR1_DEDT_Field := 16#0#; -- Driver Enable assertion time DEAT : CR1_DEAT_Field := 16#0#; -- Receiver timeout interrupt enable RTOIE : CR1_RTOIE_Field := 16#0#; -- End of Block interrupt enable EOBIE : CR1_EOBIE_Field := 16#0#; -- Word length M1 : CR1_M1_Field := 16#0#; -- unspecified Reserved_29_31 : STM32_SVD.UInt3 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register use record UE at 0 range 0 .. 0; UESM at 0 range 1 .. 1; RE at 0 range 2 .. 2; TE at 0 range 3 .. 3; IDLEIE at 0 range 4 .. 4; RXNEIE at 0 range 5 .. 5; TCIE at 0 range 6 .. 6; TXEIE at 0 range 7 .. 7; PEIE at 0 range 8 .. 8; PS at 0 range 9 .. 9; PCE at 0 range 10 .. 10; WAKE at 0 range 11 .. 11; M at 0 range 12 .. 12; MME at 0 range 13 .. 13; CMIE at 0 range 14 .. 14; OVER8 at 0 range 15 .. 15; DEDT at 0 range 16 .. 20; DEAT at 0 range 21 .. 25; RTOIE at 0 range 26 .. 26; EOBIE at 0 range 27 .. 27; M1 at 0 range 28 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; subtype CR2_ADDM7_Field is STM32_SVD.Bit; subtype CR2_LBDL_Field is STM32_SVD.Bit; subtype CR2_LBDIE_Field is STM32_SVD.Bit; subtype CR2_LBCL_Field is STM32_SVD.Bit; subtype CR2_CPHA_Field is STM32_SVD.Bit; subtype CR2_CPOL_Field is STM32_SVD.Bit; subtype CR2_CLKEN_Field is STM32_SVD.Bit; subtype CR2_STOP_Field is STM32_SVD.UInt2; subtype CR2_LINEN_Field is STM32_SVD.Bit; subtype CR2_SWAP_Field is STM32_SVD.Bit; subtype CR2_RXINV_Field is STM32_SVD.Bit; subtype CR2_TXINV_Field is STM32_SVD.Bit; subtype CR2_DATAINV_Field is STM32_SVD.Bit; subtype CR2_MSBFIRST_Field is STM32_SVD.Bit; subtype CR2_ABREN_Field is STM32_SVD.Bit; subtype CR2_ABRMOD_Field is STM32_SVD.UInt2; subtype CR2_RTOEN_Field is STM32_SVD.Bit; -- CR2_ADD array element subtype CR2_ADD_Element is STM32_SVD.UInt4; -- CR2_ADD array type CR2_ADD_Field_Array is array (0 .. 1) of CR2_ADD_Element with Component_Size => 4, Size => 8; -- Type definition for CR2_ADD type CR2_ADD_Field (As_Array : Boolean := False) is record case As_Array is when False => -- ADD as a value Val : STM32_SVD.Byte; when True => -- ADD as an array Arr : CR2_ADD_Field_Array; end case; end record with Unchecked_Union, Size => 8; for CR2_ADD_Field use record Val at 0 range 0 .. 7; Arr at 0 range 0 .. 7; end record; -- Control register 2 type CR2_Register is record -- unspecified Reserved_0_3 : STM32_SVD.UInt4 := 16#0#; -- 7-bit Address Detection/4-bit Address Detection ADDM7 : CR2_ADDM7_Field := 16#0#; -- LIN break detection length LBDL : CR2_LBDL_Field := 16#0#; -- LIN break detection interrupt enable LBDIE : CR2_LBDIE_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- Last bit clock pulse LBCL : CR2_LBCL_Field := 16#0#; -- Clock phase CPHA : CR2_CPHA_Field := 16#0#; -- Clock polarity CPOL : CR2_CPOL_Field := 16#0#; -- Clock enable CLKEN : CR2_CLKEN_Field := 16#0#; -- STOP bits STOP : CR2_STOP_Field := 16#0#; -- LIN mode enable LINEN : CR2_LINEN_Field := 16#0#; -- Swap TX/RX pins SWAP : CR2_SWAP_Field := 16#0#; -- RX pin active level inversion RXINV : CR2_RXINV_Field := 16#0#; -- TX pin active level inversion TXINV : CR2_TXINV_Field := 16#0#; -- Binary data inversion DATAINV : CR2_DATAINV_Field := 16#0#; -- Most significant bit first MSBFIRST : CR2_MSBFIRST_Field := 16#0#; -- Auto baud rate enable ABREN : CR2_ABREN_Field := 16#0#; -- Auto baud rate mode ABRMOD : CR2_ABRMOD_Field := 16#0#; -- Receiver timeout enable RTOEN : CR2_RTOEN_Field := 16#0#; -- Address of the USART node ADD : CR2_ADD_Field := (As_Array => False, Val => 16#0#); end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record Reserved_0_3 at 0 range 0 .. 3; ADDM7 at 0 range 4 .. 4; LBDL at 0 range 5 .. 5; LBDIE at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; LBCL at 0 range 8 .. 8; CPHA at 0 range 9 .. 9; CPOL at 0 range 10 .. 10; CLKEN at 0 range 11 .. 11; STOP at 0 range 12 .. 13; LINEN at 0 range 14 .. 14; SWAP at 0 range 15 .. 15; RXINV at 0 range 16 .. 16; TXINV at 0 range 17 .. 17; DATAINV at 0 range 18 .. 18; MSBFIRST at 0 range 19 .. 19; ABREN at 0 range 20 .. 20; ABRMOD at 0 range 21 .. 22; RTOEN at 0 range 23 .. 23; ADD at 0 range 24 .. 31; end record; subtype CR3_EIE_Field is STM32_SVD.Bit; subtype CR3_IREN_Field is STM32_SVD.Bit; subtype CR3_IRLP_Field is STM32_SVD.Bit; subtype CR3_HDSEL_Field is STM32_SVD.Bit; subtype CR3_NACK_Field is STM32_SVD.Bit; subtype CR3_SCEN_Field is STM32_SVD.Bit; subtype CR3_DMAR_Field is STM32_SVD.Bit; subtype CR3_DMAT_Field is STM32_SVD.Bit; subtype CR3_RTSE_Field is STM32_SVD.Bit; subtype CR3_CTSE_Field is STM32_SVD.Bit; subtype CR3_CTSIE_Field is STM32_SVD.Bit; subtype CR3_ONEBIT_Field is STM32_SVD.Bit; subtype CR3_OVRDIS_Field is STM32_SVD.Bit; subtype CR3_DDRE_Field is STM32_SVD.Bit; subtype CR3_DEM_Field is STM32_SVD.Bit; subtype CR3_DEP_Field is STM32_SVD.Bit; subtype CR3_SCARCNT_Field is STM32_SVD.UInt3; subtype CR3_WUS_Field is STM32_SVD.UInt2; subtype CR3_WUFIE_Field is STM32_SVD.Bit; -- Control register 3 type CR3_Register is record -- Error interrupt enable EIE : CR3_EIE_Field := 16#0#; -- IrDA mode enable IREN : CR3_IREN_Field := 16#0#; -- IrDA low-power IRLP : CR3_IRLP_Field := 16#0#; -- Half-duplex selection HDSEL : CR3_HDSEL_Field := 16#0#; -- Smartcard NACK enable NACK : CR3_NACK_Field := 16#0#; -- Smartcard mode enable SCEN : CR3_SCEN_Field := 16#0#; -- DMA enable receiver DMAR : CR3_DMAR_Field := 16#0#; -- DMA enable transmitter DMAT : CR3_DMAT_Field := 16#0#; -- RTS enable RTSE : CR3_RTSE_Field := 16#0#; -- CTS enable CTSE : CR3_CTSE_Field := 16#0#; -- CTS interrupt enable CTSIE : CR3_CTSIE_Field := 16#0#; -- One sample bit method enable ONEBIT : CR3_ONEBIT_Field := 16#0#; -- Overrun Disable OVRDIS : CR3_OVRDIS_Field := 16#0#; -- DMA Disable on Reception Error DDRE : CR3_DDRE_Field := 16#0#; -- Driver enable mode DEM : CR3_DEM_Field := 16#0#; -- Driver enable polarity selection DEP : CR3_DEP_Field := 16#0#; -- unspecified Reserved_16_16 : STM32_SVD.Bit := 16#0#; -- Smartcard auto-retry count SCARCNT : CR3_SCARCNT_Field := 16#0#; -- Wakeup from Stop mode interrupt flag selection WUS : CR3_WUS_Field := 16#0#; -- Wakeup from Stop mode interrupt enable WUFIE : CR3_WUFIE_Field := 16#0#; -- unspecified Reserved_23_31 : STM32_SVD.UInt9 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR3_Register use record EIE at 0 range 0 .. 0; IREN at 0 range 1 .. 1; IRLP at 0 range 2 .. 2; HDSEL at 0 range 3 .. 3; NACK at 0 range 4 .. 4; SCEN at 0 range 5 .. 5; DMAR at 0 range 6 .. 6; DMAT at 0 range 7 .. 7; RTSE at 0 range 8 .. 8; CTSE at 0 range 9 .. 9; CTSIE at 0 range 10 .. 10; ONEBIT at 0 range 11 .. 11; OVRDIS at 0 range 12 .. 12; DDRE at 0 range 13 .. 13; DEM at 0 range 14 .. 14; DEP at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; SCARCNT at 0 range 17 .. 19; WUS at 0 range 20 .. 21; WUFIE at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; subtype BRR_DIV_Fraction_Field is STM32_SVD.UInt4; subtype BRR_DIV_Mantissa_Field is STM32_SVD.UInt12; -- Baud rate register type BRR_Register is record -- fraction of USARTDIV DIV_Fraction : BRR_DIV_Fraction_Field := 16#0#; -- mantissa of USARTDIV DIV_Mantissa : BRR_DIV_Mantissa_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for BRR_Register use record DIV_Fraction at 0 range 0 .. 3; DIV_Mantissa at 0 range 4 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype GTPR_PSC_Field is STM32_SVD.Byte; subtype GTPR_GT_Field is STM32_SVD.Byte; -- Guard time and prescaler register type GTPR_Register is record -- Prescaler value PSC : GTPR_PSC_Field := 16#0#; -- Guard time value GT : GTPR_GT_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for GTPR_Register use record PSC at 0 range 0 .. 7; GT at 0 range 8 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype RTOR_RTO_Field is STM32_SVD.UInt24; subtype RTOR_BLEN_Field is STM32_SVD.Byte; -- Receiver timeout register type RTOR_Register is record -- Receiver timeout value RTO : RTOR_RTO_Field := 16#0#; -- Block Length BLEN : RTOR_BLEN_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RTOR_Register use record RTO at 0 range 0 .. 23; BLEN at 0 range 24 .. 31; end record; subtype RQR_ABRRQ_Field is STM32_SVD.Bit; subtype RQR_SBKRQ_Field is STM32_SVD.Bit; subtype RQR_MMRQ_Field is STM32_SVD.Bit; subtype RQR_RXFRQ_Field is STM32_SVD.Bit; subtype RQR_TXFRQ_Field is STM32_SVD.Bit; -- Request register type RQR_Register is record -- Auto baud rate request ABRRQ : RQR_ABRRQ_Field := 16#0#; -- Send break request SBKRQ : RQR_SBKRQ_Field := 16#0#; -- Mute mode request MMRQ : RQR_MMRQ_Field := 16#0#; -- Receive data flush request RXFRQ : RQR_RXFRQ_Field := 16#0#; -- Transmit data flush request TXFRQ : RQR_TXFRQ_Field := 16#0#; -- unspecified Reserved_5_31 : STM32_SVD.UInt27 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RQR_Register use record ABRRQ at 0 range 0 .. 0; SBKRQ at 0 range 1 .. 1; MMRQ at 0 range 2 .. 2; RXFRQ at 0 range 3 .. 3; TXFRQ at 0 range 4 .. 4; Reserved_5_31 at 0 range 5 .. 31; end record; subtype ISR_PE_Field is STM32_SVD.Bit; subtype ISR_FE_Field is STM32_SVD.Bit; subtype ISR_NF_Field is STM32_SVD.Bit; subtype ISR_ORE_Field is STM32_SVD.Bit; subtype ISR_IDLE_Field is STM32_SVD.Bit; subtype ISR_RXNE_Field is STM32_SVD.Bit; subtype ISR_TC_Field is STM32_SVD.Bit; subtype ISR_TXE_Field is STM32_SVD.Bit; subtype ISR_LBDF_Field is STM32_SVD.Bit; subtype ISR_CTSIF_Field is STM32_SVD.Bit; subtype ISR_CTS_Field is STM32_SVD.Bit; subtype ISR_RTOF_Field is STM32_SVD.Bit; subtype ISR_EOBF_Field is STM32_SVD.Bit; subtype ISR_ABRE_Field is STM32_SVD.Bit; subtype ISR_ABRF_Field is STM32_SVD.Bit; subtype ISR_BUSY_Field is STM32_SVD.Bit; subtype ISR_CMF_Field is STM32_SVD.Bit; subtype ISR_SBKF_Field is STM32_SVD.Bit; subtype ISR_RWU_Field is STM32_SVD.Bit; subtype ISR_WUF_Field is STM32_SVD.Bit; subtype ISR_TEACK_Field is STM32_SVD.Bit; subtype ISR_REACK_Field is STM32_SVD.Bit; -- Interrupt & status register type ISR_Register is record -- Read-only. Parity error PE : ISR_PE_Field; -- Read-only. Framing error FE : ISR_FE_Field; -- Read-only. Noise detected flag NF : ISR_NF_Field; -- Read-only. Overrun error ORE : ISR_ORE_Field; -- Read-only. Idle line detected IDLE : ISR_IDLE_Field; -- Read-only. Read data register not empty RXNE : ISR_RXNE_Field; -- Read-only. Transmission complete TC : ISR_TC_Field; -- Read-only. Transmit data register empty TXE : ISR_TXE_Field; -- Read-only. LIN break detection flag LBDF : ISR_LBDF_Field; -- Read-only. CTS interrupt flag CTSIF : ISR_CTSIF_Field; -- Read-only. CTS flag CTS : ISR_CTS_Field; -- Read-only. Receiver timeout RTOF : ISR_RTOF_Field; -- Read-only. End of block flag EOBF : ISR_EOBF_Field; -- unspecified Reserved_13_13 : STM32_SVD.Bit; -- Read-only. Auto baud rate error ABRE : ISR_ABRE_Field; -- Read-only. Auto baud rate flag ABRF : ISR_ABRF_Field; -- Read-only. Busy flag BUSY : ISR_BUSY_Field; -- Read-only. character match flag CMF : ISR_CMF_Field; -- Read-only. Send break flag SBKF : ISR_SBKF_Field; -- Read-only. Receiver wakeup from Mute mode RWU : ISR_RWU_Field; -- Read-only. Wakeup from Stop mode flag WUF : ISR_WUF_Field; -- Read-only. Transmit enable acknowledge flag TEACK : ISR_TEACK_Field; -- Read-only. Receive enable acknowledge flag REACK : ISR_REACK_Field; -- unspecified Reserved_23_31 : STM32_SVD.UInt9; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record PE at 0 range 0 .. 0; FE at 0 range 1 .. 1; NF at 0 range 2 .. 2; ORE at 0 range 3 .. 3; IDLE at 0 range 4 .. 4; RXNE at 0 range 5 .. 5; TC at 0 range 6 .. 6; TXE at 0 range 7 .. 7; LBDF at 0 range 8 .. 8; CTSIF at 0 range 9 .. 9; CTS at 0 range 10 .. 10; RTOF at 0 range 11 .. 11; EOBF at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; ABRE at 0 range 14 .. 14; ABRF at 0 range 15 .. 15; BUSY at 0 range 16 .. 16; CMF at 0 range 17 .. 17; SBKF at 0 range 18 .. 18; RWU at 0 range 19 .. 19; WUF at 0 range 20 .. 20; TEACK at 0 range 21 .. 21; REACK at 0 range 22 .. 22; Reserved_23_31 at 0 range 23 .. 31; end record; subtype ICR_PECF_Field is STM32_SVD.Bit; subtype ICR_FECF_Field is STM32_SVD.Bit; subtype ICR_NCF_Field is STM32_SVD.Bit; subtype ICR_ORECF_Field is STM32_SVD.Bit; subtype ICR_IDLECF_Field is STM32_SVD.Bit; subtype ICR_TCCF_Field is STM32_SVD.Bit; subtype ICR_LBDCF_Field is STM32_SVD.Bit; subtype ICR_CTSCF_Field is STM32_SVD.Bit; subtype ICR_RTOCF_Field is STM32_SVD.Bit; subtype ICR_EOBCF_Field is STM32_SVD.Bit; subtype ICR_CMCF_Field is STM32_SVD.Bit; subtype ICR_WUCF_Field is STM32_SVD.Bit; -- Interrupt flag clear register type ICR_Register is record -- Parity error clear flag PECF : ICR_PECF_Field := 16#0#; -- Framing error clear flag FECF : ICR_FECF_Field := 16#0#; -- Noise detected clear flag NCF : ICR_NCF_Field := 16#0#; -- Overrun error clear flag ORECF : ICR_ORECF_Field := 16#0#; -- Idle line detected clear flag IDLECF : ICR_IDLECF_Field := 16#0#; -- unspecified Reserved_5_5 : STM32_SVD.Bit := 16#0#; -- Transmission complete clear flag TCCF : ICR_TCCF_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- LIN break detection clear flag LBDCF : ICR_LBDCF_Field := 16#0#; -- CTS clear flag CTSCF : ICR_CTSCF_Field := 16#0#; -- unspecified Reserved_10_10 : STM32_SVD.Bit := 16#0#; -- Receiver timeout clear flag RTOCF : ICR_RTOCF_Field := 16#0#; -- End of timeout clear flag EOBCF : ICR_EOBCF_Field := 16#0#; -- unspecified Reserved_13_16 : STM32_SVD.UInt4 := 16#0#; -- Character match clear flag CMCF : ICR_CMCF_Field := 16#0#; -- unspecified Reserved_18_19 : STM32_SVD.UInt2 := 16#0#; -- Wakeup from Stop mode clear flag WUCF : ICR_WUCF_Field := 16#0#; -- unspecified Reserved_21_31 : STM32_SVD.UInt11 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record PECF at 0 range 0 .. 0; FECF at 0 range 1 .. 1; NCF at 0 range 2 .. 2; ORECF at 0 range 3 .. 3; IDLECF at 0 range 4 .. 4; Reserved_5_5 at 0 range 5 .. 5; TCCF at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; LBDCF at 0 range 8 .. 8; CTSCF at 0 range 9 .. 9; Reserved_10_10 at 0 range 10 .. 10; RTOCF at 0 range 11 .. 11; EOBCF at 0 range 12 .. 12; Reserved_13_16 at 0 range 13 .. 16; CMCF at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; WUCF at 0 range 20 .. 20; Reserved_21_31 at 0 range 21 .. 31; end record; subtype RDR_RDR_Field is STM32_SVD.UInt9; -- Receive data register type RDR_Register is record -- Read-only. Receive data value RDR : RDR_RDR_Field; -- unspecified Reserved_9_31 : STM32_SVD.UInt23; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RDR_Register use record RDR at 0 range 0 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; subtype TDR_TDR_Field is STM32_SVD.UInt9; -- Transmit data register type TDR_Register is record -- Transmit data value TDR : TDR_TDR_Field := 16#0#; -- unspecified Reserved_9_31 : STM32_SVD.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for TDR_Register use record TDR at 0 range 0 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Universal synchronous asynchronous receiver transmitter type USART_Peripheral is record -- Control register 1 CR1 : aliased CR1_Register; -- Control register 2 CR2 : aliased CR2_Register; -- Control register 3 CR3 : aliased CR3_Register; -- Baud rate register BRR : aliased BRR_Register; -- Guard time and prescaler register GTPR : aliased GTPR_Register; -- Receiver timeout register RTOR : aliased RTOR_Register; -- Request register RQR : aliased RQR_Register; -- Interrupt & status register ISR : aliased ISR_Register; -- Interrupt flag clear register ICR : aliased ICR_Register; -- Receive data register RDR : aliased RDR_Register; -- Transmit data register TDR : aliased TDR_Register; end record with Volatile; for USART_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; CR3 at 16#8# range 0 .. 31; BRR at 16#C# range 0 .. 31; GTPR at 16#10# range 0 .. 31; RTOR at 16#14# range 0 .. 31; RQR at 16#18# range 0 .. 31; ISR at 16#1C# range 0 .. 31; ICR at 16#20# range 0 .. 31; RDR at 16#24# range 0 .. 31; TDR at 16#28# range 0 .. 31; end record; -- Universal synchronous asynchronous receiver transmitter USART1_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40013800#); -- Universal synchronous asynchronous receiver transmitter USART2_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40004400#); -- Universal synchronous asynchronous receiver transmitter USART3_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40004800#); -- Universal synchronous asynchronous receiver transmitter USART4_Periph : aliased USART_Peripheral with Import, Address => System'To_Address (16#40004C00#); end STM32_SVD.USART;

36.097525

72

0.581031

dcad1efd59caf3029460358453611fc04f507d3f

6,246

adb

Ada

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack37.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack37.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack37.adb

orb-zhuchen/Orb

6da2404b949ac28bde786e08bf4debe4a27cd3a0

[ "CNRI-Python-GPL-Compatible", "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . P A C K _ 3 7 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2019, 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. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Elements; with System.Unsigned_Types; package body System.Pack_37 is subtype Bit_Order is System.Bit_Order; Reverse_Bit_Order : constant Bit_Order := Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order)); subtype Ofs is System.Storage_Elements.Storage_Offset; subtype Uns is System.Unsigned_Types.Unsigned; subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7; use type System.Storage_Elements.Storage_Offset; use type System.Unsigned_Types.Unsigned; type Cluster is record E0, E1, E2, E3, E4, E5, E6, E7 : Bits_37; end record; for Cluster use record E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1; E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1; E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1; E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1; E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1; E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1; E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1; E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1; end record; for Cluster'Size use Bits * 8; for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment, 1 + 1 * Boolean'Pos (Bits mod 2 = 0) + 2 * Boolean'Pos (Bits mod 4 = 0)); -- Use maximum possible alignment, given the bit field size, since this -- will result in the most efficient code possible for the field. type Cluster_Ref is access Cluster; type Rev_Cluster is new Cluster with Bit_Order => Reverse_Bit_Order, Scalar_Storage_Order => Reverse_Bit_Order; type Rev_Cluster_Ref is access Rev_Cluster; ------------ -- Get_37 -- ------------ function Get_37 (Arr : System.Address; N : Natural; Rev_SSO : Boolean) return Bits_37 is A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8); C : Cluster_Ref with Address => A'Address, Import; RC : Rev_Cluster_Ref with Address => A'Address, Import; begin if Rev_SSO then case N07 (Uns (N) mod 8) is when 0 => return RC.E0; when 1 => return RC.E1; when 2 => return RC.E2; when 3 => return RC.E3; when 4 => return RC.E4; when 5 => return RC.E5; when 6 => return RC.E6; when 7 => return RC.E7; end case; else case N07 (Uns (N) mod 8) is when 0 => return C.E0; when 1 => return C.E1; when 2 => return C.E2; when 3 => return C.E3; when 4 => return C.E4; when 5 => return C.E5; when 6 => return C.E6; when 7 => return C.E7; end case; end if; end Get_37; ------------ -- Set_37 -- ------------ procedure Set_37 (Arr : System.Address; N : Natural; E : Bits_37; Rev_SSO : Boolean) is A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8); C : Cluster_Ref with Address => A'Address, Import; RC : Rev_Cluster_Ref with Address => A'Address, Import; begin if Rev_SSO then case N07 (Uns (N) mod 8) is when 0 => RC.E0 := E; when 1 => RC.E1 := E; when 2 => RC.E2 := E; when 3 => RC.E3 := E; when 4 => RC.E4 := E; when 5 => RC.E5 := E; when 6 => RC.E6 := E; when 7 => RC.E7 := E; end case; else case N07 (Uns (N) mod 8) is when 0 => C.E0 := E; when 1 => C.E1 := E; when 2 => C.E2 := E; when 3 => C.E3 := E; when 4 => C.E4 := E; when 5 => C.E5 := E; when 6 => C.E6 := E; when 7 => C.E7 := E; end case; end if; end Set_37; end System.Pack_37;

39.531646

78

0.460775

23bce6e26dc02185b4298431d1de28d25319a676

793

ads

Ada

build_gnu/binutils/gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2017-05-31T21:42:12.000Z

build_gnu/binutils/gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

null

build_gnu/binutils/gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

jed-frey/e200-gcc

df1421b421a8ec8729d70791129f5283dee5f9ea

[ "BSD-3-Clause" ]

1

2019-12-17T22:04:07.000Z

-- Copyright 2008-2014 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/>. package Pck is String_Var : String := "Hello from package Pck"; end Pck;

37.761905

73

0.732661

23710be3c8b7c2e95224b2691a0f2ac3fb82792b

4,681

ads

Ada

source/amf/uml/amf-uml-interval_constraints.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-interval_constraints.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-interval_constraints.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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. ------------------------------------------------------------------------------ -- An interval constraint is a constraint that refers to an interval. ------------------------------------------------------------------------------ with AMF.UML.Constraints; limited with AMF.UML.Intervals; package AMF.UML.Interval_Constraints is pragma Preelaborate; type UML_Interval_Constraint is limited interface and AMF.UML.Constraints.UML_Constraint; type UML_Interval_Constraint_Access is access all UML_Interval_Constraint'Class; for UML_Interval_Constraint_Access'Storage_Size use 0; not overriding function Get_Specification (Self : not null access constant UML_Interval_Constraint) return AMF.UML.Intervals.UML_Interval_Access is abstract; -- Getter of IntervalConstraint::specification. -- -- A condition that must be true when evaluated in order for the -- constraint to be satisfied. not overriding procedure Set_Specification (Self : not null access UML_Interval_Constraint; To : AMF.UML.Intervals.UML_Interval_Access) is abstract; -- Setter of IntervalConstraint::specification. -- -- A condition that must be true when evaluated in order for the -- constraint to be satisfied. end AMF.UML.Interval_Constraints;

59.253165

78

0.469558

18c1b5e1dde77df95dc793a63788d82e23a54b31

1,835

adb

Ada

src/model/grammar/lse-model-grammar-symbol-logoangleplus.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

2

2021-01-09T14:49:35.000Z

2022-01-18T18:57:45.000Z

src/model/grammar/lse-model-grammar-symbol-logoangleplus.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

1

2021-12-03T18:49:59.000Z

src/model/grammar/lse-model-grammar-symbol-logoangleplus.adb

mgrojo/lsystem-editor

1f855bc1f783c8d7a1c81594c8aee403e4b53132

[ "MIT" ]

1

2021-12-03T18:07:44.000Z

------------------------------------------------------------------------------- -- LSE -- L-System Editor -- Author: Heziode -- -- License: -- MIT License -- -- Copyright (c) 2018 Quentin Dauprat (Heziode) <[email protected]> -- -- 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 LSE.Model.Grammar.Symbol.LogoAnglePlus is procedure Initialize (This : out Instance) is begin This := Instance '(Representation => '+'); end Initialize; procedure Interpret (This : in out Instance; T : in out Holder) is pragma Unreferenced (This); begin T.Reference.Rotate_Clockwise; end Interpret; end LSE.Model.Grammar.Symbol.LogoAnglePlus;

39.891304

79

0.656676

23d8d288a1832726f1e9f420eb77183e19dce553

1,387

ads

Ada

source/units/program-units-vectors.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/units/program-units-vectors.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

null

source/units/program-units-vectors.ads

optikos/oasis

9f64d46d26d964790d69f9db681c874cfb3bf96d

[ "MIT" ]

2

2019-09-14T23:18:50.000Z

2019-10-02T10:11:40.000Z

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Ada.Containers.Vectors; with Program.Compilation_Unit_Vectors; package Program.Units.Vectors is pragma Preelaborate; type Unit_Vector is limited new Program.Compilation_Unit_Vectors.Compilation_Unit_Vector with private; procedure Clear (Self : in out Unit_Vector); procedure Append (Self : in out Unit_Vector; Value : not null Program.Compilation_Units.Compilation_Unit_Access); private package Unit_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Program.Compilation_Units.Compilation_Unit_Access, "=" => Program.Compilation_Units."="); type Unit_Vector is limited new Program.Compilation_Unit_Vectors.Compilation_Unit_Vector with record Data : Unit_Vectors.Vector; end record; overriding function Get_Length (Self : Unit_Vector) return Positive; overriding function Element (Self : Unit_Vector; Index : Positive) return not null Program.Compilation_Units.Compilation_Unit_Access; overriding function Find_Unit (Self : Unit_Vector; Name : Text) return Program.Compilation_Units.Compilation_Unit_Access; end Program.Units.Vectors;

28.895833

77

0.707282

c5e14acce672301441d9a92189c8af60f14f5e8c

53,540

adb

Ada

ga_lib/src/e3ga.adb

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

3

2019-04-12T01:09:55.000Z

2021-02-24T18:17:32.000Z

ga_lib/src/e3ga.adb

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

1

2020-08-12T10:10:25.000Z

ga_lib/src/e3ga.adb

rogermc2/GA_Ada

0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be

[ "ISC" ]

1

2019-04-12T01:14:15.000Z

with Interfaces; with Maths; with Blade; with Blade_Types; package body E3GA is -- type Array_BM8 is array (GA_Maths.Bit_Map range 1 .. 8) of integer; -- MV_Space_Dim : constant Integer := 3; -- MV_Metric_Euclidean : constant Boolean := True; -- The space's metric is Euclidean -- MV_Grade_Size can be used to lookup the number of coordinates for -- a grade part of a general multivector -- MV_Grade_Size : constant Array_I4 := (1, 3, 3, 1); -- MV_Size can be used to lookup the number of coordinates based on a grade usage bitmap -- MV_Size : constant array (1 .. 16) of integer := -- (0, 1, 3, 4, 3, 4, 6, 7, 1, 2, 4, 5, 4, 5, 7, 8); -- MV_Basis_Vector_Names : constant array (1 .. 3) of string (1 .. 2) := -- ("e1", "e2", "e3"); -- MV_Basis_Elements contains the order of basis elements in the general multivector -- MV_Basis_Elements : constant array (1 .. 8, 1 .. 4) of integer := -- ((-1, 0, 0, 0), -- (0, -1, 0, 0), -- (1, -1, 0, 0), -- (2, -1, 0, 0), -- (0, 1, -1, 0), -- (1, 2, -1, 0), -- (0, 2, -1, 0), -- (0, 1, 2, -1)); -- This array contains the 'sign' (even/odd permutation of the canonical order) -- of basis elements in the general multivector. -- This answers 'what is the permutation of the coordinate at index [x]'? -- MV_Basis_Element_Sign_By_Index : constant Array_F8 := -- (1.0, 1.0, 1.0, 1.0, 1.0, 1.0, -1.0, 1.0); -- This answers 'what is the permutation of the coordinate at bitmap [x]'? -- MV_Basis_Element_Sign_By_Bitmap : constant Array_F8 := -- (1.0, 1.0, 1.0, 1.0, 1.0, -1.0, 1.0, 1.0); -- This answers 'at what index is the basis element [x] (x = basis vector bitmap)'? -- MV_Basis_Element_Index_By_Bitmap : constant Array_BM8 := -- (0, 1, 2, 4, 3, 6, 5, 7); -- This answers 'at what index is the basis element [x] (x = basis vector bitmap)'? -- MV_Basis_Element_Bitmap_By_Index : constant Array_I8 := -- (0, 1, 2, 4, 3, 6, 5, 7); -- This answers 'at what is the grade of basis element bitmap [x]'? -- MV_Basis_Element_Grade_By_Bitmap : constant Array_BM8 := -- (0, 1, 1, 2, 1, 2, 2, 3); -- e1_basis : Array_3D := (1.0, 0.0, 0.0); -- e2_basis : Array_3D := (0.0, 1.0, 0.0); -- e3_basis : Array_3D := (0.0, 0.0, 1.0); -- ------------------------------------------------------------------------ -- function "=" (V1, V2 : Vector) return Boolean is -- theVector : Vector; -- begin -- return V1.Coordinates (1) = V2.Coordinates (1) and then -- V1.Coordinates (2) = V2.Coordinates (2) and then -- V1.Coordinates (3) = V2.Coordinates (3); -- end "="; -- ------------------------------------------------------------------------ function "+" (V1, V2 : E3_Vector) return E3_Vector is use GL; use GL.Types; Sum : E3_Vector; begin Sum (X) := V1 (X) + V2 (X); Sum (Y) := V1 (Y) + V2 (Y); Sum (Z) := V1 (Z) + V2 (Z); return Sum; end "+"; -- ------------------------------------------------------------------------ function "-" (V : E3_Vector) return E3_Vector is use GL.Types; begin return (- V (GL.X), - V (GL.Y), - V (GL.Z)); end "-"; -- ------------------------------------------------------------------------ -- function "-" (VL, VR : Vector) return Vector is -- begin -- return (VL (1) - VR (1), VL (2) - VR (2), VL (3) - VR (3)); -- end "-"; -- ------------------------------------------------------------------------ function "*" (Weight : float; V : E3_Vector) return E3_Vector is use GL.Types; S_Weight : constant Single := Single (Weight); begin return (S_Weight * V (GL.X), S_Weight * V (GL.Y), S_Weight * V (GL.Z)); end "*"; -- ------------------------------------------------------------------------ -- function "*" (Weight : float; BV : Bivector) return Bivector is -- begin -- return (BV.Grade_Use, Weight * BV.C1_e1e2, Weight * BV.C2_e2e3, Weight * BV.C3_e3e1); -- end "*"; -- ------------------------------------------------------------------------ function "*" (R1, R2 : Rotor) return Rotor is use Blade.Blade_List_Package; use Blade; use Blade_Types; R1_Blades : constant Blade_List := Get_Blade_List (R1); R2_Blades : constant Blade_List := Get_Blade_List (R2); Curs_1 : Cursor := R1_Blades.First; Curs_2 : Cursor := R2_Blades.First; Blade_1 : Basis_Blade; Blade_2 : Basis_Blade; New_Blade : Basis_Blade; Index : E3_Base := E3_e1; Product : Rotor := New_Rotor (Scalar_Part (R1) * Scalar_Part (R2)); begin -- R1.C1_Scalar * R2.C1_Scalar, R1.C2_e1e2 * R2.C2_e1e2, -- R1.C3_e2e3 * R2.C3_e2e3, R1.C4_e3e1 * R2.C4_e3e1 while Has_Element (Curs_1) and Has_Element (Curs_2) loop Blade_1 := Element (Curs_1); Blade_2 := Element (Curs_2); New_Blade := New_Basis_Blade (Index, Weight (Blade_1) * Weight (Blade_2)); Add_Blade (Product, New_Blade); Next (Curs_1); Next (Curs_2); Index := E3_Base'Succ (Index); end loop; return Product; end "*"; -- ------------------------------------------------------------------------ -- function "*" (R : Rotor; V : Vector) return Rotor is -- begin -- return (R.C1_Scalar, R.C2_e1e2 * V.Coordinates (1), R.C3_e2e3 * V.Coordinates (2), -- R.C4_e3e1 * V.Coordinates (3)); -- end "*"; -- ------------------------------------------------------------------------ -- function "*" (V : Vector; R : Rotor) return Rotor is -- theRotor : Rotor; -- begin -- theRotor.C1_Scalar:= R.C1_Scalar; -- theRotor.C2_e1e2 := V.Coordinates (1) + R.C2_e1e2; -- theRotor.C3_e2e3 := V.Coordinates (2) + R.C3_e2e3; -- theRotor.C4_e3e1 := V.Coordinates (3) + R.C4_e3e1; -- return theRotor; -- end "*"; -- ------------------------------------------------------------------------ function "/" (R : Rotor; S : float) return Multivectors.Rotor is use Blade; use Blade_List_Package; Blades : constant Blade_List := Get_Blade_List (R); Curs : Cursor := Blades.First; aBlade : Basis_Blade; New_Blade : Basis_Blade; Index : Blade_Types.E3_Base := Blade_Types.E3_e1; Quotient : Rotor := New_Rotor (Scalar_Part (R) / S); begin while Has_Element (Curs) loop aBlade := Element (Curs); New_Blade := New_Basis_Blade (Index, Weight (aBlade) * S); Add_Blade (Quotient, New_Blade); Next (Curs); Index := Blade_Types.E3_Base'Succ (Index); end loop; return Quotient; end "/"; -- ------------------------------------------------------------------------ -- function "+" (W : float; BV : Bivector) return Rotor is -- begin -- return (W, BV.C1_e1e2, BV.C2_e2e3, BV.C3_e3e1); -- end "+"; -- ------------------------------------------------------------------------ function "+" (W : float; R : Rotor) return Rotor is Sum : Rotor := R; begin Update_Scalar_Part (Sum, Scalar_Part (R) + W); return Sum; -- return (W + R.C1_Scalar, R.C2_e1e2, R.C3_e2e3, R.C4_e3e1); end "+"; -- ------------------------------------------------------------------------ -- function "-" (W : float; R : muRotor) return Multivector.Rotor is -- begin -- return (W - R.C1_Scalar, R.C2_e1e2, R.C3_e2e3, R.C4_e3e1); -- end "-"; -- ------------------------------------------------------------------------ function "-" (W : float; R : Rotor) return Multivectors.Rotor is Sum : Rotor := R; begin Update_Scalar_Part (Sum, W - Scalar_Part (R)); return Sum; end "-"; -- ------------------------------------------------------------------------ -- function Apply_Outermorphism (OM : Outermorphism; BV : Bivector) return Bivector is -- OM_Coords : Array_19F := Get_Outermorphism (OM); -- begin -- return (BV.Grade_Use, -- OM_Coords (11) * BV.C2_e2e3 + OM_Coords (12) * BV.C3_e3e1 + OM_Coords (10) * BV.C1_e1e2, -- OM_Coords (13) * BV.C1_e1e2 + OM_Coords (15) * BV.C3_e3e1 + OM_Coords (14) * BV.C2_e2e3, -- OM_Coords (16) * BV.C1_e1e2 + OM_Coords (17) * BV.C2_e2e3 + OM_Coords (18) * BV.C3_e3e1); -- end Apply_Outermorphism; -- ------------------------------------------------------------------------ -- function Apply_Outermorphism (OM : Outermorphism; V : Vector) return Vector is -- OM_Coords : Array_19F := Get_Outermorphism (OM); -- Result : Vector; -- begin -- Set_Coords (Result, -- OM_Coords (3) * V.Coordinates (3) + OM_Coords (2) * V.Coordinates (2) -- + OM_Coords (1) * V.Coordinates (1), -- OM_Coords (5) * V.Coordinates (2) + OM_Coords (4) * V.Coordinates (1) -- + OM_Coords (6) * V.Coordinates (3), -- OM_Coords (8) * V.Coordinates (2) + OM_Coords (7) * V.Coordinates (1) -- + OM_Coords (9) * V.Coordinates (3)); -- return Result; -- end Apply_Outermorphism; -- ------------------------------------------------------------------------ -- function BV_String (BV : Bivector; Text : String := "") -- return Ada.Strings.Unbounded.Unbounded_String is -- use Interfaces; -- use Ada.Strings.Unbounded; -- num : GA_Maths.Fixed_4; -- theString : Unbounded_String := -- Ada.Strings.Unbounded.To_Unbounded_String (Text); -- begin -- -- Print coordinates -- for i in 1 .. 3 loop -- if (Unsigned_32 (BV.Grade_Use) and Shift_Left (1, i - 1)) /= 0 then -- case i is -- when 1 => num := GA_Maths.Fixed_4 (BV.C1_e1e2); -- theString := theString & Fixed_4'Image (num) & " e1^e2 "; -- when 2 => num := GA_Maths.Fixed_4 (BV.C2_e2e3); -- theString := theString & Fixed_4'Image (num) & " e2^e3 "; -- when 3 => num := GA_Maths.Fixed_4 (BV.C3_e3e1); -- theString := theString & Fixed_4'Image (num) & " e3^e1"; -- end case; -- end if; -- end loop; -- return theString; -- end BV_String; -- ------------------------------------------------------------------------- -- function Dot_Product (BV1, BV2 : BiVector) return float is -- begin -- return BV1.C1_e1e2 * BV2.C1_e1e2 + BV1.C2_e2e3 * BV2.C2_e2e3 + -- BV1.C3_e3e1 * BV2.C3_e3e1; -- end Dot_Product; -- ------------------------------------------------------------------------ -- function Dot_Product (V1, V2 : Vector) return float is -- begin -- return V1.Coordinates (1) * V2.Coordinates (1) + -- V1.Coordinates (2) * V2.Coordinates (2) + V1.Coordinates (3) * V2.Coordinates (3); -- end Dot_Product; -- ------------------------------------------------------------------------ function Dot_Product (R1, R2 : Rotor) return Float is use Blade; use Blade_List_Package; R1_Blades : constant Blade_List := Get_Blade_List (R1); R2_Blades : constant Blade_List := Get_Blade_List (R2); R1_Curs : Cursor := R1_Blades.First; R2_Curs : Cursor := R2_Blades.First; Product : Float := Scalar_Part (R1) * Scalar_Part (R2); begin while Has_Element (R1_Curs) and Has_Element (R2_Curs) loop Product := Product + Weight (Element (R1_Curs)) * Weight (Element (R1_Curs)); Next (R1_Curs); Next (R2_Curs); end loop; return Product; -- return R1.C1_Scalar * R2.C1_Scalar + R1.C2_e1e2 * R2.C2_e1e2 + -- R1.C3_e2e3 * R2.C3_e2e3 + R1.C4_e3e1 * R2.C4_e3e1; end Dot_Product; -- ------------------------------------------------------------------------ -- function Dual (MV : Multivector) return Multivector is -- use GA_Maths; -- Coords : MV_Coordinate_Array := (others => 0.0); -- Info : E2GA.MV_Type; -- begin -- if (MV.Grade_Use and 1) /= 0 then -- Coords (4) := -MV.Coordinates (1); -- end if; -- if (MV.Grade_Use and 2) /= 0 then -- Coords (2) := MV.Coordinates (2); -- Coords (3) := -MV.Coordinates (1); -- end if; -- if (MV.Grade_Use and 4) /= 0 then -- Coords (1) := MV.Coordinates (4); -- end if; -- return (MV.Grade_Use, Coords); -- end Dual; -- ------------------------------------------------------------------------- -- function e1 (V : E2GA.Vector) return float is -- begin -- return E2GA.Get_Coord_1 (V); -- end e1; -- ------------------------------------------------------------------------ -- function e2 (V : E2GA.Vector) return float is -- begin -- return E2GA.Get_Coord_2 (V); -- end e2; -- ------------------------------------------------------------------------ -- function e1 return Vector is -- V : Vector; -- begin -- Set_Coords (V, e1_basis (1), e1_basis (2), e1_basis (3)); -- return V; -- end e1; -- ---------------------------------------------------------------------------- -- function e2 return Vector is -- V : Vector; -- begin -- Set_Coords (V, e2_basis (1), e2_basis (2), e2_basis (3)); -- return V; -- end e2; -- ------------------------------------------------------------------------ -- function e3 return Vector is -- V : Vector; -- begin -- Set_Coords (V, e3_basis (1), e3_basis (2), e3_basis (3)); -- return V; -- end e3; -- ------------------------------------------------------------------------ function e1 return Multivectors.M_Vector is Basis : Multivectors.M_Vector; begin Multivectors.Add_Blade (Basis, Blade_Types.E3_e1, 1.0); return Basis; end e1; -- ------------------------------------------------------------------------- function e1 (MV : Multivectors.Multivector) return float is use Blade_Types; begin return Component (MV, E3_Base'Enum_Rep (E3_e1)); end e1; -- ------------------------------------------------------------------------- function e2 return Multivectors.M_Vector is use Blade_Types; Basis : Multivectors.M_Vector; begin Multivectors.Add_Blade (Basis, E3_e2, 1.0); return Basis; end e2; -- ------------------------------------------------------------------------- function e2 (MV : Multivectors.Multivector) return float is use Blade_Types; begin return Component (MV, E3_Base'Enum_Rep (E3_e2)); end e2; -- ------------------------------------------------------------------------- function e3 return Multivectors.M_Vector is use Blade_Types; Basis : Multivectors.M_Vector; begin Multivectors.Add_Blade (Basis, E3_e3, 1.0); return Basis; end e3; -- ------------------------------------------------------------------------- function e3 (MV : Multivectors.Multivector) return float is use Blade_Types; begin return Component (MV, E3_Base'Enum_Rep (E3_e3)); end e3; -- ------------------------------------------------------------------------- function e1_e2 (MV : Multivectors.Multivector) return float is use Interfaces; use Blade_Types; BM_E12 : constant Unsigned_32 := Unsigned_32 (E3_Base'Enum_Rep (E3_e1)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e2)); begin return Component (MV, BM_E12); end e1_e2; -- ------------------------------------------------------------------------- function e1_e3 (MV : Multivectors.Multivector) return float is use Interfaces; use Blade_Types; BM_E13 : constant Unsigned_32 := Unsigned_32 (E3_Base'Enum_Rep (E3_e1)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e3)); begin return Component (MV, BM_E13); end e1_e3; -- ------------------------------------------------------------------------- function e2_e3 (MV : Multivectors.Multivector) return float is use Interfaces; use Blade_Types; BM_E23 : constant Unsigned_32 := Unsigned_32 (E3_Base'Enum_Rep (E3_e2)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e3)); begin return Component (MV, BM_E23); end e2_e3; -- ------------------------------------------------------------------------- function e3_e1 (MV : Multivectors.Multivector) return float is use Interfaces; use Blade_Types; BM_E31 : constant Unsigned_32 := Unsigned_32 (E3_Base'Enum_Rep (E3_e1)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e3)); begin return Component (MV, BM_E31); end e3_e1; -- ------------------------------------------------------------------------- function e1_e2_e3 (MV : Multivectors.Multivector) return float is use Interfaces; use Blade_Types; BM : constant Unsigned_32 := Unsigned_32 (E3_Base'Enum_Rep (E3_e1)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e2)) or Unsigned_32 (E3_Base'Enum_Rep (E3_e3)); begin return Component (MV, BM); end e1_e2_e3; -- ------------------------------------------------------------------------- -- function e1e2 (R : Rotor) return float is -- use Blade_List_Package; -- Blades : constant Blade_List := Get_Blade_List (R); -- Curs : Cursor := Blades.First; -- begin -- Next (Curs); -- return Blade.Weight (Element (Curs)); -- return R.C2_e1e2; -- end e1e2; -- ------------------------------------------------------------------------ -- function e2e3 (R : Rotor) return float is -- use Blade_List_Package; -- Blades : constant Blade_List := Get_Blade_List (R); -- Curs : Cursor := Blades.First; -- begin -- Next (Curs); -- Next (Curs); -- return Blade.Weight (Element (Curs)); -- -- return R.C3_e2e3; -- end e2e3; -- ------------------------------------------------------------------------ -- function e3e1 (R : Rotor) return float is -- use Blade_List_Package; -- Blades : constant Blade_List := Get_Blade_List (R); -- begin -- return Blade.Weight (Blades.Last_Element); -- end e3e1; -- ------------------------------------------------------------------------ -- -- function Get_Coord_1 (V : Vector) return float is -- begin -- return V.Coordinates (1); -- end Get_Coord_1; -- ------------------------------------------------------------------------ -- function Get_Coord_2 (V : Vector) return float is -- begin -- return V.Coordinates (2); -- end Get_Coord_2; -- ------------------------------------------------------------------------ -- function Get_Coord_3 (V : Vector) return float is -- begin -- return V.Coordinates (3); -- end Get_Coord_3; -- ------------------------------------------------------------------------ -- function Get_Coord (S : Multivector.Scalar) return float is -- use Multivector.Blade_List_Package; -- Blades : Multivector.Blade_List := Multivector.Get_Blade_List (S); -- begin -- return Blade.Weight (Blades.First_Element); -- end Get_Coord; -- ------------------------------------------------------------------------ -- function Get_Coord_1 (V : Multivector.M_Vector) return float is -- use Multivector.Blade_List_Package; -- Blades : Multivector.Blade_List := Multivector.Get_Blade_List (V); -- begin -- return Blade.Weight (Blades.First_Element); -- end Get_Coord_1; -- ------------------------------------------------------------------------ -- function Get_Coord_2 (V : Multivector.M_Vector) return float is -- use Multivector.Blade_List_Package; -- Blades : Multivector.Blade_List := Multivector.Get_Blade_List (V); -- Curs : Cursor := Blades.First; -- begin -- Next (Curs); -- return Blade.Weight (Element (Curs)); -- end Get_Coord_2; -- ------------------------------------------------------------------------ -- function Get_Coord_3 (V : Multivector.M_Vector) return float is -- use Multivector.Blade_List_Package; -- Blades : Multivector.Blade_List := Multivector.Get_Blade_List (V); -- begin -- return Blade.Weight (Blades.Last_Element); -- end Get_Coord_3; -- ------------------------------------------------------------------------ -- function Get_Coords (V : Vector) return Array_3D is -- begin -- return (V (1), V (2), V (3)); -- end Get_Coords; -- ------------------------------------------------------------------------ -- function Get_Unsigned_Coords (V : Vector) return Vector_Unsigned is -- begin -- return To_Unsigned (V); -- end Get_Unsigned_Coords; -- ------------------------------------------------------------------------- -- function Geometric_Product (V1, V2 : Vector) return Rotor is -- begin -- return (V1.Coordinates (1) * V2.Coordinates (1) + -- V1.Coordinates (2) * V2.Coordinates (2) + -- V1.Coordinates (3) * V2.Coordinates (3), -- -V1.Coordinates (2) * V2.Coordinates (1) + -- V1.Coordinates (1) * V2.Coordinates (2), -- V1.Coordinates (2) * V2.Coordinates (3) - -- V1.Coordinates (2) * V2.Coordinates (2), -- -V1.Coordinates (1) * V2.Coordinates (3) + -- V1.Coordinates (3) * V2.Coordinates (1)); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Get_Size (MV : Multivector) return Integer is -- begin -- return MV_Size (Integer (MV.Grade_Use)); -- end Get_Size; -- ------------------------------------------------------------------------ -- function Geometric_Product (BV : Bivector; R : Rotor) return Rotor is -- begin -- return (-BV.C2_e2e3 * R.C3_e2e3 - BV.C3_e3e1 * R.C4_e3e1 - BV.C1_e1e2 * R.C2_e1e2, -- BV.C1_e1e2 * R.C1_Scalar - BV.C2_e2e3 * R.C4_e3e1 + BV.C3_e3e1 * R.C3_e2e3, -- BV.C1_e1e2 * R.C4_e3e1 - BV.C3_e3e1 * R.C2_e1e2 + BV.C2_e2e3 * R.C1_Scalar, -- BV.C2_e2e3 * R.C2_e1e2 + BV.C3_e3e1 * R.C1_Scalar - BV.C1_e1e2 * R.C3_e2e3); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (R : Rotor; BV : Bivector) return Rotor is -- begin -- return (-R.C3_e2e3 * BV.C2_e2e3 - R.C2_e1e2 * BV.C1_e1e2 - R.C4_e3e1 * BV.C3_e3e1, -- -R.C3_e2e3 * BV.C3_e3e1 + R.C1_Scalar * BV.C1_e1e2 + R.C4_e3e1 * BV.C2_e2e3, -- R.C1_Scalar * BV.C2_e2e3 - R.C4_e3e1 * BV.C1_e1e2 + R.C2_e1e2 * BV.C3_e3e1, -- R.C1_Scalar * BV.C3_e3e1 + R.C3_e2e3 * BV.C1_e1e2 - R.C2_e1e2 * BV.C2_e2e3); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (R : Rotor; V : Vector) return Syn_SMultivector is -- begin -- return (R.C2_e1e2 * V.Coordinates (2) - R.C4_e3e1 * V.Coordinates (3) + -- R.C1_Scalar * V.Coordinates (1), -- -R.C2_e1e2 * V.Coordinates (1) + R.C3_e2e3 * V.Coordinates (3) + -- R.C1_Scalar * V.Coordinates (2), -- R.C1_Scalar * V.Coordinates (3) + R.C4_e3e1 * V.Coordinates (1) - -- R.C3_e2e3 * V.Coordinates (2), -- R.C2_e1e2 * V.Coordinates (3) + R.C4_e3e1 * V.Coordinates (2) + -- R.C3_e2e3 * V.Coordinates (1)); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (R1, R2 : Rotor) return Rotor is -- begin -- return (-R1.C2_e1e2 * R2.C2_e1e2 - R1.C3_e2e3 * R2.C3_e2e3 - R1.C4_e3e1 * R2.C4_e3e1 + R1.C1_Scalar * R2.C1_Scalar, -- -R1.C3_e2e3 * R2.C4_e3e1 + R1.C2_e1e2 * R2.C1_Scalar + R1.C4_e3e1 * R2.C3_e2e3 + R1.C1_Scalar * R2.C2_e1e2, -- -R1.C4_e3e1 * R2.C2_e1e2 + R1.C1_Scalar * R2.C3_e2e3 - R1.C2_e1e2 * R2.C4_e3e1 + R1.C3_e2e3 * R2.C1_Scalar, -- -R1.C2_e1e2 * R2.C3_e2e3 + R1.C3_e2e3 * R2.C2_e1e2 + R1.C4_e3e1 * R2.C1_Scalar + R1.C1_Scalar * R2.C4_e3e1); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (R : Rotor; MV : Syn_SMultivector) return Syn_SMultivector is -- begin -- return (-R.C4_e3e1 * MV.C3_e3 + R.C2_e1e2 * MV.C2_e2 + R.C1_Scalar * MV.C1_e1 - R.C3_e2e3 * MV.C4_e1e2e3, -- R.C3_e2e3 * MV.C3_e3 - R.C4_e3e1 * MV.C4_e1e2e3 + R.C1_Scalar * MV.C2_e2 - R.C2_e1e2 * MV.C1_e1, -- R.C4_e3e1 * MV.C1_e1 - R.C3_e2e3 * MV.C2_e2 - R.C2_e1e2 * MV.C4_e1e2e3 + R.C1_Scalar * MV.C3_e3, -- R.C3_e2e3 * MV.C1_e1 + R.C1_Scalar * MV.C3_e3 + R.C4_e3e1 * MV.C2_e2 + R.C2_e1e2 * MV.C3_e3); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (V : Vector; MV : Syn_SMultivector) return Rotor is -- begin -- return (V.Coordinates (1) * MV.C1_e1 + V.Coordinates (2) * MV.C2_e2 + -- V.Coordinates (3) * MV.C3_e3, -- V.Coordinates (1) * MV.C2_e2 + V.Coordinates (3) * MV.C4_e1e2e3 - -- V.Coordinates (2) * MV.C1_e1, -- -V.Coordinates (3) * MV.C2_e2 + V.Coordinates (1) * MV.C4_e1e2e3 + -- V.Coordinates (2) * MV.C3_e3, -- V.Coordinates (2) * MV.C4_e1e2e3 + V.Coordinates (3) * MV.C1_e1 - -- V.Coordinates (1) * MV.C3_e3); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Geometric_Product (V : Vector; R : Rotor) return Syn_SMultivector is -- begin -- return (V.Coordinates (3) * R.C4_e3e1 + V.Coordinates (1) * R.C1_Scalar - -- V.Coordinates (2) * R.C2_e1e2, -- -V.Coordinates (3) * R.C3_e2e3 + V.Coordinates (2) * R.C1_Scalar + -- V.Coordinates (1) * R.C2_e1e2, -- V.Coordinates (2) * R.C3_e2e3 - V.Coordinates (1) * R.C4_e3e1 + -- V.Coordinates (3) * R.C1_Scalar, -- V.Coordinates (1) * R.C3_e2e3 + V.Coordinates (3) * R.C2_e1e2 + -- V.Coordinates (2) * R.C4_e3e1); -- end Geometric_Product; -- ------------------------------------------------------------------------ -- function Get_Coord (S : Scalar) return float is -- begin -- return S.Coordinates (1); -- end Get_Coord; -- ------------------------------------------------------------------------ -- function Get_Coords (BV : Bivector) return Array_3D is -- begin -- return (BV.C1_e1e2, BV.C2_e2e3, BV.C3_e3e1); -- end Get_Coords; -- ------------------------------------------------------------------------ function Get_Coords (MV : Multivector) return MV_Coordinate_Array is use Blade.Blade_List_Package; Blades : constant Blade.Blade_List := Multivectors.Get_Blade_List (MV); Curs : Cursor := Blades.First; Coords : E3GA.MV_Coordinate_Array := (others => 0.0); Index : Integer := 0; begin while Has_Element (Curs) loop Index := Index + 1; Coords (Index) := Blade.Weight (Element (Curs)); Next (Curs); end loop; return Coords; end Get_Coords; -- ------------------------------------------------------------------------ function Get_Coords (Vec : Multivectors.M_Vector) return E3_Vector is use Blade.Blade_List_Package; Blades : constant Blade.Blade_List := Multivectors.Get_Blade_List (Vec); Curs : Cursor := Blades.First; Coords : E3_Vector := (others => 0.0); begin Coords (GL.X) := GL.Types.Single (Blade.Weight (Element (Curs))); Next (Curs); Coords (GL.Y) := GL.Types.Single (Blade.Weight (Element (Curs))); Next (Curs); Coords (GL.Z) := GL.Types.Single (Blade.Weight (Element (Curs))); return Coords; end Get_Coords; -- ------------------------------------------------------------------------ function Get_Coords (R : Rotor) return Float_4D is use Interfaces; use Blade; use Blade_Types; use Blade_List_Package; Blades : constant Blade_List := Get_Blade_List (R); Curs : Cursor := Blades.First; BM : Unsigned_32; Result : Float_4D := (others => 0.0); begin Result (1) := Scalar_Part (R); while Has_Element (Curs) loop BM := Bitmap (Element (Curs)); if (BM and E3_Base'Enum_Rep (E3_e1)) /= 0 then Result (2) := Blade.Weight (Element (Curs)); end if; if (BM and E3_Base'Enum_Rep (E3_e2)) /= 0 then Result (3) := Blade.Weight (Element (Curs)); end if; if (BM and E3_Base'Enum_Rep (E3_e3)) /= 0 then Result (4) := Blade.Weight (Element (Curs)); end if; Next (Curs); end loop; return Result; -- return (R.C1_Scalar, R.C2_e1e2, R.C3_e2e3, R.C4_e3e1); end Get_Coords; -- ------------------------------------------------------------------------ -- function Get_Coords (SMV : Syn_SMultivector) return Array_4D is -- begin -- return (SMV.C1_e1, SMV.C2_e2, SMV.C3_e3, SMV.C4_e1e2e3); -- end Get_Coords; -- ------------------------------------------------------------------------ function Is_Zero (V : E3_Vector) return Boolean is use GL; use GL.Types; begin return (V (X) = 0.0 and V (Y) = 0.0 and V (Z) = 0.0); end Is_Zero; -- ------------------------------------------------------------------------ function Get_Outermorphism (OM : Outermorphism) return Array_19F is begin return Array_19F (OM); end Get_Outermorphism; -- ------------------------------------------------------------------------ -- function Grade_Use (BV : Bivector) return GA_Maths.Unsigned_32 is -- begin -- return BV.Grade_Use; -- end Grade_Use; -- ------------------------------------------------------------------------ -- function Grade_Use (MV : Multivector) return GA_Maths.Unsigned_32 is -- begin -- return MV.Grade_Use; -- end Grade_Use; -- ------------------------------------------------------------------------ -- Based on c3ga.h scalar inverse -- function Inverse (S : Float) return Float is -- S2 : constant Float := S * S; -- Inv : Float := S; -- begin -- -- scalar inverse doesn't include this test -- if S2 /= 0.0 then -- Inv := 1.0 / S2; -- end if; -- return S * Inv; -- end Inverse; -- ------------------------------------------------------------------------ -- Based on e3ga.h rotor inverse -- function Inverse (aRotor : Rotor) return Rotor is -- use Blade_List_Package; -- use Blade; -- Blades : Blade_List := Get_Blade_List (aRotor); -- Curs : Cursor := Blades.First; -- aBlade : Basis_Blade; -- Norm_Inv : Float; -- Index : E3_Base := Blade.E3_e1; -- Inv_Blades : Blade_List; -- Inv_R : Rotor; -- begin -- Norm_Inv := 1.0 / Dot_Product (aRotor, aRotor); -- Inv_R := New_Multivector (Norm_Inv * Scalar_Part (aRotor)); -- -- Norm_Inv := -Norm_Inv; -- while Has_Element (Curs) loop -- aBlade := New_Basis_Blade (Index, Norm_Inv * Weight (Element (Curs))); -- Inv_Blades.Append (aBlade); -- Index := Blade.E3_Base'Succ (Index); -- Next (Curs); -- end loop; -- Update (Inv_R, Inv_Blades); -- return Inv_R; -- -- return (Norm_Inv * aRotor.C1_Scalar, -Norm_Inv * aRotor.C2_e1e2, -- -- -Norm_Inv * aRotor.C3_e2e3, -Norm_Inv * aRotor.C4_e3e1); -- -- exception -- when anError : others => -- Put_Line ("An exception occurred in E3GA.Inverse."); -- raise; -- end Inverse; -- ------------------------------------------------------------------------ -- function Inverse (V : Vector) return Vector is -- Norm_Inv : float := 1.0 / Dot_Product (V, V); -- Result : Vector; -- begin -- Set_Coords (Result, Norm_Inv * V.Coordinates (1), Norm_Inv * V.Coordinates (2), -- Norm_Inv * V.Coordinates (3)); -- return Result; -- end Inverse; -- ------------------------------------------------------------------------ -- function Left_Contraction (BV1, BV2 : Bivector) return Scalar is -- LC : Scalar; -- begin -- LC.Coordinates (1) := -Dot_Product (BV1, BV2); -- return LC; -- end Left_Contraction; -- ------------------------------------------------------------------------ -- function Left_Contraction (MV1, MV2 : Multivector) return Multivector is -- Value : MV_Coordinate_Array := (others => 0.0); -- begin -- if (MV2.Grade_Use and 1) /= 0 and then -- (MV1.Grade_Use and 1) /= 0 then -- Value (1) := MV1.Coordinates (1) * MV2.Coordinates (1); -- end if; -- -- if (MV2.Grade_Use and 2) /= 0 then -- if (MV1.Grade_Use and 1) /= 0 then -- Value (2) := MV1.Coordinates (1) * MV2.Coordinates (2); -- Value (3) := MV1.Coordinates (1) * MV2.Coordinates (3); -- Value (4) := MV1.Coordinates (1) * MV2.Coordinates (4); -- end if; -- if (MV1.Grade_Use and 2) /= 0 then -- Value (1) := Value (1) + MV1.Coordinates (2) * MV2.Coordinates (2) + -- MV1.Coordinates (3) * MV2.Coordinates (3) + -- MV1.Coordinates (4) * MV2.Coordinates (4); -- end if; -- end if; -- if (MV2.Grade_Use and 4) /= 0 then -- if (MV1.Grade_Use and 1) /= 0 then -- Value (5) := MV1.Coordinates (1) * MV2.Coordinates (5); -- Value (6) := MV1.Coordinates (1) * MV2.Coordinates (6); -- Value (7) := MV1.Coordinates (1) * MV2.Coordinates (7); -- end if; -- if (MV1.Grade_Use and 2) /= 0 then -- Value (2) := Value (2) - MV1.Coordinates (3) * MV2.Coordinates (5) -- + MV1.Coordinates (4) * MV2.Coordinates (7); -- Value (3) := Value (3) - MV1.Coordinates (4) * MV2.Coordinates (6) -- + MV1.Coordinates (2) * MV2.Coordinates (5); -- end if; -- if (MV1.Grade_Use and 4) /= 0 then -- Value (1) := Value (1) - MV1.Coordinates (5) * MV2.Coordinates (5) -- - MV1.Coordinates (6) * MV2.Coordinates (6) -- - MV1.Coordinates (7) * MV2.Coordinates (7); -- end if; -- end if; -- if (MV2.Grade_Use and 8) /= 0 then -- if (MV1.Grade_Use and 1) /= 0 then -- Value (8) := MV1.Coordinates (1) * MV2.Coordinates (8); -- end if; -- if (MV1.Grade_Use and 2) /= 0 then -- Value (5) := Value (5) + MV1.Coordinates (4) * MV2.Coordinates (8); -- Value (6) := Value (6) + MV1.Coordinates (2) * MV2.Coordinates (8); -- Value (7) := Value (7) + MV1.Coordinates (3) * MV2.Coordinates (8); -- end if; -- if (MV1.Grade_Use and 4) /= 0 then -- Value (1) := Value (1) - MV1.Coordinates (6) * MV2.Coordinates (8) -- - MV1.Coordinates (7) * MV2.Coordinates (8) -- - MV1.Coordinates (5) * MV2.Coordinates (8); -- end if; -- end if; -- if (MV1.Grade_Use and 8) /= 0 then -- Value (1) := Value (1) - MV1.Coordinates (8) * MV2.Coordinates (8); -- end if; -- return (MV1.Grade_Use, Value); -- end Left_Contraction; -- ------------------------------------------------------------------------ -- function Left_Contraction (V : Vector; BV : Bivector) return Vector is -- BC : GA_Maths.Array_3D := Get_Coords (BV); -- LC : Vector; -- begin -- Set_Coords (LC, -V.Coordinates (2) * BC (1) + V.Coordinates (3) * BC (3), -- V.Coordinates (1) * BC (1) - V.Coordinates (3) * BC (2), -- -V.Coordinates (1) * BC (3) + V.Coordinates (2) * BC (2)); -- Return LC; -- end Left_Contraction; -- ------------------------------------------------------------------------ -- function Left_Contraction (V1 : Vector; V2 : Vector) return Scalar is -- LC : Scalar; -- begin -- LC.Coordinates (1) := Dot_Product (V1, V2); -- return LC; -- end Left_Contraction; -- ------------------------------------------------------------------------ -- function Magnitude (V : Vector) return float is -- begin -- return Float_Functions.Sqrt (V.Coordinates (1) * V.Coordinates (1) + -- V.Coordinates (2) * V.Coordinates (2) + -- V.Coordinates (3) * V.Coordinates (3)); -- end Magnitude; -- ------------------------------------------------------------------------ -- function MV_String (MV : Multivector; Text : String := "") return -- Ada.Strings.Unbounded.Unbounded_String is -- use Interfaces; -- use Ada.Strings.Unbounded; -- Std_Idx : Integer := 0; -- Buffer : Unbounded_String := To_Unbounded_String (Text); -- Float_Buf : Unbounded_String := To_Unbounded_String (""); -- Grade_Use : Unsigned_32 := Unsigned_32 (MV.Grade_Use); -- Coord : float; -- ia : integer := 1; -- bei : integer; -- k : integer := 1; -- Count : integer := 0; -- begin -- -- Print all coordinates -- for i in 0 .. 3 loop -- if (Grade_Use and Shift_Left (1, i)) /= 0 then -- for j in 1 .. MV_Grade_Size (i + 1) loop -- Coord := MV_Basis_Element_Sign_By_Index (ia) * MV.Coordinates (k); -- -- goal: print [+|-]obj.m_c[k][* basisVector1 ^ ... ^ basisVectorN] -- Float_Buf := To_Unbounded_String (float'Image (Abs (Coord))); -- if Abs (Coord) /= 0.0 then -- if Coord < 1.0 and Count = 0 then -- Buffer := Buffer & " - "; -- end if; -- Buffer := Buffer & Float_Buf; -- -- if ia /= 0 then -- Buffer := Buffer & "*"; -- bei := 0; -- while MV_Basis_Elements (ia, bei) >= 0 loop -- if bei /= 0 then -- Buffer := Buffer & "^"; -- end if; -- Buffer := Buffer & -- MV_Basis_Vector_Names (MV_Basis_Elements (ia, bei) + 1); -- bei := bei + 1; -- end loop; -- Count := Count + 1; -- end if; -- k := k + 1; -- ia := ia + 1; -- elsif ia < 8 - MV_Grade_Size (i) then -- ia := ia + MV_Grade_Size (i); -- end if; -- end loop; -- if Count = 0 then -- Buffer := Buffer & "0"; -- end if; -- end if; -- end loop; -- return Buffer; -- end MV_String; -- ------------------------------------------------------------------------ -- function Norm_E2 (V : Vector) return Scalar is -- Norm : Scalar; -- begin -- Norm.Coordinates (1) := V.Coordinates (1) * V.Coordinates (1) + -- V.Coordinates (2) * V.Coordinates (2) + -- V.Coordinates (3) * V.Coordinates (3); -- return Norm; -- end Norm_E2; -- ------------------------------------------------------------------------ -- function Norm_E2 (BV : Bivector) return Scalar is -- Norm : Scalar; -- begin -- Norm.Coordinates (1) := BV.C1_e1e2 * BV.C1_e1e2 + BV.C2_e2e3 * BV.C2_e2e3 + -- BV.C3_e3e1 * BV.C3_e3e1; -- return Norm; -- end Norm_E2; -- ------------------------------------------------------------------------ -- function Norm_E2 (MV : E2GA.Multivector) return Scalar is -- Value : float := 0.0; -- Norm : Scalar; -- begin -- if (MV.Grade_Use and 1) /= 0 then -- Value := MV.Coordinates (1) * MV.Coordinates (1); -- end if; -- if (MV.Grade_Use and 2) /= 0 then -- Value := Value + MV.Coordinates (2) * MV.Coordinates (2) + -- MV.Coordinates (3) * MV.Coordinates (3); -- end if; -- if (MV.Grade_Use and 4) /= 0 then -- Value := Value + MV.Coordinates (4) * MV.Coordinates (4); -- -- MV.Coordinates (5) * MV.Coordinates (5) + -- -- MV.Coordinates (6) * MV.Coordinates (6); -- end if; -- -- Norm.Coordinates (1) := Value; -- return Norm; -- end Norm_E2; -- ------------------------------------------------------------------------ -- function Norm_E2 (R : Rotor) return Scalar is -- Norm : Scalar; -- begin -- Norm.Coordinates (1) := R.C2_e1e2 * R.C2_e1e2 + R.C3_e2e3 * R.C3_e2e3 + -- R.C4_e3e1 * R.C4_e3e1; -- return Norm; -- end Norm_E2; -- ------------------------------------------------------------------------ -- function Norm_E2 (TV : Trivector) return Scalar is -- begin -- return Scalar (TV * TV); -- end Norm_E2; -- ------------------------------------------------------------------------ -- function Norm_R (BV : Bivector) return Scalar is -- use GA_Maths.Float_Functions; -- DP : constant float := Dot_Product (BV, BV); -- Result : Scalar; -- begin -- Result.Coordinates (1) := 0.0; -- if DP /= 0.0 then -- if DP < 0.0 then -- Result.Coordinates (1) := -Sqrt (-DP); -- else -- Result.Coordinates (1) := Sqrt (DP); -- end if; -- end if; -- return Result; -- end Norm_R; -- ------------------------------------------------------------------------ -- function Norm_R2 (BV : Bivector) return Scalar is -- Norm : Scalar; -- begin -- Norm.Coordinates (1) := Dot_Product (BV, BV); -- return Norm; -- end Norm_R2; -- ------------------------------------------------------------------------ function Outer_Product (V1, V2 : E3_Vector) return E3_Vector is use GL.Types; begin return (V1 (GL.X) * V2 (GL.Y) - V1 (GL.Y) * V2 (GL.X), V1 (GL.Y) * V2 (GL.Z) - V1 (GL.Z) * V2 (GL.Y), V1 (GL.Z) * V2 (GL.X) - V1 (GL.X) * V2 (GL.Z)); end Outer_Product; -- ------------------------------------------------------------------------ -- function R_Scalar (R : Multivector.Rotor) return float is -- begin -- return R.C1_Scalar; -- end R_Scalar; -- ----------------------------------------------------------------------- -- function Scalar_Product (V1, V2 : Vector) return Scalar is -- Product : Scalar; -- begin -- Product.Coordinates (1) := Dot_Product (V1, V2); -- return Product; -- end Scalar_Product; -- ------------------------------------------------------------------------ -- procedure Set_Bivector (BV : out Bivector; C1, C2, C3 : float) is -- begin -- BV.C1_e1e2 := C1; -- BV.C2_e2e3 := C2; -- BV.C3_e3e1 := C3; -- end Set_Bivector; -- ------------------------------------------------------------------------ -- procedure Set_Coords (V : out Vector; C1, C2, C3 : float) is -- begin -- V.Coordinates (1) := C1; -- V.Coordinates (2) := C2; -- V.Coordinates (3) := C3; -- end Set_Coords; -- ------------------------------------------------------------ procedure Set_Coords (MV : out Multivectors.Multivector; C1, C2, C3 : float) is use Blade_Types; begin Multivectors.Add_Blade (MV, E3_e1, C1); Multivectors.Add_Blade (MV, E3_e2, C2); Multivectors.Add_Blade (MV, E3_e3, C3); end Set_Coords; -- ------------------------------------------------------------ -- procedure Set_Rotor (X : out Rotor; BV : Bivector) is -- begin -- X := (1.0, BV.C1_e1e2, BV.C2_e2e3, BV.C3_e3e1); -- end Set_Rotor; -- ------------------------------------------------------------------------ -- procedure Set_Rotor (X : out Rotor; C_Scalar : float; BV : Bivector) is -- begin -- X := (C_Scalar, BV.C1_e1e2, BV.C2_e2e3, BV.C3_e3e1); -- end Set_Rotor; -- ------------------------------------------------------------------------ -- procedure Set_Rotor (X : out Rotor; MV : Multivector) is -- begin -- X := (MV.Coordinates (1), -- MV.Coordinates (2), MV.Coordinates (3), MV.Coordinates (4)); -- end Set_Rotor; -- ------------------------------------------------------------------------ -- procedure Set_Rotor (X : out Rotor; C_Scalar : float) is -- begin -- X := (C_Scalar, 0.0, 0.0, 0.0); -- end Set_Rotor; -- ------------------------------------------------------------------------ -- procedure Set_Rotor (X : out Rotor; C_Scalar, C2, C3, C4 : float) is -- begin -- X := (C_Scalar, C2, C3, C4); -- end Set_Rotor; -- ------------------------------------------------------------------------ -- procedure Set_Scalar (S : out Scalar; Value : float) is -- begin -- S.Coordinates (1) := Value; -- end Set_Scalar; -- ------------------------------------------------------------------------ -- function To_Unsigned (V : Vector) return Vector_Unsigned is -- use Interfaces; -- begin -- return (Unsigned_64 (Abs (V.Coordinates (1))), Unsigned_64 (Abs (V.Coordinates (2))), -- Unsigned_64 (Abs (V.Coordinates (3)))); -- end To_Unsigned; -- ------------------------------------------------------------------------ -- function To_2D (V : Vector) return E2GA.Vector is -- V2 : E2GA.Vector; -- begin -- E2GA.Set_Coords (V2, V.Coordinates (1), V.Coordinates (2)); -- return V2; -- end To_2D; -- ------------------------------------------------------------------------ -- function To_3D (V : E2GA.Vector) return Vector is -- theVector : Vector; -- begin -- theVector.Coordinates (1) := E2GA.Get_Coord_1 (V); -- theVector.Coordinates (2) := E2GA.Get_Coord_2 (V); -- return theVector; -- end To_3D; -- ------------------------------------------------------------------------ -- function To_Vector (MV : Syn_SMultivector) return Vector is -- V : Vector; -- begin -- Set_Coords (V, MV.C1_e1, MV.C2_e2, MV.C3_e3); -- return V; -- end To_Vector; -- ------------------------------------------------------------------------ function To_MV_Vector (V : E3_Vector) return Multivectors.M_Vector is use Blade_Types; MVV : Multivectors.M_Vector; begin Multivectors.Add_Blade (MVV, Blade.New_Basis_Blade (C3_e1, Float (V (GL.X)))); Multivectors.Add_Blade (MVV, Blade.New_Basis_Blade (C3_e2, Float (V (GL.Y)))); Multivectors.Add_Blade (MVV, Blade.New_Basis_Blade (C3_e3, Float (V (GL.Z)))); return MVV; end To_MV_Vector; -- ------------------------------------------------------------------------ -- Unit_e normalizes rotor R -- function Unit_e (R : Rotor) return Rotor is -- R2 : float; -- Scale : float; -- Norm_Rotor : Rotor; -- begin -- R2 := R.C1_Scalar * R.C1_Scalar + R.C2_e1e2 * R.C2_e1e2 + -- R.C3_e2e3 * R.C3_e2e3 + R.C4_e3e1 * R.C4_e3e1; -- Scale := 1.0 / (Float_Functions.Sqrt (R2)); -- -- Set_Rotor (Norm_Rotor, R.C1_Scalar * Scale, R.C2_e1e2 * Scale, -- R.C3_e2e3 * Scale, R.C4_e3e1 * Scale); -- return Norm_Rotor; -- end Unit_E; -- ------------------------------------------------------------------------ -- Unit_E normalizes vector X function Unit_E (X : E3_Vector) return E3_Vector is use Gl.Types; use Gl.Types.Singles; use Maths.Single_Math_Functions; E2 : constant Single := Dot_Product (X, X); IE : constant Single := 1.0 / Sqrt (E2); begin return (IE * X); end Unit_E; -- ------------------------------------------------------------------------ end E3GA;

41.762871

130

0.42118

201ce9db73f4994a1962a1aa3f830adb89367eb1

5,315

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/scng.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/scng.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/scng.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S C N G -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2006, 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. -- -- -- ------------------------------------------------------------------------------ -- This package contains a generic lexical analyzer. This is used -- for scanning Ada source files or text files with an Ada-like syntax, -- such as project files. It is instantiated in Scn and Prj.Err. with Casing; use Casing; with Styleg; with Types; use Types; generic with procedure Post_Scan; -- Procedure called by Scan for the following tokens: -- Tok_Char_Literal, Tok_Identifier, Tok_Real_Literal, Tok_Real_Literal, -- Tok_Integer_Literal, Tok_String_Literal, Tok_Operator_Symbol. with procedure Error_Msg (Msg : String; Flag_Location : Source_Ptr); -- Output a message at specified location with procedure Error_Msg_S (Msg : String); -- Output a message at current scan pointer location with procedure Error_Msg_SC (Msg : String); -- Output a message at the start of the current token with procedure Error_Msg_SP (Msg : String); -- Output a message at the start of the previous token with procedure Obsolescent_Check (S : Source_Ptr); -- Called when one of the obsolescent character replacements is -- used with S pointing to the character in question. with package Style is new Styleg (Error_Msg, Error_Msg_S, Error_Msg_SC, Error_Msg_SP); -- Instantiation of Styleg with the same error reporting routines package Scng is procedure Initialize_Scanner (Index : Source_File_Index); -- Initialize lexical scanner for scanning a new file referenced by Index. -- Initialize_Scanner does not call Scan. procedure Scan; -- Scan scans out the next token, and advances the scan state accordingly -- (see package Scan_State for details). If the scan encounters an illegal -- token, then an error message is issued pointing to the bad character, -- and Scan returns a reasonable substitute token of some kind. -- For tokens Char_Literal, Identifier, Real_Literal, Integer_Literal, -- String_Literal and Operator_Symbol, Post_Scan is called after scanning. function Determine_Token_Casing return Casing_Type; pragma Inline (Determine_Token_Casing); -- Determines the casing style of the current token, which is -- either a keyword or an identifier. See also package Casing. procedure Set_Special_Character (C : Character); -- Indicate that one of the following character '#', '$', '?', '@', '`', -- '\', '^', '_' or '~', when found is a Special token. procedure Reset_Special_Characters; -- Indicate that there is no characters that are Special tokens., which -- is the default. procedure Set_End_Of_Line_As_Token (Value : Boolean); -- Indicate if End_Of_Line is a token or not. -- By default, End_Of_Line is not a token. procedure Set_Comment_As_Token (Value : Boolean); -- Indicate if a comment is a token or not. -- By default, a comment is not a token. function Set_Start_Column return Column_Number; -- This routine is called with Scan_Ptr pointing to the first character -- of a line. On exit, Scan_Ptr is advanced to the first non-blank -- character of this line (or to the terminating format effector if the -- line contains no non-blank characters), and the returned result is the -- column number of this non-blank character (zero origin), which is the -- value to be stored in the Start_Column scan variable. end Scng;

50.619048

78

0.592098

d0c618e09bbf7b1991e46223c007fb7417ddd0cb

5,966

adb

Ada

source/nodes/program-nodes-protected_body_stubs.adb

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/nodes/program-nodes-protected_body_stubs.adb

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/nodes/program-nodes-protected_body_stubs.adb

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

1

2019-10-16T09:05:27.000Z

-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- package body Program.Nodes.Protected_Body_Stubs is function Create (Protected_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Body_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Is_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Separate_Token : not null Program.Lexical_Elements .Lexical_Element_Access; With_Token : Program.Lexical_Elements.Lexical_Element_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Protected_Body_Stub is begin return Result : Protected_Body_Stub := (Protected_Token => Protected_Token, Body_Token => Body_Token, Name => Name, Is_Token => Is_Token, Separate_Token => Separate_Token, With_Token => With_Token, Aspects => Aspects, Semicolon_Token => Semicolon_Token, Enclosing_Element => null) do Initialize (Result); end return; end Create; function Create (Name : not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Aspects : Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Protected_Body_Stub is begin return Result : Implicit_Protected_Body_Stub := (Name => Name, Aspects => Aspects, 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 Name (Self : Base_Protected_Body_Stub) return not null Program.Elements.Defining_Identifiers .Defining_Identifier_Access is begin return Self.Name; end Name; overriding function Aspects (Self : Base_Protected_Body_Stub) return Program.Elements.Aspect_Specifications .Aspect_Specification_Vector_Access is begin return Self.Aspects; end Aspects; overriding function Protected_Token (Self : Protected_Body_Stub) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Protected_Token; end Protected_Token; overriding function Body_Token (Self : Protected_Body_Stub) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Body_Token; end Body_Token; overriding function Is_Token (Self : Protected_Body_Stub) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Is_Token; end Is_Token; overriding function Separate_Token (Self : Protected_Body_Stub) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Separate_Token; end Separate_Token; overriding function With_Token (Self : Protected_Body_Stub) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.With_Token; end With_Token; overriding function Semicolon_Token (Self : Protected_Body_Stub) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Semicolon_Token; end Semicolon_Token; overriding function Is_Part_Of_Implicit (Self : Implicit_Protected_Body_Stub) return Boolean is begin return Self.Is_Part_Of_Implicit; end Is_Part_Of_Implicit; overriding function Is_Part_Of_Inherited (Self : Implicit_Protected_Body_Stub) return Boolean is begin return Self.Is_Part_Of_Inherited; end Is_Part_Of_Inherited; overriding function Is_Part_Of_Instance (Self : Implicit_Protected_Body_Stub) return Boolean is begin return Self.Is_Part_Of_Instance; end Is_Part_Of_Instance; procedure Initialize (Self : in out Base_Protected_Body_Stub'Class) is begin Set_Enclosing_Element (Self.Name, Self'Unchecked_Access); for Item in Self.Aspects.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; null; end Initialize; overriding function Is_Protected_Body_Stub (Self : Base_Protected_Body_Stub) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Protected_Body_Stub; overriding function Is_Declaration (Self : Base_Protected_Body_Stub) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Declaration; overriding procedure Visit (Self : not null access Base_Protected_Body_Stub; Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is begin Visitor.Protected_Body_Stub (Self); end Visit; overriding function To_Protected_Body_Stub_Text (Self : in out Protected_Body_Stub) return Program.Elements.Protected_Body_Stubs .Protected_Body_Stub_Text_Access is begin return Self'Unchecked_Access; end To_Protected_Body_Stub_Text; overriding function To_Protected_Body_Stub_Text (Self : in out Implicit_Protected_Body_Stub) return Program.Elements.Protected_Body_Stubs .Protected_Body_Stub_Text_Access is pragma Unreferenced (Self); begin return null; end To_Protected_Body_Stub_Text; end Program.Nodes.Protected_Body_Stubs;

32.248649

79

0.715555

dcf1ddd7cecb2e9370c52cdb50fd22fd0ac2e030

47,600

ads

Ada

source/asis/asis-compilation_units.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

source/asis/asis-compilation_units.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

source/asis/asis-compilation_units.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- G E L A A S I S -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- -- -- This specification is derived from the Ada Semantic Interface -- -- Specification Standard (ISO/IEC 15291) and ASIS 1999 Issues. -- -- -- -- The copyright notice and the license provisions that follow apply to the -- -- part following the private keyword. -- -- -- -- Read copyright and license at the end of this file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ ------------------------------------------------------------------------------- ------------------------------------------------------------------------------- -- 10 package Asis.Compilation_Units ------------------------------------------------------------------------------- ------------------------------------------------------------------------------- with Asis.Ada_Environments.Containers; package Asis.Compilation_Units is -- pragma Preelaborate; ------------------------------------------------------------------------------- ------------------------------------------------------------------------------- -- Asis.Compilation_Units encapsulates a set of queries that implement the -- ASIS Compilation_Unit abstraction. -- -- More than one compilation unit may be manipulated at one time. (The exact -- number is subject to implementation specific limitations.) -- -- A specific Compilation_Unit value is valid (usable) for as long as the ASIS -- Context variable, used to create it, remains open. Once an ASIS Context is -- closed, all associated Compilation_Unit values become invalid. It is -- erroneous to use an invalid Compilation_Unit value. -- ------------------------------------------------------------------------------- -- 10.1 function Unit_Kind ------------------------------------------------------------------------------- function Unit_Kind (Compilation_Unit : in Asis.Compilation_Unit) return Asis.Unit_Kinds; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the compilation unit to query -- -- Returns the Unit_Kinds value of the compilation unit. -- Returns Not_A_Unit for a Nil_Compilation_Unit. -- -- All Unit_Kinds are expected. -- -- Returns An_Unknown_Unit for any compilation unit that exists, but that -- does not have semantic element information available through ASIS. -- -- Returns a nonexistent kind for units that have name-only entries in the -- environment Context. Such entries may exist for names because: -- -- - They represent an illegal compilation unit added to the environment. -- -- - They are referenced by some existing unit, but the program text for the -- referenced unit has never been supplied, compiled, or otherwise -- inserted into the environment. -- -- - They represent a separate subunit that has never been supplied, -- compiled, or otherwise inserted into the environment. -- -- - The unit may have existed at one time but the semantic information is no -- longer available. It may be inconsistent, have been removed by some -- user or Ada environment operations, or simply have been lost as the -- result of some sort of failure. -- ------------------------------------------------------------------------------- -- 10.2 function Unit_Class ------------------------------------------------------------------------------- function Unit_Class (Compilation_Unit : in Asis.Compilation_Unit) return Asis.Unit_Classes; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the compilation unit to query -- -- Returns the Unit_Classes value of the compilation unit. -- Returns Not_A_Class for a Nil_Compilation_Unit. -- -- All Unit_Kinds are expected. -- ------------------------------------------------------------------------------- -- 10.3 function Unit_Origin ------------------------------------------------------------------------------- function Unit_Origin (Compilation_Unit : in Asis.Compilation_Unit) return Asis.Unit_Origins; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the compilation unit to query -- -- Returns the Unit_Origins value of the unit. -- Returns Not_An_Origin for a compilation_unit whose Unit_Kind is -- Not_A_Unit, An_Unknown_Unit, A_Nonexistent_Declaration, or -- A_Nonexistent_Body. -- -- All Unit_Kinds are expected. -- ------------------------------------------------------------------------------- ------------------------------------------------------------------------------- -- 10.4 function Enclosing_Context ------------------------------------------------------------------------------- function Enclosing_Context (Compilation_Unit : in Asis.Compilation_Unit) return Asis.Context; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose Context is required -- -- Returns the Context containing the compilation unit. -- -- Compilation units always remember the ASIS Context and Container from -- which they were obtained. -- -- Because Context is limited private, this function is only intended to be -- used to supply a Context parameter for other queries. This conveniently -- eliminates the need to make the original Context visible at the place of -- each call where a Context parameter is required. -- -- Two Compilation_Unit values, that represent the same physical compilation -- units (same Ada implementor Context implementation unit value) will test as -- Is_Equal, but not Is_Identical, if they were obtained from different open -- ASIS Context variables. -- -- Raises ASIS_Inappropriate_Compilation_Unit if the unit is a -- Nil_Compilation_Unit. -- ------------------------------------------------------------------------------- -- 10.5 function Enclosing_Container ------------------------------------------------------------------------------- function Enclosing_Container (Compilation_Unit : in Asis.Compilation_Unit) return Asis.Ada_Environments.Containers.Container; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose Container is required -- -- Returns the Container of the Context containing the compilation unit. -- Compilation units always remember the ASIS Context and Container from -- which they were obtained. -- -- Raises ASIS_Inappropriate_Compilation_Unit if the unit is a -- Nil_Compilation_Unit. -- ------------------------------------------------------------------------------- -- 10.6 function Library_Unit_Declaration ------------------------------------------------------------------------------- function Library_Unit_Declaration (Name : in Wide_String; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Name - Specifies the defining program unit name -- The_Context - Specifies a program Context environment -- -- Returns the library_unit_declaration or library_unit_renaming_declaration -- with the name, contained in The_Context. -- -- This query will never return a unit with A_Configuration_Compilation or -- a nonexistent unit kind. It will never return a unit with A_Procedure_Body -- or A_Function_Body unit kind even though the unit is interpreted as both -- the declaration and body of a library procedure or library function. -- (Reference Manual 10.1.4(4). -- -- A Nil_Compilation_Unit is returned if no such declaration exists. -- -- Any non-Nil result will have an Enclosing_Context value that Is_Identical -- to the Context. Never returns a unit with a nonexistent unit kind. -- ------------------------------------------------------------------------------- -- 10.7 function Compilation_Unit_Body ------------------------------------------------------------------------------- function Compilation_Unit_Body (Name : in Wide_String; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Name - Specifies the defining_program_unit_name -- The_Context - Specifies a program Context environment -- -- Returns the library_unit_body or subunit with the name, contained -- in the library. -- -- A Nil_Compilation_Unit is returned if no such body exists. -- -- Any non-Nil result will have an Enclosing_Context value that Is_Identical -- to The_Context. Never returns a unit with a nonexistent unit kind. -- ------------------------------------------------------------------------------- -- 10.8 function Library_Unit_Declarations ------------------------------------------------------------------------------- function Library_Unit_Declarations (The_Context : in Asis.Context) return Asis.Compilation_Unit_List; ------------------------------------------------------------------------------- -- The_Context - Specifies a program Context environment -- -- Returns a list of all library_unit_declaration and -- library_unit_renaming_declaration elements contained in The_Context. -- Individual units will appear only once in an order that is not defined. -- -- A Nil_Compilation_Unit_List is returned if there are no declarations of -- library units within The_Context. -- -- This query will never return a unit with A_Configuration_Compilation or -- a nonexistent unit kind. It will never return a unit with A_Procedure_Body -- or A_Function_Body unit kind even though the unit is interpreted as both -- the declaration and body of a library procedure or library function. -- (Reference Manual 10.1.4(4). -- -- All units in the result will have an Enclosing_Context value that -- Is_Identical to The_Context. -- ------------------------------------------------------------------------------- -- 10.9 function Compilation_Unit_Bodies ------------------------------------------------------------------------------- function Compilation_Unit_Bodies (The_Context : in Asis.Context) return Asis.Compilation_Unit_List; ------------------------------------------------------------------------------- -- The_Context - Specifies a program Context environment -- -- Returns a list of all library_unit_body and subunit elements contained in -- The_Context. Individual units will appear only once in an order that -- is not defined. -- -- A Nil_Compilation_Unit_List is returned if there are no bodies within -- The_Context. -- -- This query will never return a unit with A_Configuration_Compilation or -- a nonexistent unit kind. -- -- All units in the result will have an Enclosing_Context value that -- Is_Identical to The_Context. -- ------------------------------------------------------------------------------- -- 10.10 function Compilation_Units ------------------------------------------------------------------------------- function Compilation_Units (The_Context : in Asis.Context) return Asis.Compilation_Unit_List; ------------------------------------------------------------------------------- -- The_Context - Specifies a program Context environment -- -- Returns a list of all compilation units contained in The_Context. -- Individual units will appear only once in an order that is not defined. -- -- A Nil_Compilation_Unit_List is returned if there are no units within -- The_Context. -- -- This query will never return a unit with A_Configuration_Compilation or -- a nonexistent unit kind. -- -- All units in the result will have an Enclosing_Context value that -- Is_Identical to The_Context. -- ------------------------------------------------------------------------------- -- 10.11 function Corresponding_Children ------------------------------------------------------------------------------- function Corresponding_Children (Library_Unit : in Asis.Compilation_Unit) return Asis.Compilation_Unit_List; function Corresponding_Children (Library_Unit : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit_List; ------------------------------------------------------------------------------- -- Library_Unit - Specifies the library unit whose children are desired -- The_Context - Specifies a program Context environment -- -- Returns a list of the child units for the given parent library unit. -- -- Both the declaration and body (if any) of each child unit are returned. -- Descendants beyond immediate children (i.e., children of children) are not -- returned by this query. -- -- Use the compilation unit relationship queries -- with a Relation_Kinds of Descendants to create a list of children, children -- of children, and so on. -- -- Returns a Nil_Compilation_Unit_List for all library unit arguments that -- do not have any child units contained in The_Context. -- -- These two function calls will always produce identical results: -- -- Units := Corresponding_Children ( Unit ); -- Units := Corresponding_Children ( Unit, Enclosing_Context ( Unit )); -- -- Any non-Nil result will have an Enclosing_Context value that Is_Identical -- to The_Context. -- -- The Enclosing_Context for any non-Nil result will always be The_Context, -- regardless of the Enclosing_Context value for the Library_Unit argument. -- This query is one means of obtaining (Is_Equal) child units -- from separate ASIS Context values whose underlying implementations -- overlap. -- -- Appropriate Unit_Kinds: -- A_Package -- A_Generic_Package -- A_Package_Instance -- -- Returns Unit_Kinds: -- A_Procedure -- A_Function -- A_Package -- A_Generic_Procedure -- A_Generic_Function -- A_Generic_Package -- A_Procedure_Instance -- A_Function_Instance -- A_Package_Instance -- A_Procedure_Renaming -- A_Function_Renaming -- A_Package_Renaming -- A_Generic_Procedure_Renaming -- A_Generic_Function_Renaming -- A_Generic_Package_Renaming -- A_Procedure_Body -- A_Function_Body -- A_Package_Body -- An_Unknown_Unit -- -- If the declaration of a child is inconsistent with the argument of the -- query, neither the declaration nor the body is returned. If the -- declaration of a child is consistent with the argument, but the body -- is not, the declaration is returned, and for the body, the result of -- the Corresponding_Body query applied to the declaration is returned. -- ------------------------------------------------------------------------------- -- 10.12 function Corresponding_Parent_Declaration ------------------------------------------------------------------------------- function Corresponding_Parent_Declaration (Library_Unit : in Asis.Compilation_Unit) return Asis.Compilation_Unit; function Corresponding_Parent_Declaration (Library_Unit : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Library_Unit - Specifies the unit whose parent is desired -- The_Context - Specifies a program Context environment -- -- Returns the parent unit of the given library unit. -- -- Returns a Nil_Compilation_Unit if the Library_Unit argument represents -- package Standard. Root Library_Unit arguments return the package Standard. -- -- Returns A_Nonexistent_Declaration when the Library_Unit has a -- parent_unit_name denoted in the defining_program_unit_name but the parent -- unit is not contained in The_Context. -- -- These two function calls will always produce identical results: -- -- Unit := Corresponding_Parent_Declaration ( Unit ); -- Unit := Corresponding_Parent_Declaration ( Unit, -- Enclosing_Context ( Unit )); -- -- Any non-Nil result will have an Enclosing_Context value that Is_Identical -- to The_Context. -- -- The Enclosing_Context for any non-Nil result will always be The_Context, -- regardless of the Enclosing_Context value for the Library_Unit -- argument. This query is one means of obtaining (Is_Equal) parent units -- from separate ASIS Context values whose underlying implementations -- overlap. -- -- Appropriate Unit_Kinds: -- A_Procedure -- A_Function -- A_Package -- A_Generic_Procedure -- A_Generic_Function -- A_Generic_Package -- A_Procedure_Instance -- A_Function_Instance -- A_Package_Instance -- A_Procedure_Renaming -- A_Function_Renaming -- A_Package_Renaming -- A_Generic_Procedure_Renaming -- A_Generic_Function_Renaming -- A_Generic_Package_Renaming -- A_Procedure_Body -- A_Function_Body -- A_Package_Body -- -- Returns Unit_Kinds: -- Not_A_Unit -- A_Package -- A_Generic_Package -- A_Package_Instance -- A_Nonexistent_Declaration -- An_Unknown_Unit -- -- If a parent is inconsistent with a child passed as the argument, -- A_Nonexistent_Declaration shall be returned. -- ------------------------------------------------------------------------------- -- 10.13 function Corresponding_Declaration ------------------------------------------------------------------------------- function Corresponding_Declaration (Library_Item : in Asis.Compilation_Unit) return Asis.Compilation_Unit; function Corresponding_Declaration (Library_Item : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Library_Item - Specifies the library_item whose declaration is desired -- The_Context - Specifies a program Context environment -- -- Returns the corresponding library_unit_declaration, if any, for the -- library_unit_body. The corresponding library unit is the unit upon which -- the library_unit_body depends semantically. -- -- Returns a unit that Is_Equal to the argument if: -- -- - the argument is a library_unit_declaration, -- a library_unit_renaming_declaration, or a subunit. -- -- - the argument is A_Nonexistent_Declaration or A_Nonexistent_Body. -- -- Returns a Nil_Compilation_Unit for library_unit_body arguments that do -- not have a corresponding library unit contained in The_Context. -- -- All Unit_Kinds are appropriate except Not_A_Unit. -- -- Appropriate Unit_Kinds: -- A_Procedure_Body -- A_Function_Body -- A_Package_Body -- An_Unknown_Unit -- See Implementation Permissions -- -- Appropriate Unit_Kinds returning the argument Library_Item: -- A_Procedure -- A_Function -- A_Package -- A_Generic_Procedure -- A_Generic_Function -- A_Generic_Package -- A_Procedure_Instance -- A_Function_Instance -- A_Package_Instance -- A_Procedure_Renaming -- A_Function_Renaming -- A_Package_Renaming -- A_Generic_Procedure_Renaming -- A_Generic_Function_Renaming -- A_Generic_Package_Renaming -- A_Procedure_Body_Subunit -- A_Function_Body_Subunit -- A_Package_Body_Subunit -- A_Task_Body_Subunit -- A_Protected_Body_Subunit -- A_Nonexistent_Declaration -- A_Nonexistent_Body -- -- Returns all Unit Kinds. -- -- If the declaration of an argument Element is inconsistent with the -- argument, A_Nonexistent_Declaration shall be returned. (For a unit -- A_Procedure_Body or A_Function_Body kind, the solution may be in any -- case, to return Nil_Compilation_Unit if the unit is of -- A_Public_Declaration_And_Body kind.) -- -- |IR Implementation Requirements: -- |IR -- |IR Any non-Nil result will have an Enclosing_Context value that -- |IR Is_Identical to The_Context. -- |IR -- |IR These two function calls will always produce identical results: -- |IR -- |IR Unit := Corresponding_Declaration( Unit ); -- |IR Unit := Corresponding_Declaration( Unit, Enclosing_Context( Unit )); -- |IR -- |IR The Enclosing_Context for any non-Nil result will always be -- |IR The_Context, regardless of the Enclosing_Context value for the -- |IR Library_Item argument. This query is one means of obtaining -- |IR corresponding (Is_Equal) units from separate ASIS Context values -- |IR whose underlying implementations overlap. -- -- |IP Implementation Permissions: -- |IP -- |IP The handling of An_Unknown_Unit is implementation specific. The -- |IP expected use for An_Unknown_Unit is to hide proprietary implementation -- |IP details contained within unit bodies. In these cases, it should be -- |IP possible to obtain an appropriate library_unit_declaration when -- |IP starting with An_Unknown_Unit. Some implementors may choose to simply -- |IP return the An_Unknown_Unit argument in all cases. -- ------------------------------------------------------------------------------- -- 10.14 function Corresponding_Body ------------------------------------------------------------------------------- function Corresponding_Body (Library_Item : in Asis.Compilation_Unit) return Asis.Compilation_Unit; function Corresponding_Body (Library_Item : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Library_Item - Specifies the library_item whose body is desired -- The_Context - Specifies a program Context environment -- -- Returns the corresponding library_unit_body, if any, for the -- library_unit_declaration. The corresponding library_unit_body is the unit -- that depends semantically on the library_unit_declaration. -- -- Returns a unit that Is_Equal to the argument if: -- -- - the argument is a an instance of a library_unit_declaration, -- a library_unit_body, a library_unit_renaming_declaration, or a subunit. -- -- - the argument is A_Nonexistent_Declaration or A_Nonexistent_Body. -- -- Returns a Nil_Compilation_Unit for library_unit_declaration arguments that -- do not have a corresponding library_unit_body contained in The_Context. -- -- All Unit_Kinds are appropriate except Not_A_Unit. -- -- Appropriate Unit_Kinds: -- A_Procedure -- A_Function -- A_Package -- A_Generic_Procedure -- A_Generic_Function -- A_Generic_Package -- An_Unknown_Unit -- See Implementation Permissions -- -- Appropriate Unit_Kinds returning the argument Library_Item: -- A_Procedure_Body -- A_Function_Body -- A_Package_Body -- A_Procedure_Instance -- A_Function_Instance -- A_Package_Instance -- A_Procedure_Renaming -- A_Function_Renaming -- A_Package_Renaming -- A_Generic_Procedure_Renaming -- A_Generic_Function_Renaming -- A_Generic_Package_Renaming -- A_Procedure_Body_Subunit -- A_Function_Body_Subunit -- A_Package_Body_Subunit -- A_Task_Body_Subunit -- A_Protected_Body_Subunit -- A_Nonexistent_Declaration -- A_Nonexistent_Body -- -- Returns all Unit Kinds. -- -- If the argument Element requires a body to be presented to make up a -- complete partition containing this Element, but The_Context does not -- contain the corresponding body, or the body contained in The_Context -- is inconsistent with the argument Element, A_Nonexistent_Body shall -- be returned. -- -- |IR Implementation Requirements: -- |IR -- |IR Any non-Nil result will have an Enclosing_Context value that -- |IR Is_Identical to The_Context. -- |IR -- |IR These two function calls will always produce identical results: -- |IR -- |IR Unit := Corresponding_Body( Unit ); -- |IR Unit := Corresponding_Body( Unit, Enclosing_Context ( Unit )); -- |IR -- |IR The Enclosing_Context for any non-Nil result will always be -- |IR The_Context, regardless of the Enclosing_Context value for the -- |IR Library_Item argument. This query is one means of obtaining -- |IR corresponding (Is_Equal) units from separate ASIS Context values -- |IR whose underlying implementations overlap. -- -- |IP Implementation Permissions: -- |IP -- |IP The handling of An_Unknown_Unit is implementation specific. The -- |IP expected use for An_Unknown_Unit is to hide proprietary implementation -- |IP details contained within unit bodies. In some cases, it could be -- |IP possible to obtain an appropriate library_unit_body when starting with -- |IP An_Unknown_Unit. Some implementors may choose to simply return the -- |IP An_Unknown_Unit argument in all cases. -- ------------------------------------------------------------------------------- -- 10.15 function Is_Nil ------------------------------------------------------------------------------- function Is_Nil (Right : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Right - Specifies the unit to test -- -- Returns True if the compilation_unit is a Nil_Compilation_Unit. -- ------------------------------------------------------------------------------- -- 10.16 function Is_Nil ------------------------------------------------------------------------------- function Is_Nil (Right : in Asis.Compilation_Unit_List) return Boolean; ------------------------------------------------------------------------------- -- Right - Specifies the unit list to test -- -- Returns True if the compilation_unit list has a length of zero. -- ------------------------------------------------------------------------------- -- 10.17 function Is_Equal ------------------------------------------------------------------------------- function Is_Equal (Left : in Asis.Compilation_Unit; Right : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Left - Specifies the first unit to compare -- Right - Specifies the second unit to compare -- -- Returns True if Left and Right represent the same physical compilation unit -- or if both are Nil_Compilation_Unit values. The two units may or may not -- be from the same ASIS Context variable. ("The same physical compilation -- unit" have the same version, as defined by Reference Manual E.3(5) -- and the same program text.) -- -- Two nonexistent units are Is_Equal if they have the same Name and -- Unit_Kind. -- ------------------------------------------------------------------------------- -- 10.18 function Is_Identical ------------------------------------------------------------------------------- function Is_Identical (Left : in Asis.Compilation_Unit; Right : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Left - Specifies the first unit to compare -- Right - Specifies the second unit to compare -- -- Returns True if Left and Right represent the same physical compilation -- unit, from the same open ASIS Context variable, or, if both are -- Nil_Compilation_Unit values. ("The same physical compilation -- unit" have the same version, as defined by Reference Manual E.3(5) -- and the same program text.) -- -- Two nonexistent units are Is_Identical if they have the same -- Unique_Name and the same Enclosing_Context. -- ------------------------------------------------------------------------------- -- 10.19 function Unit_Full_Name ------------------------------------------------------------------------------- function Unit_Full_Name (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose name is desired -- -- Returns the string image of the fully expanded Ada name of the given -- compilation unit. This may be a simple name ("A") of a root library -- unit, or an expanded name ("A.B") of a subunit or non-root child unit. -- An expanded name shall contain the full parent_unit_name as its prefix. -- Returns a null string only if A_Configuration_Compilation or a -- Nil_Compilation_Unit is given. -- -- The case of names returned by this query may vary between implementations. -- Implementors are encouraged, but not required, to return names in the -- same case as was used in the original compilation text. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.20 function Unique_Name ------------------------------------------------------------------------------- function Unique_Name (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose name is desired -- -- Returns a string that uniquely identifies the given compilation unit -- within the underlying Ada Context implementation. The result may vary -- depending on the ASIS implementation. The unique name may include the name -- and parameters of the Context, file system paths, library files, version -- numbers, kind, or any other information that an implementation may need -- to uniquely identify the compilation unit. -- -- Returns a null string only if a Nil_Compilation_Unit is given. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.21 function Exist ------------------------------------------------------------------------------- function Exists (Compilation_Unit : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to test -- -- Returns False for any unit with Not_A_Unit or nonexistent kind. -- Returns True for all other unit kinds. -- -- All Unit_Kinds are expected. -- ------------------------------------------------------------------------------- -- 10.22 function Can_Be_Main_Program ------------------------------------------------------------------------------- function Can_Be_Main_Program (Compilation_Unit : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to test -- -- Returns True if the Compilation_Unit exists and is a subprogram -- library_unit_declaration, library_unit_renaming_declaration, or -- library_unit_body that can be used as a main subprogram. See Reference -- Manual 10.2(7). -- -- Returns False otherwise. -- -- Results of this function may vary according to the requirements an Ada -- implementation may impose on a main subprogram. -- -- All Unit_Kinds are expected. -- ------------------------------------------------------------------------------- -- 10.23 function Is_Body_Required ------------------------------------------------------------------------------- function Is_Body_Required (Compilation_Unit : in Asis.Compilation_Unit) return Boolean; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to test -- -- Returns True if the Compilation_Unit exists and is a library -- package_declaration that requires a body. See Reference Manual 7.2(4). -- -- All Unit_Kinds are expected. -- ------------------------------------------------------------------------------- -- 10.24 function Text_Name ------------------------------------------------------------------------------- function Text_Name (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose text name is desired -- -- Returns the name of the text, or other structure, that was the source -- of the compilation that resulted in this Compilation_Unit. Returns a -- null string if the unit has a Nil or nonexistent kind, or if the text -- name is not available for any reason. -- -- Ada has no concept of source or text file. -- Text_Name availability is a required feature of ASIS. -- Results of this function may vary among implementations. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.25 function Text_Form ------------------------------------------------------------------------------- function Text_Form (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose text form is desired -- -- Returns the Form parameter (as for Text_Io.Open) for the text, or -- other structure, that was the source of the compilation that resulted in -- this Compilation_Unit. Returns a null string if the unit has a Nil or -- nonexistent kind, if the text was created with an empty Form parameter, -- or if the text Form parameter value is not available for any reason. -- -- Ada has no concept of source or text file. -- Text_Form availability is a required feature of ASIS. -- Results of this function may vary among implementations. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.26 function Object_Name ------------------------------------------------------------------------------- function Object_Name (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose object name is desired -- -- Returns the name of the object, or other structure, that contains the -- binary result of the compilation for this Compilation_Unit. Returns -- a null string if the unit has a Nil or nonexistent kind, or if the -- object name is not available for any reason. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.27 function Object_Form ------------------------------------------------------------------------------- function Object_Form (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit whose object form is desired -- -- Returns the Form parameter (as for Text_Io.Open) for the object, or -- other structure, that was the machine-code result of the compilation of -- this Compilation_Unit. Returns a null string if the unit has a Nil or -- nonexistent kind, if the object was created with an empty Form parameter, -- or if the object Form parameter value is not available for any reason. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.28 function Compilation_Command_Line_Options ------------------------------------------------------------------------------- function Compilation_Command_Line_Options (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to query -- -- Returns the command line options used to compile the Compilation_Unit. -- Returns null string if the unit has a Nil or nonexistent unit kind, or -- if the command line options are not available for any reason. -- -- All Unit_Kinds are appropriate. -- ------------------------------------------------------------------------------- -- 10.29 function Has_Attribute ------------------------------------------------------------------------------- function Has_Attribute (Compilation_Unit : in Asis.Compilation_Unit; Attribute : in Wide_String) return Boolean; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to query -- Attribute - Specifies the name of the attribute to query -- -- Returns True if the compilation unit has the given attribute. -- -- Returns False if the unit is a Nil_Compilation_Unit argument, the -- Attribute does not exist, or the implementation does not support -- attributes. -- -- All Unit_Kinds are expected. -- -- Results of this query may vary across ASIS implementations. -- ------------------------------------------------------------------------------- -- 10.30 function Attribute_Value_Delimiter ------------------------------------------------------------------------------- function Attribute_Value_Delimiter return Wide_String; ------------------------------------------------------------------------------- -- Returns the string used as a delimiter separating individual values -- within the string Attribute_Values of a compilation unit. -- -- Results of this query may vary across ASIS implementations. The result -- can be a null string for implementations that do not support attributes, -- or that do not support more than one attribute. -- ------------------------------------------------------------------------------- -- 10.31 function Attribute_Values ------------------------------------------------------------------------------- function Attribute_Values (Compilation_Unit : in Asis.Compilation_Unit; Attribute : in Wide_String) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies the unit to query -- Attribute - Specifies the name of the attribute to query -- -- Returns a string containing zero or more images of values that are -- associated with the given attribute. When more than one value is returned, -- the Attribute_Value_Delimiter string is used to separate the individual -- values. Returns a null string if the unit is a Nil_Compilation_Unit -- argument, the unit has no values for this Attribute, or the implementation -- does not support attributes. -- -- All Unit_Kinds are appropriate. -- -- Results of this query may vary across ASIS implementations. -- ------------------------------------------------------------------------------- -- 10.32 function Subunits ------------------------------------------------------------------------------- function Subunits (Parent_Body : in Asis.Compilation_Unit) return Asis.Compilation_Unit_List; function Subunits (Parent_Body : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit_List; ------------------------------------------------------------------------------- -- Parent_Body - Specifies the parent unit to query -- The_Context - Specifies the program Context to use for context -- -- Returns a complete list of subunit values, with one value for each body -- stub that appears in the given Parent_Body. Returns a -- Nil_Compilation_Unit_List if the parent unit does not contain any body -- stubs. Every unit in the result will have an Enclosing_Context that -- Is_Identical to The_Context. -- -- These two function calls will always produce identical results: -- -- SUnits := Subunits ( PUnit ); -- SUnits := Subunits ( PUnit, Enclosing_Context ( PUnit )); -- -- The result may include unit values with a nonexistent unit kind. It -- includes values for subunits that exist in The_Context as -- well as values for subunits that do not exist, but whose name can be -- deduced from the body stub and the name of the parent unit. These -- nonexistent units are known to be library_unit_body elements so their unit -- kind is A_Nonexistent_Body. -- -- Subunit lists are also available through the Semantic_Dependence_Order -- query using the Family relation. -- -- Raises ASIS_Inappropriate_Compilation_Unit if the unit is a -- Nil_Compilation_Unit. -- -- If a subunit is absent or if it is inconsistent with the argument Element, -- A_Nonexistent_Body shall be returned for it. -- -- Returns Unit_Kinds: -- A_Nonexistent_Body -- A_Procedure_Body_Subunit -- A_Function_Body_Subunit -- A_Package_Body_Subunit -- A_Task_Body_Subunit -- A_Protected_Body_Subunit -- ------------------------------------------------------------------------------- -- 10.33 function Corresponding_Subunit_Parent_Body ------------------------------------------------------------------------------- function Corresponding_Subunit_Parent_Body (Subunit : in Asis.Compilation_Unit) return Asis.Compilation_Unit; function Corresponding_Subunit_Parent_Body (Subunit : in Asis.Compilation_Unit; The_Context : in Asis.Context) return Asis.Compilation_Unit; ------------------------------------------------------------------------------- -- Subunit - Specifies the subunit to query -- The_Context - Specifies the program Context to use for context -- -- Returns the Compilation_Unit containing the body stub of the given Subunit. -- Returns a Nil_Compilation_Unit if the subunit parent is not contained in -- The_Context. Any non-Nil result will have an Enclosing_Context value that -- Is_Identical to The_Context. -- -- These two function calls will always produce identical results: -- -- PUnit := Corresponding_Subunit_Parent_Body ( SUnit ); -- PUnit := Corresponding_Subunit_Parent_Body ( SUnit, -- Enclosing_Context ( SUnit )); -- -- Appropriate Unit_Kinds: -- A_Procedure_Body_Subunit -- A_Function_Body_Subunit -- A_Package_Body_Subunit -- A_Task_Body_Subunit -- A_Protected_Body_Subunit -- -- Returns Unit_Kinds: -- A_Procedure_Body -- A_Function_Body -- A_Package_Body -- A_Procedure_Body_Subunit -- A_Function_Body_Subunit -- A_Package_Body_Subunit -- A_Task_Body_Subunit -- A_Protected_Body_Subunit -- -- If the corresponding body does not exist in The_Context, or if it exists, -- but is inconsistent with the argument Element, then A_Nonexistent_Body -- shall be returned. -- ------------------------------------------------------------------------------- -- To locate the parent of a subunit that is not itself a subunit, -- repeatedly call Corresponding_Subunit_Parent_Body until a unit that -- is not a subunit is returned. -- ------------------------------------------------------------------------------- -- 10.34 function Debug_Image ------------------------------------------------------------------------------- function Debug_Image (Compilation_Unit : in Asis.Compilation_Unit) return Wide_String; ------------------------------------------------------------------------------- -- Compilation_Unit - Specifies a unit to convert -- -- Returns a string value containing implementation-defined debug -- information associated with the compilation unit. -- -- The return value uses Asis.Text.Delimiter_Image to separate the lines -- of multi-line results. The return value does not end with -- Asis.Text.Delimiter_Image. -- -- These values are intended for two purposes. They are suitable for -- inclusion in problem reports sent to the ASIS implementor. They can be -- presumed to contain information useful when debugging the implementation -- itself. They are also suitable for use by the ASIS application when -- printing simple application debugging messages during application -- development. They are intended to be, to some worthwhile degree, -- intelligible to the user. -- ------------------------------------------------------------------------------- end Asis.Compilation_Units; ------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, Maxim Reznik -- 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 Maxim Reznik, 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 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. ------------------------------------------------------------------------------

43.430657

79

0.573214

182cda143117ebf28ce2a08cc84c1398a5459364

3,225

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack09.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack09.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack09.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- 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;

52.868852

78

0.387907

186dbcdca3447aecff53532da28e9e558b2468f3

960,313

adb

Ada

.emacs.d/elpa/ada-mode-6.1.1/ada_process_lalr_main.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-mode-6.1.1/ada_process_lalr_main.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/ada-mode-6.1.1/ada_process_lalr_main.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- 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;

66.32912

120

0.540692

d08746f8fa93183965a896adbadf02dc901eb9a1

27,807

adb

Ada

awa/plugins/awa-comments/src/model/awa-comments-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-comments/src/model/awa-comments-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

awa/plugins/awa-comments/src/model/awa-comments-models.adb

twdroeger/ada-awa

77b824773747aecb912c37b1b7b59ea414679b80

[ "Apache-2.0" ]

null

----------------------------------------------------------------------- -- AWA.Comments.Models -- AWA.Comments.Models ----------------------------------------------------------------------- -- 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 1095 ----------------------------------------------------------------------- -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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; with ASF.Events.Faces.Actions; package body AWA.Comments.Models is use type ADO.Objects.Object_Record_Access; use type ADO.Objects.Object_Ref; pragma Warnings (Off, "formal parameter * is not referenced"); function Comment_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => COMMENT_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Comment_Key; function Comment_Key (Id : in String) return ADO.Objects.Object_Key is Result : ADO.Objects.Object_Key (Of_Type => ADO.Objects.KEY_INTEGER, Of_Class => COMMENT_DEF'Access); begin ADO.Objects.Set_Value (Result, Id); return Result; end Comment_Key; function "=" (Left, Right : Comment_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 Comment_Ref'Class; Impl : out Comment_Access) is Result : ADO.Objects.Object_Record_Access; begin Object.Prepare_Modify (Result); Impl := Comment_Impl (Result.all)'Access; end Set_Field; -- Internal method to allocate the Object_Record instance procedure Allocate (Object : in out Comment_Ref) is Impl : Comment_Access; begin Impl := new Comment_Impl; Impl.Create_Date := ADO.DEFAULT_TIME; Impl.Entity_Id := ADO.NO_IDENTIFIER; Impl.Version := 0; Impl.Entity_Type := 0; Impl.Status := AWA.Comments.Models.Status_Type'First; Impl.Format := AWA.Comments.Models.Format_Type'First; ADO.Objects.Set_Object (Object, Impl.all'Access); end Allocate; -- ---------------------------------------- -- Data object: Comment -- ---------------------------------------- procedure Set_Create_Date (Object : in out Comment_Ref; Value : in Ada.Calendar.Time) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Time (Impl.all, 1, Impl.Create_Date, Value); end Set_Create_Date; function Get_Create_Date (Object : in Comment_Ref) return Ada.Calendar.Time is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Create_Date; end Get_Create_Date; procedure Set_Message (Object : in out Comment_Ref; Value : in String) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Audits.Set_Field_String (Impl.all, 2, Impl.Message, Value); end Set_Message; procedure Set_Message (Object : in out Comment_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Audits.Set_Field_Unbounded_String (Impl.all, 2, Impl.Message, Value); end Set_Message; function Get_Message (Object : in Comment_Ref) return String is begin return Ada.Strings.Unbounded.To_String (Object.Get_Message); end Get_Message; function Get_Message (Object : in Comment_Ref) return Ada.Strings.Unbounded.Unbounded_String is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Message; end Get_Message; procedure Set_Entity_Id (Object : in out Comment_Ref; Value : in ADO.Identifier) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Identifier (Impl.all, 3, Impl.Entity_Id, Value); end Set_Entity_Id; function Get_Entity_Id (Object : in Comment_Ref) return ADO.Identifier is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Entity_Id; end Get_Entity_Id; procedure Set_Id (Object : in out Comment_Ref; Value : in ADO.Identifier) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Key_Value (Impl.all, 4, Value); end Set_Id; function Get_Id (Object : in Comment_Ref) return ADO.Identifier is Impl : constant Comment_Access := Comment_Impl (Object.Get_Object.all)'Access; begin return Impl.Get_Key_Value; end Get_Id; function Get_Version (Object : in Comment_Ref) return Integer is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Version; end Get_Version; procedure Set_Entity_Type (Object : in out Comment_Ref; Value : in ADO.Entity_Type) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Entity_Type (Impl.all, 6, Impl.Entity_Type, Value); end Set_Entity_Type; function Get_Entity_Type (Object : in Comment_Ref) return ADO.Entity_Type is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Entity_Type; end Get_Entity_Type; procedure Set_Status (Object : in out Comment_Ref; Value : in AWA.Comments.Models.Status_Type) is procedure Set_Field_Enum is new ADO.Audits.Set_Field_Operation (Status_Type, Status_Type_Objects.To_Object); Impl : Comment_Access; begin Set_Field (Object, Impl); Set_Field_Enum (Impl.all, 7, Impl.Status, Value); end Set_Status; function Get_Status (Object : in Comment_Ref) return AWA.Comments.Models.Status_Type is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Status; end Get_Status; procedure Set_Format (Object : in out Comment_Ref; Value : in AWA.Comments.Models.Format_Type) is procedure Set_Field_Enum is new ADO.Audits.Set_Field_Operation (Format_Type, Format_Type_Objects.To_Object); Impl : Comment_Access; begin Set_Field (Object, Impl); Set_Field_Enum (Impl.all, 8, Impl.Format, Value); end Set_Format; function Get_Format (Object : in Comment_Ref) return AWA.Comments.Models.Format_Type is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Format; end Get_Format; procedure Set_Author (Object : in out Comment_Ref; Value : in AWA.Users.Models.User_Ref'Class) is Impl : Comment_Access; begin Set_Field (Object, Impl); ADO.Objects.Set_Field_Object (Impl.all, 9, Impl.Author, Value); end Set_Author; function Get_Author (Object : in Comment_Ref) return AWA.Users.Models.User_Ref'Class is Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; begin return Impl.Author; end Get_Author; -- Copy of the object. procedure Copy (Object : in Comment_Ref; Into : in out Comment_Ref) is Result : Comment_Ref; begin if not Object.Is_Null then declare Impl : constant Comment_Access := Comment_Impl (Object.Get_Load_Object.all)'Access; Copy : constant Comment_Access := new Comment_Impl; begin ADO.Objects.Set_Object (Result, Copy.all'Access); Copy.Copy (Impl.all); Copy.Create_Date := Impl.Create_Date; Copy.Message := Impl.Message; Copy.Entity_Id := Impl.Entity_Id; Copy.Version := Impl.Version; Copy.Entity_Type := Impl.Entity_Type; Copy.Status := Impl.Status; Copy.Format := Impl.Format; Copy.Author := Impl.Author; end; end if; Into := Result; end Copy; procedure Find (Object : in out Comment_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean) is Impl : constant Comment_Access := new Comment_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 Comment_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier) is Impl : constant Comment_Access := new Comment_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 Comment_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean) is Impl : constant Comment_Access := new Comment_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 Comment_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 Comment_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 Comment_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 Comment_Impl) is type Comment_Impl_Ptr is access all Comment_Impl; procedure Unchecked_Free is new Ada.Unchecked_Deallocation (Comment_Impl, Comment_Impl_Ptr); pragma Warnings (Off, "*redundant conversion*"); Ptr : Comment_Impl_Ptr := Comment_Impl (Object.all)'Access; pragma Warnings (On, "*redundant conversion*"); begin Unchecked_Free (Ptr); end Destroy; procedure Find (Object : in out Comment_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 (Query, COMMENT_DEF'Access); begin 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 Comment_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 Comment_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Update_Statement := Session.Create_Statement (COMMENT_DEF'Access); begin if Object.Is_Modified (1) then Stmt.Save_Field (Name => COL_0_1_NAME, -- create_date Value => Object.Create_Date); Object.Clear_Modified (1); end if; if Object.Is_Modified (2) then Stmt.Save_Field (Name => COL_1_1_NAME, -- message Value => Object.Message); Object.Clear_Modified (2); end if; if Object.Is_Modified (4) then Stmt.Save_Field (Name => COL_3_1_NAME, -- id Value => Object.Get_Key); Object.Clear_Modified (4); end if; if Object.Is_Modified (7) then Stmt.Save_Field (Name => COL_6_1_NAME, -- status Value => Integer (Status_Type'Pos (Object.Status))); Object.Clear_Modified (7); end if; if Object.Is_Modified (8) then Stmt.Save_Field (Name => COL_7_1_NAME, -- format Value => Integer (Format_Type'Pos (Object.Format))); Object.Clear_Modified (8); end if; if Object.Is_Modified (9) then Stmt.Save_Field (Name => COL_8_1_NAME, -- author_id Value => Object.Author); Object.Clear_Modified (9); 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; ADO.Audits.Save (Object, Session); end; end if; end Save; procedure Create (Object : in out Comment_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Query : ADO.Statements.Insert_Statement := Session.Create_Statement (COMMENT_DEF'Access); Result : Integer; begin Object.Version := 1; Query.Save_Field (Name => COL_0_1_NAME, -- create_date Value => Object.Create_Date); Query.Save_Field (Name => COL_1_1_NAME, -- message Value => Object.Message); Query.Save_Field (Name => COL_2_1_NAME, -- entity_id Value => Object.Entity_Id); Session.Allocate (Id => Object); Query.Save_Field (Name => COL_3_1_NAME, -- id Value => Object.Get_Key); Query.Save_Field (Name => COL_4_1_NAME, -- version Value => Object.Version); Query.Save_Field (Name => COL_5_1_NAME, -- entity_type Value => Object.Entity_Type); Query.Save_Field (Name => COL_6_1_NAME, -- status Value => Integer (Status_Type'Pos (Object.Status))); Query.Save_Field (Name => COL_7_1_NAME, -- format Value => Integer (Format_Type'Pos (Object.Format))); Query.Save_Field (Name => COL_8_1_NAME, -- author_id Value => Object.Author); Query.Execute (Result); if Result /= 1 then raise ADO.Objects.INSERT_ERROR; end if; ADO.Objects.Set_Created (Object); ADO.Audits.Save (Object, Session); end Create; procedure Delete (Object : in out Comment_Impl; Session : in out ADO.Sessions.Master_Session'Class) is Stmt : ADO.Statements.Delete_Statement := Session.Create_Statement (COMMENT_DEF'Access); begin Stmt.Set_Filter (Filter => "id = ?"); Stmt.Add_Param (Value => Object.Get_Key); Stmt.Execute; end Delete; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Comment_Ref; Name : in String) return Util.Beans.Objects.Object is Obj : ADO.Objects.Object_Record_Access; Impl : access Comment_Impl; begin if From.Is_Null then return Util.Beans.Objects.Null_Object; end if; Obj := From.Get_Load_Object; Impl := Comment_Impl (Obj.all)'Access; if Name = "create_date" then return Util.Beans.Objects.Time.To_Object (Impl.Create_Date); elsif Name = "message" then return Util.Beans.Objects.To_Object (Impl.Message); elsif Name = "entity_id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Entity_Id)); elsif Name = "id" then return ADO.Objects.To_Object (Impl.Get_Key); elsif Name = "entity_type" then return Util.Beans.Objects.To_Object (Long_Long_Integer (Impl.Entity_Type)); elsif Name = "status" then return AWA.Comments.Models.Status_Type_Objects.To_Object (Impl.Status); elsif Name = "format" then return AWA.Comments.Models.Format_Type_Objects.To_Object (Impl.Format); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Load the object from current iterator position -- ------------------------------ procedure Load (Object : in out Comment_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class) is begin Object.Create_Date := Stmt.Get_Time (0); Object.Message := Stmt.Get_Unbounded_String (1); Object.Entity_Id := Stmt.Get_Identifier (2); Object.Set_Key_Value (Stmt.Get_Identifier (3)); Object.Entity_Type := ADO.Entity_Type (Stmt.Get_Integer (5)); Object.Status := Status_Type'Val (Stmt.Get_Integer (6)); Object.Format := Format_Type'Val (Stmt.Get_Integer (7)); if not Stmt.Is_Null (8) then Object.Author.Set_Key_Value (Stmt.Get_Identifier (8), Session); end if; Object.Version := Stmt.Get_Integer (4); ADO.Objects.Set_Created (Object); end Load; -- ------------------------------ -- Get the bean attribute identified by the name. -- ------------------------------ overriding function Get_Value (From : in Comment_Info; Name : in String) return Util.Beans.Objects.Object is begin if Name = "id" then return Util.Beans.Objects.To_Object (Long_Long_Integer (From.Id)); elsif Name = "author" then return Util.Beans.Objects.To_Object (From.Author); elsif Name = "email" then return Util.Beans.Objects.To_Object (From.Email); elsif Name = "date" then return Util.Beans.Objects.Time.To_Object (From.Date); elsif Name = "format" then return AWA.Comments.Models.Format_Type_Objects.To_Object (From.Format); elsif Name = "comment" then return Util.Beans.Objects.To_Object (From.Comment); elsif Name = "status" then return AWA.Comments.Models.Status_Type_Objects.To_Object (From.Status); end if; return Util.Beans.Objects.Null_Object; end Get_Value; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Comment_Info; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "id" then Item.Id := ADO.Identifier (Util.Beans.Objects.To_Long_Long_Integer (Value)); elsif Name = "author" then Item.Author := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "email" then Item.Email := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "date" then Item.Date := Util.Beans.Objects.Time.To_Time (Value); elsif Name = "format" then Item.Format := AWA.Comments.Models.Format_Type_Objects.To_Value (Value); elsif Name = "comment" then Item.Comment := Util.Beans.Objects.To_Unbounded_String (Value); elsif Name = "status" then Item.Status := AWA.Comments.Models.Status_Type_Objects.To_Value (Value); end if; end Set_Value; -- -------------------- -- Run the query controlled by Context and append the list in Object. -- -------------------- procedure List (Object : in out Comment_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is begin List (Object.List, Session, Context); end List; -- -------------------- -- The comment information. -- -------------------- procedure List (Object : in out Comment_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class) is procedure Read (Into : in out Comment_Info); Stmt : ADO.Statements.Query_Statement := Session.Create_Statement (Context); Pos : Positive := 1; procedure Read (Into : in out Comment_Info) is begin Into.Id := Stmt.Get_Identifier (0); Into.Author := Stmt.Get_Unbounded_String (1); Into.Email := Stmt.Get_Unbounded_String (2); Into.Date := Stmt.Get_Time (3); Into.Format := AWA.Comments.Models.Format_Type'Val (Stmt.Get_Integer (4)); Into.Comment := Stmt.Get_Unbounded_String (5); Into.Status := AWA.Comments.Models.Status_Type'Val (Stmt.Get_Integer (6)); end Read; begin Stmt.Execute; Comment_Info_Vectors.Clear (Object); while Stmt.Has_Elements loop Object.Insert_Space (Before => Pos); Object.Update_Element (Index => Pos, Process => Read'Access); Pos := Pos + 1; Stmt.Next; end loop; end List; procedure Op_Create (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Create (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Comment_Bean'Class (Bean).Create (Outcome); end Op_Create; package Binding_Comment_Bean_1 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Comment_Bean, Method => Op_Create, Name => "create"); procedure Op_Delete (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Delete (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Comment_Bean'Class (Bean).Delete (Outcome); end Op_Delete; package Binding_Comment_Bean_2 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Comment_Bean, Method => Op_Delete, Name => "delete"); procedure Op_Save (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Save (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Comment_Bean'Class (Bean).Save (Outcome); end Op_Save; package Binding_Comment_Bean_3 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Comment_Bean, Method => Op_Save, Name => "save"); procedure Op_Publish (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); procedure Op_Publish (Bean : in out Comment_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is begin Comment_Bean'Class (Bean).Publish (Outcome); end Op_Publish; package Binding_Comment_Bean_4 is new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Comment_Bean, Method => Op_Publish, Name => "publish"); Binding_Comment_Bean_Array : aliased constant Util.Beans.Methods.Method_Binding_Array := (1 => Binding_Comment_Bean_1.Proxy'Access, 2 => Binding_Comment_Bean_2.Proxy'Access, 3 => Binding_Comment_Bean_3.Proxy'Access, 4 => Binding_Comment_Bean_4.Proxy'Access ); -- ------------------------------ -- This bean provides some methods that can be used in a Method_Expression. -- ------------------------------ overriding function Get_Method_Bindings (From : in Comment_Bean) return Util.Beans.Methods.Method_Binding_Array_Access is pragma Unreferenced (From); begin return Binding_Comment_Bean_Array'Access; end Get_Method_Bindings; -- ------------------------------ -- Set the value identified by the name -- ------------------------------ overriding procedure Set_Value (Item : in out Comment_Bean; Name : in String; Value : in Util.Beans.Objects.Object) is begin if Name = "create_date" then Item.Set_Create_Date (Util.Beans.Objects.Time.To_Time (Value)); elsif Name = "message" then Item.Set_Message (Util.Beans.Objects.To_String (Value)); elsif Name = "status" then Item.Set_Status (Status_Type_Objects.To_Value (Value)); elsif Name = "format" then Item.Set_Format (Format_Type_Objects.To_Value (Value)); end if; end Set_Value; end AWA.Comments.Models;

38.301653

89

0.590966

dc379ad1ff65e5500ab103dddd0a105eb67592a6

5,663

adb

Ada

tools-src/gnu/gcc/gcc/ada/5zosprim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

80

2015-01-02T10:14:04.000Z

2021-06-07T06:29:49.000Z

tools-src/gnu/gcc/gcc/ada/5zosprim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

9

2015-05-14T11:03:12.000Z

2018-01-04T07:12:58.000Z

tools-src/gnu/gcc/gcc/ada/5zosprim.adb

modern-tomato/tomato

96f09fab4929c6ddde5c9113f1b2476ad37133c4

[ "FSFAP" ]

69

2015-01-02T10:45:56.000Z

2021-09-06T07:52:13.000Z

------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . O S _ P R I M I T I V E S -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1998-2001 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, 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. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This version is for VxWorks targets with System.OS_Interface; -- Since the thread library is part of the VxWorks kernel, using OS_Interface -- is not a problem here, as long as we only use System.OS_Interface as a -- set of C imported routines: using Ada routines from this package would -- create a dependency on libgnarl in libgnat, which is not desirable. with Interfaces.C; -- used for type int package body System.OS_Primitives is use System.OS_Interface; -------------------------- -- Internal functions -- -------------------------- function To_Clock_Ticks (D : Duration) return int; -- Convert a duration value (in seconds) into clock ticks. -- Note that this routine is duplicated from System.OS_Interface since -- as explained above, we do not want to depend on libgnarl function To_Clock_Ticks (D : Duration) return int is Ticks : Long_Long_Integer; Rate_Duration : Duration; Ticks_Duration : Duration; begin -- Ensure that the duration can be converted to ticks -- at the current clock tick rate without overflowing. Rate_Duration := Duration (sysClkRateGet); if D > (Duration'Last / Rate_Duration) then Ticks := Long_Long_Integer (int'Last); else -- We always want to round up to the nearest clock tick. Ticks_Duration := D * Rate_Duration; Ticks := Long_Long_Integer (Ticks_Duration); if Ticks_Duration > Duration (Ticks) then Ticks := Ticks + 1; end if; if Ticks > Long_Long_Integer (int'Last) then Ticks := Long_Long_Integer (int'Last); end if; end if; return int (Ticks); end To_Clock_Ticks; ----------- -- Clock -- ----------- function Clock return Duration is TS : aliased timespec; Result : int; use type Interfaces.C.int; begin Result := clock_gettime (CLOCK_REALTIME, TS'Unchecked_Access); pragma Assert (Result = 0); return Duration (TS.ts_sec) + Duration (TS.ts_nsec) / 10#1#E9; end Clock; --------------------- -- Monotonic_Clock -- --------------------- function Monotonic_Clock return Duration renames Clock; ----------------- -- Timed_Delay -- ----------------- procedure Timed_Delay (Time : Duration; Mode : Integer) is Result : int; Rel_Time : Duration; Abs_Time : Duration; Check_Time : Duration := Clock; begin if Mode = Relative then Rel_Time := Time; Abs_Time := Time + Check_Time; else Rel_Time := Time - Check_Time; Abs_Time := Time; end if; if Rel_Time > 0.0 then loop Result := taskDelay (To_Clock_Ticks (Rel_Time)); Check_Time := Clock; exit when Abs_Time <= Check_Time; Rel_Time := Abs_Time - Check_Time; end loop; end if; end Timed_Delay; end System.OS_Primitives;

38.787671

78

0.501854

d04fcfa928b0ddec209c306118c1bf5f75e01111

7,662

ads

Ada

tools/scitools/conf/understand/ada/ada05/i-pacdec.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada05/i-pacdec.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada05/i-pacdec.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S . P A C K E D _ D E C I M A L -- -- -- -- S p e c -- -- (Version for IBM Mainframe Packed Decimal Format) -- -- -- -- Copyright (C) 1992-2003 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. -- -- -- ------------------------------------------------------------------------------ -- This unit defines the packed decimal format used by GNAT in response to -- a specication of Machine_Radix 10 for a decimal fixed-point type. The -- format and operations are completely encapsulated in this unit, so all -- that is necessary to compile using different packed decimal formats is -- to replace this single unit. -- Note that the compiler access the spec of this unit during compilation -- to obtain the data length that needs allocating, so the correct version -- of the spec must be available to the compiler, and must correspond to -- the spec and body made available to the linker, and all units of a given -- program must be compiled with the same version of the spec and body. -- This consistency will be enforced automatically using the normal binder -- consistency checking, since any unit declaring Machine_Radix 10 types or -- containing operations on such data will implicitly with Packed_Decimal. with System; package Interfaces.Packed_Decimal is ------------------------ -- Format Description -- ------------------------ -- IBM Mainframe packed decimal format uses a byte string of length one -- to 10 bytes, with the most significant byte first. Each byte contains -- two decimal digits (with the high order digit in the left nibble, and -- the low order four bits contain the sign, using the following code: -- 16#A# 2#1010# positive -- 16#B# 2#1011# negative -- 16#C# 2#1100# positive (preferred representation) -- 16#D# 2#1101# negative (preferred representation) -- 16#E# 2#1110# positive -- 16#F# 2#1011# positive -- In this package, all six sign representations are interpreted as -- shown above when an operand is read, when an operand is written, -- the preferred representations are always used. Constraint_Error -- is raised if any other bit pattern is found in the sign nibble, -- or if a digit nibble contains an invalid digit code. -- Some examples follow: -- 05 76 3C +5763 -- 00 01 1D -11 -- 00 04 4E +44 (non-standard sign) -- 00 00 00 invalid (incorrect sign nibble) -- 0A 01 1C invalid (bad digit) ------------------ -- Length Array -- ------------------ -- The following array must be declared in exactly the form shown, since -- the compiler accesses the associated tree to determine the size to be -- allocated to a machine radix 10 type, depending on the number of digits. subtype Byte_Length is Positive range 1 .. 10; -- Range of possible byte lengths Packed_Size : constant array (1 .. 18) of Byte_Length := (01 => 01, -- Length in bytes for digits 1 02 => 02, -- Length in bytes for digits 2 03 => 02, -- Length in bytes for digits 2 04 => 03, -- Length in bytes for digits 2 05 => 03, -- Length in bytes for digits 2 06 => 04, -- Length in bytes for digits 2 07 => 04, -- Length in bytes for digits 2 08 => 05, -- Length in bytes for digits 2 09 => 05, -- Length in bytes for digits 2 10 => 06, -- Length in bytes for digits 2 11 => 06, -- Length in bytes for digits 2 12 => 07, -- Length in bytes for digits 2 13 => 07, -- Length in bytes for digits 2 14 => 08, -- Length in bytes for digits 2 15 => 08, -- Length in bytes for digits 2 16 => 09, -- Length in bytes for digits 2 17 => 09, -- Length in bytes for digits 2 18 => 10); -- Length in bytes for digits 2 ------------------------- -- Conversion Routines -- ------------------------- subtype D32 is Positive range 1 .. 9; -- Used to represent number of digits in a packed decimal value that -- can be represented in a 32-bit binary signed integer form. subtype D64 is Positive range 10 .. 18; -- Used to represent number of digits in a packed decimal value that -- requires a 64-bit signed binary integer for representing all values. function Packed_To_Int32 (P : System.Address; D : D32) return Integer_32; -- The argument P is the address of a packed decimal value and D is the -- number of digits (in the range 1 .. 9, as implied by the subtype). -- The returned result is the corresponding signed binary value. The -- exception Constraint_Error is raised if the input is invalid. function Packed_To_Int64 (P : System.Address; D : D64) return Integer_64; -- The argument P is the address of a packed decimal value and D is the -- number of digits (in the range 10 .. 18, as implied by the subtype). -- The returned result is the corresponding signed binary value. The -- exception Constraint_Error is raised if the input is invalid. procedure Int32_To_Packed (V : Integer_32; P : System.Address; D : D32); -- The argument V is a signed binary integer, which is converted to -- packed decimal format and stored using P, the address of a packed -- decimal item of D digits (D is in the range 1-9). Constraint_Error -- is raised if V is out of range of this number of digits. procedure Int64_To_Packed (V : Integer_64; P : System.Address; D : D64); -- The argument V is a signed binary integer, which is converted to -- packed decimal format and stored using P, the address of a packed -- decimal item of D digits (D is in the range 10-18). Constraint_Error -- is raised if V is out of range of this number of digits. end Interfaces.Packed_Decimal;

50.407895

79

0.576351

205b2a326ad7fd777cb098a249944f46b7e83d0f

4,044

ads

Ada

tools/scitools/conf/understand/ada/ada12/s-tratas.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/s-tratas.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/s-tratas.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T R A C E S . T A S K I N G -- -- -- -- S p e c -- -- -- -- Copyright (C) 2001-2009 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. -- -- -- -- -- -- -- -- -- -- -- -- 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 package provides all procedures used to implement debug traces -- in the case tasking is involved. -- See System.Traces for an overview of the various files involved in Tracing -- If tasking is not involved, refer to System.Traces.General with System.Tasking; package System.Traces.Tasking is pragma Preelaborate; package ST renames System.Tasking; -- Send_Trace_Info procedures -- They are overloaded, depending on the parameters passed with the event procedure Send_Trace_Info (Id : Trace_T; Task_Name2 : ST.Task_Id); procedure Send_Trace_Info (Id : Trace_T; Task_Name2 : ST.Task_Id; Entry_Number : ST.Entry_Index); procedure Send_Trace_Info (Id : Trace_T; Task_Name : ST.Task_Id; Task_Name2 : ST.Task_Id; Entry_Number : ST.Entry_Index); procedure Send_Trace_Info (Id : Trace_T; Task_Name : ST.Task_Id; Task_Name2 : ST.Task_Id); procedure Send_Trace_Info (Id : Trace_T; Entry_Number : ST.Entry_Index); procedure Send_Trace_Info (Id : Trace_T; Acceptor : ST.Task_Id; Entry_Number : ST.Entry_Index; Timeout : Duration); procedure Send_Trace_Info (Id : Trace_T; Entry_Number : ST.Entry_Index; Timeout : Duration); procedure Send_Trace_Info (Id : Trace_T; Task_Name : ST.Task_Id; Number : Integer); procedure Send_Trace_Info (Id : Trace_T; Task_Name : ST.Task_Id; Number : Integer; Timeout : Duration); end System.Traces.Tasking;

42.125

78

0.436944

4a4f6cfe30eb7b49192632b324707a437ca84ece

430

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/object_overflow5.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/object_overflow5.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/object_overflow5.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

-- { dg-do compile } procedure Object_Overflow5 is procedure Proc (c : Character) is begin null; end; type Index is new Long_Integer range 0 .. Long_Integer'Last; type Arr is array(Index range <>) of Character; type Rec (Size: Index := 6) is record -- { dg-warning "Storage_Error" } A: Arr (0..Size); end record; Obj : Rec; -- { dg-warning "Storage_Error" } begin Obj.A(1) := 'a'; Proc (Obj.A(1)); end;

20.47619

73

0.637209

20e8ff4383ccfceb62e44ba59151e2ead60c5841

5,981

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c55b05a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c55b05a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c55b05a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C55B05A.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 LOOPS WITH BOUNDS INTEGER'LAST OR -- INTEGER'FIRST DO NOT RAISE INVALID EXCEPTIONS. -- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X -- *** remove incompatibilities associated with the transition -- 9X -- *** to Ada 9X. -- 9X -- *** -- 9X -- DAT 3/26/81 -- SPS 3/2/83 -- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY WITH REPORT; USE REPORT; PROCEDURE C55B05A IS BEGIN TEST ("C55B05A", "LOOPS WITH INTEGER'FIRST AND 'LAST AS BOUNDS"); DECLARE COUNT : INTEGER := 0; PROCEDURE C IS BEGIN COUNT := COUNT + 1; END C; BEGIN FOR I IN INTEGER'LAST .. INTEGER'FIRST LOOP FAILED ("WRONG NULL RANGE LOOP EXECUTION"); EXIT; END LOOP; FOR I IN INTEGER'FIRST .. INTEGER'FIRST LOOP C; END LOOP; FOR I IN INTEGER'FIRST .. INTEGER'FIRST + 2 LOOP C; C; END LOOP; FOR I IN INTEGER'FIRST + 1 .. INTEGER'FIRST LOOP FAILED ("NULL RANGE ERROR 2"); EXIT; END LOOP; FOR I IN INTEGER'FIRST .. INTEGER'LAST LOOP C; EXIT; END LOOP; FOR I IN INTEGER LOOP C; EXIT; END LOOP; FOR I IN INTEGER'LAST - 2 .. INTEGER'LAST LOOP C; C; C; END LOOP; FOR I IN INTEGER'LAST - 2 .. INTEGER'LAST - 1 LOOP C; END LOOP; FOR I IN 0 .. INTEGER'FIRST LOOP FAILED ("NULL LOOP ERROR 3"); EXIT; END LOOP; FOR I IN -1 .. INTEGER'FIRST LOOP FAILED ("NULL LOOP ERROR 4"); EXIT; END LOOP; FOR I IN -3 .. IDENT_INT(0) LOOP FOR J IN INTEGER'FIRST .. INTEGER'FIRST - I LOOP C; C; C; C; END LOOP; FOR J IN INTEGER'FIRST - I .. INTEGER'FIRST + 3 - I LOOP C; C; C; C; END LOOP; FOR J IN INTEGER'LAST - 3 .. INTEGER'LAST + I LOOP C; C; C; C; END LOOP; FOR J IN INTEGER'LAST + I .. INTEGER'LAST LOOP C; C; C; C; END LOOP; END LOOP; FOR I IN REVERSE INTEGER'LAST .. INTEGER'FIRST LOOP FAILED ("REVERSE WRONG NULL RANGE LOOP EXECUTION"); EXIT; END LOOP; FOR I IN REVERSE INTEGER'FIRST .. INTEGER'FIRST LOOP C; END LOOP; FOR I IN REVERSE INTEGER'FIRST .. INTEGER'FIRST + 2 LOOP C; C; END LOOP; FOR I IN REVERSE INTEGER'FIRST + 1 .. INTEGER'FIRST LOOP FAILED ("NULL RANGE ERROR 8"); EXIT; END LOOP; FOR I IN REVERSE INTEGER'FIRST .. INTEGER'LAST LOOP C; EXIT; END LOOP; FOR I IN REVERSE INTEGER LOOP C; EXIT; END LOOP; FOR I IN REVERSE INTEGER'LAST - 2 .. INTEGER'LAST LOOP C; C; C; END LOOP; FOR I IN REVERSE INTEGER'LAST - 2 .. INTEGER'LAST - 1 LOOP C; END LOOP; FOR I IN REVERSE 0 .. INTEGER'FIRST LOOP FAILED ("NULL LOOP ERROR 9"); EXIT; END LOOP; FOR I IN REVERSE -1 .. INTEGER'FIRST LOOP FAILED ("NULL LOOP ERROR 7"); EXIT; END LOOP; FOR I IN REVERSE -3 .. IDENT_INT(0) LOOP FOR J IN REVERSE INTEGER'FIRST .. INTEGER'FIRST - I LOOP C; C; C; C; END LOOP; FOR J IN REVERSE INTEGER'FIRST - I .. INTEGER'FIRST + 3 - I LOOP C; C; C; C; END LOOP; FOR J IN REVERSE INTEGER'LAST - 3 .. INTEGER'LAST + I LOOP C; C; C; C; END LOOP; FOR J IN REVERSE INTEGER'LAST + I .. INTEGER'LAST LOOP C; C; C; C; END LOOP; END LOOP; IF COUNT /= 408 THEN FAILED ("WRONG LOOP EXECUTION COUNT"); END IF; EXCEPTION WHEN CONSTRAINT_ERROR => FAILED ("CONSTRAINT_ERROR RAISED INCORRECTLY"); WHEN OTHERS => FAILED ("UNKNOWN EXCEPTION RAISED INCORRECTLY"); END; RESULT; END C55B05A;

34.976608

79

0.495235

d0c42c6f9355aef0a808fbaa91e414d465c9d436

1,448

ads

Ada

gdb/testsuite/gdb.ada/variant-record/value.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/variant-record/value.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/variant-record/value.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2020-2021 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/>. package Value is package Value_Name is Length : constant Positive := 8; subtype Name_T is String (1 .. Length); type A_Record_T is record X1 : Natural; X2 : Natural; end record; type Yes_No_T is (Yes, No); type T (Well : Yes_No_T := Yes) is record case Well is when Yes => Name : Name_T; when No => Unique_Name : A_Record_T; end case; end record; end; type T is private; function Create return T; function Name (Of_Value : T) return Value_Name.T; private type T is record One : Value_Name.T (Well => Value_Name.No); Two : Value_Name.T (Well => Value_Name.Yes); end record; end;

29.55102

73

0.654006

d093c3c0b62bab31347b926afb0a29c93cc4e7b9

826

adb

Ada

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2015-2017 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/>. package body Pck is procedure Do_Nothing (A : A_Type) is begin null; end Do_Nothing; end Pck;

34.416667

73

0.726392

c597bf25f95aacd48223bb85f58e86cde09ee22c

2,420

ada

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95034a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95034a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95034a.ada

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- C95034A.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 A CALLING TASK IS SUSPENDED IF THE RECEIVING TASK -- HAS NOT REACHED A CORRESPONDING ACCEPT STATEMENT. -- WEI 3/ 4/82 -- JWC 6/28/85 RENAMED FROM C950BJA-B.ADA with Impdef; WITH REPORT; USE REPORT; PROCEDURE C95034A IS SUBTYPE ARG IS NATURAL RANGE 0..9; SPYNUMB : NATURAL := 0; PROCEDURE PSPY_NUMB (DIGT: IN ARG) IS BEGIN SPYNUMB := 10*SPYNUMB+DIGT; END PSPY_NUMB; TASK T1 IS ENTRY E1; ENTRY E2; END T1; TASK BODY T1 IS BEGIN ACCEPT E1 DO PSPY_NUMB (1); DELAY 1.0 * Impdef.One_Second; END E1; ACCEPT E2 DO PSPY_NUMB (2); END E2; END T1; TASK T2 IS ENTRY BYE; END T2; TASK BODY T2 IS BEGIN T1.E2; PSPY_NUMB (3); ACCEPT BYE; END T2; BEGIN TEST ("C95034A", "SUSPENSION OF CALLING TASK"); T1.E1; T2.BYE; IF SPYNUMB /= 123 THEN FAILED ("ERROR DURING TASK EXECUTION"); COMMENT ("ACTUAL ORDER WAS:" & INTEGER'IMAGE(SPYNUMB)); END IF; RESULT; END C95034A;

28.139535

79

0.611157

cb19c922f1d5df44f08de91b6f14cba7f23216bc

793

ads

Ada

gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

1

2020-10-14T03:24:35.000Z

gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

gdb/testsuite/gdb.ada/str_ref_cmp/pck.ads

greyblue9/binutils-gdb

05377632b124fe7600eea7f4ee0e9a35d1b0cbdc

[ "BSD-3-Clause" ]

null

-- Copyright 2008-2021 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/>. package Pck is String_Var : String := "Hello from package Pck"; end Pck;

37.761905

73

0.732661

dc623aef2869f9ceec54bb2276768abb466c6db7

6,361

adb

Ada

source/xml/catalogs/matreshka-xml_catalogs-entry_files.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/xml/catalogs/matreshka-xml_catalogs-entry_files.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/xml/catalogs/matreshka-xml_catalogs-entry_files.adb

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- XML Processor -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011, Vadim Godunko <[email protected]> -- -- 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 Matreshka.XML_Catalogs.Entry_Files is ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Delegate_Public_Entry : not null Delegate_Public_Entry_Access) is begin Self.Delegate_Public_Entries.Append (Delegate_Public_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Delegate_System_Entry : not null Delegate_System_Entry_Access) is begin Self.Delegate_System_Entries.Append (Delegate_System_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Delegate_URI_Entry : not null Delegate_URI_Entry_Access) is begin Self.Delegate_URI_Entries.Append (Delegate_URI_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Next_Catalog_Entry : not null Next_Catalog_Entry_Access) is begin Self.Next_Catalog_Entries.Append (Next_Catalog_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Public_Entry : not null Public_Entry_Access) is begin Self.Public_Entries.Append (Public_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Rewrite_System_Entry : not null Rewrite_System_Entry_Access) is begin Self.Rewrite_System_Entries.Append (Rewrite_System_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; Rewrite_URI_Entry : not null Rewrite_URI_Entry_Access) is begin Self.Rewrite_URI_Entries.Append (Rewrite_URI_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; System_Entry : not null System_Entry_Access) is begin Self.System_Entries.Append (System_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; System_Suffix_Entry : not null System_Suffix_Entry_Access) is begin Self.System_Suffix_Entries.Append (System_Suffix_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; URI_Entry : not null URI_Entry_Access) is begin Self.URI_Entries.Append (URI_Entry); end Append; ------------ -- Append -- ------------ procedure Append (Self : in out Catalog_Entry_File; URI_Suffix_Entry : not null URI_Suffix_Entry_Access) is begin Self.URI_Suffix_Entries.Append (URI_Suffix_Entry); end Append; end Matreshka.XML_Catalogs.Entry_Files;

37.639053

78

0.485615

2317e14504020f3565618881e488b0c28fe46eff

5,025

ads

Ada

Ada95/samples/sample-form_demo-aux.ads

mvaisakh/android_external_libncurses

d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f

[ "DOC", "Unlicense" ]

35

2015-03-07T13:26:22.000Z

2021-11-06T16:18:59.000Z

Ada95/samples/sample-form_demo-aux.ads

mvaisakh/android_external_libncurses

d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f

[ "DOC", "Unlicense" ]

3

2017-04-07T21:02:48.000Z

2017-04-08T17:59:35.000Z

Ada95/samples/sample-form_demo-aux.ads

mvaisakh/android_external_libncurses

d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f

[ "DOC", "Unlicense" ]

19

2015-06-16T06:13:44.000Z

2021-07-24T02:37:45.000Z

------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Form_Demo.Aux -- -- -- -- 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.9 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ with Terminal_Interface.Curses; use Terminal_Interface.Curses; with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels; with Terminal_Interface.Curses.Forms; use Terminal_Interface.Curses.Forms; package Sample.Form_Demo.Aux is procedure Geometry (F : in Form; L : out Line_Count; C : out Column_Count; Y : out Line_Position; X : out Column_Position); -- Calculate the geometry for a panel beeing able to be used to display -- the menu. function Create (F : Form; Title : String; Lin : Line_Position; Col : Column_Position) return Panel; -- Create a panel decorated with a frame and the title at the specified -- position. The dimension of the panel is derived from the menus layout. procedure Destroy (F : in Form; P : in out Panel); -- Destroy all the windowing structures associated with this menu and -- panel. function Get_Request (F : Form; P : Panel; Handle_CRLF : Boolean := True) return Key_Code; -- Centralized request driver for all menus in this sample. This -- gives us a common key binding for all menus. function Make (Top : Line_Position; Left : Column_Position; Text : String) return Field; -- create a label function Make (Height : Line_Count := 1; Width : Column_Count; Top : Line_Position; Left : Column_Position; Off_Screen : Natural := 0) return Field; -- create a editable field function Default_Driver (F : Form; K : Key_Code; P : Panel) return Boolean; function Count_Active (F : Form) return Natural; -- Count the number of active fields in the form end Sample.Form_Demo.Aux;

54.032258

78

0.466866

cb9d71a751b48b88d9e49c909c43842bd332b5fe

1,198

adb

Ada

out/euler22.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

22

2017-04-24T10:00:45.000Z

2021-04-01T10:11:05.000Z

out/euler22.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

12

2017-03-26T18:34:21.000Z

2019-03-21T19:13:03.000Z

out/euler22.adb

Melyodas/metalang

399a9f1a71402c979d7f8024d4f98f081c80e771

[ "BSD-2-Clause" ]

7

2017-10-14T13:33:33.000Z

2021-03-18T15:18:50.000Z

with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C; use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C; procedure euler22 is type stringptr is access all char_array; procedure PString(s : stringptr) is begin String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all)); end; procedure PInt(i : in Integer) is begin String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left)); end; procedure SkipSpaces is C : Character; Eol : Boolean; begin loop Look_Ahead(C, Eol); exit when Eol or C /= ' '; Get(C); end loop; end; function score return Integer is sum : Integer; len : Integer; c : Character; begin SkipSpaces; Get(len); SkipSpaces; sum := 0; for i in integer range 1..len loop Get(c); sum := sum + Character'Pos(c) - Character'Pos('A') + 1; -- print c print " " print sum print " " end loop; return sum; end; sum : Integer; n : Integer; begin sum := 0; Get(n); for i in integer range 1..n loop sum := sum + i * score; end loop; PInt(sum); PString(new char_array'( To_C("" & Character'Val(10)))); end;

21.017544

97

0.66611

20a596acc60a1593bb8315fd587ed4a6422e5e30

2,178

adb

Ada

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp-initialize_ssl.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

81

2015-01-18T23:02:30.000Z

2022-03-19T17:34:57.000Z

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp-initialize_ssl.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

20

2015-12-09T19:26:19.000Z

2022-03-23T14:32:43.000Z

awa/plugins/awa-mail/src/aws/awa-mail-clients-aws_smtp-initialize_ssl.adb

My-Colaborations/ada-awa

cc2dee291a14e4df0dbc9c10285bf284a7f1caa8

[ "Apache-2.0" ]

16

2015-06-29T02:44:06.000Z

2021-09-23T18:47:50.000Z

----------------------------------------------------------------------- -- awa-mail-clients-aws_smtp-initialize -- Initialize SMTP client with SSL support -- Copyright (C) 2016 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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. ----------------------------------------------------------------------- separate (AWA.Mail.Clients.AWS_SMTP) procedure Initialize (Client : in out AWS_Mail_Manager'Class; Props : in Util.Properties.Manager'Class) is Server : constant String := Props.Get (Name => "smtp.host", Default => "localhost"); User : constant String := Props.Get (Name => "smtp.user", Default => ""); Passwd : constant String := Props.Get (Name => "smtp.password", Default => ""); Secure : constant String := Props.Get (Name => "smtp.ssl", Default => "0"); begin Client.Secure := Secure = "1" or Secure = "yes" or Secure = "true"; if User'Length > 0 then Client.Creds := AWS.SMTP.Authentication.Plain.Initialize (User, Passwd); Client.Server := AWS.SMTP.Client.Initialize (Server_Name => Server, Port => Client.Port, Secure => Client.Secure, Credential => Client.Creds'Unchecked_Access); else Client.Server := AWS.SMTP.Client.Initialize (Server_Name => Server, Port => Client.Port, Secure => Client.Secure); end if; end Initialize;

51.857143

97

0.559229

4a15a7401a9e126335b2b9cf1d3ce9354b54a038

3,620

ads

Ada

source/amf/uml/amf-uml-state_invariants-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-uml-state_invariants-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-uml-state_invariants-hash.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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.State_Invariants.Hash is new AMF.Elements.Generic_Hash (UML_State_Invariant, UML_State_Invariant_Access);

72.4

82

0.403867

0e47d4200ba0f32772078f96c3bf6701b6a9ca91

207

ads

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/case_null.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/case_null.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/case_null.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

package Case_Null is type T is (a, b, c, d, e); subtype S is T range b .. d; subtype S1 is S range a .. d; -- Low bound out of range of base subtype. procedure P1 (X : T); end Case_Null;

17.25

46

0.594203

2338293109ae66482de39b1026e640f911ccd542

2,024

ads

Ada

src/keystore-passwords-files.ads

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

25

2019-05-07T20:35:50.000Z

2021-11-30T10:35:47.000Z

src/keystore-passwords-files.ads

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

12

2019-12-16T23:30:00.000Z

2021-09-26T18:52:41.000Z

src/keystore-passwords-files.ads

My-Colaborations/ada-keystore

6ab222c2df81f32309c5a7b4f94a475214ef5ce3

[ "Apache-2.0" ]

3

2019-12-18T21:30:04.000Z

2021-01-06T08:30:36.000Z

----------------------------------------------------------------------- -- keystore-passwords-files -- File based password provider -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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 Keystore.Passwords.Keys; package Keystore.Passwords.Files is MAX_FILE_SIZE : constant := 1024; DEFAULT_KEY_FILE_LENGTH : constant := 32 + 16 + 32; -- Create a password provider that reads the file to build the password. -- The file must have the mode rw------- (600) and its owning directory -- the mode rwx------ (700). The Bad_Password exception is raised if -- these rules are not verified. function Create (Path : in String) return Provider_Access; -- Create a key provider that reads the file. The file is split in three parts -- the key, the IV, the signature which are extracted by using `Get_Keys`. function Create (Path : in String) return Keys.Key_Provider_Access; -- Generate a file that contains the keys. Keys are generated using a random generator. -- The file is created with the mode rw------- (600) and the owning directory is forced -- to the mode rwx------ (700). function Generate (Path : in String; Length : in Key_Length := DEFAULT_KEY_FILE_LENGTH) return Keys.Key_Provider_Access; end Keystore.Passwords.Files;

48.190476

92

0.649704

18a1bab5358fdf3b67d5404da563ee7406a5127b

4,978

ads

Ada

vector_math.ads

FROL256/ada-ray-tracer

7a4c538dac2fa54523d4eb315c2c963af4ef0f99

[ "MIT" ]

3

2017-02-22T18:53:43.000Z

2020-09-03T06:27:53.000Z

vector_math.ads

FROL256/ada-ray-tracer

7a4c538dac2fa54523d4eb315c2c963af4ef0f99

[ "MIT" ]

1

2018-12-14T18:10:35.000Z

2018-12-24T19:48:14.000Z

vector_math.ads

FROL256/ada-ray-tracer

7a4c538dac2fa54523d4eb315c2c963af4ef0f99

[ "MIT" ]

null

with Interfaces; with Ada.Numerics.Float_Random; with Generic_Vector_Math; use Interfaces; package Vector_Math is -- float math -- package Float_Math is new Generic_Vector_Math (float); function safe_tan(x : float) return float; function sign(x : float) return float; function pow(Left, Right : float) return float; infinity : constant float := float'Last; M_PI : constant float := Ada.Numerics.Pi; INV_PI : constant float := 1.0/Ada.Numerics.Pi; type float2 is new Float_Math.vector2; type float3 is new Float_Math.vector3; type float4 is new Float_Math.vector4; type float4x4 is new Float_Math.Matrix4; function sqr(x : float) return float renames Float_Math.sqr; function min(a, b : float) return float renames Float_Math.min; function max(a, b : float) return float renames Float_Math.max; function min(a, b, c : float) return float renames Float_Math.min; function max(a, b, c : float) return float renames Float_Math.max; function clamp(x,a,b : float) return float renames Float_Math.clamp; function lerp (t,a,b : float) return float; function length(a : float3) return float; function normalize (a : float3) return float3; function reflect(dir : float3; normal: float3) return float3; function min(a, b : Float_Math.vector3) return Float_Math.vector3 renames Float_Math.min; function max(a, b : Float_Math.vector3) return Float_Math.vector3 renames Float_Math.max; function clamp(x : Float_Math.vector3; a,b : float) return Float_Math.vector3 renames Float_Math.clamp; function clamp(x,a,b : Float_Math.vector3) return Float_Math.vector3 renames Float_Math.clamp; function RotationMatrix(angle : float; a_v : float3) return float4x4; function LookAtMatrix(eye, center, up : float3) return float4x4; --function "*"(m1 : float4x4; m2 : float4x4) return float4x4 renames Float_Math."*"; function "*"(m : float4x4; v : float3) return float3; function TransformNormal(m : float4x4; n : float3) return float3; function Flush_To_Zero(v : float3) return float3; IdentityMatrix : constant float4x4 := ((1.0,0.0,0.0,0.0), (0.0,1.0,0.0,0.0), (0.0,0.0,1.0,0.0), (0.0,0.0,0.0,1.0)); -- integer math -- package Integer_Math is new Generic_Vector_Math (integer); type int3 is new Integer_Math.vector3; type int4 is new Integer_Math.vector4; --function sqr(x : integer) return float renames Integer_Math.sqr; function min(a, b : integer) return integer renames Integer_Math.min; function max(a, b : integer) return integer renames Integer_Math.max; function min(a, b, c : integer) return integer renames Integer_Math.min; function max(a, b, c : integer) return integer renames Integer_Math.max; function clamp(x,a,b : integer) return integer renames Integer_Math.clamp; pragma Inline (normalize); pragma Inline (length); pragma Inline (reflect); pragma Inline (sqr); pragma Inline (min); pragma Inline (max); pragma Inline (clamp); -- rand gen -- -- this random generator should replace simple random for Kelmen-style MLT -- QMC_KMLT_MAXRANDS : constant := 64; type vector32i is array (0..QMC_KMLT_MAXRANDS-1) of integer; type vector32f is array (0..QMC_KMLT_MAXRANDS-1) of float; type RandomGenerator is tagged limited record agen : Ada.Numerics.Float_Random.Generator; -- samples array -- modify : vector32i := (others => 0); -- stores the global time when this coordinate was modified most recently values : vector32f := (others => 0.0); u_id : integer := 0; -- samples atack -- indices_stack : vector32i := (others => 0); values_stack : vector32f := (others => 0.0); top : integer := 0; -- 'global' variables -- time : integer := 1; -- Let us define a counter called time for the global time of the process which counts the number of accepted mutations large_step : integer := 1; -- variable large_step is 1 if a large step is made and zero otherwise large_step_time : integer := 1; -- The time of the last accepted large step is stored in variable large_step_time end record; function rnd_uniform(gen : access RandomGenerator; l,h : float) return float; function MapSampleToCosineDist(r1,r2 : float; direction, normal : float3; power : float) return float3; function MapSampleToCosineDistFixed(r1,r2 : float; direction, normal : float3; power : float) return float3; type MLTSample is record contrib : float3 := (0.0, 0.0, 0.0); w : float := 0.0; x,y : integer := 0; end record; type RandRef is access all RandomGenerator'Class; function RandomCosineVectorOf(gen : RandRef; norm : float3) return float3; function RandomCosineVectorOf(gen : RandRef; refl : float3; norm : float3; cosPower : float) return float3; end Vector_Math;

37.149254

160

0.687826

2325ca34a01c463b1e84ae782b7baf754e6c6324

5,825

ads

Ada

tools/scitools/conf/understand/ada/ada12/s-stoele.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

1

2020-01-20T21:26:46.000Z

tools/scitools/conf/understand/ada/ada12/s-stoele.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

tools/scitools/conf/understand/ada/ada12/s-stoele.ads

brucegua/moocos

575c161cfa35e220f10d042e2e5ca18773691695

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . S T O R A G E _ E L E M E N T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2002-2009, 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 implementation dependent sections of this file. -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- Warning: declarations in this package are ambiguous with respect to the -- extra declarations that can be introduced into System using Extend_System. -- It is a good idea to avoid use clauses for this package! pragma Compiler_Unit; package System.Storage_Elements 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). -- We also add the pragma Pure_Function to the operations in this package, -- because otherwise functions with parameters derived from Address are -- treated as non-pure by the back-end (see exp_ch6.adb). This is because -- in many cases such a parameter is used to hide read/out access to -- objects, and it would be unsafe to treat such functions as pure. type Storage_Offset is range -(2 ** (Integer'(Standard'Address_Size) - 1)) .. +(2 ** (Integer'(Standard'Address_Size) - 1)) - Long_Long_Integer'(1); -- Note: the reason for the Long_Long_Integer qualification here is to -- avoid a bogus ambiguity when this unit is analyzed in an rtsfind -- context. It may be possible to remove this in the future, but it is -- certainly harmless in any case ??? subtype Storage_Count is Storage_Offset range 0 .. Storage_Offset'Last; type Storage_Element is mod 2 ** Storage_Unit; for Storage_Element'Size use Storage_Unit; pragma Universal_Aliasing (Storage_Element); -- This type is used by the expander to implement aggregate copy type Storage_Array is array (Storage_Offset range <>) of aliased Storage_Element; for Storage_Array'Component_Size use Storage_Unit; -- Address arithmetic function "+" (Left : Address; Right : Storage_Offset) return Address; pragma Convention (Intrinsic, "+"); pragma Inline_Always ("+"); pragma Pure_Function ("+"); function "+" (Left : Storage_Offset; Right : Address) return Address; pragma Convention (Intrinsic, "+"); pragma Inline_Always ("+"); pragma Pure_Function ("+"); function "-" (Left : Address; Right : Storage_Offset) return Address; pragma Convention (Intrinsic, "-"); pragma Inline_Always ("-"); pragma Pure_Function ("-"); function "-" (Left, Right : Address) return Storage_Offset; pragma Convention (Intrinsic, "-"); pragma Inline_Always ("-"); pragma Pure_Function ("-"); function "mod" (Left : Address; Right : Storage_Offset) return Storage_Offset; pragma Convention (Intrinsic, "mod"); pragma Inline_Always ("mod"); pragma Pure_Function ("mod"); -- Conversion to/from integers type Integer_Address is mod Memory_Size; function To_Address (Value : Integer_Address) return Address; pragma Convention (Intrinsic, To_Address); pragma Inline_Always (To_Address); pragma Pure_Function (To_Address); function To_Integer (Value : Address) return Integer_Address; pragma Convention (Intrinsic, To_Integer); pragma Inline_Always (To_Integer); pragma Pure_Function (To_Integer); end System.Storage_Elements;

49.364407

79

0.535966

23406363275b93d2169c1e34104659c6c13461e9

3,739

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/g-sehamd.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/g-sehamd.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/g-sehamd.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S E C U R E _ H A S H E S . M D 5 -- -- -- -- S p e c -- -- -- -- Copyright (C) 2002-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. -- -- -- -- 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 package provides supporting code for implementation of the MD5 -- Message-Digest Algorithm as described in RFC 1321. The complete text of -- RFC 1321 can be found at: -- http://www.ietf.org/rfc/rfc1321.txt -- This is an internal unit and should not be used directly in applications. -- Use GNAT.MD5 instead. with GNAT.Byte_Swapping; with Interfaces; package GNAT.Secure_Hashes.MD5 is package Hash_State is new GNAT.Secure_Hashes.Hash_Function_State (Word => Interfaces.Unsigned_32, Swap => GNAT.Byte_Swapping.Swap4, Hash_Bit_Order => System.Low_Order_First); -- MD5 operates on 32-bit little endian words Block_Words : constant := 16; -- Messages are processed in chunks of 16 words procedure Transform (H : in out Hash_State.State; M : in out Message_State); -- Transformation function applied for each block Initial_State : constant Hash_State.State; -- Initialization vector private Initial_A : constant := 16#67452301#; Initial_B : constant := 16#EFCDAB89#; Initial_C : constant := 16#98BADCFE#; Initial_D : constant := 16#10325476#; Initial_State : constant Hash_State.State := (Initial_A, Initial_B, Initial_C, Initial_D); -- Initialization vector from RFC 1321 end GNAT.Secure_Hashes.MD5;

49.853333

78

0.483552

2007527514ed1e976fa69c8a5b19180b2656bef7

3,310

adb

Ada

exercise8.adb

KyrreHaugland/Exercise8

17280c562226a5599746e2981e875fc89c0f47bf

[ "Unlicense" ]

null

exercise8.adb

KyrreHaugland/Exercise8

17280c562226a5599746e2981e875fc89c0f47bf

[ "Unlicense" ]

null

exercise8.adb

KyrreHaugland/Exercise8

17280c562226a5599746e2981e875fc89c0f47bf

[ "Unlicense" ]

null

with Ada.Text_IO, Ada.Integer_Text_IO, Ada.Numerics.Float_Random; use Ada.Text_IO, Ada.Integer_Text_IO, Ada.Numerics.Float_Random; procedure exercise8 is Count_Failed : exception; -- Exception to be raised when counting fails Gen : Generator; -- Random number generator protected type Transaction_Manager (N : Positive) is entry Finished; entry Wait_Until_Aborted; procedure Signal_Abort; private Finished_Gate_Open : Boolean := False; Aborted : Boolean := False; end Transaction_Manager; protected body Transaction_Manager is entry Finished when Finished_Gate_Open or Finished'Count = N is begin ------------------------------------------ -- PART 3: Modify the Finished entry ------------------------------------------ Finished_Gate_Open := Finished'Count /= 0; if not Finished_Gate_Open then Aborted := False; end if; ------------------------------------------ end Finished; procedure Signal_Abort is begin Aborted := True; end Signal_Abort; ------------------------------------------ -- PART 2: Create the Wait_Until_Aborted entry ------------------------------------------ entry Wait_Until_Aborted when Aborted is begin if Wait_Until_Aborted'Count = 0 then Aborted := False; end if; end; ------------------------------------------ end Transaction_Manager; function Unreliable_Slow_Add (x : Integer) return Integer is Error_Rate : Constant := 0.15; -- (between 0 and 1) begin if Random(Gen) > Error_Rate then delay Duration(Random(Gen) * 5.0); return X + 10; else delay Duration(Random(Gen) * 1.0); raise Count_Failed; end if; end Unreliable_Slow_Add; task type Transaction_Worker (Initial : Integer; Manager : access Transaction_Manager); task body Transaction_Worker is Num : Integer := Initial; Prev : Integer := Num; Round_Num : Integer := 0; begin Put_Line ("Worker" & Integer'Image(Initial) & " started"); loop Put_Line ("Worker" & Integer'Image(Initial) & " started round" & Integer'Image(Round_Num) & " Number is" & Integer'Image(Num)); Round_Num := Round_Num + 1; ------------------------------------------ -- PART 1: Select-Then-Abort statement ------------------------------------------ select Manager.Wait_Until_Aborted; Num := Prev + 5; Put_Line("Error Handling occured"); then abort begin Num := Unreliable_Slow_Add(Num); exception when Count_Failed => Manager.Signal_Abort; end; Manager.Finished; ----Num := Prev; end select; ----------------------------------------- Prev := Num; delay 0.5; end loop; end Transaction_Worker; Manager : aliased Transaction_Manager (3); Worker_1 : Transaction_Worker (0, Manager'Access); Worker_2 : Transaction_Worker (1, Manager'Access); Worker_3 : Transaction_Worker (2, Manager'Access); begin Reset(Gen); -- Seed the random number generator end exercise8;

28.290598

139

0.54139

231f0da321d9f3564f85b6423ac4e6bccfe6a782

1,566

ads

Ada

2-low/collada/source/collada.ads

charlie5/lace

e9b7dc751d500ff3f559617a6fc3089ace9dc134

[ "0BSD" ]

20

2015-11-04T09:23:59.000Z

2022-01-14T10:21:42.000Z

2-low/collada/source/collada.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

2

2015-11-04T17:05:56.000Z

2015-12-08T03:16:13.000Z

2-low/collada/source/collada.ads

charlie5/lace-alire

9ace9682cf4daac7adb9f980c2868d6225b8111c

[ "0BSD" ]

1

2015-12-07T12:53:52.000Z

with float_Math, ada.Strings.unbounded; package Collada -- -- Provides a namespace and core types for the Collada package family. -- is ------- -- Text -- subtype Text is ada.Strings.unbounded.unbounded_String; function to_Text (From : in String) return Text renames ada.Strings.unbounded.To_unbounded_String; function to_String (From : in Text) return String renames ada.Strings.unbounded.To_String; type Text_array is array (Positive range <>) of Text; ------- -- Math -- -- Collada matrices use column vectors, so the translation vector is the 4th column. package Math renames float_Math; subtype Float_array is math.Vector; subtype Int_array is math.Integers; subtype Vector_3 is math.Vector_3; subtype Vector_4 is math.Vector_4; subtype Matrix_3x3 is math.Matrix_3x3; subtype Matrix_4x4 is math.Matrix_4x4; type Matrix_4x4_array is array (Positive range <>) of Matrix_4x4; Identity_4x4 : constant math.Matrix_4x4; function matrix_Count (From : in Float_array) return Natural; function get_Matrix (From : in Float_array; Which : in Positive) return Matrix_4x4; Error : exception; private Identity_4x4 : constant math.Matrix_4x4 := ((1.0, 0.0, 0.0, 0.0), (0.0, 1.0, 0.0, 0.0), (0.0, 0.0, 1.0, 0.0), (0.0, 0.0, 0.0, 1.0)); end Collada;

24.092308

90

0.597063

dce852f62fd16a264d0520f95391cb500bec0640

420

ads

Ada

source/types.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/types.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/types.ads

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

-- -- The author disclaims copyright to this source code. In place of -- a legal notice, here is a blessing: -- -- May you do good and not evil. -- May you find forgiveness for yourself and forgive others. -- May you share freely, not taking more than you give. -- package Types is type Symbol_Index is new Natural; type Line_Number is new Natural; type Offset_Type is new Integer; end Types;

23.333333

68

0.7

cbe695195b0b226ceaea6cb82b2243967c3f1caa

3,610

ads

Ada

src/log_filter.ads

Lyaaaaaaaaaaaaaaa/Lyaaaaa-s-Log-Filters

d1b402170642271ae73828522ac80313b392a229

[ "MIT" ]

1

2019-04-19T13:57:50.000Z

src/log_filter.ads

Lyaaaaaaaaaaaaaaa/Lyaaaaa-s-Logs-Filter

d1b402170642271ae73828522ac80313b392a229

[ "MIT" ]

2

2019-05-10T12:23:17.000Z

2019-05-31T12:56:06.000Z

src/log_filter.ads

Lyaaaaaaaaaaaaaaa/Lyaaaaa-s-Log-Filters

d1b402170642271ae73828522ac80313b392a229

[ "MIT" ]

null

---------------------------------------------------------- -- Copyright (c), The MIT License (MIT) -- Author: Lyaaaaaaaaaaaaaaa -- -- Revision History: -- 18/09/2019 Lyaaaaaaaaaaaaaaa -- - Added file header -- - Filter_Check becomes Check_Filters -- -- Encoding issues : -- - Needs UTF-8 encoded files, -- otherwise it will return wrong data. -- -- Limitations : -- - Filters can't be longer than 40 characters. -- See array_line_control 's range in Create_Filters. -- See Filters in Create_Filters and its subtype. ---------------------------------------------------------- with Text_IO; use Text_IO; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Text_IO.Unbounded_IO; with Ada.Characters.Handling; use Ada.Characters.Handling; ---------------------------------------------------------- package Log_Filter is ---------------------------------------------------------- type Store_Filter is array (Natural range <>, Natural range <>) of Character; type Store_Filters_State is array (Natural range <>) of Boolean; ---------------------------------------------------------- -------------------------------------------- -- Procedures and functions -- -------------------------------------------- ------------------- -- Filters -- ------------------- procedure Create_Filters (P_Number_Of_Filters : Natural; P_User_Filters_Input : String; P_Last_Inputs_Position : Natural); -- Inserts into 2D table "Store_Filter" input words in lower case. -- Calls Read_File procedure Check_Filters (P_Filters : store_Filter; P_Number_Of_Filters : Natural; P_Word : String; P_Filters_State : in out store_Filters_State); -- Compares each filter with the words in current line. procedure Initialize_Filters_State (P_Value : Boolean; P_Filters_State : in out Store_Filters_State); procedure Set_Filters (P_Filters : String); -- Counts the received filters and calls Create_Filters ----------------- -- Lines -- ----------------- procedure Update_Lines; -- Updates Lines and Lines_Count. procedure Read_Line (P_Filters : Store_Filter; P_Number_Of_Filters : Natural; P_Filters_State : in out Store_Filters_State); -- Reads Line character by character and inserts them into strings "Word" -- Then, calls Check_Filters. procedure Reset_Lines; procedure Reset_Lines_Count; function Get_Lines return String; function Get_Lines_Count return Integer; ---------------- -- File -- ---------------- procedure Read_File (P_Filters : Store_Filter; P_Number_Of_Filters : Natural); -- Inserts into Line the current line from the selected file. -- Calls Initialize_Filters_State and Read_Line, -- then checks Filter_State and calls Update_Lines. procedure Select_File (P_File : String); procedure Close_File; function Get_File_Name return String; ----------------- -- Other -- ----------------- function Are_They_All_True (P_Filters_State : Store_Filters_State) return Boolean; end Log_Filter;

29.112903

77

0.510803

2359701462c6d4c53e516887859244dcaa0dc07f

3,988

ads

Ada

llvm-gcc-4.2-2.9/gcc/ada/s-wchwts.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

1

2016-04-09T02:58:13.000Z

llvm-gcc-4.2-2.9/gcc/ada/s-wchwts.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

llvm-gcc-4.2-2.9/gcc/ada/s-wchwts.ads

vidkidz/crossbridge

ba0bf94aee0ce6cf7eb5be882382e52bc57ba396

[ "MIT" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W C H _ W T S -- -- -- -- S p e c -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routine used to convert wide strings and wide -- wide stringsto strings for use by wide and wide wide character attributes -- (value, image etc.) and also by the numeric IO subpackages of -- Ada.Text_IO.Wide_Text_IO and Ada.Text_IO.Wide_Wide_Text_IO. with System.WCh_Con; package System.WCh_WtS is pragma Pure; function Wide_String_To_String (S : Wide_String; EM : System.WCh_Con.WC_Encoding_Method) return String; -- This routine simply takes its argument and converts it to a string, -- using the internal compiler escape sequence convention (defined in -- package Widechar) to translate characters that are out of range -- of type String. In the context of the Wide_Value attribute, the -- argument is the original attribute argument, and the result is used -- in a call to the corresponding Value attribute function. If the method -- for encoding is a shift-in, shift-out convention, then it is assumed -- that normal (non-wide character) mode holds at the start and end of -- the result string. EM indicates the wide character encoding method. -- Note: in the WCEM_Brackets case, we only use the brackets encoding -- for characters greater than 16#FF#. function Wide_Wide_String_To_String (S : Wide_Wide_String; EM : System.WCh_Con.WC_Encoding_Method) return String; -- Same processing, except for Wide_Wide_String end System.WCh_WtS;

61.353846

78

0.52984

0ebfc5457cce3f6f5c1e3adf7eb49496e216bde2

4,052

ads

Ada

.emacs.d/elpa/wisi-2.1.1/sal-gen_indefinite_doubly_linked_lists.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.1.1/sal-gen_indefinite_doubly_linked_lists.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.1.1/sal-gen_indefinite_doubly_linked_lists.ads

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- Abstract : -- -- A generic doubly linked list with indefinite elements, allowing -- permanent references to elements. -- -- Copyright (C) 2018 - 2019 Free Software Foundation, Inc. -- -- This library 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 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 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, 59 Temple Place - Suite 330, Boston, -- MA 02111-1307, USA. -- -- 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. pragma License (Modified_GPL); with Ada.Finalization; with Ada.Unchecked_Deallocation; generic type Element_Type (<>) is private; package SAL.Gen_Indefinite_Doubly_Linked_Lists is type List is new Ada.Finalization.Controlled with private; Empty_List : constant List; overriding procedure Adjust (Container : in out List); -- Deep copy. overriding procedure Finalize (Container : in out List); -- Free all items in List. function Length (Container : in List) return Base_Peek_Type; procedure Append (Container : in out List; Element : in Element_Type); procedure Prepend (Container : in out List; Element : in Element_Type); type Cursor is private; No_Element : constant Cursor; function Has_Element (Position : in Cursor) return Boolean; function First (Container : in List) return Cursor; procedure Next (Position : in out Cursor); function Next (Position : in Cursor) return Cursor; function Element (Position : in Cursor) return Element_Type with Pre => Has_Element (Position); procedure Delete (Container : in out List; Position : in out Cursor) with Pre => Has_Element (Position); function Persistent_Ref (Position : in Cursor) return access Element_Type with Pre => Has_Element (Position); type Constant_Reference_Type (Element : not null access constant Element_Type) is null record with Implicit_Dereference => Element; function Constant_Reference (Position : in Cursor) return Constant_Reference_Type with Pre => Has_Element (Position); pragma Inline (Constant_Reference); function Constant_Ref (Container : in List'Class; Position : in Peek_Type) return Constant_Reference_Type with Pre => Position <= Container.Length; pragma Inline (Constant_Ref); type Reference_Type (Element : not null access Element_Type) is null record with Implicit_Dereference => Element; function Reference (Position : in Cursor) return Reference_Type with Pre => Has_Element (Position); pragma Inline (Reference); private type Node_Type; type Node_Access is access Node_Type; type Element_Access is access Element_Type; type Node_Type is record Element : Element_Access; Prev : Node_Access; Next : Node_Access; end record; procedure Free is new Ada.Unchecked_Deallocation (Node_Type, Node_Access); procedure Free is new Ada.Unchecked_Deallocation (Element_Type, Element_Access); type List is new Ada.Finalization.Controlled with record Head : Node_Access := null; Tail : Node_Access := null; Count : SAL.Base_Peek_Type := 0; end record; type Cursor is record Container : access List; Ptr : Node_Access; end record; Empty_List : constant List := (Ada.Finalization.Controlled with null, null, 0); No_Element : constant Cursor := (null, null); end SAL.Gen_Indefinite_Doubly_Linked_Lists;

34.338983

108

0.731244

200c566fba97463f3221d41c7f1599dd899e6ab3

3,163

adb

Ada

src/gnat/tree_in.adb

Letractively/ada-gen

d06d03821057f9177f2350e32dd09e467df08612

[ "Apache-2.0" ]

null

src/gnat/tree_in.adb

Letractively/ada-gen

d06d03821057f9177f2350e32dd09e467df08612

[ "Apache-2.0" ]

null

src/gnat/tree_in.adb

Letractively/ada-gen

d06d03821057f9177f2350e32dd09e467df08612

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- T R E E _ I N -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2010, 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. -- -- -- ------------------------------------------------------------------------------ with Aspects; with Atree; with Csets; with Debug; with Elists; with Fname; with Lib; with Namet; with Nlists; with Opt; with Repinfo; with Sem_Aux; with Sinput; with Stand; with Stringt; with Tree_IO; with Uintp; with Urealp; procedure Tree_In (Desc : File_Descriptor) is begin Tree_IO.Tree_Read_Initialize (Desc); Opt.Tree_Read; -- For now, only read aspect specifications hash table if -gnatd.A is set if Debug.Debug_Flag_Dot_AA then Aspects.Tree_Read; end if; Atree.Tree_Read; Elists.Tree_Read; Fname.Tree_Read; Lib.Tree_Read; Namet.Tree_Read; Nlists.Tree_Read; Sem_Aux.Tree_Read; Sinput.Tree_Read; Stand.Tree_Read; Stringt.Tree_Read; Uintp.Tree_Read; Urealp.Tree_Read; Repinfo.Tree_Read; Csets.Initialize; end Tree_In;

41.077922

78

0.453999

232bbf7fed3652455140da6e1276979eb335afda

5,461

ads

Ada

source/amf/uml/amf-standard_profile_l2-metaclasses-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-standard_profile_l2-metaclasses-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-standard_profile_l2-metaclasses-collections.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- 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.Metaclasses.Collections is pragma Preelaborate; package Standard_Profile_L2_Metaclass_Collections is new AMF.Generic_Collections (Standard_Profile_L2_Metaclass, Standard_Profile_L2_Metaclass_Access); type Set_Of_Standard_Profile_L2_Metaclass is new Standard_Profile_L2_Metaclass_Collections.Set with null record; Empty_Set_Of_Standard_Profile_L2_Metaclass : constant Set_Of_Standard_Profile_L2_Metaclass; type Ordered_Set_Of_Standard_Profile_L2_Metaclass is new Standard_Profile_L2_Metaclass_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_Standard_Profile_L2_Metaclass : constant Ordered_Set_Of_Standard_Profile_L2_Metaclass; type Bag_Of_Standard_Profile_L2_Metaclass is new Standard_Profile_L2_Metaclass_Collections.Bag with null record; Empty_Bag_Of_Standard_Profile_L2_Metaclass : constant Bag_Of_Standard_Profile_L2_Metaclass; type Sequence_Of_Standard_Profile_L2_Metaclass is new Standard_Profile_L2_Metaclass_Collections.Sequence with null record; Empty_Sequence_Of_Standard_Profile_L2_Metaclass : constant Sequence_Of_Standard_Profile_L2_Metaclass; private Empty_Set_Of_Standard_Profile_L2_Metaclass : constant Set_Of_Standard_Profile_L2_Metaclass := (Standard_Profile_L2_Metaclass_Collections.Set with null record); Empty_Ordered_Set_Of_Standard_Profile_L2_Metaclass : constant Ordered_Set_Of_Standard_Profile_L2_Metaclass := (Standard_Profile_L2_Metaclass_Collections.Ordered_Set with null record); Empty_Bag_Of_Standard_Profile_L2_Metaclass : constant Bag_Of_Standard_Profile_L2_Metaclass := (Standard_Profile_L2_Metaclass_Collections.Bag with null record); Empty_Sequence_Of_Standard_Profile_L2_Metaclass : constant Sequence_Of_Standard_Profile_L2_Metaclass := (Standard_Profile_L2_Metaclass_Collections.Sequence with null record); end AMF.Standard_Profile_L2.Metaclasses.Collections;

59.358696

110

0.557041

cba73adc0ad8e7a5594c7d17b6356b0f1929c78d

257

ads

Ada

specs/ada/server/cfg/tkmrpc-dispatchers-cfg.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/server/cfg/tkmrpc-dispatchers-cfg.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

specs/ada/server/cfg/tkmrpc-dispatchers-cfg.ads

DrenfongWong/tkm-rpc

075d22871cf81d497aac656c7f03a513278b641c

[ "BSD-3-Clause" ]

null

with Tkmrpc.Request; with Tkmrpc.Response; package Tkmrpc.Dispatchers.Cfg is procedure Dispatch (Req : Request.Data_Type; Res : out Response.Data_Type); -- Dispatch CFG request to concrete operation handler. end Tkmrpc.Dispatchers.Cfg;

21.416667

58

0.7393

23f47ae6992c9b92288e41860b39e1cc635f96dd

7,641

adb

Ada

src/aws/servlet-responses-web.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

6

2018-01-04T07:19:46.000Z

2020-12-27T14:49:44.000Z

src/aws/servlet-responses-web.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

9

2020-12-20T15:29:18.000Z

2022-02-04T20:13:58.000Z

src/aws/servlet-responses-web.adb

jquorning/ada-servlet

97db5fcdd59e01441c717b95a9e081aa7d6a7bbe

[ "Apache-2.0" ]

2

2021-01-06T08:32:38.000Z

2022-01-24T23:46:36.000Z

----------------------------------------------------------------------- -- servlet-responses.web -- Servlet Responses with AWS server -- Copyright (C) 2009, 2010, 2011, 2017, 2018 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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 AWS.Headers; with AWS.Messages; with AWS.Response.Set; with AWS.Containers.Tables; package body Servlet.Responses.Web is procedure Initialize (Resp : in out Response) is begin Resp.Content.Initialize (Size => 256 * 1024, Output => Resp'Unchecked_Access); Resp.Stream := Resp.Content'Unchecked_Access; end Initialize; -- ------------------------------ -- Write the buffer array to the output stream. -- ------------------------------ procedure Write (Stream : in out Response; Buffer : in Ada.Streams.Stream_Element_Array) is begin AWS.Response.Set.Append_Body (D => Stream.Data, Item => Buffer); end Write; -- ------------------------------ -- Flush the buffer (if any) to the sink. -- ------------------------------ procedure Flush (Stream : in out Response) is begin null; end Flush; function To_Status_Code (Status : in Natural) return AWS.Messages.Status_Code; function To_Status_Code (Status : in Natural) return AWS.Messages.Status_Code is use AWS.Messages; begin case Status is when 100 => return S100; when 101 => return S101; when 102 => return S102; when 200 => return S200; when 201 => return S201; when 202 => return S202; when 203 => return S203; when 204 => return S204; when 205 => return S205; when 206 => return S206; when 207 => return S207; when 301 => return S301; when 302 => return S302; when 400 => return S400; when 401 => return S401; when 402 => return S402; when 403 => return S403; when 404 => return S404; when 405 => return S405; when others => return S500; end case; end To_Status_Code; -- ------------------------------ -- Iterate over the response headers and executes the Process procedure. -- ------------------------------ procedure Iterate_Headers (Resp : in Response; Process : not null access procedure (Name : in String; Value : in String)) is Headers : constant AWS.Headers.List := AWS.Response.Header (Resp.Data); begin AWS.Containers.Tables.Iterate_Names (AWS.Containers.Tables.Table_Type (Headers), ";", Process); end Iterate_Headers; -- ------------------------------ -- Returns a boolean indicating whether the named response header has already -- been set. -- ------------------------------ function Contains_Header (Resp : in Response; Name : in String) return Boolean is begin raise Program_Error with "Contains_Header is not implemented"; return False; end Contains_Header; -- ------------------------------ -- Sets a response header with the given name and value. If the header had already -- been set, the new value overwrites the previous one. The containsHeader -- method can be used to test for the presence of a header before setting its value. -- ------------------------------ procedure Set_Header (Resp : in out Response; Name : in String; Value : in String) is begin if AWS.Response.Header (Resp.Data, Name)'Length = 0 then AWS.Response.Set.Add_Header (D => Resp.Data, Name => Name, Value => Value); end if; end Set_Header; -- ------------------------------ -- Adds a response header with the given name and value. -- This method allows response headers to have multiple values. -- ------------------------------ procedure Add_Header (Resp : in out Response; Name : in String; Value : in String) is begin AWS.Response.Set.Add_Header (D => Resp.Data, Name => Name, Value => Value); end Add_Header; -- ------------------------------ -- Sends a temporary redirect response to the client using the specified redirect -- location URL. This method can accept relative URLs; the servlet container must -- convert the relative URL to an absolute URL before sending the response to the -- client. If the location is relative without a leading '/' the container -- interprets it as relative to the current request URI. If the location is relative -- with a leading '/' the container interprets it as relative to the servlet -- container root. -- -- If the response has already been committed, this method throws an -- IllegalStateException. After using this method, the response should be -- considered to be committed and should not be written to. -- ------------------------------ procedure Send_Redirect (Resp : in out Response; Location : in String) is begin Response'Class (Resp).Set_Status (SC_FOUND); Response'Class (Resp).Set_Header (Name => "Location", Value => Location); Resp.Redirect := True; end Send_Redirect; -- ------------------------------ -- Prepare the response data by collecting the status, content type and message body. -- ------------------------------ procedure Build (Resp : in out Response) is begin if not Resp.Redirect then AWS.Response.Set.Content_Type (D => Resp.Data, Value => Resp.Get_Content_Type); Resp.Content.Flush; if AWS.Response.Is_Empty (Resp.Data) then AWS.Response.Set.Message_Body (Resp.Data, ""); end if; else AWS.Response.Set.Mode (D => Resp.Data, Value => AWS.Response.Header); end if; AWS.Response.Set.Status_Code (D => Resp.Data, Value => To_Status_Code (Resp.Get_Status)); end Build; -- ------------------------------ -- Get the response data -- ------------------------------ function Get_Data (Resp : in Response) return AWS.Response.Data is begin return Resp.Data; end Get_Data; end Servlet.Responses.Web;

37.640394

89

0.519435

209e87cf3ad224beb2d37874588ca7711fa1e38a

1,229

adb

Ada

tests/dispatch/ulog-gps.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

tests/dispatch/ulog-gps.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

tests/dispatch/ulog-gps.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

-- Institution: Technische Universitaet Muenchen -- Department: Realtime Computer Systems (RCS) -- Project: StratoX -- Author: Martin Becker ([email protected]) with Ada.Text_IO; -- TODO: remove -- @summary -- implements ULOG GPS message package body ULog.GPS with SPARK_Mode is overriding procedure Get_Serialization (msg : in Message; bytes : out HIL.Byte_Array) is begin -- TODO: serialize the extensions in GPS message null; end Get_Serialization; overriding procedure Get_Format (msg : in Message; bytes : out HIL.Byte_Array) is begin null; end Get_Format; function Copy (msg : in Message) return Message is begin Ada.Text_IO.Put_Line ("gps copy"); return msg; end Copy; overriding function Get_Size (msg : in Message) return Interfaces.Unsigned_16 is begin return 10; -- TODO end Get_Size; procedure Describe_Func (msg : in Message; namestring : out String) is begin namestring := "gps"; end Describe_Func; overriding function Self (msg : in Message) return ULog.Message'Class is begin Ada.Text_IO.Put_Line ("Self of ulog.gps"); return Message'(msg); end Self; end ULog.GPS;

25.081633

80

0.6786

0eb8aa20808e0b9cf714378ff2e37ca1977918cc

243

adb

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_direct_io.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_direct_io.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_direct_io.adb

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

-- { dg-do run } with Ada.Direct_IO; procedure Test_Direct_IO is package BDIO is new Ada.Direct_IO (Boolean); use BDIO; FD : File_Type; begin Create (FD, Form => "shared=yes"); Reset (FD); Close (FD); end Test_Direct_IO;

15.1875

47

0.650206

4ae8d7306a6cc12b2c2b67a9f5411602b5b4de7a

2,786

ads

Ada

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-sfhcin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-sfhcin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-sfhcin.ads

JCGobbi/Nucleo-STM32F334R8

2a0b1b4b2664c92773703ac5e95dcb71979d051c

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.STRINGS.FIXED.HASH_CASE_INSENSITIVE -- -- -- -- S p e c -- -- -- -- Copyright (C) 2011-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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Containers; with Ada.Strings.Hash_Case_Insensitive; function Ada.Strings.Fixed.Hash_Case_Insensitive (Key : String) return Containers.Hash_Type renames Ada.Strings.Hash_Case_Insensitive; pragma Pure (Ada.Strings.Fixed.Hash_Case_Insensitive);

66.333333

78

0.37509

c573c26d2df10e4312077674361756ae97d15002

642

adb

Ada

ZeroMQ/filecode/examples/Ada/zmq-examples-prompt.adb

JailbreakFox/LightWeightLib

70e209f6d2941335f48e4692299d885117bd61ee

[ "BSD-2-Clause" ]

2

2015-04-07T14:37:24.000Z

2015-11-06T00:31:01.000Z

ZeroMQ/filecode/examples/Ada/zmq-examples-prompt.adb

JailbreakFox/LightWeightLib

70e209f6d2941335f48e4692299d885117bd61ee

[ "BSD-2-Clause" ]

null

ZeroMQ/filecode/examples/Ada/zmq-examples-prompt.adb

JailbreakFox/LightWeightLib

70e209f6d2941335f48e4692299d885117bd61ee

[ "BSD-2-Clause" ]

null

with ZMQ.Sockets; with ZMQ.Contexts; with Ada.Text_IO; with GNAT.Sockets; procedure ZMQ.examples.prompt is ctx : aliased Contexts.Context; s : Sockets.Socket; begin ctx.Initialize (1); s.Initialize (ctx, Sockets.PUB); s.Connect ("tcp://localhost:5555"); Read_Loop : loop Ada.Text_IO.Put (">"); declare textbuf : constant String := Ada.Text_IO.Get_Line; begin exit Read_Loop when textbuf'Length = 0; s.Send ("hej" & ASCII.NUL & GNAT.Sockets.Host_Name & ":" & textbuf); delay 0.02; end; end loop Read_Loop; s.Send (END_MESSAGE); end ZMQ.Examples.prompt;

23.777778

77

0.632399

4ae633a60315eeccb39c3294fb7eb136829e9f29

1,107

adb

Ada

boards/stm32l151_Heltec/src/stm32-board.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

boards/stm32l151_Heltec/src/stm32-board.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

boards/stm32l151_Heltec/src/stm32-board.adb

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

with STM32.Setup; with STM32_SVD.RCC; use STM32_SVD.RCC; with STM32_SVD.DBGMCU; use STM32_SVD.DBGMCU; package body STM32.Board is --------------------- -- Initialize_LEDs -- --------------------- procedure Initialize_LEDs is Configuration : GPIO_Port_Configuration; begin Enable_Clock (LED1); Configuration.Mode := Mode_Out; Configuration.Output_Type := Push_Pull; Configuration.Speed := Speed_2MHz; Configuration.Resistors := Floating; Configure_IO (LED1, Config => Configuration); end Initialize_LEDs; procedure Initialize_Board is begin -- Two steps here to enable the debugger in WFI -- 1) Enable the DBGMCU regs. -- RCC_Periph.APB2ENR.DBGEN := True; -- 2) Allow debug in these 3 states -- w/o this setting, a WFI is goodbye to your gdb session. DBGMCU_Periph.CR := (DBG_SLEEP => True, DBG_STOP => True, DBG_STANDBY => True, others => <>); Initialize_LEDs; end Initialize_Board; end STM32.Board;

26.357143

65

0.597109

23f3347d7002370a785c8a0d00bebeb6b6f85db0

3,788

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/prj-pars.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

15

2015-01-18T23:04:19.000Z

2022-03-01T20:27:08.000Z

gcc-gcc-7_3_0-release/gcc/ada/prj-pars.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

16

2018-06-10T07:09:30.000Z

2022-03-26T18:28:40.000Z

gcc-gcc-7_3_0-release/gcc/ada/prj-pars.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

3

2015-11-11T18:00:14.000Z

2022-01-30T23:08:45.000Z

------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P R J . P A R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2000-2011, 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. -- -- -- ------------------------------------------------------------------------------ -- General wrapper for the parsing of project files with Prj.Tree; package Prj.Pars is procedure Set_Verbosity (To : Verbosity); -- Set the verbosity when parsing the project files procedure Parse (In_Tree : Project_Tree_Ref; Project : out Project_Id; Project_File_Name : String; Packages_To_Check : String_List_Access; Reset_Tree : Boolean := True; In_Node_Tree : Prj.Tree.Project_Node_Tree_Ref := null; Env : in out Prj.Tree.Environment); -- Parse and process a project files and all its imported project files, in -- the project tree In_Tree. -- -- All the project files are parsed (through Prj.Tree) to create a tree in -- memory. That tree is then processed (through Prj.Proc) to create a -- expanded representation of the tree based on the current external -- references. This function is only a convenient wrapper over other -- services provided in the Prj.* package hierarchy. -- -- If parsing is successful, Project is the project ID of the root project -- file; otherwise, Project_Id is set to No_Project. Project_Node_Tree is -- set to the tree (unprocessed) representation of the project file. This -- tree is permanently correct, whereas Project will need to be recomputed -- if the external references change. -- -- Packages_To_Check indicates the packages where any unknown attribute -- produces an error. For other packages, an unknown attribute produces a -- warning. -- -- When Reset_Tree is True, all the project data are removed from the -- project table before processing. -- -- In_Node_Tree (if given) must have been Initialized. The main reason to -- pass an existing tree, is to pass the external references that will then -- be used to process the tree. end Prj.Pars;

54.114286

79

0.527455

0e4b499ab1652385dead9a67fa2a47a5d8017fbd

1,932

ads

Ada

source/oasis/program-elements-attribute_definition_clauses.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-attribute_definition_clauses.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

null

source/oasis/program-elements-attribute_definition_clauses.ads

reznikmm/gela

20134f1d154fb763812e73860c6f4b04f353df79

[ "MIT" ]

1

2019-10-16T09:05:27.000Z

-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- with Program.Elements.Representation_Clauses; with Program.Lexical_Elements; with Program.Elements.Expressions; package Program.Elements.Attribute_Definition_Clauses is pragma Pure (Program.Elements.Attribute_Definition_Clauses); type Attribute_Definition_Clause is limited interface and Program.Elements.Representation_Clauses.Representation_Clause; type Attribute_Definition_Clause_Access is access all Attribute_Definition_Clause'Class with Storage_Size => 0; not overriding function Name (Self : Attribute_Definition_Clause) return not null Program.Elements.Expressions.Expression_Access is abstract; not overriding function Expression (Self : Attribute_Definition_Clause) return not null Program.Elements.Expressions.Expression_Access is abstract; type Attribute_Definition_Clause_Text is limited interface; type Attribute_Definition_Clause_Text_Access is access all Attribute_Definition_Clause_Text'Class with Storage_Size => 0; not overriding function To_Attribute_Definition_Clause_Text (Self : in out Attribute_Definition_Clause) return Attribute_Definition_Clause_Text_Access is abstract; not overriding function For_Token (Self : Attribute_Definition_Clause_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Use_Token (Self : Attribute_Definition_Clause_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; not overriding function Semicolon_Token (Self : Attribute_Definition_Clause_Text) return not null Program.Lexical_Elements.Lexical_Element_Access is abstract; end Program.Elements.Attribute_Definition_Clauses;

34.5

78

0.775362

0e6d9cedf999de0206283aa7903108a0b929ccff

5,260

ads

Ada

source/web/servlet/servlet-request_wrappers.ads

reznikmm/matreshka

6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/web/servlet/servlet-request_wrappers.ads

reznikmm/matreshka

6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee

[ "BSD-3-Clause" ]

1

2021-03-16T16:09:54.000Z

2021-08-30T10:37:31.000Z

source/web/servlet/servlet-request_wrappers.ads

reznikmm/matreshka

6f4414cb5fc4d6d9ffce3b61347c06ce8d365cee

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2014-2020, Vadim Godunko <[email protected]> -- -- 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$ ------------------------------------------------------------------------------ -- Provides a convenient implementation of the ServletRequest interface that -- can be subclassed by developers wishing to adapt the request to a Servlet. -- This class implements the Wrapper or Decorator pattern. Methods default to -- calling through to the wrapped request object. ------------------------------------------------------------------------------ with Ada.Streams; with League.String_Vectors; with League.Strings; with Servlet.Contexts; with Servlet.Requests; package Servlet.Request_Wrappers is pragma Preelaborate; type Servlet_Request_Wrapper (Request : not null access Servlet.Requests.Servlet_Request'Class) is limited new Servlet.Requests.Servlet_Request with null record; overriding function Get_Content_Type (Self : Servlet_Request_Wrapper) return League.Strings.Universal_String; overriding function Get_Input_Stream (Self : Servlet_Request_Wrapper) return not null access Ada.Streams.Root_Stream_Type'Class; overriding function Get_Parameter_Names (Self : Servlet_Request_Wrapper) return League.String_Vectors.Universal_String_Vector; overriding function Get_Parameter_Values (Self : Servlet_Request_Wrapper; Name : League.Strings.Universal_String) return League.String_Vectors.Universal_String_Vector; overriding function Get_Scheme (Self : Servlet_Request_Wrapper) return League.Strings.Universal_String; overriding function Get_Server_Name (Self : Servlet_Request_Wrapper) return League.Strings.Universal_String; overriding function Get_Server_Port (Self : Servlet_Request_Wrapper) return Positive; overriding function Get_Servlet_Context (Self : Servlet_Request_Wrapper) return access Servlet.Contexts.Servlet_Context'Class; overriding function Is_Async_Supported (Self : not null access Servlet_Request_Wrapper) return Boolean; end Servlet.Request_Wrappers;

53.673469

78

0.523194

20c4fe0e2e7af51f15408710ff6a4f545c8eafd4

17,032

ads

Ada

arch/ARM/Nordic/drivers/nrf51-events.ads

WickedShell/Ada_Drivers_Library

391866ad37a599347df40a4dbb3bf0721bedabea

[ "BSD-3-Clause" ]

6

2017-05-28T04:37:11.000Z

2020-11-22T11:26:19.000Z

arch/ARM/Nordic/drivers/nrf51-events.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2019-08-30T10:57:40.000Z

2020-02-11T21:34:14.000Z

arch/ARM/Nordic/drivers/nrf51-events.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2017-02-07T19:42:02.000Z

2020-11-22T11:26:20.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 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. -- -- -- ------------------------------------------------------------------------------ with System; with NRF51_SVD.POWER; with NRF51_SVD.CLOCK; with NRF51_SVD.GPIOTE; with NRF51_SVD.RADIO; with NRF51_SVD.TIMER; with NRF51_SVD.RTC; with NRF51_SVD.WDT; with NRF51_SVD.RNG; with NRF51_SVD.TEMP; with NRF51_SVD.ECB; with NRF51_SVD.CCM; with NRF51_SVD.AAR; with NRF51_SVD.SPI; with NRF51_SVD.TWI; with NRF51_SVD.UART; with NRF51_SVD.QDEC; with NRF51_SVD.ADC; with HAL; use HAL; package nRF51.Events is function Triggered (Evt : Event_Type) return Boolean; procedure Enable_Interrupt (Evt : Event_Type); procedure Disable_Interrupt (Evt : Event_Type); procedure Clear (Evt : Event_Type); -- Software event clear function Get_Address (Evt : Event_Type) return System.Address; function Get_Address (Evt : Event_Type) return UInt32; -- Power management events Power_POFWARN : constant Event_Type; -- Clock events Clock_HFCLKSTARTED : constant Event_Type; Clock_LFCLKSTARTED : constant Event_Type; Clock_DONE : constant Event_Type; Clock_CTTO : constant Event_Type; -- GPIOTE events GPIOTE_IN_0 : constant Event_Type; GPIOTE_IN_1 : constant Event_Type; GPIOTE_IN_2 : constant Event_Type; GPIOTE_IN_3 : constant Event_Type; GPIOTE_PORT : constant Event_Type; -- Radio events Radio_READY : constant Event_Type; Radio_ADDRESS : constant Event_Type; Radio_PAYLOAD : constant Event_Type; Radio_END : constant Event_Type; Radio_DISABLED : constant Event_Type; Radio_DEVMATCH : constant Event_Type; Radio_DEVMISS : constant Event_Type; Radio_RSSIEND : constant Event_Type; Radio_BCMATCH : constant Event_Type; -- Timer 0 events Timer_0_COMPARE_0 : constant Event_Type; Timer_0_COMPARE_1 : constant Event_Type; Timer_0_COMPARE_2 : constant Event_Type; Timer_0_COMPARE_3 : constant Event_Type; -- Timer 1 events Timer_1_COMPARE_0 : constant Event_Type; Timer_1_COMPARE_1 : constant Event_Type; Timer_1_COMPARE_2 : constant Event_Type; Timer_1_COMPARE_3 : constant Event_Type; -- Timer 2 events Timer_2_COMPARE_0 : constant Event_Type; Timer_2_COMPARE_1 : constant Event_Type; Timer_2_COMPARE_2 : constant Event_Type; Timer_2_COMPARE_3 : constant Event_Type; -- RTC 0 events RTC_0_TICK : constant Event_Type; RTC_0_OVERFLW : constant Event_Type; RTC_0_COMPARE_0 : constant Event_Type; RTC_0_COMPARE_1 : constant Event_Type; RTC_0_COMPARE_2 : constant Event_Type; RTC_0_COMPARE_3 : constant Event_Type; -- RTC 1 events RTC_1_TICK : constant Event_Type; RTC_1_OVERFLW : constant Event_Type; RTC_1_COMPARE_0 : constant Event_Type; RTC_1_COMPARE_1 : constant Event_Type; RTC_1_COMPARE_2 : constant Event_Type; RTC_1_COMPARE_3 : constant Event_Type; -- Watchdog task Watchdog_TIMEOUT : constant Event_Type; -- Random Number Genrator events RNG_VALRDY : constant Event_Type; -- Temperature events Temperature_DATARDY : constant Event_Type; -- AES Electronic Codebook mode encryption (ECB) events ECB_END : constant Event_Type; ECB_ERROR : constant Event_Type; -- AES CCM mode encryption (CCM) events CCM_KSGEN_END : constant Event_Type; CCM_CRYPT_END : constant Event_Type; CCM_ERROR : constant Event_Type; -- Accelerated Address Resolver (AAR) events AAR_END : constant Event_Type; AAR_RESOLVED : constant Event_Type; AAR_NOTRESOLVED : constant Event_Type; -- Serial Peripheral Interface (SPI) 0 events SPI_0_READY : constant Event_Type; -- Serial Peripheral Interface (SPI) 1 events SPI_1_READY : constant Event_Type; -- Two Wire Interface (TWI) 0 events TWI_0_STOPPED : constant Event_Type; TWI_0_RXDRDY : constant Event_Type; TWI_0_TXDENT : constant Event_Type; TWI_0_ERRO : constant Event_Type; TWI_0_BB : constant Event_Type; TWI_0_SUSPENDED : constant Event_Type; -- Two Wire Interface (TWI) 1 events TWI_1_STOPPED : constant Event_Type; TWI_1_RXDRDY : constant Event_Type; TWI_1_TXDENT : constant Event_Type; TWI_1_ERRO : constant Event_Type; TWI_1_BB : constant Event_Type; TWI_1_SUSPENDED : constant Event_Type; -- Universal Asynchronous Receiver/Transmitter (UART) Events UART_RXDRDY : constant Event_Type; UART_TXDRDY : constant Event_Type; UART_ERROR : constant Event_Type; -- Quadrature Decoder (QDEC) QDEC_SAMPLERDY : constant Event_Type; QDEC_REPORTRDY : constant Event_Type; QDEC_ACCOF : constant Event_Type; -- Analof to Digital Converter (ADC) ADC_END : constant Event_Type; private -- Power management events Power_POFWARN : constant Event_Type := Event_Type (NRF51_SVD.POWER.POWER_Periph.EVENTS_POFWARN'Address); -- Clock events Clock_HFCLKSTARTED : constant Event_Type := Event_Type (NRF51_SVD.CLOCK.CLOCK_Periph.EVENTS_HFCLKSTARTED'Address); Clock_LFCLKSTARTED : constant Event_Type := Event_Type (NRF51_SVD.CLOCK.CLOCK_Periph.EVENTS_LFCLKSTARTED'Address); Clock_DONE : constant Event_Type := Event_Type (NRF51_SVD.CLOCK.CLOCK_Periph.EVENTS_DONE'Address); Clock_CTTO : constant Event_Type := Event_Type (NRF51_SVD.CLOCK.CLOCK_Periph.EVENTS_CTTO'Address); -- GPIOTE events GPIOTE_IN_0 : constant Event_Type := Event_Type (NRF51_SVD.GPIOTE.GPIOTE_Periph.EVENTS_IN (0)'Address); GPIOTE_IN_1 : constant Event_Type := Event_Type (NRF51_SVD.GPIOTE.GPIOTE_Periph.EVENTS_IN (1)'Address); GPIOTE_IN_2 : constant Event_Type := Event_Type (NRF51_SVD.GPIOTE.GPIOTE_Periph.EVENTS_IN (2)'Address); GPIOTE_IN_3 : constant Event_Type := Event_Type (NRF51_SVD.GPIOTE.GPIOTE_Periph.EVENTS_IN (3)'Address); GPIOTE_PORT : constant Event_Type := Event_Type (NRF51_SVD.GPIOTE.GPIOTE_Periph.EVENTS_PORT'Address); -- Radio events Radio_READY : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_READY'Address); Radio_ADDRESS : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_ADDRESS'Address); Radio_PAYLOAD : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_PAYLOAD'Address); Radio_END : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_END'Address); Radio_DISABLED : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_DISABLED'Address); Radio_DEVMATCH : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_DEVMATCH'Address); Radio_DEVMISS : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_DEVMISS'Address); Radio_RSSIEND : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_RSSIEND'Address); Radio_BCMATCH : constant Event_Type := Event_Type (NRF51_SVD.RADIO.RADIO_Periph.EVENTS_BCMATCH'Address); -- Timer 0 events Timer_0_COMPARE_0 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER0_Periph.EVENTS_COMPARE (0)'Address); Timer_0_COMPARE_1 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER0_Periph.EVENTS_COMPARE (1)'Address); Timer_0_COMPARE_2 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER0_Periph.EVENTS_COMPARE (2)'Address); Timer_0_COMPARE_3 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER0_Periph.EVENTS_COMPARE (3)'Address); -- Timer 1 events Timer_1_COMPARE_0 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER1_Periph.EVENTS_COMPARE (0)'Address); Timer_1_COMPARE_1 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER1_Periph.EVENTS_COMPARE (1)'Address); Timer_1_COMPARE_2 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER1_Periph.EVENTS_COMPARE (2)'Address); Timer_1_COMPARE_3 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER1_Periph.EVENTS_COMPARE (3)'Address); -- Timer 2 events Timer_2_COMPARE_0 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER2_Periph.EVENTS_COMPARE (0)'Address); Timer_2_COMPARE_1 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER2_Periph.EVENTS_COMPARE (1)'Address); Timer_2_COMPARE_2 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER2_Periph.EVENTS_COMPARE (2)'Address); Timer_2_COMPARE_3 : constant Event_Type := Event_Type (NRF51_SVD.TIMER.TIMER2_Periph.EVENTS_COMPARE (3)'Address); -- RTC 0 events RTC_0_TICK : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_TICK'Address); RTC_0_OVERFLW : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_OVRFLW'Address); RTC_0_COMPARE_0 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_COMPARE (0)'Address); RTC_0_COMPARE_1 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_COMPARE (1)'Address); RTC_0_COMPARE_2 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_COMPARE (2)'Address); RTC_0_COMPARE_3 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC0_Periph.EVENTS_COMPARE (3)'Address); -- RTC 1 events RTC_1_TICK : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_TICK'Address); RTC_1_OVERFLW : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_OVRFLW'Address); RTC_1_COMPARE_0 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_COMPARE (0)'Address); RTC_1_COMPARE_1 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_COMPARE (1)'Address); RTC_1_COMPARE_2 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_COMPARE (2)'Address); RTC_1_COMPARE_3 : constant Event_Type := Event_Type (NRF51_SVD.RTC.RTC1_Periph.EVENTS_COMPARE (3)'Address); -- Watchdog task Watchdog_TIMEOUT : constant Event_Type := Event_Type (NRF51_SVD.WDT.WDT_Periph.EVENTS_TIMEOUT'Address); -- Random Number Genrator events RNG_VALRDY : constant Event_Type := Event_Type (NRF51_SVD.RNG.RNG_Periph.EVENTS_VALRDY'Address); -- Temperature events Temperature_DATARDY : constant Event_Type := Event_Type (NRF51_SVD.TEMP.TEMP_Periph.EVENTS_DATARDY'Address); -- AES Electronic Codebook mode encryption (ECB) events ECB_END : constant Event_Type := Event_Type (NRF51_SVD.ECB.ECB_Periph.EVENTS_ENDECB'Address); ECB_ERROR : constant Event_Type := Event_Type (NRF51_SVD.ECB.ECB_Periph.EVENTS_ERRORECB'Address); -- AES CCM mode encryption (CCM) events CCM_KSGEN_END : constant Event_Type := Event_Type (NRF51_SVD.CCM.CCM_Periph.EVENTS_ENDKSGEN'Address); CCM_CRYPT_END : constant Event_Type := Event_Type (NRF51_SVD.CCM.CCM_Periph.EVENTS_ENDCRYPT'Address); CCM_ERROR : constant Event_Type := Event_Type (NRF51_SVD.CCM.CCM_Periph.EVENTS_ERROR'Address); -- Accelerated Address Resolver (AAR) events AAR_END : constant Event_Type := Event_Type (NRF51_SVD.AAR.AAR_Periph.EVENTS_END'Address); AAR_RESOLVED : constant Event_Type := Event_Type (NRF51_SVD.AAR.AAR_Periph.EVENTS_RESOLVED'Address); AAR_NOTRESOLVED : constant Event_Type := Event_Type (NRF51_SVD.AAR.AAR_Periph.EVENTS_NOTRESOLVED'Address); -- Serial Peripheral Interface (SPI) events SPI_0_READY : constant Event_Type := Event_Type (NRF51_SVD.SPI.SPI0_Periph.EVENTS_READY'Address); -- Serial Peripheral Interface (SPI) events SPI_1_READY : constant Event_Type := Event_Type (NRF51_SVD.SPI.SPI1_Periph.EVENTS_READY'Address); -- Two Wire Interface (TWI) 0 events TWI_0_STOPPED : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_STOPPED'Address); TWI_0_RXDRDY : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_RXDREADY'Address); TWI_0_TXDENT : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_TXDSENT'Address); TWI_0_ERRO : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_ERROR'Address); TWI_0_BB : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_BB'Address); TWI_0_SUSPENDED : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI0_Periph.EVENTS_SUSPENDED'Address); -- Two Wire Interface (TWI) 1 events TWI_1_STOPPED : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_STOPPED'Address); TWI_1_RXDRDY : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_RXDREADY'Address); TWI_1_TXDENT : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_TXDSENT'Address); TWI_1_ERRO : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_ERROR'Address); TWI_1_BB : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_BB'Address); TWI_1_SUSPENDED : constant Event_Type := Event_Type (NRF51_SVD.TWI.TWI1_Periph.EVENTS_SUSPENDED'Address); -- Universal Asynchronous Receiver/Transmitter (UART) Events UART_RXDRDY : constant Event_Type := Event_Type (NRF51_SVD.UART.UART0_Periph.EVENTS_RXDRDY'Address); UART_TXDRDY : constant Event_Type := Event_Type (NRF51_SVD.UART.UART0_Periph.EVENTS_TXDRDY'Address); UART_ERROR : constant Event_Type := Event_Type (NRF51_SVD.UART.UART0_Periph.EVENTS_ERROR'Address); -- Quadrature Decoder (QDEC) QDEC_SAMPLERDY : constant Event_Type := Event_Type (NRF51_SVD.QDEC.QDEC_Periph.EVENTS_SAMPLERDY'Address); QDEC_REPORTRDY : constant Event_Type := Event_Type (NRF51_SVD.QDEC.QDEC_Periph.EVENTS_REPORTRDY'Address); QDEC_ACCOF : constant Event_Type := Event_Type (NRF51_SVD.QDEC.QDEC_Periph.EVENTS_ACCOF'Address); -- Analof to Digital Converter (ADC) ADC_END : constant Event_Type := Event_Type (NRF51_SVD.ADC.ADC_Periph.EVENTS_END'Address); end nRF51.Events;

44.469974

78

0.679779

c5f5fc35b5852365d2b5b53f1cd4b71fe4811f55

94

ads

Ada

ada homework2/src/card_dir.ads

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

ada homework2/src/card_dir.ads

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

ada homework2/src/card_dir.ads

jamalakhaligova/ADA

f4ad841052620f998f7d4e7d23b0457aea0a7565

[ "Apache-2.0" ]

null

package Card_Dir is type Cardinal_Direction is (N, NE, E, SE, S, SW, W, NW); end Card_Dir;

18.8

58

0.680851

c53f0efac876b2436a6417aba75237d87ef497e3

54,623

adb

Ada

.emacs.d/elpa/wisi-2.2.1/wisitoken-parse-lr-mckenzie_recover.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.2.1/wisitoken-parse-lr-mckenzie_recover.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.2.1/wisitoken-parse-lr-mckenzie_recover.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- Abstract : -- -- See spec -- -- Copyright (C) 2017 - 2019 Free Software Foundation, Inc. -- -- This library 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 library is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- -- TABILITY 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. pragma License (Modified_GPL); with Ada.Characters.Handling; with Ada.Exceptions; with Ada.Unchecked_Deallocation; with System.Multiprocessors; with WisiToken.Parse.LR.McKenzie_Recover.Base; with WisiToken.Parse.LR.McKenzie_Recover.Explore; with WisiToken.Parse.LR.Parser_Lists; package body WisiToken.Parse.LR.McKenzie_Recover is use all type System.Multiprocessors.CPU_Range; type Supervisor_Access is access all Base.Supervisor; type Shared_Access is access all Base.Shared; task type Worker_Task is entry Start (ID : in Integer; Super : in Supervisor_Access; Shared : in Shared_Access); -- Start getting parser/configs to check from Config_Store. Stop when -- Super reports All_Done; entry Done; -- Available after Super has reported All_Done. end Worker_Task; type Worker_Access is access Worker_Task; procedure Free is new Ada.Unchecked_Deallocation (Worker_Task, Worker_Access); task body Worker_Task is use all type Base.Config_Status; Super : Supervisor_Access; Shared : Shared_Access; Status : Base.Config_Status := Valid; begin loop select accept Start (ID : in Integer; Super : in Supervisor_Access; Shared : in Shared_Access) do Task_Attributes.Set_Value (ID); Worker_Task.Super := Super; Worker_Task.Shared := Shared; end Start; or terminate; end select; loop Explore.Process_One (Super, Shared, Status); exit when Status = All_Done; end loop; accept Done; Super := null; Shared := null; end loop; exception when E : others => Super.Fatal (E); end Worker_Task; Worker_Tasks : array (1 .. System.Multiprocessors.CPU_Range'Max (1, System.Multiprocessors.Number_Of_CPUs - 1)) of Worker_Access; -- Declaring an array of tasks directly causes a circular elaboration -- problem, and would mean a task that terminates due to an exception -- is never restarted. procedure To_Recover (Parser_Stack : in Parser_Lists.Parser_Stacks.Stack; Tree : in Syntax_Trees.Tree; Stack : in out Recover_Stacks.Stack) is Depth : constant SAL.Peek_Type := Parser_Stack.Depth; begin pragma Assert (Stack.Depth = 0); if Stack.Size < Depth then raise SAL.Programmer_Error with "recover stack needs more space;" & Depth'Image; end if; for I in reverse 1 .. Depth loop declare Item : Parser_Lists.Parser_Stack_Item renames Parser_Stack (I); Token : constant Recover_Token := (if I = Depth then (others => <>) else Tree.Recover_Token (Item.Token)); begin Stack.Push ((Item.State, Item.Token, Token)); end; end loop; end To_Recover; procedure Recover_Init (Shared_Parser : in out LR.Parser.Parser; Parser_State : in out Parser_Lists.Parser_State) is use all type WisiToken.Parse.LR.Parser.Language_Fixes_Access; Trace : WisiToken.Trace'Class renames Shared_Parser.Trace.all; Config : Configuration; Error : Parse_Error renames Parser_State.Errors (Parser_State.Errors.Last); begin Parser_State.Recover.Enqueue_Count := Parser_State.Recover.Enqueue_Count + 1; Config.Resume_Token_Goal := Parser_State.Shared_Token + Shared_Parser.Table.McKenzie_Param.Check_Limit; if Trace_McKenzie > Outline then Trace.New_Line; Trace.Put_Line ("parser" & Integer'Image (Parser_State.Label) & ": State" & State_Index'Image (Parser_State.Stack (1).State) & " Current_Token" & Parser_State.Tree.Image (Parser_State.Current_Token, Trace.Descriptor.all) & " Resume_Token_Goal" & WisiToken.Token_Index'Image (Config.Resume_Token_Goal)); Trace.Put_Line ((case Error.Label is when Action => "Action", when Check => "Check, " & Semantic_Checks.Image (Error.Check_Status, Trace.Descriptor.all), when Message => raise SAL.Programmer_Error)); if Trace_McKenzie > Extra then Put_Line (Trace, Parser_State.Label, Parser_Lists.Image (Parser_State.Stack, Trace.Descriptor.all, Parser_State.Tree)); end if; end if; -- Additional initialization of Parser_State.Recover is done in -- Supervisor.Initialize. To_Recover (Parser_State.Stack, Parser_State.Tree, Config.Stack); -- Parser_State.Recover_Insert_Delete must be empty (else we would not get -- here). Therefore Parser_State current token is in -- Shared_Parser.Shared_Token. Config.Current_Shared_Token := Parser_State.Shared_Token; case Error.Label is when Action => Config.Error_Token := Parser_State.Tree.Recover_Token (Error.Error_Token); if Trace_McKenzie > Detail then Put ("enqueue", Trace, Parser_State.Label, Shared_Parser.Terminals, Config, Task_ID => False); end if; when Check => if Shared_Parser.Language_Fixes = null then -- The only fix is to ignore the error. if Trace_McKenzie > Detail then Put ("enqueue", Trace, Parser_State.Label, Shared_Parser.Terminals, Config, Task_ID => False); end if; else -- Undo the reduction that encountered the error, let Process_One -- enqueue possible solutions. We leave the cost at 0, since this is -- the root config. Later logic will enqueue the 'ignore error' -- solution; see McKenzie_Recover.Explore Process_One. Config.Check_Status := Error.Check_Status; Config.Error_Token := Config.Stack.Peek.Token; Config.Check_Token_Count := Undo_Reduce (Config.Stack, Parser_State.Tree); Config_Op_Arrays.Append (Config.Ops, (Undo_Reduce, Config.Error_Token.ID, Config.Check_Token_Count)); if Trace_McKenzie > Detail then Put ("undo_reduce " & Image (Config.Error_Token.ID, Trace.Descriptor.all), Trace, Parser_State.Label, Shared_Parser.Terminals, Config, Task_ID => False); end if; end if; when Message => -- Last error entry should be the failure that caused us to enter -- recovery. raise SAL.Programmer_Error; end case; Parser_State.Recover.Config_Heap.Add (Config); end Recover_Init; function Recover (Shared_Parser : in out LR.Parser.Parser) return Recover_Status is use all type Parser.Post_Recover_Access; Trace : WisiToken.Trace'Class renames Shared_Parser.Trace.all; Parsers : Parser_Lists.List renames Shared_Parser.Parsers; Current_Parser : Parser_Lists.Cursor; Super : aliased Base.Supervisor (Trace'Access, Check_Delta_Limit => Shared_Parser.Table.McKenzie_Param.Check_Delta_Limit, Enqueue_Limit => Shared_Parser.Table.McKenzie_Param.Enqueue_Limit, Parser_Count => Parsers.Count); Shared : aliased Base.Shared (Shared_Parser.Trace, Shared_Parser.Lexer.all'Access, Shared_Parser.Table, Shared_Parser.Language_Fixes, Shared_Parser.Language_Matching_Begin_Tokens, Shared_Parser.Language_String_ID_Set, Shared_Parser.Terminals'Access, Shared_Parser.Line_Begin_Token'Access); Task_Count : constant System.Multiprocessors.CPU_Range := (if Shared_Parser.Table.McKenzie_Param.Task_Count = 0 then Worker_Tasks'Last -- Keep one CPU free for this main task, and the user. else Shared_Parser.Table.McKenzie_Param.Task_Count); begin if Trace_McKenzie > Outline then Trace.New_Line; Trace.Put_Line (" McKenzie error recovery"); end if; Super.Initialize (Parsers'Unrestricted_Access, Shared_Parser.Terminals'Unrestricted_Access); for Parser_State of Parsers loop Recover_Init (Shared_Parser, Parser_State); end loop; if Trace_McKenzie > Outline then Trace.New_Line; Trace.Put_Line (System.Multiprocessors.CPU_Range'Image (Worker_Tasks'Last) & " parallel tasks"); end if; for I in Worker_Tasks'First .. Task_Count loop if Worker_Tasks (I) = null then Worker_Tasks (I) := new Worker_Task; if Debug_Mode then Trace.Put_Line ("new Worker_Task" & System.Multiprocessors.CPU_Range'Image (I)); end if; elsif Worker_Tasks (I)'Terminated then Free (Worker_Tasks (I)); Worker_Tasks (I) := new Worker_Task; if Debug_Mode then Trace.Put_Line ("recreated Worker_Task" & System.Multiprocessors.CPU_Range'Image (I)); end if; end if; Worker_Tasks (I).Start (Integer (I), Super'Unchecked_Access, Shared'Unchecked_Access); end loop; declare use Ada.Exceptions; ID : Exception_Id; Message : Ada.Strings.Unbounded.Unbounded_String; begin Super.Done (ID, Message); -- Wait for all parsers to fail or succeed -- Ensure all worker tasks stop getting configs before proceeding; -- otherwise local variables disappear while the task is still trying -- to access them. for I in Worker_Tasks'First .. Task_Count loop if not Worker_Tasks (I)'Terminated then Worker_Tasks (I).Done; end if; end loop; if ID /= Null_Id then Raise_Exception (ID, -Message); end if; end; -- Adjust parser state for each successful recovery. -- -- One option here would be to keep only the parser with the least -- cost fix. However, the normal reason for having multiple parsers -- is to resolve a grammar ambiguity; the least cost fix might -- resolve the ambiguity the wrong way. As could any other fix, of -- course. -- Spawn new parsers for multiple solutions. -- -- We could try to check here for redundant solutions; configs for a -- parser that have the same or "equivalent" ops. But those will be -- caught in the main parse by the check for duplicate state; doing -- the same check here is premature optimization. declare use Parser_Lists; Cur : Cursor := Parsers.First; Solutions : SAL.Base_Peek_Type := 0; Spawn_Limit : SAL.Base_Peek_Type := Shared_Parser.Max_Parallel; -- per parser begin for Parser of Parsers loop if Parser.Recover.Success then Solutions := Solutions + Parser.Recover.Results.Count; end if; end loop; if Solutions > Shared_Parser.Max_Parallel and Trace_McKenzie > Outline then Trace.Put_Line ("too many parallel parsers required in recover; dropping some solutions"); Spawn_Limit := Shared_Parser.Max_Parallel / Parsers.Count; end if; loop declare Data : McKenzie_Data renames State_Ref (Cur).Recover; begin if Data.Success then if Trace_McKenzie > Outline then Trace.Put_Line (Integer'Image (Label (Cur)) & ": succeed" & SAL.Base_Peek_Type'Image (Data.Results.Count) & ", enqueue" & Integer'Image (Data.Enqueue_Count) & ", check " & Integer'Image (Data.Check_Count) & ", cost: " & Integer'Image (Data.Results.Min_Key)); end if; if Data.Results.Count > 1 then for I in 1 .. SAL.Base_Peek_Type'Min (Spawn_Limit, Data.Results.Count - 1) loop Parsers.Prepend_Copy (Cur); -- does not copy recover if Trace_McKenzie > Outline or Trace_Parse > Outline then Trace.Put_Line ("spawn parser" & Integer'Image (Parsers.First.Label) & " from " & Trimmed_Image (Cur.Label) & " (" & Trimmed_Image (Integer (Parsers.Count)) & " active)"); Put ("", Trace, Parsers.First.Label, Shared_Parser.Terminals, Data.Results.Peek, Task_ID => False, Strategy => True); end if; State_Ref (Parsers.First).Recover.Results.Add (Data.Results.Remove); State_Ref (Parsers.First).Recover.Success := True; end loop; end if; if Trace_McKenzie > Outline or Trace_Parse > Outline then Put ("", Trace, Cur.State_Ref.Label, Shared_Parser.Terminals, Data.Results.Peek, Task_ID => False, Strategy => True); end if; else if Trace_McKenzie > Outline then Trace.Put_Line (Integer'Image (Cur.Label) & ": fail, enqueue" & Integer'Image (Data.Enqueue_Count) & (if Data.Config_Full_Count > 0 then ", config_full" & Data.Config_Full_Count'Image else "") & ", check " & Integer'Image (Data.Check_Count) & ", max shared_token " & WisiToken.Token_Index'Image (Shared_Parser.Terminals.Last_Index)); end if; end if; end; Next (Cur); exit when Is_Done (Cur); end loop; end; -- Edit Parser_State to apply solutions. -- We don't use 'for Parser_State of Parsers loop' here, -- because we might need to terminate a parser. Current_Parser := Parsers.First; loop exit when Current_Parser.Is_Done; if Current_Parser.State_Ref.Recover.Success then begin -- Can't have active 'renames State_Ref' when terminate a parser declare use Parser_Lists; use Config_Op_Arrays, Config_Op_Array_Refs; use Sorted_Insert_Delete_Arrays; Parser_State : Parser_Lists.Parser_State renames Current_Parser.State_Ref; Descriptor : WisiToken.Descriptor renames Shared_Parser.Trace.Descriptor.all; Tree : Syntax_Trees.Tree renames Parser_State.Tree; Data : McKenzie_Data renames Parser_State.Recover; Result : Configuration renames Data.Results.Peek; Min_Op_Token_Index : WisiToken.Token_Index := WisiToken.Token_Index'Last; Min_Push_Back_Token_Index : WisiToken.Token_Index := WisiToken.Token_Index'Last; Stack_Matches_Ops : Boolean := True; Shared_Token_Changed : Boolean := False; Current_Token_Virtual : Boolean := False; Sorted_Insert_Delete : aliased Sorted_Insert_Delete_Arrays.Vector; procedure Apply_Prev_Token is begin loop exit when not Parser_State.Prev_Deleted.Contains (Parser_State.Shared_Token); Parser_State.Shared_Token := Parser_State.Shared_Token + 1; end loop; end Apply_Prev_Token; begin -- The verb will be reset by the main parser; just indicate the -- parser recovered from the error. Parser_State.Set_Verb (Shift); Parser_State.Errors (Parser_State.Errors.Last).Recover := Result; Parser_State.Resume_Token_Goal := Result.Resume_Token_Goal; if Trace_McKenzie > Extra then Put_Line (Trace, Parser_State.Label, "before Ops applied:", Task_ID => False); Put_Line (Trace, Parser_State.Label, "stack " & Image (Parser_State.Stack, Descriptor, Tree), Task_ID => False); Put_Line (Trace, Parser_State.Label, "Shared_Token " & Image (Parser_State.Shared_Token, Shared_Parser.Terminals, Descriptor), Task_ID => False); Put_Line (Trace, Parser_State.Label, "Current_Token " & Parser_State.Tree.Image (Parser_State.Current_Token, Descriptor), Task_ID => False); end if; -- We don't apply all Ops to the parser stack here, because that -- requires updating the syntax tree as well, and we want to let the -- main parser do that, partly as a double check on the algorithms -- here. -- -- However, the main parser can only apply Insert and Delete ops; we -- must apply Push_Back and Undo_Reduce here. Note that Fast_Forward -- ops are just for bookkeeping. -- -- In order to apply Undo_Reduce, we also need to apply any preceding -- ops. See test_mckenzie_recover.adb Missing_Name_2 for an example -- of multiple Undo_Reduce. On the other hand, Push_Back can be -- applied without the preceding ops. -- -- A Push_Back can go back past preceding ops, including Undo_Reduce; -- there's no point in applying ops that are later superceded by such -- a Push_Back. See test_mckenzie_recover.adb Out_Of_Order_Ops for an -- example. -- -- Push_Back can also go back past a previous error recovery; we must -- apply Parser_State.Prev_Deleted here as well, when computing -- Shared_Token. -- -- So first we go thru Ops to find the earliest Push_Back. Then we -- apply ops that are before that point, up to the first Insert or -- Fast_Forward. After that, we enqueue Insert and Delete ops on -- Parser_State.Recover_Insert_Delete, in token_index order, and any -- Undo_Reduce are rejected. -- -- Then the main parser parses the edited input stream. -- -- There's no need to modify Parser_State.Tree. Any tree nodes -- created by the failed parse that are pushed back are useful for -- error repair, and will just be ignored in future parsing. This -- also avoids enlarging a non-flushed branched tree, which saves -- time and space. for I in First_Index (Result.Ops) .. Last_Index (Result.Ops) loop declare Op : Config_Op renames Constant_Ref (Result.Ops, I); begin case Op.Op is when Fast_Forward => if Op.FF_Token_Index < Min_Op_Token_Index then Min_Op_Token_Index := Op.FF_Token_Index; end if; when Undo_Reduce => null; when Push_Back => if Op.PB_Token_Index /= Invalid_Token_Index then if Op.PB_Token_Index < Min_Op_Token_Index then Min_Op_Token_Index := Op.PB_Token_Index; end if; if Op.PB_Token_Index < Min_Push_Back_Token_Index then Min_Push_Back_Token_Index := Op.PB_Token_Index; end if; end if; when Insert => if Op.Ins_Token_Index /= Invalid_Token_Index then if Op.Ins_Token_Index < Min_Op_Token_Index then Min_Op_Token_Index := Op.Ins_Token_Index; end if; if Op.Ins_Token_Index < Min_Push_Back_Token_Index then Min_Push_Back_Token_Index := Op.Ins_Token_Index; end if; end if; when Delete => if Op.Del_Token_Index /= Invalid_Token_Index then if Op.Del_Token_Index < Min_Op_Token_Index then Min_Op_Token_Index := Op.Del_Token_Index; end if; if Op.Del_Token_Index < Min_Push_Back_Token_Index then Min_Push_Back_Token_Index := Op.Del_Token_Index; end if; end if; end case; end; end loop; for I in First_Index (Result.Ops) .. Last_Index (Result.Ops) loop declare Op : Config_Op renames Constant_Ref (Result.Ops, I); begin case Op.Op is when Fast_Forward => Stack_Matches_Ops := False; when Undo_Reduce => if not Stack_Matches_Ops then if Trace_McKenzie > Outline then Put_Line (Trace, Parser_State.Label, "Undo_Reduce after insert or fast_forward", Task_ID => False); end if; raise Bad_Config; end if; declare Item : constant Parser_Lists.Parser_Stack_Item := Parser_State.Stack.Pop; begin case Tree.Label (Item.Token) is when Syntax_Trees.Shared_Terminal | Syntax_Trees.Virtual_Identifier | Syntax_Trees.Virtual_Terminal => if Trace_McKenzie > Outline then Put_Line (Trace, Parser_State.Label, "expecting nonterminal, found " & Image (Tree.ID (Item.Token), Trace.Descriptor.all), Task_ID => False); end if; raise Bad_Config; when Syntax_Trees.Nonterm => for C of Tree.Children (Item.Token) loop Parser_State.Stack.Push ((Tree.State (C), C)); end loop; end case; end; when Push_Back => if Stack_Matches_Ops then Parser_State.Stack.Pop; if Op.PB_Token_Index /= Invalid_Token_Index then Parser_State.Shared_Token := Op.PB_Token_Index; Shared_Token_Changed := True; end if; elsif Op.PB_Token_Index = Min_Op_Token_Index then loop -- Multiple push_backs can have the same Op.PB_Token_Index, so we may -- already be at the target. exit when Parser_State.Shared_Token <= Op.PB_Token_Index and (Parser_State.Stack.Depth = 1 or else Tree.Min_Terminal_Index (Parser_State.Stack (1).Token) /= Invalid_Token_Index); -- also push back empty tokens. declare Item : constant Parser_Lists.Parser_Stack_Item := Parser_State.Stack.Pop; Min_Index : constant Base_Token_Index := Parser_State.Tree.Min_Terminal_Index (Item.Token); begin if Min_Index /= Invalid_Token_Index then Shared_Token_Changed := True; Parser_State.Shared_Token := Min_Index; end if; end; end loop; pragma Assert (Parser_State.Shared_Token = Op.PB_Token_Index); end if; when Insert => if Stack_Matches_Ops and Op.Ins_Token_Index = Parser_State.Shared_Token then -- This is the first Insert. Even if a later Push_Back supercedes it, -- we record Stack_Matches_Ops false here. Stack_Matches_Ops := False; if Op.Ins_Token_Index <= Min_Push_Back_Token_Index then Parser_State.Current_Token := Parser_State.Tree.Add_Terminal (Op.Ins_ID); Current_Token_Virtual := True; else if Is_Full (Sorted_Insert_Delete) then raise Bad_Config; else Insert (Sorted_Insert_Delete, Op); end if; end if; else if Is_Full (Sorted_Insert_Delete) then raise Bad_Config; else Insert (Sorted_Insert_Delete, Op); end if; end if; when Delete => if Stack_Matches_Ops and Op.Del_Token_Index = Parser_State.Shared_Token then -- We can apply multiple deletes. Parser_State.Shared_Token := Op.Del_Token_Index + 1; Apply_Prev_Token; Shared_Token_Changed := True; else if Is_Full (Sorted_Insert_Delete) then raise Bad_Config; else Insert (Sorted_Insert_Delete, Op); end if; end if; end case; end; end loop; -- We may not have processed the current Insert or Delete above, if -- they are after a fast_forward. for I in First_Index (Sorted_Insert_Delete) .. Last_Index (Sorted_Insert_Delete) loop declare Op : Insert_Delete_Op renames Insert_Delete_Array_Refs.Constant_Ref (Sorted_Insert_Delete, I); begin if Token_Index (Op) = Parser_State.Shared_Token and not Current_Token_Virtual then case Insert_Delete_Op_Label'(Op.Op) is when Insert => Parser_State.Current_Token := Parser_State.Tree.Add_Terminal (ID (Op)); Current_Token_Virtual := True; when Delete => Parser_State.Shared_Token := Op.Del_Token_Index + 1; Apply_Prev_Token; Shared_Token_Changed := True; end case; else Parser_State.Recover_Insert_Delete.Put (Op); end if; end; end loop; -- If not Shared_Token_Changed, Shared_Token is the error token, -- which is the next token to read. If Shared_Token_Changed, we have -- set Shared_Token consistent with that; it is the next token to -- read. If Current_Token_Virtual, then after all the virtual tokens -- are inserted, the main parser would normally increment -- Parser_State.Shared_Token to get the next token, but we don't want -- that now. We could set Shared_Token to 1 less, but this way the -- debug messages all show the expected Shared_Terminal. Parser_State.Inc_Shared_Token := not Current_Token_Virtual; -- The main parser always sets Current_Token to be the syntax tree -- node containing Shared_Token; ensure that is true here (virtual -- tokens where handled above). if (not Current_Token_Virtual) and Shared_Token_Changed then Parser_State.Current_Token := Parser_State.Tree.Add_Terminal (Parser_State.Shared_Token, Shared_Parser.Terminals); end if; if Trace_McKenzie > Extra then Put_Line (Trace, Parser_State.Label, "after Ops applied:", Task_ID => False); Put_Line (Trace, Parser_State.Label, "stack " & Parser_Lists.Image (Parser_State.Stack, Descriptor, Tree), Task_ID => False); Put_Line (Trace, Parser_State.Label, "Shared_Token " & Image (Parser_State.Shared_Token, Shared_Parser.Terminals, Descriptor), Task_ID => False); Put_Line (Trace, Parser_State.Label, "Current_Token " & Parser_State.Tree.Image (Parser_State.Current_Token, Descriptor), Task_ID => False); Put_Line (Trace, Parser_State.Label, "recover_insert_delete " & Image (Parser_State.Recover_Insert_Delete, Descriptor), Task_ID => False); Put_Line (Trace, Parser_State.Label, "inc_shared_token " & Boolean'Image (Parser_State.Inc_Shared_Token) & " parser verb " & All_Parse_Action_Verbs'Image (Parser_State.Verb), Task_ID => False); end if; end; exception when Bad_Config => if Parsers.Count = 1 then -- Oops. just give up return Fail_Programmer_Error; end if; Parsers.Terminate_Parser (Current_Parser, "bad config in recover", Trace, Shared_Parser.Terminals); end; end if; Current_Parser.Next; end loop; if Shared_Parser.Post_Recover /= null then Shared_Parser.Post_Recover.all; end if; return Super.Recover_Result; exception when E : others => if Debug_Mode then Trace.Put (Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E)); end if; return Fail_Programmer_Error; end Recover; ---------- -- Spec private subprograms; for language-specific -- child packages. procedure Check (ID : Token_ID; Expected_ID : in Token_ID) is begin pragma Assert (ID = Expected_ID, Token_ID'Image (ID) & " /=" & Token_ID'Image (Expected_ID)); end Check; function Current_Token (Terminals : in Base_Token_Arrays.Vector; Terminals_Current : in out WisiToken.Base_Token_Index; Restore_Terminals_Current : out WisiToken.Base_Token_Index; Insert_Delete : aliased in out Sorted_Insert_Delete_Arrays.Vector; Current_Insert_Delete : in out SAL.Base_Peek_Type; Prev_Deleted : in Recover_Token_Index_Arrays.Vector) return Base_Token is use Sorted_Insert_Delete_Arrays; use Insert_Delete_Array_Refs; procedure Inc_I_D is begin Current_Insert_Delete := Current_Insert_Delete + 1; if Current_Insert_Delete > Last_Index (Insert_Delete) then Current_Insert_Delete := No_Insert_Delete; Clear (Insert_Delete); end if; end Inc_I_D; begin if Terminals_Current = Invalid_Token_Index then -- Happens with really bad syntax; see test_mckenzie_recover.adb Error_4. raise Bad_Config; end if; loop if Current_Insert_Delete = No_Insert_Delete then Restore_Terminals_Current := Terminals_Current; return Terminals (Terminals_Current); elsif Token_Index (Constant_Ref (Insert_Delete, Current_Insert_Delete)) = Terminals_Current then declare Op : Insert_Delete_Op renames Constant_Ref (Insert_Delete, Current_Insert_Delete); begin case Insert_Delete_Op_Label (Op.Op) is when Insert => -- Decrement Terminals_Current so Next_Token knows it should always -- increment it. Save the initial value, to restore in case of error. Restore_Terminals_Current := Terminals_Current; Terminals_Current := Terminals_Current - 1; return (ID => ID (Op), others => <>); when Delete => Terminals_Current := Terminals_Current + 1; loop exit when not Prev_Deleted.Contains (Terminals_Current); Terminals_Current := Terminals_Current + 1; end loop; Restore_Terminals_Current := Terminals_Current; Inc_I_D; end case; end; else return Terminals (Terminals_Current); end if; end loop; end Current_Token; function Current_Token_ID_Peek (Terminals : in Base_Token_Arrays.Vector; Terminals_Current : in Base_Token_Index; Insert_Delete : aliased in Sorted_Insert_Delete_Arrays.Vector; Current_Insert_Delete : in SAL.Base_Peek_Type) return Token_ID is use Insert_Delete_Array_Refs; Result : Token_ID; begin if Terminals_Current = Base_Token_Index'First then -- Happens with really bad syntax. raise Bad_Config; end if; -- First set Result from Terminals; may be overridden by -- Insert_Delete below. Result := Terminals (Terminals_Current).ID; if Current_Insert_Delete = No_Insert_Delete then null; elsif Token_Index (Constant_Ref (Insert_Delete, Current_Insert_Delete)) = Terminals_Current then declare Op : Insert_Delete_Op renames Constant_Ref (Insert_Delete, Current_Insert_Delete); begin case Insert_Delete_Op_Label (Op.Op) is when Insert => Result := Op.Ins_ID; when Delete => -- This should have been handled in Check raise SAL.Programmer_Error; end case; end; end if; return Result; end Current_Token_ID_Peek; procedure Current_Token_ID_Peek_3 (Terminals : in Base_Token_Arrays.Vector; Terminals_Current : in Base_Token_Index; Insert_Delete : aliased in Sorted_Insert_Delete_Arrays.Vector; Current_Insert_Delete : in SAL.Base_Peek_Type; Prev_Deleted : in Recover_Token_Index_Arrays.Vector; Tokens : out Token_ID_Array_1_3) is Terminals_Next : WisiToken.Token_Index := Terminals_Current + 1; begin if Terminals_Current = Base_Token_Index'First then -- Happens with really bad syntax; see test_mckenzie_recover.adb Error_4. raise Bad_Config; end if; -- First set Tokens from Terminals; may be overridden by -- Insert_Delete below. Tokens (1) := Terminals (Terminals_Current).ID; loop exit when not Prev_Deleted.Contains (Terminals_Next); Terminals_Next := Terminals_Next + 1; end loop; if Terminals_Next <= Terminals.Last_Index then Tokens (2) := Terminals (Terminals_Next).ID; loop Terminals_Next := Terminals_Next + 1; exit when not Prev_Deleted.Contains (Terminals_Next); end loop; if Terminals_Next <= Terminals.Last_Index then Tokens (3) := Terminals (Terminals_Next).ID; else Tokens (3) := Invalid_Token_ID; end if; else Tokens (2) := Invalid_Token_ID; Tokens (3) := Invalid_Token_ID; end if; if Current_Insert_Delete = No_Insert_Delete then null; else for I in Tokens'Range loop declare use Sorted_Insert_Delete_Arrays, Insert_Delete_Array_Refs; J : constant SAL.Base_Peek_Type := Current_Insert_Delete + SAL.Peek_Type (I) - 1; begin if (J in First_Index (Insert_Delete) .. Last_Index (Insert_Delete)) and then Token_Index (Constant_Ref (Insert_Delete, J)) = Terminals_Current then declare Op : Insert_Delete_Op renames Constant_Ref (Insert_Delete, J); begin case Insert_Delete_Op_Label (Op.Op) is when Insert => Tokens (I) := Op.Ins_ID; when Delete => -- This should have been handled in Check raise SAL.Programmer_Error; end case; end; end if; end; end loop; end if; end Current_Token_ID_Peek_3; procedure Delete_Check (Terminals : in Base_Token_Arrays.Vector; Config : in out Configuration; ID : in Token_ID) is use Config_Op_Arrays; use Sorted_Insert_Delete_Arrays; Op : constant Config_Op := (Delete, ID, Config.Current_Shared_Token); begin Check (Terminals (Config.Current_Shared_Token).ID, ID); if Is_Full (Config.Ops) or Is_Full (Config.Insert_Delete) then raise Bad_Config; end if; Append (Config.Ops, Op); Insert (Config.Insert_Delete, Op); Config.Current_Insert_Delete := 1; end Delete_Check; procedure Delete_Check (Terminals : in Base_Token_Arrays.Vector; Config : in out Configuration; Index : in out WisiToken.Token_Index; ID : in Token_ID) is use Config_Op_Arrays; use Sorted_Insert_Delete_Arrays; Op : constant Config_Op := (Delete, ID, Index); begin Check (Terminals (Index).ID, ID); if Is_Full (Config.Ops) or Is_Full (Config.Insert_Delete) then raise Bad_Config; end if; Append (Config.Ops, Op); Insert (Config.Insert_Delete, Op); Config.Current_Insert_Delete := 1; Index := Index + 1; end Delete_Check; procedure Find_ID (Config : in Configuration; ID : in Token_ID; Matching_Index : in out SAL.Peek_Type) is begin loop exit when Matching_Index = Config.Stack.Depth; -- Depth has Invalid_Token_ID declare Stack_ID : Token_ID renames Config.Stack.Peek (Matching_Index).Token.ID; begin exit when Stack_ID = ID; end; Matching_Index := Matching_Index + 1; end loop; end Find_ID; procedure Find_ID (Config : in Configuration; IDs : in Token_ID_Set; Matching_Index : in out SAL.Peek_Type) is begin loop exit when Matching_Index >= Config.Stack.Depth; -- Depth has Invalid_Token_ID declare ID : Token_ID renames Config.Stack.Peek (Matching_Index).Token.ID; begin exit when ID in IDs'First .. IDs'Last and then IDs (ID); end; Matching_Index := Matching_Index + 1; end loop; end Find_ID; procedure Find_Descendant_ID (Tree : in Syntax_Trees.Tree; Config : in Configuration; ID : in Token_ID; ID_Set : in Token_ID_Set; Matching_Index : in out SAL.Peek_Type) is use Syntax_Trees; begin loop exit when Matching_Index >= Config.Stack.Depth; -- Depth has Invalid_Token_ID exit when Config.Stack.Peek (Matching_Index).Token.ID in ID_Set'Range and then (ID_Set (Config.Stack.Peek (Matching_Index).Token.ID) and (Config.Stack.Peek (Matching_Index).Tree_Index /= Invalid_Node_Index and then Tree.Find_Descendant (Config.Stack.Peek (Matching_Index).Tree_Index, ID) /= Invalid_Node_Index)); Matching_Index := Matching_Index + 1; end loop; end Find_Descendant_ID; procedure Find_Matching_Name (Config : in Configuration; Lexer : access constant WisiToken.Lexer.Instance'Class; Name : in String; Matching_Name_Index : in out SAL.Peek_Type; Case_Insensitive : in Boolean) is use Ada.Characters.Handling; Match_Name : constant String := (if Case_Insensitive then To_Lower (Name) else Name); begin loop exit when Matching_Name_Index >= Config.Stack.Depth; -- Depth has Invalid_Token_ID declare Token : Recover_Token renames Config.Stack.Peek (Matching_Name_Index).Token; Name_Region : constant Buffer_Region := (if Token.Name = Null_Buffer_Region then Token.Byte_Region else Token.Name); begin exit when Name_Region /= Null_Buffer_Region and then Match_Name = (if Case_Insensitive then To_Lower (Lexer.Buffer_Text (Name_Region)) else Lexer.Buffer_Text (Name_Region)); Matching_Name_Index := Matching_Name_Index + 1; end; end loop; end Find_Matching_Name; procedure Find_Matching_Name (Config : in Configuration; Lexer : access constant WisiToken.Lexer.Instance'Class; Name : in String; Matching_Name_Index : in out SAL.Peek_Type; Other_ID : in Token_ID; Other_Count : out Integer; Case_Insensitive : in Boolean) is use Ada.Characters.Handling; Match_Name : constant String := (if Case_Insensitive then To_Lower (Name) else Name); begin Other_Count := 0; loop exit when Matching_Name_Index >= Config.Stack.Depth; -- Depth has Invalid_Token_ID declare Token : Recover_Token renames Config.Stack.Peek (Matching_Name_Index).Token; Name_Region : constant Buffer_Region := (if Token.Name = Null_Buffer_Region then Token.Byte_Region else Token.Name); begin exit when Name_Region /= Null_Buffer_Region and then Match_Name = (if Case_Insensitive then To_Lower (Lexer.Buffer_Text (Name_Region)) else Lexer.Buffer_Text (Name_Region)); if Other_ID = Token.ID then Other_Count := Other_Count + 1; end if; Matching_Name_Index := Matching_Name_Index + 1; end; end loop; end Find_Matching_Name; procedure Insert (Config : in out Configuration; ID : in Token_ID) is use Config_Op_Arrays; use Sorted_Insert_Delete_Arrays; Op : constant Config_Op := (Insert, ID, Config.Current_Shared_Token, Unknown_State, 0); begin if Is_Full (Config.Ops) or Is_Full (Config.Insert_Delete) then raise Bad_Config; end if; Append (Config.Ops, Op); Insert (Config.Insert_Delete, Op); Config.Current_Insert_Delete := 1; end Insert; procedure Insert (Config : in out Configuration; IDs : in Token_ID_Array) is begin for ID of IDs loop Insert (Config, ID); end loop; end Insert; function Next_Token (Terminals : in Base_Token_Arrays.Vector; Terminals_Current : in out Base_Token_Index; Restore_Terminals_Current : in out WisiToken.Base_Token_Index; Insert_Delete : aliased in out Sorted_Insert_Delete_Arrays.Vector; Current_Insert_Delete : in out SAL.Base_Peek_Type; Prev_Deleted : in Recover_Token_Index_Arrays.Vector) return Base_Token is use Sorted_Insert_Delete_Arrays, Insert_Delete_Array_Refs; function Next_Terminal return Base_Token is begin Terminals_Current := Terminals_Current + 1; loop exit when not Prev_Deleted.Contains (Terminals_Current); Terminals_Current := Terminals_Current + 1; end loop; Restore_Terminals_Current := Terminals_Current; return Terminals (Terminals_Current); end Next_Terminal; begin loop if Last_Index (Insert_Delete) > 0 and then Current_Insert_Delete = Last_Index (Insert_Delete) then Current_Insert_Delete := No_Insert_Delete; Clear (Insert_Delete); return Next_Terminal; elsif Current_Insert_Delete = No_Insert_Delete then return Next_Terminal; elsif Token_Index (Constant_Ref (Insert_Delete, Current_Insert_Delete + 1)) = Terminals_Current + 1 then Current_Insert_Delete := Current_Insert_Delete + 1; declare Op : Insert_Delete_Op renames Constant_Ref (Insert_Delete, Current_Insert_Delete); begin case Insert_Delete_Op_Label'(Op.Op) is when Insert => return (ID => Op.Ins_ID, others => <>); when Delete => Terminals_Current := Terminals_Current + 1; Restore_Terminals_Current := Terminals_Current; end case; end; else return Next_Terminal; end if; end loop; end Next_Token; procedure Push_Back (Config : in out Configuration) is use Config_Op_Arrays, Config_Op_Array_Refs; use Sorted_Insert_Delete_Arrays; Item : constant Recover_Stack_Item := Config.Stack.Pop; Token_Index : constant Base_Token_Index := Item.Token.Min_Terminal_Index; function Compare (Left : in Base_Token_Index; Right : in Config_Op) return Boolean is (case Right.Op is when Fast_Forward => False, when Undo_Reduce => False, when Push_Back => False, when Insert => Left < Right.Ins_Token_Index, when Delete => Left < Right.Del_Token_Index); -- If Left = Right.Token_Index, we assume the Right ops go _after_ -- the Left, so the Left do not need to be repeated. begin if Token_Index /= Invalid_Token_Index then Config.Current_Shared_Token := Token_Index; for I in First_Index (Config.Ops) .. Last_Index (Config.Ops) loop if Compare (Token_Index, Constant_Ref (Config.Ops, I)) then if Is_Full (Config.Insert_Delete) then raise Bad_Config; end if; Insert (Config.Insert_Delete, Constant_Ref (Config.Ops, I), Ignore_If_Equal => True); end if; end loop; end if; if Is_Full (Config.Ops) then raise Bad_Config; end if; Append (Config.Ops, (Push_Back, Item.Token.ID, Config.Current_Shared_Token)); end Push_Back; procedure Push_Back_Check (Config : in out Configuration; Expected_ID : in Token_ID) is begin pragma Assert (Config.Stack.Depth > 1); Check (Config.Stack.Peek (1).Token.ID, Expected_ID); Push_Back (Config); end Push_Back_Check; procedure Push_Back_Check (Config : in out Configuration; Expected : in Token_ID_Array) is begin for ID of Expected loop Push_Back_Check (Config, ID); end loop; end Push_Back_Check; procedure Put (Message : in String; Trace : in out WisiToken.Trace'Class; Parser_Label : in Natural; Terminals : in Base_Token_Arrays.Vector; Config : in Configuration; Task_ID : in Boolean := True; Strategy : in Boolean := False) is -- For debugging output -- Build a string, call trace.put_line once, so output from multiple -- tasks is not interleaved (mostly). use Insert_Delete_Array_Refs; use all type Ada.Strings.Unbounded.Unbounded_String; use all type WisiToken.Semantic_Checks.Check_Status_Label; Descriptor : WisiToken.Descriptor renames Trace.Descriptor.all; Result : Ada.Strings.Unbounded.Unbounded_String := (if Task_ID then +"task" & Task_Attributes.Value'Image else +"") & Integer'Image (Parser_Label) & ": " & (if Message'Length > 0 then Message & ":" else ""); begin Result := Result & Natural'Image (Config.Cost); if Strategy or Trace_McKenzie > Extra then Result := Result & ", ("; for C of Config.Strategy_Counts loop Result := Result & Integer'Image (C); end loop; Result := Result & "), "; else Result := Result & ", "; end if; if Config.Check_Status.Label /= Ok then Result := Result & Semantic_Checks.Check_Status_Label'Image (Config.Check_Status.Label) & " "; elsif Config.Error_Token.ID /= Invalid_Token_ID then Result := Result & "Error " & Image (Config.Error_Token, Descriptor) & " "; end if; Result := Result & Image (Config.Stack, Descriptor, Depth => 1); if Config.Current_Insert_Delete = No_Insert_Delete then Result := Result & "|" & Image (Config.Current_Shared_Token, Terminals, Descriptor) & "|"; else Result := Result & "/" & Trimmed_Image (Config.Current_Insert_Delete) & ":" & Image (Constant_Ref (Config.Insert_Delete, Config.Current_Insert_Delete), Descriptor) & "/"; end if; Result := Result & Image (Config.Ops, Descriptor); if Config.Minimal_Complete_State /= None then Result := Result & " minimal_complete " & Config.Minimal_Complete_State'Image; end if; Trace.Put_Line (-Result); end Put; procedure Put_Line (Trace : in out WisiToken.Trace'Class; Parser_Label : in Natural; Message : in String; Task_ID : in Boolean := True) is begin Trace.Put_Line ((if Task_ID then "task" & Task_Attributes.Value'Image else "") & Integer'Image (Parser_Label) & ": " & Message); end Put_Line; function Undo_Reduce (Stack : in out Recover_Stacks.Stack; Tree : in Syntax_Trees.Tree) return Ada.Containers.Count_Type is Nonterm_Item : constant Recover_Stack_Item := Recover_Stacks.Pop (Stack); begin if Nonterm_Item.Token.Byte_Region = Null_Buffer_Region then return 0; end if; declare Children : constant Syntax_Trees.Valid_Node_Index_Array := Tree.Children (Nonterm_Item.Tree_Index); begin for C of Children loop Stack.Push ((Tree.State (C), C, Tree.Recover_Token (C))); end loop; return Children'Length; end; end Undo_Reduce; procedure Undo_Reduce_Check (Config : in out Configuration; Tree : in Syntax_Trees.Tree; Expected : in Token_ID) is begin pragma Assert (Config.Stack.Depth > 1); Check (Config.Stack.Peek (1).Token.ID, Expected); Config_Op_Arrays.Append (Config.Ops, (Undo_Reduce, Expected, Undo_Reduce (Config.Stack, Tree))); exception when SAL.Container_Full => raise Bad_Config; end Undo_Reduce_Check; procedure Undo_Reduce_Check (Config : in out Configuration; Tree : in Syntax_Trees.Tree; Expected : in Token_ID_Array) is begin for ID of Expected loop Undo_Reduce_Check (Config, Tree, ID); end loop; end Undo_Reduce_Check; end WisiToken.Parse.LR.McKenzie_Recover;

42.212519

120

0.562437

20e1b341faf85e7ea4f2e50acb998b4a86509983

3,412

adb

Ada

runtime/ravenscar-sfp-stm32f427/common/s-imgllu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

12

2017-06-08T14:19:57.000Z

2022-03-09T02:48:59.000Z

runtime/ravenscar-sfp-stm32f427/common/s-imgllu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

6

2017-06-08T13:13:50.000Z

2020-05-15T09:32:43.000Z

runtime/ravenscar-sfp-stm32f427/common/s-imgllu.adb

TUM-EI-RCS/StratoX

5fdd04e01a25efef6052376f43ce85b5bc973392

[ "BSD-3-Clause" ]

3

2017-06-30T14:05:06.000Z

2022-02-17T12:20:45.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ L L U -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-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. -- -- -- -- -- -- -- -- -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with System.Unsigned_Types; use System.Unsigned_Types; package body System.Img_LLU is ------------------------------ -- Image_Long_Long_Unsigned -- ------------------------------ procedure Image_Long_Long_Unsigned (V : System.Unsigned_Types.Long_Long_Unsigned; S : in out String; P : out Natural) is pragma Assert (S'First = 1); begin S (1) := ' '; P := 1; Set_Image_Long_Long_Unsigned (V, S, P); end Image_Long_Long_Unsigned; ---------------------------------- -- Set_Image_Long_Long_Unsigned -- ---------------------------------- procedure Set_Image_Long_Long_Unsigned (V : Long_Long_Unsigned; S : in out String; P : in out Natural) is begin if V >= 10 then Set_Image_Long_Long_Unsigned (V / 10, S, P); P := P + 1; S (P) := Character'Val (48 + (V rem 10)); else P := P + 1; S (P) := Character'Val (48 + V); end if; end Set_Image_Long_Long_Unsigned; end System.Img_LLU;

46.108108

78

0.362544

c58a9d4fc4e02d205aeee0d6c61b2ab92cb28c7f

9,788

adb

Ada

.emacs.d/elpa/wisi-2.1.1/sal-gen_unbounded_definite_min_heaps_fibonacci.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.1.1/sal-gen_unbounded_definite_min_heaps_fibonacci.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

.emacs.d/elpa/wisi-2.1.1/sal-gen_unbounded_definite_min_heaps_fibonacci.adb

caqg/linux-home

eed631aae6f5e59e4f46e14f1dff443abca5fa28

[ "Linux-OpenIB" ]

null

-- Abstract: -- -- See spec. -- -- Copyright (C) 2017 - 2019 Free Software Foundation, Inc. -- -- This library 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 library is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- -- TABILITY 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. pragma License (Modified_GPL); with Ada.Unchecked_Deallocation; with Long_Float_Elementary_Functions; package body SAL.Gen_Unbounded_Definite_Min_Heaps_Fibonacci is ---------- -- local subprogram specs (as needed), alphabetical order procedure Insert_Into_Root_List (Heap : in out Heap_Type; X : in Node_Access); procedure Link (Y, X : in Node_Access); procedure Remove_From_List (X : in Node_Access); procedure Swap (A, B : in out Node_Access); ---------- -- local subprogram bodies, alphabetical order function Add (Heap : in out Heap_Type; Item : in Element_Type) return Node_Access is X : constant Node_Access := new Node'(Item, null, null, null, null, 0, False); begin -- [1] 19.2 FIB-HEAP-INSERT if Heap.Min = null then Heap.Min := X; Heap.Min.Left := Heap.Min; Heap.Min.Right := Heap.Min; else Insert_Into_Root_List (Heap, X); if Key (Item) < Key (Heap.Min.Element) then Heap.Min := X; end if; end if; Heap.Count := Heap.Count + 1; return X; end Add; procedure Consolidate (Heap : in out Heap_Type) is -- [1] 19.4 max degree of Fibonacci heap Phi : constant := 1.61803398874989484820458683436563811772; -- https://oeis.org/A001622/constant Max_Degree : constant Integer := Integer (Long_Float_Elementary_Functions.Log (Long_Float (Heap.Count), Base => Phi)); -- [1] 19.2 CONSOLIDATE A : array (0 .. Max_Degree) of Node_Access := (others => null); W : Node_Access := Heap.Min; Last : Node_Access := Heap.Min; X, Y : Node_Access; D : Integer; Min_Key : Key_Type; begin loop X := W; W := W.Right; D := X.Degree; loop exit when A (D) = null; Y := A (D); if Key (Y.Element) < Key (X.Element) then Swap (X, Y); end if; if Y = Last and W /= Last then Last := Y.Right; end if; Link (Y, X); A (D) := null; D := D + 1; exit when D = A'Last; end loop; A (D) := X; exit when W = Last; end loop; Heap.Min := null; for I in A'Range loop if A (I) /= null then if Heap.Min = null then Heap.Min := A (I); Heap.Min.Left := Heap.Min; Heap.Min.Right := Heap.Min; Min_Key := Key (Heap.Min.Element); else Insert_Into_Root_List (Heap, A (I)); if Key (A (I).Element) < Min_Key then Heap.Min := A (I); Min_Key := Key (A (I).Element); end if; end if; end if; end loop; end Consolidate; procedure Copy_Node (Old_Obj : in Node_Access; New_Obj : in out Heap_Type) is Child : Node_Access; begin if Old_Obj = null then return; end if; if Old_Obj.Child /= null then Child := Old_Obj.Child; loop Add (New_Obj, Child.Element); Child := Child.Right; exit when Child = Old_Obj.Child; end loop; end if; Add (New_Obj, Old_Obj.Element); end Copy_Node; procedure Free is new Ada.Unchecked_Deallocation (Node, Node_Access); procedure Free_Node (Item : in out Node_Access) is Child : Node_Access; Temp : Node_Access; begin if Item = null then return; end if; -- Parent has already been free'd -- Siblings are freed by caller -- Free children if Item.Child /= null then Child := Item.Child; loop Temp := Child; Child := Child.Right; Free_Node (Temp); exit when Child = Item.Child; end loop; end if; Free (Item); end Free_Node; procedure Insert_Into_Root_List (Heap : in out Heap_Type; X : in Node_Access) is begin -- match [1] fig 19.3 X.Right := Heap.Min; X.Left := Heap.Min.Left; Heap.Min.Left.Right := X; Heap.Min.Left := X; end Insert_Into_Root_List; procedure Link (Y, X : in Node_Access) is begin -- [1] 19.2 FIB-HEAP-LINK Remove_From_List (Y); Y.Parent := X; X.Degree := X.Degree + 1; if X.Child = null then X.Child := Y; Y.Right := Y; Y.Left := Y; else -- Insert Y into X child list Y.Right := X.Child; Y.Left := X.Child.Left; X.Child.Left.Right := Y; X.Child.Left := Y; end if; Y.Mark := False; end Link; procedure Remove_From_List (X : in Node_Access) is begin X.Left.Right := X.Right; X.Right.Left := X.Left; end Remove_From_List; procedure Swap (A, B : in out Node_Access) is C : constant Node_Access := A; begin A := B; B := C; end Swap; ---------- -- Visible operations overriding procedure Initialize (Object : in out Heap_Type) is begin -- Min is null by default. Object.Count := 0; end Initialize; overriding procedure Finalize (Object : in out Heap_Type) is Next : Node_Access := Object.Min; Temp : Node_Access; begin if Next = null then return; end if; loop Temp := Next; Next := Next.Right; Free_Node (Temp); exit when Next = Object.Min; end loop; Object.Min := null; Object.Count := 0; end Finalize; overriding procedure Adjust (Object : in out Heap_Type) is Old_Obj : Node_Access := Object.Min; Last : constant Node_Access := Old_Obj; begin if Old_Obj = null then return; end if; Object.Min := null; Object.Count := 0; loop Copy_Node (Old_Obj, Object); Old_Obj := Old_Obj.Right; exit when Old_Obj = Last; end loop; end Adjust; procedure Clear (Heap : in out Heap_Type) is begin Finalize (Heap); end Clear; function Count (Heap : in Heap_Type) return Base_Peek_Type is begin return Heap.Count; end Count; function Remove (Heap : in out Heap_Type) return Element_Type is Z : Node_Access := Heap.Min; Child, Temp : Node_Access; begin if Heap.Count = 0 then raise Container_Empty; end if; -- [1] 19.2 FIB-HEAP-EXTRACT-MIN Child := Z.Child; for I in 1 .. Z.Degree loop Temp := Child; Child := Child.Right; Temp.Parent := null; Insert_Into_Root_List (Heap, Temp); end loop; Remove_From_List (Z); if Z.Right = Z then Heap.Min := null; else Heap.Min := Z.Right; Consolidate (Heap); end if; Heap.Count := Heap.Count - 1; return Result : constant Element_Type := Z.Element do Free (Z); end return; end Remove; function Min_Key (Heap : in out Heap_Type) return Key_Type is begin return Key (Heap.Min.Element); end Min_Key; procedure Drop (Heap : in out Heap_Type) is Junk : Element_Type := Remove (Heap); pragma Unreferenced (Junk); begin null; end Drop; procedure Add (Heap : in out Heap_Type; Item : in Element_Type) is X : constant Node_Access := Add (Heap, Item); pragma Unreferenced (X); begin null; end Add; function Add (Heap : in out Heap_Type; Item : in Element_Type) return Element_Access is X : constant Node_Access := Add (Heap, Item); begin return X.all.Element'Access; end Add; function Peek (Heap : in Heap_Type) return Constant_Reference_Type is begin return (Element => Heap.Min.all.Element'Access); end Peek; procedure Process (Heap : in Heap_Type; Process_Element : access procedure (Element : in Element_Type)) is type Cursor is record -- Every node is in a circular list. List_Origin is the node where we -- entered the list, so we know when we are done. Node : Node_Access; List_Origin : Node_Access; end record; Cur : Cursor := (Heap.Min, Heap.Min); procedure Process_Node (Cur : in out Cursor) is Next_Cur : Cursor; begin loop if Cur.Node.Child /= null then Next_Cur := (Cur.Node.Child, Cur.Node.Child); Process_Node (Next_Cur); end if; Process_Element (Cur.Node.Element); Cur.Node := Cur.Node.Right; exit when Cur.Node = Cur.List_Origin; end loop; end Process_Node; begin if Cur.Node /= null then Process_Node (Cur); end if; end Process; end SAL.Gen_Unbounded_Definite_Min_Heaps_Fibonacci;

26.311828

106

0.560584

0e42b76f38f84bd436afe9a9dabf44c3e5bcb31b

3,663

ads

Ada

src/dsp-generic_functions.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

src/dsp-generic_functions.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

src/dsp-generic_functions.ads

fintatarta/generic-dsp

cc948cc5c146d2e19b1d0194d21d1e8b7806d735

[ "MIT" ]

null

with Ada.Numerics.Generic_Complex_Types; with Dsp.Ring_Filters; -- -- This package provides several (OK, only filters so far...) DSP functions -- It needs to be instantiated with a floating point type and a corresponding -- complex type. -- generic type Scalar_Type is digits <>; with package Complex_Types is new Ada.Numerics.Generic_Complex_Types (Scalar_Type); package DSP.Generic_Functions is subtype Complex_Type is Complex_Types.Complex; use type Complex_Types.Complex; package Real_Filters is new Dsp.Ring_Filters (Sample_Type => Scalar_Type, Coefficient_Type => Scalar_Type, One => 1.0, Zero => 0.0, Zero_Coeff => 0.0); function Delta_Signal (K : Integer) return Scalar_Type renames Real_Filters.Delta_Signal; subtype Real_FIR is Real_Filters.Ring_FIR; subtype Real_IIR is Real_Filters.Ring_IIR; subtype Real_Filter_Interface is Real_Filters.Ring_Filter_Interface; subtype Real_IIR_Spec is Real_Filters.Ring_IIR_Spec; subtype Scalar_Array is Real_Filters.Sample_Array; package Complex_Filters is new Dsp.Ring_Filters (Sample_Type => Complex_Type, Coefficient_Type => Complex_Type, One => (1.0, 0.0), Zero => (0.0, 0.0), Zero_Coeff => (0.0, 0.0)); function Delta_Signal (K : Integer) return Complex_Type renames Complex_Filters.Delta_Signal; subtype Complex_Filter_Interface is Complex_Filters.Ring_Filter_Interface; subtype Complex_FIR is Complex_Filters.Ring_FIR; subtype Complex_IIR is Complex_Filters.Ring_IIR; subtype Complex_IIR_Spec is Complex_Filters.Ring_IIR_Spec; type Notch_Type is (Passband, Stopband); function Notch_Specs (Freq : Normalized_Frequency; Pole_Radius : Stable_Radius; Class : Notch_Type := Stopband) return Complex_IIR_Spec; -- -- Return the specs of a notch filter tuned at the frequency Freq -- (normalized to sampling frequency, that is, Freq=0.5 -- is the Nyquist frequency). Pole_Radius is the -- radius of compensating poles. Depending on the value of Class -- the filter will be a stopband (that is, it removes frequency -- Freq) or a passband (that is, it leaves unchanged the component -- at frequency Freq, while attenuating the others). -- function Notch_Specs (Freq : Normalized_Frequency; Pole_Radius : Stable_Radius; Class : Notch_Type := Stopband) return Real_IIR_Spec; -- -- Return the specs of a notch filter tuned at the frequency Freq -- (normalized to sampling frequency, that is, Freq=0.5 -- is the Nyquist frequency). Pole_Radius is the -- radius of compensating poles. Depending on the value of Class -- the filter will be a stopband (that is, it removes frequency -- Freq) or a passband (that is, it leaves unchanged the component -- at frequency Freq, while attenuating the others). -- function Complexify (X : Real_Filters.Coefficient_Array) return Complex_Filters.Coefficient_Array with Post => X'First = Complexify'Result'First and X'Last = Complexify'Result'Last; -- Create a complex vector from a real one. Quite handy in many -- cases. end DSP.Generic_Functions;

37.377551

77

0.63418

20e87aaf1b2deed8b3e2012f67e0c77ddcf6469d

135

ada

Ada

Task/Terminal-control-Ringing-the-terminal-bell/Ada/terminal-control-ringing-the-terminal-bell.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:38.000Z

Task/Terminal-control-Ringing-the-terminal-bell/Ada/terminal-control-ringing-the-terminal-bell.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

null

Task/Terminal-control-Ringing-the-terminal-bell/Ada/terminal-control-ringing-the-terminal-bell.ada

mullikine/RosettaCodeData

4f0027c6ce83daa36118ee8b67915a13cd23ab67

[ "Info-ZIP" ]

1

2018-11-09T22:08:40.000Z

with Ada.Text_IO; use Ada.Text_IO; with Ada.Characters.Latin_1; procedure Bell is begin Put(Ada.Characters.Latin_1.BEL); end Bell;

16.875

35

0.77037

c5c76ab12381c0a1b50559c4a345bcf95195defa

6,016

adb

Ada

source/errors.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/errors.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

source/errors.adb

jquorning/CELLE

0584a22bd48464c2727751fca9dbca079e217b0c

[ "blessing" ]

null

-- -- The author disclaims copyright to this source code. In place of -- a legal notice, here is a blessing: -- -- May you do good and not evil. -- May you find forgiveness for yourself and forgive others. -- May you share freely, not taking more than you give. -- with Ada.Strings.Fixed; package body Errors is type String_Access is access all String; function "-" (Item : in String) return String_Access; function "-" (Item : in String) return String_Access is begin return new String'(Item); end "-"; type Error_Table is array (Error_Id) of String_Access; Table : constant Error_Table := Error_Table'(E001 => -("There is no prior rule upon which to attach the code fragment " & "which begins on this line."), E002 => -("Code fragment beginning on this line is not the first to follow " & "the previous rule."), E003 => -"Token '$1' should be either '%%' or a nonterminal name.", E004 => -"The precedence symbol must be a terminal.", E005 => -"There is no prior rule to assign precedence '[$1]'.", E006 => -("Precedence mark on this line is not the first to follow the " & "previous rule."), E007 => -"Missing ']' on precedence mark.", E008 => -"Expected to see a ':' following the LHS symbol '$1'.", E009 => -"'$1' is not a valid alias for the LHS '$2'", E010 => -"Missing ')' following LHS alias name '$1'.", E011 => -"Missing '->' following: '$1($2)'.", E012 => -"'$1' is not a valid alias for the RHS symbol '$2'", E013 => -"Missing ')' following LHS alias name '$1'.", E014 => -("The specified start symbol '$1' Start is not in a nonterminal " & "of the grammar. '$2' will be used as the start symbol instead."), E015 => -("The start symbol '$1' occurs on the right-hand " & "side of a rule. This will result in a parser which " & "does not work properly."), E016 => -"Can not open '$1' for reading.", E101 => -"Can't open this file for reading.", E102 => -("C code starting on this line is not terminated before the end " & "of the file."), E103 => -("String starting on this line is not terminated before the end " & "of the file."), E201 => -"Cannot form a compound containing a non-terminal", E202 => -"Illegal character on RHS of rule: '$1'.", E203 => -"Unknown declaration keyword: '%$1'.", E204 => -"Illegal declaration keyword: '$1'.", E205 => -"Symbol name missing after %destructor keyword", E206 => -"Symbol name missing after %type keyword", E207 => -"Symbol %type '$1' already defined", E208 => -"%token_class argument '%1' should be a token", E209 => -"%token_class must be followed by an identifier: $1", E210 => -"Symbol '$1' already used", E211 => -"%wildcard argument '$1' should be a token", E212 => -"Extra wildcard to token: '$1'", E213 => -"Illegal argument to %$1: $2", E214 => -"%token argument $1 should be a token", E215 => -"%fallback argument $1 should be a token", E216 => -"More than one fallback assigned to token $1", E217 => -"Symbol $1 has already be given a precedence.", E218 => -"Can't assign a precedence to $1.", E301 => -"This rule can not be reduced.", E401 => -"Nonterminal ""$1"" has no rules." ); procedure Parser_Error (Id : in Error_Id; Line : in Line_Number; Argument_1 : in String := ""; Argument_2 : in String := "") is -- use Ada.Strings; File_Name : constant String := To_String (Default_File_Name); Kind_Image : constant String := Id'Image & " "; Message : Unbounded_String := To_Unbounded_String (Table (Id).all); Position : Natural := 1; begin -- Substitued $1 placeholder Position := Index (Message, "$1", Position); if Position /= 0 then Replace_Slice (Message, Position, Position + 2 - 1, Argument_1); end if; -- Substitute $2 placeholder Position := Index (Message, "$2", Position); if Position /= 0 then Replace_Slice (Message, Position, Position + 2 - 1, Argument_2); end if; Emit_Error (File => Ada.Text_IO.Standard_Output, File_Name => File_Name, Line => Line, Message => Kind_Image & To_String (Message)); Error_Count := Error_Count + 1; end Parser_Error; procedure Set_File_Name (File_Name : in Ada.Strings.Unbounded.Unbounded_String) is begin Errors.Default_File_Name := File_Name; end Set_File_Name; procedure Emit_Error (File : in Ada.Text_IO.File_Type; File_Name : in String; Line : in Line_Number; Message : in String) is use Ada.Text_IO; use Ada.Strings; Line_Number_Image : constant String := Fixed.Trim (Line_Number'Image (Line), Left); begin Put (File, File_Name); Put (File, ":"); Put (File, Line_Number_Image); Put (File, ": "); Put (File, Message); New_Line (File); end Emit_Error; end Errors;

41.777778

97

0.512301

d093c28226fe46be2cadb42c16d5072f11beddd1

450

ads

Ada

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/iface_test.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/iface_test.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/iface_test.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

package Iface_Test is type Iface_1 is interface; type Iface_2 is interface; procedure Prepare_Select (DB : Iface_1; Iter : in out Iface_2'Class) is abstract; type DT_1 is new Iface_1 with null record; type Iterator is new Iface_2 with record More : Boolean; end record; overriding procedure Prepare_Select (DB : DT_1; Iter : in out Standard.Iface_Test.Iface_2'Class); end;

23.684211

55

0.655556

4a29fe203aaefd9d4fd159300e55a0dceb8898f5

3,820

ads

Ada

arch/ARM/STM32/drivers/stm32-rng-polling.ads

shakram02/Ada_Drivers_Library

a407ca7ddbc2d9756647016c2f8fd8ef24a239ff

[ "BSD-3-Clause" ]

192

2016-06-01T18:32:04.000Z

2022-03-26T22:52:31.000Z

arch/ARM/STM32/drivers/stm32-rng-polling.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

239

2016-05-26T20:02:01.000Z

2022-03-31T09:46:56.000Z

arch/ARM/STM32/drivers/stm32-rng-polling.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

142

2016-06-05T08:12:20.000Z

2022-03-24T17:37:17.000Z

------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015, 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 stm32f4xx_hal_rng.h -- -- @author MCD Application Team -- -- @version V1.1.0 -- -- @date 19-June-2014 -- -- @brief Header file of RNG HAL module. -- -- -- -- COPYRIGHT(c) 2014 STMicroelectronics -- ------------------------------------------------------------------------------ -- This file provides the API for the random number generator on the STM32F4 -- (ARM Cortex M4F) microcontrollers from ST Microelectronics. -- -- Random numbers are acquired by polling the on-board generator. package STM32.RNG.Polling is procedure Initialize_RNG with Post => not RNG_Interrupt_Enabled; -- Must be called once, prior to any call to get a random number via -- polling. Both necessary and sufficient. -- Enables the clock as well. function Random return UInt32; -- Polls the RNG directly to get the next available number. -- NB: call Initialize_RNG before any calls to this function. end STM32.RNG.Polling;

63.666667

78

0.477749

d0570a45d3eb098b9ef7193067fe6183060636c0

476

ads

Ada

include/bits_types_u_sigset_t_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

5

2021-11-03T04:34:16.000Z

2021-11-10T23:06:30.000Z

include/bits_types_u_sigset_t_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

null

include/bits_types_u_sigset_t_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

null

pragma Ada_2012; pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; package bits_types_u_sigset_t_h is -- skipped anonymous struct anon_1 type uu_sigset_t_array937 is array (0 .. 15) of aliased unsigned_long; type uu_sigset_t is record uu_val : aliased uu_sigset_t_array937; -- /usr/include/bits/types/__sigset_t.h:7 end record with Convention => C_Pass_By_Copy; -- /usr/include/bits/types/__sigset_t.h:8 end bits_types_u_sigset_t_h;

28

87

0.758403

2318ca8fb2a44c369bddd9823b202d8c19a3983a

2,239

ads

Ada

src/evb1000-led.ads

damaki/EVB1000

1589a3f3bd79d7c9970f3b0758e133e3ec1ee6e2

[ "MIT" ]

null

src/evb1000-led.ads

damaki/EVB1000

1589a3f3bd79d7c9970f3b0758e133e3ec1ee6e2

[ "MIT" ]

null

src/evb1000-led.ads

damaki/EVB1000

1589a3f3bd79d7c9970f3b0758e133e3ec1ee6e2

[ "MIT" ]

1

2021-02-10T14:33:06.000Z

------------------------------------------------------------------------------- -- Copyright (c) 2016 Daniel King -- -- 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. ------------------------------------------------------------------------------- -- Provides an API for controlling the four LEDs on the EVB1000 that are -- available to the host processor (STM32F105). -- -- The LEDs are numbered 1 .. 4 in this API, with LED 1 being the leftmost LED -- and LED 4 being the rightmost LED. -- -- LEDs 1 and 2 are yellow, and LEDs 3 and 4 are red in color. package EVB1000.LED with SPARK_Mode => On, Abstract_State => (LEDs_State with External), Initializes => LEDs_State is type LED_Number is range 1 .. 4; type LED_Array is array (LED_Number) of Boolean; procedure Set_LED(LED : in LED_Number; On : in Boolean) with Global => (In_Out => LEDs_State), Depends => (LEDs_State => + (LED, On)); procedure Set_LEDs(LEDs : in LED_Array) with Global => (Output => LEDs_State), Depends => (LEDs_State => LEDs); procedure Toggle_LED (LED : in LED_Number) with Global => (In_Out => LEDs_State), Depends => (LEDs_State => + LED); end EVB1000.LED;

41.462963

79

0.663243

0eddcc43ea638a23596135a3ec3a36154f26b6ca

3,560

ads

Ada

source/web/tools/a2js/webapi/webgl/webapi-webgl-shaders.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/web/tools/a2js/webapi/webgl/webapi-webgl-shaders.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/web/tools/a2js/webapi/webgl/webapi-webgl-shaders.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Web Framework -- -- -- -- Web API Definition -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2016, Vadim Godunko <[email protected]> -- -- 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 WebAPI.WebGL.Shaders is pragma Preelaborate; type WebGL_Shader is limited interface; type WebGL_Shader_Access is access all WebGL_Shader'Class with Storage_Size => 0; end WebAPI.WebGL.Shaders;

64.727273

78

0.406742

23d8a4641871167619fb7ee5bed5716ebbef04eb

1,761

ads

Ada

src/hide-bmp.ads

persan/midnightsun-ctf-LoveLacedLetter

456f782b5cd2205425aa23705ca8e8598e3104fc

[ "BSD-2-Clause" ]

null

src/hide-bmp.ads

persan/midnightsun-ctf-LoveLacedLetter

456f782b5cd2205425aa23705ca8e8598e3104fc

[ "BSD-2-Clause" ]

null

src/hide-bmp.ads

persan/midnightsun-ctf-LoveLacedLetter

456f782b5cd2205425aa23705ca8e8598e3104fc

[ "BSD-2-Clause" ]

null

package Hide.BMP is type Header is record Signature_1 : Integer_8; Signature_2 : Integer_8; Size : Integer_32; -- File size in bytes Reserved1 : Integer_16; Reserved2 : Integer_16; Offset : Integer_32; -- Start address in bytes where the image data can be found. end record with Pack => True; type Info is record Header : BMP.Header; Struct_Size : Integer_32; Width : Integer_32; -- Image width in pixels Height : Integer_32; -- Image hieght in pixels Planes : Integer_16; Pixel_Size : Integer_16; -- Bits per pixel Compression : Integer_32; -- Zero means no compression Image_Size : Integer_32; -- Size of the image data in bytes PPMX : Integer_32; -- Pixels per meter in x led PPMY : Integer_32; -- Pixels per meter in y led Palette_Size : Integer_32; -- Number of colors Important : Integer_32; end record with Pack => True; function Image ( Item : Info ) return String ; type Pixel_G8 is new Integer_8; -- 8 bit pixel grayscale type Image_G8 is array (Integer range <>) of Pixel_G8; type Byte_As_Bit_Array is array (1 .. 8) of Boolean with Pack => True; type Chanels is (Alpha, Red, Gren, Blue); type Pixel_ARGB32 is array (Chanels) of Byte_As_Bit_Array with Pack => True; type Image_ARGB32 is array (Integer range <>) of Pixel_ARGB32; procedure Encode (Image_Info : Info; Image : in out Image_ARGB32; Offset : Natural; Text : in String); function Decode (Image_Info : Info; Image : in Image_ARGB32) return String; end Hide.BMP;

32.611111

79

0.611584

1824c1d2c50e7e51b2cab510e8eba490805e9eca

1,857

ads

Ada

gcc-gcc-7_3_0-release/gcc/ada/a-tiboio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

7

2020-05-02T17:34:05.000Z

2021-10-17T10:15:18.000Z

gcc-gcc-7_3_0-release/gcc/ada/a-tiboio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

null

gcc-gcc-7_3_0-release/gcc/ada/a-tiboio.ads

best08618/asylo

5a520a9f5c461ede0f32acc284017b737a43898c

[ "Apache-2.0" ]

2

2020-07-27T00:22:36.000Z

2021-04-01T09:41:02.000Z

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . B O U N D E D _ I O -- -- -- -- 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 Ada.Strings.Bounded; generic with package Bounded is new Ada.Strings.Bounded.Generic_Bounded_Length (<>); package Ada.Text_IO.Bounded_IO is function Get_Line return Bounded.Bounded_String; function Get_Line (File : File_Type) return Bounded.Bounded_String; procedure Get_Line (Item : out Bounded.Bounded_String); procedure Get_Line (File : File_Type; Item : out Bounded.Bounded_String); procedure Put (Item : Bounded.Bounded_String); procedure Put (File : File_Type; Item : Bounded.Bounded_String); procedure Put_Line (Item : Bounded.Bounded_String); procedure Put_Line (File : File_Type; Item : Bounded.Bounded_String); end Ada.Text_IO.Bounded_IO;

36.411765

78

0.436726

df1be9bb7b2be67b1d3b54030e895d0121f6f9c6

1,382

ads

Ada

include/bits_stdint_uintn_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

5

2021-11-03T04:34:16.000Z

2021-11-10T23:06:30.000Z

include/bits_stdint_uintn_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

null

include/bits_stdint_uintn_h.ads

docandrew/troodon

9240611708f92ffb5491fa677bffb6ecac58a51e

[ "MIT" ]

null

pragma Ada_2012; pragma Style_Checks (Off); with Interfaces.C; use Interfaces.C; with bits_types_h; package bits_stdint_uintn_h is -- Define uintN_t types. -- Copyright (C) 2017-2021 Free Software Foundation, Inc. -- This file is part of the GNU C Library. -- The GNU C Library is free software; you can redistribute it and/or -- modify it under the terms of the GNU Lesser General Public -- License as published by the Free Software Foundation; either -- version 2.1 of the License, or (at your option) any later version. -- The GNU C 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 -- Lesser General Public License for more details. -- You should have received a copy of the GNU Lesser General Public -- License along with the GNU C Library; if not, see -- <https://www.gnu.org/licenses/>. subtype uint8_t is bits_types_h.uu_uint8_t; -- /usr/include/bits/stdint-uintn.h:24 subtype uint16_t is bits_types_h.uu_uint16_t; -- /usr/include/bits/stdint-uintn.h:25 subtype uint32_t is bits_types_h.uu_uint32_t; -- /usr/include/bits/stdint-uintn.h:26 subtype uint64_t is bits_types_h.uu_uint64_t; -- /usr/include/bits/stdint-uintn.h:27 end bits_stdint_uintn_h;

41.878788

88

0.727931

0e0382c3ff49239f82c92eed7da362413a51646a

4,682

ads

Ada

source/amf/mof/cmof/amf-cmof-comments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/cmof/amf-cmof-comments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/cmof/amf-cmof-comments.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011, Vadim Godunko <[email protected]> -- -- 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. ------------------------------------------------------------------------------ -- A comment is a textual annotation that can be attached to a set of -- elements. ------------------------------------------------------------------------------ with AMF.CMOF.Elements; limited with AMF.CMOF.Elements.Collections; package AMF.CMOF.Comments is pragma Preelaborate; type CMOF_Comment is limited interface and AMF.CMOF.Elements.CMOF_Element; type CMOF_Comment_Access is access all CMOF_Comment'Class; for CMOF_Comment_Access'Storage_Size use 0; not overriding function Get_Body (Self : not null access constant CMOF_Comment) return AMF.Optional_String is abstract; -- Getter of Comment::body. -- -- Specifies a string that is the comment. not overriding procedure Set_Body (Self : not null access CMOF_Comment; To : AMF.Optional_String) is abstract; -- Setter of Comment::body. -- -- Specifies a string that is the comment. not overriding function Get_Annotated_Element (Self : not null access constant CMOF_Comment) return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element is abstract; -- Getter of Comment::annotatedElement. -- -- References the Element(s) being commented. end AMF.CMOF.Comments;

55.082353

78

0.459419

dcd747e3b01edd898359dbc5d00cbde6e3ced98a

2,738

ads

Ada

include/sf-system-mutex.ads

danva994/ASFML-1.6

bd74ae700843338a15aef295f99297b866aa0c93

[ "Zlib" ]

1

2017-10-07T06:20:38.000Z

include/sf-system-mutex.ads

danva994/ASFML-1.6

bd74ae700843338a15aef295f99297b866aa0c93

[ "Zlib" ]

3

2020-09-15T21:19:34.000Z

2022-03-02T23:13:46.000Z

include/sf-system-mutex.ads

danva994/ASFML-1.6

bd74ae700843338a15aef295f99297b866aa0c93

[ "Zlib" ]

2

2020-09-26T21:16:43.000Z

2022-01-16T19:36:48.000Z

-- //////////////////////////////////////////////////////////// -- // -- // SFML - Simple and Fast Multimedia Library -- // Copyright (C) 2007-2009 Laurent Gomila ([email protected]) -- // -- // This software is provided 'as-is', without any express or implied warranty. -- // In no event will the authors be held liable for any damages arising from the use of this software. -- // -- // Permission is granted to anyone to use this software for any purpose, -- // including commercial applications, and to alter it and redistribute it freely, -- // subject to the following restrictions: -- // -- // 1. The origin of this software must not be misrepresented; -- // you must not claim that you wrote the original software. -- // If you use this software in a product, an acknowledgment -- // in the product documentation would be appreciated but is not required. -- // -- // 2. Altered source versions must be plainly marked as such, -- // and must not be misrepresented as being the original software. -- // -- // 3. This notice may not be removed or altered from any source distribution. -- // -- //////////////////////////////////////////////////////////// -- //////////////////////////////////////////////////////////// -- // Headers -- //////////////////////////////////////////////////////////// with Sf.System.Types; package Sf.System.Mutex is use Sf.System.Types; -- //////////////////////////////////////////////////////////// -- /// Create a new mutex -- /// -- /// \return A new sfMutex object -- /// -- //////////////////////////////////////////////////////////// function sfMutex_Create return sfMutex_Ptr; -- //////////////////////////////////////////////////////////// -- /// Destroy an existing mutex -- /// -- /// \param Mutex : Mutex to delete -- /// -- //////////////////////////////////////////////////////////// procedure sfMutex_Destroy (Mutex : sfMutex_Ptr); -- //////////////////////////////////////////////////////////// -- /// Lock a mutex -- /// -- /// \param Mutex : Mutex to lock -- /// -- //////////////////////////////////////////////////////////// procedure sfMutex_Lock (Mutex : sfMutex_Ptr); -- //////////////////////////////////////////////////////////// -- /// Unlock a mutex -- /// -- /// \param Mutex : Mutex to unlock -- /// -- //////////////////////////////////////////////////////////// procedure sfMutex_Unlock (Mutex : sfMutex_Ptr); private pragma Import (C, sfMutex_Create, "sfMutex_Create"); pragma Import (C, sfMutex_Destroy, "sfMutex_Destroy"); pragma Import (C, sfMutex_Lock, "sfMutex_Lock"); pragma Import (C, sfMutex_Unlock, "sfMutex_Unlock"); end Sf.System.Mutex;

37.506849

104

0.469686

23dd0e3ae5f07c1182b30c9a2d6cc6857f8a03ef

1,098

adb

Ada

src/display-console.adb

kraileth/ravenadm

02bb13117bafc8887e0c90a4effc63ffcdc90642

[ "0BSD" ]

18

2017-02-28T08:43:17.000Z

2022-03-22T21:55:56.000Z

src/display-console.adb

kraileth/ravenadm

02bb13117bafc8887e0c90a4effc63ffcdc90642

[ "0BSD" ]

49

2017-10-28T11:18:05.000Z

2022-01-16T16:23:32.000Z

src/display-console.adb

kraileth/ravenadm

02bb13117bafc8887e0c90a4effc63ffcdc90642

[ "0BSD" ]

5

2017-09-06T14:47:57.000Z

2021-11-25T08:31:10.000Z

-- This file is covered by the Internet Software Consortium (ISC) License -- Reference: ../License.txt package body Display.Console is -- These are dummy routines to match active ones in Display.Curses -- This module is only used to support building ravenadm without curses support function launch_monitor (num_builders : builders) return Boolean is begin pragma Unreferenced (num_builders); return False; end launch_monitor; procedure terminate_monitor is begin null; end terminate_monitor; procedure summarize (data : summary_rec) is begin pragma Unreferenced (data); null; end summarize; procedure update_builder (BR : builder_rec) is begin pragma Unreferenced (BR); null; end update_builder; procedure set_full_redraw_next_update is begin null; end set_full_redraw_next_update; procedure refresh_builder_window is begin null; end refresh_builder_window; procedure refresh_history_window is begin null; end refresh_history_window; end Display.Console;

22.875

83

0.718579

d081e5b7a85fb469b5077b16d8091a3c5ed71c74

2,421

adb

Ada

source/slim-players-displays.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-players-displays.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

source/slim-players-displays.adb

reznikmm/slimp

acbbb895ba9c2a2dfb28e5065e630326ce958502

[ "MIT" ]

null

-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Slim.Messages.grfe; package body Slim.Players.Displays is ----------- -- Clear -- ----------- procedure Clear (Self : in out Display) is begin Self.Buffer := (1 .. Self.Size => 0); end Clear; --------------- -- Draw_Text -- --------------- procedure Draw_Text (Self : in out Display; X, Y : Positive; Font : Slim.Fonts.Font; Text : League.Strings.Universal_String) is procedure Draw_Pixel (X, Y : Positive); procedure Draw_Pixel (X, Y : Positive) is begin Draw_Pixel (Self, X, Y); end Draw_Pixel; procedure Draw_Text is new Slim.Fonts.Draw_Text (Coordinate => Integer, Draw_Pixel => Draw_Pixel); Line : League.Strings.Universal_String := Text; begin while Fonts.Size (Font, Line).Right + X - 1 > 160 loop Line := Line.Head_To (Line.Length - 1); end loop; Draw_Text (Font, Line, X - 1, Y - 1); end Draw_Text; ---------------- -- Draw_Pixel -- ---------------- procedure Draw_Pixel (Self : in out Display; X, Y : Positive; Set : Boolean := True) is use type Ada.Streams.Stream_Element; Index : constant Ada.Streams.Stream_Element_Offset := Ada.Streams.Stream_Element_Offset ((X - 1) * 4 + (32 - Y) / 8 + 1); Mask : constant Ada.Streams.Stream_Element := 2 ** ((Y - 1) mod 8); begin if Set then Self.Buffer (Index) := Self.Buffer (Index) or Mask; else Self.Buffer (Index) := Self.Buffer (Index) and not Mask; end if; end Draw_Pixel; ---------------- -- Initialize -- ---------------- procedure Initialize (Self : in out Display; Player : Players.Player) is begin Self.Socket := Player.Socket; end Initialize; ------------------ -- Send_Message -- ------------------ procedure Send_Message (Self : Display; Transition : Transition_Kind := None; Offset : Natural := 0) is Grfe : Slim.Messages.grfe.Grfe_Message; begin Grfe.Initialize (Self.Buffer, Transition, Offset); Write_Message (Self.Socket, Grfe); end Send_Message; end Slim.Players.Displays;

24.21

75

0.539447

20ca5f41b547bb0dc4e5f8febb5a14dc58b33df5

756

adb

Ada

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_addr/foo.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

3

2021-05-04T17:09:06.000Z

2021-10-04T07:19:26.000Z

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_addr/foo.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/fun_addr/foo.adb

TheSledgeHammer/2.11BSD

fe61f0b9aaa273783cd027c7b5ec77e95ead2153

[ "BSD-3-Clause" ]

null

-- Copyright 2008-2020 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 Foo is begin null; end Foo;

37.8

73

0.736772

0e963a69fef9e1010aa9ce7c49724e20e883501c

2,247

ads

Ada

src/arch/socs/stm32f439/soc-flash.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/arch/socs/stm32f439/soc-flash.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

src/arch/socs/stm32f439/soc-flash.ads

PThierry/ewok-kernel

e9c23cb3fd0afd8378bc27418778e1117d5e16cc

[ "Apache-2.0" ]

null

-- -- Copyright 2018 The wookey project team <[email protected]> -- - Ryad Benadjila -- - Arnauld Michelizza -- - Mathieu Renard -- - Philippe Thierry -- - Philippe Trebuchet -- -- 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 system; package soc.flash with spark_mode => off is ----------------------------------------------- -- Flash access control register (FLASH_ACR) -- -- for STM32F42xxx and STM32F43xxx -- ----------------------------------------------- type t_FLASH_ACR is record LATENCY : bits_4; -- reserved_04_07 PRFTEN : boolean; -- Prefetch enable ICEN : boolean; -- Instruction cache enable DCEN : boolean; -- Data cache enable ICRST : boolean; -- Instruction cache reset DCRST : boolean; -- Data cache reset -- reserved_13_31 end record with volatile_full_access, size => 32; for t_FLASH_ACR use record LATENCY at 0 range 0 .. 3; -- reserved_04_07 PRFTEN at 0 range 8 .. 8; ICEN at 0 range 9 .. 9; DCEN at 0 range 10 .. 10; ICRST at 0 range 11 .. 11; DCRST at 0 range 12 .. 12; -- reserved_13_31 end record; ---------------------- -- FLASH peripheral -- ---------------------- type t_FLASH_peripheral is record ACR : t_FLASH_ACR; end record with volatile; for t_FLASH_peripheral use record ACR at 16#00# range 0 .. 31; end record; FLASH : t_FLASH_peripheral with import, volatile, address => system'to_address(16#4002_3C00#); end soc.flash;

29.565789

79

0.566533

c55c077b365e398a28bc56302b8fbaae5e7f2329

8,143

adb

Ada

src/security-auth-oauth-facebook.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

19

2015-01-18T23:04:59.000Z

2021-11-30T10:39:10.000Z

src/security-auth-oauth-facebook.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

4

2020-08-06T15:37:51.000Z

2022-02-04T20:19:39.000Z

src/security-auth-oauth-facebook.adb

Letractively/ada-security

027501979a0a154cd5c90d53e601a2ab06336529

[ "Apache-2.0" ]

3

2021-01-04T10:23:22.000Z

2022-01-30T21:45:49.000Z

----------------------------------------------------------------------- -- security-auth-oauth-facebook -- Facebook OAuth based authentication -- Copyright (C) 2013, 2014 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- 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.Beans.Objects.Time; with Util.Serialize.Mappers.Record_Mapper; with Util.Http.Rest; package body Security.Auth.OAuth.Facebook is -- TIME_SHIFT : constant Duration := 12 * 3600.0; type Token_Info_Field_Type is (FIELD_APP_ID, FIELD_IS_VALID, FIELD_EXPIRES, FIELD_ISSUED_AT, FIELD_USER_ID, FIELD_EMAIL, FIELD_FIRST_NAME, FIELD_LAST_NAME, FIELD_NAME, FIELD_LOCALE, FIELD_GENDER); type Token_Info is record App_Id : Ada.Strings.Unbounded.Unbounded_String; Is_Valid : Boolean := False; Expires : Ada.Calendar.Time; Issued : Ada.Calendar.Time; User_Id : Ada.Strings.Unbounded.Unbounded_String; Email : Ada.Strings.Unbounded.Unbounded_String; Name : Ada.Strings.Unbounded.Unbounded_String; First_Name : Ada.Strings.Unbounded.Unbounded_String; Last_Name : Ada.Strings.Unbounded.Unbounded_String; Locale : Ada.Strings.Unbounded.Unbounded_String; Gender : Ada.Strings.Unbounded.Unbounded_String; end record; type Token_Info_Access is access all Token_Info; procedure Set_Member (Into : in out Token_Info; Field : in Token_Info_Field_Type; Value : in Util.Beans.Objects.Object); procedure Set_Member (Into : in out Token_Info; Field : in Token_Info_Field_Type; Value : in Util.Beans.Objects.Object) is begin case Field is when FIELD_APP_ID => Into.App_Id := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_IS_VALID => Into.Is_Valid := Util.Beans.Objects.To_Boolean (Value); when FIELD_EXPIRES => Into.Expires := Util.Beans.Objects.Time.To_Time (Value); when FIELD_ISSUED_AT => Into.Issued := Util.Beans.Objects.Time.To_Time (Value); when FIELD_USER_ID => Into.User_Id := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_EMAIL => Into.Email := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_NAME => Into.Name := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_FIRST_NAME => Into.First_Name := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_LAST_NAME => Into.Last_Name := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_LOCALE => Into.Locale := Util.Beans.Objects.To_Unbounded_String (Value); when FIELD_GENDER => Into.Gender := Util.Beans.Objects.To_Unbounded_String (Value); end case; end Set_Member; package Token_Info_Mapper is new Util.Serialize.Mappers.Record_Mapper (Element_Type => Token_Info, Element_Type_Access => Token_Info_Access, Fields => Token_Info_Field_Type, Set_Member => Set_Member); procedure Get_Token_Info is new Util.Http.Rest.Rest_Get (Element_Mapper => Token_Info_Mapper); Token_Info_Map : aliased Token_Info_Mapper.Mapper; -- ------------------------------ -- Initialize the authentication realm. -- ------------------------------ overriding procedure Initialize (Realm : in out Manager; Params : in Parameters'Class; Provider : in String := PROVIDER_OPENID) is Client : constant String := Params.Get_Parameter (Provider & ".client_id"); Secret : constant String := Params.Get_Parameter (Provider & ".secret"); begin Security.Auth.OAuth.Manager (Realm).Initialize (Params, Provider); Realm.App_Access_Token := To_Unbounded_String (Client & "|" & Secret); end Initialize; -- ------------------------------ -- Verify the OAuth access token and retrieve information about the user. -- ------------------------------ overriding procedure Verify_Access_Token (Realm : in Manager; Assoc : in Association; Request : in Parameters'Class; Token : in Security.OAuth.Clients.Access_Token_Access; Result : in out Authentication) is pragma Unreferenced (Assoc, Request); use type Ada.Calendar.Time; T : constant String := Token.Get_Name; Info : aliased Token_Info; Now : constant Ada.Calendar.Time := Ada.Calendar.Clock; begin Get_Token_Info ("https://graph.facebook.com/debug_token?access_token=" & To_String (Realm.App_Access_Token) & "&input_token=" & T, Token_Info_Map'Access, "/data", Info'Unchecked_Access); if not Info.Is_Valid then Set_Result (Result, INVALID_SIGNATURE, "invalid access token returned"); elsif Info.Issued + TIME_SHIFT < Now then Set_Result (Result, INVALID_SIGNATURE, "the access token issued more than 1 hour ago"); elsif Info.Expires + TIME_SHIFT < Now then Set_Result (Result, INVALID_SIGNATURE, "the access token has expored"); elsif Length (Info.User_Id) = 0 then Set_Result (Result, INVALID_SIGNATURE, "the access token refers to an empty user_id"); elsif Info.App_Id /= Realm.App.Get_Application_Identifier then Set_Result (Result, INVALID_SIGNATURE, "the access token was granted for another application"); else Result.Identity := To_Unbounded_String ("https://graph.facebook.com/"); Append (Result.Identity, Info.User_Id); Result.Claimed_Id := Result.Identity; Get_Token_Info ("https://graph.facebook.com/" & To_String (Info.User_Id) & "?access_token=" & T, Token_Info_Map'Access, "", Info'Unchecked_Access); Result.Email := Info.Email; Result.Full_Name := Info.Name; Result.First_Name := Info.First_Name; Result.Last_Name := Info.Last_Name; Result.Language := Info.Locale; Result.Gender := Info.Gender; Set_Result (Result, AUTHENTICATED, "authenticated"); end if; end Verify_Access_Token; begin Token_Info_Map.Add_Mapping ("app_id", FIELD_APP_ID); Token_Info_Map.Add_Mapping ("expires_at", FIELD_EXPIRES); Token_Info_Map.Add_Mapping ("issued_at", FIELD_ISSUED_AT); Token_Info_Map.Add_Mapping ("is_valid", FIELD_IS_VALID); Token_Info_Map.Add_Mapping ("user_id", FIELD_USER_ID); Token_Info_Map.Add_Mapping ("email", FIELD_EMAIL); Token_Info_Map.Add_Mapping ("name", FIELD_NAME); Token_Info_Map.Add_Mapping ("first_name", FIELD_FIRST_NAME); Token_Info_Map.Add_Mapping ("last_name", FIELD_LAST_NAME); Token_Info_Map.Add_Mapping ("locale", FIELD_LOCALE); Token_Info_Map.Add_Mapping ("gender", FIELD_GENDER); end Security.Auth.OAuth.Facebook;

42.857895

96

0.608007

dc3acc5ecf95e56ff0774dd16a790d1a20969a92

9,077

ads

Ada

source/amf/mof/amf.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/mof/amf.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/mof/amf.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010-2012, Vadim Godunko <[email protected]> -- -- 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$ ------------------------------------------------------------------------------ -- Root package of Ada Modeling Framework. -- -- This package contains declarations of primitive types corresponding to -- types defined in PrimitiveTypes package and types to represent their -- optional values (values with multiplicity 0..1). -- -- Some primitive types are mapped implicitly: -- -- - PrimitiveTypes::Boolean is mapped to Standard.Boolean; -- -- - PrimitiveTypes::Integer is mapped to Standard.Integer; -- -- - PrimitiveTypes::String is mapped to League.Strings.Universal_String. -- ------------------------------------------------------------------------------ with League.Strings; package AMF is pragma Preelaborate; --------------------- -- Primitive types -- --------------------- type Real is new Long_Float; type Unlimited_Natural (Unlimited : Boolean := False) is record case Unlimited is when False => Value : Natural; when True => null; end case; end record; Unlimited : constant Unlimited_Natural; function "<" (Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean; function "<=" (Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean; function ">" (Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean; function ">=" (Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean; function "=" (Left : Unlimited_Natural; Right : Integer) return Boolean; function "<" (Left : Unlimited_Natural; Right : Integer) return Boolean; function "<=" (Left : Unlimited_Natural; Right : Integer) return Boolean; function ">" (Left : Unlimited_Natural; Right : Integer) return Boolean; function ">=" (Left : Unlimited_Natural; Right : Integer) return Boolean; function "=" (Left : Integer; Right : Unlimited_Natural) return Boolean; function "<" (Left : Integer; Right : Unlimited_Natural) return Boolean; function "<=" (Left : Integer; Right : Unlimited_Natural) return Boolean; function ">" (Left : Integer; Right : Unlimited_Natural) return Boolean; function ">=" (Left : Integer; Right : Unlimited_Natural) return Boolean; ---------------------------------------- -- Optional values of primitive types -- ---------------------------------------- type Optional_String (Is_Empty : Boolean := True) is record case Is_Empty is when True => null; when False => Value : League.Strings.Universal_String; end case; end record; function "=" (Left : Optional_String; Right : Optional_String) return Boolean; function "=" (Left : Optional_String; Right : League.Strings.Universal_String) return Boolean; function "=" (Left : League.Strings.Universal_String; Right : Optional_String) return Boolean; function "<" (Left : Optional_String; Right : Optional_String) return Boolean; function "<" (Left : Optional_String; Right : League.Strings.Universal_String) return Boolean; function "<" (Left : League.Strings.Universal_String; Right : Optional_String) return Boolean; function "<=" (Left : Optional_String; Right : Optional_String) return Boolean; function "<=" (Left : Optional_String; Right : League.Strings.Universal_String) return Boolean; function "<=" (Left : League.Strings.Universal_String; Right : Optional_String) return Boolean; function ">" (Left : Optional_String; Right : Optional_String) return Boolean; function ">" (Left : Optional_String; Right : League.Strings.Universal_String) return Boolean; function ">" (Left : League.Strings.Universal_String; Right : Optional_String) return Boolean; function ">=" (Left : Optional_String; Right : Optional_String) return Boolean; function ">=" (Left : Optional_String; Right : League.Strings.Universal_String) return Boolean; function ">=" (Left : League.Strings.Universal_String; Right : Optional_String) return Boolean; type Optional_Boolean (Is_Empty : Boolean := True) is record case Is_Empty is when True => null; when False => Value : Boolean; end case; end record; type Optional_Integer (Is_Empty : Boolean := True) is record case Is_Empty is when True => null; when False => Value : Integer; end case; end record; function "=" (Left : Optional_Integer; Right : Integer) return Boolean; function "=" (Left : Integer; Right : Optional_Integer) return Boolean; type Optional_Unlimited_Natural (Is_Empty : Boolean := True) is record case Is_Empty is when True => null; when False => Value : Unlimited_Natural; end case; end record; function "=" (Left : Optional_Unlimited_Natural; Right : Integer) return Boolean; function "=" (Left : Optional_Unlimited_Natural; Right : Unlimited_Natural) return Boolean; function "=" (Left : Optional_Unlimited_Natural; Right : Optional_Integer) return Boolean; function "=" (Left : Integer; Right : Optional_Unlimited_Natural) return Boolean; function "=" (Left : Unlimited_Natural; Right : Optional_Unlimited_Natural) return Boolean; function "=" (Left : Optional_Integer; Right : Optional_Unlimited_Natural) return Boolean; type Optional_Real (Is_Empty : Boolean := True) is record case Is_Empty is when True => null; when False => Value : Real; end case; end record; private Unlimited : constant Unlimited_Natural := (Unlimited => True); end AMF;

40.522321

78

0.544673

0e50e62100a300b884a119fcc7c8f41e77f2c729

235

adb

Ada

Pruebas/factorial.adb

Arles96/PCompiladores

e435b9f5169589badf289b44a62f76d03438fa6e

[ "MIT" ]

null

Pruebas/factorial.adb

Arles96/PCompiladores

e435b9f5169589badf289b44a62f76d03438fa6e

[ "MIT" ]

null

Pruebas/factorial.adb

Arles96/PCompiladores

e435b9f5169589badf289b44a62f76d03438fa6e

[ "MIT" ]

1

2021-03-28T22:41:49.000Z

procedure factorial is i, x: Integer; y: Integer; begin put("Ingrese un numero "); get(x); y := 1; i := 1; while i <= x loop y := y * i; i := i + 1; end loop; put("\nEl resultado es "); put(y); end factorial;

13.055556

28

0.531915

cbfe0b010f2c431bc0846c78bc8596f5c8d3b4c3

9,652

ads

Ada

source/amf/uml/amf-internals-umldi_uml_stereotype_property_value_labels.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

24

2016-11-29T06:59:41.000Z

2021-08-30T11:55:16.000Z

source/amf/uml/amf-internals-umldi_uml_stereotype_property_value_labels.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

2

2019-01-16T05:15:20.000Z

2019-02-03T10:03:32.000Z

source/amf/uml/amf-internals-umldi_uml_stereotype_property_value_labels.ads

svn2github/matreshka

9d222b3ad9da508855fb1f5adbe5e8a4fad4c530

[ "BSD-3-Clause" ]

4

2017-07-18T07:11:05.000Z

2020-06-21T03:02:25.000Z

------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012, Vadim Godunko <[email protected]> -- -- 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.CMOF.Elements; with AMF.DI.Styles; with AMF.Internals.UMLDI_UML_Labels; with AMF.UML.Elements.Collections; with AMF.UML.Properties; with AMF.UMLDI.UML_Stereotype_Property_Value_Labels; with AMF.UMLDI.UML_Styles; with AMF.Visitors; with League.Strings; package AMF.Internals.UMLDI_UML_Stereotype_Property_Value_Labels is type UMLDI_UML_Stereotype_Property_Value_Label_Proxy is limited new AMF.Internals.UMLDI_UML_Labels.UMLDI_UML_Label_Proxy and AMF.UMLDI.UML_Stereotype_Property_Value_Labels.UMLDI_UML_Stereotype_Property_Value_Label with null record; overriding function Get_Model_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.UML.Properties.UML_Property_Access; -- Getter of UMLStereotypePropertyValueLabel::modelElement. -- -- A Property of a Stereotype applied to the stereotypedElement. overriding procedure Set_Model_Element (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : AMF.UML.Properties.UML_Property_Access); -- Setter of UMLStereotypePropertyValueLabel::modelElement. -- -- A Property of a Stereotype applied to the stereotypedElement. overriding function Get_Stereotyped_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.UML.Elements.UML_Element_Access; -- Getter of UMLStereotypePropertyValueLabel::stereotypedElement. -- -- Element to which a Stereotype having the modelElement (Property) is -- applied. overriding procedure Set_Stereotyped_Element (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : AMF.UML.Elements.UML_Element_Access); -- Setter of UMLStereotypePropertyValueLabel::stereotypedElement. -- -- Element to which a Stereotype having the modelElement (Property) is -- applied. overriding function Get_Text (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return League.Strings.Universal_String; -- Getter of UMLLabel::text. -- -- String to be rendered. overriding procedure Set_Text (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : League.Strings.Universal_String); -- Setter of UMLLabel::text. -- -- String to be rendered. overriding function Get_Is_Icon (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return Boolean; -- Getter of UMLDiagramElement::isIcon. -- -- For modelElements that have an option to be shown with shapes other -- than rectangles, such as Actors, or with other identifying shapes -- inside them, such as arrows distinguishing InputPins and OutputPins, or -- edges that have an option to be shown with lines other than solid with -- open arrow heads, such as Realization. A value of true for isIcon -- indicates the alternative notation shall be shown. overriding procedure Set_Is_Icon (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : Boolean); -- Setter of UMLDiagramElement::isIcon. -- -- For modelElements that have an option to be shown with shapes other -- than rectangles, such as Actors, or with other identifying shapes -- inside them, such as arrows distinguishing InputPins and OutputPins, or -- edges that have an option to be shown with lines other than solid with -- open arrow heads, such as Realization. A value of true for isIcon -- indicates the alternative notation shall be shown. overriding function Get_Local_Style (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access; -- Getter of UMLDiagramElement::localStyle. -- -- Restricts owned styles to UMLStyles. overriding procedure Set_Local_Style (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access); -- Setter of UMLDiagramElement::localStyle. -- -- Restricts owned styles to UMLStyles. overriding function Get_Model_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.UML.Elements.Collections.Set_Of_UML_Element; -- Getter of UMLDiagramElement::modelElement. -- -- Restricts UMLDiagramElements to show UML Elements, rather than other -- language elements. overriding function Get_Model_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.CMOF.Elements.CMOF_Element_Access; -- Getter of DiagramElement::modelElement. -- -- a reference to a depicted model element, which can be any MOF-based -- element overriding function Get_Local_Style (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy) return AMF.DI.Styles.DI_Style_Access; -- Getter of DiagramElement::localStyle. -- -- a reference to an optional locally-owned style for this diagram element. overriding procedure Set_Local_Style (Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy; To : AMF.DI.Styles.DI_Style_Access); -- Setter of DiagramElement::localStyle. -- -- a reference to an optional locally-owned style for this diagram element. overriding procedure Enter_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Leave_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Visit_Element (Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); end AMF.Internals.UMLDI_UML_Stereotype_Property_Value_Labels;

51.068783

117

0.632926

0e604b1761e34ad76d96123df7358606ad05fbda

8,642

ads

Ada

.build/ada/asis-gela-elements-clause.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

4

2016-02-05T15:51:56.000Z

2022-03-25T20:38:32.000Z

.build/ada/asis-gela-elements-clause.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

.build/ada/asis-gela-elements-clause.ads

faelys/gela-asis

48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253

[ "BSD-3-Clause" ]

null

------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, Maxim Reznik -- 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 Maxim Reznik, 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 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 Asis.Gela.Elements.Clause is ----------------------- -- Named_Clause_Node -- ----------------------- type Named_Clause_Node is abstract new Clause_Node with private; type Named_Clause_Ptr is access all Named_Clause_Node; for Named_Clause_Ptr'Storage_Pool use Lists.Pool; function Clause_Names (Element : Named_Clause_Node; Include_Pragmas : in Boolean := False) return Asis.Element_List; procedure Set_Clause_Names (Element : in out Named_Clause_Node; Value : in Asis.Element); function Clause_Names_List (Element : Named_Clause_Node) return Asis.Element; function Children (Element : access Named_Clause_Node) return Traverse_List; ----------------------------- -- Use_Package_Clause_Node -- ----------------------------- type Use_Package_Clause_Node is new Named_Clause_Node with private; type Use_Package_Clause_Ptr is access all Use_Package_Clause_Node; for Use_Package_Clause_Ptr'Storage_Pool use Lists.Pool; function New_Use_Package_Clause_Node (The_Context : ASIS.Context) return Use_Package_Clause_Ptr; function Clause_Kind (Element : Use_Package_Clause_Node) return Asis.Clause_Kinds; function Clone (Element : Use_Package_Clause_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Use_Package_Clause_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); -------------------------- -- Use_Type_Clause_Node -- -------------------------- type Use_Type_Clause_Node is new Named_Clause_Node with private; type Use_Type_Clause_Ptr is access all Use_Type_Clause_Node; for Use_Type_Clause_Ptr'Storage_Pool use Lists.Pool; function New_Use_Type_Clause_Node (The_Context : ASIS.Context) return Use_Type_Clause_Ptr; function Clause_Kind (Element : Use_Type_Clause_Node) return Asis.Clause_Kinds; function Clone (Element : Use_Type_Clause_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Use_Type_Clause_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); ---------------------- -- With_Clause_Node -- ---------------------- type With_Clause_Node is new Named_Clause_Node with private; type With_Clause_Ptr is access all With_Clause_Node; for With_Clause_Ptr'Storage_Pool use Lists.Pool; function New_With_Clause_Node (The_Context : ASIS.Context) return With_Clause_Ptr; function Has_Limited (Element : With_Clause_Node) return Boolean; procedure Set_Has_Limited (Element : in out With_Clause_Node; Value : in Boolean); function Has_Private (Element : With_Clause_Node) return Boolean; procedure Set_Has_Private (Element : in out With_Clause_Node; Value : in Boolean); function Clause_Kind (Element : With_Clause_Node) return Asis.Clause_Kinds; function Clone (Element : With_Clause_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access With_Clause_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); -------------------------------- -- Representation_Clause_Node -- -------------------------------- type Representation_Clause_Node is abstract new Clause_Node with private; type Representation_Clause_Ptr is access all Representation_Clause_Node; for Representation_Clause_Ptr'Storage_Pool use Lists.Pool; function Representation_Clause_Name (Element : Representation_Clause_Node) return Asis.Name; procedure Set_Representation_Clause_Name (Element : in out Representation_Clause_Node; Value : in Asis.Name); function Clause_Kind (Element : Representation_Clause_Node) return Asis.Clause_Kinds; function Children (Element : access Representation_Clause_Node) return Traverse_List; --------------------------- -- Component_Clause_Node -- --------------------------- type Component_Clause_Node is new Clause_Node with private; type Component_Clause_Ptr is access all Component_Clause_Node; for Component_Clause_Ptr'Storage_Pool use Lists.Pool; function New_Component_Clause_Node (The_Context : ASIS.Context) return Component_Clause_Ptr; function Component_Clause_Position (Element : Component_Clause_Node) return Asis.Expression; procedure Set_Component_Clause_Position (Element : in out Component_Clause_Node; Value : in Asis.Expression); function Component_Clause_Range (Element : Component_Clause_Node) return Asis.Discrete_Range; procedure Set_Component_Clause_Range (Element : in out Component_Clause_Node; Value : in Asis.Discrete_Range); function Representation_Clause_Name (Element : Component_Clause_Node) return Asis.Name; procedure Set_Representation_Clause_Name (Element : in out Component_Clause_Node; Value : in Asis.Name); function Clause_Kind (Element : Component_Clause_Node) return Asis.Clause_Kinds; function Children (Element : access Component_Clause_Node) return Traverse_List; function Clone (Element : Component_Clause_Node; Parent : Asis.Element) return Asis.Element; procedure Copy (Source : in Asis.Element; Target : access Component_Clause_Node; Cloner : in Cloner_Class; Parent : in Asis.Element); private type Named_Clause_Node is abstract new Clause_Node with record Clause_Names : aliased Primary_Expression_Lists.List; end record; type Use_Package_Clause_Node is new Named_Clause_Node with record null; end record; type Use_Type_Clause_Node is new Named_Clause_Node with record null; end record; type With_Clause_Node is new Named_Clause_Node with record Has_Limited : aliased Boolean := False; Has_Private : aliased Boolean := False; end record; type Representation_Clause_Node is abstract new Clause_Node with record Representation_Clause_Name : aliased Asis.Name; end record; type Component_Clause_Node is new Clause_Node with record Component_Clause_Position : aliased Asis.Expression; Component_Clause_Range : aliased Asis.Discrete_Range; Representation_Clause_Name : aliased Asis.Name; end record; end Asis.Gela.Elements.Clause;

30.429577

80

0.667207

0ebc2bc7a0eefee777dedb85866f9646cc21b88b

12,026

adb

Ada

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-direio.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-direio.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-direio.adb

djamal2727/Main-Bearing-Analytical-Model

2f00c2219c71be0175c6f4f8f1d4cca231d97096

[ "Apache-2.0" ]

null

------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . D I R E C T _ I O -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-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. -- -- -- ------------------------------------------------------------------------------ with Ada.IO_Exceptions; use Ada.IO_Exceptions; with Ada.Unchecked_Deallocation; with Interfaces.C_Streams; use Interfaces.C_Streams; with System; use System; with System.CRTL; with System.File_IO; with System.Soft_Links; package body System.Direct_IO is package FIO renames System.File_IO; package SSL renames System.Soft_Links; subtype AP is FCB.AFCB_Ptr; use type FCB.Shared_Status_Type; use type System.CRTL.int64; use type System.CRTL.size_t; ----------------------- -- Local Subprograms -- ----------------------- procedure Set_Position (File : File_Type); -- Sets file position pointer according to value of current index ------------------- -- AFCB_Allocate -- ------------------- function AFCB_Allocate (Control_Block : Direct_AFCB) return FCB.AFCB_Ptr is pragma Unreferenced (Control_Block); begin return new Direct_AFCB; end AFCB_Allocate; ---------------- -- AFCB_Close -- ---------------- -- No special processing required for Direct_IO close procedure AFCB_Close (File : not null access Direct_AFCB) is pragma Unreferenced (File); begin null; end AFCB_Close; --------------- -- AFCB_Free -- --------------- procedure AFCB_Free (File : not null access Direct_AFCB) is type FCB_Ptr is access all Direct_AFCB; FT : FCB_Ptr := FCB_Ptr (File); procedure Free is new Ada.Unchecked_Deallocation (Direct_AFCB, FCB_Ptr); begin Free (FT); end AFCB_Free; ------------ -- Create -- ------------ procedure Create (File : in out File_Type; Mode : FCB.File_Mode := FCB.Inout_File; Name : String := ""; Form : String := "") is Dummy_File_Control_Block : Direct_AFCB; pragma Warnings (Off, Dummy_File_Control_Block); -- Yes, we know this is never assigned a value, only the tag is used for -- dispatching purposes, so that's expected. begin FIO.Open (File_Ptr => AP (File), Dummy_FCB => Dummy_File_Control_Block, Mode => Mode, Name => Name, Form => Form, Amethod => 'D', Creat => True, Text => False); end Create; ----------------- -- End_Of_File -- ----------------- function End_Of_File (File : File_Type) return Boolean is begin FIO.Check_Read_Status (AP (File)); return File.Index > Size (File); end End_Of_File; ----------- -- Index -- ----------- function Index (File : File_Type) return Positive_Count is begin FIO.Check_File_Open (AP (File)); return File.Index; end Index; ---------- -- Open -- ---------- procedure Open (File : in out File_Type; Mode : FCB.File_Mode; Name : String; Form : String := "") is Dummy_File_Control_Block : Direct_AFCB; pragma Warnings (Off, Dummy_File_Control_Block); -- Yes, we know this is never assigned a value, only the tag is used for -- dispatching purposes, so that's expected. begin FIO.Open (File_Ptr => AP (File), Dummy_FCB => Dummy_File_Control_Block, Mode => Mode, Name => Name, Form => Form, Amethod => 'D', Creat => False, Text => False); end Open; ---------- -- Read -- ---------- procedure Read (File : File_Type; Item : Address; Size : Interfaces.C_Streams.size_t; From : Positive_Count) is begin Set_Index (File, From); Read (File, Item, Size); end Read; procedure Read (File : File_Type; Item : Address; Size : Interfaces.C_Streams.size_t) is begin FIO.Check_Read_Status (AP (File)); -- If last operation was not a read, or if in file sharing mode, -- then reset the physical pointer of the file to match the index -- We lock out task access over the two operations in this case. if File.Last_Op /= Op_Read or else File.Shared_Status = FCB.Yes then if End_Of_File (File) then raise End_Error; end if; Locked_Processing : begin SSL.Lock_Task.all; Set_Position (File); FIO.Read_Buf (AP (File), Item, Size); SSL.Unlock_Task.all; exception when others => SSL.Unlock_Task.all; raise; end Locked_Processing; else FIO.Read_Buf (AP (File), Item, Size); end if; File.Index := File.Index + 1; -- Set last operation to read, unless we did not read a full record -- (happens with the variant record case) in which case we set the -- last operation as other, to force the file position to be reset -- on the next read. File.Last_Op := (if File.Bytes = Size then Op_Read else Op_Other); end Read; -- The following is the required overriding for Stream.Read, which is -- not used, since we do not do Stream operations on Direct_IO files. procedure Read (File : in out Direct_AFCB; Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset) is begin raise Program_Error; end Read; ----------- -- Reset -- ----------- procedure Reset (File : in out File_Type; Mode : FCB.File_Mode) is pragma Warnings (Off, File); -- File is actually modified via Unrestricted_Access below, but -- GNAT will generate a warning anyway. -- -- Note that we do not use pragma Unmodified here, since in -gnatc mode, -- GNAT will complain that File is modified for "File.Index := 1;" begin FIO.Reset (AP (File)'Unrestricted_Access, Mode); File.Index := 1; File.Last_Op := Op_Read; end Reset; procedure Reset (File : in out File_Type) is pragma Warnings (Off, File); -- See above (other Reset procedure) for explanations on this pragma begin FIO.Reset (AP (File)'Unrestricted_Access); File.Index := 1; File.Last_Op := Op_Read; end Reset; --------------- -- Set_Index -- --------------- procedure Set_Index (File : File_Type; To : Positive_Count) is begin FIO.Check_File_Open (AP (File)); File.Index := Count (To); File.Last_Op := Op_Other; end Set_Index; ------------------ -- Set_Position -- ------------------ procedure Set_Position (File : File_Type) is R : int; begin R := fseek64 (File.Stream, int64 (File.Bytes) * int64 (File.Index - 1), SEEK_SET); if R /= 0 then raise Use_Error; end if; end Set_Position; ---------- -- Size -- ---------- function Size (File : File_Type) return Count is Pos : int64; begin FIO.Check_File_Open (AP (File)); File.Last_Op := Op_Other; if fseek64 (File.Stream, 0, SEEK_END) /= 0 then raise Device_Error; end if; Pos := ftell64 (File.Stream); if Pos = -1 then raise Use_Error; end if; return Count (Pos / int64 (File.Bytes)); end Size; ----------- -- Write -- ----------- procedure Write (File : File_Type; Item : Address; Size : Interfaces.C_Streams.size_t; Zeroes : System.Storage_Elements.Storage_Array) is procedure Do_Write; -- Do the actual write -------------- -- Do_Write -- -------------- procedure Do_Write is begin FIO.Write_Buf (AP (File), Item, Size); -- If we did not write the whole record (happens with the variant -- record case), then fill out the rest of the record with zeroes. -- This is cleaner in any case, and is required for the last -- record, since otherwise the length of the file is wrong. if File.Bytes > Size then FIO.Write_Buf (AP (File), Zeroes'Address, File.Bytes - Size); end if; end Do_Write; -- Start of processing for Write begin FIO.Check_Write_Status (AP (File)); -- If last operation was not a write, or if in file sharing mode, -- then reset the physical pointer of the file to match the index -- We lock out task access over the two operations in this case. if File.Last_Op /= Op_Write or else File.Shared_Status = FCB.Yes then Locked_Processing : begin SSL.Lock_Task.all; Set_Position (File); Do_Write; SSL.Unlock_Task.all; exception when others => SSL.Unlock_Task.all; raise; end Locked_Processing; else Do_Write; end if; File.Index := File.Index + 1; -- Set last operation to write, unless we did not read a full record -- (happens with the variant record case) in which case we set the -- last operation as other, to force the file position to be reset -- on the next write. File.Last_Op := (if File.Bytes = Size then Op_Write else Op_Other); end Write; -- The following is the required overriding for Stream.Write, which is -- not used, since we do not do Stream operations on Direct_IO files. procedure Write (File : in out Direct_AFCB; Item : Ada.Streams.Stream_Element_Array) is begin raise Program_Error; end Write; end System.Direct_IO;

30.065

79

0.527274

20bf085151d5221901edbd5f5bc027845f05404c

740

ads

Ada

test/ash_suite.ads

psyomn/ash

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

11

2017-04-08T17:48:19.000Z

2021-12-31T23:36:25.000Z

test/ash_suite.ads

psyomn/axios

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

3

2017-03-24T04:34:15.000Z

2017-04-03T05:18:47.000Z

test/ash_suite.ads

psyomn/axios

7630208f9f2dc296f75076141d591354bde02ac7

[ "Apache-2.0" ]

4

2017-05-14T11:46:37.000Z

2019-04-18T20:34:07.000Z

-- Copyright 2019 Simon Symeonidis (psyomn) -- -- 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 AUnit.Test_Suites; use AUnit.Test_Suites; package Ash_Suite is function Suite return Access_Test_Suite; end Ash_Suite;

35.238095

76

0.75

d0c4453130b604acd05cec495e683e045e114c10

829

ads

Ada

src/pygamer-screen.ads

Fabien-Chouteau/pygamer-simulator

c0b428bdaf94de296ec3591a11f8ae79f48cc0d3

[ "BSD-3-Clause" ]

1

2020-12-19T14:51:18.000Z

src/pygamer-screen.ads

Fabien-Chouteau/pygamer-simulator

c0b428bdaf94de296ec3591a11f8ae79f48cc0d3

[ "BSD-3-Clause" ]

null

src/pygamer-screen.ads

Fabien-Chouteau/pygamer-simulator

c0b428bdaf94de296ec3591a11f8ae79f48cc0d3

[ "BSD-3-Clause" ]

null

with System; with HAL; with HAL.Bitmap; package PyGamer.Screen is Width : constant := 160; Height : constant := 128; procedure Set_Address (X_Start, X_End, Y_Start, Y_End : HAL.UInt16); procedure Start_Pixel_TX; procedure End_Pixel_TX; procedure Push_Pixels (Addr : System.Address; Len : Natural); -- Addr: pointer to a read-only buffer of Len pixels (16-bit RGB565) procedure Push_Pixels_Swap (Addr : System.Address; Len : Natural); -- Addr: pointer to a read-write buffer of Len pixels (16-bit RGB565) procedure Scroll (Val : HAL.UInt8); procedure Debug_Mode (Enabled : Boolean); -- DMA -- procedure Start_DMA (Addr : System.Address; Len : Natural); -- Addr: pointer to a read-only buffer of Len pixels (16-bit RGB565) procedure Wait_End_Of_DMA; end PyGamer.Screen;

25.121212

73

0.698432

180131abfc15a12e98f73db6dd4a69a427c204c7

878

adb

Ada

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/ref_param/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/ref_param/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

Read Only/gdb-6.8/gdb/testsuite/gdb.ada/ref_param/pck.adb

samyvic/OS-Project

1622bc1641876584964effd91d65ef02e92728e1

[ "Apache-2.0" ]

null

-- Copyright 2008 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/>. package body Pck is procedure Call_Me (D : in out Data) is begin if D.One > D.Two then D.Three := D.Four; end if; end Call_Me; end Pck;

33.769231

73

0.705011

4a32a045d827d81cf60b79b0e586e2fb92bea550

5,935

ads

Ada

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-mpu.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

2

2018-05-16T03:56:39.000Z

2019-07-31T13:53:56.000Z

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-mpu.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

arch/ARM/STM32/svd/stm32l0x3/stm32_svd-mpu.ads

morbos/Ada_Drivers_Library

a4ab26799be60997c38735f4056160c4af597ef7

[ "BSD-3-Clause" ]

null

-- This spec has been automatically generated from STM32L0x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.MPU is pragma Preelaborate; --------------- -- Registers -- --------------- subtype MPU_TYPER_DREGION_Field is HAL.UInt8; subtype MPU_TYPER_IREGION_Field is HAL.UInt8; -- MPU type register type MPU_TYPER_Register is record -- Read-only. Separate flag SEPARATE_k : Boolean; -- unspecified Reserved_1_7 : HAL.UInt7; -- Read-only. Number of MPU data regions DREGION : MPU_TYPER_DREGION_Field; -- Read-only. Number of MPU instruction regions IREGION : MPU_TYPER_IREGION_Field; -- unspecified Reserved_24_31 : HAL.UInt8; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_TYPER_Register use record SEPARATE_k at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; DREGION at 0 range 8 .. 15; IREGION at 0 range 16 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; -- MPU control register type MPU_CTRL_Register is record -- Read-only. Enables the MPU ENABLE : Boolean; -- Read-only. Enables the operation of MPU during hard fault HFNMIENA : Boolean; -- Read-only. Enable priviliged software access to default memory map PRIVDEFENA : Boolean; -- unspecified Reserved_3_31 : HAL.UInt29; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_CTRL_Register use record ENABLE at 0 range 0 .. 0; HFNMIENA at 0 range 1 .. 1; PRIVDEFENA at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype MPU_RNR_REGION_Field is HAL.UInt8; -- MPU region number register type MPU_RNR_Register is record -- MPU region REGION : MPU_RNR_REGION_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RNR_Register use record REGION at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype MPU_RBAR_REGION_Field is HAL.UInt4; subtype MPU_RBAR_ADDR_Field is HAL.UInt27; -- MPU region base address register type MPU_RBAR_Register is record -- MPU region field REGION : MPU_RBAR_REGION_Field := 16#0#; -- MPU region number valid VALID : Boolean := False; -- Region base address field ADDR : MPU_RBAR_ADDR_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RBAR_Register use record REGION at 0 range 0 .. 3; VALID at 0 range 4 .. 4; ADDR at 0 range 5 .. 31; end record; subtype MPU_RASR_SIZE_Field is HAL.UInt5; subtype MPU_RASR_SRD_Field is HAL.UInt8; subtype MPU_RASR_TEX_Field is HAL.UInt3; subtype MPU_RASR_AP_Field is HAL.UInt3; -- MPU region attribute and size register type MPU_RASR_Register is record -- Region enable bit. ENABLE : Boolean := False; -- Size of the MPU protection region SIZE : MPU_RASR_SIZE_Field := 16#0#; -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- Subregion disable bits SRD : MPU_RASR_SRD_Field := 16#0#; -- memory attribute B : Boolean := False; -- memory attribute C : Boolean := False; -- Shareable memory attribute S : Boolean := False; -- memory attribute TEX : MPU_RASR_TEX_Field := 16#0#; -- unspecified Reserved_22_23 : HAL.UInt2 := 16#0#; -- Access permission AP : MPU_RASR_AP_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Instruction access disable bit XN : Boolean := False; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RASR_Register use record ENABLE at 0 range 0 .. 0; SIZE at 0 range 1 .. 5; Reserved_6_7 at 0 range 6 .. 7; SRD at 0 range 8 .. 15; B at 0 range 16 .. 16; C at 0 range 17 .. 17; S at 0 range 18 .. 18; TEX at 0 range 19 .. 21; Reserved_22_23 at 0 range 22 .. 23; AP at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; XN at 0 range 28 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Memory protection unit type MPU_Peripheral is record -- MPU type register MPU_TYPER : aliased MPU_TYPER_Register; -- MPU control register MPU_CTRL : aliased MPU_CTRL_Register; -- MPU region number register MPU_RNR : aliased MPU_RNR_Register; -- MPU region base address register MPU_RBAR : aliased MPU_RBAR_Register; -- MPU region attribute and size register MPU_RASR : aliased MPU_RASR_Register; end record with Volatile; for MPU_Peripheral use record MPU_TYPER at 16#0# range 0 .. 31; MPU_CTRL at 16#4# range 0 .. 31; MPU_RNR at 16#8# range 0 .. 31; MPU_RBAR at 16#C# range 0 .. 31; MPU_RASR at 16#10# range 0 .. 31; end record; -- Memory protection unit MPU_Periph : aliased MPU_Peripheral with Import, Address => System'To_Address (16#E000ED90#); end STM32_SVD.MPU;

31.569149

76

0.595451

cb3201bba04fecba0e7aaacec830d254598952a2

2,061

adb

Ada

test/unknown/test_unknown-read.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

1

2019-02-09T22:04:10.000Z

test/unknown/test_unknown-read.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

null

test/unknown/test_unknown-read.adb

skill-lang/skillAdaTestSuite

279ea0c0cd489c2e39d7532a3b68c564497101e2

[ "BSD-3-Clause" ]

null

package body Test_Unknown.Read is procedure Initialize (T : in out Test) is begin Set_Name (T, "Test_Unknown.Read"); Ahven.Framework.Add_Test_Routine (T, Check_Types'Access, "unknownSubtypes read"); Ahven.Framework.Add_Test_Routine (T, Check_Fields_A'Access, "a: all fields are self-references"); Ahven.Framework.Add_Test_Routine (T, Check_Fields_C'Access, "c: all fields are self-references"); end Initialize; procedure Check_Types is use Ada.Characters.Handling; use Ada.Strings.Fixed; use Ada.Tags; State : access Skill_State := new Skill_State; begin Skill.Read (State, "resources/localBasePoolStartIndex.sf"); declare Types : constant String := "aaaaacaaaaaca"; begin for I in Types'Range loop declare Object : Skill_Type'Class := Get_A (State, I).all; C : Character := To_Lower (Expanded_Name (Object'Tag)(9)); begin Ahven.Assert (Types (I) = C, "index " & Trim (I'Img, Ada.Strings.Left)); end; end loop; end; end Check_Types; procedure Check_Fields_A is use Ada.Strings.Fixed; State : access Skill_State := new Skill_State; begin Skill.Read (State, "resources/localBasePoolStartIndex.sf"); for I in 1 .. As_Size (State) loop declare X : A_Type_Access := Get_A (State, I); begin Ahven.Assert (X = X.Get_A, "index " & Trim (I'Img, Ada.Strings.Left)); end; end loop; end Check_Fields_A; procedure Check_Fields_C is use Ada.Strings.Fixed; State : access Skill_State := new Skill_State; begin Skill.Read (State, "resources/localBasePoolStartIndex.sf"); for I in 1 .. Cs_Size (State) loop declare X : C_Type_Access := Get_C (State, I); begin Ahven.Assert (X = X.Get_C, "index " & Trim (I'Img, Ada.Strings.Left)); end; end loop; end Check_Fields_C; end Test_Unknown.Read;

30.761194

103

0.611354