hexsha
stringlengths 40
40
| size
int64 3
1.05M
| ext
stringclasses 163
values | lang
stringclasses 53
values | max_stars_repo_path
stringlengths 3
945
| max_stars_repo_name
stringlengths 4
112
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
10
| max_stars_count
float64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
945
| max_issues_repo_name
stringlengths 4
113
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
10
| max_issues_count
float64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
945
| max_forks_repo_name
stringlengths 4
113
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
10
| max_forks_count
float64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 3
1.05M
| avg_line_length
float64 1
966k
| max_line_length
int64 1
977k
| alphanum_fraction
float64 0
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
121401dac017e05887dcbbd030ad31d8c4b09a7d | 5,624 | adb | Ada | awa/plugins/awa-votes/src/awa-votes-modules.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-votes/src/awa-votes-modules.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-votes/src/awa-votes-modules.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-votes-modules -- Module votes
-- Copyright (C) 2013 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.Log.Loggers;
with Security.Permissions;
with AWA.Modules.Beans;
with AWA.Modules.Get;
with AWA.Votes.Beans;
with AWA.Permissions;
with AWA.Services.Contexts;
with AWA.Users.Models;
with AWA.Votes.Models;
with ADO.SQL;
with ADO.Sessions;
with ADO.Sessions.Entities;
package body AWA.Votes.Modules is
use AWA.Services;
use ADO.Sessions;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Votes.Module");
package Register is new AWA.Modules.Beans (Module => Vote_Module,
Module_Access => Vote_Module_Access);
-- ------------------------------
-- Initialize the votes module.
-- ------------------------------
overriding
procedure Initialize (Plugin : in out Vote_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config) is
begin
Log.Info ("Initializing the votes module");
-- Register here any bean class, servlet, filter.
Register.Register (Plugin => Plugin,
Name => "AWA.Votes.Beans.Votes_Bean",
Handler => AWA.Votes.Beans.Create_Vote_Bean'Access);
AWA.Modules.Module (Plugin).Initialize (App, Props);
-- Add here the creation of manager instances.
end Initialize;
-- ------------------------------
-- Get the votes module.
-- ------------------------------
function Get_Vote_Module return Vote_Module_Access is
function Get is new AWA.Modules.Get (Vote_Module, Vote_Module_Access, NAME);
begin
return Get;
end Get_Vote_Module;
-- ------------------------------
-- Vote for the given element and return the total vote for that element.
-- ------------------------------
procedure Vote_For (Model : in Vote_Module;
Id : in ADO.Identifier;
Entity_Type : in String;
Permission : in String;
Value : in Integer;
Total : out Integer) is
pragma Unreferenced (Model);
Ctx : constant Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
User : constant AWA.Users.Models.User_Ref := Ctx.Get_User;
DB : Master_Session := AWA.Services.Contexts.Get_Master_Session (Ctx);
Kind : ADO.Entity_Type;
Rating : AWA.Votes.Models.Rating_Ref;
Vote : AWA.Votes.Models.Vote_Ref;
Query : ADO.SQL.Query;
Found : Boolean;
Ident : constant String := Entity_Type & ADO.Identifier'Image (Id);
begin
-- Check that the user has the vote permission on the given object.
AWA.Permissions.Check (Permission => Security.Permissions.Get_Permission_Index (Permission),
Entity => Id);
Log.Info ("User {0} votes for {1} rating {2}",
ADO.Identifier'Image (User.Get_Id), Ident,
Integer'Image (Value));
Ctx.Start;
Kind := ADO.Sessions.Entities.Find_Entity_Type (DB, Entity_Type);
-- Get the vote associated with the object for the user.
Query.Set_Join ("INNER JOIN awa_rating r ON r.id = o.entity_id");
Query.Set_Filter ("r.for_entity_id = :id and r.for_entity_type = :type "
& "and o.user_id = :user_id");
Query.Bind_Param ("id", Id);
Query.Bind_Param ("type", Kind);
Query.Bind_Param ("user_id", User.Get_Id);
Vote.Find (DB, Query, Found);
if not Found then
Query.Clear;
-- Get the rating associated with the object.
Query.Set_Filter ("for_entity_id = :id and for_entity_type = :type");
Query.Bind_Param ("id", Id);
Query.Bind_Param ("type", Kind);
Rating.Find (DB, Query, Found);
-- Create it if it does not exist.
if not Found then
Log.Info ("Creating rating for {0}", Ident);
Rating.Set_For_Entity_Id (Id);
Rating.Set_For_Entity_Type (Kind);
Rating.Set_Rating (Value);
Rating.Set_Vote_Count (1);
else
Rating.Set_Vote_Count (Rating.Get_Vote_Count + 1);
Rating.Set_Rating (Value + Rating.Get_Rating);
end if;
Rating.Save (DB);
Vote.Set_User (User);
Vote.Set_Entity (Rating);
else
Rating := AWA.Votes.Models.Rating_Ref (Vote.Get_Entity);
Rating.Set_Rating (Rating.Get_Rating + Value - Vote.Get_Rating);
Rating.Save (DB);
end if;
Vote.Set_Rating (Value);
Vote.Save (DB);
-- Return the total rating for the element.
Total := Rating.Get_Rating;
Ctx.Commit;
end Vote_For;
end AWA.Votes.Modules;
| 37 | 98 | 0.580725 |
121ab11a8fdd139702e7c35a55119b31ed1c84eb | 8,753 | adb | Ada | src/gnat/scans.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/gnat/scans.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/gnat/scans.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S C A N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2013, 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 Snames; use Snames;
package body Scans is
-----------------------------
-- Initialize_Ada_Keywords --
-----------------------------
procedure Initialize_Ada_Keywords is
procedure Set_Reserved (N : Name_Id; T : Token_Type);
pragma Inline (Set_Reserved);
-- Set given name as a reserved word (T is the corresponding token)
------------------
-- Set_Reserved --
------------------
procedure Set_Reserved (N : Name_Id; T : Token_Type) is
begin
-- Set up Token_Type values in Names table entries for reserved
-- words. We use the Pos value of the Token_Type value. Note that
-- Is_Keyword_Name relies on the fact that Token_Type'Val (0) is not
-- a reserved word.
Set_Name_Table_Byte (N, Token_Type'Pos (T));
end Set_Reserved;
-- Start of processing for Initialize_Ada_Keywords
begin
-- Establish reserved words
Set_Reserved (Name_Abort, Tok_Abort);
Set_Reserved (Name_Abs, Tok_Abs);
Set_Reserved (Name_Abstract, Tok_Abstract);
Set_Reserved (Name_Accept, Tok_Accept);
Set_Reserved (Name_Access, Tok_Access);
Set_Reserved (Name_And, Tok_And);
Set_Reserved (Name_Aliased, Tok_Aliased);
Set_Reserved (Name_All, Tok_All);
Set_Reserved (Name_Array, Tok_Array);
Set_Reserved (Name_At, Tok_At);
Set_Reserved (Name_Begin, Tok_Begin);
Set_Reserved (Name_Body, Tok_Body);
Set_Reserved (Name_Case, Tok_Case);
Set_Reserved (Name_Constant, Tok_Constant);
Set_Reserved (Name_Declare, Tok_Declare);
Set_Reserved (Name_Delay, Tok_Delay);
Set_Reserved (Name_Delta, Tok_Delta);
Set_Reserved (Name_Digits, Tok_Digits);
Set_Reserved (Name_Do, Tok_Do);
Set_Reserved (Name_Else, Tok_Else);
Set_Reserved (Name_Elsif, Tok_Elsif);
Set_Reserved (Name_End, Tok_End);
Set_Reserved (Name_Entry, Tok_Entry);
Set_Reserved (Name_Exception, Tok_Exception);
Set_Reserved (Name_Exit, Tok_Exit);
Set_Reserved (Name_For, Tok_For);
Set_Reserved (Name_Function, Tok_Function);
Set_Reserved (Name_Generic, Tok_Generic);
Set_Reserved (Name_Goto, Tok_Goto);
Set_Reserved (Name_If, Tok_If);
Set_Reserved (Name_In, Tok_In);
Set_Reserved (Name_Is, Tok_Is);
Set_Reserved (Name_Limited, Tok_Limited);
Set_Reserved (Name_Loop, Tok_Loop);
Set_Reserved (Name_Mod, Tok_Mod);
Set_Reserved (Name_New, Tok_New);
Set_Reserved (Name_Not, Tok_Not);
Set_Reserved (Name_Null, Tok_Null);
Set_Reserved (Name_Of, Tok_Of);
Set_Reserved (Name_Or, Tok_Or);
Set_Reserved (Name_Others, Tok_Others);
Set_Reserved (Name_Out, Tok_Out);
Set_Reserved (Name_Package, Tok_Package);
Set_Reserved (Name_Pragma, Tok_Pragma);
Set_Reserved (Name_Private, Tok_Private);
Set_Reserved (Name_Procedure, Tok_Procedure);
Set_Reserved (Name_Protected, Tok_Protected);
Set_Reserved (Name_Raise, Tok_Raise);
Set_Reserved (Name_Range, Tok_Range);
Set_Reserved (Name_Record, Tok_Record);
Set_Reserved (Name_Rem, Tok_Rem);
Set_Reserved (Name_Renames, Tok_Renames);
Set_Reserved (Name_Requeue, Tok_Requeue);
Set_Reserved (Name_Return, Tok_Return);
Set_Reserved (Name_Reverse, Tok_Reverse);
Set_Reserved (Name_Select, Tok_Select);
Set_Reserved (Name_Separate, Tok_Separate);
Set_Reserved (Name_Subtype, Tok_Subtype);
Set_Reserved (Name_Tagged, Tok_Tagged);
Set_Reserved (Name_Task, Tok_Task);
Set_Reserved (Name_Terminate, Tok_Terminate);
Set_Reserved (Name_Then, Tok_Then);
Set_Reserved (Name_Type, Tok_Type);
Set_Reserved (Name_Until, Tok_Until);
Set_Reserved (Name_Use, Tok_Use);
Set_Reserved (Name_When, Tok_When);
Set_Reserved (Name_While, Tok_While);
Set_Reserved (Name_With, Tok_With);
Set_Reserved (Name_Xor, Tok_Xor);
-- Ada 2005 reserved words
Set_Reserved (Name_Interface, Tok_Interface);
Set_Reserved (Name_Overriding, Tok_Overriding);
Set_Reserved (Name_Synchronized, Tok_Synchronized);
-- Ada 2012 reserved words
Set_Reserved (Name_Some, Tok_Some);
end Initialize_Ada_Keywords;
------------------------
-- Restore_Scan_State --
------------------------
procedure Restore_Scan_State (Saved_State : Saved_Scan_State) is
begin
Scan_Ptr := Saved_State.Save_Scan_Ptr;
Token := Saved_State.Save_Token;
Token_Ptr := Saved_State.Save_Token_Ptr;
Current_Line_Start := Saved_State.Save_Current_Line_Start;
Start_Column := Saved_State.Save_Start_Column;
Checksum := Saved_State.Save_Checksum;
First_Non_Blank_Location := Saved_State.Save_First_Non_Blank_Location;
Token_Node := Saved_State.Save_Token_Node;
Token_Name := Saved_State.Save_Token_Name;
Prev_Token := Saved_State.Save_Prev_Token;
Prev_Token_Ptr := Saved_State.Save_Prev_Token_Ptr;
end Restore_Scan_State;
---------------------
-- Save_Scan_State --
---------------------
procedure Save_Scan_State (Saved_State : out Saved_Scan_State) is
begin
Saved_State.Save_Scan_Ptr := Scan_Ptr;
Saved_State.Save_Token := Token;
Saved_State.Save_Token_Ptr := Token_Ptr;
Saved_State.Save_Current_Line_Start := Current_Line_Start;
Saved_State.Save_Start_Column := Start_Column;
Saved_State.Save_Checksum := Checksum;
Saved_State.Save_First_Non_Blank_Location := First_Non_Blank_Location;
Saved_State.Save_Token_Node := Token_Node;
Saved_State.Save_Token_Name := Token_Name;
Saved_State.Save_Prev_Token := Prev_Token;
Saved_State.Save_Prev_Token_Ptr := Prev_Token_Ptr;
end Save_Scan_State;
end Scans;
| 47.313514 | 78 | 0.552382 |
a139f95336ac3c499ae57c7b12e7ff1da282f7b7 | 4,372 | adb | Ada | samples/asf_volume_server.adb | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | samples/asf_volume_server.adb | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | samples/asf_volume_server.adb | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- asf_volume_server -- The volume_server application with Ada Server Faces
-- Copyright (C) 2010, 2011, 2012, 2015 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.IO_Exceptions;
with ASF.Server.Web;
with ASF.Servlets;
with ASF.Servlets.Faces;
with Servlet.Core.Files;
with Servlet.Core.Measures;
with ASF.Filters.Dump;
with ASF.Beans;
with ASF.Applications;
with ASF.Applications.Main;
with ASF.Applications.Main.Configs;
with Util.Beans.Objects;
with Util.Log.Loggers;
with Countries;
with Volume;
with Messages;
procedure Asf_Volume_Server is
CONTEXT_PATH : constant String := "/volume";
CONFIG_PATH : constant String := "samples.properties";
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Openid");
Factory : ASF.Applications.Main.Application_Factory;
App : aliased ASF.Applications.Main.Application;
Faces : aliased ASF.Servlets.Faces.Faces_Servlet;
Files : aliased Servlet.Core.Files.File_Servlet;
Perf : aliased Servlet.Core.Measures.Measure_Servlet;
Dump : aliased ASF.Filters.Dump.Dump_Filter;
Bean : aliased Volume.Compute_Bean;
Conv : aliased Volume.Float_Converter;
WS : ASF.Server.Web.AWS_Container;
C : ASF.Applications.Config;
None : ASF.Beans.Parameter_Bean_Ref.Ref;
begin
C.Set (ASF.Applications.VIEW_EXT, ".html");
C.Set (ASF.Applications.VIEW_DIR, "samples/web");
C.Set ("web.dir", "samples/web");
begin
C.Load_Properties (CONFIG_PATH);
exception
when Ada.IO_Exceptions.Name_Error =>
Log.Error ("Cannot read application configuration file {0}", CONFIG_PATH);
end;
App.Initialize (C, Factory);
App.Set_Global ("contextPath", CONTEXT_PATH);
App.Set_Global ("compute",
Util.Beans.Objects.To_Object (Bean'Unchecked_Access,
Util.Beans.Objects.STATIC));
App.Set_Global ("countries", Util.Beans.Objects.To_Object (Countries.Create_Country_List));
-- Declare a global bean to identify this sample from within the XHTML files.
App.Set_Global ("sampleName", "volume");
-- Register the servlets and filters
App.Add_Servlet (Name => "faces", Server => Faces'Unchecked_Access);
App.Add_Servlet (Name => "files", Server => Files'Unchecked_Access);
App.Add_Filter (Name => "dump", Filter => Dump'Unchecked_Access);
App.Add_Servlet (Name => "perf", Server => Perf'Unchecked_Access);
App.Add_Filter (Name => "perf", Filter => Perf'Unchecked_Access);
-- Define servlet mappings
App.Add_Mapping (Name => "faces", Pattern => "*.html");
App.Add_Mapping (Name => "files", Pattern => "*.css");
App.Add_Mapping (Name => "files", Pattern => "*.js");
App.Add_Mapping (Name => "files", Pattern => "*.png");
App.Add_Filter_Mapping (Name => "dump", Pattern => "*.html");
App.Add_Filter_Mapping (Name => "dump", Pattern => "*.js");
App.Add_Converter (Name => "float", Converter => Conv'Unchecked_Access);
App.Register_Class (Name => "Message_Bean", Handler => Messages.Create_Message_Bean'Access);
App.Register_Class (Name => "Message_List", Handler => Messages.Create_Message_List'Access);
App.Register (Name => "message", Class => "Message_Bean", Params => None);
App.Register (Name => "messages", Class => "Message_List", Params => None);
ASF.Applications.Main.Configs.Read_Configuration (App, "samples/web/WEB-INF/web.xml");
WS.Register_Application (CONTEXT_PATH, App'Unchecked_Access);
Log.Info ("Connect you browser to: http://localhost:8080/volume/compute.html");
WS.Start;
delay 6000.0;
end Asf_Volume_Server;
| 40.481481 | 95 | 0.675892 |
126fc9271984bdaa5ea2565d3bd71acff874d944 | 137 | adb | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/defining_enumeration_literal.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/defining_enumeration_literal.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/defining_enumeration_literal.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | PROCEDURE defining_enumeration_literal IS
TYPE E1 IS (A, B, C, 'A', 'C', 'B');
BEGIN
NULL;
END defining_enumeration_literal;
| 17.125 | 41 | 0.678832 |
a14459d3339992ed54027176aad680d37ecb8a59 | 5,087 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34002c.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/c3/c34002c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34002c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C34002C.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.
--*
-- FOR DERIVED INTEGER TYPES:
-- CHECK THAT ALL VALUES OF THE PARENT (BASE) TYPE ARE PRESENT FOR THE
-- DERIVED (BASE) TYPE WHEN THE DERIVED TYPE DEFINITION IS
-- CONSTRAINED.
-- CHECK THAT ANY CONSTRAINT IMPOSED ON THE PARENT SUBTYPE IS ALSO
-- IMPOSED ON THE DERIVED SUBTYPE.
-- JRK 8/21/86
WITH REPORT; USE REPORT;
PROCEDURE C34002C IS
TYPE PARENT IS RANGE -100 .. 100;
TYPE T IS NEW PARENT RANGE
PARENT'VAL (IDENT_INT (-30)) ..
PARENT'VAL (IDENT_INT ( 30));
SUBTYPE SUBPARENT IS PARENT RANGE -30 .. 30;
TYPE S IS NEW SUBPARENT;
X : T;
Y : S;
BEGIN
TEST ("C34002C", "CHECK THAT ALL VALUES OF THE PARENT (BASE) " &
"TYPE ARE PRESENT FOR THE DERIVED (BASE) TYPE " &
"WHEN THE DERIVED TYPE DEFINITION IS " &
"CONSTRAINED. ALSO CHECK THAT ANY CONSTRAINT " &
"IMPOSED ON THE PARENT SUBTYPE IS ALSO IMPOSED " &
"ON THE DERIVED SUBTYPE. CHECK FOR DERIVED " &
"INTEGER TYPES");
-- CHECK THAT BASE TYPE VALUES NOT IN THE SUBTYPE ARE PRESENT.
IF T'POS (T'BASE'FIRST) /= PARENT'POS (PARENT'BASE'FIRST) OR
S'POS (S'BASE'FIRST) /= PARENT'POS (PARENT'BASE'FIRST) OR
T'POS (T'BASE'LAST) /= PARENT'POS (PARENT'BASE'LAST) OR
S'POS (S'BASE'LAST) /= PARENT'POS (PARENT'BASE'LAST) THEN
FAILED ("INCORRECT 'BASE'FIRST OR 'BASE'LAST");
END IF;
IF T'PRED (100) /= 99 OR T'SUCC (99) /= 100 OR
S'PRED (100) /= 99 OR S'SUCC (99) /= 100 THEN
FAILED ("INCORRECT 'PRED OR 'SUCC");
END IF;
-- CHECK THE DERIVED SUBTYPE CONSTRAINT.
IF T'FIRST /= -30 OR T'LAST /= 30 OR
S'FIRST /= -30 OR S'LAST /= 30 THEN
FAILED ("INCORRECT 'FIRST OR 'LAST");
END IF;
BEGIN
X := -30;
Y := -30;
IF PARENT (X) /= PARENT (Y) THEN -- USE X AND Y.
FAILED ("INCORRECT CONVERSION TO PARENT - 1");
END IF;
X := 30;
Y := 30;
IF PARENT (X) /= PARENT (Y) THEN -- USE X AND Y.
FAILED ("INCORRECT CONVERSION TO PARENT - 2");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED BY OK ASSIGNMENT");
END;
BEGIN
X := -31;
FAILED ("CONSTRAINT_ERROR NOT RAISED -- X := -31");
IF X = -31 THEN -- USE X.
COMMENT ("X ALTERED -- X := -31");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- X := -31");
END;
BEGIN
X := 31;
FAILED ("CONSTRAINT_ERROR NOT RAISED -- X := 31");
IF X = 31 THEN -- USE X.
COMMENT ("X ALTERED -- X := 31");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- X := 31");
END;
BEGIN
Y := -31;
FAILED ("CONSTRAINT_ERROR NOT RAISED -- Y := -31");
IF Y = -31 THEN -- USE Y.
COMMENT ("Y ALTERED -- Y := -31");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- Y := -31");
END;
BEGIN
Y := 31;
FAILED ("CONSTRAINT_ERROR NOT RAISED -- Y := 31");
IF Y = 31 THEN -- USE Y.
COMMENT ("Y ALTERED -- Y := 31");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- Y := 31");
END;
RESULT;
END C34002C;
| 33.248366 | 79 | 0.541183 |
061c2dc82f8c059140ed075241bb44d2f79dd44f | 13,106 | ads | Ada | stm32f4/stm32f411xx/svd/stm32_svd-gpio.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f4/stm32f411xx/svd/stm32_svd-gpio.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f4/stm32f411xx/svd/stm32_svd-gpio.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 STM32F411xx.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.GPIO is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- MODER array element
subtype MODER_Element is STM32_SVD.UInt2;
-- MODER array
type MODER_Field_Array is array (0 .. 15) of MODER_Element
with Component_Size => 2, Size => 32;
-- GPIO port mode register
type MODER_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODER as a value
Val : STM32_SVD.UInt32;
when True =>
-- MODER as an array
Arr : MODER_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for MODER_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- OTYPER_OT array element
subtype OTYPER_OT_Element is STM32_SVD.Bit;
-- OTYPER_OT array
type OTYPER_OT_Field_Array is array (0 .. 15) of OTYPER_OT_Element
with Component_Size => 1, Size => 16;
-- Type definition for OTYPER_OT
type OTYPER_OT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OT as a value
Val : STM32_SVD.UInt16;
when True =>
-- OT as an array
Arr : OTYPER_OT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for OTYPER_OT_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output type register
type OTYPER_Register is record
-- Port x configuration bits (y = 0..15)
OT : OTYPER_OT_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OTYPER_Register use record
OT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- OSPEEDR array element
subtype OSPEEDR_Element is STM32_SVD.UInt2;
-- OSPEEDR array
type OSPEEDR_Field_Array is array (0 .. 15) of OSPEEDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port output speed register
type OSPEEDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OSPEEDR as a value
Val : STM32_SVD.UInt32;
when True =>
-- OSPEEDR as an array
Arr : OSPEEDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for OSPEEDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PUPDR array element
subtype PUPDR_Element is STM32_SVD.UInt2;
-- PUPDR array
type PUPDR_Field_Array is array (0 .. 15) of PUPDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port pull-up/pull-down register
type PUPDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PUPDR as a value
Val : STM32_SVD.UInt32;
when True =>
-- PUPDR as an array
Arr : PUPDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for PUPDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- IDR array element
subtype IDR_Element is STM32_SVD.Bit;
-- IDR array
type IDR_Field_Array is array (0 .. 15) of IDR_Element
with Component_Size => 1, Size => 16;
-- Type definition for IDR
type IDR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDR as a value
Val : STM32_SVD.UInt16;
when True =>
-- IDR as an array
Arr : IDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port input data register
type IDR_Register is record
-- Read-only. Port input data (y = 0..15)
IDR : IDR_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDR_Register use record
IDR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- ODR array element
subtype ODR_Element is STM32_SVD.Bit;
-- ODR array
type ODR_Field_Array is array (0 .. 15) of ODR_Element
with Component_Size => 1, Size => 16;
-- Type definition for ODR
type ODR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ODR as a value
Val : STM32_SVD.UInt16;
when True =>
-- ODR as an array
Arr : ODR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for ODR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output data register
type ODR_Register is record
-- Port output data (y = 0..15)
ODR : ODR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ODR_Register use record
ODR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- BSRR_BS array element
subtype BSRR_BS_Element is STM32_SVD.Bit;
-- BSRR_BS array
type BSRR_BS_Field_Array is array (0 .. 15) of BSRR_BS_Element
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BS
type BSRR_BS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BS as a value
Val : STM32_SVD.UInt16;
when True =>
-- BS as an array
Arr : BSRR_BS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BS_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- BSRR_BR array element
subtype BSRR_BR_Element is STM32_SVD.Bit;
-- BSRR_BR array
type BSRR_BR_Field_Array is array (0 .. 15) of BSRR_BR_Element
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BR
type BSRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : STM32_SVD.UInt16;
when True =>
-- BR as an array
Arr : BSRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit set/reset register
type BSRR_Register is record
-- Write-only. Port x set bit y (y= 0..15)
BS : BSRR_BS_Field := (As_Array => False, Val => 16#0#);
-- Write-only. Port x set bit y (y= 0..15)
BR : BSRR_BR_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSRR_Register use record
BS at 0 range 0 .. 15;
BR at 0 range 16 .. 31;
end record;
-- LCKR_LCK array element
subtype LCKR_LCK_Element is STM32_SVD.Bit;
-- LCKR_LCK array
type LCKR_LCK_Field_Array is array (0 .. 15) of LCKR_LCK_Element
with Component_Size => 1, Size => 16;
-- Type definition for LCKR_LCK
type LCKR_LCK_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- LCK as a value
Val : STM32_SVD.UInt16;
when True =>
-- LCK as an array
Arr : LCKR_LCK_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for LCKR_LCK_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
subtype LCKR_LCKK_Field is STM32_SVD.Bit;
-- GPIO port configuration lock register
type LCKR_Register is record
-- Port x lock bit y (y= 0..15)
LCK : LCKR_LCK_Field := (As_Array => False, Val => 16#0#);
-- Port x lock bit y (y= 0..15)
LCKK : LCKR_LCKK_Field := 16#0#;
-- unspecified
Reserved_17_31 : STM32_SVD.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LCKR_Register use record
LCK at 0 range 0 .. 15;
LCKK at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- AFRL array element
subtype AFRL_Element is STM32_SVD.UInt4;
-- AFRL array
type AFRL_Field_Array is array (0 .. 7) of AFRL_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function low register
type AFRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRL as a value
Val : STM32_SVD.UInt32;
when True =>
-- AFRL as an array
Arr : AFRL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for AFRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- AFRH array element
subtype AFRH_Element is STM32_SVD.UInt4;
-- AFRH array
type AFRH_Field_Array is array (8 .. 15) of AFRH_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function high register
type AFRH_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRH as a value
Val : STM32_SVD.UInt32;
when True =>
-- AFRH as an array
Arr : AFRH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for AFRH_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- General-purpose I/Os
type GPIO_Peripheral is record
-- GPIO port mode register
MODER : aliased MODER_Register;
-- GPIO port output type register
OTYPER : aliased OTYPER_Register;
-- GPIO port output speed register
OSPEEDR : aliased OSPEEDR_Register;
-- GPIO port pull-up/pull-down register
PUPDR : aliased PUPDR_Register;
-- GPIO port input data register
IDR : aliased IDR_Register;
-- GPIO port output data register
ODR : aliased ODR_Register;
-- GPIO port bit set/reset register
BSRR : aliased BSRR_Register;
-- GPIO port configuration lock register
LCKR : aliased LCKR_Register;
-- GPIO alternate function low register
AFRL : aliased AFRL_Register;
-- GPIO alternate function high register
AFRH : aliased AFRH_Register;
end record
with Volatile;
for GPIO_Peripheral use record
MODER at 16#0# range 0 .. 31;
OTYPER at 16#4# range 0 .. 31;
OSPEEDR at 16#8# range 0 .. 31;
PUPDR at 16#C# range 0 .. 31;
IDR at 16#10# range 0 .. 31;
ODR at 16#14# range 0 .. 31;
BSRR at 16#18# range 0 .. 31;
LCKR at 16#1C# range 0 .. 31;
AFRL at 16#20# range 0 .. 31;
AFRH at 16#24# range 0 .. 31;
end record;
-- General-purpose I/Os
GPIOA_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40020000#);
-- General-purpose I/Os
GPIOB_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40020400#);
-- General-purpose I/Os
GPIOC_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40020800#);
-- General-purpose I/Os
GPIOD_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40020C00#);
-- General-purpose I/Os
GPIOE_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40021000#);
-- General-purpose I/Os
GPIOH_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#40021C00#);
end STM32_SVD.GPIO;
| 28.184946 | 76 | 0.596521 |
d01296e9bdc546a8aa33ace57388e484295d17c0 | 13,050 | ads | Ada | source/xml/sax/matreshka-internals-xml-entity_tables.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/xml/sax/matreshka-internals-xml-entity_tables.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/xml/sax/matreshka-internals-xml-entity_tables.ads | 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 © 2010-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$
------------------------------------------------------------------------------
with League.Strings;
with Matreshka.Internals.Strings;
with Matreshka.Internals.Utf16;
package Matreshka.Internals.XML.Entity_Tables is
pragma Preelaborate;
type Entity_Table is limited private;
procedure New_Internal_Parameter_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Name : Matreshka.Internals.XML.Symbol_Identifier;
Replacement_Text :
not null Matreshka.Internals.Strings.Shared_String_Access;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_External_Parameter_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Name : Matreshka.Internals.XML.Symbol_Identifier;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Enclosing_Base_URI : League.Strings.Universal_String;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_Internal_General_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Name : Matreshka.Internals.XML.Symbol_Identifier;
Replacement_Text :
not null Matreshka.Internals.Strings.Shared_String_Access;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_External_Parsed_General_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Name : Matreshka.Internals.XML.Symbol_Identifier;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Enclosing_Base_URI : League.Strings.Universal_String;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_External_Unparsed_General_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Name : Matreshka.Internals.XML.Symbol_Identifier;
Notation : Symbol_Identifier;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_Document_Entity
(Self : in out Entity_Table;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Entity_Base_URI : League.Strings.Universal_String;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
procedure New_External_Subset_Entity
(Self : in out Entity_Table;
Enclosing_Entity : Entity_Identifier;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Enclosing_Base_URI : League.Strings.Universal_String;
Entity : out Entity_Identifier);
-- Allocates space for the entity and returns identifier of the allocated
-- entity.
function Is_Document_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is document entity.
function Is_External_Subset
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is enternal subset of the DTD.
function Is_Internal_General_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is internal general entity.
function Is_External_Parsed_General_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is external parsed general entity.
function Is_External_Unparsed_General_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is external unparsed general entity.
function Is_Parameter_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is parameter entity (internal or external).
function Is_Parsed_General_Entity
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is parsed general entity (internal or
-- external).
function Name
(Self : Entity_Table;
Entity : Entity_Identifier)
return Matreshka.Internals.XML.Symbol_Identifier;
function Enclosing_Entity
(Self : Entity_Table;
Entity : Entity_Identifier)
return Matreshka.Internals.XML.Entity_Identifier;
-- Returns entity which contains declaration of the entity.
function Public_Id
(Self : Entity_Table;
Entity : Entity_Identifier)
return not null Matreshka.Internals.Strings.Shared_String_Access;
function System_Id
(Self : Entity_Table;
Entity : Entity_Identifier)
return not null Matreshka.Internals.Strings.Shared_String_Access;
function Notation
(Self : Entity_Table;
Entity : Entity_Identifier)
return Matreshka.Internals.XML.Symbol_Identifier;
-- Returns identifier of notation of the entity for unparsed entity and
-- No_Symbol for others.
function Enclosing_Base_URI
(Self : Entity_Table;
Entity : Entity_Identifier)
return not null Matreshka.Internals.Strings.Shared_String_Access;
-- Returns base URI of entity's declaration element to be used to resolve
-- relative entity's system identifier.
function Entity_Base_URI
(Self : Entity_Table;
Entity : Entity_Identifier)
return not null Matreshka.Internals.Strings.Shared_String_Access;
-- Returns base URI of the entity.
procedure Set_Entity_Base_URI
(Self : in out Entity_Table;
Entity : Entity_Identifier;
Entity_Base_URI : League.Strings.Universal_String);
-- Sets base URI of the entity.
function Is_Resolved
(Self : Entity_Table;
Entity : Entity_Identifier) return Boolean;
-- Returns True when entity is marked as resolved.
procedure Set_Is_Resolved
(Self : in out Entity_Table;
Entity : Entity_Identifier;
To : Boolean);
-- Mark entity as resolved.
function Replacement_Text
(Self : Entity_Table;
Entity : Entity_Identifier)
return Matreshka.Internals.Strings.Shared_String_Access;
-- Returns entity's replacement text.
procedure Set_Replacement_Text
(Self : in out Entity_Table;
Entity : Entity_Identifier;
Replacement_Text :
not null Matreshka.Internals.Strings.Shared_String_Access);
-- Sets replacement text for the entity.
function First_Position
(Self : Entity_Table;
Entity : Entity_Identifier)
return Matreshka.Internals.Utf16.Utf16_String_Index;
-- Returns position of the first significant character after the text
-- declaration if any; otherwise returns zero.
procedure Set_First_Position
(Self : in out Entity_Table;
Entity : Entity_Identifier;
Position : Matreshka.Internals.Utf16.Utf16_String_Index);
-- Sets position of the first significant character after the text
-- declaration if any.
procedure Initialize (Self : in out Entity_Table);
-- Initializes entity table.
procedure Finalize (Self : in out Entity_Table);
-- Finalizes entity table.
procedure Reset (Self : in out Entity_Table);
-- Resets internal structures to initial state.
function First_Entity (Self : Entity_Table) return Entity_Identifier;
-- Returns first entity.
procedure Next_Entity
(Self : Entity_Table;
Entity : in out Entity_Identifier);
-- Sets Entity to next entity identifier or to No_Entity.
private
type Entity_Kinds is
(Document_Entity,
External_Subset_Entity,
Internal_Parameter_Entity,
External_Parameter_Entity,
Internal_General_Entity,
External_Parsed_General_Entity,
External_Unparsed_General_Entity);
type Entity_Record is record
Kind : Entity_Kinds;
Enclosing : Entity_Identifier;
Name : Symbol_Identifier;
Notation : Symbol_Identifier;
Public_Id : Matreshka.Internals.Strings.Shared_String_Access;
System_Id : Matreshka.Internals.Strings.Shared_String_Access;
Enclosing_Base_URI : Matreshka.Internals.Strings.Shared_String_Access;
Entity_Base_URI : Matreshka.Internals.Strings.Shared_String_Access;
Is_Resolved : Boolean;
Replacement_Text : Matreshka.Internals.Strings.Shared_String_Access;
First_Position : Matreshka.Internals.Utf16.Utf16_String_Index;
end record;
type Entity_Array is array (Entity_Identifier range <>) of Entity_Record;
type Entity_Array_Access is access all Entity_Array;
type Entity_Table is limited record
Data : Entity_Array_Access;
Last : Entity_Identifier := 0;
end record;
pragma Inline (First_Entity);
pragma Inline (Is_Document_Entity);
pragma Inline (Is_External_Subset);
pragma Inline (Is_Parameter_Entity);
pragma Inline (Is_Internal_General_Entity);
pragma Inline (Is_External_Parsed_General_Entity);
pragma Inline (Is_External_Unparsed_General_Entity);
pragma Inline (Next_Entity);
end Matreshka.Internals.XML.Entity_Tables;
| 42.647059 | 78 | 0.622682 |
fbbf717b0943fbe6ec57685caac1fb0a915134e4 | 1,667 | ads | Ada | src/fltk-widgets-valuators-sliders-value.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-valuators-sliders-value.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-valuators-sliders-value.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
package FLTK.Widgets.Valuators.Sliders.Value is
type Value_Slider is new Slider with private;
type Value_Slider_Reference (Data : not null access Value_Slider'Class) is
limited null record with Implicit_Dereference => Data;
package Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Value_Slider;
end Forge;
function Get_Text_Color
(This : in Value_Slider)
return Color;
procedure Set_Text_Color
(This : in out Value_Slider;
To : in Color);
function Get_Text_Font
(This : in Value_Slider)
return Font_Kind;
procedure Set_Text_Font
(This : in out Value_Slider;
To : in Font_Kind);
function Get_Text_Size
(This : in Value_Slider)
return Font_Size;
procedure Set_Text_Size
(This : in out Value_Slider;
To : in Font_Size);
procedure Draw
(This : in out Value_Slider);
function Handle
(This : in out Value_Slider;
Event : in Event_Kind)
return Event_Outcome;
private
type Value_Slider is new Slider with null record;
overriding procedure Finalize
(This : in out Value_Slider);
pragma Inline (Get_Text_Color);
pragma Inline (Set_Text_Color);
pragma Inline (Get_Text_Font);
pragma Inline (Set_Text_Font);
pragma Inline (Get_Text_Size);
pragma Inline (Set_Text_Size);
pragma Inline (Draw);
pragma Inline (Handle);
end FLTK.Widgets.Valuators.Sliders.Value;
| 19.16092 | 78 | 0.606479 |
12021e2787b811dc653df4346bd7b576922b6597 | 1,461 | adb | Ada | src/adacar-alarmas.adb | Asier98/AdaCar | 1faaed09842c0c3573f359f049f559d97ccfe454 | [
"MIT"
] | null | null | null | src/adacar-alarmas.adb | Asier98/AdaCar | 1faaed09842c0c3573f359f049f559d97ccfe454 | [
"MIT"
] | null | null | null | src/adacar-alarmas.adb | Asier98/AdaCar | 1faaed09842c0c3573f359f049f559d97ccfe454 | [
"MIT"
] | null | null | null | with Ada.Real_Time; use type Ada.Real_Time.Time; use Ada;
with AdaCar.Parametros;
package body AdaCar.Alarmas is
type Lista_Alarmas is array(Tipo_Alarmas) of Estado_Alarma;
protected Alarmas_PO
with Priority => Parametros.Techo_Alarmas_PO
is
procedure Notificar_Alarma(Alarma: Tipo_Alarmas);
function Leer_Listado_Alarmas return Lista_Alarmas;
private
Listado_Alarmas: Lista_Alarmas:= (Tipo_Alarmas'Range=>
Estado_Alarma'(Desactivada));
end Alarmas_PO;
----------------------
-- Notificar_Alarma --
----------------------
procedure Notificar_Alarma (Alarma : Tipo_Alarmas) is
begin
Alarmas_PO.Notificar_Alarma(Alarma);
end Notificar_Alarma;
task Alarmas_Task with Priority => Parametros.Prioridad_Alarmas_Task;
protected body Alarmas_PO is
procedure Notificar_Alarma(Alarma: Tipo_Alarmas) is
begin
Listado_Alarmas(Alarma):= Estado_Alarma'(Activada);
end Notificar_Alarma;
function Leer_Listado_Alarmas return Lista_Alarmas is
begin
return Listado_Alarmas;
end Leer_Listado_Alarmas;
end Alarmas_PO;
task body Alarmas_Task is
Tseg: constant Duration:= Parametros.Periodo_Alarmas_Task;
Periodo: constant Real_Time.Time_Span:= Real_Time.To_Time_Span(Tseg);
Next: Real_Time.Time:= Real_Time.Clock;
begin
null;
end Alarmas_Task;
end AdaCar.Alarmas;
| 25.189655 | 75 | 0.687885 |
50130836f64cb57848279a74a7714734c431d8c4 | 12,786 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-digemk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-digemk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-digemk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . G E N E R I C _ M K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-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. --
-- --
------------------------------------------------------------------------------
-- Defines the MKS dimension system which is the SI system of units
-- Some other prefixes of this system are defined in a child package (see
-- System.Dim.Generic_Mks.Generic_Other_Prefixes) in order to avoid too many
-- constant declarations in this package.
-- The dimension terminology is defined in System.Dim package
with Ada.Numerics;
generic
type Float_Type is digits <>;
package System.Dim.Generic_Mks is
e : constant := Ada.Numerics.e;
Pi : constant := Ada.Numerics.Pi;
-- Dimensioned type Mks_Type
type Mks_Type is new Float_Type
with
Dimension_System => (
(Unit_Name => Meter, Unit_Symbol => 'm', Dim_Symbol => 'L'),
(Unit_Name => Kilogram, Unit_Symbol => "kg", Dim_Symbol => 'M'),
(Unit_Name => Second, Unit_Symbol => 's', Dim_Symbol => 'T'),
(Unit_Name => Ampere, Unit_Symbol => 'A', Dim_Symbol => 'I'),
(Unit_Name => Kelvin, Unit_Symbol => 'K', Dim_Symbol => '@'),
(Unit_Name => Mole, Unit_Symbol => "mol", Dim_Symbol => 'N'),
(Unit_Name => Candela, Unit_Symbol => "cd", Dim_Symbol => 'J'));
-- SI Base dimensioned subtypes
subtype Length is Mks_Type
with
Dimension => (Symbol => 'm',
Meter => 1,
others => 0);
subtype Mass is Mks_Type
with
Dimension => (Symbol => "kg",
Kilogram => 1,
others => 0);
subtype Time is Mks_Type
with
Dimension => (Symbol => 's',
Second => 1,
others => 0);
subtype Electric_Current is Mks_Type
with
Dimension => (Symbol => 'A',
Ampere => 1,
others => 0);
subtype Thermodynamic_Temperature is Mks_Type
with
Dimension => (Symbol => 'K',
Kelvin => 1,
others => 0);
subtype Amount_Of_Substance is Mks_Type
with
Dimension => (Symbol => "mol",
Mole => 1,
others => 0);
subtype Luminous_Intensity is Mks_Type
with
Dimension => (Symbol => "cd",
Candela => 1,
others => 0);
-- Initialize SI Base unit values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes (we can't assign 1.0*m to m).
pragma Warnings (Off, "*assumed to be*");
m : constant Length := 1.0;
kg : constant Mass := 1.0;
s : constant Time := 1.0;
A : constant Electric_Current := 1.0;
K : constant Thermodynamic_Temperature := 1.0;
mol : constant Amount_Of_Substance := 1.0;
cd : constant Luminous_Intensity := 1.0;
pragma Warnings (On, "*assumed to be*");
-- SI Derived dimensioned subtypes
subtype Absorbed_Dose is Mks_Type
with
Dimension => (Symbol => "Gy",
Meter => 2,
Second => -2,
others => 0);
subtype Angle is Mks_Type
with
Dimension => (Symbol => "rad",
others => 0);
subtype Area is Mks_Type
with
Dimension => (
Meter => 2,
others => 0);
subtype Catalytic_Activity is Mks_Type
with
Dimension => (Symbol => "kat",
Second => -1,
Mole => 1,
others => 0);
subtype Celsius_Temperature is Mks_Type
with
Dimension => (Symbol => "°C",
Kelvin => 1,
others => 0);
subtype Electric_Capacitance is Mks_Type
with
Dimension => (Symbol => 'F',
Meter => -2,
Kilogram => -1,
Second => 4,
Ampere => 2,
others => 0);
subtype Electric_Charge is Mks_Type
with
Dimension => (Symbol => 'C',
Second => 1,
Ampere => 1,
others => 0);
subtype Electric_Conductance is Mks_Type
with
Dimension => (Symbol => 'S',
Meter => -2,
Kilogram => -1,
Second => 3,
Ampere => 2,
others => 0);
subtype Electric_Potential_Difference is Mks_Type
with
Dimension => (Symbol => 'V',
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -1,
others => 0);
-- Note the type punning below. The Symbol is a single "ohm" character
-- encoded in UTF-8 (ce a9 in hexadecimal), but this file is not compiled
-- with -gnatW8, so we're treating the string literal as a two-character
-- String.
subtype Electric_Resistance is Mks_Type
with
Dimension => (Symbol => "Ω",
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -2,
others => 0);
subtype Energy is Mks_Type
with
Dimension => (Symbol => 'J',
Meter => 2,
Kilogram => 1,
Second => -2,
others => 0);
subtype Equivalent_Dose is Mks_Type
with
Dimension => (Symbol => "Sv",
Meter => 2,
Second => -2,
others => 0);
subtype Force is Mks_Type
with
Dimension => (Symbol => 'N',
Meter => 1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Frequency is Mks_Type
with
Dimension => (Symbol => "Hz",
Second => -1,
others => 0);
subtype Illuminance is Mks_Type
with
Dimension => (Symbol => "lx",
Meter => -2,
Candela => 1,
others => 0);
subtype Inductance is Mks_Type
with
Dimension => (Symbol => 'H',
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -2,
others => 0);
subtype Luminous_Flux is Mks_Type
with
Dimension => (Symbol => "lm",
Candela => 1,
others => 0);
subtype Magnetic_Flux is Mks_Type
with
Dimension => (Symbol => "Wb",
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Magnetic_Flux_Density is Mks_Type
with
Dimension => (Symbol => 'T',
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Power is Mks_Type
with
Dimension => (Symbol => 'W',
Meter => 2,
Kilogram => 1,
Second => -3,
others => 0);
subtype Pressure is Mks_Type
with
Dimension => (Symbol => "Pa",
Meter => -1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Radioactivity is Mks_Type
with
Dimension => (Symbol => "Bq",
Second => -1,
others => 0);
subtype Solid_Angle is Mks_Type
with
Dimension => (Symbol => "sr",
others => 0);
subtype Speed is Mks_Type
with
Dimension => (
Meter => 1,
Second => -1,
others => 0);
subtype Volume is Mks_Type
with
Dimension => (
Meter => 3,
others => 0);
-- Initialize derived dimension values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes.
pragma Warnings (Off, "*assumed to be*");
rad : constant Angle := 1.0;
sr : constant Solid_Angle := 1.0;
Hz : constant Frequency := 1.0;
N : constant Force := 1.0;
Pa : constant Pressure := 1.0;
J : constant Energy := 1.0;
W : constant Power := 1.0;
C : constant Electric_Charge := 1.0;
V : constant Electric_Potential_Difference := 1.0;
F : constant Electric_Capacitance := 1.0;
Ohm : constant Electric_Resistance := 1.0;
Si : constant Electric_Conductance := 1.0;
Wb : constant Magnetic_Flux := 1.0;
T : constant Magnetic_Flux_Density := 1.0;
H : constant Inductance := 1.0;
dC : constant Celsius_Temperature := 273.15;
lm : constant Luminous_Flux := 1.0;
lx : constant Illuminance := 1.0;
Bq : constant Radioactivity := 1.0;
Gy : constant Absorbed_Dose := 1.0;
Sv : constant Equivalent_Dose := 1.0;
kat : constant Catalytic_Activity := 1.0;
-- SI prefixes for Meter
um : constant Length := 1.0E-06; -- micro (u)
mm : constant Length := 1.0E-03; -- milli
cm : constant Length := 1.0E-02; -- centi
dm : constant Length := 1.0E-01; -- deci
dam : constant Length := 1.0E+01; -- deka
hm : constant Length := 1.0E+02; -- hecto
km : constant Length := 1.0E+03; -- kilo
Mem : constant Length := 1.0E+06; -- mega
-- SI prefixes for Kilogram
ug : constant Mass := 1.0E-09; -- micro (u)
mg : constant Mass := 1.0E-06; -- milli
cg : constant Mass := 1.0E-05; -- centi
dg : constant Mass := 1.0E-04; -- deci
g : constant Mass := 1.0E-03; -- gram
dag : constant Mass := 1.0E-02; -- deka
hg : constant Mass := 1.0E-01; -- hecto
Meg : constant Mass := 1.0E+03; -- mega
-- SI prefixes for Second
us : constant Time := 1.0E-06; -- micro (u)
ms : constant Time := 1.0E-03; -- milli
cs : constant Time := 1.0E-02; -- centi
ds : constant Time := 1.0E-01; -- deci
das : constant Time := 1.0E+01; -- deka
hs : constant Time := 1.0E+02; -- hecto
ks : constant Time := 1.0E+03; -- kilo
Mes : constant Time := 1.0E+06; -- mega
-- Other constants for Second
min : constant Time := 60.0 * s;
hour : constant Time := 60.0 * min;
day : constant Time := 24.0 * hour;
year : constant Time := 365.25 * day;
-- SI prefixes for Ampere
mA : constant Electric_Current := 1.0E-03; -- milli
cA : constant Electric_Current := 1.0E-02; -- centi
dA : constant Electric_Current := 1.0E-01; -- deci
daA : constant Electric_Current := 1.0E+01; -- deka
hA : constant Electric_Current := 1.0E+02; -- hecto
kA : constant Electric_Current := 1.0E+03; -- kilo
MeA : constant Electric_Current := 1.0E+06; -- mega
pragma Warnings (On, "*assumed to be*");
end System.Dim.Generic_Mks;
| 32.206549 | 78 | 0.494603 |
12e7170c232fe9cabb84b689eeaa515fccb8f5bb | 10,279 | ads | Ada | src/arch/cores/armv7-m/m4-scb.ads | vdh-anssi/ewok-kernel | 9a88dcae16659c212c4123b7a9272c9dfa51f85a | [
"Apache-2.0"
] | 65 | 2018-09-26T09:10:11.000Z | 2022-01-30T21:17:37.000Z | src/arch/cores/armv7-m/m4-scb.ads | vdh-anssi/ewok-kernel | 9a88dcae16659c212c4123b7a9272c9dfa51f85a | [
"Apache-2.0"
] | 22 | 2019-04-07T15:15:54.000Z | 2020-10-15T12:45:54.000Z | src/arch/cores/armv7-m/m4-scb.ads | vdh-anssi/ewok-kernel | 9a88dcae16659c212c4123b7a9272c9dfa51f85a | [
"Apache-2.0"
] | 10 | 2018-09-27T09:43:08.000Z | 2021-01-29T22:50:17.000Z | --
-- 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 ada.unchecked_conversion;
with m4.layout;
package m4.scb
with spark_mode => on
is
------------------------------------------
-- Interrupt Control and State Register --
------------------------------------------
-- Provides software control of the NMI, PendSV, and SysTick exceptions, and
-- provides interrupt status information (ARMv7-M Arch. Ref. Manual, p.655).
type t_SCB_ICSR is record
VECTACTIVE : bits_9;
RETTOBASE : bit;
VECTPENDING : bits_10;
ISRPENDING : boolean;
PENDSTCLR : bit;
PENDSTSET : bit;
PENDSVCLR : bit;
PENDSVSET : bit;
NMIPENDSET : bit;
end record
with size => 32;
for t_SCB_ICSR use record
VECTACTIVE at 0 range 0 .. 8;
RETTOBASE at 0 range 11 .. 11;
VECTPENDING at 0 range 12 .. 21;
ISRPENDING at 0 range 22 .. 22;
PENDSTCLR at 0 range 25 .. 25;
PENDSTSET at 0 range 26 .. 26;
PENDSVCLR at 0 range 27 .. 27;
PENDSVSET at 0 range 28 .. 28;
NMIPENDSET at 0 range 31 .. 31;
end record;
------------------------------------------------------
-- Application interrupt and reset control register --
------------------------------------------------------
type t_SCB_AIRCR is record
VECTKEY : unsigned_16;
ENDIANESS : bit;
reserved_11_14 : bits_4;
PRIGROUP : bits_3;
reserved_3_7 : bits_5;
SYSRESETREQ : bit;
VECTCLRACTIVE : bit;
VECTRESET : bit;
end record
with size => 32;
for t_SCB_AIRCR use record
VECTKEY at 0 range 16 .. 31;
ENDIANESS at 0 range 15 .. 15;
reserved_11_14 at 0 range 11 .. 14;
PRIGROUP at 0 range 8 .. 10;
reserved_3_7 at 0 range 3 .. 7;
SYSRESETREQ at 0 range 2 .. 2;
VECTCLRACTIVE at 0 range 1 .. 1;
VECTRESET at 0 range 0 .. 0;
end record;
----------------------------------------------
-- Configuration and control register (CCR) --
----------------------------------------------
-- The CCR controls entry to Thread mode
type t_SCB_CCR is record
NONBASETHRDENA : boolean; -- If true, processor can enter Thread mode
-- from any level under the control of an
-- EXC_RETURN
USERSETMPEND : boolean;
UNALIGN_TRP : boolean;
DIV_0_TRP : boolean;
BFHFNMIGN : boolean;
STKALIGN : boolean;
end record
with size => 32;
for t_SCB_CCR use record
NONBASETHRDENA at 0 range 0 .. 0;
USERSETMPEND at 0 range 1 .. 1;
UNALIGN_TRP at 0 range 3 .. 3;
DIV_0_TRP at 0 range 4 .. 4;
BFHFNMIGN at 0 range 8 .. 8;
STKALIGN at 0 range 9 .. 9;
end record;
-----------------------------------------------
-- System handler priority registers (SHPRx) --
-----------------------------------------------
type t_priority is record
reserved : bits_4;
priority : bits_4;
end record
with pack, size => 8;
-- SHPR1
type t_SCB_SHPR1 is record
mem_fault : t_priority;
bus_fault : t_priority;
usage_fault : t_priority;
end record
with size => 32;
for t_SCB_SHPR1 use record
mem_fault at 0 range 0 .. 7;
bus_fault at 0 range 8 .. 15;
usage_fault at 0 range 16 .. 23;
end record;
-- SHPR2
type t_SCB_SHPR2 is record
svc_call : t_priority;
end record
with size => 32;
for t_SCB_SHPR2 use record
svc_call at 0 range 24 .. 31;
end record;
-- SHPR3
type t_SCB_SHPR3 is record
pendsv : t_priority;
systick : t_priority;
end record
with size => 32;
for t_SCB_SHPR3 use record
pendsv at 0 range 16 .. 23;
systick at 0 range 24 .. 31;
end record;
-----------------------------------------------
-- System Handler Control and State Register --
-----------------------------------------------
type t_SCB_SHCSR is record
MEMFAULTACT : boolean; -- MemManage exception active
BUSFAULTACT : boolean; -- BusFault exception active
reserved_3 : bit;
USGFAULTACT : boolean; -- UsageFault exception active
reserved_4_6 : bits_3;
SVCALLACT : boolean; -- SVCall active
MONITORACT : boolean; -- Debug monitor active
reserved_9 : bit;
PENDSVACT : boolean; -- PendSV exception active
SYSTICKACT : boolean; -- SysTick exception active
USGFAULTPENDED : boolean; -- UsageFault pending
MEMFAULTPENDED : boolean; -- MemManage pending
BUSFAULTPENDED : boolean; -- BusFault pending
SVCALLPENDED : boolean; -- SVCall pending
MEMFAULTENA : boolean; -- MemManage enable
BUSFAULTENA : boolean; -- BusFault enable
USGFAULTENA : boolean; -- UsageFault enable
end record
with size => 32;
for t_SCB_SHCSR use record
MEMFAULTACT at 0 range 0 .. 0;
BUSFAULTACT at 0 range 1 .. 1;
reserved_3 at 0 range 2 .. 2;
USGFAULTACT at 0 range 3 .. 3;
reserved_4_6 at 0 range 4 .. 6;
SVCALLACT at 0 range 7 .. 7;
MONITORACT at 0 range 8 .. 8;
reserved_9 at 0 range 9 .. 9;
PENDSVACT at 0 range 10 .. 10;
SYSTICKACT at 0 range 11 .. 11;
USGFAULTPENDED at 0 range 12 .. 12;
MEMFAULTPENDED at 0 range 13 .. 13;
BUSFAULTPENDED at 0 range 14 .. 14;
SVCALLPENDED at 0 range 15 .. 15;
MEMFAULTENA at 0 range 16 .. 16;
BUSFAULTENA at 0 range 17 .. 17;
USGFAULTENA at 0 range 18 .. 18;
end record;
----------------------------------------
-- Configurable Fault Status Register --
----------------------------------------
--
-- Memory Management Fault Status Register
--
type t_MMFSR is record
IACCVIOL : boolean;
DACCVIOL : boolean;
reserved_2 : bit;
MUNSTKERR : boolean;
MSTKERR : boolean;
MLSPERR : boolean;
reserved_6 : bit;
MMARVALID : boolean;
end record
with size => 8;
pragma pack (t_MMFSR);
--
-- Bus Fault Status Register
--
type t_BFSR is record
IBUSERR : boolean;
PRECISERR : boolean;
IMPRECISERR : boolean;
UNSTKERR : boolean;
STKERR : boolean;
LSPERR : boolean;
reserved_6 : bit;
BFARVALID : boolean;
end record
with size => 8;
pragma pack (t_BFSR);
--
-- Usage Fault Status Register
--
type t_UFSR is record
UNDEFINSTR : boolean;
INVSTATE : boolean;
INVPC : boolean;
NOCP : boolean;
UNALIGNED : boolean;
DIVBYZERO : boolean;
end record
with size => 16;
for t_UFSR use record
UNDEFINSTR at 0 range 0 .. 0;
INVSTATE at 0 range 1 .. 1;
INVPC at 0 range 2 .. 2;
NOCP at 0 range 3 .. 3;
UNALIGNED at 0 range 8 .. 8;
DIVBYZERO at 0 range 9 .. 9;
end record;
type t_SCB_CFSR is record
MMFSR : t_MMFSR;
BFSR : t_BFSR;
UFSR : t_UFSR;
end record
with size => 32;
function to_unsigned_32 is new ada.unchecked_conversion
(t_SCB_CFSR, unsigned_32);
--------------------------------
-- Hard fault status register --
--------------------------------
type t_SCB_HFSR is record
VECTTBL : boolean; -- Vector table hard fault
FORCED : boolean; -- Forced hard fault
DEBUG_VT : bit; -- Reserved for Debug use
end record
with size => 32;
for t_SCB_HFSR use record
VECTTBL at 0 range 1 .. 1;
FORCED at 0 range 30 .. 30;
DEBUG_VT at 0 range 31 .. 31;
end record;
--------------------------------------
-- MemManage Fault Address Register --
--------------------------------------
type t_SCB_MMFAR is record
ADDRESS : system_address;
end record
with size => 32;
--------------------------------
-- Bus Fault Address Register --
--------------------------------
type t_SCB_BFAR is record
ADDRESS : system_address;
end record
with size => 32;
--------------------
-- SCB peripheral --
--------------------
-- /!\ ACTLR register is not in the same record
type t_SCB_peripheral is record
ICSR : t_SCB_ICSR;
VTOR : system_address;
AIRCR : t_SCB_AIRCR;
CCR : t_SCB_CCR;
SHPR1 : t_SCB_SHPR1;
SHPR2 : t_SCB_SHPR2;
SHPR3 : t_SCB_SHPR3;
SHCSR : t_SCB_SHCSR;
CFSR : t_SCB_CFSR;
HFSR : t_SCB_HFSR;
MMFAR : t_SCB_MMFAR;
BFAR : t_SCB_BFAR;
end record;
for t_SCB_peripheral use record
ICSR at 16#04# range 0 .. 31;
VTOR at 16#08# range 0 .. 31;
AIRCR at 16#0C# range 0 .. 31;
CCR at 16#14# range 0 .. 31;
SHPR1 at 16#18# range 0 .. 31;
SHPR2 at 16#1C# range 0 .. 31;
SHPR3 at 16#20# range 0 .. 31;
SHCSR at 16#24# range 0 .. 31;
CFSR at 16#28# range 0 .. 31;
HFSR at 16#2C# range 0 .. 31;
MMFAR at 16#34# range 0 .. 31;
BFAR at 16#38# range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
SCB : t_SCB_peripheral
with
import,
volatile,
address => m4.layout.SCB_base2;
procedure reset;
end m4.scb;
| 28.316804 | 79 | 0.534391 |
060b0a4b5851b5d6ca53b9a6b34f3c36943700a8 | 703 | adb | Ada | third_party/universal-ctags/ctags/Units/parser-ada.r/ada-string-literal.d/input.adb | f110/wing | 31b259f723b57a6481252a4b8b717fcee6b01ff4 | [
"MIT"
] | 1 | 2020-03-24T16:08:43.000Z | 2020-03-24T16:08:43.000Z | third_party/universal-ctags/ctags/Units/parser-ada.r/ada-string-literal.d/input.adb | f110/wing | 31b259f723b57a6481252a4b8b717fcee6b01ff4 | [
"MIT"
] | null | null | null | third_party/universal-ctags/ctags/Units/parser-ada.r/ada-string-literal.d/input.adb | f110/wing | 31b259f723b57a6481252a4b8b717fcee6b01ff4 | [
"MIT"
] | 1 | 2021-04-26T09:00:06.000Z | 2021-04-26T09:00:06.000Z | with Ada.Text_IO;
procedure Reproduce is
type String_T is new String;
function "+" (Left : String) return String_T is (String_T(Left));
function "+" (Left : String_T; Right : String) return String_T is (String_T(String (Left) & Right));
generic
Description : String_T;
package Generic_G is
procedure Go;
end Generic_G;
package body Generic_G is
procedure Go is
begin
Ada.Text_IO.Put_Line (String (Description));
end Go;
end Generic_G;
package Impl is
procedure Go;
end Impl;
package body Impl is
package Generic1 is new Generic_G (Description => +"; " +":");
procedure Go renames Generic1.Go;
end Impl;
begin
Impl.Go;
end Reproduce;
| 21.30303 | 102 | 0.679943 |
0b684f809794501822c9693469914aee0b6be4a5 | 5,892 | adb | Ada | tools-src/gnu/gcc/gcc/ada/g-io.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/g-io.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/g-io.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- G N A T . I O --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1995-2001 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
package body GNAT.IO is
Current_Out : File_Type := Stdout;
pragma Atomic (Current_Out);
-- Current output file (modified by Set_Output)
---------
-- Get --
---------
procedure Get (X : out Integer) is
function Get_Int return Integer;
pragma Import (C, Get_Int, "get_int");
begin
X := Get_Int;
end Get;
procedure Get (C : out Character) is
function Get_Char return Character;
pragma Import (C, Get_Char, "get_char");
begin
C := Get_Char;
end Get;
--------------
-- Get_Line --
--------------
procedure Get_Line (Item : in out String; Last : out Natural) is
C : Character;
begin
for Nstore in Item'Range loop
Get (C);
if C = ASCII.LF then
Last := Nstore - 1;
return;
else
Item (Nstore) := C;
end if;
end loop;
Last := Item'Last;
end Get_Line;
--------------
-- New_Line --
--------------
procedure New_Line (File : File_Type; Spacing : Positive := 1) is
begin
for J in 1 .. Spacing loop
Put (File, ASCII.LF);
end loop;
end New_Line;
procedure New_Line (Spacing : Positive := 1) is
begin
New_Line (Current_Out, Spacing);
end New_Line;
---------
-- Put --
---------
procedure Put (X : Integer) is
begin
Put (Current_Out, X);
end Put;
procedure Put (File : File_Type; X : Integer) is
procedure Put_Int (X : Integer);
pragma Import (C, Put_Int, "put_int");
procedure Put_Int_Stderr (X : Integer);
pragma Import (C, Put_Int_Stderr, "put_int_stderr");
begin
case File is
when Stdout => Put_Int (X);
when Stderr => Put_Int_Stderr (X);
end case;
end Put;
procedure Put (C : Character) is
begin
Put (Current_Out, C);
end Put;
procedure Put (File : in File_Type; C : Character) is
procedure Put_Char (C : Character);
pragma Import (C, Put_Char, "put_char");
procedure Put_Char_Stderr (C : Character);
pragma Import (C, Put_Char_Stderr, "put_char_stderr");
begin
case File is
when Stdout => Put_Char (C);
when Stderr => Put_Char_Stderr (C);
end case;
end Put;
procedure Put (S : String) is
begin
Put (Current_Out, S);
end Put;
procedure Put (File : File_Type; S : String) is
begin
for J in S'Range loop
Put (File, S (J));
end loop;
end Put;
--------------
-- Put_Line --
--------------
procedure Put_Line (S : String) is
begin
Put_Line (Current_Out, S);
end Put_Line;
procedure Put_Line (File : File_Type; S : String) is
begin
Put (File, S);
New_Line (File);
end Put_Line;
----------------
-- Set_Output --
----------------
procedure Set_Output (File : in File_Type) is
begin
Current_Out := File;
end Set_Output;
---------------------
-- Standard_Output --
---------------------
function Standard_Output return File_Type is
begin
return Stdout;
end Standard_Output;
--------------------
-- Standard_Error --
--------------------
function Standard_Error return File_Type is
begin
return Stderr;
end Standard_Error;
end GNAT.IO;
| 29.313433 | 78 | 0.467244 |
0bcd943ab5bfa55a32ecb3949f7d9ce6726052b6 | 976 | adb | Ada | gdb/testsuite/gdb.ada/access_to_unbounded_array/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/access_to_unbounded_array/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/access_to_unbounded_array/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2018-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/>.
with Pack; use Pack;
procedure Foo is
type String_Access is access String;
type Array_Of_String is array (1 .. 2) of String_Access;
Aos : Array_Of_String := (new String'("ab"), new String'("cd"));
begin
Do_Nothing (Aos'Address); -- BREAK
end Foo;
| 39.04 | 73 | 0.724385 |
39659009dc784875447e7c8c923f19415f90368d | 4,141 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c47004a.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/c47004a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c47004a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C47004A.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.
--*
-- WHEN THE TYPE MARK IN A QUALIFIED EXPRESSION DENOTES AN INTEGER
-- TYPE, CHECK THAT CONSTRAINT_ERROR IS RAISED WHEN THE VALUE OF THE
-- OPERAND DOES NOT LIE WITHIN THE RANGE OF THE TYPE MARK.
-- RJW 7/23/86
WITH REPORT; USE REPORT;
PROCEDURE C47004A IS
BEGIN
TEST( "C47004A", "WHEN THE TYPE MARK IN A QUALIFIED " &
"EXPRESSION DENOTES AN INTEGER " &
"TYPE, CHECK THAT CONSTRAINT_ERROR IS RAISED " &
"WHEN THE VALUE OF THE OPERAND DOES NOT LIE " &
"WITHIN THE RANGE OF THE TYPE MARK" );
DECLARE
TYPE INT IS RANGE -10 .. 10;
SUBTYPE SINT IS INT RANGE -5 .. 5;
FUNCTION IDENT (I : INT) RETURN INT IS
BEGIN
RETURN INT (IDENT_INT (INTEGER (I)));
END;
BEGIN
IF SINT'(IDENT (10)) = 5 THEN
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SINT - 1");
ELSE
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SINT - 2");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ( "WRONG EXCEPTION RAISED FOR VALUE OUTSIDE " &
"OF SUBTYPE SINT" );
END;
DECLARE
SUBTYPE SINTEGER IS INTEGER RANGE -10 .. 10;
BEGIN
IF SINTEGER'(IDENT_INT (20)) = 15 THEN
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SINTEGER - 1");
ELSE
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SINTEGER - 2");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ( "WRONG EXCEPTION RAISED FOR VALUE OUTSIDE " &
"OF SUBTYPE SINTEGER" );
END;
DECLARE
TYPE NINTEGER IS NEW INTEGER;
SUBTYPE SNINT IS NINTEGER RANGE -10 .. 10;
FUNCTION IDENT (I : NINTEGER) RETURN NINTEGER IS
BEGIN
RETURN NINTEGER (IDENT_INT (INTEGER (I)));
END;
BEGIN
IF SNINT'(IDENT (-20)) = -10 THEN
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SNINT - 1");
ELSE
FAILED ( "NO EXCEPTION RAISED FOR VALUE OUTSIDE OF " &
"SUBTYPE SNINT - 2");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ( "WRONG EXCEPTION RAISED FOR VALUE OUTSIDE " &
"OF SUBTYPE SNINT" );
END;
RESULT;
END C47004A;
| 35.698276 | 79 | 0.544554 |
126972fd885b92c4c7f90d9c7fbe3fe0850d3fbb | 17,447 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1997-2019, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- SPITBOL-like interface facilities
-- This package provides a set of interfaces to semantic operations copied
-- from SPITBOL, including a complete implementation of SPITBOL pattern
-- matching. The code is derived from the original SPITBOL MINIMAL sources,
-- created by Robert Dewar. The translation is not exact, but the
-- algorithmic approaches are similar.
with Ada.Finalization; use Ada.Finalization;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Interfaces; use Interfaces;
package GNAT.Spitbol is
pragma Preelaborate;
-- The Spitbol package relies heavily on the Unbounded_String package,
-- using the synonym VString for variable length string. The following
-- declarations define this type and other useful abbreviations.
subtype VString is Ada.Strings.Unbounded.Unbounded_String;
function V (Source : String) return VString
renames Ada.Strings.Unbounded.To_Unbounded_String;
function S (Source : VString) return String
renames Ada.Strings.Unbounded.To_String;
Nul : VString renames Ada.Strings.Unbounded.Null_Unbounded_String;
-------------------------
-- Facilities Provided --
-------------------------
-- The SPITBOL support in GNAT consists of this package together with
-- several child packages. In this package, we have first a set of
-- useful string functions, copied exactly from the corresponding
-- SPITBOL functions, except that we had to rename REVERSE because
-- reverse is a reserved word (it is now Reverse_String).
-- The second element of the parent package is a generic implementation
-- of a table facility. In SPITBOL, the TABLE function allows general
-- mappings from any datatype to any other datatype, and of course, as
-- always, we can freely mix multiple types in the same table.
-- The Ada version of tables is strongly typed, so the indexing type and
-- the range type are always of a consistent type. In this implementation
-- we only provide VString as an indexing type, since this is by far the
-- most common case. The generic instantiation specifies the range type
-- to be used.
-- Three child packages provide standard instantiations of this table
-- package for three common datatypes:
-- GNAT.Spitbol.Table_Boolean (file g-sptabo.ads)
-- The range type is Boolean. The default value is False. This
-- means that this table is essentially a representation of a set.
-- GNAT.Spitbol.Table_Integer (file g-sptain.ads)
-- The range type is Integer. The default value is Integer'First.
-- This provides a general mapping from strings to integers.
-- GNAT.Spitbol.Table_VString (file g-sptavs.ads)
-- The range type is VString. The default value is the null string.
-- This provides a general mapping from strings to strings.
-- Finally there is another child package:
-- GNAT.Spitbol.Patterns (file g-spipat.ads)
-- This child package provides a complete implementation of SPITBOL
-- pattern matching. The spec contains a complete tutorial on the
-- use of pattern matching.
---------------------------------
-- Standard String Subprograms --
---------------------------------
-- This section contains some operations on unbounded strings that are
-- closely related to those in the package Unbounded.Strings, but they
-- correspond to the SPITBOL semantics for these operations.
function Char (Num : Natural) return Character;
pragma Inline (Char);
-- Equivalent to Character'Val (Num)
function Lpad
(Str : VString;
Len : Natural;
Pad : Character := ' ') return VString;
function Lpad
(Str : String;
Len : Natural;
Pad : Character := ' ') return VString;
-- If the length of Str is greater than or equal to Len, then Str is
-- returned unchanged. Otherwise, The value returned is obtained by
-- concatenating Length (Str) - Len instances of the Pad character to
-- the left hand side.
procedure Lpad
(Str : in out VString;
Len : Natural;
Pad : Character := ' ');
-- The procedure form is identical to the function form, except that
-- the result overwrites the input argument Str.
function Reverse_String (Str : VString) return VString;
function Reverse_String (Str : String) return VString;
-- Returns result of reversing the string Str, i.e. the result returned
-- is a mirror image (end-for-end reversal) of the input string.
procedure Reverse_String (Str : in out VString);
-- The procedure form is identical to the function form, except that the
-- result overwrites the input argument Str.
function Rpad
(Str : VString;
Len : Natural;
Pad : Character := ' ') return VString;
function Rpad
(Str : String;
Len : Natural;
Pad : Character := ' ') return VString;
-- If the length of Str is greater than or equal to Len, then Str is
-- returned unchanged. Otherwise, The value returned is obtained by
-- concatenating Length (Str) - Len instances of the Pad character to
-- the right hand side.
procedure Rpad
(Str : in out VString;
Len : Natural;
Pad : Character := ' ');
-- The procedure form is identical to the function form, except that the
-- result overwrites the input argument Str.
function Size (Source : VString) return Natural
renames Ada.Strings.Unbounded.Length;
function Substr
(Str : VString;
Start : Positive;
Len : Natural) return VString;
function Substr
(Str : String;
Start : Positive;
Len : Natural) return VString;
-- Returns the substring starting at the given character position (which
-- is always counted from the start of the string, regardless of bounds,
-- e.g. 2 means starting with the second character of the string), and
-- with the length (Len) given. Index_Error is raised if the starting
-- position is out of range, and Length_Error is raised if Len is too long.
function Trim (Str : VString) return VString;
function Trim (Str : String) return VString;
-- Returns the string obtained by removing all spaces from the right
-- hand side of the string Str.
procedure Trim (Str : in out VString);
-- The procedure form is identical to the function form, except that the
-- result overwrites the input argument Str.
-----------------------
-- Utility Functions --
-----------------------
-- In SPITBOL, integer values can be freely treated as strings. The
-- following definitions help provide some of this capability in
-- some common cases.
function "&" (Num : Integer; Str : String) return String;
function "&" (Str : String; Num : Integer) return String;
function "&" (Num : Integer; Str : VString) return VString;
function "&" (Str : VString; Num : Integer) return VString;
-- In all these concatenation operations, the integer is converted to
-- its corresponding decimal string form, with no leading blank.
function S (Num : Integer) return String;
function V (Num : Integer) return VString;
-- These operators return the given integer converted to its decimal
-- string form with no leading blank.
function N (Str : VString) return Integer;
-- Converts string to number (same as Integer'Value (S (Str)))
-------------------
-- Table Support --
-------------------
-- So far, we only provide support for tables whose indexing data values
-- are strings (or unbounded strings). The values stored may be of any
-- type, as supplied by the generic formal parameter.
generic
type Value_Type is private;
-- Any non-limited type can be used as the value type in the table
Null_Value : Value_Type;
-- Value used to represent a value that is not present in the table
with function Img (A : Value_Type) return String;
-- Used to provide image of value in Dump procedure
with function "=" (A, B : Value_Type) return Boolean is <>;
-- This allows a user-defined equality function to override the
-- predefined equality function.
package Table is
------------------------
-- Table Declarations --
------------------------
type Table (N : Unsigned_32) is private;
-- This is the table type itself. A table is a mapping from string
-- values to values of Value_Type. The discriminant is an estimate of
-- the number of values in the table. If the estimate is much too
-- high, some space is wasted, if the estimate is too low, access to
-- table elements is slowed down. The type Table has copy semantics,
-- not reference semantics. This means that if a table is copied
-- using simple assignment, then the two copies refer to entirely
-- separate tables.
-----------------------------
-- Table Access Operations --
-----------------------------
function Get (T : Table; Name : VString) return Value_Type;
function Get (T : Table; Name : Character) return Value_Type;
pragma Inline (Get);
function Get (T : Table; Name : String) return Value_Type;
-- If an entry with the given name exists in the table, then the
-- corresponding Value_Type value is returned. Otherwise Null_Value
-- is returned.
function Present (T : Table; Name : VString) return Boolean;
function Present (T : Table; Name : Character) return Boolean;
pragma Inline (Present);
function Present (T : Table; Name : String) return Boolean;
-- Determines if an entry with the given name is present in the table.
-- A returned value of True means that it is in the table, otherwise
-- False indicates that it is not in the table.
procedure Delete (T : in out Table; Name : VString);
procedure Delete (T : in out Table; Name : Character);
pragma Inline (Delete);
procedure Delete (T : in out Table; Name : String);
-- Deletes the table element with the given name from the table. If
-- no element in the table has this name, then the call has no effect.
procedure Set (T : in out Table; Name : VString; Value : Value_Type);
procedure Set (T : in out Table; Name : Character; Value : Value_Type);
pragma Inline (Set);
procedure Set (T : in out Table; Name : String; Value : Value_Type);
-- Sets the value of the element with the given name to the given
-- value. If Value is equal to Null_Value, the effect is to remove
-- the entry from the table. If no element with the given name is
-- currently in the table, then a new element with the given value
-- is created.
----------------------------
-- Allocation and Copying --
----------------------------
-- Table is a controlled type, so that all storage associated with
-- tables is properly reclaimed when a Table value is abandoned.
-- Tables have value semantics rather than reference semantics as
-- in Spitbol, i.e. when you assign a copy you end up with two
-- distinct copies of the table, as though COPY had been used in
-- Spitbol. It seems clearly more appropriate in Ada to require
-- the use of explicit pointers for reference semantics.
procedure Clear (T : in out Table);
-- Clears all the elements of the given table, freeing associated
-- storage. On return T is an empty table with no elements.
procedure Copy (From : Table; To : in out Table);
-- First all the elements of table To are cleared (as described for
-- the Clear procedure above), then all the elements of table From
-- are copied into To. In the case where the tables From and To have
-- the same declared size (i.e. the same discriminant), the call to
-- Copy has the same effect as the assignment of From to To. The
-- difference is that, unlike the assignment statement, which will
-- cause a Constraint_Error if the source and target are of different
-- sizes, Copy works fine with different sized tables.
----------------
-- Conversion --
----------------
type Table_Entry is record
Name : VString;
Value : Value_Type;
end record;
type Table_Array is array (Positive range <>) of Table_Entry;
function Convert_To_Array (T : Table) return Table_Array;
-- Returns a Table_Array value with a low bound of 1, and a length
-- corresponding to the number of elements in the table. The elements
-- of the array give the elements of the table in unsorted order.
---------------
-- Debugging --
---------------
procedure Dump (T : Table; Str : String := "Table");
-- Dump contents of given table to the standard output file. The
-- string value Str is used as the name of the table in the dump.
procedure Dump (T : Table_Array; Str : String := "Table_Array");
-- Dump contents of given table array to the current output file. The
-- string value Str is used as the name of the table array in the dump.
private
------------------
-- Private Part --
------------------
-- A Table is a pointer to a hash table which contains the indicated
-- number of hash elements (the number is forced to the next odd value
-- if it is even to improve hashing performance). If more than one
-- of the entries in a table hashes to the same slot, the Next field
-- is used to chain entries from the header. The chains are not kept
-- ordered. A chain is terminated by a null pointer in Next. An unused
-- chain is marked by an element whose Name is null and whose value
-- is Null_Value.
type Hash_Element;
type Hash_Element_Ptr is access all Hash_Element;
type Hash_Element is record
Name : String_Access := null;
Value : Value_Type := Null_Value;
Next : Hash_Element_Ptr := null;
end record;
type Hash_Table is
array (Unsigned_32 range <>) of aliased Hash_Element;
type Table (N : Unsigned_32) is new Controlled with record
Elmts : Hash_Table (1 .. N);
end record;
pragma Finalize_Storage_Only (Table);
overriding procedure Adjust (Object : in out Table);
-- The Adjust procedure does a deep copy of the table structure
-- so that the effect of assignment is, like other assignments
-- in Ada, value-oriented.
overriding procedure Finalize (Object : in out Table);
-- This is the finalization routine that ensures that all storage
-- associated with a table is properly released when a table object
-- is abandoned and finalized.
end Table;
end GNAT.Spitbol;
| 44.16962 | 79 | 0.610649 |
a1f92a019347361a799093e79e84358d77892e4a | 833 | adb | Ada | gdb-7.3/gdb/testsuite/gdb.ada/rec_return/foo.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | gdb-7.3/gdb/testsuite/gdb.ada/rec_return/foo.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | gdb-7.3/gdb/testsuite/gdb.ada/rec_return/foo.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | -- Copyright 2010, 2011 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/>.
with Pck; use Pck;
procedure Foo is
Q: Rec;
begin
Q := Bar; -- STOP HERE
Do_Nothing (Q'Address);
end Foo;
| 33.32 | 73 | 0.720288 |
a13da33f17364351607e365e5d6badc2db0226a4 | 866 | adb | Ada | src/commands/makedict.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/commands/makedict.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/commands/makedict.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.
with Makedict_Main;
procedure Makedict is
Porting : constant Boolean := True;
begin
Makedict_Main (Porting);
end Makedict;
| 37.652174 | 77 | 0.743649 |
507dd79b23e473e75cabecfe33bc0d9e275c7faa | 1,411 | adb | Ada | src/net-interfaces.adb | stcarrez/ada-enet | 678c0887e980db84c375bf25918ab20fe6151bb3 | [
"Apache-2.0"
] | 16 | 2016-09-24T16:58:24.000Z | 2021-11-23T23:03:50.000Z | src/net-interfaces.adb | stcarrez/ada-enet | 678c0887e980db84c375bf25918ab20fe6151bb3 | [
"Apache-2.0"
] | 2 | 2017-07-07T04:16:47.000Z | 2018-09-23T02:27:27.000Z | src/net-interfaces.adb | stcarrez/ada-enet | 678c0887e980db84c375bf25918ab20fe6151bb3 | [
"Apache-2.0"
] | 4 | 2017-06-13T22:12:37.000Z | 2021-07-18T09:14:13.000Z | -----------------------------------------------------------------------
-- net-interfaces -- Network interface
-- 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.
-----------------------------------------------------------------------
package body Net.Interfaces is
-- ------------------------------
-- Check if the IP address is in the same subnet as the interface IP address.
-- ------------------------------
function Is_Local_Network (Ifnet : in Ifnet_Type;
Ip : in Ip_Addr) return Boolean is
begin
for I in Ip'Range loop
if (Ifnet.Netmask (I) and Ip (I)) /= (Ifnet.Netmask (I) and Ifnet.Ip (I)) then
return False;
end if;
end loop;
return True;
end Is_Local_Network;
end Net.Interfaces;
| 39.194444 | 87 | 0.573352 |
a1036efb8bcefd12579cfea8fd8df28bccd76407 | 2,064 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/p5.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/sso/p5.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/sso/p5.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
with Init5; use Init5;
with Text_IO; use Text_IO;
with Dump;
procedure P5 is
Local_R1 : R1;
Local_R2 : R2;
begin
Put ("My_R1 :");
Dump (My_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "My_R1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Put ("My_R2 :");
Dump (My_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "My_R2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
Local_R1 := My_R1;
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Local_R2 := My_R2;
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
Local_R1 := (I => 16#12345678#,
A => (16#AB0012#, 16#CD0034#, 16#EF0056#));
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Local_R2 := (I => 16#12345678#,
A => (16#AB0012#, 16#CD0034#, 16#EF0056#));
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
Local_R1.I := Local_R2.I;
Local_R1.A(1) := Local_R2.A(1);
Local_R1.A(2) := Local_R2.A(2);
Local_R1.A(3) := Local_R2.A(3);
Put ("Local_R1 :");
Dump (Local_R1'Address, R1'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R1 : 78 56 34 12 12 00 ab 00 34 00 cd 00 56 00 ef 00.*\n" }
Local_R2.I := Local_R1.I;
Local_R2.A(1) := Local_R1.A(1);
Local_R2.A(2) := Local_R1.A(2);
Local_R2.A(3) := Local_R1.A(3);
Put ("Local_R2 :");
Dump (Local_R2'Address, R2'Max_Size_In_Storage_Elements);
New_Line;
-- { dg-output "Local_R2 : 12 34 56 78 00 ab 00 12 00 cd 00 34 00 ef 00 56.*\n" }
end;
| 29.913043 | 83 | 0.621124 |
1ca9ae20429a94378d461af8c9f8423a0c4fc52a | 160 | ada | Ada | Task/Character-codes/Ada/character-codes.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Character-codes/Ada/character-codes.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Character-codes/Ada/character-codes.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO; use Ada.Text_IO;
procedure Char_Code is
begin
Put_Line (Character'Val (97) & " =" & Integer'Image (Character'Pos ('a')));
end Char_Code;
| 22.857143 | 78 | 0.69375 |
0bc6096385c89b88911602897540faa0e2b2374e | 152,367 | adb | Ada | eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/relu_array_array_ap_fixed_4u_relu_config7_s.sched.adb | anmeza/platform_ml_models | ba8011a289a96013dd6f7a5b58eb1072f04d6bf0 | [
"RSA-MD"
] | 1 | 2021-12-21T18:19:27.000Z | 2021-12-21T18:19:27.000Z | eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/relu_array_array_ap_fixed_4u_relu_config7_s.sched.adb | anmeza/platform_ml_models | ba8011a289a96013dd6f7a5b58eb1072f04d6bf0 | [
"RSA-MD"
] | null | null | null | eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2/myproject_prj/solution1/.autopilot/db/relu_array_array_ap_fixed_4u_relu_config7_s.sched.adb | anmeza/platform_ml_models | ba8011a289a96013dd6f7a5b58eb1072f04d6bf0 | [
"RSA-MD"
] | null | null | null | <?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>relu_array_array_ap_fixed_4u_relu_config7_s</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>8</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>data_V_data_0_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>data.V.data[0].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</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>data_V_data_1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[1].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</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="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>data_V_data_2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[2].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</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="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>data_V_data_3_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V.data[3].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</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>res_V_data_0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[0].V</originalName>
<rtlName></rtlName>
<coreName></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="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>res_V_data_1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[1].V</originalName>
<rtlName></rtlName>
<coreName></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="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>res_V_data_2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[2].V</originalName>
<rtlName></rtlName>
<coreName></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="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>res_V_data_3_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V.data[3].V</originalName>
<rtlName></rtlName>
<coreName></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>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>_ln60</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</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>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>60</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>79</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>1.76</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>i_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</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>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>icmp_ln60</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>60</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>85</item>
<item>87</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>1.88</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>i</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>60</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>88</item>
<item>90</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.63</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>_ln60</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>60</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>91</item>
<item>92</item>
<item>93</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>empty_59</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</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>3.63</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_data_0_V</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[0].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>100</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>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_data_1_V</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[1].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_data_2_V</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[2].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</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>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_data_3_V</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>63</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>63</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[3].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</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>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>icmp_ln1494</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>104</item>
<item>106</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>1.66</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>trunc_ln746</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</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>12</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>trunc_ln</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>109</item>
<item>110</item>
<item>112</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>13</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>117</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>14</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_Result_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
<item>122</item>
<item>124</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>icmp_ln785</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>125</item>
<item>127</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>1.13</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>or_ln785</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>128</item>
<item>129</item>
</oprand_edges>
<opcode>or</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>17</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>select_ln785</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>130</item>
<item>132</item>
<item>133</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>18</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_data_0_V_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[0].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
<item>137</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.99</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>zext_ln1494</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>138</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>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>icmp_ln1494_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>139</item>
<item>140</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>1.66</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>trunc_ln746_4</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>141</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>21</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>trunc_ln746_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>142</item>
<item>143</item>
<item>144</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>22</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
<item>147</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>23</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>p_Result_2_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</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>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>icmp_ln785_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>152</item>
<item>153</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>1.13</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>or_ln785_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>154</item>
<item>155</item>
</oprand_edges>
<opcode>or</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>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>select_ln785_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>156</item>
<item>157</item>
<item>158</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>27</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_data_1_V_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[1].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>159</item>
<item>160</item>
<item>161</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.99</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>zext_ln1494_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>162</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>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>icmp_ln1494_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>163</item>
<item>164</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>1.66</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>trunc_ln746_5</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</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>30</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>trunc_ln746_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
<item>168</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>31</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>169</item>
<item>170</item>
<item>171</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>32</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>p_Result_2_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>172</item>
<item>173</item>
<item>174</item>
<item>175</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>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>icmp_ln785_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>176</item>
<item>177</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>1.13</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>or_ln785_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>178</item>
<item>179</item>
</oprand_edges>
<opcode>or</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>35</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>select_ln785_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>181</item>
<item>182</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>36</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>tmp_data_2_V_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[2].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>183</item>
<item>184</item>
<item>185</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.99</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>zext_ln1494_2</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>186</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>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>icmp_ln1494_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.66</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>trunc_ln746_6</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</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>39</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>trunc_ln746_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
<item>192</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>40</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>tmp_4</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>193</item>
<item>194</item>
<item>195</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>41</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>p_Result_2_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
<item>199</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>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>icmp_ln785_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>200</item>
<item>201</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>1.13</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>or_ln785_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</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>202</item>
<item>203</item>
</oprand_edges>
<opcode>or</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>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>select_ln785_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>204</item>
<item>205</item>
<item>206</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>45</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>tmp_data_3_V_1</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.data[3].V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
<item>209</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.99</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>zext_ln1494_3</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>210</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>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>res_V_data_0_V_write_ln73</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>212</item>
<item>213</item>
<item>214</item>
<item>215</item>
<item>216</item>
<item>217</item>
<item>218</item>
<item>219</item>
<item>220</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>3.63</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>_ln60</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>60</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>60</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>221</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>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>_ln75</name>
<fileName>firmware/nnet_utils/nnet_activation_stream.h</fileName>
<fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation_stream.h</first>
<second>relu&lt;nnet::array&lt;ap_fixed&lt;9, 6, 5, 3, 0&gt;, 4&gt;, nnet::array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 4&gt;, relu_config7&gt;</second>
</first>
<second>75</second>
</item>
</second>
</item>
</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_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>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>80</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>86</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1024</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>89</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>105</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>111</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="_67">
<Value>
<Obj>
<type>2</type>
<id>116</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>5</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>121</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>6</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>123</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>8</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>126</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_71">
<Value>
<Obj>
<type>2</type>
<id>131</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>127</content>
</item>
<item class_id_reference="16" object_id="_72">
<Value>
<Obj>
<type>2</type>
<id>136</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_73">
<Obj>
<type>3</type>
<id>18</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>24</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>19</item>
<item>20</item>
<item>22</item>
<item>23</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_75">
<Obj>
<type>3</type>
<id>76</id>
<name>ReLUActLoop</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>47</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>75</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_76">
<Obj>
<type>3</type>
<id>78</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>77</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>117</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_77">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>82</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>93</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>155</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="_132">
<id>156</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="_133">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>160</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="_137">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>200</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="_171">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>204</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="_175">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>210</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="_181">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>394</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>395</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>396</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>397</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>1</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="_194">
<mId>1</mId>
<mTag>relu<array,array<ap_fixed,4u>,relu_config7></mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1027</mMinLatency>
<mMaxLatency>1027</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_195">
<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>18</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>
<item class_id_reference="22" object_id="_196">
<mId>3</mId>
<mTag>ReLUActLoop</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>24</item>
<item>76</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>1024</mMinTripCount>
<mMaxTripCount>1024</mMaxTripCount>
<mMinLatency>1025</mMinLatency>
<mMaxLatency>1025</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_197">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>78</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>53</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>17</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</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>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>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>37</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>39</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>3</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>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</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>2</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>2</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>75</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>18</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>2</first>
<second>2</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="_198">
<region_name>ReLUActLoop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>24</item>
<item>76</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>3</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 class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 32.753009 | 211 | 0.624256 |
12d8577ac0dd8917e104dfe47c3d28751231f620 | 11,260 | ads | Ada | software/hal/hpl/STM32/svd/stm32f40x/stm32_svd-spi.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/hpl/STM32/svd/stm32f40x/stm32_svd-spi.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/hpl/STM32/svd/stm32f40x/stm32_svd-spi.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- This spec has been automatically generated from STM32F40x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with HAL;
with System;
package STM32_SVD.SPI is
pragma Preelaborate;
---------------
-- Registers --
---------------
------------------
-- CR1_Register --
------------------
subtype CR1_BR_Field is HAL.UInt3;
-- control register 1
type CR1_Register is record
-- Clock phase
CPHA : Boolean := False;
-- Clock polarity
CPOL : Boolean := False;
-- Master selection
MSTR : Boolean := False;
-- Baud rate control
BR : CR1_BR_Field := 16#0#;
-- SPI enable
SPE : Boolean := False;
-- Frame format
LSBFIRST : Boolean := False;
-- Internal slave select
SSI : Boolean := False;
-- Software slave management
SSM : Boolean := False;
-- Receive only
RXONLY : Boolean := False;
-- Data frame format
DFF : Boolean := False;
-- CRC transfer next
CRCNEXT : Boolean := False;
-- Hardware CRC calculation enable
CRCEN : Boolean := False;
-- Output enable in bidirectional mode
BIDIOE : Boolean := False;
-- Bidirectional data mode enable
BIDIMODE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
CPHA at 0 range 0 .. 0;
CPOL at 0 range 1 .. 1;
MSTR at 0 range 2 .. 2;
BR at 0 range 3 .. 5;
SPE at 0 range 6 .. 6;
LSBFIRST at 0 range 7 .. 7;
SSI at 0 range 8 .. 8;
SSM at 0 range 9 .. 9;
RXONLY at 0 range 10 .. 10;
DFF at 0 range 11 .. 11;
CRCNEXT at 0 range 12 .. 12;
CRCEN at 0 range 13 .. 13;
BIDIOE at 0 range 14 .. 14;
BIDIMODE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
------------------
-- CR2_Register --
------------------
-- control register 2
type CR2_Register is record
-- Rx buffer DMA enable
RXDMAEN : Boolean := False;
-- Tx buffer DMA enable
TXDMAEN : Boolean := False;
-- SS output enable
SSOE : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Frame format
FRF : Boolean := False;
-- Error interrupt enable
ERRIE : Boolean := False;
-- RX buffer not empty interrupt enable
RXNEIE : Boolean := False;
-- Tx buffer empty interrupt enable
TXEIE : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
RXDMAEN at 0 range 0 .. 0;
TXDMAEN at 0 range 1 .. 1;
SSOE at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
FRF at 0 range 4 .. 4;
ERRIE at 0 range 5 .. 5;
RXNEIE at 0 range 6 .. 6;
TXEIE at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------
-- SR_Register --
-----------------
-- status register
type SR_Register is record
-- Read-only. Receive buffer not empty
RXNE : Boolean := False;
-- Read-only. Transmit buffer empty
TXE : Boolean := True;
-- Read-only. Channel side
CHSIDE : Boolean := False;
-- Read-only. Underrun flag
UDR : Boolean := False;
-- CRC error flag
CRCERR : Boolean := False;
-- Read-only. Mode fault
MODF : Boolean := False;
-- Read-only. Overrun flag
OVR : Boolean := False;
-- Read-only. Busy flag
BSY : Boolean := False;
-- Read-only. TI frame format error
TIFRFE : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
RXNE at 0 range 0 .. 0;
TXE at 0 range 1 .. 1;
CHSIDE at 0 range 2 .. 2;
UDR at 0 range 3 .. 3;
CRCERR at 0 range 4 .. 4;
MODF at 0 range 5 .. 5;
OVR at 0 range 6 .. 6;
BSY at 0 range 7 .. 7;
TIFRFE at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-----------------
-- DR_Register --
-----------------
subtype DR_DR_Field is HAL.Short;
-- data register
type DR_Register is record
-- Data register
DR : DR_DR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DR_Register use record
DR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
--------------------
-- CRCPR_Register --
--------------------
subtype CRCPR_CRCPOLY_Field is HAL.Short;
-- CRC polynomial register
type CRCPR_Register is record
-- CRC polynomial register
CRCPOLY : CRCPR_CRCPOLY_Field := 16#7#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CRCPR_Register use record
CRCPOLY at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
---------------------
-- RXCRCR_Register --
---------------------
subtype RXCRCR_RxCRC_Field is HAL.Short;
-- RX CRC register
type RXCRCR_Register is record
-- Read-only. Rx CRC register
RxCRC : RXCRCR_RxCRC_Field;
-- unspecified
Reserved_16_31 : HAL.Short;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RXCRCR_Register use record
RxCRC at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
---------------------
-- TXCRCR_Register --
---------------------
subtype TXCRCR_TxCRC_Field is HAL.Short;
-- TX CRC register
type TXCRCR_Register is record
-- Read-only. Tx CRC register
TxCRC : TXCRCR_TxCRC_Field;
-- unspecified
Reserved_16_31 : HAL.Short;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TXCRCR_Register use record
TxCRC at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
----------------------
-- I2SCFGR_Register --
----------------------
subtype I2SCFGR_DATLEN_Field is HAL.UInt2;
subtype I2SCFGR_I2SSTD_Field is HAL.UInt2;
subtype I2SCFGR_I2SCFG_Field is HAL.UInt2;
-- I2S configuration register
type I2SCFGR_Register is record
-- Channel length (number of bits per audio channel)
CHLEN : Boolean := False;
-- Data length to be transferred
DATLEN : I2SCFGR_DATLEN_Field := 16#0#;
-- Steady state clock polarity
CKPOL : Boolean := False;
-- I2S standard selection
I2SSTD : I2SCFGR_I2SSTD_Field := 16#0#;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- PCM frame synchronization
PCMSYNC : Boolean := False;
-- I2S configuration mode
I2SCFG : I2SCFGR_I2SCFG_Field := 16#0#;
-- I2S Enable
I2SE : Boolean := False;
-- I2S mode selection
I2SMOD : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for I2SCFGR_Register use record
CHLEN at 0 range 0 .. 0;
DATLEN at 0 range 1 .. 2;
CKPOL at 0 range 3 .. 3;
I2SSTD at 0 range 4 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
PCMSYNC at 0 range 7 .. 7;
I2SCFG at 0 range 8 .. 9;
I2SE at 0 range 10 .. 10;
I2SMOD at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
--------------------
-- I2SPR_Register --
--------------------
subtype I2SPR_I2SDIV_Field is HAL.Byte;
-- I2S prescaler register
type I2SPR_Register is record
-- I2S Linear prescaler
I2SDIV : I2SPR_I2SDIV_Field := 16#A#;
-- Odd factor for the prescaler
ODD : Boolean := False;
-- Master clock output enable
MCKOE : Boolean := False;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for I2SPR_Register use record
I2SDIV at 0 range 0 .. 7;
ODD at 0 range 8 .. 8;
MCKOE at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Serial peripheral interface
type SPI_Peripheral is record
-- control register 1
CR1 : CR1_Register;
-- control register 2
CR2 : CR2_Register;
-- status register
SR : SR_Register;
-- data register
DR : DR_Register;
-- CRC polynomial register
CRCPR : CRCPR_Register;
-- RX CRC register
RXCRCR : RXCRCR_Register;
-- TX CRC register
TXCRCR : TXCRCR_Register;
-- I2S configuration register
I2SCFGR : I2SCFGR_Register;
-- I2S prescaler register
I2SPR : I2SPR_Register;
end record
with Volatile;
for SPI_Peripheral use record
CR1 at 0 range 0 .. 31;
CR2 at 4 range 0 .. 31;
SR at 8 range 0 .. 31;
DR at 12 range 0 .. 31;
CRCPR at 16 range 0 .. 31;
RXCRCR at 20 range 0 .. 31;
TXCRCR at 24 range 0 .. 31;
I2SCFGR at 28 range 0 .. 31;
I2SPR at 32 range 0 .. 31;
end record;
-- Serial peripheral interface
I2S2ext_Periph : aliased SPI_Peripheral
with Import, Address => I2S2ext_Base;
-- Serial peripheral interface
SPI2_Periph : aliased SPI_Peripheral
with Import, Address => SPI2_Base;
-- Serial peripheral interface
SPI3_Periph : aliased SPI_Peripheral
with Import, Address => SPI3_Base;
-- Serial peripheral interface
I2S3ext_Periph : aliased SPI_Peripheral
with Import, Address => I2S3ext_Base;
-- Serial peripheral interface
SPI1_Periph : aliased SPI_Peripheral
with Import, Address => SPI1_Base;
end STM32_SVD.SPI;
| 29.867374 | 65 | 0.530373 |
a154f0f480e66c148ada6c465d54a5304250043f | 959 | ads | Ada | reuse/ada/general.ads | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/general.ads | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/general.ads | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | -- $Id: General.md,v 1.5 1994/06/13 09:41:43 grosch rel $
-- $Log: General.md,v $
-- Ich, Doktor Josef Grosch, Informatiker, Aug. 1994
-- General Subroutines: minimum, maximum, binary logarithm, and power of 2
package General is
type ForAlign is record char: Character; longreal: Long_Float; end record;
MaxAlign : constant Integer := ForAlign'size - Long_Float'size;
AlignMask : Integer := 0;
function Min (a, b: Integer) return Integer;
-- Returns the minimum of 'a' and 'b'.
function Max (a, b: Integer) return Integer;
-- Returns the maximum of 'a' and 'b'.
function Log2 (x: Integer) return Integer;
-- Returns the logarithm to the base 2 of 'x'.
function Exp2 (x: Integer) return Integer;
-- Returns 2 to the power of 'x'.
function AntiLog (x: Integer) return Integer;
-- Returns the number of the lowest bit set in 'x'.
function Exp10 (x: Integer) return Float;
-- Returns 10 to the power of 'x'.
end General;
| 26.638889 | 75 | 0.686131 |
a18b1a003adf7c44b04c8cd89426cc396fd21320 | 2,183 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/ae3702a.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/a/ae3702a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/ae3702a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- AE3702A.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 INTEGER_IO CAN BE INSTANTIATED FOR USER DEFINED INTEGER
-- TYPES.
-- SPS 10/1/82
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE AE3702A IS
BEGIN
TEST ("AE3702A", "CHECK THAT INTEGER_IO CAN BE INSTANTIATED FOR " &
"USER DEFINED TYPES");
DECLARE
TYPE I1 IS RANGE 6 .. 14;
TYPE I2 IS NEW INTEGER;
TYPE I3 IS NEW INTEGER RANGE 0 .. INTEGER'LAST;
SUBTYPE S1 IS INTEGER RANGE 6 .. 14;
SUBTYPE S2 IS INTEGER;
SUBTYPE S3 IS INTEGER RANGE 0 .. INTEGER'LAST;
PACKAGE NIO1 IS NEW INTEGER_IO (I1);
PACKAGE NIO2 IS NEW INTEGER_IO (I2);
PACKAGE NIO3 IS NEW INTEGER_IO (I3);
PACKAGE NIO4 IS NEW INTEGER_IO (S1);
PACKAGE NIO5 IS NEW INTEGER_IO (S2);
PACKAGE NIO6 IS NEW INTEGER_IO (S3);
BEGIN
NULL;
END;
RESULT;
END AE3702A;
| 36.383333 | 79 | 0.642694 |
1c8c331141dd19d3d1a31c574eb3d1fbb41ecb5a | 1,266 | ads | Ada | source/database-jobs.ads | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | 1 | 2016-08-09T20:47:23.000Z | 2016-08-09T20:47:23.000Z | source/database-jobs.ads | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | null | null | null | source/database-jobs.ads | jquorning/iDoNu | 1618b679f7d0895729dded62f22b0826e7da7cb1 | [
"blessing"
] | null | null | 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 Types;
package Database.Jobs is
function Get_Current_Job return Types.Job_Id;
-- Get current job from persistent database storage.
procedure Set_Current_Job (Job : in Types.Job_Id);
-- Set current job in persistent storage.
use type Types.Job_Id;
Top_Level : constant Types.Job_Id := 0;
All_Jobs : constant Types.Job_Id := -1;
function Get_Jobs (Top : in Types.Job_Id)
return Types.Job_Sets.Vector;
-- Get set of jobs at level Top.
function Get_Job_Info (Job : in Types.Job_Id)
return Types.Job_Info;
procedure Add_Job (Id : in Types.Job_Id;
Title : in String;
Parent : in Types.Job_Id;
Owner : in String);
function Get_New_Job_Id return Types.Job_Id;
-- Get an Job_Id for a new job.
procedure Transfer (Job : in Types.Job_Id;
To_Parent : in Types.Job_Id);
end Database.Jobs;
| 27.521739 | 68 | 0.623223 |
1cbe71b7157c8f0a0ff1604ae4971324bfe87a07 | 3,169 | ads | Ada | source/tasking/required/s-tpoben.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/required/s-tpoben.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/required/s-tpoben.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit required by compiler
with Ada.Exceptions;
with Ada.Finalization;
with Ada.Unchecked_Conversion;
package System.Tasking.Protected_Objects.Entries is
type Node is limited record
Super : aliased Synchronous_Objects.Queue_Node;
E : Protected_Entry_Index;
Uninterpreted_Data : Address;
Caller : Task_Id;
Action : Boolean;
Requeued : Boolean;
Waiting : aliased Synchronous_Objects.Event;
X : Ada.Exceptions.Exception_Occurrence;
end record;
pragma Suppress_Initialization (Node);
type Node_Access is access all Node;
function Downcast is
new Ada.Unchecked_Conversion (
Synchronous_Objects.Queue_Node_Access,
Node_Access);
type Find_Body_Index_Access is access function (
O : Address;
E : Protected_Entry_Index)
return Protected_Entry_Index;
type Protected_Entry_Queue_Max_Array is
array (Positive_Protected_Entry_Index range <>) of Natural;
type Protected_Entry_Queue_Max_Access is
access constant Protected_Entry_Queue_Max_Array;
-- required by compiler
type Protected_Entry_Body_Array is
array (Positive_Protected_Entry_Index range <>) of Entry_Body;
pragma Suppress_Initialization (Protected_Entry_Body_Array);
type Protected_Entry_Body_Access is
access constant Protected_Entry_Body_Array;
-- required by compiler
-- (if it is not controlled type, compiler may be crashed!)
type Protection_Entries (Num_Entries : Protected_Entry_Index) is
limited new Ada.Finalization.Limited_Controlled with
record
Mutex : aliased Synchronous_Objects.Mutex;
Calling : aliased Synchronous_Objects.Queue;
Compiler_Info : Address;
Entry_Bodies : Protected_Entry_Body_Access;
Find_Body_Index : Find_Body_Index_Access;
Raised_On_Barrier : Boolean;
Current_Calling : access Node;
end record;
-- required for synchronized interface by compiler
type Protection_Entries_Access is access all Protection_Entries'Class;
for Protection_Entries_Access'Storage_Size use 0;
-- required by compiler
procedure Initialize_Protection_Entries (
Object : not null access Protection_Entries'Class;
Ceiling_Priority : Integer;
Compiler_Info : Address;
Entry_Queue_Maxes : Protected_Entry_Queue_Max_Access;
Entry_Bodies : Protected_Entry_Body_Access;
Find_Body_Index : Find_Body_Index_Access);
overriding procedure Finalize (Object : in out Protection_Entries);
-- required by compiler
procedure Lock_Entries (
Object : not null access Protection_Entries'Class);
procedure Unlock_Entries (
Object : not null access Protection_Entries'Class);
-- for System.Tasking.Protected_Objects.Operations.Service_Entries
procedure Cancel_Calls (Object : in out Protection_Entries'Class);
-- required by compiler (s-tpoben.ads)
function Get_Ceiling (Object : not null access Protection_Entries'Class)
return Any_Priority;
-- unimplemented subprograms required by compiler
-- Set_Ceiling
end System.Tasking.Protected_Objects.Entries;
| 35.211111 | 75 | 0.751972 |
1cedaf67d3a832052f153d738901b7dfa9cfa77a | 984 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/arr_arr/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/arr_arr/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/arr_arr/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2014-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/>.
with System;
with Pck; use Pck;
procedure Foo is
type Array2_First is array (24 .. 26) of Integer;
type Array2_Second is array (1 .. 2) of Array2_First;
A2 : Array2_Second := ((10, 11, 12), (13, 14, 15));
begin
Do_Nothing (A2'Address); -- START
end Foo;
| 37.846154 | 73 | 0.714431 |
39388e8c2ee494e77fbb5e4bd6473465a2c06c90 | 17,049 | ads | Ada | awa/plugins/awa-tags/src/model/awa-tags-models.ads | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 81 | 2015-01-18T23:02:30.000Z | 2022-03-19T17:34:57.000Z | awa/plugins/awa-tags/src/model/awa-tags-models.ads | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 20 | 2015-12-09T19:26:19.000Z | 2022-03-23T14:32:43.000Z | awa/plugins/awa-tags/src/model/awa-tags-models.ads | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- AWA.Tags.Models -- AWA.Tags.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-spec.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 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.
-----------------------------------------------------------------------
pragma Warnings (Off);
with ADO.Sessions;
with ADO.Objects;
with ADO.Statements;
with ADO.SQL;
with ADO.Schemas;
with ADO.Queries;
with ADO.Queries.Loaders;
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Beans.Basic.Lists;
pragma Warnings (On);
package AWA.Tags.Models is
pragma Style_Checks ("-mr");
type Tag_Ref is new ADO.Objects.Object_Ref with null record;
type Tagged_Entity_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- The tag definition.
-- --------------------
-- Create an object key for Tag.
function Tag_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Tag from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Tag_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Tag : constant Tag_Ref;
function "=" (Left, Right : Tag_Ref'Class) return Boolean;
-- Set the tag identifier
procedure Set_Id (Object : in out Tag_Ref;
Value : in ADO.Identifier);
-- Get the tag identifier
function Get_Id (Object : in Tag_Ref)
return ADO.Identifier;
-- Set the tag name
procedure Set_Name (Object : in out Tag_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Name (Object : in out Tag_Ref;
Value : in String);
-- Get the tag name
function Get_Name (Object : in Tag_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Name (Object : in Tag_Ref)
return String;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Tag_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
TAG_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Tag_Ref);
-- Copy of the object.
procedure Copy (Object : in Tag_Ref;
Into : in out Tag_Ref);
package Tag_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Tag_Ref,
"=" => "=");
subtype Tag_Vector is Tag_Vectors.Vector;
procedure List (Object : in out Tag_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
-- Create an object key for Tagged_Entity.
function Tagged_Entity_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Tagged_Entity from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Tagged_Entity_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Tagged_Entity : constant Tagged_Entity_Ref;
function "=" (Left, Right : Tagged_Entity_Ref'Class) return Boolean;
-- Set the tag entity identifier
procedure Set_Id (Object : in out Tagged_Entity_Ref;
Value : in ADO.Identifier);
-- Get the tag entity identifier
function Get_Id (Object : in Tagged_Entity_Ref)
return ADO.Identifier;
-- Set Title: Tag model
-- Date: 2013-02-23the database entity to which the tag is associated
procedure Set_For_Entity_Id (Object : in out Tagged_Entity_Ref;
Value : in ADO.Identifier);
-- Get Title: Tag model
-- Date: 2013-02-23the database entity to which the tag is associated
function Get_For_Entity_Id (Object : in Tagged_Entity_Ref)
return ADO.Identifier;
-- Set the entity type
procedure Set_Entity_Type (Object : in out Tagged_Entity_Ref;
Value : in ADO.Entity_Type);
-- Get the entity type
function Get_Entity_Type (Object : in Tagged_Entity_Ref)
return ADO.Entity_Type;
--
procedure Set_Tag (Object : in out Tagged_Entity_Ref;
Value : in AWA.Tags.Models.Tag_Ref'Class);
--
function Get_Tag (Object : in Tagged_Entity_Ref)
return AWA.Tags.Models.Tag_Ref'Class;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Tagged_Entity_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
TAGGED_ENTITY_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Tagged_Entity_Ref);
-- Copy of the object.
procedure Copy (Object : in Tagged_Entity_Ref;
Into : in out Tagged_Entity_Ref);
package Tagged_Entity_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Tagged_Entity_Ref,
"=" => "=");
subtype Tagged_Entity_Vector is Tagged_Entity_Vectors.Vector;
procedure List (Object : in out Tagged_Entity_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
-- --------------------
-- The tag information.
-- --------------------
type Tag_Info is
new Util.Beans.Basic.Bean with record
-- the tag name.
Tag : Ada.Strings.Unbounded.Unbounded_String;
-- the number of references for the tag.
Count : Natural;
end record;
-- Get the bean attribute identified by the name.
overriding
function Get_Value (From : in Tag_Info;
Name : in String) return Util.Beans.Objects.Object;
-- Set the bean attribute identified by the name.
overriding
procedure Set_Value (Item : in out Tag_Info;
Name : in String;
Value : in Util.Beans.Objects.Object);
package Tag_Info_Beans is
new Util.Beans.Basic.Lists (Element_Type => Tag_Info);
package Tag_Info_Vectors renames Tag_Info_Beans.Vectors;
subtype Tag_Info_List_Bean is Tag_Info_Beans.List_Bean;
type Tag_Info_List_Bean_Access is access all Tag_Info_List_Bean;
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
procedure List (Object : in out Tag_Info_List_Bean'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class);
subtype Tag_Info_Vector is Tag_Info_Vectors.Vector;
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
procedure List (Object : in out Tag_Info_Vector;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class);
Query_Check_Tag : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List : constant ADO.Queries.Query_Definition_Access;
Query_Tag_Search : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List_All : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List_For_Entities : constant ADO.Queries.Query_Definition_Access;
private
TAG_NAME : aliased constant String := "awa_tag";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "name";
TAG_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 2,
Table => TAG_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access)
);
TAG_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= TAG_DEF'Access;
Null_Tag : constant Tag_Ref
:= Tag_Ref'(ADO.Objects.Object_Ref with null record);
type Tag_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TAG_DEF'Access)
with record
Name : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Tag_Access is access all Tag_Impl;
overriding
procedure Destroy (Object : access Tag_Impl);
overriding
procedure Find (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Tag_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Tag_Ref'Class;
Impl : out Tag_Access);
TAGGED_ENTITY_NAME : aliased constant String := "awa_tagged_entity";
COL_0_2_NAME : aliased constant String := "id";
COL_1_2_NAME : aliased constant String := "for_entity_id";
COL_2_2_NAME : aliased constant String := "entity_type";
COL_3_2_NAME : aliased constant String := "tag_id";
TAGGED_ENTITY_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 4,
Table => TAGGED_ENTITY_NAME'Access,
Members => (
1 => COL_0_2_NAME'Access,
2 => COL_1_2_NAME'Access,
3 => COL_2_2_NAME'Access,
4 => COL_3_2_NAME'Access)
);
TAGGED_ENTITY_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= TAGGED_ENTITY_DEF'Access;
Null_Tagged_Entity : constant Tagged_Entity_Ref
:= Tagged_Entity_Ref'(ADO.Objects.Object_Ref with null record);
type Tagged_Entity_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TAGGED_ENTITY_DEF'Access)
with record
For_Entity_Id : ADO.Identifier;
Entity_Type : ADO.Entity_Type;
Tag : AWA.Tags.Models.Tag_Ref;
end record;
type Tagged_Entity_Access is access all Tagged_Entity_Impl;
overriding
procedure Destroy (Object : access Tagged_Entity_Impl);
overriding
procedure Find (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Tagged_Entity_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Tagged_Entity_Ref'Class;
Impl : out Tagged_Entity_Access);
package File_1 is
new ADO.Queries.Loaders.File (Path => "tag-queries.xml",
Sha1 => "BFA439EF20901C425F86DB33AD8870BADB46FBEB");
package Def_Taginfo_Check_Tag is
new ADO.Queries.Loaders.Query (Name => "check-tag",
File => File_1.File'Access);
Query_Check_Tag : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Check_Tag.Query'Access;
package Def_Taginfo_Tag_List is
new ADO.Queries.Loaders.Query (Name => "tag-list",
File => File_1.File'Access);
Query_Tag_List : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List.Query'Access;
package Def_Taginfo_Tag_Search is
new ADO.Queries.Loaders.Query (Name => "tag-search",
File => File_1.File'Access);
Query_Tag_Search : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_Search.Query'Access;
package Def_Taginfo_Tag_List_All is
new ADO.Queries.Loaders.Query (Name => "tag-list-all",
File => File_1.File'Access);
Query_Tag_List_All : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List_All.Query'Access;
package Def_Taginfo_Tag_List_For_Entities is
new ADO.Queries.Loaders.Query (Name => "tag-list-for-entities",
File => File_1.File'Access);
Query_Tag_List_For_Entities : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List_For_Entities.Query'Access;
end AWA.Tags.Models;
| 38.572398 | 94 | 0.630946 |
0601ef064f079eb5cd4cc2ead136bcfad728085c | 6,239 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-ticoau.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/ada/a-ticoau.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-ticoau.adb | 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 . C O M P L E X _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- 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.Text_IO.Generic_Aux; use Ada.Text_IO.Generic_Aux;
with Ada.Text_IO.Float_Aux;
with System.Img_Real; use System.Img_Real;
package body Ada.Text_IO.Complex_Aux is
package Aux renames Ada.Text_IO.Float_Aux;
---------
-- Get --
---------
procedure Get
(File : File_Type;
ItemR : out Long_Long_Float;
ItemI : out Long_Long_Float;
Width : Field)
is
Buf : String (1 .. Field'Last);
Stop : Integer := 0;
Ptr : aliased Integer;
Paren : Boolean := False;
begin
-- General note for following code, exceptions from the calls to
-- Get for components of the complex value are propagated.
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
Gets (Buf (1 .. Stop), ItemR, ItemI, Ptr);
for J in Ptr + 1 .. Stop loop
if not Is_Blank (Buf (J)) then
raise Data_Error;
end if;
end loop;
-- Case of width = 0
else
Load_Skip (File);
Ptr := 0;
Load (File, Buf, Ptr, '(', Paren);
Aux.Get (File, ItemR, 0);
Load_Skip (File);
Load (File, Buf, Ptr, ',');
Aux.Get (File, ItemI, 0);
if Paren then
Load_Skip (File);
Load (File, Buf, Ptr, ')', Paren);
if not Paren then
raise Data_Error;
end if;
end if;
end if;
end Get;
----------
-- Gets --
----------
procedure Gets
(From : String;
ItemR : out Long_Long_Float;
ItemI : out Long_Long_Float;
Last : out Positive)
is
Paren : Boolean;
Pos : Integer;
begin
String_Skip (From, Pos);
if From (Pos) = '(' then
Pos := Pos + 1;
Paren := True;
else
Paren := False;
end if;
Aux.Gets (From (Pos .. From'Last), ItemR, Pos);
String_Skip (From (Pos + 1 .. From'Last), Pos);
if From (Pos) = ',' then
Pos := Pos + 1;
end if;
Aux.Gets (From (Pos .. From'Last), ItemI, Pos);
if Paren then
String_Skip (From (Pos + 1 .. From'Last), Pos);
if From (Pos) /= ')' then
raise Data_Error;
end if;
end if;
Last := Pos;
end Gets;
---------
-- Put --
---------
procedure Put
(File : File_Type;
ItemR : Long_Long_Float;
ItemI : Long_Long_Float;
Fore : Field;
Aft : Field;
Exp : Field)
is
begin
Put (File, '(');
Aux.Put (File, ItemR, Fore, Aft, Exp);
Put (File, ',');
Aux.Put (File, ItemI, Fore, Aft, Exp);
Put (File, ')');
end Put;
----------
-- Puts --
----------
procedure Puts
(To : out String;
ItemR : Long_Long_Float;
ItemI : Long_Long_Float;
Aft : Field;
Exp : Field)
is
I_String : String (1 .. 3 * Field'Last);
R_String : String (1 .. 3 * Field'Last);
Iptr : Natural;
Rptr : Natural;
begin
-- Both parts are initially converted with a Fore of 0
Rptr := 0;
Set_Image_Real (ItemR, R_String, Rptr, 0, Aft, Exp);
Iptr := 0;
Set_Image_Real (ItemI, I_String, Iptr, 0, Aft, Exp);
-- Check room for both parts plus parens plus comma (RM G.1.3(34))
if Rptr + Iptr + 3 > To'Length then
raise Layout_Error;
end if;
-- If there is room, layout result according to (RM G.1.3(31-33))
To (To'First) := '(';
To (To'First + 1 .. To'First + Rptr) := R_String (1 .. Rptr);
To (To'First + Rptr + 1) := ',';
To (To'Last) := ')';
To (To'Last - Iptr .. To'Last - 1) := I_String (1 .. Iptr);
for J in To'First + Rptr + 2 .. To'Last - Iptr - 1 loop
To (J) := ' ';
end loop;
end Puts;
end Ada.Text_IO.Complex_Aux;
| 30.73399 | 78 | 0.44911 |
fb31c469903e91b5f7400e6b36e1687b0017ea51 | 988 | adb | Ada | gdb-7.3/gdb/testsuite/gdb.ada/ptype_tagged_param/pck.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | gdb-7.3/gdb/testsuite/gdb.ada/ptype_tagged_param/pck.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | gdb-7.3/gdb/testsuite/gdb.ada/ptype_tagged_param/pck.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | -- Copyright 2010, 2011 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
function Position_X (S : in Shape) return Integer is
begin
return S.X;
end Position_X;
function Area (C : in Circle) return Integer is
begin
-- Very crude calculation...
return 6 * C.R * C.R;
end Area;
end Pck;
| 31.870968 | 73 | 0.704453 |
1c4fef9a11f539da92b36e1896ff9673e124070c | 467 | ads | Ada | 1-base/lace/applet/demo/event/distributed/source/chat-registrar.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 1-base/lace/applet/demo/event/distributed/source/chat-registrar.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 1-base/lace/applet/demo/event/distributed/source/chat-registrar.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
chat.Client;
package chat.Registrar
--
-- A singleton providing the central chat registrar.
-- Limited to a maximum of 5_000 chat clients running at once.
--
is
pragma remote_Call_interface;
Name_already_used : exception;
procedure register (the_Client : in Client.view);
procedure deregister (the_Client : in Client.view);
function all_Clients return chat.Client.views;
procedure ping;
procedure shutdown;
end chat.Registrar;
| 20.304348 | 62 | 0.738758 |
0b917753d197037bbcd07c2156b352f16cce2bf9 | 1,361 | ads | Ada | ada-wide_text_io-unbounded_io.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-wide_text_io-unbounded_io.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-wide_text_io-unbounded_io.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Strings.Wide_Unbounded;
package Ada.Wide_Text_IO.Unbounded_IO is
procedure Put
(File : in File_Type;
Item : in Strings.Wide_Unbounded.Wide_Unbounded_String);
procedure Put
(Item : in Strings.Wide_Unbounded.Wide_Unbounded_String);
procedure Put_Line
(File : in File_Type;
Item : in Strings.Wide_Unbounded.Wide_Unbounded_String);
procedure Put_Line
(Item : in Strings.Wide_Unbounded.Wide_Unbounded_String);
function Get_Line
(File : in File_Type)
return Strings.Wide_Unbounded.Wide_Unbounded_String;
function Get_Line
return Strings.Wide_Unbounded.Wide_Unbounded_String;
procedure Get_Line
(File : in File_Type;
Item : out Strings.Wide_Unbounded.Wide_Unbounded_String);
procedure Get_Line
(Item : out Strings.Wide_Unbounded.Wide_Unbounded_String);
end Ada.Wide_Text_IO.Unbounded_IO;
| 30.931818 | 75 | 0.692138 |
12d3d5c510cc5c76492f171782f850dd4f5f8dd9 | 91,241 | adb | Ada | tools-src/gnu/gcc/gcc/ada/layout.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/layout.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/layout.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L A Y O U T --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Checks; use Checks;
with Debug; use Debug;
with Einfo; use Einfo;
with Errout; use Errout;
with Exp_Ch3; use Exp_Ch3;
with Exp_Util; use Exp_Util;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Repinfo; use Repinfo;
with Sem; use Sem;
with Sem_Ch13; use Sem_Ch13;
with Sem_Eval; use Sem_Eval;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stand; use Stand;
with Targparm; use Targparm;
with Tbuild; use Tbuild;
with Ttypes; use Ttypes;
with Uintp; use Uintp;
package body Layout is
------------------------
-- Local Declarations --
------------------------
SSU : constant Int := Ttypes.System_Storage_Unit;
-- Short hand for System_Storage_Unit
Vname : constant Name_Id := Name_uV;
-- Formal parameter name used for functions generated for size offset
-- values that depend on the discriminant. All such functions have the
-- following form:
--
-- function xxx (V : vtyp) return Unsigned is
-- begin
-- return ... expression involving V.discrim
-- end xxx;
-----------------------
-- Local Subprograms --
-----------------------
procedure Adjust_Esize_Alignment (E : Entity_Id);
-- E is the entity for a type or object. This procedure checks that the
-- size and alignment are compatible, and if not either gives an error
-- message if they cannot be adjusted or else adjusts them appropriately.
function Assoc_Add
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
-- This is like Make_Op_Add except that it optimizes some cases knowing
-- that associative rearrangement is allowed for constant folding if one
-- of the operands is a compile time known value.
function Assoc_Multiply
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
-- This is like Make_Op_Multiply except that it optimizes some cases
-- knowing that associative rearrangement is allowed for constant
-- folding if one of the operands is a compile time known value
function Assoc_Subtract
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
-- This is like Make_Op_Subtract except that it optimizes some cases
-- knowing that associative rearrangement is allowed for constant
-- folding if one of the operands is a compile time known value
function Compute_Length (Lo : Node_Id; Hi : Node_Id) return Node_Id;
-- Given expressions for the low bound (Lo) and the high bound (Hi),
-- Build an expression for the value hi-lo+1, converted to type
-- Standard.Unsigned. Takes care of the case where the operands
-- are of an enumeration type (so that the subtraction cannot be
-- done directly) by applying the Pos operator to Hi/Lo first.
function Expr_From_SO_Ref
(Loc : Source_Ptr;
D : SO_Ref)
return Node_Id;
-- Given a value D from a size or offset field, return an expression
-- representing the value stored. If the value is known at compile time,
-- then an N_Integer_Literal is returned with the appropriate value. If
-- the value references a constant entity, then an N_Identifier node
-- referencing this entity is returned. The Loc value is used for the
-- Sloc value of constructed notes.
function SO_Ref_From_Expr
(Expr : Node_Id;
Ins_Type : Entity_Id;
Vtype : Entity_Id := Empty)
return Dynamic_SO_Ref;
-- This routine is used in the case where a size/offset value is dynamic
-- and is represented by the expression Expr. SO_Ref_From_Expr checks if
-- the Expr contains a reference to the identifier V, and if so builds
-- a function depending on discriminants of the formal parameter V which
-- is of type Vtype. If not, then a constant entity with the value Expr
-- is built. The result is a Dynamic_SO_Ref to the created entity. Note
-- that Vtype can be omitted if Expr does not contain any reference to V.
-- the created entity. The declaration created is inserted in the freeze
-- actions of Ins_Type, which also supplies the Sloc for created nodes.
-- This function also takes care of making sure that the expression is
-- properly analyzed and resolved (which may not be the case yet if we
-- build the expression in this unit).
function Get_Max_Size (E : Entity_Id) return Node_Id;
-- E is an array type or subtype that has at least one index bound that
-- is the value of a record discriminant. For such an array, the function
-- computes an expression that yields the maximum possible size of the
-- array in storage units. The result is not defined for any other type,
-- or for arrays that do not depend on discriminants, and it is a fatal
-- error to call this unless Size_Depends_On_Discrminant (E) is True.
procedure Layout_Array_Type (E : Entity_Id);
-- Front end layout of non-bit-packed array type or subtype
procedure Layout_Record_Type (E : Entity_Id);
-- Front end layout of record type
-- Variant records not handled yet ???
procedure Rewrite_Integer (N : Node_Id; V : Uint);
-- Rewrite node N with an integer literal whose value is V. The Sloc
-- for the new node is taken from N, and the type of the literal is
-- set to a copy of the type of N on entry.
procedure Set_And_Check_Static_Size
(E : Entity_Id;
Esiz : SO_Ref;
RM_Siz : SO_Ref);
-- This procedure is called to check explicit given sizes (possibly
-- stored in the Esize and RM_Size fields of E) against computed
-- Object_Size (Esiz) and Value_Size (RM_Siz) values. Appropriate
-- errors and warnings are posted if specified sizes are inconsistent
-- with specified sizes. On return, the Esize and RM_Size fields of
-- E are set (either from previously given values, or from the newly
-- computed values, as appropriate).
----------------------------
-- Adjust_Esize_Alignment --
----------------------------
procedure Adjust_Esize_Alignment (E : Entity_Id) is
Abits : Int;
Esize_Set : Boolean;
begin
-- Nothing to do if size unknown
if Unknown_Esize (E) then
return;
end if;
-- Determine if size is constrained by an attribute definition clause
-- which must be obeyed. If so, we cannot increase the size in this
-- routine.
-- For a type, the issue is whether an object size clause has been
-- set. A normal size clause constrains only the value size (RM_Size)
if Is_Type (E) then
Esize_Set := Has_Object_Size_Clause (E);
-- For an object, the issue is whether a size clause is present
else
Esize_Set := Has_Size_Clause (E);
end if;
-- If size is known it must be a multiple of the byte size
if Esize (E) mod SSU /= 0 then
-- If not, and size specified, then give error
if Esize_Set then
Error_Msg_NE
("size for& not a multiple of byte size", Size_Clause (E), E);
return;
-- Otherwise bump up size to a byte boundary
else
Set_Esize (E, (Esize (E) + SSU - 1) / SSU * SSU);
end if;
end if;
-- Now we have the size set, it must be a multiple of the alignment
-- nothing more we can do here if the alignment is unknown here.
if Unknown_Alignment (E) then
return;
end if;
-- At this point both the Esize and Alignment are known, so we need
-- to make sure they are consistent.
Abits := UI_To_Int (Alignment (E)) * SSU;
if Esize (E) mod Abits = 0 then
return;
end if;
-- Here we have a situation where the Esize is not a multiple of
-- the alignment. We must either increase Esize or reduce the
-- alignment to correct this situation.
-- The case in which we can decrease the alignment is where the
-- alignment was not set by an alignment clause, and the type in
-- question is a discrete type, where it is definitely safe to
-- reduce the alignment. For example:
-- t : integer range 1 .. 2;
-- for t'size use 8;
-- In this situation, the initial alignment of t is 4, copied from
-- the Integer base type, but it is safe to reduce it to 1 at this
-- stage, since we will only be loading a single byte.
if Is_Discrete_Type (Etype (E))
and then not Has_Alignment_Clause (E)
then
loop
Abits := Abits / 2;
exit when Esize (E) mod Abits = 0;
end loop;
Init_Alignment (E, Abits / SSU);
return;
end if;
-- Now the only possible approach left is to increase the Esize
-- but we can't do that if the size was set by a specific clause.
if Esize_Set then
Error_Msg_NE
("size for& is not a multiple of alignment",
Size_Clause (E), E);
-- Otherwise we can indeed increase the size to a multiple of alignment
else
Set_Esize (E, ((Esize (E) + (Abits - 1)) / Abits) * Abits);
end if;
end Adjust_Esize_Alignment;
---------------
-- Assoc_Add --
---------------
function Assoc_Add
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id
is
L : Node_Id;
R : Uint;
begin
-- Case of right operand is a constant
if Compile_Time_Known_Value (Right_Opnd) then
L := Left_Opnd;
R := Expr_Value (Right_Opnd);
-- Case of left operand is a constant
elsif Compile_Time_Known_Value (Left_Opnd) then
L := Right_Opnd;
R := Expr_Value (Left_Opnd);
-- Neither operand is a constant, do the addition with no optimization
else
return Make_Op_Add (Loc, Left_Opnd, Right_Opnd);
end if;
-- Case of left operand is an addition
if Nkind (L) = N_Op_Add then
-- (C1 + E) + C2 = (C1 + C2) + E
if Compile_Time_Known_Value (Sinfo.Left_Opnd (L)) then
Rewrite_Integer
(Sinfo.Left_Opnd (L),
Expr_Value (Sinfo.Left_Opnd (L)) + R);
return L;
-- (E + C1) + C2 = E + (C1 + C2)
elsif Compile_Time_Known_Value (Sinfo.Right_Opnd (L)) then
Rewrite_Integer
(Sinfo.Right_Opnd (L),
Expr_Value (Sinfo.Right_Opnd (L)) + R);
return L;
end if;
-- Case of left operand is a subtraction
elsif Nkind (L) = N_Op_Subtract then
-- (C1 - E) + C2 = (C1 + C2) + E
if Compile_Time_Known_Value (Sinfo.Left_Opnd (L)) then
Rewrite_Integer
(Sinfo.Left_Opnd (L),
Expr_Value (Sinfo.Left_Opnd (L)) + R);
return L;
-- (E - C1) + C2 = E - (C1 - C2)
elsif Compile_Time_Known_Value (Sinfo.Right_Opnd (L)) then
Rewrite_Integer
(Sinfo.Right_Opnd (L),
Expr_Value (Sinfo.Right_Opnd (L)) - R);
return L;
end if;
end if;
-- Not optimizable, do the addition
return Make_Op_Add (Loc, Left_Opnd, Right_Opnd);
end Assoc_Add;
--------------------
-- Assoc_Multiply --
--------------------
function Assoc_Multiply
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id
is
L : Node_Id;
R : Uint;
begin
-- Case of right operand is a constant
if Compile_Time_Known_Value (Right_Opnd) then
L := Left_Opnd;
R := Expr_Value (Right_Opnd);
-- Case of left operand is a constant
elsif Compile_Time_Known_Value (Left_Opnd) then
L := Right_Opnd;
R := Expr_Value (Left_Opnd);
-- Neither operand is a constant, do the multiply with no optimization
else
return Make_Op_Multiply (Loc, Left_Opnd, Right_Opnd);
end if;
-- Case of left operand is an multiplication
if Nkind (L) = N_Op_Multiply then
-- (C1 * E) * C2 = (C1 * C2) + E
if Compile_Time_Known_Value (Sinfo.Left_Opnd (L)) then
Rewrite_Integer
(Sinfo.Left_Opnd (L),
Expr_Value (Sinfo.Left_Opnd (L)) * R);
return L;
-- (E * C1) * C2 = E * (C1 * C2)
elsif Compile_Time_Known_Value (Sinfo.Right_Opnd (L)) then
Rewrite_Integer
(Sinfo.Right_Opnd (L),
Expr_Value (Sinfo.Right_Opnd (L)) * R);
return L;
end if;
end if;
-- Not optimizable, do the multiplication
return Make_Op_Multiply (Loc, Left_Opnd, Right_Opnd);
end Assoc_Multiply;
--------------------
-- Assoc_Subtract --
--------------------
function Assoc_Subtract
(Loc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id
is
L : Node_Id;
R : Uint;
begin
-- Case of right operand is a constant
if Compile_Time_Known_Value (Right_Opnd) then
L := Left_Opnd;
R := Expr_Value (Right_Opnd);
-- Right operand is a constant, do the subtract with no optimization
else
return Make_Op_Subtract (Loc, Left_Opnd, Right_Opnd);
end if;
-- Case of left operand is an addition
if Nkind (L) = N_Op_Add then
-- (C1 + E) - C2 = (C1 - C2) + E
if Compile_Time_Known_Value (Sinfo.Left_Opnd (L)) then
Rewrite_Integer
(Sinfo.Left_Opnd (L),
Expr_Value (Sinfo.Left_Opnd (L)) - R);
return L;
-- (E + C1) - C2 = E + (C1 - C2)
elsif Compile_Time_Known_Value (Sinfo.Right_Opnd (L)) then
Rewrite_Integer
(Sinfo.Right_Opnd (L),
Expr_Value (Sinfo.Right_Opnd (L)) - R);
return L;
end if;
-- Case of left operand is a subtraction
elsif Nkind (L) = N_Op_Subtract then
-- (C1 - E) - C2 = (C1 - C2) + E
if Compile_Time_Known_Value (Sinfo.Left_Opnd (L)) then
Rewrite_Integer
(Sinfo.Left_Opnd (L),
Expr_Value (Sinfo.Left_Opnd (L)) + R);
return L;
-- (E - C1) - C2 = E - (C1 + C2)
elsif Compile_Time_Known_Value (Sinfo.Right_Opnd (L)) then
Rewrite_Integer
(Sinfo.Right_Opnd (L),
Expr_Value (Sinfo.Right_Opnd (L)) + R);
return L;
end if;
end if;
-- Not optimizable, do the subtraction
return Make_Op_Subtract (Loc, Left_Opnd, Right_Opnd);
end Assoc_Subtract;
--------------------
-- Compute_Length --
--------------------
function Compute_Length (Lo : Node_Id; Hi : Node_Id) return Node_Id is
Loc : constant Source_Ptr := Sloc (Lo);
Typ : constant Entity_Id := Etype (Lo);
Lo_Op : Node_Id;
Hi_Op : Node_Id;
begin
Lo_Op := New_Copy_Tree (Lo);
Hi_Op := New_Copy_Tree (Hi);
-- If type is enumeration type, then use Pos attribute to convert
-- to integer type for which subtraction is a permitted operation.
if Is_Enumeration_Type (Typ) then
Lo_Op :=
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Typ, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (Lo_Op));
Hi_Op :=
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Typ, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (Hi_Op));
end if;
return
Assoc_Add (Loc,
Left_Opnd =>
Assoc_Subtract (Loc,
Left_Opnd => Hi_Op,
Right_Opnd => Lo_Op),
Right_Opnd => Make_Integer_Literal (Loc, 1));
end Compute_Length;
----------------------
-- Expr_From_SO_Ref --
----------------------
function Expr_From_SO_Ref
(Loc : Source_Ptr;
D : SO_Ref)
return Node_Id
is
Ent : Entity_Id;
begin
if Is_Dynamic_SO_Ref (D) then
Ent := Get_Dynamic_SO_Entity (D);
if Is_Discrim_SO_Function (Ent) then
return
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Ent, Loc),
Parameter_Associations => New_List (
Make_Identifier (Loc, Chars => Vname)));
else
return New_Occurrence_Of (Ent, Loc);
end if;
else
return Make_Integer_Literal (Loc, D);
end if;
end Expr_From_SO_Ref;
------------------
-- Get_Max_Size --
------------------
function Get_Max_Size (E : Entity_Id) return Node_Id is
Loc : constant Source_Ptr := Sloc (E);
Indx : Node_Id;
Ityp : Entity_Id;
Lo : Node_Id;
Hi : Node_Id;
S : Uint;
Len : Node_Id;
type Val_Status_Type is (Const, Dynamic);
type Val_Type (Status : Val_Status_Type := Const) is
record
case Status is
when Const => Val : Uint;
when Dynamic => Nod : Node_Id;
end case;
end record;
-- Shows the status of the value so far. Const means that the value
-- is constant, and Val is the current constant value. Dynamic means
-- that the value is dynamic, and in this case Nod is the Node_Id of
-- the expression to compute the value.
Size : Val_Type;
-- Calculated value so far if Size.Status = Const,
-- or expression value so far if Size.Status = Dynamic.
SU_Convert_Required : Boolean := False;
-- This is set to True if the final result must be converted from
-- bits to storage units (rounding up to a storage unit boundary).
-----------------------
-- Local Subprograms --
-----------------------
procedure Max_Discrim (N : in out Node_Id);
-- If the node N represents a discriminant, replace it by the maximum
-- value of the discriminant.
procedure Min_Discrim (N : in out Node_Id);
-- If the node N represents a discriminant, replace it by the minimum
-- value of the discriminant.
-----------------
-- Max_Discrim --
-----------------
procedure Max_Discrim (N : in out Node_Id) is
begin
if Nkind (N) = N_Identifier
and then Ekind (Entity (N)) = E_Discriminant
then
N := Type_High_Bound (Etype (N));
end if;
end Max_Discrim;
-----------------
-- Min_Discrim --
-----------------
procedure Min_Discrim (N : in out Node_Id) is
begin
if Nkind (N) = N_Identifier
and then Ekind (Entity (N)) = E_Discriminant
then
N := Type_Low_Bound (Etype (N));
end if;
end Min_Discrim;
-- Start of processing for Get_Max_Size
begin
pragma Assert (Size_Depends_On_Discriminant (E));
-- Initialize status from component size
if Known_Static_Component_Size (E) then
Size := (Const, Component_Size (E));
else
Size := (Dynamic, Expr_From_SO_Ref (Loc, Component_Size (E)));
end if;
-- Loop through indices
Indx := First_Index (E);
while Present (Indx) loop
Ityp := Etype (Indx);
Lo := Type_Low_Bound (Ityp);
Hi := Type_High_Bound (Ityp);
Min_Discrim (Lo);
Max_Discrim (Hi);
-- Value of the current subscript range is statically known
if Compile_Time_Known_Value (Lo)
and then Compile_Time_Known_Value (Hi)
then
S := Expr_Value (Hi) - Expr_Value (Lo) + 1;
-- If known flat bound, entire size of array is zero!
if S <= 0 then
return Make_Integer_Literal (Loc, 0);
end if;
-- Current value is constant, evolve value
if Size.Status = Const then
Size.Val := Size.Val * S;
-- Current value is dynamic
else
-- An interesting little optimization, if we have a pending
-- conversion from bits to storage units, and the current
-- length is a multiple of the storage unit size, then we
-- can take the factor out here statically, avoiding some
-- extra dynamic computations at the end.
if SU_Convert_Required and then S mod SSU = 0 then
S := S / SSU;
SU_Convert_Required := False;
end if;
Size.Nod :=
Assoc_Multiply (Loc,
Left_Opnd => Size.Nod,
Right_Opnd =>
Make_Integer_Literal (Loc, Intval => S));
end if;
-- Value of the current subscript range is dynamic
else
-- If the current size value is constant, then here is where we
-- make a transition to dynamic values, which are always stored
-- in storage units, However, we do not want to convert to SU's
-- too soon, consider the case of a packed array of single bits,
-- we want to do the SU conversion after computing the size in
-- this case.
if Size.Status = Const then
-- If the current value is a multiple of the storage unit,
-- then most certainly we can do the conversion now, simply
-- by dividing the current value by the storage unit value.
-- If this works, we set SU_Convert_Required to False.
if Size.Val mod SSU = 0 then
Size :=
(Dynamic, Make_Integer_Literal (Loc, Size.Val / SSU));
SU_Convert_Required := False;
-- Otherwise, we go ahead and convert the value in bits,
-- and set SU_Convert_Required to True to ensure that the
-- final value is indeed properly converted.
else
Size := (Dynamic, Make_Integer_Literal (Loc, Size.Val));
SU_Convert_Required := True;
end if;
end if;
-- Length is hi-lo+1
Len := Compute_Length (Lo, Hi);
-- Check possible range of Len
declare
OK : Boolean;
LLo : Uint;
LHi : Uint;
begin
Set_Parent (Len, E);
Determine_Range (Len, OK, LLo, LHi);
Len := Convert_To (Standard_Unsigned, Len);
-- If we cannot verify that range cannot be super-flat,
-- we need a max with zero, since length must be non-neg.
if not OK or else LLo < 0 then
Len :=
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Standard_Unsigned, Loc),
Attribute_Name => Name_Max,
Expressions => New_List (
Make_Integer_Literal (Loc, 0),
Len));
end if;
end;
end if;
Next_Index (Indx);
end loop;
-- Here after processing all bounds to set sizes. If the value is
-- a constant, then it is bits, and we just return the value.
if Size.Status = Const then
return Make_Integer_Literal (Loc, Size.Val);
-- Case where the value is dynamic
else
-- Do convert from bits to SU's if needed
if SU_Convert_Required then
-- The expression required is (Size.Nod + SU - 1) / SU
Size.Nod :=
Make_Op_Divide (Loc,
Left_Opnd =>
Make_Op_Add (Loc,
Left_Opnd => Size.Nod,
Right_Opnd => Make_Integer_Literal (Loc, SSU - 1)),
Right_Opnd => Make_Integer_Literal (Loc, SSU));
end if;
return Size.Nod;
end if;
end Get_Max_Size;
-----------------------
-- Layout_Array_Type --
-----------------------
procedure Layout_Array_Type (E : Entity_Id) is
Loc : constant Source_Ptr := Sloc (E);
Ctyp : constant Entity_Id := Component_Type (E);
Indx : Node_Id;
Ityp : Entity_Id;
Lo : Node_Id;
Hi : Node_Id;
S : Uint;
Len : Node_Id;
Insert_Typ : Entity_Id;
-- This is the type with which any generated constants or functions
-- will be associated (i.e. inserted into the freeze actions). This
-- is normally the type being layed out. The exception occurs when
-- we are laying out Itype's which are local to a record type, and
-- whose scope is this record type. Such types do not have freeze
-- nodes (because we have no place to put them).
------------------------------------
-- How An Array Type is Layed Out --
------------------------------------
-- Here is what goes on. We need to multiply the component size of
-- the array (which has already been set) by the length of each of
-- the indexes. If all these values are known at compile time, then
-- the resulting size of the array is the appropriate constant value.
-- If the component size or at least one bound is dynamic (but no
-- discriminants are present), then the size will be computed as an
-- expression that calculates the proper size.
-- If there is at least one discriminant bound, then the size is also
-- computed as an expression, but this expression contains discriminant
-- values which are obtained by selecting from a function parameter, and
-- the size is given by a function that is passed the variant record in
-- question, and whose body is the expression.
type Val_Status_Type is (Const, Dynamic, Discrim);
type Val_Type (Status : Val_Status_Type := Const) is
record
case Status is
when Const =>
Val : Uint;
-- Calculated value so far if Val_Status = Const
when Dynamic | Discrim =>
Nod : Node_Id;
-- Expression value so far if Val_Status /= Const
end case;
end record;
-- Records the value or expression computed so far. Const means that
-- the value is constant, and Val is the current constant value.
-- Dynamic means that the value is dynamic, and in this case Nod is
-- the Node_Id of the expression to compute the value, and Discrim
-- means that at least one bound is a discriminant, in which case Nod
-- is the expression so far (which will be the body of the function).
Size : Val_Type;
-- Value of size computed so far. See comments above.
Vtyp : Entity_Id := Empty;
-- Variant record type for the formal parameter of the
-- discriminant function V if Status = Discrim.
SU_Convert_Required : Boolean := False;
-- This is set to True if the final result must be converted from
-- bits to storage units (rounding up to a storage unit boundary).
procedure Discrimify (N : in out Node_Id);
-- If N represents a discriminant, then the Size.Status is set to
-- Discrim, and Vtyp is set. The parameter N is replaced with the
-- proper expression to extract the discriminant value from V.
----------------
-- Discrimify --
----------------
procedure Discrimify (N : in out Node_Id) is
Decl : Node_Id;
Typ : Entity_Id;
begin
if Nkind (N) = N_Identifier
and then Ekind (Entity (N)) = E_Discriminant
then
Set_Size_Depends_On_Discriminant (E);
if Size.Status /= Discrim then
Decl := Parent (Parent (Entity (N)));
Size := (Discrim, Size.Nod);
Vtyp := Defining_Identifier (Decl);
end if;
Typ := Etype (N);
N :=
Make_Selected_Component (Loc,
Prefix => Make_Identifier (Loc, Chars => Vname),
Selector_Name => New_Occurrence_Of (Entity (N), Loc));
-- Set the Etype attributes of the selected name and its prefix.
-- Analyze_And_Resolve can't be called here because the Vname
-- entity denoted by the prefix will not yet exist (it's created
-- by SO_Ref_From_Expr, called at the end of Layout_Array_Type).
Set_Etype (Prefix (N), Vtyp);
Set_Etype (N, Typ);
end if;
end Discrimify;
-- Start of processing for Layout_Array_Type
begin
-- Default alignment is component alignment
if Unknown_Alignment (E) then
Set_Alignment (E, Alignment (Ctyp));
end if;
-- Calculate proper type for insertions
if Is_Record_Type (Scope (E)) then
Insert_Typ := Scope (E);
else
Insert_Typ := E;
end if;
-- Cannot do anything if Esize of component type unknown
if Unknown_Esize (Ctyp) then
return;
end if;
-- Set component size if not set already
if Unknown_Component_Size (E) then
Set_Component_Size (E, Esize (Ctyp));
end if;
-- (RM 13.3 (48)) says that the size of an unconstrained array
-- is implementation defined. We choose to leave it as Unknown
-- here, and the actual behavior is determined by the back end.
if not Is_Constrained (E) then
return;
end if;
-- Initialize status from component size
if Known_Static_Component_Size (E) then
Size := (Const, Component_Size (E));
else
Size := (Dynamic, Expr_From_SO_Ref (Loc, Component_Size (E)));
end if;
-- Loop to process array indices
Indx := First_Index (E);
while Present (Indx) loop
Ityp := Etype (Indx);
Lo := Type_Low_Bound (Ityp);
Hi := Type_High_Bound (Ityp);
-- Value of the current subscript range is statically known
if Compile_Time_Known_Value (Lo)
and then Compile_Time_Known_Value (Hi)
then
S := Expr_Value (Hi) - Expr_Value (Lo) + 1;
-- If known flat bound, entire size of array is zero!
if S <= 0 then
Set_Esize (E, Uint_0);
Set_RM_Size (E, Uint_0);
return;
end if;
-- If constant, evolve value
if Size.Status = Const then
Size.Val := Size.Val * S;
-- Current value is dynamic
else
-- An interesting little optimization, if we have a pending
-- conversion from bits to storage units, and the current
-- length is a multiple of the storage unit size, then we
-- can take the factor out here statically, avoiding some
-- extra dynamic computations at the end.
if SU_Convert_Required and then S mod SSU = 0 then
S := S / SSU;
SU_Convert_Required := False;
end if;
-- Now go ahead and evolve the expression
Size.Nod :=
Assoc_Multiply (Loc,
Left_Opnd => Size.Nod,
Right_Opnd =>
Make_Integer_Literal (Loc, Intval => S));
end if;
-- Value of the current subscript range is dynamic
else
-- If the current size value is constant, then here is where we
-- make a transition to dynamic values, which are always stored
-- in storage units, However, we do not want to convert to SU's
-- too soon, consider the case of a packed array of single bits,
-- we want to do the SU conversion after computing the size in
-- this case.
if Size.Status = Const then
-- If the current value is a multiple of the storage unit,
-- then most certainly we can do the conversion now, simply
-- by dividing the current value by the storage unit value.
-- If this works, we set SU_Convert_Required to False.
if Size.Val mod SSU = 0 then
Size :=
(Dynamic, Make_Integer_Literal (Loc, Size.Val / SSU));
SU_Convert_Required := False;
-- Otherwise, we go ahead and convert the value in bits,
-- and set SU_Convert_Required to True to ensure that the
-- final value is indeed properly converted.
else
Size := (Dynamic, Make_Integer_Literal (Loc, Size.Val));
SU_Convert_Required := True;
end if;
end if;
Discrimify (Lo);
Discrimify (Hi);
-- Length is hi-lo+1
Len := Compute_Length (Lo, Hi);
-- Check possible range of Len
declare
OK : Boolean;
LLo : Uint;
LHi : Uint;
begin
Set_Parent (Len, E);
Determine_Range (Len, OK, LLo, LHi);
Len := Convert_To (Standard_Unsigned, Len);
-- If range definitely flat or superflat, result size is zero
if OK and then LHi <= 0 then
Set_Esize (E, Uint_0);
Set_RM_Size (E, Uint_0);
return;
end if;
-- If we cannot verify that range cannot be super-flat, we
-- need a maximum with zero, since length cannot be negative.
if not OK or else LLo < 0 then
Len :=
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Standard_Unsigned, Loc),
Attribute_Name => Name_Max,
Expressions => New_List (
Make_Integer_Literal (Loc, 0),
Len));
end if;
end;
-- At this stage, Len has the expression for the length
Size.Nod :=
Assoc_Multiply (Loc,
Left_Opnd => Size.Nod,
Right_Opnd => Len);
end if;
Next_Index (Indx);
end loop;
-- Here after processing all bounds to set sizes. If the value is
-- a constant, then it is bits, and the only thing we need to do
-- is to check against explicit given size and do alignment adjust.
if Size.Status = Const then
Set_And_Check_Static_Size (E, Size.Val, Size.Val);
Adjust_Esize_Alignment (E);
-- Case where the value is dynamic
else
-- Do convert from bits to SU's if needed
if SU_Convert_Required then
-- The expression required is (Size.Nod + SU - 1) / SU
Size.Nod :=
Make_Op_Divide (Loc,
Left_Opnd =>
Make_Op_Add (Loc,
Left_Opnd => Size.Nod,
Right_Opnd => Make_Integer_Literal (Loc, SSU - 1)),
Right_Opnd => Make_Integer_Literal (Loc, SSU));
end if;
-- Now set the dynamic size (the Value_Size is always the same
-- as the Object_Size for arrays whose length is dynamic).
-- ??? If Size.Status = Dynamic, Vtyp will not have been set.
-- The added initialization sets it to Empty now, but is this
-- correct?
Set_Esize (E, SO_Ref_From_Expr (Size.Nod, Insert_Typ, Vtyp));
Set_RM_Size (E, Esize (E));
end if;
end Layout_Array_Type;
-------------------
-- Layout_Object --
-------------------
procedure Layout_Object (E : Entity_Id) is
T : constant Entity_Id := Etype (E);
begin
-- Nothing to do if backend does layout
if not Frontend_Layout_On_Target then
return;
end if;
-- Set size if not set for object and known for type. Use the
-- RM_Size if that is known for the type and Esize is not.
if Unknown_Esize (E) then
if Known_Esize (T) then
Set_Esize (E, Esize (T));
elsif Known_RM_Size (T) then
Set_Esize (E, RM_Size (T));
end if;
end if;
-- Set alignment from type if unknown and type alignment known
if Unknown_Alignment (E) and then Known_Alignment (T) then
Set_Alignment (E, Alignment (T));
end if;
-- Make sure size and alignment are consistent
Adjust_Esize_Alignment (E);
-- Final adjustment, if we don't know the alignment, and the Esize
-- was not set by an explicit Object_Size attribute clause, then
-- we reset the Esize to unknown, since we really don't know it.
if Unknown_Alignment (E)
and then not Has_Size_Clause (E)
then
Set_Esize (E, Uint_0);
end if;
end Layout_Object;
------------------------
-- Layout_Record_Type --
------------------------
procedure Layout_Record_Type (E : Entity_Id) is
Loc : constant Source_Ptr := Sloc (E);
Decl : Node_Id;
Comp : Entity_Id;
-- Current component being layed out
Prev_Comp : Entity_Id;
-- Previous layed out component
procedure Get_Next_Component_Location
(Prev_Comp : Entity_Id;
Align : Uint;
New_Npos : out SO_Ref;
New_Fbit : out SO_Ref;
New_NPMax : out SO_Ref;
Force_SU : Boolean);
-- Given the previous component in Prev_Comp, which is already laid
-- out, and the alignment of the following component, lays out the
-- following component, and returns its starting position in New_Npos
-- (Normalized_Position value), New_Fbit (Normalized_First_Bit value),
-- and New_NPMax (Normalized_Position_Max value). If Prev_Comp is empty
-- (no previous component is present), then New_Npos, New_Fbit and
-- New_NPMax are all set to zero on return. This procedure is also
-- used to compute the size of a record or variant by giving it the
-- last component, and the record alignment. Force_SU is used to force
-- the new component location to be aligned on a storage unit boundary,
-- even in a packed record, False means that the new position does not
-- need to be bumped to a storage unit boundary, True means a storage
-- unit boundary is always required.
procedure Layout_Component (Comp : Entity_Id; Prev_Comp : Entity_Id);
-- Lays out component Comp, given Prev_Comp, the previously laid-out
-- component (Prev_Comp = Empty if no components laid out yet). The
-- alignment of the record itself is also updated if needed. Both
-- Comp and Prev_Comp can be either components or discriminants. A
-- special case is when Comp is Empty, this is used at the end
-- to determine the size of the entire record. For this special
-- call the resulting offset is placed in Final_Offset.
procedure Layout_Components
(From : Entity_Id;
To : Entity_Id;
Esiz : out SO_Ref;
RM_Siz : out SO_Ref);
-- This procedure lays out the components of the given component list
-- which contains the components starting with From, and ending with To.
-- The Next_Entity chain is used to traverse the components. On entry
-- Prev_Comp is set to the component preceding the list, so that the
-- list is layed out after this component. Prev_Comp is set to Empty if
-- the component list is to be layed out starting at the start of the
-- record. On return, the components are all layed out, and Prev_Comp is
-- set to the last layed out component. On return, Esiz is set to the
-- resulting Object_Size value, which is the length of the record up
-- to and including the last layed out entity. For Esiz, the value is
-- adjusted to match the alignment of the record. RM_Siz is similarly
-- set to the resulting Value_Size value, which is the same length, but
-- not adjusted to meet the alignment. Note that in the case of variant
-- records, Esiz represents the maximum size.
procedure Layout_Non_Variant_Record;
-- Procedure called to layout a non-variant record type or subtype
procedure Layout_Variant_Record;
-- Procedure called to layout a variant record type. Decl is set to the
-- full type declaration for the variant record.
---------------------------------
-- Get_Next_Component_Location --
---------------------------------
procedure Get_Next_Component_Location
(Prev_Comp : Entity_Id;
Align : Uint;
New_Npos : out SO_Ref;
New_Fbit : out SO_Ref;
New_NPMax : out SO_Ref;
Force_SU : Boolean)
is
begin
-- No previous component, return zero position
if No (Prev_Comp) then
New_Npos := Uint_0;
New_Fbit := Uint_0;
New_NPMax := Uint_0;
return;
end if;
-- Here we have a previous component
declare
Loc : constant Source_Ptr := Sloc (Prev_Comp);
Old_Npos : constant SO_Ref := Normalized_Position (Prev_Comp);
Old_Fbit : constant SO_Ref := Normalized_First_Bit (Prev_Comp);
Old_NPMax : constant SO_Ref := Normalized_Position_Max (Prev_Comp);
Old_Esiz : constant SO_Ref := Esize (Prev_Comp);
Old_Maxsz : Node_Id;
-- Expression representing maximum size of previous component
begin
-- Case where previous field had a dynamic size
if Is_Dynamic_SO_Ref (Esize (Prev_Comp)) then
-- If the previous field had a dynamic length, then it is
-- required to occupy an integral number of storage units,
-- and start on a storage unit boundary. This means that
-- the Normalized_First_Bit value is zero in the previous
-- component, and the new value is also set to zero.
New_Fbit := Uint_0;
-- In this case, the new position is given by an expression
-- that is the sum of old normalized position and old size.
New_Npos :=
SO_Ref_From_Expr
(Assoc_Add (Loc,
Left_Opnd => Expr_From_SO_Ref (Loc, Old_Npos),
Right_Opnd => Expr_From_SO_Ref (Loc, Old_Esiz)),
Ins_Type => E,
Vtype => E);
-- Get maximum size of previous component
if Size_Depends_On_Discriminant (Etype (Prev_Comp)) then
Old_Maxsz := Get_Max_Size (Etype (Prev_Comp));
else
Old_Maxsz := Expr_From_SO_Ref (Loc, Old_Esiz);
end if;
-- Now we can compute the new max position. If the max size
-- is static and the old position is static, then we can
-- compute the new position statically.
if Nkind (Old_Maxsz) = N_Integer_Literal
and then Known_Static_Normalized_Position_Max (Prev_Comp)
then
New_NPMax := Old_NPMax + Intval (Old_Maxsz);
-- Otherwise new max position is dynamic
else
New_NPMax :=
SO_Ref_From_Expr
(Assoc_Add (Loc,
Left_Opnd => Expr_From_SO_Ref (Loc, Old_NPMax),
Right_Opnd => Old_Maxsz),
Ins_Type => E,
Vtype => E);
end if;
-- Previous field has known static Esize
else
New_Fbit := Old_Fbit + Old_Esiz;
-- Bump New_Fbit to storage unit boundary if required
if New_Fbit /= 0 and then Force_SU then
New_Fbit := (New_Fbit + SSU - 1) / SSU * SSU;
end if;
-- If old normalized position is static, we can go ahead
-- and compute the new normalized position directly.
if Known_Static_Normalized_Position (Prev_Comp) then
New_Npos := Old_Npos;
if New_Fbit >= SSU then
New_Npos := New_Npos + New_Fbit / SSU;
New_Fbit := New_Fbit mod SSU;
end if;
-- Bump alignment if stricter than prev
if Align > Alignment (Prev_Comp) then
New_Npos := (New_Npos + Align - 1) / Align * Align;
end if;
-- The max position is always equal to the position if
-- the latter is static, since arrays depending on the
-- values of discriminants never have static sizes.
New_NPMax := New_Npos;
return;
-- Case of old normalized position is dynamic
else
-- If new bit position is within the current storage unit,
-- we can just copy the old position as the result position
-- (we have already set the new first bit value).
if New_Fbit < SSU then
New_Npos := Old_Npos;
New_NPMax := Old_NPMax;
-- If new bit position is past the current storage unit, we
-- need to generate a new dynamic value for the position
-- ??? need to deal with alignment
else
New_Npos :=
SO_Ref_From_Expr
(Assoc_Add (Loc,
Left_Opnd => Expr_From_SO_Ref (Loc, Old_Npos),
Right_Opnd =>
Make_Integer_Literal (Loc,
Intval => New_Fbit / SSU)),
Ins_Type => E,
Vtype => E);
New_NPMax :=
SO_Ref_From_Expr
(Assoc_Add (Loc,
Left_Opnd => Expr_From_SO_Ref (Loc, Old_NPMax),
Right_Opnd =>
Make_Integer_Literal (Loc,
Intval => New_Fbit / SSU)),
Ins_Type => E,
Vtype => E);
New_Fbit := New_Fbit mod SSU;
end if;
end if;
end if;
end;
end Get_Next_Component_Location;
----------------------
-- Layout_Component --
----------------------
procedure Layout_Component (Comp : Entity_Id; Prev_Comp : Entity_Id) is
Ctyp : constant Entity_Id := Etype (Comp);
Npos : SO_Ref;
Fbit : SO_Ref;
NPMax : SO_Ref;
Forc : Boolean;
begin
-- Parent field is always at start of record, this will overlap
-- the actual fields that are part of the parent, and that's fine
if Chars (Comp) = Name_uParent then
Set_Normalized_Position (Comp, Uint_0);
Set_Normalized_First_Bit (Comp, Uint_0);
Set_Normalized_Position_Max (Comp, Uint_0);
Set_Component_Bit_Offset (Comp, Uint_0);
Set_Esize (Comp, Esize (Ctyp));
return;
end if;
-- Check case of type of component has a scope of the record we
-- are laying out. When this happens, the type in question is an
-- Itype that has not yet been layed out (that's because such
-- types do not get frozen in the normal manner, because there
-- is no place for the freeze nodes).
if Scope (Ctyp) = E then
Layout_Type (Ctyp);
end if;
-- Increase alignment of record if necessary. Note that we do not
-- do this for packed records, which have an alignment of one by
-- default, or for records for which an explicit alignment was
-- specified with an alignment clause.
if not Is_Packed (E)
and then not Has_Alignment_Clause (E)
and then Alignment (Ctyp) > Alignment (E)
then
Set_Alignment (E, Alignment (Ctyp));
end if;
-- If component already laid out, then we are done
if Known_Normalized_Position (Comp) then
return;
end if;
-- Set size of component from type. We use the Esize except in a
-- packed record, where we use the RM_Size (since that is exactly
-- what the RM_Size value, as distinct from the Object_Size is
-- useful for!)
if Is_Packed (E) then
Set_Esize (Comp, RM_Size (Ctyp));
else
Set_Esize (Comp, Esize (Ctyp));
end if;
-- Compute the component position from the previous one. See if
-- current component requires being on a storage unit boundary.
-- If record is not packed, we always go to a storage unit boundary
if not Is_Packed (E) then
Forc := True;
-- Packed cases
else
-- Elementary types do not need SU boundary in packed record
if Is_Elementary_Type (Ctyp) then
Forc := False;
-- Packed array types with a modular packed array type do not
-- force a storage unit boundary (since the code generation
-- treats these as equivalent to the underlying modular type),
elsif Is_Array_Type (Ctyp)
and then Is_Bit_Packed_Array (Ctyp)
and then Is_Modular_Integer_Type (Packed_Array_Type (Ctyp))
then
Forc := False;
-- Record types with known length less than or equal to the length
-- of long long integer can also be unaligned, since they can be
-- treated as scalars.
elsif Is_Record_Type (Ctyp)
and then not Is_Dynamic_SO_Ref (Esize (Ctyp))
and then Esize (Ctyp) <= Esize (Standard_Long_Long_Integer)
then
Forc := False;
-- All other cases force a storage unit boundary, even when packed
else
Forc := True;
end if;
end if;
-- Now get the next component location
Get_Next_Component_Location
(Prev_Comp, Alignment (Ctyp), Npos, Fbit, NPMax, Forc);
Set_Normalized_Position (Comp, Npos);
Set_Normalized_First_Bit (Comp, Fbit);
Set_Normalized_Position_Max (Comp, NPMax);
-- Set Component_Bit_Offset in the static case
if Known_Static_Normalized_Position (Comp)
and then Known_Normalized_First_Bit (Comp)
then
Set_Component_Bit_Offset (Comp, SSU * Npos + Fbit);
end if;
end Layout_Component;
-----------------------
-- Layout_Components --
-----------------------
procedure Layout_Components
(From : Entity_Id;
To : Entity_Id;
Esiz : out SO_Ref;
RM_Siz : out SO_Ref)
is
End_Npos : SO_Ref;
End_Fbit : SO_Ref;
End_NPMax : SO_Ref;
begin
-- Only layout components if there are some to layout!
if Present (From) then
-- Layout components with no component clauses
Comp := From;
loop
if (Ekind (Comp) = E_Component
or else Ekind (Comp) = E_Discriminant)
and then No (Component_Clause (Comp))
then
Layout_Component (Comp, Prev_Comp);
Prev_Comp := Comp;
end if;
exit when Comp = To;
Next_Entity (Comp);
end loop;
end if;
-- Set size fields, both are zero if no components
if No (Prev_Comp) then
Esiz := Uint_0;
RM_Siz := Uint_0;
else
-- First the object size, for which we align past the last
-- field to the alignment of the record (the object size
-- is required to be a multiple of the alignment).
Get_Next_Component_Location
(Prev_Comp,
Alignment (E),
End_Npos,
End_Fbit,
End_NPMax,
Force_SU => True);
-- If the resulting normalized position is a dynamic reference,
-- then the size is dynamic, and is stored in storage units.
-- In this case, we set the RM_Size to the same value, it is
-- simply not worth distinguishing Esize and RM_Size values in
-- the dynamic case, since the RM has nothing to say about them.
-- Note that a size cannot have been given in this case, since
-- size specifications cannot be given for variable length types.
declare
Align : constant Uint := Alignment (E);
begin
if Is_Dynamic_SO_Ref (End_Npos) then
RM_Siz := End_Npos;
-- Set the Object_Size allowing for alignment. In the
-- dynamic case, we have to actually do the runtime
-- computation. We can skip this in the non-packed
-- record case if the last component has a smaller
-- alignment than the overall record alignment.
if Is_Dynamic_SO_Ref (End_NPMax) then
Esiz := End_NPMax;
if Is_Packed (E)
or else Alignment (Prev_Comp) < Align
then
-- The expression we build is
-- (expr + align - 1) / align * align
Esiz :=
SO_Ref_From_Expr
(Expr =>
Make_Op_Multiply (Loc,
Left_Opnd =>
Make_Op_Divide (Loc,
Left_Opnd =>
Make_Op_Add (Loc,
Left_Opnd =>
Expr_From_SO_Ref (Loc, Esiz),
Right_Opnd =>
Make_Integer_Literal (Loc,
Intval => Align - 1)),
Right_Opnd =>
Make_Integer_Literal (Loc, Align)),
Right_Opnd =>
Make_Integer_Literal (Loc, Align)),
Ins_Type => E,
Vtype => E);
end if;
-- Here Esiz is static, so we can adjust the alignment
-- directly go give the required aligned value.
else
Esiz := (End_NPMax + Align - 1) / Align * Align * SSU;
end if;
-- Case where computed size is static
else
-- The ending size was computed in Npos in storage units,
-- but the actual size is stored in bits, so adjust
-- accordingly. We also adjust the size to match the
-- alignment here.
Esiz := (End_NPMax + Align - 1) / Align * Align * SSU;
-- Compute the resulting Value_Size (RM_Size). For this
-- purpose we do not force alignment of the record or
-- storage size alignment of the result.
Get_Next_Component_Location
(Prev_Comp,
Uint_0,
End_Npos,
End_Fbit,
End_NPMax,
Force_SU => False);
RM_Siz := End_Npos * SSU + End_Fbit;
Set_And_Check_Static_Size (E, Esiz, RM_Siz);
end if;
end;
end if;
end Layout_Components;
-------------------------------
-- Layout_Non_Variant_Record --
-------------------------------
procedure Layout_Non_Variant_Record is
Esiz : SO_Ref;
RM_Siz : SO_Ref;
begin
Layout_Components (First_Entity (E), Last_Entity (E), Esiz, RM_Siz);
Set_Esize (E, Esiz);
Set_RM_Size (E, RM_Siz);
end Layout_Non_Variant_Record;
---------------------------
-- Layout_Variant_Record --
---------------------------
procedure Layout_Variant_Record is
Tdef : constant Node_Id := Type_Definition (Decl);
Dlist : constant List_Id := Discriminant_Specifications (Decl);
Esiz : SO_Ref;
RM_Siz : SO_Ref;
RM_Siz_Expr : Node_Id := Empty;
-- Expression for the evolving RM_Siz value. This is typically a
-- conditional expression which involves tests of discriminant
-- values that are formed as references to the entity V. At
-- the end of scanning all the components, a suitable function
-- is constructed in which V is the parameter.
-----------------------
-- Local Subprograms --
-----------------------
procedure Layout_Component_List
(Clist : Node_Id;
Esiz : out SO_Ref;
RM_Siz_Expr : out Node_Id);
-- Recursive procedure, called to layout one component list
-- Esiz and RM_Siz_Expr are set to the Object_Size and Value_Size
-- values respectively representing the record size up to and
-- including the last component in the component list (including
-- any variants in this component list). RM_Siz_Expr is returned
-- as an expression which may in the general case involve some
-- references to the discriminants of the current record value,
-- referenced by selecting from the entity V.
---------------------------
-- Layout_Component_List --
---------------------------
procedure Layout_Component_List
(Clist : Node_Id;
Esiz : out SO_Ref;
RM_Siz_Expr : out Node_Id)
is
Citems : constant List_Id := Component_Items (Clist);
Vpart : constant Node_Id := Variant_Part (Clist);
Prv : Node_Id;
Var : Node_Id;
RM_Siz : Uint;
RMS_Ent : Entity_Id;
begin
if Is_Non_Empty_List (Citems) then
Layout_Components
(From => Defining_Identifier (First (Citems)),
To => Defining_Identifier (Last (Citems)),
Esiz => Esiz,
RM_Siz => RM_Siz);
else
Layout_Components (Empty, Empty, Esiz, RM_Siz);
end if;
-- Case where no variants are present in the component list
if No (Vpart) then
-- The Esiz value has been correctly set by the call to
-- Layout_Components, so there is nothing more to be done.
-- For RM_Siz, we have an SO_Ref value, which we must convert
-- to an appropriate expression.
if Is_Static_SO_Ref (RM_Siz) then
RM_Siz_Expr :=
Make_Integer_Literal (Loc,
Intval => RM_Siz);
else
RMS_Ent := Get_Dynamic_SO_Entity (RM_Siz);
-- If the size is represented by a function, then we
-- create an appropriate function call using V as
-- the parameter to the call.
if Is_Discrim_SO_Function (RMS_Ent) then
RM_Siz_Expr :=
Make_Function_Call (Loc,
Name => New_Occurrence_Of (RMS_Ent, Loc),
Parameter_Associations => New_List (
Make_Identifier (Loc, Chars => Vname)));
-- If the size is represented by a constant, then the
-- expression we want is a reference to this constant
else
RM_Siz_Expr := New_Occurrence_Of (RMS_Ent, Loc);
end if;
end if;
-- Case where variants are present in this component list
else
declare
EsizV : SO_Ref;
RM_SizV : Node_Id;
Dchoice : Node_Id;
Discrim : Node_Id;
Dtest : Node_Id;
begin
RM_Siz_Expr := Empty;
Prv := Prev_Comp;
Var := Last (Variants (Vpart));
while Present (Var) loop
Prev_Comp := Prv;
Layout_Component_List
(Component_List (Var), EsizV, RM_SizV);
-- Set the Object_Size. If this is the first variant,
-- we just set the size of this first variant.
if Var = Last (Variants (Vpart)) then
Esiz := EsizV;
-- Otherwise the Object_Size is formed as a maximum
-- of Esiz so far from previous variants, and the new
-- Esiz value from the variant we just processed.
-- If both values are static, we can just compute the
-- maximum directly to save building junk nodes.
elsif not Is_Dynamic_SO_Ref (Esiz)
and then not Is_Dynamic_SO_Ref (EsizV)
then
Esiz := UI_Max (Esiz, EsizV);
-- If either value is dynamic, then we have to generate
-- an appropriate Standard_Unsigned'Max attribute call.
else
Esiz :=
SO_Ref_From_Expr
(Make_Attribute_Reference (Loc,
Attribute_Name => Name_Max,
Prefix =>
New_Occurrence_Of (Standard_Unsigned, Loc),
Expressions => New_List (
Expr_From_SO_Ref (Loc, Esiz),
Expr_From_SO_Ref (Loc, EsizV))),
Ins_Type => E,
Vtype => E);
end if;
-- Now deal with Value_Size (RM_Siz). We are aiming at
-- an expression that looks like:
-- if xxDx (V.disc) then rmsiz1
-- else if xxDx (V.disc) then rmsiz2
-- else ...
-- Where rmsiz1, rmsiz2... are the RM_Siz values for the
-- individual variants, and xxDx are the discriminant
-- checking functions generated for the variant type.
-- If this is the first variant, we simply set the
-- result as the expression. Note that this takes
-- care of the others case.
if No (RM_Siz_Expr) then
RM_Siz_Expr := RM_SizV;
-- Otherwise construct the appropriate test
else
-- Discriminant to be tested
Discrim :=
Make_Selected_Component (Loc,
Prefix =>
Make_Identifier (Loc, Chars => Vname),
Selector_Name =>
New_Occurrence_Of
(Entity (Name (Vpart)), Loc));
-- The test to be used in general is a call to the
-- discriminant checking function. However, it is
-- definitely worth special casing the very common
-- case where a single value is involved.
Dchoice := First (Discrete_Choices (Var));
if No (Next (Dchoice))
and then Nkind (Dchoice) /= N_Range
then
Dtest :=
Make_Op_Eq (Loc,
Left_Opnd => Discrim,
Right_Opnd => New_Copy (Dchoice));
else
Dtest :=
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of
(Dcheck_Function (Var), Loc),
Parameter_Associations => New_List (Discrim));
end if;
RM_Siz_Expr :=
Make_Conditional_Expression (Loc,
Expressions =>
New_List (Dtest, RM_SizV, RM_Siz_Expr));
end if;
Prev (Var);
end loop;
end;
end if;
end Layout_Component_List;
-- Start of processing for Layout_Variant_Record
begin
-- We need the discriminant checking functions, since we generate
-- calls to these functions for the RM_Size expression, so make
-- sure that these functions have been constructed in time.
Build_Discr_Checking_Funcs (Decl);
-- Layout the discriminants
Layout_Components
(From => Defining_Identifier (First (Dlist)),
To => Defining_Identifier (Last (Dlist)),
Esiz => Esiz,
RM_Siz => RM_Siz);
-- Layout the main component list (this will make recursive calls
-- to layout all component lists nested within variants).
Layout_Component_List (Component_List (Tdef), Esiz, RM_Siz_Expr);
Set_Esize (E, Esiz);
-- If the RM_Size is a literal, set its value
if Nkind (RM_Siz_Expr) = N_Integer_Literal then
Set_RM_Size (E, Intval (RM_Siz_Expr));
-- Otherwise we construct a dynamic SO_Ref
else
Set_RM_Size (E,
SO_Ref_From_Expr
(RM_Siz_Expr,
Ins_Type => E,
Vtype => E));
end if;
end Layout_Variant_Record;
-- Start of processing for Layout_Record_Type
begin
-- If this is a cloned subtype, just copy the size fields from the
-- original, nothing else needs to be done in this case, since the
-- components themselves are all shared.
if (Ekind (E) = E_Record_Subtype
or else Ekind (E) = E_Class_Wide_Subtype)
and then Present (Cloned_Subtype (E))
then
Set_Esize (E, Esize (Cloned_Subtype (E)));
Set_RM_Size (E, RM_Size (Cloned_Subtype (E)));
Set_Alignment (E, Alignment (Cloned_Subtype (E)));
-- Another special case, class-wide types. The RM says that the size
-- of such types is implementation defined (RM 13.3(48)). What we do
-- here is to leave the fields set as unknown values, and the backend
-- determines the actual behavior.
elsif Ekind (E) = E_Class_Wide_Type then
null;
-- All other cases
else
-- Initialize aligment conservatively to 1. This value will
-- be increased as necessary during processing of the record.
if Unknown_Alignment (E) then
Set_Alignment (E, Uint_1);
end if;
-- Initialize previous component. This is Empty unless there
-- are components which have already been laid out by component
-- clauses. If there are such components, we start our layout of
-- the remaining components following the last such component
Prev_Comp := Empty;
Comp := First_Entity (E);
while Present (Comp) loop
if (Ekind (Comp) = E_Component
or else Ekind (Comp) = E_Discriminant)
and then Present (Component_Clause (Comp))
then
if No (Prev_Comp)
or else
Component_Bit_Offset (Comp) >
Component_Bit_Offset (Prev_Comp)
then
Prev_Comp := Comp;
end if;
end if;
Next_Entity (Comp);
end loop;
-- We have two separate circuits, one for non-variant records and
-- one for variant records. For non-variant records, we simply go
-- through the list of components. This handles all the non-variant
-- cases including those cases of subtypes where there is no full
-- type declaration, so the tree cannot be used to drive the layout.
-- For variant records, we have to drive the layout from the tree
-- since we need to understand the variant structure in this case.
if Present (Full_View (E)) then
Decl := Declaration_Node (Full_View (E));
else
Decl := Declaration_Node (E);
end if;
-- Scan all the components
if Nkind (Decl) = N_Full_Type_Declaration
and then Has_Discriminants (E)
and then Nkind (Type_Definition (Decl)) = N_Record_Definition
and then
Present (Variant_Part (Component_List (Type_Definition (Decl))))
then
Layout_Variant_Record;
else
Layout_Non_Variant_Record;
end if;
end if;
end Layout_Record_Type;
-----------------
-- Layout_Type --
-----------------
procedure Layout_Type (E : Entity_Id) is
begin
-- For string literal types, for now, kill the size always, this
-- is because gigi does not like or need the size to be set ???
if Ekind (E) = E_String_Literal_Subtype then
Set_Esize (E, Uint_0);
Set_RM_Size (E, Uint_0);
return;
end if;
-- For access types, set size/alignment. This is system address
-- size, except for fat pointers (unconstrained array access types),
-- where the size is two times the address size, to accommodate the
-- two pointers that are required for a fat pointer (data and
-- template). Note that E_Access_Protected_Subprogram_Type is not
-- an access type for this purpose since it is not a pointer but is
-- equivalent to a record. For access subtypes, copy the size from
-- the base type since Gigi represents them the same way.
if Is_Access_Type (E) then
-- If Esize already set (e.g. by a size clause), then nothing
-- further to be done here.
if Known_Esize (E) then
null;
-- Access to subprogram is a strange beast, and we let the
-- backend figure out what is needed (it may be some kind
-- of fat pointer, including the static link for example.
elsif Ekind (E) = E_Access_Protected_Subprogram_Type then
null;
-- For access subtypes, copy the size information from base type
elsif Ekind (E) = E_Access_Subtype then
Set_Size_Info (E, Base_Type (E));
Set_RM_Size (E, RM_Size (Base_Type (E)));
-- For other access types, we use either address size, or, if
-- a fat pointer is used (pointer-to-unconstrained array case),
-- twice the address size to accommodate a fat pointer.
else
declare
Desig : Entity_Id := Designated_Type (E);
begin
if Is_Private_Type (Desig)
and then Present (Full_View (Desig))
then
Desig := Full_View (Desig);
end if;
if (Is_Array_Type (Desig)
and then not Is_Constrained (Desig)
and then not Has_Completion_In_Body (Desig)
and then not Debug_Flag_6)
then
Init_Size (E, 2 * System_Address_Size);
-- Check for bad convention set
if Convention (E) = Convention_C
or else
Convention (E) = Convention_CPP
then
Error_Msg_N
("?this access type does not " &
"correspond to C pointer", E);
end if;
else
Init_Size (E, System_Address_Size);
end if;
end;
end if;
Set_Prim_Alignment (E);
-- Scalar types: set size and alignment
elsif Is_Scalar_Type (E) then
-- For discrete types, the RM_Size and Esize must be set
-- already, since this is part of the earlier processing
-- and the front end is always required to layout the
-- sizes of such types (since they are available as static
-- attributes). All we do is to check that this rule is
-- indeed obeyed!
if Is_Discrete_Type (E) then
-- If the RM_Size is not set, then here is where we set it.
-- Note: an RM_Size of zero looks like not set here, but this
-- is a rare case, and we can simply reset it without any harm.
if not Known_RM_Size (E) then
Set_Discrete_RM_Size (E);
end if;
-- If Esize for a discrete type is not set then set it
if not Known_Esize (E) then
declare
S : Int := 8;
begin
loop
-- If size is big enough, set it and exit
if S >= RM_Size (E) then
Init_Esize (E, S);
exit;
-- If the RM_Size is greater than 64 (happens only
-- when strange values are specified by the user,
-- then Esize is simply a copy of RM_Size, it will
-- be further refined later on)
elsif S = 64 then
Set_Esize (E, RM_Size (E));
exit;
-- Otherwise double possible size and keep trying
else
S := S * 2;
end if;
end loop;
end;
end if;
-- For non-discrete sclar types, if the RM_Size is not set,
-- then set it now to a copy of the Esize if the Esize is set.
else
if Known_Esize (E) and then Unknown_RM_Size (E) then
Set_RM_Size (E, Esize (E));
end if;
end if;
Set_Prim_Alignment (E);
-- Non-primitive types
else
-- If RM_Size is known, set Esize if not known
if Known_RM_Size (E) and then Unknown_Esize (E) then
-- If the alignment is known, we bump the Esize up to the
-- next alignment boundary if it is not already on one.
if Known_Alignment (E) then
declare
A : constant Uint := Alignment_In_Bits (E);
S : constant SO_Ref := RM_Size (E);
begin
Set_Esize (E, (S * A + A - 1) / A);
end;
end if;
-- If Esize is set, and RM_Size is not, RM_Size is copied from
-- Esize at least for now this seems reasonable, and is in any
-- case needed for compatibility with old versions of gigi.
-- look to be unknown.
elsif Known_Esize (E) and then Unknown_RM_Size (E) then
Set_RM_Size (E, Esize (E));
end if;
-- For array base types, set component size if object size of
-- the component type is known and is a small power of 2 (8,
-- 16, 32, 64), since this is what will always be used.
if Ekind (E) = E_Array_Type
and then Unknown_Component_Size (E)
then
declare
CT : constant Entity_Id := Component_Type (E);
begin
-- For some reasons, access types can cause trouble,
-- So let's just do this for discrete types ???
if Present (CT)
and then Is_Discrete_Type (CT)
and then Known_Static_Esize (CT)
then
declare
S : constant Uint := Esize (CT);
begin
if S = 8 or else
S = 16 or else
S = 32 or else
S = 64
then
Set_Component_Size (E, Esize (CT));
end if;
end;
end if;
end;
end if;
end if;
-- Layout array and record types if front end layout set
if Frontend_Layout_On_Target then
if Is_Array_Type (E) and then not Is_Bit_Packed_Array (E) then
Layout_Array_Type (E);
elsif Is_Record_Type (E) then
Layout_Record_Type (E);
end if;
end if;
end Layout_Type;
---------------------
-- Rewrite_Integer --
---------------------
procedure Rewrite_Integer (N : Node_Id; V : Uint) is
Loc : constant Source_Ptr := Sloc (N);
Typ : constant Entity_Id := Etype (N);
begin
Rewrite (N, Make_Integer_Literal (Loc, Intval => V));
Set_Etype (N, Typ);
end Rewrite_Integer;
-------------------------------
-- Set_And_Check_Static_Size --
-------------------------------
procedure Set_And_Check_Static_Size
(E : Entity_Id;
Esiz : SO_Ref;
RM_Siz : SO_Ref)
is
SC : Node_Id;
procedure Check_Size_Too_Small (Spec : Uint; Min : Uint);
-- Spec is the number of bit specified in the size clause, and
-- Min is the minimum computed size. An error is given that the
-- specified size is too small if Spec < Min, and in this case
-- both Esize and RM_Size are set to unknown in E. The error
-- message is posted on node SC.
procedure Check_Unused_Bits (Spec : Uint; Max : Uint);
-- Spec is the number of bits specified in the size clause, and
-- Max is the maximum computed size. A warning is given about
-- unused bits if Spec > Max. This warning is posted on node SC.
--------------------------
-- Check_Size_Too_Small --
--------------------------
procedure Check_Size_Too_Small (Spec : Uint; Min : Uint) is
begin
if Spec < Min then
Error_Msg_Uint_1 := Min;
Error_Msg_NE
("size for & too small, minimum allowed is ^", SC, E);
Init_Esize (E);
Init_RM_Size (E);
end if;
end Check_Size_Too_Small;
-----------------------
-- Check_Unused_Bits --
-----------------------
procedure Check_Unused_Bits (Spec : Uint; Max : Uint) is
begin
if Spec > Max then
Error_Msg_Uint_1 := Spec - Max;
Error_Msg_NE ("?^ bits of & unused", SC, E);
end if;
end Check_Unused_Bits;
-- Start of processing for Set_And_Check_Static_Size
begin
-- Case where Object_Size (Esize) is already set by a size clause
if Known_Static_Esize (E) then
SC := Size_Clause (E);
if No (SC) then
SC := Get_Attribute_Definition_Clause (E, Attribute_Object_Size);
end if;
-- Perform checks on specified size against computed sizes
if Present (SC) then
Check_Unused_Bits (Esize (E), Esiz);
Check_Size_Too_Small (Esize (E), RM_Siz);
end if;
end if;
-- Case where Value_Size (RM_Size) is set by specific Value_Size
-- clause (we do not need to worry about Value_Size being set by
-- a Size clause, since that will have set Esize as well, and we
-- already took care of that case).
if Known_Static_RM_Size (E) then
SC := Get_Attribute_Definition_Clause (E, Attribute_Value_Size);
-- Perform checks on specified size against computed sizes
if Present (SC) then
Check_Unused_Bits (RM_Size (E), Esiz);
Check_Size_Too_Small (RM_Size (E), RM_Siz);
end if;
end if;
-- Set sizes if unknown
if Unknown_Esize (E) then
Set_Esize (E, Esiz);
end if;
if Unknown_RM_Size (E) then
Set_RM_Size (E, RM_Siz);
end if;
end Set_And_Check_Static_Size;
--------------------------
-- Set_Discrete_RM_Size --
--------------------------
procedure Set_Discrete_RM_Size (Def_Id : Entity_Id) is
FST : constant Entity_Id := First_Subtype (Def_Id);
begin
-- All discrete types except for the base types in standard
-- are constrained, so indicate this by setting Is_Constrained.
Set_Is_Constrained (Def_Id);
-- We set generic types to have an unknown size, since the
-- representation of a generic type is irrelevant, in view
-- of the fact that they have nothing to do with code.
if Is_Generic_Type (Root_Type (FST)) then
Set_RM_Size (Def_Id, Uint_0);
-- If the subtype statically matches the first subtype, then
-- it is required to have exactly the same layout. This is
-- required by aliasing considerations.
elsif Def_Id /= FST and then
Subtypes_Statically_Match (Def_Id, FST)
then
Set_RM_Size (Def_Id, RM_Size (FST));
Set_Size_Info (Def_Id, FST);
-- In all other cases the RM_Size is set to the minimum size.
-- Note that this routine is never called for subtypes for which
-- the RM_Size is set explicitly by an attribute clause.
else
Set_RM_Size (Def_Id, UI_From_Int (Minimum_Size (Def_Id)));
end if;
end Set_Discrete_RM_Size;
------------------------
-- Set_Prim_Alignment --
------------------------
procedure Set_Prim_Alignment (E : Entity_Id) is
begin
-- Do not set alignment for packed array types, unless we are doing
-- front end layout, because otherwise this is always handled in the
-- backend.
if Is_Packed_Array_Type (E) and then not Frontend_Layout_On_Target then
return;
-- If there is an alignment clause, then we respect it
elsif Has_Alignment_Clause (E) then
return;
-- If the size is not set, then don't attempt to set the alignment. This
-- happens in the backend layout case for access to subprogram types.
elsif not Known_Static_Esize (E) then
return;
-- For access types, do not set the alignment if the size is less than
-- the allowed minimum size. This avoids cascaded error messages.
elsif Is_Access_Type (E)
and then Esize (E) < System_Address_Size
then
return;
end if;
-- Here we calculate the alignment as the largest power of two
-- multiple of System.Storage_Unit that does not exceed either
-- the actual size of the type, or the maximum allowed alignment.
declare
S : constant Int :=
UI_To_Int (Esize (E)) / SSU;
A : Nat;
begin
A := 1;
while 2 * A <= Ttypes.Maximum_Alignment
and then 2 * A <= S
loop
A := 2 * A;
end loop;
-- Now we think we should set the alignment to A, but we
-- skip this if an alignment is already set to a value
-- greater than A (happens for derived types).
-- However, if the alignment is known and too small it
-- must be increased, this happens in a case like:
-- type R is new Character;
-- for R'Size use 16;
-- Here the alignment inherited from Character is 1, but
-- it must be increased to 2 to reflect the increased size.
if Unknown_Alignment (E) or else Alignment (E) < A then
Init_Alignment (E, A);
end if;
end;
end Set_Prim_Alignment;
----------------------
-- SO_Ref_From_Expr --
----------------------
function SO_Ref_From_Expr
(Expr : Node_Id;
Ins_Type : Entity_Id;
Vtype : Entity_Id := Empty)
return Dynamic_SO_Ref
is
Loc : constant Source_Ptr := Sloc (Ins_Type);
K : constant Entity_Id :=
Make_Defining_Identifier (Loc,
Chars => New_Internal_Name ('K'));
Decl : Node_Id;
function Check_Node_V_Ref (N : Node_Id) return Traverse_Result;
-- Function used to check one node for reference to V
function Has_V_Ref is new Traverse_Func (Check_Node_V_Ref);
-- Function used to traverse tree to check for reference to V
----------------------
-- Check_Node_V_Ref --
----------------------
function Check_Node_V_Ref (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) = N_Identifier then
if Chars (N) = Vname then
return Abandon;
else
return Skip;
end if;
else
return OK;
end if;
end Check_Node_V_Ref;
-- Start of processing for SO_Ref_From_Expr
begin
-- Case of expression is an integer literal, in this case we just
-- return the value (which must always be non-negative, since size
-- and offset values can never be negative).
if Nkind (Expr) = N_Integer_Literal then
pragma Assert (Intval (Expr) >= 0);
return Intval (Expr);
end if;
-- Case where there is a reference to V, create function
if Has_V_Ref (Expr) = Abandon then
pragma Assert (Present (Vtype));
Set_Is_Discrim_SO_Function (K);
Decl :=
Make_Subprogram_Body (Loc,
Specification =>
Make_Function_Specification (Loc,
Defining_Unit_Name => K,
Parameter_Specifications => New_List (
Make_Parameter_Specification (Loc,
Defining_Identifier =>
Make_Defining_Identifier (Loc, Chars => Vname),
Parameter_Type =>
New_Occurrence_Of (Vtype, Loc))),
Subtype_Mark =>
New_Occurrence_Of (Standard_Unsigned, Loc)),
Declarations => Empty_List,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Make_Return_Statement (Loc,
Expression => Expr))));
-- No reference to V, create constant
else
Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => K,
Object_Definition =>
New_Occurrence_Of (Standard_Unsigned, Loc),
Constant_Present => True,
Expression => Expr);
end if;
Append_Freeze_Action (Ins_Type, Decl);
Analyze (Decl);
return Create_Dynamic_SO_Ref (K);
end SO_Ref_From_Expr;
end Layout;
| 35.201003 | 79 | 0.53545 |
100e00b4c492f93217d6751ec36bef902c5f6a9b | 3,902 | ads | Ada | source/nodes/program-nodes-selected_components.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-selected_components.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-selected_components.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Selected_Components;
with Program.Element_Visitors;
package Program.Nodes.Selected_Components is
pragma Preelaborate;
type Selected_Component is
new Program.Nodes.Node
and Program.Elements.Selected_Components.Selected_Component
and Program.Elements.Selected_Components.Selected_Component_Text
with private;
function Create
(Prefix : not null Program.Elements.Expressions.Expression_Access;
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Selector : not null Program.Elements.Expressions.Expression_Access)
return Selected_Component;
type Implicit_Selected_Component is
new Program.Nodes.Node
and Program.Elements.Selected_Components.Selected_Component
with private;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Selected_Component
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Selected_Component is
abstract new Program.Nodes.Node
and Program.Elements.Selected_Components.Selected_Component
with record
Prefix : not null Program.Elements.Expressions.Expression_Access;
Selector : not null Program.Elements.Expressions.Expression_Access;
end record;
procedure Initialize (Self : in out Base_Selected_Component'Class);
overriding procedure Visit
(Self : not null access Base_Selected_Component;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Prefix
(Self : Base_Selected_Component)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Selector
(Self : Base_Selected_Component)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Is_Selected_Component
(Self : Base_Selected_Component)
return Boolean;
overriding function Is_Expression
(Self : Base_Selected_Component)
return Boolean;
type Selected_Component is
new Base_Selected_Component
and Program.Elements.Selected_Components.Selected_Component_Text
with record
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
end record;
overriding function To_Selected_Component_Text
(Self : in out Selected_Component)
return Program.Elements.Selected_Components
.Selected_Component_Text_Access;
overriding function Dot_Token
(Self : Selected_Component)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Selected_Component is
new Base_Selected_Component
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Selected_Component_Text
(Self : in out Implicit_Selected_Component)
return Program.Elements.Selected_Components
.Selected_Component_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Selected_Component)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Selected_Component)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Selected_Component)
return Boolean;
end Program.Nodes.Selected_Components;
| 33.350427 | 77 | 0.741415 |
501691ad6309bdd70fb60d1957ab07f2bbb5ca65 | 1,797 | adb | Ada | src/extraction-primitive_subps.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | src/extraction-primitive_subps.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | src/extraction-primitive_subps.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | with Extraction.Node_Edge_Types;
with Extraction.Utilities;
package body Extraction.Primitive_Subps is
use type LAL.Analysis_Unit;
use type LALCO.Ada_Node_Kind_Type;
procedure Extract_Nodes
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.Kind = LALCO.Ada_Type_Decl
then
declare
Type_Decl : constant LAL.Type_Decl := Node.As_Type_Decl;
Primitives : constant LAL.Basic_Decl_Array :=
Type_Decl.P_Get_Primitives;
begin
-- Add non-standard subprograms that are primitive
-- even if external.
for Basic_Decl of Primitives loop
if Basic_Decl.Unit /= Basic_Decl.P_Standard_Unit then
Graph.Write_Node (Basic_Decl);
end if;
end loop;
end;
end if;
end Extract_Nodes;
procedure Extract_Edges
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.Kind = LALCO.Ada_Type_Decl
then
declare
Type_Decl : constant LAL.Type_Decl := Node.As_Type_Decl;
Primitives : constant LAL.Basic_Decl_Array :=
Type_Decl.P_Get_Primitives;
begin
for Basic_Decl of Primitives loop
if Basic_Decl.Unit /= Basic_Decl.P_Standard_Unit then
Graph.Write_Edge
(Basic_Decl, Type_Decl,
Node_Edge_Types.Edge_Type_Is_Primitive_Subprogram_Of);
end if;
end loop;
end;
end if;
end Extract_Edges;
end Extraction.Primitive_Subps;
| 32.089286 | 76 | 0.616583 |
4da5a6adeca6bd28e98460322a1f07be4aca0aa8 | 115,088 | adb | Ada | bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/StreamingDataWidthCo.adb | IceyFong/Lutification | 3e42d34d6840d5deb84407aad5c58216527a4b0a | [
"BSD-3-Clause"
] | null | null | null | bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/StreamingDataWidthCo.adb | IceyFong/Lutification | 3e42d34d6840d5deb84407aad5c58216527a4b0a | [
"BSD-3-Clause"
] | null | null | null | bnn/src/network/output/hls-syn/lfcW1A1-pynqZ1-Z2/sol1/.autopilot/db/StreamingDataWidthCo.adb | IceyFong/Lutification | 3e42d34d6840d5deb84407aad5c58216527a4b0a | [
"BSD-3-Clause"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>StreamingDataWidthCo</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</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>in_V_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.V.V</originalName>
<rtlName/>
<coreName>FSL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_V_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.V.V</originalName>
<rtlName/>
<coreName>FSL</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>numReps</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FSL</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="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>numReps_out</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FSL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>numReps_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>numReps</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</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/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_123_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>51</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>p_1_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>278</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>278</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>o_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>282</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>282</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>t_i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>t</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>exitcond_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_i_fu_129_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>t</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>t</originalName>
<rtlName>t_fu_134_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>71</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>72</item>
<item>73</item>
<item>74</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_1_cast_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_1_cast_i_fu_166_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>tmp_1_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_1_i_fu_140_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_V_2</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>272</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>272</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>273</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>273</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_Val2_s</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ei.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>eo_V</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>275</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>275</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>eo.V</originalName>
<rtlName>out_V_V_din</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>r_V_cast_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>278</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>278</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_1_i_reg_79</rtlName>
<coreName/>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
<item>98</item>
<item>100</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>o</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>280</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>280</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>o</originalName>
<rtlName>o_fu_146_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>101</item>
<item>102</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_5_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>282</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>282</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_5_i_fu_152_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>103</item>
<item>105</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_i</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>282</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>282</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_i_fu_158_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name/>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/streamtools.h</first>
<second>StreamingDataWidthConverter_Batch&lt;32, 8, 32&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>50</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>53</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>58</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>70</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>97</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>99</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_36">
<Obj>
<type>3</type>
<id>13</id>
<name>entry</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>8</item>
<item>10</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_37">
<Obj>
<type>3</type>
<id>20</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<Obj>
<type>3</type>
<id>26</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>21</item>
<item>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>29</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>28</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>39</id>
<name>._crit_edge.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>30</item>
<item>31</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="_41">
<Obj>
<type>3</type>
<id>41</id>
<name>.exit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>58</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_42">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>52</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>55</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>60</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>73</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>74</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>80</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>86</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>200</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>201</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>202</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>203</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>204</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>205</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>20</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_100">
<mId>1</mId>
<mTag>StreamingDataWidthCo</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>-1</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_101">
<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>13</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"/>
</item>
<item class_id_reference="22" object_id="_102">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>20</item>
<item>26</item>
<item>29</item>
<item>39</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>-1</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_103">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>41</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"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_104">
<states class_id="25" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_105">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_106">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_107">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_108">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_109">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_110">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_111">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_112">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_113">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_114">
<id>2</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_115">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_116">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_119">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_123">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_125">
<id>3</id>
<operations>
<count>12</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_126">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_129">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_130">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_131">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_138">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_139">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_140">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>30</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_141">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>39</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="_142">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>38</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>17</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_143">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>40</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>17</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_144">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>9</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_condition_61 ( and ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_84 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_95 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_i_fu_129_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>32</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>o_fu_146_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>32</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>p_i_fu_158_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>32</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>t_fu_134_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>tmp_1_i_fu_140_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_5_i_fu_152_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>3</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>9</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>in_V_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>numReps_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>numReps_out_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>o_i_reg_91</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>out_V_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>p_1_i_reg_79</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>24</second>
</item>
<item>
<first>(2Count)</first>
<second>48</second>
</item>
<item>
<first>LUT</first>
<second>24</second>
</item>
</second>
</item>
<item>
<first>p_Val2_s_phi_fu_116_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>96</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>t_i_reg_102</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_i_reg_191</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>o_i_reg_91</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>p_1_i_reg_79</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>24</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>24</second>
</item>
</second>
</item>
<item>
<first>t_i_reg_102</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>tmp_1_i_reg_200</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_reg_186</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>7</second>
</item>
<item>
<first>FF</first>
<second>25</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>6</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>exitcond_i_fu_129_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>o_fu_146_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>p_i_fu_158_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>t_fu_134_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_1_i_fu_140_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_5_i_fu_152_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>8</first>
<second class_id="45" 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>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</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>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</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>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>13</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_145">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>20</item>
<item>26</item>
<item>29</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>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>18</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>eo_V_fu_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>exitcond_i_fu_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>o_fu_146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>o_i_phi_fu_95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>p_1_cast_i_fu_166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_1_i_phi_fu_83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>p_Val2_s_phi_fu_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_i_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>r_V_cast_i_fu_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>t_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>t_i_phi_fu_106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>tmp_1_i_fu_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_5_i_fu_152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>4</count>
<item_version>0</item_version>
<item>
<first>StgValue_10_write_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>StgValue_31_write_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>numReps_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_V_2_read_fu_66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</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="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>exitcond_i_reg_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>o_i_reg_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>p_1_i_reg_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>p_Val2_s_reg_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_i_reg_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>r_V_cast_i_reg_209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>t_i_reg_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>t_reg_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_1_i_reg_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_reg_186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>o_i_reg_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>p_1_i_reg_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>p_Val2_s_reg_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>t_i_reg_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>in_V_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
</second>
</item>
<item>
<first>numReps</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</second>
</item>
<item>
<first>numReps_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
<item>
<first>out_V_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="59" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>1</first>
<second>FSL</second>
</item>
<item>
<first>2</first>
<second>FSL</second>
</item>
<item>
<first>3</first>
<second>FSL</second>
</item>
<item>
<first>4</first>
<second>FSL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.912705 | 107 | 0.451437 |
060362c5de71b8beb889fbccff60218f870c2782 | 5,650 | ads | Ada | source/web/tools/wsdl2ada/wsdl-meps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/wsdl2ada/wsdl-meps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/wsdl2ada/wsdl-meps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, 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 package provides abstract declaration for MEP representation.
------------------------------------------------------------------------------
with Ada.Containers.Hashed_Maps;
with League.Strings;
with WSDL.AST;
package WSDL.MEPs is
pragma Preelaborate;
package Interface_Fault_Reference_Maps is
new Ada.Containers.Hashed_Maps
(WSDL.AST.Qualified_Name,
WSDL.AST.Interface_Fault_Reference_Access,
WSDL.AST.Hash,
WSDL.AST."=",
WSDL.AST."=");
type Message_Placeholder is record
Label : League.Strings.Universal_String;
Direction : WSDL.AST.Message_Directions;
Message : WSDL.AST.Interface_Message_Access;
-- Interface Message Reference actually mapped to this placeholder.
Faults : Interface_Fault_Reference_Maps.Map;
-- Interface Fault References actually associated with this placeholder.
end record;
type Message_Placeholder_Array is
array (Positive range <>) of Message_Placeholder;
type Fault_Propagation_Rules is
(Fault_Replaces_Message,
Message_Triggers_Fault,
No_Faults);
type MEP (Length : Natural) is limited record
IRI : League.Strings.Universal_String;
Placeholders : Message_Placeholder_Array (1 .. Length);
-- Placeholder messages of the MEP.
FPR : Fault_Propagation_Rules;
-- Fault propagation rule of the MEP.
Has_In : Boolean;
-- MEP has at least one 'in' placeholder message.
Has_Out : Boolean;
-- MEP has at least one 'out' placeholder message.
Has_Single_In : Boolean;
-- MEP has only one 'in' placeholder message.
Has_Single_Out : Boolean;
-- MEP has only one 'out' placeholder message.
Has_In_Fault : Boolean;
-- MEP supports at least one fault in the 'In' direction.
Has_Out_Fault : Boolean;
-- MEP supports at least one fault in the 'Out' direction.
Has_Single_In_Fault : Boolean;
-- MEP supports only one fault in the 'In' direction.
Has_Single_Out_Fault : Boolean;
-- MEP supports only one fault in the 'Out' direction.
end record;
type MEP_Access is access all MEP;
end WSDL.MEPs;
| 51.834862 | 79 | 0.484248 |
a16031764bf994d3a18969632c2d3dbdb0029733 | 1,251 | ads | Ada | source/context/webidl-interface_members.ads | reznikmm/webidl | 744bbdc9e3dfbe690d37b6dc5d7d82233b919cd4 | [
"MIT"
] | null | null | null | source/context/webidl-interface_members.ads | reznikmm/webidl | 744bbdc9e3dfbe690d37b6dc5d7d82233b919cd4 | [
"MIT"
] | null | null | null | source/context/webidl-interface_members.ads | reznikmm/webidl | 744bbdc9e3dfbe690d37b6dc5d7d82233b919cd4 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2021 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Ada.Iterator_Interfaces;
package WebIDL.Interface_Members is
pragma Preelaborate;
type Interface_Member is limited interface;
-- Interfaces, interface mixins, and namespaces are specifications of a set
-- of members (respectively matching InterfaceMembers, MixinMembers, and
-- NamespaceMembers), which are the constants, attributes, operations, and
-- other declarations that appear between the braces of their declarations.
function Assigned (Self : access Interface_Member'Class) return Boolean is
(Self /= null);
type Interface_Member_Access is access all Interface_Member'Class
with Storage_Size => 0;
type Cursor is record
Index : Positive;
Member : Interface_Member_Access;
end record;
function Has_Element (Self : Cursor) return Boolean is
(Self.Member.Assigned);
package Iterators is new Ada.Iterator_Interfaces (Cursor, Has_Element);
type Interface_Member_Iterator_Access is access constant
Iterators.Forward_Iterator'Class
with Storage_Size => 0;
end WebIDL.Interface_Members;
| 32.921053 | 79 | 0.71303 |
39a2cd6f12a270667677b72e2c756b5474a31f1d | 322 | adb | Ada | snake_types.adb | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | null | null | null | snake_types.adb | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | 1 | 2018-06-03T19:08:34.000Z | 2018-06-03T19:08:48.000Z | snake_types.adb | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | null | null | null | with display,Ada.Containers.Hashed_Maps ;
with Ada.Strings.Hash;
with Ada.text_io; use Ada.text_io;
package body snake_types is
function Hash_Func(Key : character) return Ada.Containers.Hash_Type is
begin
return Ada.Strings.Hash(Key'Image);
end Hash_Func;
end snake_types ;
| 17.888889 | 78 | 0.689441 |
504a5d94f84265c6c2495575ff696586c8c9e742 | 15,013 | ads | Ada | software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-dac.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-dac.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/hpl/STM32/svd/stm32f427x/stm32_svd-dac.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- This spec has been automatically generated from STM32F427x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with System;
with HAL;
package STM32_SVD.DAC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-----------------
-- CR_Register --
-----------------
subtype CR_TSEL1_Field is HAL.UInt3;
subtype CR_WAVE1_Field is HAL.UInt2;
subtype CR_MAMP1_Field is HAL.UInt4;
subtype CR_TSEL2_Field is HAL.UInt3;
subtype CR_WAVE2_Field is HAL.UInt2;
subtype CR_MAMP2_Field is HAL.UInt4;
-- control register
type CR_Register is record
-- DAC channel1 enable
EN1 : Boolean := False;
-- DAC channel1 output buffer disable
BOFF1 : Boolean := False;
-- DAC channel1 trigger enable
TEN1 : Boolean := False;
-- DAC channel1 trigger selection
TSEL1 : CR_TSEL1_Field := 16#0#;
-- DAC channel1 noise/triangle wave generation enable
WAVE1 : CR_WAVE1_Field := 16#0#;
-- DAC channel1 mask/amplitude selector
MAMP1 : CR_MAMP1_Field := 16#0#;
-- DAC channel1 DMA enable
DMAEN1 : Boolean := False;
-- DAC channel1 DMA Underrun Interrupt enable
DMAUDRIE1 : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- DAC channel2 enable
EN2 : Boolean := False;
-- DAC channel2 output buffer disable
BOFF2 : Boolean := False;
-- DAC channel2 trigger enable
TEN2 : Boolean := False;
-- DAC channel2 trigger selection
TSEL2 : CR_TSEL2_Field := 16#0#;
-- DAC channel2 noise/triangle wave generation enable
WAVE2 : CR_WAVE2_Field := 16#0#;
-- DAC channel2 mask/amplitude selector
MAMP2 : CR_MAMP2_Field := 16#0#;
-- DAC channel2 DMA enable
DMAEN2 : Boolean := False;
-- DAC channel2 DMA underrun interrupt enable
DMAUDRIE2 : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
EN1 at 0 range 0 .. 0;
BOFF1 at 0 range 1 .. 1;
TEN1 at 0 range 2 .. 2;
TSEL1 at 0 range 3 .. 5;
WAVE1 at 0 range 6 .. 7;
MAMP1 at 0 range 8 .. 11;
DMAEN1 at 0 range 12 .. 12;
DMAUDRIE1 at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
EN2 at 0 range 16 .. 16;
BOFF2 at 0 range 17 .. 17;
TEN2 at 0 range 18 .. 18;
TSEL2 at 0 range 19 .. 21;
WAVE2 at 0 range 22 .. 23;
MAMP2 at 0 range 24 .. 27;
DMAEN2 at 0 range 28 .. 28;
DMAUDRIE2 at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
----------------------
-- SWTRIGR_Register --
----------------------
--------------------
-- SWTRIGR.SWTRIG --
--------------------
-- SWTRIGR_SWTRIG array
type SWTRIGR_SWTRIG_Field_Array is array (1 .. 2) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for SWTRIGR_SWTRIG
type SWTRIGR_SWTRIG_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SWTRIG as a value
Val : HAL.UInt2;
when True =>
-- SWTRIG as an array
Arr : SWTRIGR_SWTRIG_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for SWTRIGR_SWTRIG_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- software trigger register
type SWTRIGR_Register is record
-- Write-only. DAC channel1 software trigger
SWTRIG : SWTRIGR_SWTRIG_Field :=
(As_Array => False, Val => 16#0#);
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SWTRIGR_Register use record
SWTRIG at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
----------------------
-- DHR12R1_Register --
----------------------
subtype DHR12R1_DACC1DHR_Field is HAL.UInt12;
-- channel1 12-bit right-aligned data holding register
type DHR12R1_Register is record
-- DAC channel1 12-bit right-aligned data
DACC1DHR : DHR12R1_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12R1_Register use record
DACC1DHR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
----------------------
-- DHR12L1_Register --
----------------------
subtype DHR12L1_DACC1DHR_Field is HAL.UInt12;
-- channel1 12-bit left aligned data holding register
type DHR12L1_Register is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- DAC channel1 12-bit left-aligned data
DACC1DHR : DHR12L1_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12L1_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC1DHR at 0 range 4 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
---------------------
-- DHR8R1_Register --
---------------------
subtype DHR8R1_DACC1DHR_Field is HAL.Byte;
-- channel1 8-bit right aligned data holding register
type DHR8R1_Register is record
-- DAC channel1 8-bit right-aligned data
DACC1DHR : DHR8R1_DACC1DHR_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 DHR8R1_Register use record
DACC1DHR at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
----------------------
-- DHR12R2_Register --
----------------------
subtype DHR12R2_DACC2DHR_Field is HAL.UInt12;
-- channel2 12-bit right aligned data holding register
type DHR12R2_Register is record
-- DAC channel2 12-bit right-aligned data
DACC2DHR : DHR12R2_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12R2_Register use record
DACC2DHR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
----------------------
-- DHR12L2_Register --
----------------------
subtype DHR12L2_DACC2DHR_Field is HAL.UInt12;
-- channel2 12-bit left aligned data holding register
type DHR12L2_Register is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- DAC channel2 12-bit left-aligned data
DACC2DHR : DHR12L2_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12L2_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC2DHR at 0 range 4 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
---------------------
-- DHR8R2_Register --
---------------------
subtype DHR8R2_DACC2DHR_Field is HAL.Byte;
-- channel2 8-bit right-aligned data holding register
type DHR8R2_Register is record
-- DAC channel2 8-bit right-aligned data
DACC2DHR : DHR8R2_DACC2DHR_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 DHR8R2_Register use record
DACC2DHR at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
----------------------
-- DHR12RD_Register --
----------------------
subtype DHR12RD_DACC1DHR_Field is HAL.UInt12;
subtype DHR12RD_DACC2DHR_Field is HAL.UInt12;
-- Dual DAC 12-bit right-aligned data holding register
type DHR12RD_Register is record
-- DAC channel1 12-bit right-aligned data
DACC1DHR : DHR12RD_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- DAC channel2 12-bit right-aligned data
DACC2DHR : DHR12RD_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12RD_Register use record
DACC1DHR at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
DACC2DHR at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
----------------------
-- DHR12LD_Register --
----------------------
subtype DHR12LD_DACC1DHR_Field is HAL.UInt12;
subtype DHR12LD_DACC2DHR_Field is HAL.UInt12;
-- DUAL DAC 12-bit left aligned data holding register
type DHR12LD_Register is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- DAC channel1 12-bit left-aligned data
DACC1DHR : DHR12LD_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_16_19 : HAL.UInt4 := 16#0#;
-- DAC channel2 12-bit left-aligned data
DACC2DHR : DHR12LD_DACC2DHR_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12LD_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC1DHR at 0 range 4 .. 15;
Reserved_16_19 at 0 range 16 .. 19;
DACC2DHR at 0 range 20 .. 31;
end record;
---------------------
-- DHR8RD_Register --
---------------------
subtype DHR8RD_DACC1DHR_Field is HAL.Byte;
subtype DHR8RD_DACC2DHR_Field is HAL.Byte;
-- DUAL DAC 8-bit right aligned data holding register
type DHR8RD_Register is record
-- DAC channel1 8-bit right-aligned data
DACC1DHR : DHR8RD_DACC1DHR_Field := 16#0#;
-- DAC channel2 8-bit right-aligned data
DACC2DHR : DHR8RD_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR8RD_Register use record
DACC1DHR at 0 range 0 .. 7;
DACC2DHR at 0 range 8 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-------------------
-- DOR1_Register --
-------------------
subtype DOR1_DACC1DOR_Field is HAL.UInt12;
-- channel1 data output register
type DOR1_Register is record
-- Read-only. DAC channel1 data output
DACC1DOR : DOR1_DACC1DOR_Field;
-- unspecified
Reserved_12_31 : HAL.UInt20;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DOR1_Register use record
DACC1DOR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-------------------
-- DOR2_Register --
-------------------
subtype DOR2_DACC2DOR_Field is HAL.UInt12;
-- channel2 data output register
type DOR2_Register is record
-- Read-only. DAC channel2 data output
DACC2DOR : DOR2_DACC2DOR_Field;
-- unspecified
Reserved_12_31 : HAL.UInt20;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DOR2_Register use record
DACC2DOR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-----------------
-- SR_Register --
-----------------
-- status register
type SR_Register is record
-- unspecified
Reserved_0_12 : HAL.UInt13 := 16#0#;
-- DAC channel1 DMA underrun flag
DMAUDR1 : Boolean := False;
-- unspecified
Reserved_14_28 : HAL.UInt15 := 16#0#;
-- DAC channel2 DMA underrun flag
DMAUDR2 : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
Reserved_0_12 at 0 range 0 .. 12;
DMAUDR1 at 0 range 13 .. 13;
Reserved_14_28 at 0 range 14 .. 28;
DMAUDR2 at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Digital-to-analog converter
type DAC_Peripheral is record
-- control register
CR : CR_Register;
-- software trigger register
SWTRIGR : SWTRIGR_Register;
-- channel1 12-bit right-aligned data holding register
DHR12R1 : DHR12R1_Register;
-- channel1 12-bit left aligned data holding register
DHR12L1 : DHR12L1_Register;
-- channel1 8-bit right aligned data holding register
DHR8R1 : DHR8R1_Register;
-- channel2 12-bit right aligned data holding register
DHR12R2 : DHR12R2_Register;
-- channel2 12-bit left aligned data holding register
DHR12L2 : DHR12L2_Register;
-- channel2 8-bit right-aligned data holding register
DHR8R2 : DHR8R2_Register;
-- Dual DAC 12-bit right-aligned data holding register
DHR12RD : DHR12RD_Register;
-- DUAL DAC 12-bit left aligned data holding register
DHR12LD : DHR12LD_Register;
-- DUAL DAC 8-bit right aligned data holding register
DHR8RD : DHR8RD_Register;
-- channel1 data output register
DOR1 : DOR1_Register;
-- channel2 data output register
DOR2 : DOR2_Register;
-- status register
SR : SR_Register;
end record
with Volatile;
for DAC_Peripheral use record
CR at 0 range 0 .. 31;
SWTRIGR at 4 range 0 .. 31;
DHR12R1 at 8 range 0 .. 31;
DHR12L1 at 12 range 0 .. 31;
DHR8R1 at 16 range 0 .. 31;
DHR12R2 at 20 range 0 .. 31;
DHR12L2 at 24 range 0 .. 31;
DHR8R2 at 28 range 0 .. 31;
DHR12RD at 32 range 0 .. 31;
DHR12LD at 36 range 0 .. 31;
DHR8RD at 40 range 0 .. 31;
DOR1 at 44 range 0 .. 31;
DOR2 at 48 range 0 .. 31;
SR at 52 range 0 .. 31;
end record;
-- Digital-to-analog converter
DAC_Periph : aliased DAC_Peripheral
with Import, Address => DAC_Base;
end STM32_SVD.DAC;
| 31.277083 | 66 | 0.581762 |
12cbac9336846680cdd1336bd4eeb48ef0ce5f2d | 2,388 | ads | Ada | source/slim-menu_models-play_lists.ads | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | source/slim-menu_models-play_lists.ads | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | source/slim-menu_models-play_lists.ads | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Containers.Vectors;
with League.String_Vectors;
with League.Strings;
with Slim.Players;
package Slim.Menu_Models.Play_Lists is
type Play_List_Menu_Model (Player : Slim.Players.Player_Access) is
limited new Slim.Menu_Models.Menu_Model with private;
procedure Initialize
(Self : in out Play_List_Menu_Model'Class;
Label : League.Strings.Universal_String;
Root : League.Strings.Universal_String;
File : League.Strings.Universal_String)
with Pre => File.Starts_With (Root);
-- Read playlist in M3U format, as described in rfc8216.
-- Root is HTTP server folder.
procedure Collect
(Self : Play_List_Menu_Model'Class;
Path_List : in out League.String_Vectors.Universal_String_Vector;
Title_List : in out League.String_Vectors.Universal_String_Vector);
private
type Play_List_Item is record
URI : League.Strings.Universal_String;
Label : League.Strings.Universal_String;
end record;
package Play_List_Item_Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Play_List_Item);
type Play_List_Menu_Model (Player : Slim.Players.Player_Access) is
limited new Slim.Menu_Models.Menu_Model with
record
Root : League.Strings.Universal_String;
-- Directory where Path is located (HTTP server root folder)
Path : League.Strings.Universal_String;
-- Path from the Root
Label : League.Strings.Universal_String;
M3U : League.Strings.Universal_String;
Items : Play_List_Item_Vectors.Vector;
end record;
overriding function Label
(Self : Play_List_Menu_Model;
Path : Slim.Menu_Models.Menu_Path)
return League.Strings.Universal_String;
overriding function Item_Count
(Self : Play_List_Menu_Model;
Path : Slim.Menu_Models.Menu_Path) return Natural;
overriding function Enter_Command
(Self : Play_List_Menu_Model;
Path : Menu_Path) return Slim.Menu_Commands.Menu_Command_Access;
overriding function Play_Command
(Self : Play_List_Menu_Model;
Path : Menu_Path) return Slim.Menu_Commands.Menu_Command_Access;
end Slim.Menu_Models.Play_Lists;
| 32.27027 | 73 | 0.711893 |
4dfc366c624bbbb8212639c18b1c1d089d577863 | 3,497 | adb | Ada | src/api/agate-api-dynamic_task.adb | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | 3 | 2017-12-23T10:25:07.000Z | 2021-06-09T13:47:19.000Z | src/api/agate-api-dynamic_task.adb | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | src/api/agate-api-dynamic_task.adb | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2018, Fabien Chouteau --
-- --
-- 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 AGATE.Scheduler; use AGATE.Scheduler;
package body AGATE.API.Dynamic_Task is
------------
-- Create --
------------
function Create
(Stack_Size : Storage_Count;
Sec_Stack_Size : Storage_Count;
Heap_Size : Storage_Count;
Priority : Task_Priority;
Proc : Task_Procedure;
Name : String)
return Task_ID
is
Stack : constant Task_Stack_Access :=
new Task_Stack (1 .. Stack_Size);
Sec_Stack : constant Task_Sec_Stack_Access :=
new Task_Sec_Stack (1 .. Sec_Stack_Size);
Heap : constant Task_Heap_Access :=
new Task_Heap (1 .. Heap_Size);
The_Task : constant Task_Object_Access :=
new Task_Object (Proc => Proc,
Base_Prio => Internal_Task_Priority (Priority),
Stack => Stack,
Sec_Stack => Sec_Stack,
Heap => Heap);
begin
Register (Task_ID (The_Task), Name);
return Task_ID (The_Task);
end Create;
end AGATE.API.Dynamic_Task;
| 49.957143 | 78 | 0.519302 |
2379f84538599f4e52de36f25270788d8bd6f9a8 | 151,972 | adb | Ada | src/asis/a4g-encl_el.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/a4g-encl_el.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/a4g-encl_el.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . E N C L _ E L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2012, Free Software Foundation, Inc. --
-- --
-- ASIS-for-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 --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY 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 ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Asis; use Asis;
with Asis.Declarations; use Asis.Declarations;
with Asis.Elements; use Asis.Elements;
with Asis.Extensions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Sem; use A4G.A_Sem;
with A4G.A_Types; use A4G.A_Types;
with A4G.Int_Knds; use A4G.Int_Knds;
with A4G.Mapping; use A4G.Mapping;
with A4G.Queries; use A4G.Queries;
with A4G.Vcheck; use A4G.Vcheck;
with Atree; use Atree;
with Einfo; use Einfo;
with Namet; use Namet;
with Nlists; use Nlists;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames;
with Stand; use Stand;
with Types; use Types;
package body A4G.Encl_El is
------------------------------------------------
-- The general approach to the implementation --
-- of the Enclosing_Element query --
------------------------------------------------
-- There are important differences in the ways how an Enclosing_Element
-- is retrieved for explicit and implicit Elements, and for the elements
-- from expanded generics. For explicit Elements, the general way to get
-- the enclosing Element is to do the necessary bottom-up tree traversing,
-- for most of the cases all what we need if one step up the front-end
-- tree, but sometimes the differences between front-end and ASIS trees
-- require some non-trivial traversing.
--
-- For implicit Elements, there is a semantic link between a top Element
-- of an ASIS implicit sub-hierarchy and some explicit Element that
-- "generates" this subhierarchy. For example, an implicit declaration of
-- an inherited supprogram is "generated" by some derived type definition,
-- so inside the implicit subhierarchy we use the same approach for
-- retrieving the enclosing Element as for explicit Elements, but the
-- enclosing Element for subhierarchy is the construct that "generates" the
-- subhierarchy, and to get to this construct, the link stored as a part
-- of implicit elements structure is used.
--
-- For Elements from generic instantiations, we do bottom-up traversing of
-- the ASIS/front-end tree structure corresponding to the expanded code
-- in the same way as for explicit Elements, but when we are at the top of
-- an expanded spec or body, the next Enclosing_Element step should go
-- to the corresponding instantiation, so here we also do something
-- different that bottom-up tree traversing
--
-- But for most of the cases the way to get the enclosing Element is to
-- map the bottom-up traversing of the compiler tree onto the ASIS Elements
-- hierarchy. This is performed by Enclosing_Element_For_Explicit function,
-- and all the other routines defined in this package detect and process
-- various special cases. For implicit Elements and for Elements that are
-- components of expanded generic structure the first thing is to check if
-- this Element can be processed as if it is a usual explicit Element, and
-- then correct result, if needed.
---------------------------------------------------------------------
-- Mapping the bottom-up traversing of the compiler tree onto ASIS --
---------------------------------------------------------------------
-- Each ASIS Element contains the reference to the tree node it has been
-- built from. In many cases the enclosing Element should be built on
-- the parent node. In some cases the enclosing Element may be built on the
-- same node. And there are some cases when we have to do some traversing
-- that is specific to this particular Element to get to the compiler tree
-- node corresponding to its enclosing Element.
-- The way of getting the enclosing Element is implemented on the base of
-- two look-up tables (switches). The first table defines if for the given
-- element (that is, for the given Element kind, and the internal flat
-- Element classification is used here) some regular way of constructing
-- enclosing Element should be used, or some non-trivial traversing is
-- needed. This non-trivial traversing is specific to the Element kind, and
-- the corresponding routine is defined by the second look-up table.
-------------------------------------------------
-- The general structure of this package body --
-------------------------------------------------
-- The rest of this package body has the following structure:
--
-- Section 1 - definition of the first Enclosing_Element switch (makes
-- the difference between trivial and non-trivial cases of
-- mapping the bottom up compiler tree traversing onto ASIS
--
-- Section 2 - declarations of routines implementing various cases of
-- non-trivial bottom up compiler tree traversing
--
-- Section 3 - definition of the second Enclosing_Element switch (maps
-- Element kind requiring non-trivial actions onto
-- corresponding routines
--
-- Section 4 - (general-purpose) local subprograms
--
-- Section 5 - bodies of the routines declared in Section 2
--
-- Section 6 - bodies of the routines declared in the package spec
---------------------------------------------------------------------
-- Section 1 - Enclosing_Element first switch, separating trivial --
-- and non-trivial cases --
---------------------------------------------------------------------
-- This switch maps each value of the Internal_Element_Kinds onto one
-- of the following values of the same type, and this mapping has the
-- following meaning:
-- Not_An_Element => Asis.Nil_Element should be returned as
-- Enclosed Element;
--
-- Trivial_Mapping => A standard Enclosing_Element constructor should
-- be used, it is implemented by General_Encl_Elem
-- function
--
-- No_Mapping => is set for the special values added to the
-- Internal_Element_Kinds literals to organize the
-- Node_to_Element and Enclosing Element switches.
--
-- Non_Trivial_Mapping => a special function is needed for this Element
-- kind to get the Enclosing Element. This function
-- is selected by second switch,
--
-- Not_Implemented_Mapping => it means what is sounds
--
-- any the other value => the Enclosing Element for the Element of the
-- corresponding kind is based on the same node, but
-- is of the specified kind
Enclosing_Element_For_Explicits_First_Switch : constant
array (Internal_Element_Kinds) of Internal_Element_Kinds :=
(
-- type Internal_Element_Kinds is (
--
Not_An_Element => Not_An_Element,
-- Asis.Nil_Element should be returned as the
-- Enclosing for the Asis.Nil_Element, should not it???
--
------------------------------------------------------------------------------
--
-- -- A_Pragma, -- Asis.Elements
--
------------------------------------------------------------------------------
--
An_All_Calls_Remote_Pragma ..
-- An_Asynchronous_Pragma,
-- An_Atomic_Pragma,
-- An_Atomic_Components_Pragma,
-- An_Attach_Handler_Pragma,
-- A_Controlled_Pragma,
-- A_Convention_Pragma,
-- A_Discard_Names_Pragma,
-- An_Elaborate_Pragma,
-- An_Elaborate_All_Pragma,
-- An_Elaborate_Body_Pragma,
-- An_Export_Pragma,
-- An_Import_Pragma,
-- An_Inline_Pragma,
-- An_Inspection_Point_Pragma,
-- An_Interrupt_Handler_Pragma,
-- An_Interrupt_Priority_Pragma,
-- A_Linker_Options_Pragma
-- A_List_Pragma,
-- A_Locking_Policy_Pragma,
-- A_Normalize_Scalars_Pragma,
-- An_Optimize_Pragma,
-- A_Pack_Pragma,
-- A_Page_Pragma,
-- A_Preelaborate_Pragma,
-- A_Priority_Pragma,
-- A_Pure_Pragma,
-- A_Queuing_Policy_Pragma,
-- A_Remote_Call_Interface_Pragma,
-- A_Remote_Types_Pragma,
-- A_Restrictions_Pragma,
-- A_Reviewable_Pragma,
-- A_Shared_Passive_Pragma,
-- A_Storage_Size_Pragma,
-- A_Suppress_Pragma,
-- A_Task_Dispatching_Policy_Pragma,
-- A_Volatile_Pragma,
-- A_Volatile_Components_Pragma,
--
-- An_Implementation_Defined_Pragma,
--
An_Unknown_Pragma => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
--
-- -- A_Defining_Name, -- Asis.Declarations
--
------------------------------------------------------------------------------
--
A_Defining_Identifier => Non_Trivial_Mapping,
A_Defining_Character_Literal => An_Enumeration_Literal_Specification,
A_Defining_Enumeration_Literal => An_Enumeration_Literal_Specification,
--
-- -- A_Defining_Operator_Symbol => Non_Trivial_Mapping
--
A_Defining_And_Operator ..
-- A_Defining_Or_Operator,
-- A_Defining_Xor_Operator,
-- A_Defining_Equal_Operator,
-- A_Defining_Not_Equal_Operator,
-- A_Defining_Less_Than_Operator,
-- A_Defining_Less_Than_Or_Equal_Operator,
-- A_Defining_Greater_Than_Operator,
-- A_Defining_Greater_Than_Or_Equal_Operator,
-- A_Defining_Plus_Operator,
-- A_Defining_Minus_Operator,
-- A_Defining_Concatenate_Operator,
-- A_Defining_Unary_Plus_Operator,
-- A_Defining_Unary_Minus_Operator,
-- A_Defining_Multiply_Operator,
-- A_Defining_Divide_Operator,
-- A_Defining_Mod_Operator,
-- A_Defining_Rem_Operator,
-- A_Defining_Exponentiate_Operator,
-- A_Defining_Abs_Operator,
A_Defining_Not_Operator => Non_Trivial_Mapping,
A_Defining_Expanded_Name => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
--
-- -- A_Declaration, -- Asis.Declarations
--
------------------------------------------------------------------------------
--
An_Ordinary_Type_Declaration ..
-- A_Task_Type_Declaration,
-- A_Protected_Type_Declaration,
-- An_Incomplete_Type_Declaration,
-- A_Private_Type_Declaration,
-- A_Private_Extension_Declaration,
-- A_Subtype_Declaration,
A_Variable_Declaration => Trivial_Mapping,
A_Constant_Declaration => Trivial_Mapping,
A_Deferred_Constant_Declaration ..
-- A_Single_Task_Declaration,
-- A_Single_Protected_Declaration,
--
-- An_Integer_Number_Declaration,
A_Real_Number_Declaration => Trivial_Mapping,
--
An_Enumeration_Literal_Specification => Non_Trivial_Mapping,
-- is it really so?
--
A_Discriminant_Specification => Non_Trivial_Mapping,
A_Component_Declaration => Non_Trivial_Mapping,
A_Loop_Parameter_Specification ..
-- A_Generalized_Iterator_Specification,
An_Element_Iterator_Specification => Non_Trivial_Mapping,
A_Procedure_Declaration => Non_Trivial_Mapping,
A_Function_Declaration => Non_Trivial_Mapping,
--
A_Parameter_Specification => Non_Trivial_Mapping,
--
A_Procedure_Body_Declaration => Non_Trivial_Mapping,
A_Function_Body_Declaration => Non_Trivial_Mapping,
A_Return_Variable_Specification => Trivial_Mapping,
A_Return_Constant_Specification => Trivial_Mapping,
A_Null_Procedure_Declaration => Trivial_Mapping,
An_Expression_Function_Declaration => Trivial_Mapping,
A_Package_Declaration => Non_Trivial_Mapping,
A_Package_Body_Declaration => Non_Trivial_Mapping,
An_Object_Renaming_Declaration => Trivial_Mapping,
An_Exception_Renaming_Declaration => Trivial_Mapping,
A_Package_Renaming_Declaration => Non_Trivial_Mapping,
A_Procedure_Renaming_Declaration => Non_Trivial_Mapping,
A_Function_Renaming_Declaration => Non_Trivial_Mapping,
A_Generic_Package_Renaming_Declaration => Non_Trivial_Mapping,
A_Generic_Procedure_Renaming_Declaration => Non_Trivial_Mapping,
A_Generic_Function_Renaming_Declaration => Non_Trivial_Mapping,
A_Task_Body_Declaration => Non_Trivial_Mapping,
A_Protected_Body_Declaration => Non_Trivial_Mapping,
An_Entry_Declaration => Non_Trivial_Mapping,
An_Entry_Body_Declaration => Trivial_Mapping,
An_Entry_Index_Specification => Trivial_Mapping,
A_Procedure_Body_Stub => Trivial_Mapping,
A_Function_Body_Stub => Trivial_Mapping,
A_Package_Body_Stub => Trivial_Mapping,
A_Task_Body_Stub => Trivial_Mapping,
A_Protected_Body_Stub => Trivial_Mapping,
An_Exception_Declaration => Trivial_Mapping,
A_Choice_Parameter_Specification => Trivial_Mapping,
--
A_Generic_Procedure_Declaration => Non_Trivial_Mapping,
A_Generic_Function_Declaration => Non_Trivial_Mapping,
A_Generic_Package_Declaration => Non_Trivial_Mapping,
A_Package_Instantiation => Non_Trivial_Mapping,
A_Procedure_Instantiation => Non_Trivial_Mapping,
A_Function_Instantiation => Non_Trivial_Mapping,
A_Formal_Object_Declaration => Trivial_Mapping,
A_Formal_Type_Declaration => Trivial_Mapping,
A_Formal_Incomplete_Type_Declaration => Trivial_Mapping,
A_Formal_Procedure_Declaration => Trivial_Mapping,
A_Formal_Function_Declaration => Trivial_Mapping,
A_Formal_Package_Declaration => Trivial_Mapping,
A_Formal_Package_Declaration_With_Box => Trivial_Mapping,
------------------------------------------------------------------------------
--
-- -- A_Definition, -- Asis.Definitions
--
------------------------------------------------------------------------------
--
-- -- A_Type_Definition,
--
A_Derived_Type_Definition => Trivial_Mapping,
A_Derived_Record_Extension_Definition => Trivial_Mapping,
--
An_Enumeration_Type_Definition => Non_Trivial_Mapping,
--
A_Signed_Integer_Type_Definition => Trivial_Mapping,
A_Modular_Type_Definition => Trivial_Mapping,
--
-- -- A_Root_Type_Definition, ----- #########
--
-- A_Root_Integer_Definition, ----- #########
-- A_Root_Real_Definition, ----- #########
-- A_Root_Fixed_Definition, ----- #########
--
-- A_Universal_Integer_Definition, ----- #########
-- A_Universal_Real_Definition, ----- #########
-- A_Universal_Fixed_Definition, ----- #########
--
--
A_Floating_Point_Definition => Trivial_Mapping,
--
An_Ordinary_Fixed_Point_Definition => Trivial_Mapping,
A_Decimal_Fixed_Point_Definition => Trivial_Mapping,
--
An_Unconstrained_Array_Definition => Trivial_Mapping,
A_Constrained_Array_Definition => Trivial_Mapping,
--
A_Record_Type_Definition => Trivial_Mapping, -- ???
A_Tagged_Record_Type_Definition => Trivial_Mapping, -- ???
-- --|A2005 start
-- An_Interface_Type_Definition,
An_Ordinary_Interface ..
-- A_Limited_Interface,
-- A_Task_Interface,
-- A_Protected_Interface,
A_Synchronized_Interface => Trivial_Mapping,
-- --|A2005 end
-- -- An_Access_Type_Definition,
--
A_Pool_Specific_Access_To_Variable => Trivial_Mapping,
An_Access_To_Variable => Trivial_Mapping,
An_Access_To_Constant => Trivial_Mapping,
--
An_Access_To_Procedure => Trivial_Mapping,
An_Access_To_Protected_Procedure => Trivial_Mapping,
An_Access_To_Function => Trivial_Mapping,
An_Access_To_Protected_Function => Trivial_Mapping,
--
--
A_Subtype_Indication => Non_Trivial_Mapping,
--
-- -- A_Constraint,
--
A_Range_Attribute_Reference => Non_Trivial_Mapping, -- ???
A_Simple_Expression_Range => Non_Trivial_Mapping,
A_Digits_Constraint => Trivial_Mapping,
A_Delta_Constraint => Trivial_Mapping,
An_Index_Constraint => Non_Trivial_Mapping,
A_Discriminant_Constraint => Non_Trivial_Mapping,
--
A_Component_Definition => Trivial_Mapping,
--
-- -- A_Discrete_Subtype_Definition,
--
A_Discrete_Subtype_Indication_As_Subtype_Definition => Trivial_Mapping,
A_Discrete_Range_Attribute_Reference_As_Subtype_Definition => Trivial_Mapping,
A_Discrete_Simple_Expression_Range_As_Subtype_Definition => Trivial_Mapping,
--
-- -- A_Discrete_Range,
--
A_Discrete_Subtype_Indication => Non_Trivial_Mapping,
A_Discrete_Range_Attribute_Reference => Non_Trivial_Mapping,
A_Discrete_Simple_Expression_Range => Non_Trivial_Mapping,
--
--
An_Unknown_Discriminant_Part => Non_Trivial_Mapping,
A_Known_Discriminant_Part => Non_Trivial_Mapping,
--
A_Record_Definition => Non_Trivial_Mapping,
A_Null_Record_Definition => Non_Trivial_Mapping,
--
A_Null_Component => Non_Trivial_Mapping,
A_Variant_Part => Non_Trivial_Mapping,
A_Variant => Trivial_Mapping,
An_Others_Choice => Non_Trivial_Mapping,
-- --|A2005 start
An_Anonymous_Access_To_Variable ..
-- An_Anonymous_Access_To_Constant
-- An_Anonymous_Access_To_Procedure
-- An_Anonymous_Access_To_Protected_Procedure
-- An_Anonymous_Access_To_Function
An_Anonymous_Access_To_Protected_Function => Trivial_Mapping,
-- --|A2005 end
A_Private_Type_Definition => A_Private_Type_Declaration,
A_Tagged_Private_Type_Definition => A_Private_Type_Declaration,
A_Private_Extension_Definition => A_Private_Extension_Declaration,
--
A_Task_Definition => Trivial_Mapping,
A_Protected_Definition => Non_Trivial_Mapping,
--
-- -- A_Formal_Type_Definition,
--
A_Formal_Private_Type_Definition ..
-- A_Formal_Tagged_Private_Type_Definition,
--
-- A_Formal_Derived_Type_Definition,
--
-- A_Formal_Discrete_Type_Definition,
--
-- A_Formal_Signed_Integer_Type_Definition,
-- A_Formal_Modular_Type_Definition,
--
-- A_Formal_Floating_Point_Definition,
--
-- A_Formal_Ordinary_Fixed_Point_Definition,
-- A_Formal_Decimal_Fixed_Point_Definition,
--
-- A_Formal_Unconstrained_Array_Definition,
-- A_Formal_Constrained_Array_Definition,
--
-- -- A_Formal_Access_Type_Definition,
--
-- A_Formal_Pool_Specific_Access_To_Variable,
-- A_Formal_Access_To_Variable,
-- A_Formal_Access_To_Constant,
--
-- A_Formal_Access_To_Procedure,
-- A_Formal_Access_To_Protected_Procedure,
-- A_Formal_Access_To_Function,
-- A_Formal_Access_To_Protected_Function
An_Aspect_Specification => Trivial_Mapping,
--
------------------------------------------------------------------------------
--
-- -- An_Expression, -- Asis.Expressions --##########
--
------------------------------------------------------------------------------
--
An_Integer_Literal => Non_Trivial_Mapping,
A_Real_Literal => Non_Trivial_Mapping,
A_String_Literal => Non_Trivial_Mapping,
An_Identifier => Non_Trivial_Mapping,
--
-- -- An_Operator_Symbol,
--
An_And_Operator ..
-- An_Or_Operator,
-- An_Xor_Operator,
-- An_Equal_Operator,
-- A_Not_Equal_Operator,
-- A_Less_Than_Operator,
-- A_Less_Than_Or_Equal_Operator,
-- A_Greater_Than_Operator,
-- A_Greater_Than_Or_Equal_Operator,
-- A_Plus_Operator,
-- A_Minus_Operator,
-- A_Concatenate_Operator,
-- A_Unary_Plus_Operator,
-- A_Unary_Minus_Operator,
-- A_Multiply_Operator,
-- A_Divide_Operator,
-- A_Mod_Operator,
-- A_Rem_Operator,
-- An_Exponentiate_Operator,
-- An_Abs_Operator,
-- A_Not_Operator => A_Function_Call,
A_Not_Operator => Non_Trivial_Mapping,
--
-- A_Character_Literal ..
-- -- An_Enumeration_Literal,
-- An_Explicit_Dereference => Trivial_Mapping,
--
-- A_Function_Call => Non_Trivial_Mapping,
-- --
-- An_Indexed_Component ..
-- A_Slice => Trivial_Mapping,
-- A_Selected_Component => Non_Trivial_Mapping,
-- --
-- -- -- ??? Not_An_Attribute,
-- -- -- An_Attribute_Reference => Non_Trivial_Mapping,
-- --
-- An_Access_Attribute ..
-- -- An_Address_Attribute,
-- -- An_Adjacent_Attribute,
-- -- An_Aft_Attribute,
-- -- An_Alignment_Attribute,
-- -- A_Base_Attribute,
-- -- A_Bit_Order_Attribute,
-- -- A_Body_Version_Attribute,
-- -- A_Callable_Attribute,
-- -- A_Caller_Attribute,
-- -- A_Ceiling_Attribute,
-- -- A_Class_Attribute,
-- -- A_Component_Size_Attribute,
-- -- A_Compose_Attribute,
-- -- A_Constrained_Attribute,
-- -- A_Copy_Sign_Attribute,
-- -- A_Count_Attribute,
-- -- A_Definite_Attribute,
-- -- A_Delta_Attribute,
-- -- A_Denorm_Attribute,
-- -- A_Digits_Attribute,
-- -- An_Exponent_Attribute,
-- -- An_External_Tag_Attribute,
-- -- A_First_Attribute,
-- -- A_First_Bit_Attribute,
-- -- A_Floor_Attribute,
-- -- A_Fore_Attribute,
-- -- A_Fraction_Attribute,
-- -- An_Identity_Attribute,
-- -- An_Image_Attribute,
-- -- An_Input_Attribute,
-- -- A_Last_Attribute,
-- -- A_Last_Bit_Attribute,
-- -- A_Leading_Part_Attribute,
-- -- A_Length_Attribute,
-- -- A_Machine_Attribute,
-- -- A_Machine_Emax_Attribute,
-- -- A_Machine_Emin_Attribute,
-- -- A_Machine_Mantissa_Attribute,
-- -- A_Machine_Overflows_Attribute,
-- -- A_Machine_Radix_Attribute,
-- -- A_Machine_Rounds_Attribute,
-- -- A_Max_Attribute,
-- -- A_Max_Size_In_Storage_Elements_Attribute,
-- -- A_Min_Attribute,
-- -- A_Model_Attribute,
-- -- A_Model_Emin_Attribute,
-- -- A_Model_Epsilon_Attribute,
-- -- A_Model_Mantissa_Attribute,
-- -- A_Model_Small_Attribute,
-- -- A_Modulus_Attribute,
-- -- An_Output_Attribute,
-- -- A_Partition_ID_Attribute,
-- -- A_Pos_Attribute,
-- -- A_Position_Attribute,
-- -- A_Pred_Attribute,
-- -- A_Range_Attribute,
-- -- A_Read_Attribute,
-- -- A_Remainder_Attribute,
-- -- A_Round_Attribute,
-- -- A_Rounding_Attribute,
-- -- A_Safe_First_Attribute,
-- -- A_Safe_Last_Attribute,
-- -- A_Scale_Attribute,
-- -- A_Scaling_Attribute,
-- -- A_Signed_Zeros_Attribute,
-- -- A_Size_Attribute,
-- -- A_Small_Attribute,
-- -- A_Storage_Pool_Attribute,
-- -- A_Storage_Size_Attribute,
-- --
-- -- A_Succ_Attribute,
-- -- A_Tag_Attribute,
-- -- A_Terminated_Attribute,
-- -- A_Truncation_Attribute,
-- -- An_Unbiased_Rounding_Attribute,
-- -- An_Unchecked_Access_Attribute,
-- -- A_Val_Attribute,
-- -- A_Valid_Attribute,
-- -- A_Value_Attribute,
-- -- A_Version_Attribute,
-- -- A_Wide_Image_Attribute,
-- -- A_Wide_Value_Attribute,
-- -- A_Wide_Width_Attribute,
-- -- A_Width_Attribute,
-- -- A_Write_Attribute,
-- --
-- -- An_Implementation_Defined_Attribute, -- Vendor Annex M
-- An_Unknown_Attribute => Non_Trivial_Mapping,
--
-- -- A_Record_Aggregate,
-- -- An_Extension_Aggregate,
-- -- A_Positional_Array_Aggregate,
-- -- A_Named_Array_Aggregate,
-- --
-- -- An_And_Then_Short_Circuit,
-- -- An_Or_Else_Short_Circuit,
-- --
-- -- An_In_Range_Membership_Test,
-- -- A_Not_In_Range_Membership_Test,
-- -- An_In_Type_Membership_Test,
-- -- A_Not_In_Type_Membership_Test,
-- --
-- -- A_Null_Literal,
-- -- A_Parenthesized_Expression,
-- --
-- -- A_Type_Conversion,
-- -- A_Qualified_Expression,
-- --
-- -- An_Allocation_From_Subtype,
-- An_Allocation_From_Qualified_Expression,
-- A_Case_Expression, -- Ada 2012
-- An_If_Expression, -- Ada 2012
-- A_For_All_Quantified_Expression, -- Ada 2012
-- A_For_Some_Quantified_Expression); -- Ada 2012
A_Character_Literal ..
A_For_Some_Quantified_Expression => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
--
-- -- An_Association, -- Asis.Expressions
--
------------------------------------------------------------------------------
--
A_Pragma_Argument_Association => Trivial_Mapping,
A_Discriminant_Association => Non_Trivial_Mapping,
A_Record_Component_Association => Trivial_Mapping,
An_Array_Component_Association => Non_Trivial_Mapping,
A_Parameter_Association => Non_Trivial_Mapping,
A_Generic_Association => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
--
-- -- A_Statement, -- Asis.Statements
--
-- All subordinates of A_Statement kind require non trivial processing,
-- this processing is the same for all of them except
-- A_Terminate_Alternative_Statement
------------------------------------------------------------------------------
--
A_Null_Statement ..
-- An_Assignment_Statement,
-- An_If_Statement,
-- A_Case_Statement,
--
-- A_Loop_Statement,
-- A_While_Loop_Statement,
-- A_For_Loop_Statement,
--
-- A_Block_Statement,
-- An_Exit_Statement,
-- A_Goto_Statement,
--
-- A_Procedure_Call_Statement,
-- A_Return_Statement,
--
-- An_Accept_Statement,
-- An_Entry_Call_Statement,
--
-- A_Requeue_Statement,
-- A_Requeue_Statement_With_Abort,
--
-- A_Delay_Until_Statement,
-- A_Delay_Relative_Statement,
--
-- A_Terminate_Alternative_Statement,
-- A_Selective_Accept_Statement,
-- A_Timed_Entry_Call_Statement,
-- A_Conditional_Entry_Call_Statement,
-- An_Asynchronous_Select_Statement,
--
-- An_Abort_Statement,
-- A_Raise_Statement,
A_Code_Statement => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
-- Path_Kinds
-- Literals -- Ada RM 95
--
-- Detailed classification for
-- ASIS_Element_Kinds.Element_Kinds(A_Path) literal
-- corresponds to subtype Internal_Path_Kinds
------------------------------------------------------------------------------
An_If_Path => An_If_Statement,
An_Elsif_Path => Trivial_Mapping,
An_Else_Path => Non_Trivial_Mapping,
A_Case_Path => Trivial_Mapping,
A_Select_Path => Trivial_Mapping,
An_Or_Path => Trivial_Mapping,
A_Then_Abort_Path => Trivial_Mapping,
--
------------------------------------------------------------
-- An_Expression_Path, -- Asis.Expressions Ada 2015
-- Detailed classification for Asis.Element_Kinds (An_Expression_Path)
-- literal corresponds to subtype Internal_Expression_Path_Kinds
------------------------------------------------------------
An_If_Expression_Path ..
-- An_Elsif_Expression_Path,
An_Else_Expression_Path => Non_Trivial_Mapping,
------------------------------------------------------------------------
--
-- -- A_Clause, -- Asis.Clauses
--
------------------------------------------------------------------------------
--
A_Use_Package_Clause => Non_Trivial_Mapping,
A_Use_Type_Clause => Non_Trivial_Mapping,
A_Use_All_Type_Clause => Non_Trivial_Mapping,
A_With_Clause => Not_An_Element,
--
-- -- A_Representation_Clause,
--
An_Attribute_Definition_Clause => Non_Trivial_Mapping,
An_Enumeration_Representation_Clause => Trivial_Mapping,
A_Record_Representation_Clause => Trivial_Mapping,
An_At_Clause => Trivial_Mapping,
--
--
A_Component_Clause => Trivial_Mapping,
--
------------------------------------------------------------------------------
--
An_Exception_Handler => Non_Trivial_Mapping,
--
------------------------------------------------------------------------------
-- Special values added for Node -> Element and
-- Element -> Enclosing Element switching,
------------------------------------------------------------------------------
Non_Trivial_Mapping => No_Mapping,
Not_Implemented_Mapping => No_Mapping,
Trivial_Mapping => No_Mapping,
No_Mapping => No_Mapping,
others => Not_Implemented_Mapping
);
-------------------------------------------------------------------------
-- Section 2 - declarations of routines implementing various cases of --
-- non-trivial bottom up compiler tree traversing and --
-- accessed though the second switch --
-------------------------------------------------------------------------
function Not_Implemented_Enclosing_Element_Construction
(Element : Asis.Element) return Asis.Element;
-- Placeholders for "others" choice
-- The functions below computes Enclosing_Elememnt for specific Element
-- kinds; the corresponding situations cannot be covered by
-- General_Encl_Elem
function A_Pragma_Enclosing (Element : Asis.Element) return Asis.Element;
function A_Defining_Expanded_Name_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Defining_Identifier_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Defining_Operator_Symbol_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Constant_Declaration_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Enumeration_Literal_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Discriminant_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Loop_Parameter_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Parameter_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Enumeration_Type_Definition_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Subtype_Indication_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Range_Attribute_Reference_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Simple_Expression_Range_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Discrete_Range_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Discriminant_Part_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Record_Definition_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Null_Component_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Variant_Part_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Others_Choice_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Statement_Enclosing
(Element : Asis.Element)
return Asis.Element;
function A_Terminate_Alternative_Statement_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Else_Path_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Attribute_Definition_Clause_Enclosing
(Element : Asis.Element)
return Asis.Element;
function An_Exception_Handler_Enclosing
(Element : Asis.Element)
return Asis.Element;
function Possible_C_U_Enclosing
(Element : Asis.Element)
return Asis.Element;
-- Called in a situation when Enclosing_Element may have to be Nil_Element,
-- because we may reach the very top of the Element hierarchy of an ASIS
-- Compilation_Unit, so logically the next step up should be from Elements
-- into enclosing unit.
function An_Association_Enclosing
(Element : Asis.Element)
return Asis.Element;
-- Computes the Enclosing Element for parameter associations. The main
-- difference with An_Expression_Enclosing is that here we may have to deal
-- with normalized associations
function An_Expression_Enclosing
(Element : Asis.Element)
return Asis.Element;
-- This function implements the part of the semantic of the
-- Asis.Elements.Enclosing_Element function corresponding to the
-- enclosing element retrieving for elements representing Ada explicit
-- constructs. It deals only with expressions - the hardest part
-- for Enclosing_Element.
--------------------------------------------------------------------
-- Section 3 - definition of the second Enclosing_Element switch --
-- (maps Element kind requiring non-trivial actions --
-- onto corresponding routines --
--------------------------------------------------------------------
type Enclosing_Element_Construction_For_Explicits_Items is access
function (Element : Asis.Element) return Asis.Element;
-- access to the local items of the constructing the Enclosing Elements
-- for Explicit constructs
Enclosing_Element_For_Explicits_Second_Switch : constant
array (Internal_Element_Kinds)
of Enclosing_Element_Construction_For_Explicits_Items :=
(
-- type Internal_Element_Kinds is (
--
-- Not_An_Element, -- Asis.Nil_Element
--
------------------------------------------------------------------------------
-- A_Pragma, -- Asis.Elements
------------------------------------------------------------------------------
An_All_Calls_Remote_Pragma ..
-- An_Asynchronous_Pragma,
-- An_Atomic_Pragma,
-- An_Atomic_Components_Pragma,
-- An_Attach_Handler_Pragma,
-- A_Controlled_Pragma,
-- A_Convention_Pragma,
-- A_Discard_Names_Pragma,
-- An_Elaborate_Pragma,
-- An_Elaborate_All_Pragma,
-- An_Elaborate_Body_Pragma,
-- An_Export_Pragma,
-- An_Import_Pragma,
-- An_Inline_Pragma,
-- An_Inspection_Point_Pragma,
-- An_Interrupt_Handler_Pragma,
-- An_Interrupt_Priority_Pragma,
-- A_Linker_Options_Pragma
-- A_List_Pragma,
-- A_Locking_Policy_Pragma,
-- A_Normalize_Scalars_Pragma,
-- An_Optimize_Pragma,
-- A_Pack_Pragma,
-- A_Page_Pragma,
-- A_Preelaborate_Pragma,
-- A_Priority_Pragma,
-- A_Pure_Pragma,
-- A_Queuing_Policy_Pragma,
-- A_Remote_Call_Interface_Pragma,
-- A_Remote_Types_Pragma,
-- A_Restrictions_Pragma,
-- A_Reviewable_Pragma,
-- A_Shared_Passive_Pragma,
-- A_Storage_Size_Pragma,
-- A_Suppress_Pragma,
-- A_Task_Dispatching_Policy_Pragma,
-- A_Volatile_Pragma,
-- A_Volatile_Components_Pragma,
--
-- An_Implementation_Defined_Pragma,
--
An_Unknown_Pragma => A_Pragma_Enclosing'Access,
------------------------------------------------------------------------------
-- A_Defining_Name, -- Asis.Declarations
------------------------------------------------------------------------------
A_Defining_Identifier => A_Defining_Identifier_Enclosing'Access,
-- A_Defining_Character_Literal, -- an Enclosing Element is based
-- A_Defining_Enumeration_Literal, -- on the same Node
--
-- -- A_Defining_Operator_Symbol
--
A_Defining_And_Operator ..
-- A_Defining_Or_Operator,
-- A_Defining_Xor_Operator,
-- A_Defining_Equal_Operator,
-- A_Defining_Not_Equal_Operator,
-- A_Defining_Less_Than_Operator,
-- A_Defining_Less_Than_Or_Equal_Operator,
-- A_Defining_Greater_Than_Operator,
-- A_Defining_Greater_Than_Or_Equal_Operator,
-- A_Defining_Plus_Operator,
-- A_Defining_Minus_Operator,
-- A_Defining_Concatenate_Operator,
-- A_Defining_Unary_Plus_Operator,
-- A_Defining_Unary_Minus_Operator,
-- A_Defining_Multiply_Operator,
-- A_Defining_Divide_Operator,
-- A_Defining_Mod_Operator,
-- A_Defining_Rem_Operator,
-- A_Defining_Exponentiate_Operator,
-- A_Defining_Abs_Operator,
A_Defining_Not_Operator => A_Defining_Operator_Symbol_Enclosing'Access,
A_Defining_Expanded_Name => A_Defining_Expanded_Name_Enclosing'Access,
--
-------------------------------------------------------------------------------
--
-- -- A_Declaration, -- Asis.Declarations
--
-------------------------------------------------------------------------------
--
-- An_Ordinary_Type_Declaration, -- 3.2.1
-- A_Task_Type_Declaration, -- 3.2.1
-- A_Protected_Type_Declaration, -- 3.2.1
-- An_Incomplete_Type_Declaration, -- 3.2.1
-- A_Private_Type_Declaration, -- 3.2.1
-- A_Private_Extension_Declaration, -- 3.2.1
--
-- A_Subtype_Declaration, -- 3.2.2
--
-- A_Variable_Declaration, -- 3.3.1 -> Trait_Kinds
A_Constant_Declaration => A_Constant_Declaration_Enclosing'Access,
-- This is turned off, see G416-009
-- A_Deferred_Constant_Declaration, -- 3.3.1 -> Trait_Kinds
-- A_Single_Task_Declaration, -- 3.3.1
-- A_Single_Protected_Declaration, -- 3.3.1
--
-- An_Integer_Number_Declaration, -- 3.3.2
-- A_Real_Number_Declaration, -- 3.3.2
--
An_Enumeration_Literal_Specification =>
An_Enumeration_Literal_Specification_Enclosing'Access,
--
A_Discriminant_Specification => A_Discriminant_Specification_Enclosing'Access,
--
-- A_Component_Declaration => A_Component_Declaration_Enclosing'Access,
A_Component_Declaration => An_Expression_Enclosing'Access,
--
A_Loop_Parameter_Specification =>
A_Loop_Parameter_Specification_Enclosing'Access,
A_Generalized_Iterator_Specification ..
An_Element_Iterator_Specification =>
A_Loop_Parameter_Specification_Enclosing'Access,
--
A_Procedure_Declaration => Possible_C_U_Enclosing'Access,
A_Function_Declaration => Possible_C_U_Enclosing'Access,
--
A_Parameter_Specification => A_Parameter_Specification_Enclosing'Access,
A_Procedure_Body_Declaration => Possible_C_U_Enclosing'Access,
A_Function_Body_Declaration => Possible_C_U_Enclosing'Access,
--
A_Package_Declaration => Possible_C_U_Enclosing'Access,
A_Package_Body_Declaration => Possible_C_U_Enclosing'Access,
--
-- An_Object_Renaming_Declaration, -- 8.5.1
-- An_Exception_Renaming_Declaration, -- 8.5.2
A_Package_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Procedure_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Function_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Generic_Package_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Generic_Procedure_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Generic_Function_Renaming_Declaration => Possible_C_U_Enclosing'Access,
A_Task_Body_Declaration => Possible_C_U_Enclosing'Access,
A_Protected_Body_Declaration => Possible_C_U_Enclosing'Access,
--
An_Entry_Declaration => An_Expression_Enclosing'Access,
-- for entry declarations, the problem is for single task declarations
-- rewritten as anonymous task type declaration and task object declaration,
-- that's why we have to use An_Expression_Enclosing
-- An_Entry_Body_Declaration, -- 9.5.2
-- An_Entry_Index_Specification, -- 9.5.2
--
-- A_Procedure_Body_Stub, -- 10.1.3
-- A_Function_Body_Stub, -- 10.1.3
-- A_Package_Body_Stub, -- 10.1.3
-- A_Task_Body_Stub, -- 10.1.3
-- A_Protected_Body_Stub, -- 10.1.3
--
-- An_Exception_Declaration, -- 11.1
-- A_Choice_Parameter_Specification, -- 11.2
--
A_Generic_Procedure_Declaration => Possible_C_U_Enclosing'Access,
A_Generic_Function_Declaration => Possible_C_U_Enclosing'Access,
A_Generic_Package_Declaration => Possible_C_U_Enclosing'Access,
A_Package_Instantiation => Possible_C_U_Enclosing'Access,
A_Procedure_Instantiation => Possible_C_U_Enclosing'Access,
A_Function_Instantiation => Possible_C_U_Enclosing'Access,
--
-- A_Formal_Object_Declaration, -- 12.4 -> Mode_Kinds
--
-- A_Formal_Type_Declaration, -- 12.5
-- A_Formal_Procedure_Declaration, -- 12.6 -> Default_Kinds
--
-- A_Formal_Function_Declaration, -- 12.6 -> Default_Kinds
--
-- A_Formal_Package_Declaration, -- 12.7
-- A_Formal_Package_Declaration_With_Box, -- 12.7
--
-------------------------------------------------------------------------------
--
-- -- A_Definition, -- Asis.Definitions
--
-------------------------------------------------------------------------------
--
-- -- A_Type_Definition, -- 3.2.1 -> Type_Kinds
--
-- A_Derived_Type_Definition, -- 3.4 -> Trait_Kinds
-- A_Derived_Record_Extension_Definition, -- 3.4 -> Trait_Kinds
--
An_Enumeration_Type_Definition =>
An_Enumeration_Type_Definition_Enclosing'Access,
--
-- A_Signed_Integer_Type_Definition, -- 3.5.4
-- A_Modular_Type_Definition, -- 3.5.4
--
-- -- A_Root_Type_Definition, -- 3.5.4(10), 3.5.6(4)
-- -- -> Root_Type_Kinds
-- A_Root_Integer_Definition, -- 3.5.4(9)
-- A_Root_Real_Definition, -- 3.5.6(2)
-- A_Root_Fixed_Definition, -- 3.5.6(2)
--
-- A_Universal_Integer_Definition, -- 3.5.4(10)
-- A_Universal_Real_Definition, -- 3.5.6(4)
-- A_Universal_Fixed_Definition, -- 3.5.6(4)
--
--
-- A_Floating_Point_Definition, -- 3.5.7
--
-- An_Ordinary_Fixed_Point_Definition, -- 3.5.9
-- A_Decimal_Fixed_Point_Definition, -- 3.5.9
--
-- An_Unconstrained_Array_Definition, -- 3.6
-- A_Constrained_Array_Definition, -- 3.6
--
-- A_Record_Type_Definition, -- 3.8 -> Trait_Kinds
-- A_Tagged_Record_Type_Definition, -- 3.8 -> Trait_Kinds
--
-- -- An_Access_Type_Definition, -- 3.10 -> Access_Type_Kinds
--
-- A_Pool_Specific_Access_To_Variable,
-- An_Access_To_Variable,
-- An_Access_To_Constant,
--
-- An_Access_To_Procedure,
-- An_Access_To_Protected_Procedure,
-- An_Access_To_Function,
-- An_Access_To_Protected_Function,
--
--
A_Subtype_Indication => A_Subtype_Indication_Enclosing'Access,
--
-- -- A_Constraint, -- 3.2.2 -> Constraint_Kinds
--
A_Range_Attribute_Reference => A_Range_Attribute_Reference_Enclosing'Access,
A_Simple_Expression_Range => A_Simple_Expression_Range_Enclosing'Access,
-- A_Digits_Constraint, -- 3.2.2, 3.5.9
-- A_Delta_Constraint, -- 3.2.2, N.3
-- An_Index_Constraint => An_Index_Constraint_Enclosing'Access,
An_Index_Constraint => An_Expression_Enclosing'Access,
A_Discriminant_Constraint => An_Expression_Enclosing'Access,
--
-- A_Component_Definition, -- 3.6
--
-- -- A_Discrete_Subtype_Definition, -- 3.6 -> Discrete_Range_Kinds
--
-- A_Discrete_Subtype_Indication_As_Subtype_Definition,
-- A_Discrete_Range_Attribute_Reference_As_Subtype_Definition,
-- A_Discrete_Simple_Expression_Range_As_Subtype_Definition,
--
-- -- A_Discrete_Range, -- 3.6.1 -> Discrete_Range_Kinds
--
A_Discrete_Subtype_Indication => A_Discrete_Range_Enclosing'Access,
A_Discrete_Range_Attribute_Reference => A_Discrete_Range_Enclosing'Access,
A_Discrete_Simple_Expression_Range => A_Discrete_Range_Enclosing'Access,
--
--
An_Unknown_Discriminant_Part => A_Discriminant_Part_Enclosing'Access,
A_Known_Discriminant_Part => A_Discriminant_Part_Enclosing'Access,
--
A_Record_Definition => A_Record_Definition_Enclosing'Access,
A_Null_Record_Definition => A_Record_Definition_Enclosing'Access,
--
A_Null_Component => A_Null_Component_Enclosing'Access,
A_Variant_Part => A_Variant_Part_Enclosing'Access,
-- A_Variant, -- 3.8
--
An_Others_Choice => An_Others_Choice_Enclosing'Access,
-- A_Private_Type_Definition, -- 7.3 -> Trait_Kinds
-- A_Tagged_Private_Type_Definition, -- 7.3 -> Trait_Kinds
-- A_Private_Extension_Definition, -- 7.3 -> Trait_Kinds
--
-- A_Task_Definition, -- 9.1
A_Protected_Definition => An_Expression_Enclosing'Access,
--
-- -- A_Formal_Type_Definition, -- 12.5 -> Formal_Type_Kinds
--
-- A_Formal_Private_Type_Definition, -- 12.5.1 -> Trait_Kinds
-- A_Formal_Tagged_Private_Type_Definition, -- 12.5.1 -> Trait_Kinds
--
-- A_Formal_Derived_Type_Definition, -- 12.5.1 -> Trait_Kinds
--
-- A_Formal_Discrete_Type_Definition, -- 12.5.2
--
-- A_Formal_Signed_Integer_Type_Definition, -- 12.5.2
-- A_Formal_Modular_Type_Definition, -- 12.5.2
--
-- A_Formal_Floating_Point_Definition, -- 12.5.2
--
-- A_Formal_Ordinary_Fixed_Point_Definition, -- 12.5.2
-- A_Formal_Decimal_Fixed_Point_Definition, -- 12.5.2
--
-- A_Formal_Unconstrained_Array_Definition, -- 12.5.3
-- A_Formal_Constrained_Array_Definition, -- 12.5.3
--
-- -- A_Formal_Access_Type_Definition,
--
-- A_Formal_Pool_Specific_Access_To_Variable,
-- A_Formal_Access_To_Variable,
-- A_Formal_Access_To_Constant,
--
-- A_Formal_Access_To_Procedure,
-- A_Formal_Access_To_Protected_Procedure,
-- A_Formal_Access_To_Function,
-- A_Formal_Access_To_Protected_Function,
--
-------------------------------------------------------------------------------
--
-- -- An_Expression, -- Asis.Expressions
--
-------------------------------------------------------------------------------
-- --
An_Integer_Literal ..
-- -- A_Real_Literal, -- 2.4.1
-- A_String_Literal => A_Literal_Enclosing'Access,
-- --
An_Identifier => An_Expression_Enclosing'Access,
-- An_Identifier => An_Identifier_Enclosing'Access,
-- --
-- ---- An_Operator_Symbol, -- 4.1
-- --
An_And_Operator ..
-- -- An_Or_Operator, -- or
-- -- An_Xor_Operator, -- xor
-- -- An_Equal_Operator, -- =
-- -- A_Not_Equal_Operator, -- /=
-- -- A_Less_Than_Operator, -- <
-- -- A_Less_Than_Or_Equal_Operator, -- <=
-- -- A_Greater_Than_Operator, -- >
-- -- A_Greater_Than_Or_Equal_Operator, -- >=
-- -- A_Plus_Operator, -- +
-- -- A_Minus_Operator, -- -
-- -- A_Concatenate_Operator, -- &
-- -- A_Unary_Plus_Operator, -- +
-- -- A_Unary_Minus_Operator, -- -
-- -- A_Multiply_Operator, -- *
-- -- A_Divide_Operator, -- /
-- -- A_Mod_Operator, -- mod
-- -- A_Rem_Operator, -- rem
-- -- An_Exponentiate_Operator, -- **
-- -- An_Abs_Operator, -- abs
-- A_Not_Operator => An_Operator_Symbol_Enclosing'Access,
-- ??? Do we need An_Operator_Symbol_Enclosing???
A_Not_Operator => An_Expression_Enclosing'Access,
-- --
A_Character_Literal ..
-- -- An_Enumeration_Literal, -- 4.1
-- -- An_Explicit_Dereference, -- 4.1
--
-- A_Function_Call => A_Function_Call_Enclosing'Access,
-- --
-- -- An_Indexed_Component, -- 4.1.1
-- -- A_Slice, -- 4.1.2
-- A_Selected_Component => An_Identifier_Enclosing'Access,
-- --
-- -- An_Attribute_Reference, -- 4.1.4 -> Attribute_Kinds
-- --
-- An_Access_Attribute ..
-- -- An_Address_Attribute,
-- -- An_Adjacent_Attribute,
-- -- An_Aft_Attribute,
-- -- An_Alignment_Attribute,
-- -- A_Base_Attribute,
-- -- A_Bit_Order_Attribute,
-- -- A_Body_Version_Attribute,
-- -- A_Callable_Attribute,
-- -- A_Caller_Attribute,
-- -- A_Ceiling_Attribute,
-- -- A_Class_Attribute,
-- -- A_Component_Size_Attribute,
-- -- A_Compose_Attribute,
-- -- A_Constrained_Attribute,
-- -- A_Copy_Sign_Attribute,
-- -- A_Count_Attribute,
-- -- A_Definite_Attribute,
-- -- A_Delta_Attribute,
-- -- A_Denorm_Attribute,
-- -- A_Digits_Attribute,
-- -- An_Exponent_Attribute,
-- -- An_External_Tag_Attribute,
-- -- A_First_Attribute,
-- -- A_First_Bit_Attribute,
-- -- A_Floor_Attribute,
-- -- A_Fore_Attribute,
-- -- A_Fraction_Attribute,
-- -- An_Identity_Attribute,
-- -- An_Image_Attribute,
-- -- An_Input_Attribute,
-- -- A_Last_Attribute,
-- -- A_Last_Bit_Attribute,
-- -- A_Leading_Part_Attribute,
-- -- A_Length_Attribute,
-- -- A_Machine_Attribute,
-- -- A_Machine_Emax_Attribute,
-- -- A_Machine_Emin_Attribute,
-- -- A_Machine_Mantissa_Attribute,
-- -- A_Machine_Overflows_Attribute,
-- -- A_Machine_Radix_Attribute,
-- -- A_Machine_Rounds_Attribute,
-- -- A_Max_Attribute,
-- -- A_Max_Size_In_Storage_Elements_Attribute,
-- -- A_Min_Attribute,
-- -- A_Model_Attribute,
-- -- A_Model_Emin_Attribute,
-- -- A_Model_Epsilon_Attribute,
-- -- A_Model_Mantissa_Attribute,
-- -- A_Model_Small_Attribute,
-- -- A_Modulus_Attribute,
-- -- An_Output_Attribute,
-- -- A_Partition_ID_Attribute,
-- -- A_Pos_Attribute,
-- -- A_Position_Attribute,
-- A_Pred_Attribute => An_Attribute_Reference_Enclosing'Access,
--
-- A_Range_Attribute => A_Range_Attribute_Enclosing'Access,
--
-- A_Read_Attribute ..
-- -- A_Remainder_Attribute,
-- -- A_Round_Attribute,
-- -- A_Rounding_Attribute,
-- -- A_Safe_First_Attribute,
-- -- A_Safe_Last_Attribute,
-- -- A_Scale_Attribute,
-- -- A_Scaling_Attribute,
-- -- A_Signed_Zeros_Attribute,
-- -- A_Size_Attribute,
-- -- A_Small_Attribute,
-- -- A_Storage_Pool_Attribute,
-- -- A_Storage_Size_Attribute,
-- --
-- -- A_Succ_Attribute,
-- -- A_Tag_Attribute,
-- -- A_Terminated_Attribute,
-- -- A_Truncation_Attribute,
-- -- An_Unbiased_Rounding_Attribute,
-- -- An_Unchecked_Access_Attribute,
-- -- A_Val_Attribute,
-- -- A_Valid_Attribute,
-- -- A_Value_Attribute,
-- -- A_Version_Attribute,
-- -- A_Wide_Image_Attribute,
-- -- A_Wide_Value_Attribute,
-- -- A_Wide_Width_Attribute,
-- -- A_Width_Attribute,
-- -- A_Write_Attribute,
-- --
-- -- An_Implementation_Defined_Attribute, -- Vendor Annex M
-- An_Unknown_Attribute => An_Attribute_Reference_Enclosing'Access,
-- --
-- -- A_Record_Aggregate, -- 4.3
-- -- An_Extension_Aggregate, -- 4.3
-- -- A_Positional_Array_Aggregate, -- 4.3
-- -- A_Named_Array_Aggregate, -- 4.3
-- --
-- -- An_And_Then_Short_Circuit, -- 4.4
-- -- An_Or_Else_Short_Circuit, -- 4.4
-- --
-- -- An_In_Range_Membership_Test, -- 4.4
-- -- A_Not_In_Range_Membership_Test, -- 4.4
-- -- An_In_Type_Membership_Test, -- 4.4
-- -- A_Not_In_Type_Membership_Test, -- 4.4
-- --
-- -- A_Null_Literal, -- 4.4
-- -- A_Parenthesized_Expression, -- 4.4
-- --
-- -- A_Type_Conversion, -- 4.6
-- -- A_Qualified_Expression, -- 4.7
-- --
-- -- An_Allocation_From_Subtype, -- 4.8
-- -- An_Allocation_From_Qualified_Expression, -- 4.8
-- A_Case_Expression, -- Ada 2012
-- An_If_Expression, -- Ada 2012
-- A_For_All_Quantified_Expression, -- Ada 2012
-- A_For_Some_Quantified_Expression); -- Ada 2012
A_For_Some_Quantified_Expression => An_Expression_Enclosing'Access,
-------------------------------------------------------------------------------
--
-- -- An_Association, -- Asis.Expressions
--
-------------------------------------------------------------------------------
--
-- A_Pragma_Argument_Association, -- 2.8
A_Discriminant_Association => An_Expression_Enclosing'Access,
-- A_Record_Component_Association, -- 4.3.1
An_Array_Component_Association => An_Expression_Enclosing'Access,
A_Parameter_Association .. A_Generic_Association =>
An_Association_Enclosing'Access,
--
-------------------------------------------------------------------------------
--
-- -- A_Statement, -- Asis.Statements
--
-------------------------------------------------------------------------------
--
A_Null_Statement ..
-- An_Assignment_Statement, -- 5.2
-- An_If_Statement, -- 5.3
-- A_Case_Statement, -- 5.4
--
-- A_Loop_Statement, -- 5.5
-- A_While_Loop_Statement, -- 5.5
-- A_For_Loop_Statement, -- 5.5
--
-- A_Block_Statement, -- 5.6
-- An_Exit_Statement, -- 5.7
-- A_Goto_Statement, -- 5.8
--
-- A_Procedure_Call_Statement, -- 6.4
-- A_Return_Statement, -- 6.5
--
-- An_Accept_Statement, -- 9.5.2
-- An_Entry_Call_Statement, -- 9.5.3
--
-- A_Requeue_Statement, -- 9.5.4
-- A_Requeue_Statement_With_Abort, -- 9.5.4
--
-- A_Delay_Until_Statement, -- 9.6
A_Delay_Relative_Statement => A_Statement_Enclosing'Access,
--
A_Terminate_Alternative_Statement =>
A_Terminate_Alternative_Statement_Enclosing'Access,
--
A_Selective_Accept_Statement ..
-- A_Timed_Entry_Call_Statement, -- 9.7.3
-- A_Conditional_Entry_Call_Statement, -- 9.7.3
-- An_Asynchronous_Select_Statement, -- 9.7.4
--
-- An_Abort_Statement, -- 9.8
-- A_Raise_Statement, -- 11.3
A_Code_Statement => A_Statement_Enclosing'Access,
--
-------------------------------------------------------------------------------
-- Path_Kinds
-- Literals -- RM 95
------------------------------------------------------------------------------
--
-- An_If_Path,
-- An_Elsif_Path,
--
An_Else_Path => An_Else_Path_Enclosing'Access,
--
-- A_Case_Path,
-- -- when discrete_choice_list =>
-- -- sequence_of_statements
--
-- A_Select_Path,
-- -- select [guard] select_alternative
-- -- 9.7.2, 9.7.3:
-- -- select entry_call_alternative
-- -- 9.7.4:
-- -- select triggering_alternative
--
-- An_Or_Path,
-- -- or [guard] select_alternative 9.7.2:
-- -- or delay_alternative
--
-- A_Then_Abort_Path, -- 9.7.4
-- -- then abort sequence_of_statements
--
--
------------------------------------------------------------
-- An_Expression_Path, -- Asis.Expressions Ada 2015
------------------------------------------------------------
An_If_Expression_Path ..
-- An_Elsif_Expression_Path,
An_Else_Expression_Path => An_Expression_Enclosing'Access,
-------------------------------------------------------------------------------
--
-- -- A_Clause, -- Asis.Clauses
--
-------------------------------------------------------------------------------
--
A_Use_Package_Clause => Possible_C_U_Enclosing'Access, -- 8.4
A_Use_Type_Clause => Possible_C_U_Enclosing'Access, -- 8.4
A_Use_All_Type_Clause => Possible_C_U_Enclosing'Access, -- 8.4 Ada 2012
--
-- A_With_Clause, -- 10.1.2
--
-- -- A_Representation_Clause, -- 13.1 -> Representation_Clause_Kinds
--
An_Attribute_Definition_Clause =>
An_Attribute_Definition_Clause_Enclosing'Access,
-- An_Enumeration_Representation_Clause, -- 13.4
-- A_Record_Representation_Clause, -- 13.5.3
-- An_At_Clause, -- N.7
--
--
-- A_Component_Clause, -- 13.5.3
--
-------------------------------------------------------------------------------
--
An_Exception_Handler => An_Exception_Handler_Enclosing'Access,
--
-------------------------------------------------------------------------------
-- -- Special values added for Node -> Element switching,
-- -- see Asis_Vendor_Primitives.GNAT_to_Asis_Mapping body for
-- -- more details
-------------------------------------------------------------------------------
--
-- Non_Trivial_Mapping,
-- Not_Implemented_Mapping,
-- No_Mapping
--
others => Not_Implemented_Enclosing_Element_Construction'Access);
------------------------------------------------------
-- Section 4 - (general-purpose) local subprograms --
------------------------------------------------------
procedure Skip_Implicit_Subtype (Constr : in out Node_Id);
-- Supposing that Constr is a constraint, this procedure checks if the
-- parent node for it points to implicit subtype created in case if
-- this constraint is used directly in object declaration, and if
-- so, resets Constr to point to the constraint from the object
-- declaration
function Parent (Node : Node_Id) return Node_Id;
-- this function is the modification of Atree.Parent. It is able
-- to deal in the "ASIS mode" with the sequences of one-identifier
-- declarations/with clauses resulting from the normalization of
-- multi-name declarations/with clauses which is done by the
-- compiler
function General_Encl_Elem (Element : Asis.Element) return Asis.Element;
-- Computes Enclosing_Element for most common cases
procedure No_Enclosing_Element (Element_Kind : Internal_Element_Kinds);
-- Should be called only in erroneous situations, when no Enclosing_Element
-- can correspond to a given Element. Raises ASIS_Failed with the
-- corresponding Diagnosis
procedure Not_Implemented_Enclosing_Element_Construction
(Element : Asis.Element);
-- Generates Element-specific diagnosis about non-implemented case
function Is_Top_Of_Expanded_Generic (N : Node_Id) return Boolean;
-- Checks if N is the top node of the tree structure corresponding to
-- expanded generic spec or body
function Get_Rough_Enclosing_Node (Element : Asis.Element) return Node_Id;
-- This function finds the node, which is the base for a "rough"
-- enclosing element for the argument Element. Starting from the
-- argument R_Node, we go up through the chain of Parent nodes
-- till the first node, which is a member of some Node_List or to the node
-- representing the unit declaration in a compilation unit
function Get_Enclosing
(Approximation : Asis.Element;
Element : Asis.Element)
return Asis.Element;
-- This function finds the Enclosing Element for Element by traversing
-- Approximation which is considered as a rough estimation for
-- enclosing element.
procedure Skip_Normalized_Declarations_Back (Node : in out Node_Id);
-- this procedure is applied in case when the compiler may normalize a
-- multi-identifier declaration (or multi-name with clause) in a set of
-- equivalent one-identifier (one-name) declarations (clauses). It is
-- intended to be called for Node representing any declaration
-- (clause) in this normalized sequence, and it resets its parameter
-- to point to the first declaration (clause) in this sequence
--
-- There is no harm to call this procedure for Node which does not
-- represent a normalized declaration (or even which does not represent
-- any declaration at all), or for Node which represents the first
-- declaration in a normalized chain - the procedure simply leaves
-- its parameter intact.
--
-- (In some sense this procedure may be considered as an "inversion
-- of the local procedure Skip_Normalized_Declarations defined in
-- the body of the A4G.Mapping package)
---------------------------------------------------------------
-- Section 5 - bodies of the routines declared in Section 2 --
---------------------------------------------------------------
--------------------------------------
-- A_Constant_Declaration_Enclosing --
--------------------------------------
function A_Constant_Declaration_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result : Asis.Element := General_Encl_Elem (Element);
Res_Node : Node_Id;
begin
-- The problem with constant declarations exists for a declarations
-- created by the front-end to pass the actual expressions for generic
-- IN parameters, see EC16-004 and EC22-007
Res_Node := Node (Element);
if Present (Corresponding_Generic_Association (Res_Node)) then
Res_Node := Parent (Res_Node);
if No (Generic_Parent (Res_Node)) then
-- This IF statement prevents us from doing this special
-- processing for expanded package declarations, we have to do it
-- only for wrapper packages created for subprogram instantiation
Res_Node := Parent (Res_Node);
Res_Node := Corresponding_Body (Res_Node);
Res_Node := Parent (Res_Node);
Res_Node := First (Sinfo.Declarations (Res_Node));
while Nkind (Res_Node) /= N_Subprogram_Body loop
Res_Node := Next (Res_Node);
end loop;
Result := Node_To_Element_New (Node => Res_Node,
Starting_Element => Element);
end if;
end if;
return Result;
end A_Constant_Declaration_Enclosing;
----------------------------------------
-- A_Defining_Expanded_Name_Enclosing --
---------------------------------------
function A_Defining_Expanded_Name_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id := Parent (R_Node (Element));
Parent_Node_Kind : constant Node_Kind := Nkind (Parent_Node);
begin
if Parent_Node_Kind = N_Function_Specification or else
Parent_Node_Kind = N_Procedure_Specification or else
Parent_Node_Kind = N_Package_Specification
then -- one more step up required
Parent_Node := Parent (Parent_Node);
end if;
return Node_To_Element_New (Node => Parent_Node,
Starting_Element => Element);
end A_Defining_Expanded_Name_Enclosing;
-------------------------------------
-- A_Defining_Identifier_Enclosing --
-------------------------------------
function A_Defining_Identifier_Enclosing
(Element : Asis.Element)
return Asis.Element
is
-- A_Defining_Identifier may be processed just in the same way as
-- A_Defining_Expanded_Name, except the following cases:
-- - A_Defining_Identifier obtained as the child of
-- A_Choice_Parameter_Specification element (by means of Names
-- query) - both these elements are based on the same
-- N_Defining_Identifier node
--
-- - A_Defining_Identifier representing a statement label, it is
-- obtained by means of Label_Names query, and it is based on
-- N_Label node which is the member of the node list representing
-- the corresponding statement sequence (or it can be based on
-- N_Identifier node in case if the front-end rewrites a sequence of
-- statement implementing the infinite loop by goto into
-- N_Loop_Statement node. The Enclosing_Element of such
-- A_Defining_Name element will be the statement labeled by it, see
-- Asis_Statements.Label_Names.
--
-- - A_Defining_Identifier representing a statement identifier, it is
-- obtained by means of Statement_Identifier query, and it is based
-- on N_Identifier node. The Enclosing_Element of the name is the
-- named statement, see Asis_Statements.Statement_Identifier. But
-- there is no difference in computing the Enclosing Element
-- (compared to A_Defining_Expanded_Name) in this case.
--
-- - A special processing is needed for a formal package defining name
--
-- - A_Defining_Identifier is from a single task/protected declaration
Parent_Node : Node_Id := Parent (R_Node (Element));
Parent_Node_Kind : constant Node_Kind := Nkind (Parent_Node);
Result_Kind : Internal_Element_Kinds := Not_An_Element;
begin
if Nkind (Node (Element)) = N_Label then
Parent_Node := Next (R_Node (Element));
-- R_Node (Element) definitely is a list member
while not Is_Statement (Parent_Node) loop
Parent_Node := Next (Parent_Node);
end loop;
elsif Nkind (Node (Element)) = N_Identifier
and then
Parent_Node_Kind = N_Loop_Statement
and then
Is_Rewrite_Substitution (Parent_Node)
and then
Nkind (Original_Node (Parent_Node)) = N_Goto_Statement
then
if Is_Empty_List (Sinfo.Statements (Parent_Node)) then
-- Pathological case of
--
-- <<Target>> goto target;
Result_Kind := A_Goto_Statement;
else
Parent_Node := First (Sinfo.Statements (Parent_Node));
end if;
elsif Parent_Node_Kind = N_Exception_Handler then
Parent_Node := R_Node (Element);
Result_Kind := A_Choice_Parameter_Specification;
elsif Nkind (Parent_Node) = N_Generic_Package_Declaration
and then
Nkind (Original_Node (Parent_Node)) = N_Formal_Package_Declaration
and then
R_Node (Element) =
Defining_Identifier (Original_Node (Parent_Node))
then
-- A formal package with a box (but not its expanded spec!)
Result_Kind := A_Formal_Package_Declaration_With_Box;
elsif not Comes_From_Source (Parent_Node)
and then
Nkind (Parent_Node) = N_Object_Declaration
and then
Present (Etype (R_Node (Element)))
and then
Ekind (Etype (R_Node (Element))) in
E_Task_Type .. E_Protected_Type
then
-- The case of a single task/protected definition - the problem here
-- is that Parent field of the argument node points into artificial
-- object declaration, see G214-005
Parent_Node := Etype (R_Node (Element));
if Ekind (Parent_Node) = E_Protected_Type then
Result_Kind := A_Single_Protected_Declaration;
else
Result_Kind := A_Single_Task_Declaration;
end if;
Parent_Node := Parent (Parent_Node);
else
return A_Defining_Expanded_Name_Enclosing (Element);
end if;
return Node_To_Element_New (Node => Parent_Node,
Internal_Kind => Result_Kind,
Starting_Element => Element);
end A_Defining_Identifier_Enclosing;
------------------------------------------
-- A_Defining_Operator_Symbol_Enclosing --
------------------------------------------
function A_Defining_Operator_Symbol_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id := Parent (R_Node (Element));
Parent_Node_Kind : constant Node_Kind := Nkind (Parent_Node);
begin
if Parent_Node_Kind = N_Function_Specification
then -- one more step up required
Parent_Node := Parent (Parent_Node);
end if;
return Node_To_Element_New (Node => Parent_Node,
Starting_Element => Element);
end A_Defining_Operator_Symbol_Enclosing;
--------------------------------
-- A_Discrete_Range_Enclosing --
--------------------------------
function A_Discrete_Range_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id := Parent (R_Node (Element));
Result_Node_Kind : constant Node_Kind := Nkind (Result_Node);
Result_Elem_Kind : Internal_Element_Kinds := Not_An_Element;
begin
if not Comes_From_Source (Result_Node) or else
not Comes_From_Source (Parent (Result_Node))
then
return An_Expression_Enclosing (Element);
end if;
if Nkind (Node (Element)) = N_Component_Clause then
Result_Node := R_Node (Element);
Result_Elem_Kind := A_Component_Clause;
elsif Result_Node_Kind = N_Component_Association then
Result_Elem_Kind := An_Array_Component_Association;
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => Result_Elem_Kind,
Considering_Parent_Count => False);
end A_Discrete_Range_Enclosing;
-----------------------------------
-- A_Discriminant_Part_Enclosing --
-----------------------------------
function A_Discriminant_Part_Enclosing
(Element : Asis.Element)
return Asis.Element
is
begin
return Node_To_Element_New (Node => R_Node (Element),
Starting_Element => Element);
end A_Discriminant_Part_Enclosing;
--------------------------------------------
-- A_Discriminant_Specification_Enclosing --
--------------------------------------------
function A_Discriminant_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element
is
begin
return Node_To_Element_New (
Node => Parent (R_Node (Element)),
Internal_Kind => A_Known_Discriminant_Part,
Starting_Element => Element);
end A_Discriminant_Specification_Enclosing;
----------------------------------------------
-- A_Loop_Parameter_Specification_Enclosing --
----------------------------------------------
function A_Loop_Parameter_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id;
Tmp : Node_Id;
Result : Asis.Element;
begin
Result_Node := Parent (R_Node (Element));
if Nkind (Result_Node) /= N_Quantified_Expression then
-- We have got to N_Ineration_Sceme node only
Result_Node := Parent (Result_Node);
end if;
if Declaration_Kind (Element) in
A_Generalized_Iterator_Specification ..
An_Element_Iterator_Specification
then
-- Here we may have to get to an artificial block statement the
-- needed loop node is rewritten into
Tmp := Parent (Parent (Result_Node));
if Nkind (Tmp) = N_Block_Statement
and then
Is_Rewrite_Substitution (Tmp)
and then
Nkind (Original_Node (Tmp)) = N_Loop_Statement
then
Result_Node := Tmp;
end if;
end if;
Result := Node_To_Element_New (Node => Result_Node,
Starting_Element => Element);
if Int_Kind (Result) = A_Parenthesized_Expression then
-- This is the case when an iteration scheme is used in a
-- conditional or quantified expression. We go in bottom-up
-- direction, so we can have A_Parenthesized_Expression only as the
-- next enclosing Element
Result := An_Expression_Enclosing (Element);
end if;
return Result;
end A_Loop_Parameter_Specification_Enclosing;
--------------------------------
-- A_Null_Component_Enclosing --
--------------------------------
function A_Null_Component_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : constant Node_Id := Node (Element);
Parent_Internal_Kind : Internal_Element_Kinds;
begin
if Nkind (Parent_Node) = N_Record_Definition then
Parent_Internal_Kind := A_Record_Definition;
else
Parent_Internal_Kind := A_Variant;
end if;
return Node_To_Element_New (Node => Parent_Node,
Internal_Kind => Parent_Internal_Kind,
Starting_Element => Element);
end A_Null_Component_Enclosing;
-----------------------------------------
-- A_Parameter_Specification_Enclosing --
-----------------------------------------
function A_Parameter_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id := Parent (R_Node (Element));
Result_Node_Kind : constant Node_Kind := Nkind (Result_Node);
begin
if not (Result_Node_Kind = N_Entry_Declaration or else
Result_Node_Kind = N_Access_Function_Definition or else
Result_Node_Kind = N_Access_Procedure_Definition or else
Result_Node_Kind = N_Accept_Statement)
-- --|A2005 start
or else
(Nkind (Parent (Result_Node)) = N_Identifier
and then
Is_Rewrite_Substitution (Parent (Result_Node))
and then
Nkind (Original_Node (Parent (Result_Node))) = N_Access_Definition)
or else
Nkind (Parent (Result_Node)) = N_Access_Definition
-- --|A2005 end
then
Result_Node := Parent (Result_Node);
-- the first Parent gives N_Function/Procedure_Specification only
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Considering_Parent_Count => False);
end A_Parameter_Specification_Enclosing;
------------------------
-- A_Pragma_Enclosing --
------------------------
function A_Pragma_Enclosing (Element : Asis.Element) return Asis.Element is
Parent_Node : Node_Id := Atree.Parent (R_Node (Element));
Parent_Node_Kind : Node_Kind := Nkind (Parent_Node);
Parent_Internal_Kind : Internal_Element_Kinds;
begin
if Parent_Node_Kind = N_Loop_Statement
and then
Is_Rewrite_Substitution (Parent_Node)
and then
Nkind (Original_Node (Parent_Node)) = N_Goto_Statement
then
-- This is the case when infinite loop implemented as
--
-- <<Target>> ...
-- ...
-- goto Target;
--
-- is rewritten into N_Loop_Statement
Parent_Node := Parent (Parent_Node);
Parent_Node_Kind := Nkind (Parent_Node);
end if;
-- filtering out compilation pragmas and correcting Parent_Node,
-- if necessary
case Parent_Node_Kind is
when N_Handled_Sequence_Of_Statements
| N_Package_Specification
| N_Component_List =>
Parent_Node := Atree.Parent (Parent_Node);
Parent_Node_Kind := Nkind (Parent_Node);
when N_Compilation_Unit =>
return Asis.Nil_Element;
when others =>
null;
end case;
-- special processing for Nodes requiring by-hand Enclosing Element
-- kind determination and returning the result for all other Nodes
case Parent_Node_Kind is
when N_If_Statement =>
if List_Containing (R_Node (Element)) =
Then_Statements (Parent_Node)
then
Parent_Internal_Kind := An_If_Path;
else
Parent_Internal_Kind := An_Else_Path;
end if;
-- ??? List_Containing (Node (Element)) ??
-- ??? or List_Containing (R_Node (Element)) ??
when N_Conditional_Entry_Call
| N_Selective_Accept =>
Parent_Internal_Kind := An_Else_Path;
when N_Record_Definition =>
Parent_Internal_Kind := An_Else_Path;
when others => -- auto determination of the Enclosing Element kind:
return Node_To_Element_New (Node => Parent_Node,
Starting_Element => Element);
end case;
-- returning the Enclosing Element with the by-hand-defined kind:
return Node_To_Element_New (Node => Parent_Node,
Internal_Kind => Parent_Internal_Kind,
Starting_Element => Element);
end A_Pragma_Enclosing;
-------------------------------------------
-- A_Range_Attribute_Reference_Enclosing --
-------------------------------------------
function A_Range_Attribute_Reference_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id := Parent (R_Node (Element));
Tmp : Node_Id := Parent (Result_Node);
begin
if Nkind (Result_Node) = N_Subtype_Indication and then
Nkind (Tmp) = N_Subtype_Declaration and then
not Comes_From_Source (Tmp)
then
-- This N_Subtype_Declaration is from the tree structure created
-- for an artificial subtype declaration, see C208-003
Tmp := Next (Tmp);
Result_Node := Object_Definition (Tmp);
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Considering_Parent_Count => False);
end A_Range_Attribute_Reference_Enclosing;
-----------------------------------
-- A_Record_Definition_Enclosing --
-----------------------------------
function A_Record_Definition_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id;
Parent_Internal_Kind : Internal_Element_Kinds;
begin
if Nkind (Parent (R_Node (Element))) = N_Derived_Type_Definition then
Parent_Node := Parent (R_Node (Element));
Parent_Internal_Kind := A_Derived_Record_Extension_Definition;
else
Parent_Node := Node (Element);
if Tagged_Present (Parent_Node) then
Parent_Internal_Kind := A_Tagged_Record_Type_Definition;
else
Parent_Internal_Kind := A_Record_Type_Definition;
end if;
end if;
return Node_To_Element_New (Node => Parent_Node,
Internal_Kind => Parent_Internal_Kind,
Starting_Element => Element);
end A_Record_Definition_Enclosing;
-----------------------------------------
-- A_Simple_Expression_Range_Enclosing --
----------------------------------------
function A_Simple_Expression_Range_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Enclosing_Node : Node_Id := Node (Element);
Enclosing_Node_Kind : Node_Kind := Nkind (Enclosing_Node);
Context : Node_Id;
Context_Kind : Node_Kind;
Enclosing_Element_Kind : Internal_Element_Kinds;
begin
if Enclosing_Node_Kind = N_Signed_Integer_Type_Definition then
-- back from Integer_Constraint
return Node_To_Element_New
(Starting_Element => Element,
Node => R_Node (Element),
Internal_Kind => A_Signed_Integer_Type_Definition,
Considering_Parent_Count => False);
else -- one step up
Enclosing_Node := Parent (R_Node (Element));
Enclosing_Node_Kind := Nkind (Enclosing_Node);
-- possible values of corresponding kinds of
-- Enclosing_Node_Kind: Enclosing Element:
--
-- N_Floating_Point_Definition A_Floating_Point_Definition (*)
-- N_Ordinary_Fixed_Point_Definition An_Ordinary_Fixed_Point_Definition (*)
-- N_Decimal_Fixed_Point_Definition A_Decimal_Fixed_Point_Definition (*)
--
-- A_Constraint
-- N_Digits_Constraint A_Digits_Constraint (*)
-- N_Delta_Constraint A_Delta_Constraint (*)
--
--
-- A_Subtype_Indication
-- N_Subtype_Indication A_Discrete_Subtype_Indication
-- (_As_Subtype_Definition)
-- A_Subtype_Indication
--
-- A_Discrete_Range
-- N_Subtype_Indication A_Discrete_Subtype_Indication
--
--
--
-- N_In An_In_Range_Membership_Test (*)
-- N_Not_In A_Not_In_Range_Membership_Test (*)
--
-- (*) means that the Enclosing Element can be obtained by Node_To_Elemen
-- constructor with auto determination of the Element kind
if Enclosing_Node_Kind /= N_Subtype_Indication then
return Node_To_Element_New
(Starting_Element => Element,
Node => Enclosing_Node,
Considering_Parent_Count => False);
else
-- A_Discrete_Subtype_Indication or
-- A_Discrete_Subtype_Indication_As_Subtype_Definition
-- or A_Subtype_Indication?
-- First, we have to skip implicit subtype created for
-- constraint directly included in object declaration,
-- if any
Skip_Implicit_Subtype (Enclosing_Node);
Context := Parent (Enclosing_Node);
Context_Kind := Nkind (Context);
if Context_Kind = N_Subtype_Indication then
-- it's impossible to make a decision on the base
-- of this node, we shall go one more step up
Context := Parent (Context);
Context_Kind := Nkind (Context);
end if;
if Context_Kind = N_Subtype_Declaration or else
((Context_Kind = N_Constrained_Array_Definition or else
Context_Kind = N_Unconstrained_Array_Definition)
and then
Enclosing_Node = Sinfo.Component_Definition (Context))
or else
-- is it enough or should we add:
-- and then Enclosing_Node = Subtype_Indication (Context)?
Context_Kind = N_Derived_Type_Definition or else
Context_Kind = N_Access_To_Object_Definition
then
Enclosing_Element_Kind := A_Subtype_Indication;
elsif Context_Kind = N_Constrained_Array_Definition or else
Context_Kind = N_Entry_Declaration or else
Context_Kind = N_Entry_Index_Specification or else
Context_Kind = N_Loop_Parameter_Specification
then
Enclosing_Element_Kind :=
A_Discrete_Subtype_Indication_As_Subtype_Definition;
elsif Context_Kind = N_Component_Declaration or else
Context_Kind = N_Object_Declaration or else
Context_Kind = N_Component_Definition
then
Enclosing_Element_Kind := A_Subtype_Indication;
else
Enclosing_Element_Kind :=
A_Discrete_Subtype_Indication;
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Enclosing_Node,
Internal_Kind => Enclosing_Element_Kind,
Considering_Parent_Count => False);
end if;
end if;
end A_Simple_Expression_Range_Enclosing;
---------------------------
-- A_Statement_Enclosing --
---------------------------
function A_Statement_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id := Parent (R_Node (Element));
Parent_Node_Kind : Node_Kind := Nkind (Parent_Node);
Parent_Internal_Kind : Internal_Element_Kinds;
begin
if Parent_Node_Kind = N_Loop_Statement
and then
Is_Rewrite_Substitution (Parent_Node)
and then
Nkind (Original_Node (Parent_Node)) = N_Goto_Statement
then
-- This is the case when infinite loop implemented as
--
-- <<Target>> ...
-- ...
-- goto Target;
--
-- is rewritten into N_Loop_Statement
Parent_Node := Parent (Parent_Node);
Parent_Node_Kind := Nkind (Parent_Node);
end if;
if Parent_Node_Kind = N_If_Statement then
if List_Containing (R_Node (Element)) =
Then_Statements (Parent_Node)
then
Parent_Internal_Kind := An_If_Path;
else
Parent_Internal_Kind := An_Else_Path;
end if;
-- ??? List_Containing (Node (Element)) ??
-- ?? or List_Containing (R_Node (Element)) ??
elsif Parent_Node_Kind = N_Conditional_Entry_Call or else
Parent_Node_Kind = N_Selective_Accept
then
Parent_Internal_Kind := An_Else_Path;
else
if Parent_Node_Kind = N_Handled_Sequence_Of_Statements then
-- to go to N_Block_Statement, N_Accept_Statement,
-- N_Subprogram_Body, N_Package_Body, N_Task_Body or
-- N_Entry_Body node
Parent_Node := Parent (Parent_Node);
end if;
return Node_To_Element_New (Node => Parent_Node,
Starting_Element => Element);
end if;
return Node_To_Element_New (Node => Parent_Node,
Internal_Kind => Parent_Internal_Kind,
Starting_Element => Element);
end A_Statement_Enclosing;
------------------------------------
-- A_Subtype_Indication_Enclosing --
------------------------------------
function A_Subtype_Indication_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id := Parent (R_Node (Element));
Result_Node : Node_Id := R_Node (Element);
Parent_Node_Kind : constant Node_Kind := Nkind (Parent_Node);
Result_Kind : Internal_Element_Kinds;
begin
if Parent_Node_Kind = N_Component_Definition then
Parent_Node := Parent (Parent_Node);
-- This skips the normalized component declarations back!
Parent_Node := Sinfo.Component_Definition (Parent_Node);
end if;
if Parent_Node_Kind = N_Allocator and then
Nkind (Parent (Parent_Node)) = N_Component_Association and then
not Comes_From_Source (Parent (Parent_Node))
then
return An_Expression_Enclosing (Element);
end if;
if Parent_Node_Kind = N_Unconstrained_Array_Definition or else
Parent_Node_Kind = N_Constrained_Array_Definition or else
Parent_Node_Kind = N_Component_Declaration
then
Result_Kind := A_Component_Definition;
elsif Parent_Node_Kind = N_Private_Extension_Declaration then
Result_Kind := A_Private_Extension_Definition;
Result_Node := Parent_Node;
else
return Node_To_Element_New
(Starting_Element => Element,
Node => Parent_Node,
Considering_Parent_Count => False);
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => Result_Kind,
Considering_Parent_Count => False);
end A_Subtype_Indication_Enclosing;
-------------------------------------------------
-- A_Terminate_Alternative_Statement_Enclosing --
-------------------------------------------------
function A_Terminate_Alternative_Statement_Enclosing
(Element : Asis.Element)
return Asis.Element
is
begin
return Node_To_Element_New (Node => R_Node (Element),
Starting_Element => Element);
end A_Terminate_Alternative_Statement_Enclosing;
------------------------------
-- A_Variant_Part_Enclosing --
------------------------------
function A_Variant_Part_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : constant Node_Id := Parent (Parent (R_Node (Element)));
Result_Kind : Internal_Element_Kinds;
begin
if Nkind (Result_Node) = N_Record_Definition then
Result_Kind := A_Record_Definition;
else
Result_Kind := A_Variant;
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => Result_Kind,
Considering_Parent_Count => False);
end A_Variant_Part_Enclosing;
------------------------------
-- An_Association_Enclosing --
------------------------------
function An_Association_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result : Asis.Element;
begin
if Normalization_Case (Element) = Is_Not_Normalized then
Result := An_Expression_Enclosing (Element);
else
Result := Node_To_Element_New
(Node => R_Node (Element),
Starting_Element => Element);
Set_From_Implicit (Result, False);
end if;
return Result;
end An_Association_Enclosing;
----------------------------------------------
-- An_Attribute_Definition_Clause_Enclosing --
----------------------------------------------
function An_Attribute_Definition_Clause_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id := Parent (R_Node (Element));
Result_Node_Kind : Node_Kind := Nkind (Result_Node);
Result_Kind : Internal_Element_Kinds := Not_An_Element;
begin
if Result_Node_Kind = N_Component_List or else
Result_Node_Kind = N_Package_Specification
then
Result_Node := Parent (Result_Node);
Result_Node_Kind := Nkind (Result_Node);
end if;
if Result_Node_Kind = N_Record_Definition then
Result_Kind := A_Record_Definition;
elsif Result_Node_Kind = N_Variant then
Result_Kind := A_Variant;
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => Result_Kind,
Considering_Parent_Count => False);
end An_Attribute_Definition_Clause_Enclosing;
----------------------------
-- An_Else_Path_Enclosing --
----------------------------
function An_Else_Path_Enclosing
(Element : Asis.Element)
return Asis.Element
is
begin
return Node_To_Element_New (Node => R_Node (Element),
Starting_Element => Element);
end An_Else_Path_Enclosing;
----------------------------------------------------
-- An_Enumeration_Literal_Specification_Enclosing --
----------------------------------------------------
function An_Enumeration_Literal_Specification_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id;
Start_Elem : Asis.Element := Element;
begin
if Special_Case (Element) = Stand_Char_Literal then
Result_Node := R_Node (Element);
Set_Character_Code (Start_Elem, 0);
Set_Special_Case (Start_Elem, Explicit_From_Standard);
else
Result_Node := Parent (R_Node (Element));
end if;
return Node_To_Element_New
(Starting_Element => Start_Elem,
Node => Result_Node,
Internal_Kind => An_Enumeration_Type_Definition);
end An_Enumeration_Literal_Specification_Enclosing;
----------------------------------------------
-- An_Enumeration_Type_Definition_Enclosing --
----------------------------------------------
function An_Enumeration_Type_Definition_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Result_Node : Node_Id;
begin
if Special_Case (Element) = Stand_Char_Literal then
Result_Node := R_Node (Element);
if Nkind (Result_Node) = N_Defining_Identifier then
-- we are in the definition of Standard.Boolean:
Result_Node := Parent (Etype (Result_Node));
end if;
else
Result_Node := Parent (R_Node (Element));
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => An_Ordinary_Type_Declaration);
end An_Enumeration_Type_Definition_Enclosing;
------------------------------------
-- An_Exception_Handler_Enclosing --
------------------------------------
function An_Exception_Handler_Enclosing
(Element : Asis.Element)
return Asis.Element
is
begin
return Node_To_Element_New
(Node => Parent (Parent (R_Node (Element))),
Starting_Element => Element);
end An_Exception_Handler_Enclosing;
-----------------------------
-- An_Expression_Enclosing --
-----------------------------
function An_Expression_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Start_Elem : Asis.Element := Element;
Rough_Result_Node : Node_Id;
Res_Entity : Entity_Id;
Rough_Result_Element : Asis.Element;
Rough_Res_Spec_Case : Special_Cases;
Result_Element : Asis.Element;
begin
Rough_Result_Node := Get_Rough_Enclosing_Node (Element);
if not (Sloc (Node (Start_Elem)) <= Standard_Location or else
Special_Case (Start_Elem) = Configuration_File_Pragma)
then
Set_Special_Case (Start_Elem, Not_A_Special_Case);
end if;
Rough_Result_Element := Node_To_Element_New
(Node => Rough_Result_Node,
Starting_Element => Start_Elem);
if Is_Top_Of_Expanded_Generic (Rough_Result_Node)
and then
Is_From_Instance (Element)
and then
(Nkind (Original_Node (Rough_Result_Node)) /=
N_Formal_Package_Declaration
or else
Instantiation_Depth (Sloc (R_Node (Element))) >
Instantiation_Depth (Sloc (Rough_Result_Node)))
then
-- ??? The content of this if statement is just a slightly edited
-- ??? fragment of Enclosing_For_Explicit_Instance_Component
if Nkind (Rough_Result_Node) = N_Package_Declaration or else
Nkind (Rough_Result_Node) = N_Package_Body
then
Rough_Res_Spec_Case := Expanded_Package_Instantiation;
-- and here we have to correct the result:
Set_Node (Rough_Result_Element, R_Node (Rough_Result_Element));
if Nkind (Rough_Result_Node) = N_Package_Declaration then
Set_Int_Kind (Rough_Result_Element, A_Package_Declaration);
else
Set_Int_Kind (Rough_Result_Element, A_Package_Body_Declaration);
end if;
else
Rough_Res_Spec_Case := Expanded_Subprogram_Instantiation;
end if;
Set_Special_Case (Rough_Result_Element, Rough_Res_Spec_Case);
end if;
if Special_Case (Element) = Is_From_Gen_Association
and then
Is_Top_Of_Expanded_Generic (Node (Rough_Result_Element))
and then
Instantiation_Depth (Sloc (Node (Rough_Result_Element))) =
Instantiation_Depth (Sloc (Node (Element)))
then
Rough_Result_Element := Enclosing_Element (Rough_Result_Element);
end if;
if Nkind (Rough_Result_Node) = N_Subprogram_Declaration
and then
not Comes_From_Source (Rough_Result_Node)
then
Res_Entity := Defining_Unit_Name (Specification (Rough_Result_Node));
if (Ekind (Res_Entity) = E_Function
and then not Comes_From_Source (Res_Entity)
and then Chars (Res_Entity) = Snames.Name_Op_Ne)
and then Present (Corresponding_Equality (Res_Entity))
then
Set_Special_Case
(Rough_Result_Element, Is_From_Imp_Neq_Declaration);
end if;
end if;
Result_Element := Get_Enclosing
(Approximation => Rough_Result_Element,
Element => Element);
return Result_Element;
end An_Expression_Enclosing;
--------------------------------
-- An_Others_Choice_Enclosing --
--------------------------------
function An_Others_Choice_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : constant Node_Id := Parent (Parent (R_Node (Element)));
Result_Node : Node_Id := Parent (R_Node (Element));
Result_Kind : Internal_Element_Kinds := Not_An_Element;
begin
if Nkind (Result_Node) = N_Component_Association then
-- we have to find out, is it record or array component
-- association. Parent_Node points to the enclosing aggregate
if No (Etype (Parent_Node)) or else
Is_Array_Type (Etype (Parent_Node))
then
-- the first condition in 'or else' is true for multi-dimensional
-- array aggregates
Result_Kind := An_Array_Component_Association;
else
Result_Kind := A_Record_Component_Association;
end if;
elsif Nkind (Result_Node) = N_Package_Declaration
and then
Nkind (Original_Node (Result_Node)) = N_Formal_Package_Declaration
then
Result_Node :=
Last_Non_Pragma
(Generic_Associations (Original_Node (Result_Node)));
Result_Kind := A_Generic_Association;
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Internal_Kind => Result_Kind,
Considering_Parent_Count => False);
end An_Others_Choice_Enclosing;
----------------------------------------------------
-- Not_Implemented_Enclosing_Element_Construction --
----------------------------------------------------
function Not_Implemented_Enclosing_Element_Construction
(Element : Asis.Element) return Asis.Element is
begin
Not_Implemented_Yet (Diagnosis =>
"Enclosing Element retrieval for the explicit Element "
& "of the " & Internal_Element_Kinds'Image
(Int_Kind (Element)) & " kind "
& "has not been implemented yet");
return Asis.Nil_Element; -- to make the code syntactically correct;
end Not_Implemented_Enclosing_Element_Construction;
----------------------------
-- Possible_C_U_Enclosing --
----------------------------
function Possible_C_U_Enclosing
(Element : Asis.Element)
return Asis.Element
is
Parent_Node : Node_Id := Parent (R_Node (Element));
Parent_Node_Kind : constant Node_Kind := Nkind (Parent_Node);
begin
if Parent_Node_Kind = N_Compilation_Unit or else
Parent_Node_Kind = N_Subunit
then
return Asis.Nil_Element;
elsif Parent_Node_Kind = N_Package_Specification then
Parent_Node := Parent (Parent_Node);
elsif Parent_Node_Kind = N_Protected_Definition then
Parent_Node := Parent (Parent_Node);
Parent_Node := Protected_Definition (Original_Node (Parent_Node));
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Parent_Node);
end Possible_C_U_Enclosing;
-----------------------------------------------------------------
-- Section 6 - bodies for the routines defined in the package --
-- spec and local subprograms --
-----------------------------------------------------------------
---------------------------------
-- Corresponding_Instantiation --
---------------------------------
function Corresponding_Instantiation
(Element : Asis.Element)
return Asis.Element
is
Argument_Node : Node_Id := R_Node (Element);
Argument_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result_Node : Node_Id := Argument_Node;
Result_Kind : Internal_Element_Kinds;
Result_Unit : constant Asis.Compilation_Unit := Encl_Unit (Element);
begin
if Argument_Kind = A_Package_Declaration or else
Argument_Kind = A_Package_Body_Declaration
then
-- A formal package with box needs a special processing - it is
-- based on the same node as the argument
if Nkind (Original_Node (Argument_Node)) =
N_Formal_Package_Declaration
and then
Box_Present (Original_Node (Argument_Node))
then
Result_Kind := A_Formal_Package_Declaration_With_Box;
else
Argument_Node := Parent (Argument_Node);
if Nkind (Argument_Node) in N_Generic_Declaration and then
Is_List_Member (Result_Node) and then
List_Containing (Result_Node) =
Generic_Formal_Declarations (Argument_Node)
then
Result_Kind := A_Formal_Package_Declaration;
else
Result_Kind := A_Package_Instantiation;
end if;
end if;
else
if Argument_Kind = A_Procedure_Declaration or else
Argument_Kind = A_Procedure_Body_Declaration
then
Result_Kind := A_Procedure_Instantiation;
else
Result_Kind := A_Function_Instantiation;
end if;
-- we have to go the N_Package_Decalaration node of an
-- artificial package created by the compiler for a subprogram
-- instantiation - two steps up the tree are needed:
Result_Node := Parent (Result_Node);
if Argument_Kind = A_Procedure_Declaration or else
Argument_Kind = A_Function_Declaration
then
Result_Node := Parent (Result_Node);
end if;
end if;
if Nkind (Parent (Result_Node)) = N_Compilation_Unit then
-- For library-level subprogram instantiations we may have a
-- problem in the tree created for the instantiation itself.
if Nkind (Result_Node) = N_Package_Declaration and then
not Is_Rewrite_Substitution (Result_Node)
then
Result_Node := Parent (Corresponding_Body (Result_Node));
if Nkind (Result_Node) = N_Defining_Program_Unit_Name then
Result_Node := Parent (Result_Node);
end if;
end if;
elsif Nkind (Original_Node (Result_Node)) /=
N_Formal_Package_Declaration
then
-- "local" instantiation, therefore - one or two steps down the
-- declaration list to get in the instantiation node, a formal
-- package with a box is an exception:
Result_Node := Next_Non_Pragma (Result_Node);
if Nkind (Result_Node) = N_Package_Body then
-- This is an expanded generic body
Result_Node := Next_Non_Pragma (Result_Node);
end if;
end if;
if Is_Rewrite_Substitution (Result_Node) and then
Is_Rewrite_Substitution (Original_Node (Result_Node))
then
Result_Node := Original_Node (Result_Node);
end if;
return Node_To_Element_New
(Node => Result_Node,
Internal_Kind => Result_Kind,
In_Unit => Result_Unit);
end Corresponding_Instantiation;
------------------------------------
-- Enclosing_Element_For_Explicit --
------------------------------------
function Enclosing_Element_For_Explicit
(Element : Asis.Element)
return Asis.Element
is
Enclosing_Construction_Case : Internal_Element_Kinds;
Element_Internal_Kind : Internal_Element_Kinds;
Result_Element : Asis.Element;
Res_Node : constant Node_Id := Standard_Package_Node;
Res_Kind : Internal_Element_Kinds := Not_An_Element;
Res_Spec_Case : Special_Cases;
begin
Element_Internal_Kind := Int_Kind (Element);
-- A special case of fake Numeric_Error renaming is handled
-- separately (see B712-0050)
if Special_Case (Element) = Numeric_Error_Renaming then
case Element_Internal_Kind is
when An_Exception_Renaming_Declaration =>
Res_Kind := A_Package_Declaration;
Res_Spec_Case := Explicit_From_Standard;
when A_Defining_Identifier |
An_Identifier =>
Res_Kind := An_Exception_Renaming_Declaration;
Res_Spec_Case := Numeric_Error_Renaming;
when others =>
null;
end case;
Result_Element := Node_To_Element_New
(Starting_Element => Element,
Node => Res_Node,
Internal_Kind => Res_Kind,
Spec_Case => Res_Spec_Case);
return Result_Element;
end if;
-- A special case of a configuration pragma is handled separately
-- (BA07-013)
if Element_Internal_Kind in Internal_Pragma_Kinds and then
Special_Case (Element) = Configuration_File_Pragma
then
return Asis.Nil_Element;
end if;
Enclosing_Construction_Case :=
Enclosing_Element_For_Explicits_First_Switch (Element_Internal_Kind);
case Enclosing_Construction_Case is
when Not_An_Element =>
return Asis.Nil_Element;
when Trivial_Mapping =>
Result_Element := General_Encl_Elem (Element);
when Non_Trivial_Mapping =>
Result_Element :=
Enclosing_Element_For_Explicits_Second_Switch
(Element_Internal_Kind) (Element);
when No_Mapping =>
No_Enclosing_Element (Element_Kind => Element_Internal_Kind);
return Asis.Nil_Element; -- to avoid GNAT warning
when Not_Implemented_Mapping =>
Not_Implemented_Enclosing_Element_Construction
(Element => Element);
when others =>
-- others means here that the Enclosing Element should
-- based on the same node.
Result_Element := Node_To_Element_New
(Starting_Element => Element,
Node => R_Node (Element),
Internal_Kind => Enclosing_Construction_Case,
Considering_Parent_Count => False);
if Element_Internal_Kind = A_Defining_Character_Literal then
Set_Character_Code (Result_Element, Character_Code (Element));
end if;
end case;
if Is_From_Implicit (Element)
and then
Statement_Kind (Element) = A_Null_Statement
then
-- Case of an implicit NULL statement needed for 'floating' labels,
-- Ada 2012
Set_From_Implicit (Result_Element, False);
end if;
return Result_Element;
end Enclosing_Element_For_Explicit;
-----------------------------------------------
-- Enclosing_For_Explicit_Instance_Component --
-----------------------------------------------
function Enclosing_For_Explicit_Instance_Component
(Element : Asis.Element)
return Asis.Element
is
Result_Element : Asis.Element;
Result_Node : Node_Id;
Tmp_Node : Node_Id;
Res_Spec_Case : Special_Cases;
function Is_Top_Exp_Form_Pack_With_Box
(Potential_Enclosing_Element : Asis.Element;
Arg_Element : Asis.Element)
return Boolean;
-- Checks if Potential_Enclosing_Element is the top expanded spec
-- (??? what about body???) for a formal package declaration with box.
-- The problem here is that when going up the tree, we can get into this
-- argument both from components of the formal package declaration with
-- box and from the corresponding expanded spec. So we have to check
-- if Potential_Enclosing_Element and Arg_Element are the same level
-- of instantiating (nested instances may be a pain! The function needs
-- more testing ???)
-- See the discussion in E425-007
function Is_Top_Exp_Form_Pack_With_Box
(Potential_Enclosing_Element : Asis.Element;
Arg_Element : Asis.Element)
return Boolean
is
EE_Inst_Level : Natural := 0;
Arg_Inst_Level : Natural := 0;
Src : Source_Ptr :=
Instantiation
(Get_Source_File_Index
(Sloc (R_Node (Potential_Enclosing_Element))));
function May_Be_Exp_Pack_Def_Name
(N_Pack : Node_Id;
N_Name : Node_Id)
return Boolean;
-- In case of the defining name of an expanded package created for a
-- formal package with the box, we have the instantiation chain one
-- link shorter then the rest of the expanded package, so we have
-- to detect this situation.
function May_Be_Nested_FP_Instantiation
(N_Pack : Node_Id;
N_Name : Node_Id)
return Boolean;
-- See E430-A01. We try to detect the situation when we go out of
-- a chain of nested instantiations created by formal packages with
-- the box
function May_Be_Exp_Pack_Def_Name
(N_Pack : Node_Id;
N_Name : Node_Id)
return Boolean
is
Result : Boolean := False;
begin
if Nkind (N_Name) = N_Defining_Identifier
and then
Nkind (Original_Node (N_Pack)) = N_Formal_Package_Declaration
and then
Box_Present (Original_Node (N_Pack))
then
Result := N_Name = Defining_Unit_Name (Specification (N_Pack));
end if;
return Result;
end May_Be_Exp_Pack_Def_Name;
function May_Be_Nested_FP_Instantiation
(N_Pack : Node_Id;
N_Name : Node_Id)
return Boolean
is
Result : Boolean := False;
begin
if Nkind (N_Pack) = N_Generic_Package_Declaration
and then
Nkind (Original_Node (N_Pack)) = N_Formal_Package_Declaration
and then
Box_Present (Original_Node (N_Pack))
and then
Nkind (N_Name) = N_Generic_Package_Declaration
and then
Nkind (Original_Node (N_Name)) = N_Formal_Package_Declaration
and then
Box_Present (Original_Node (N_Name))
then
Result := True;
end if;
return Result;
end May_Be_Nested_FP_Instantiation;
begin
if not (Nkind (Node (Potential_Enclosing_Element)) =
N_Formal_Package_Declaration
and then
Nkind (R_Node (Potential_Enclosing_Element)) =
N_Generic_Package_Declaration)
or else
(Int_Kind (Potential_Enclosing_Element) =
A_Formal_Package_Declaration_With_Box
and then
Node (Arg_Element) =
Defining_Identifier (Node (Potential_Enclosing_Element)))
then
return False;
end if;
while Src /= No_Location loop
EE_Inst_Level := EE_Inst_Level + 1;
Src := Instantiation (Get_Source_File_Index (Src));
end loop;
Src :=
Instantiation (Get_Source_File_Index (Sloc (R_Node (Arg_Element))));
while Src /= No_Location loop
Arg_Inst_Level := Arg_Inst_Level + 1;
Src := Instantiation (Get_Source_File_Index (Src));
end loop;
return (May_Be_Exp_Pack_Def_Name
(R_Node (Potential_Enclosing_Element),
R_Node (Arg_Element))
and then
EE_Inst_Level = Arg_Inst_Level + 1)
or else
(May_Be_Nested_FP_Instantiation
(R_Node (Potential_Enclosing_Element),
R_Node (Arg_Element))
and then
EE_Inst_Level + 1 = Arg_Inst_Level)
or else
EE_Inst_Level = Arg_Inst_Level;
end Is_Top_Exp_Form_Pack_With_Box;
begin
Result_Element := Enclosing_Element_For_Explicit (Element);
if Is_Nil (Result_Element) then
-- There is a special case corresponding to the defining name in an
-- artificial subtype declaration that is a means to pass an actual
-- type in the expanded instantiation (see K811-006). Under some
-- conditions the corresponding node in the tree is an Itype node,
-- and it does not have a Parent reference set.
Tmp_Node := Node (Element);
if Nkind (Tmp_Node) = N_Defining_Identifier and then
Is_Itype (Tmp_Node)
then
Tmp_Node := Associated_Node_For_Itype (Tmp_Node);
Result_Element :=
Node_To_Element_New
(Node => Tmp_Node,
Starting_Element => Element,
Internal_Kind => A_Subtype_Declaration);
end if;
end if;
-- In case if the result argument is an artificial declaration
-- used to pass an actual into expanded subprogram, we are
-- in the spec of the artificial wrapper package. So we have to get
-- to the expanded subprogram declaration (see G416-009)
if Is_Top_Of_Expanded_Generic (R_Node (Result_Element)) then
Tmp_Node := (R_Node (Result_Element));
if Nkind (Tmp_Node) = N_Package_Declaration
and then
No (Generic_Parent (Specification (Tmp_Node))) then
-- This IF statement prevents us from doing this special
-- processing for expanded package declarations, we have to do
-- it only for wrapper packages created for subprogram
-- instantiation
Tmp_Node :=
Last (Visible_Declarations (Specification (Tmp_Node)));
Result_Element :=
Node_To_Element_New
(Node => Tmp_Node,
Spec_Case => Expanded_Subprogram_Instantiation,
Starting_Element => Element);
end if;
end if;
-- and now we have to check if we are in the whole expanded
-- declaration
Result_Node := R_Node (Result_Element);
if not (Is_Rewrite_Substitution (Result_Node)
and then
Nkind (Original_Node (Result_Node)) =
N_Formal_Package_Declaration
and then
(Node (Element) =
Defining_Identifier (Original_Node (Result_Node))
or else
(Node (Element) /=
Defining_Unit_Name (Specification (Result_Node))
and then
Instantiation_Depth (Sloc (R_Node (Element))) =
Instantiation_Depth (Sloc (Result_Node)))))
and then
Is_Top_Of_Expanded_Generic (Result_Node)
then
-- this is an artificial package or subprogram declaration
-- created by the compiler as an expanded generic declaration
if Nkind (Result_Node) = N_Package_Declaration or else
Nkind (Result_Node) = N_Package_Body
then
Res_Spec_Case := Expanded_Package_Instantiation;
-- and here we have to correct the result:
Set_Node (Result_Element, R_Node (Result_Element));
if Nkind (Result_Node) = N_Package_Declaration then
Set_Int_Kind (Result_Element, A_Package_Declaration);
else
Set_Int_Kind (Result_Element, A_Package_Body_Declaration);
end if;
else
Res_Spec_Case := Expanded_Subprogram_Instantiation;
end if;
Set_Special_Case (Result_Element, Res_Spec_Case);
elsif Is_Top_Exp_Form_Pack_With_Box (Result_Element, Element) then
-- This case is somewhat special - we have not a package, but a
-- generic package declaration as expanded code here
Set_Int_Kind (Result_Element, A_Package_Declaration);
Set_Special_Case (Result_Element, Expanded_Package_Instantiation);
-- ??? What about expanded bodies for formal packages with a box?
end if;
-- and we have to correct Is_Part_Of_Instance field of the result -
-- just in case. May be, it will not be necessary, if (and when)
-- Enclosing_Element_For_Explicit takes the corresponding fields
-- from its argument
if not Is_Nil (Result_Element) then
Set_From_Instance (Result_Element, True);
end if;
return Result_Element;
end Enclosing_For_Explicit_Instance_Component;
------------------------------------
-- Enclosing_Element_For_Implicit --
------------------------------------
function Enclosing_Element_For_Implicit
(Element : Asis.Element)
return Asis.Element
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result_Node : Node_Id := Empty;
Result_Element : Asis.Element;
Result_Kind : Internal_Element_Kinds := Not_An_Element;
Res_Spec_Case : Special_Cases := Not_A_Special_Case;
begin
-- Special treatment for the declaration of implicit "/=", see F903-002:
if Asis.Extensions.Is_Implicit_Neq_Declaration (Element) then
Result_Element :=
Enclosing_Element
(Asis.Declarations.Corresponding_Equality_Operator (Element));
else
case Arg_Kind is
when A_Procedure_Declaration |
A_Function_Declaration |
A_Procedure_Body_Declaration |
A_Function_Body_Declaration |
A_Procedure_Renaming_Declaration |
A_Function_Renaming_Declaration |
A_Discriminant_Specification |
A_Component_Declaration =>
Result_Node := Original_Node (Node_Field_1 (Element));
if Nkind (Result_Node) in N_Entity
and then
(Arg_Kind in A_Procedure_Declaration ..
A_Function_Declaration
or else
Arg_Kind in A_Procedure_Body_Declaration ..
A_Function_Body_Declaration
or else
Arg_Kind in A_Procedure_Renaming_Declaration ..
A_Function_Renaming_Declaration)
then
Result_Node :=
Original_Node (Parent (Node_Field_1 (Element)));
end if;
case Nkind (Result_Node) is
when N_Private_Extension_Declaration =>
Result_Kind := A_Private_Extension_Definition;
when N_Formal_Type_Declaration =>
Result_Node := Sinfo.Formal_Type_Definition (Result_Node);
when others =>
Result_Node := Sinfo.Type_Definition (Result_Node);
end case;
Result_Element := Node_To_Element_New (
Node => Result_Node,
Starting_Element => Element,
Internal_Kind => Result_Kind);
Set_From_Implicit (Result_Element, False);
Set_From_Inherited (Result_Element, False);
Set_Node_Field_1 (Result_Element, Empty);
when Internal_Root_Type_Kinds =>
Result_Element := Element;
Set_Int_Kind (Result_Element, An_Ordinary_Type_Declaration);
when An_Ordinary_Type_Declaration =>
-- The only possible case is the declaration of a root or
-- universal numeric type
Result_Node := Standard_Package_Node;
Res_Spec_Case := Explicit_From_Standard;
Result_Kind := A_Package_Declaration;
Result_Element :=
Node_To_Element_New (Node => Result_Node,
Spec_Case => Res_Spec_Case,
In_Unit => Encl_Unit (Element));
when An_Enumeration_Literal_Specification |
An_Entry_Declaration =>
Result_Node :=
Sinfo.Type_Definition
(Original_Node (Node_Field_1 (Element)));
Result_Kind := A_Derived_Type_Definition;
Result_Element := Node_To_Element_New (
Node => Result_Node,
Starting_Element => Element,
Internal_Kind => Result_Kind);
Set_From_Implicit (Result_Element, False);
Set_From_Inherited (Result_Element, False);
Set_Node_Field_1 (Result_Element, Empty);
when A_Generic_Association =>
Result_Element :=
Node_To_Element_New (Node => R_Node (Element),
In_Unit => Encl_Unit (Element));
when others =>
if Normalization_Case (Element) =
Is_Normalized_Defaulted_For_Box
then
Result_Node := Parent (Parent (Parent (Node (Element))));
while not (Nkind (Result_Node) in N_Generic_Instantiation
or else
Nkind (Original_Node (Result_Node)) =
N_Formal_Package_Declaration)
loop
if Nkind (Parent (Result_Node)) = N_Compilation_Unit then
-- Library level instantiation
if Is_Rewrite_Substitution (Result_Node) then
-- Package instantiation, the package does not have
-- a body
exit;
else
Result_Node := Corresponding_Body (Result_Node);
while Nkind (Result_Node) /= N_Package_Body loop
Result_Node := Parent (Result_Node);
end loop;
end if;
exit;
else
Result_Node := Next (Result_Node);
end if;
end loop;
Result_Element := Node_To_Element_New
(Node => Result_Node,
In_Unit => Encl_Unit (Element));
else
Result_Element := Enclosing_Element_For_Explicit (Element);
end if;
end case;
end if;
if Int_Kind (Result_Element) = A_Function_Renaming_Declaration then
-- See C125-002
Set_Int_Kind (Result_Element, A_Function_Declaration);
elsif Int_Kind (Result_Element) = A_Procedure_Renaming_Declaration then
Set_Int_Kind (Result_Element, A_Procedure_Declaration);
end if;
return Result_Element;
end Enclosing_Element_For_Implicit;
----------------------------------------
-- Enclosing_Element_For_Limited_View --
----------------------------------------
function Enclosing_Element_For_Limited_View
(Element : Asis.Element)
return Asis.Element
is
Result : Asis.Element := Enclosing_Element_For_Explicit (Element);
begin
if not Is_Nil (Result) then
Set_Special_Case (Result, From_Limited_View);
Set_From_Implicit (Result, True);
Set_Int_Kind (Result, Limited_View_Kind (Result));
end if;
return Result;
end Enclosing_Element_For_Limited_View;
-----------------------
-- General_Encl_Elem --
-----------------------
function General_Encl_Elem (Element : Asis.Element) return Asis.Element is
Result_Node : Node_Id;
Result_Nkind : Node_Kind;
begin
Result_Node := Parent (R_Node (Element));
Result_Nkind := Nkind (Result_Node);
-- and now - special processing for some node kinds to skip nodes which
-- are of no use in ASIS
if Result_Nkind = N_Package_Specification or else
Result_Nkind = N_Function_Specification or else
Result_Nkind = N_Procedure_Specification or else
Result_Nkind = N_Entry_Body_Formal_Part
then
Result_Node := Parent (Result_Node);
end if;
return Node_To_Element_New
(Starting_Element => Element,
Node => Result_Node,
Considering_Parent_Count => False);
end General_Encl_Elem;
-------------------
-- Get_Enclosing --
-------------------
function Get_Enclosing
(Approximation : Asis.Element;
Element : Asis.Element)
return Asis.Element
is
-- we need two-level traversing for searching for Enclosing Element:
-- first, we go through the direct children of an approximate
-- result, and none of them Is_Identical to Element, we repeat
-- the search process for each direct child. We may implement
-- this on top of Traverse_Element, but we prefer to code
-- it manually on top of A4G.Queries
Result_Element : Asis.Element;
Result_Found : Boolean := False;
-- needed to simulate the effect of Terminate_Immediatelly
procedure Check_Possible_Enclosing (Appr_Enclosing : Asis.Element);
-- implements the first level of the search. Appr_Enclosing is
-- the "approximate" Enclosing Element, and this procedure
-- checks if some of its components Is_Identical to Element
-- (Element here is the parameter of Get_Enclosing function,
-- as a global constant value inside Get_Enclosing, it is the
-- same for all the (recursive) calls of Check_Possible_Enclosing
------------------------------
-- Check_Possible_Enclosing --
-------------------------------
procedure Check_Possible_Enclosing (Appr_Enclosing : Asis.Element) is
Child_Access : constant Query_Array :=
Appropriate_Queries (Appr_Enclosing);
-- this is the way to traverse the direct children
Next_Child : Asis.Element;
procedure Check_List (L : Asis.Element_List);
-- checks if L contains a component which Is_Identical
-- to (global) Element. Sets Result_Found ON if such a
-- component is found
procedure Check_List_Down (L : Asis.Element_List);
-- calls Get_Enclosing for every component of L, by
-- this the recursion and the second level of the search
-- is implemented
procedure Check_List (L : Asis.Element_List) is
begin
for L_El_Index in L'Range loop
if Is_Identical (Element, L (L_El_Index)) then
Result_Found := True;
return;
end if;
end loop;
end Check_List;
procedure Check_List_Down (L : Asis.Element_List) is
begin
if Result_Found then
return;
-- it seems that we do not need this if... ???
end if;
for L_El_Index in L'Range loop
Check_Possible_Enclosing (L (L_El_Index));
if Result_Found then
return;
end if;
end loop;
end Check_List_Down;
begin -- Check_Possible_Enclosing
if Result_Found then
return;
-- now the only goal is to not disturb the setting of the
-- global variable Result_Element to be returned as a result
end if;
-- first, setting the (global for this procedure) Result_Element:
Result_Element := Appr_Enclosing;
-- the first level of the search - checking all the direct
-- children:
for Each_Query in Child_Access'Range loop
case Child_Access (Each_Query).Query_Kind is
when Bug =>
null;
when Single_Element_Query =>
Next_Child :=
Child_Access (Each_Query).Func_Simple (Appr_Enclosing);
if Is_Identical (Element, Next_Child) then
Result_Found := True;
return;
end if;
when Element_List_Query =>
declare
Child_List : constant Asis.Element_List :=
Child_Access (Each_Query).Func_List (Appr_Enclosing);
begin
Check_List (Child_List);
if Result_Found then
return;
end if;
end;
when Element_List_Query_With_Boolean =>
declare
Child_List : constant Asis.Element_List :=
Child_Access (Each_Query).Func_List_Boolean
(Appr_Enclosing, Child_Access (Each_Query).Bool);
begin
Check_List (Child_List);
if Result_Found then
return;
end if;
end;
end case;
end loop;
-- if we are here, we have hot found Element among the direct
-- children of Appr_Enclosing. So we have to traverse the direct
-- children again, but this time we have to go one step down,
-- so here we have the second level of the search:
for Each_Query in Child_Access'Range loop
case Child_Access (Each_Query).Query_Kind is
when Bug =>
null;
when Single_Element_Query =>
Next_Child :=
Child_Access (Each_Query).Func_Simple (Appr_Enclosing);
-- and here - recursively one step down
if not Is_Nil (Next_Child) then
Check_Possible_Enclosing (Next_Child);
if Result_Found then
return;
end if;
end if;
when Element_List_Query =>
declare
Child_List : constant Asis.Element_List :=
Child_Access (Each_Query).Func_List (Appr_Enclosing);
begin
-- and here - recursively one step down
Check_List_Down (Child_List);
if Result_Found then
return;
end if;
end;
when Element_List_Query_With_Boolean =>
declare
Child_List : constant Asis.Element_List :=
Child_Access (Each_Query).Func_List_Boolean
(Appr_Enclosing, Child_Access (Each_Query).Bool);
begin
-- and here - recursively one step down
Check_List_Down (Child_List);
if Result_Found then
return;
end if;
end;
end case;
end loop;
end Check_Possible_Enclosing;
begin -- Get_Enclosing
Check_Possible_Enclosing (Approximation);
pragma Assert (Result_Found);
return Result_Element;
end Get_Enclosing;
------------------------------
-- Get_Rough_Enclosing_Node --
------------------------------
function Get_Rough_Enclosing_Node (Element : Asis.Element) return Node_Id
is
Arg_Node : constant Node_Id := R_Node (Element);
Result_Node : Node_Id;
Res_Nkind : Node_Kind;
function Is_Acceptable_As_Rough_Enclosing_Node
(N : Node_Id)
return Boolean;
-- this function encapsulates the condition for choosing
-- the rough enclosing node
function Is_Acceptable_Impl_Neq_Decl (N : Node_Id) return Boolean;
-- Implements a special check for Is_Acceptable_As_Rough_Enclosing_Node:
-- in case if Element is a subcomponenet of an implicit declaration of
-- "/=", checks that N represents the whole declaration of this "/="
-------------------------------------------
-- Is_Acceptable_As_Rough_Enclosing_Node --
-------------------------------------------
function Is_Acceptable_As_Rough_Enclosing_Node
(N : Node_Id)
return Boolean
is
N_K : constant Node_Kind := Nkind (N);
Result : Boolean := True;
begin
if not (Is_Acceptable_Impl_Neq_Decl (N)
or else
Is_List_Member (N)
or else
(Nkind (Parent (N)) = N_Compilation_Unit or else
Nkind (Parent (N)) = N_Subunit))
or else
(Nkind (N) in N_Subexpr
and then Nkind (N) /=
N_Procedure_Call_Statement)
or else
Nkind (N) = N_Parameter_Association
then
Result := False;
elsif N_K = N_Range or else
-- N_K = N_Component_Association or else
N_K = N_Subtype_Indication
then
Result := False;
elsif N_K = N_Component_Association then
if Special_Case (Element) = Is_From_Gen_Association
or else
Is_From_Rewritten_Aggregate (N)
then
Result := False;
end if;
elsif N_K = N_Procedure_Call_Statement and then
Nkind (Parent (N)) = N_Pragma
then
Result := False;
elsif not Comes_From_Source (N)
and then
Sloc (N) > Standard_Location
and then
not Is_Acceptable_Impl_Neq_Decl (N)
then
if not (Is_From_Instance (Element)
and then
Is_Top_Of_Expanded_Generic (N))
then
Result := False;
end if;
end if;
return Result;
end Is_Acceptable_As_Rough_Enclosing_Node;
---------------------------------
-- Is_Acceptable_Impl_Neq_Decl --
---------------------------------
function Is_Acceptable_Impl_Neq_Decl (N : Node_Id) return Boolean is
Result : Boolean := False;
begin
if Special_Case (Element) = Is_From_Imp_Neq_Declaration
and then
Nkind (N) = N_Subprogram_Declaration
and then
not Comes_From_Source (N)
and then
Present (Corresponding_Equality
(Defining_Unit_Name (Specification (N))))
then
Result := True;
end if;
return Result;
end Is_Acceptable_Impl_Neq_Decl;
begin -- Get_Rough_Enclosing_Node
Result_Node := Parent (Arg_Node);
if Nkind (Result_Node) = N_Object_Renaming_Declaration
and then
Special_Case (Element) = Is_From_Gen_Association
and then
Present (Corresponding_Generic_Association (Result_Node))
then
Result_Node := Corresponding_Generic_Association (Result_Node);
elsif (Nkind (Result_Node) = N_Attribute_Definition_Clause
or else
Nkind (Result_Node) = N_Pragma)
and then
From_Aspect_Specification (Result_Node)
then
-- Result_Node := Corresponding_Aspect (Result_Node);
null; -- SCz
end if;
while Present (Result_Node) and then
not Is_Acceptable_As_Rough_Enclosing_Node (Result_Node)
loop
Result_Node := Parent (Result_Node);
if Nkind (Result_Node) = N_Object_Renaming_Declaration
and then
Special_Case (Element) = Is_From_Gen_Association
and then
Present (Corresponding_Generic_Association (Result_Node))
then
Result_Node := Corresponding_Generic_Association (Result_Node);
elsif (Nkind (Result_Node) = N_Attribute_Definition_Clause
or else
Nkind (Result_Node) = N_Pragma)
and then
From_Aspect_Specification (Result_Node)
then
-- Result_Node := Corresponding_Aspect (Result_Node);
null; -- SCz
end if;
if Nkind (Result_Node) = N_Compilation_Unit then
-- this means that there is no node list on the way up
-- the tree, and we have to go back to the node
-- for the unit declaration:
if Is_Standard (Encl_Unit (Element)) then
Result_Node := Standard_Package_Node;
else
Result_Node := Unit (Result_Node);
end if;
if Nkind (Result_Node) = N_Subunit then
Result_Node := Proper_Body (Result_Node);
end if;
exit;
end if;
end loop;
-- and here we have to take into account possible normalization
-- of multi-identifier declarations:
Res_Nkind := Nkind (Result_Node);
if Res_Nkind = N_Object_Declaration or else
Res_Nkind = N_Number_Declaration or else
Res_Nkind = N_Discriminant_Specification or else
Res_Nkind = N_Component_Declaration or else
Res_Nkind = N_Parameter_Specification or else
Res_Nkind = N_Exception_Declaration or else
Res_Nkind = N_Formal_Object_Declaration or else
Res_Nkind = N_With_Clause
then
Skip_Normalized_Declarations_Back (Result_Node);
end if;
-- If we've got Result_Node pointing to the artificial package
-- declaration created for library-level generic instantiation,
-- we have to the body for which we have this instantiation as
-- the original node
if Nkind (Result_Node) = N_Package_Declaration and then
not Comes_From_Source (Result_Node) and then
Nkind (Parent (Result_Node)) = N_Compilation_Unit and then
not Is_From_Instance (Element) and then
not Is_Rewrite_Substitution (Result_Node)
then
Result_Node := Corresponding_Body (Result_Node);
while Nkind (Result_Node) /= N_Package_Body loop
Result_Node := Parent (Result_Node);
end loop;
end if;
-- Below is the patch for 8706-003. It is needed when we are looking
-- for the enclosing element for actual parameter in subprogram
-- instantiation. In this case Result_Node points to the spec of a
-- wrapper package, so we have to go to the instantiation.
if Special_Case (Element) = Is_From_Gen_Association
and then
Nkind (Result_Node) = N_Package_Declaration
and then
not (Nkind (Original_Node (Result_Node)) = N_Package_Instantiation
or else
Nkind (Original_Node (Result_Node)) = N_Package_Body
or else
(Present (Generic_Parent (Specification (Result_Node)))
and then
Ekind (Generic_Parent (Specification (Result_Node))) =
E_Generic_Package))
and then
not Comes_From_Source (Result_Node)
and then
(Nkind (Parent (Arg_Node)) = N_Subprogram_Renaming_Declaration
and then
not Comes_From_Source (Parent (Arg_Node)))
and then
Instantiation_Depth (Sloc (Result_Node)) =
Instantiation_Depth (Sloc (Arg_Node))
then
if Is_Rewrite_Substitution (Result_Node)
and then
Nkind (Original_Node (Result_Node)) in N_Generic_Instantiation
then
Result_Node := Original_Node (Result_Node);
else
while not Comes_From_Source (Result_Node) loop
Result_Node := Next_Non_Pragma (Result_Node);
end loop;
end if;
end if;
return Result_Node;
end Get_Rough_Enclosing_Node;
--------------------------------
-- Is_Top_Of_Expanded_Generic --
--------------------------------
function Is_Top_Of_Expanded_Generic (N : Node_Id) return Boolean is
N_Kind : constant Node_Kind := Nkind (N);
Result : Boolean := False;
begin
Result :=
((not Comes_From_Source (N) or else
Is_Rewrite_Insertion (N))
and then
(N_Kind = N_Package_Declaration or else
N_Kind = N_Package_Body or else
N_Kind = N_Subprogram_Declaration or else
N_Kind = N_Subprogram_Body)
and then
Nkind (Original_Node (N)) not in N_Renaming_Declaration)
or else
(Nkind (Parent (N)) = N_Package_Body and then
not Comes_From_Source (Parent (N)))
or else
(Is_Rewrite_Substitution (N) and then
Nkind (Original_Node (N)) = N_Package_Instantiation);
-- Library-level package instantiation
return Result;
end Is_Top_Of_Expanded_Generic;
--------------------------
-- No_Enclosing_Element --
--------------------------
procedure No_Enclosing_Element (Element_Kind : Internal_Element_Kinds) is
begin
Raise_ASIS_Failed
("No Enclosing Element can correspond " &
"to the Element with Internal_Element_Kinds value of " &
Internal_Element_Kinds'Image (Element_Kind));
end No_Enclosing_Element;
----------------------------------------------------
-- Not_Implemented_Enclosing_Element_Construction --
----------------------------------------------------
procedure Not_Implemented_Enclosing_Element_Construction
(Element : Asis.Element)
is
begin
Not_Implemented_Yet (Diagnosis =>
"Enclosing Element retrieval for the explicit Element "
& "of the " & Internal_Element_Kinds'Image
(Int_Kind (Element)) & " kind "
& "has not been implemented yet");
end Not_Implemented_Enclosing_Element_Construction;
------------
-- Parent --
------------
function Parent (Node : Node_Id) return Node_Id is
Result_Node : Node_Id;
begin
Result_Node := Atree.Parent (Node);
Skip_Normalized_Declarations_Back (Result_Node);
return Result_Node;
end Parent;
---------------------------
-- Skip_Implicit_Subtype --
---------------------------
procedure Skip_Implicit_Subtype (Constr : in out Node_Id) is
begin
if not Comes_From_Source (Parent (Constr)) then
Constr := Parent (Constr);
while Nkind (Constr) /= N_Object_Declaration loop
Constr := Next_Non_Pragma (Constr);
end loop;
Constr := Object_Definition (Constr);
end if;
end Skip_Implicit_Subtype;
---------------------------------------
-- Skip_Normalized_Declarations_Back --
---------------------------------------
procedure Skip_Normalized_Declarations_Back (Node : in out Node_Id) is
Arg_Kind : constant Node_Kind := Nkind (Node);
begin
loop
if Arg_Kind = N_Object_Declaration or else
Arg_Kind = N_Number_Declaration or else
Arg_Kind = N_Discriminant_Specification or else
Arg_Kind = N_Component_Declaration or else
Arg_Kind = N_Parameter_Specification or else
Arg_Kind = N_Exception_Declaration or else
Arg_Kind = N_Formal_Object_Declaration
then
if Prev_Ids (Node) then
Node := Prev (Node);
while Nkind (Node) /= Arg_Kind loop
-- some implicit subtype declarations may be inserted by
-- the compiler in between the normalized declarations, so:
Node := Prev (Node);
end loop;
else
return;
end if;
elsif Arg_Kind = N_With_Clause then
if First_Name (Node) then
return;
else
Node := Prev (Node);
end if;
else
return;
-- nothing to do!
end if;
end loop;
end Skip_Normalized_Declarations_Back;
end A4G.Encl_El;
| 37.220671 | 79 | 0.576198 |
4df1841d667c2b05a1a34cc534b92946a1130161 | 6,246 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-pack15.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/ada/s-pack15.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-pack15.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 5 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2014, 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_15 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_15;
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_15 --
------------
function Get_15
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_15
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_15;
------------
-- Set_15 --
------------
procedure Set_15
(Arr : System.Address;
N : Natural;
E : Bits_15;
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_15;
end System.Pack_15;
| 39.531646 | 78 | 0.460775 |
0bdf9b2dfeb93549f663017eb3fba36043ae3fd0 | 3,417 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-caun16.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-caun16.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-caun16.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY COMPONENTS --
-- --
-- S Y S T E M . C O M P A R E _ A R R A Y _ U N S I G N E D _ 1 6 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2002-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. --
-- --
------------------------------------------------------------------------------
-- This package contains functions for runtime comparisons on arrays whose
-- elements are 16-bit discrete type values to be treated as unsigned.
package System.Compare_Array_Unsigned_16 is
-- Note: although the functions in this package are in a sense Pure, the
-- package cannot be declared as Pure, since the arguments are addresses,
-- not the data, and the result is not pure wrt the address values.
function Compare_Array_U16
(Left : System.Address;
Right : System.Address;
Left_Len : Natural;
Right_Len : Natural) return Integer;
-- Compare the array starting at address Left of length Left_Len
-- with the array starting at address Right of length Right_Len.
-- The comparison is in the normal Ada semantic sense of array
-- comparison. The result is -1,0,+1 for Left<Right, Left=Right,
-- Left>Right respectively. This function works with 4 byte words
-- if the operands are aligned on 4-byte boundaries and long enough.
end System.Compare_Array_Unsigned_16;
| 63.277778 | 78 | 0.434006 |
1065d1e028ed95254ccb87de09cf8a0c477a5522 | 3,687 | ads | Ada | source/web/tools/a2js/properties-expressions-parameter_association.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/a2js/properties-expressions-parameter_association.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/a2js/properties-expressions-parameter_association.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, 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 Asis;
with Engines.Contexts;
with League.Strings;
package Properties.Expressions.Parameter_Association is
function Bounds
(Engine : access Engines.Contexts.Context;
Element : Asis.Association;
Name : Engines.Text_Property) return League.Strings.Universal_String;
end Properties.Expressions.Parameter_Association;
| 63.568966 | 78 | 0.419582 |
4d4fd9ffc6eb2cd6021c014feab0320724f53742 | 2,851 | ads | Ada | Sources/Globe_3d/gaming/game_control.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/gaming/game_control.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/gaming/game_control.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | ------------------------------------------------------------------------------
-- File : Game_control.ads
-- Description : Command set for games, based on GLUT
-- Copyright (c) Gautier de Montmollin 2002, 2005 .. 2008
------------------------------------------------------------------------------
-- Cannibalized from Game_Driving (see Engine_3D)
-- To do : programmable behaviour
with GL, GLUT.Devices;
package Game_Control is
type Command is (
go_forward,
go_backwards,
go_graduated,
slide_left,
slide_right,
slide_lateral_graduated,
turn_left,
turn_right,
turn_lateral_graduated,
slide_up,
slide_down,
slide_vertical_graduated,
turn_up,
turn_down,
turn_vertical_graduated,
run_mode,
ctrl_mode, -- "shoot", but useless with GLUT
slide_mode,
swing_plus,
swing_minus,
jump,
special_plus,
special_minus,
photo, video,
toggle_10,
interrupt_game,
n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, -- numeric keys
bogus_command -- a control can be directed on this
);
pragma Ordered (Command);
type Command_set is array (Command) of Boolean;
-- The empty command set:
no_command : constant Command_set := (others => False);
-- Function Set_ .. .
-- keyboard_command_mapping : array (Multi_keys.key_value) of Command :=
-- (others => bogus_command); -- for later !!
-- mouse_command_mapping : array (PC_Mouse.Mouse_button) of Command :=
-- (others => bogus_command); -- for later !!
-- Record game commands from peripherals (keyboard, mouse) --
procedure Append_Commands (size_x,
size_y : Integer; -- screen dimensions for mouse
warp_mouse : Boolean; -- recenter mouse cursor
c : in out Game_Control.Command_set; -- commands are added to c
gx, gy : out GL.Double; -- mouse movement since last call
Keyboard : access GLUT.Devices.Keyboard := GLUT.Devices.default_Keyboard'Access;
Mouse : access GLUT.Devices.Mouse := GLUT.Devices.default_Mouse'Access);
end Game_Control;
| 40.728571 | 113 | 0.452473 |
a17b418b2e90cdfba4d15e8c3b3b1f62c0030ab7 | 2,131 | adb | Ada | examples/simple_example.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | examples/simple_example.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | examples/simple_example.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | -- Simple_Example
-- A simple example of using the Ada 2012 interface to Lua
-- Copyright (c) 2015, James Humphry - see LICENSE for terms
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Long_Float_Text_IO; use Ada.Long_Float_Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Lua; use Lua;
with Lua.Util; use Lua.Util;
procedure Simple_Example is
L : Lua_State;
begin
Put_Line("A simple example of using Lua from within Ada");
Put("Lua version: ");
Put(Item => L.Version, Aft => 0, Exp => 0);
New_Line;
Put_Line("Lua state status: " & Thread_Status'Image(L.Status));
New_Line;
Put_Line("Basic stack manipulation.");
Put("Initial stack size: "); Put(L.GetTop); New_Line;
Put_Line("Pushing 3.0, 7.5, 2.3, 'Hello, World!', True, 5");
L.PushNumber(3.0);
L.PushNumber(7.5);
L.PushNumber(2.3);
L.PushString("Hello, World!");
L.PushBoolean(True);
L.PushInteger(5);
Put("Stack size now: "); Put(L.GetTop); New_Line;
Print_Stack(L);
Put("Get top element as string: "); Put(L.ToString(-1)); New_Line;
Print_Stack(L);
Put_Line("Pop top three elements");
L.Pop(3);
Print_Stack(L);
Put_Line("Is Stack(-2) <= Stack(-1)? " &
(if L.Compare(index1 => -2, index2 => -1, op => OPLE)
then "Yes"
else "No"));
Put_Line("Duplicating element at index 2. ");
L.PushValue(2);
Print_Stack(L);
Put_Line("Adding top two elements.");
L.Arith(OPADD);
Print_Stack(L);
Put_Line("Is Stack(-2) <= Stack(-1)? " &
(if L.Compare(index1 => -2, index2 => -1, op => OPLE)
then "Yes"
else "No"));
New_Line;
Put_Line("Setting global foobar to 5");
L.PushNumber(5.0);
L.SetGlobal("foobar");
L.GetGlobal("foobar");
Put("Global foobar = "); Put(L.ToNumber(-1), Aft => 0, Exp => 0); New_Line;
New_Line;
Put_Line("Manually triggering garbage collection...");
L.GC(what => GCCOLLECT);
New_Line;
Put("Checking type of main thread: ");
L.Geti(index => RegistryIndex, i => RIDX_MainThread);
Put(L.TypeName(-1));
New_Line;
end Simple_Example;
| 28.413333 | 78 | 0.620366 |
4da9c5a21a9ccb76300c1af42aa515993f3b827d | 4,164 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-exctab.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-exctab.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-exctab.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N _ T A B L E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1996-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements the interface used to maintain a table of
-- registered exception names, for the implementation of the mapping
-- of names to exceptions (used for exception streams and attributes)
pragma Compiler_Unit;
with System.Standard_Library;
package System.Exception_Table is
pragma Elaborate_Body;
package SSL renames System.Standard_Library;
procedure Register_Exception (X : SSL.Exception_Data_Ptr);
pragma Inline (Register_Exception);
-- Register an exception in the hash table mapping. This function is
-- called during elaboration of library packages. For exceptions that
-- are declared within subprograms, the registration occurs the first
-- time that an exception is elaborated during a call of the subprogram.
--
-- Note: all calls to Register_Exception other than those to register the
-- predefined exceptions are suppressed if the application is compiled
-- with pragma Restrictions (No_Exception_Registration).
function Internal_Exception
(X : String;
Create_If_Not_Exist : Boolean := True) return SSL.Exception_Data_Ptr;
-- Given an exception_name X, returns a pointer to the actual internal
-- exception data. A new entry is created in the table if X does not
-- exist yet and Create_If_Not_Exist is True. If it is false and X
-- does not exist yet, null is returned.
function Registered_Exceptions_Count return Natural;
-- Return the number of currently registered exceptions
type Exception_Data_Array is array (Natural range <>)
of SSL.Exception_Data_Ptr;
procedure Get_Registered_Exceptions
(List : out Exception_Data_Array;
Last : out Integer);
-- Return the list of registered exceptions
end System.Exception_Table;
| 54.789474 | 78 | 0.491595 |
0ba4e94774436da485be3e851bc2e695fdd7ab9d | 1,329 | ads | Ada | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_penetration_depth_solver-minkowski.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_penetration_depth_solver-minkowski.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_penetration_depth_solver-minkowski.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.collision.convex_penetration_depth_Solver;
with impact.d3.collision.simplex_Solver;
with impact.d3.Shape.convex;
package impact.d3.collision.convex_penetration_depth_Solver.minkowski
--
-- MinkowskiPenetrationDepthSolver implements bruteforce penetration depth estimation.
--
-- Implementation is based on sampling the depth using support mapping, and using GJK step to get the witness points.
--
is
type Item is new impact.d3.collision.convex_penetration_depth_Solver.Item with private;
overriding function calcPenDepth (Self : access Item; simplexSolver : access impact.d3.collision.simplex_Solver.Item'Class;
convexA, convexB : in impact.d3.Shape.convex.view;
transA, transB : in Transform_3d;
v : access math.Vector_3;
pa, pb : access math.Vector_3) return Boolean;
private
type Item is new impact.d3.collision.convex_penetration_depth_Solver.Item with
record
null;
end record;
function getPenetrationDirections (i : in Integer) return access math.Vector_3;
end impact.d3.collision.convex_penetration_depth_Solver.minkowski;
| 31.642857 | 131 | 0.651618 |
2327e5186cf2402905b1169e5a7572ef3ea29b43 | 13,615 | adb | Ada | tools-src/gnu/gcc/gcc/ada/a-wtgeau.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/a-wtgeau.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/a-wtgeau.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . W I D E _ T E X T _ I O . G E N E R I C _ A U X --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2000 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Interfaces.C_Streams; use Interfaces.C_Streams;
with System.File_IO;
with System.File_Control_Block;
package body Ada.Wide_Text_IO.Generic_Aux is
package FIO renames System.File_IO;
package FCB renames System.File_Control_Block;
subtype AP is FCB.AFCB_Ptr;
------------------------
-- Check_End_Of_Field --
------------------------
procedure Check_End_Of_Field
(File : File_Type;
Buf : String;
Stop : Integer;
Ptr : Integer;
Width : Field)
is
begin
if Ptr > Stop then
return;
elsif Width = 0 then
raise Data_Error;
else
for J in Ptr .. Stop loop
if not Is_Blank (Buf (J)) then
raise Data_Error;
end if;
end loop;
end if;
end Check_End_Of_Field;
-----------------------
-- Check_On_One_Line --
-----------------------
procedure Check_On_One_Line
(File : File_Type;
Length : Integer)
is
begin
FIO.Check_Write_Status (AP (File));
if File.Line_Length /= 0 then
if Count (Length) > File.Line_Length then
raise Layout_Error;
elsif File.Col + Count (Length) > File.Line_Length + 1 then
New_Line (File);
end if;
end if;
end Check_On_One_Line;
--------------
-- Is_Blank --
--------------
function Is_Blank (C : Character) return Boolean is
begin
return C = ' ' or else C = ASCII.HT;
end Is_Blank;
----------
-- Load --
----------
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character;
Loaded : out Boolean)
is
ch : int;
begin
if File.Before_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character)
is
ch : int;
begin
if File.Before_Wide_Character then
null;
else
ch := Getc (File);
if ch = Character'Pos (Char) then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character;
Loaded : out Boolean)
is
ch : int;
begin
if File.Before_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch = Character'Pos (Char1)
or else ch = Character'Pos (Char2)
then
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
else
Ungetc (ch, File);
Loaded := False;
end if;
end if;
end Load;
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character)
is
ch : int;
begin
if File.Before_Wide_Character then
null;
else
ch := Getc (File);
if ch = Character'Pos (Char1)
or else ch = Character'Pos (Char2)
then
Store_Char (File, ch, Buf, Ptr);
else
Ungetc (ch, File);
end if;
end if;
end Load;
-----------------
-- Load_Digits --
-----------------
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean;
begin
if File.Before_Wide_Character then
Loaded := False;
return;
else
ch := Getc (File);
if ch not in Character'Pos ('0') .. Character'Pos ('9') then
Loaded := False;
else
Loaded := True;
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end if;
end Load_Digits;
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
After_Digit : Boolean;
begin
if File.Before_Wide_Character then
return;
else
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
loop
Store_Char (File, ch, Buf, Ptr);
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9') then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
end loop;
end if;
Ungetc (ch, File);
end if;
end Load_Digits;
--------------------------
-- Load_Extended_Digits --
--------------------------
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean)
is
ch : int;
After_Digit : Boolean := False;
begin
if File.Before_Wide_Character then
Loaded := False;
return;
else
Loaded := False;
loop
ch := Getc (File);
if ch in Character'Pos ('0') .. Character'Pos ('9')
or else
ch in Character'Pos ('a') .. Character'Pos ('f')
or else
ch in Character'Pos ('A') .. Character'Pos ('F')
then
After_Digit := True;
elsif ch = Character'Pos ('_') and then After_Digit then
After_Digit := False;
else
exit;
end if;
Store_Char (File, ch, Buf, Ptr);
Loaded := True;
end loop;
Ungetc (ch, File);
end if;
end Load_Extended_Digits;
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer)
is
Junk : Boolean;
begin
Load_Extended_Digits (File, Buf, Ptr, Junk);
end Load_Extended_Digits;
---------------
-- Load_Skip --
---------------
procedure Load_Skip (File : File_Type) is
C : Character;
begin
FIO.Check_Read_Status (AP (File));
-- We need to explicitly test for the case of being before a wide
-- character (greater than 16#7F#). Since no such character can
-- ever legitimately be a valid numeric character, we can
-- immediately signal Data_Error.
if File.Before_Wide_Character then
raise Data_Error;
end if;
-- Otherwise loop till we find a non-blank character (note that as
-- usual in Wide_Text_IO, blank includes horizontal tab). Note that
-- Get_Character deals with Before_LM/Before_LM_PM flags appropriately.
loop
Get_Character (File, C);
exit when not Is_Blank (C);
end loop;
Ungetc (Character'Pos (C), File);
File.Col := File.Col - 1;
end Load_Skip;
----------------
-- Load_Width --
----------------
procedure Load_Width
(File : File_Type;
Width : Field;
Buf : out String;
Ptr : in out Integer)
is
ch : int;
WC : Wide_Character;
Bad_Wide_C : Boolean := False;
-- Set True if one of the characters read is not in range of type
-- Character. This is always a Data_Error, but we do not signal it
-- right away, since we have to read the full number of characters.
begin
FIO.Check_Read_Status (AP (File));
-- If we are immediately before a line mark, then we have no characters.
-- This is always a data error, so we may as well raise it right away.
if File.Before_LM then
raise Data_Error;
else
for J in 1 .. Width loop
if File.Before_Wide_Character then
Bad_Wide_C := True;
Store_Char (File, 0, Buf, Ptr);
File.Before_Wide_Character := False;
else
ch := Getc (File);
if ch = EOF then
exit;
elsif ch = LM then
Ungetc (ch, File);
exit;
else
WC := Get_Wide_Char (Character'Val (ch), File);
ch := Wide_Character'Pos (WC);
if ch > 255 then
Bad_Wide_C := True;
ch := 0;
end if;
Store_Char (File, ch, Buf, Ptr);
end if;
end if;
end loop;
if Bad_Wide_C then
raise Data_Error;
end if;
end if;
end Load_Width;
--------------
-- Put_Item --
--------------
procedure Put_Item (File : File_Type; Str : String) is
begin
Check_On_One_Line (File, Str'Length);
for J in Str'Range loop
Put (File, Wide_Character'Val (Character'Pos (Str (J))));
end loop;
end Put_Item;
----------------
-- Store_Char --
----------------
procedure Store_Char
(File : File_Type;
ch : Integer;
Buf : out String;
Ptr : in out Integer)
is
begin
File.Col := File.Col + 1;
if Ptr = Buf'Last then
raise Data_Error;
else
Ptr := Ptr + 1;
Buf (Ptr) := Character'Val (ch);
end if;
end Store_Char;
-----------------
-- String_Skip --
-----------------
procedure String_Skip (Str : String; Ptr : out Integer) is
begin
Ptr := Str'First;
loop
if Ptr > Str'Last then
raise End_Error;
elsif not Is_Blank (Str (Ptr)) then
return;
else
Ptr := Ptr + 1;
end if;
end loop;
end String_Skip;
------------
-- Ungetc --
------------
procedure Ungetc (ch : int; File : File_Type) is
begin
if ch /= EOF then
if ungetc (ch, File.Stream) = EOF then
raise Device_Error;
end if;
end if;
end Ungetc;
end Ada.Wide_Text_IO.Generic_Aux;
| 26.132438 | 79 | 0.469482 |
12c51a89d2db5bdb35a555eba6ca269665f977bf | 4,390 | adb | Ada | source/league/matreshka-internals-translator.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/matreshka-internals-translator.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/matreshka-internals-translator.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-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.Internals.Translator is
---------------
-- Translate --
---------------
function Translate
(Context : League.Strings.Universal_String;
Source_Text : League.Strings.Universal_String;
Disambiguation : League.Strings.Universal_String)
return League.Strings.Universal_String
is
pragma Unreferenced (Disambiguation);
use Context_Maps;
use Universal_String_Maps;
Context_Position : constant Context_Maps.Cursor
:= Translations.Find (Context);
Translation_Position : Universal_String_Maps.Cursor;
begin
if not Has_Element (Context_Position) then
-- There is no context.
return Source_Text;
end if;
Translation_Position :=
Element (Context_Position).Translations.Find (Source_Text);
if Has_Element (Translation_Position) then
return Element (Translation_Position);
else
return Source_Text;
end if;
end Translate;
end Matreshka.Internals.Translator;
| 51.647059 | 78 | 0.461048 |
4da4a0936487e958a58052febf4e921c653a796e | 326 | adb | Ada | dependencies/agar/ada-core/agar-core-config.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 5 | 2016-04-18T23:12:51.000Z | 2022-03-06T05:12:07.000Z | dependencies/agar/ada-core/agar-core-config.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 2 | 2015-10-09T19:13:25.000Z | 2018-12-25T17:16:54.000Z | dependencies/agar/ada-core/agar-core-config.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 15 | 2015-02-23T16:35:28.000Z | 2022-03-25T13:40:33.000Z | with Agar.Core.Thin;
with Interfaces.C;
package body Agar.Core.Config is
package C renames Interfaces.C;
use type C.int;
function Load return Boolean is
begin
return Thin.Config.Load = 0;
end Load;
function Save return Boolean is
begin
return Thin.Config.Save = 0;
end Save;
end Agar.Core.Config;
| 16.3 | 33 | 0.711656 |
a14b19c568e7c69224c9f6ae5e7a28fc95582a2b | 3,002 | adb | Ada | attic/asis/find_all/adam-assist-query-find_all-unit_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | attic/asis/find_all/adam-assist-query-find_all-unit_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | attic/asis/find_all/adam-assist-query-find_all-unit_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with asis.Elements,
asis.Compilation_Units,
AdaM.compilation_Unit,
AdaM.library_Item,
AdaM.library_Unit.declaration,
AdaM.Assist.Query.find_All.element_Processing,
AdaM.Assist.Query.find_All.Metrics,
Ada.Characters.Handling;
with Ada.Text_IO; use Ada.Text_IO;
package body AdaM.Assist.Query.find_All.unit_Processing
is
procedure Process_Unit (The_Unit : Asis.Compilation_Unit)
is
use Asis, ada.Characters.Handling;
Cont_Clause_Elements : constant Asis.Element_List
:= Asis.Elements.Context_Clause_Elements (Compilation_Unit => The_Unit,
Include_Pragmas => True);
-- This is the list of the context clauses, including pragmas, if any.
-- If you do not want to process pragmas, set Include_Pragmas OFF when
-- calling Asis.Elements.Context_Clause_Elements.
Unit_Decl : constant Asis.Element := Asis.Elements.Unit_Declaration (The_Unit);
-- The top-level structural element of the library item or subunit
-- contained in The_Unit.
the_Name : constant String := to_String (asis.Compilation_Units.Unit_Full_Name (The_Unit));
Kind : constant asis.Unit_Kinds := asis.Compilation_Units.Unit_Kind (the_Unit);
begin
-- Metrics.new_Unit := adam.compilation_Unit.new_Unit ("anon");
put_Line (the_Name & " " & asis.Unit_Kinds'Image (Kind));
if Kind = asis.a_Package
then
Metrics.current_compilation_Unit := AdaM.compilation_Unit.new_compilation_Unit;
-- := adam.compilation_Unit.new_library_Unit
-- (the_Name,
-- library_Item.new_Item (adam.library_Unit.declaration.new_Package.all'Access));
--
-- Metrics.current_package_Declaration
-- := AdaM.library_Unit.declaration.view (Metrics.current_compilation_Unit.library_Item.Unit).my_Package;
end if;
Metrics.compilation_Unit.clear;
Metrics.compilation_Unit.Name_is (the_Name);
for J in Cont_Clause_Elements'Range
loop
AdaM.Assist.Query.find_All.element_Processing.Process_Construct (Cont_Clause_Elements (J));
end loop;
AdaM.Assist.Query.find_All.element_Processing.Process_Construct (Unit_Decl);
-- This procedure does not contain any exception handler because it
-- supposes that Element_Processing.Process_Construct should handle
-- all the exceptions which can be raised when processing the element
-- hierarchy.
-- declare
-- new_Unit : constant AdaM.compilation_Unit.view
-- := AdaM.compilation_Unit.new_Unit (Name => "",
-- of_Kind => compilation_Unit.library_unit_Kind);
-- begin
-- AdaM.compilation_Unit.item (new_Unit.all) := Metrics.compilation_Unit;
-- Metrics.Environment.add (new_Unit);
-- end;
end Process_Unit;
end AdaM.Assist.Query.find_All.unit_Processing;
| 37.525 | 117 | 0.673218 |
18432a7ca3013ee5433e8b8056ab1c87dcdf30de | 3,192 | ads | Ada | tools/scitools/conf/understand/ada/ada95/s-imgllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada95/s-imgllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada95/s-imgllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L U --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved --
-- --
-- The GNAT library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU Library General Public License as published by --
-- the Free Software Foundation; either version 2, or (at your option) any --
-- later version. The GNAT library is distributed in the hope that it will --
-- be useful, but WITHOUT ANY WARRANTY; without even the implied warranty --
-- of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Library General Public License for more details. You should have --
-- received a copy of the GNU Library General Public License along with --
-- the GNAT library; see the file COPYING.LIB. If not, write to the Free --
-- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- unsigned (modular) integer types larger than Size Unsigned'Size, and also
-- for conversion operations required in Text_IO.Modular_IO for such types.
with System.Unsigned_Types;
package System.Img_LLU is
pragma Preelaborate (Img_LLU);
function Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : access String)
return Natural;
-- Computes Long_Long_Unsigned'Image (V), storing the result in S (1 .. N)
-- where N is the length of the image string. The value of N is returned as
-- the result. The caller guarantees that the string is long enough.
procedure Set_Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : out String;
P : in out Natural);
-- Sets the image of V starting at S (P + 1) with no leading spaces (i.e.
-- Text_IO format where Width = 0), starting at S (P + 1), updating P
-- to point to the last character stored. The caller promises that the
-- buffer is large enough and no check is made for this (Constraint_Error
-- will not be necessarily raised if this is violated since it is perfectly
-- valid to compile this unit with checks off).
end System.Img_LLU;
| 58.036364 | 79 | 0.496241 |
4d68beb333b6bb81b65cbd5cd1aae7a7a78837e0 | 3,395 | ads | Ada | source/league/matreshka.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/matreshka.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/matreshka.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, 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 Matreshka is
pragma Pure;
end Matreshka;
| 67.9 | 78 | 0.402356 |
0bb5c4accf95772d27378e64a11971c993b69eba | 6,470 | adb | Ada | src/openapi-streams-forms.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | src/openapi-streams-forms.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | src/openapi-streams-forms.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- openapi-streams-forms -- x-www-form-urlencoded streams
-- Copyright (C) 2018, 2022 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.
-----------------------------------------------------------------------
package body OpenAPI.Streams.Forms is
procedure Initialize (Stream : in out Output_Stream;
Buffer : in Util.Streams.Texts.Print_Stream_Access) is
begin
Stream.Stream := Buffer;
end Initialize;
-- ------------------------------
-- Flush the buffer (if any) to the sink.
-- ------------------------------
overriding
procedure Flush (Stream : in out Output_Stream) is
begin
Stream.Stream.Flush;
end Flush;
-- ------------------------------
-- Close the sink.
-- ------------------------------
overriding
procedure Close (Stream : in out Output_Stream) is
begin
Stream.Stream.Close;
end Close;
-- ------------------------------
-- Write the buffer array to the output stream.
-- ------------------------------
overriding
procedure Write (Stream : in out Output_Stream;
Buffer : in Ada.Streams.Stream_Element_Array) is
begin
Stream.Stream.Write (Buffer);
end Write;
-- Write the attribute name/value pair.
overriding
procedure Write_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in String) is
begin
if Stream.Has_Param then
Stream.Stream.Write ('&');
end if;
Stream.Has_Param := True;
Stream.Stream.Write (Name);
Stream.Stream.Write ('=');
Stream.Stream.Write (Value);
end Write_Attribute;
overriding
procedure Write_Wide_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in Wide_Wide_String) is
begin
if Stream.Has_Param then
Stream.Stream.Write ('&');
end if;
Stream.Has_Param := True;
Stream.Stream.Write (Name);
Stream.Stream.Write ('=');
for C of Value loop
Stream.Stream.Write_Wide (C);
end loop;
end Write_Wide_Attribute;
overriding
procedure Write_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in Integer) is
begin
if Stream.Has_Param then
Stream.Stream.Write ('&');
end if;
Stream.Has_Param := True;
Stream.Stream.Write (Name);
Stream.Stream.Write ('=');
Stream.Stream.Write (Util.Strings.Image (Value));
end Write_Attribute;
overriding
procedure Write_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in Boolean) is
begin
if Stream.Has_Param then
Stream.Stream.Write ('&');
end if;
Stream.Has_Param := True;
Stream.Stream.Write (Name);
Stream.Stream.Write ('=');
Stream.Stream.Write (if Value then "true" else "false");
end Write_Attribute;
overriding
procedure Write_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
null;
end Write_Attribute;
-- Write the attribute with a null value.
overriding
procedure Write_Null_Attribute (Stream : in out Output_Stream;
Name : in String) is
begin
null;
end Write_Null_Attribute;
-- Write the entity value.
overriding
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in String) is
begin
Stream.Write_Attribute (Name, Value);
end Write_Entity;
overriding
procedure Write_Wide_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Wide_Wide_String) is
begin
Stream.Write_Wide_Attribute (Name, Value);
end Write_Wide_Entity;
overriding
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Boolean) is
begin
Stream.Write_Attribute (Name, Value);
end Write_Entity;
overriding
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Integer) is
begin
Stream.Write_Attribute (Name, Value);
end Write_Entity;
overriding
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Ada.Calendar.Time) is
begin
null;
end Write_Entity;
overriding
procedure Write_Long_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Long_Long_Integer) is
begin
null;
end Write_Long_Entity;
overriding
procedure Write_Enum_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in String) is
begin
null;
end Write_Enum_Entity;
overriding
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
null;
end Write_Entity;
-- Write an entity with a null value.
overriding
procedure Write_Null_Entity (Stream : in out Output_Stream;
Name : in String) is
begin
null;
end Write_Null_Entity;
end OpenAPI.Streams.Forms;
| 31.715686 | 79 | 0.549768 |
df550929ea32942f5bf6fed9373d42065eba014e | 7,015 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-diflio.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/s-diflio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-diflio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . F L O A T _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides output routines for float dimensioned types. All Put
-- routines are modelled after those in package Ada.Text_IO.Float_IO with the
-- addition of an extra default parameter. All Put_Dim_Of routines
-- output the dimension of Item in a symbolic manner.
-- Parameter Symbol may be used in the following manner (all the examples are
-- based on the MKS system of units defined in package System.Dim.Mks):
-- type Mks_Type is new Long_Long_Float
-- with
-- Dimension_System => (
-- (Unit_Name => Meter, Unit_Symbol => 'm', Dim_Symbol => 'L'),
-- (Unit_Name => Kilogram, Unit_Symbol => "kg", Dim_Symbol => 'M'),
-- (Unit_Name => Second, Unit_Symbol => 's', Dim_Symbol => 'T'),
-- (Unit_Name => Ampere, Unit_Symbol => 'A', Dim_Symbol => 'I'),
-- (Unit_Name => Kelvin, Unit_Symbol => 'K', Dim_Symbol => '@'),
-- (Unit_Name => Mole, Unit_Symbol => "mol", Dim_Symbol => 'N'),
-- (Unit_Name => Candela, Unit_Symbol => "cd", Dim_Symbol => 'J'));
-- Case 1. A value is supplied for Symbol
-- * Put : The string appears as a suffix of Item
-- * Put_Dim_Of : The string appears alone
-- Obj : Mks_Type := 2.6;
-- Put (Obj, 1, 1, 0, " dimensionless");
-- Put_Dim_Of (Obj, "dimensionless");
-- The corresponding outputs are:
-- $2.6 dimensionless
-- $dimensionless
-- Case 2. No value is supplied for Symbol and Item is dimensionless
-- * Put : Item appears without a suffix
-- * Put_Dim_Of : the output is []
-- Obj : Mks_Type := 2.6;
-- Put (Obj, 1, 1, 0);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $2.6
-- $[]
-- Case 3. No value is supplied for Symbol and Item has a dimension
-- * Put : If the type of Item is a dimensioned subtype whose
-- symbol is not empty, then the symbol appears as a suffix.
-- Otherwise, a new string is created and appears as a
-- suffix of Item. This string results in the successive
-- concatenations between each unit symbol raised by its
-- corresponding dimension power from the dimensions of Item.
-- * Put_Dim_Of : The output is a new string resulting in the successive
-- concatenations between each dimension symbol raised by its
-- corresponding dimension power from the dimensions of Item.
-- subtype Length is Mks_Type
-- with
-- Dimension => ('m',
-- Meter => 1,
-- others => 0);
-- Obj : Length := 2.3 * dm;
-- Put (Obj, 1, 2, 0);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $0.23 m
-- $[L]
-- subtype Random is Mks_Type
-- with
-- Dimension => (
-- Meter => 3,
-- Candela => -1,
-- others => 0);
-- Obj : Random := 5.0;
-- Put (Obj);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $5.0 m**3.cd**(-1)
-- $[l**3.J**(-1)]
-- Put (3.3 * km * dm * min, 5, 1, 0);
-- Put_Dim_Of (3.3 * km * dm * min);
-- The corresponding outputs are:
-- $19800.0 m**2.s
-- $[L**2.T]
with Ada.Text_IO; use Ada.Text_IO;
generic
type Num_Dim_Float is digits <>;
package System.Dim.Float_IO is
Default_Fore : Field := 2;
Default_Aft : Field := Num_Dim_Float'Digits - 1;
Default_Exp : Field := 3;
procedure Put
(File : File_Type;
Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put
(Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put
(To : out String;
Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put_Dim_Of
(File : File_Type;
Item : Num_Dim_Float;
Symbol : String := "");
procedure Put_Dim_Of
(Item : Num_Dim_Float;
Symbol : String := "");
procedure Put_Dim_Of
(To : out String;
Item : Num_Dim_Float;
Symbol : String := "");
pragma Inline (Put);
pragma Inline (Put_Dim_Of);
function Image
(Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "") return String;
end System.Dim.Float_IO;
| 37.918919 | 78 | 0.493942 |
4dd5f813ca49933b7f0e82b6a0eed9558d087413 | 5,118 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-pack43.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/s-pack43.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/s-pack43.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 3 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_43 is
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_43;
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;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
------------
-- Get_43 --
------------
function Get_43 (Arr : System.Address; N : Natural) return Bits_43 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Get_43;
------------
-- Set_43 --
------------
procedure Set_43 (Arr : System.Address; N : Natural; E : Bits_43) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Set_43;
end System.Pack_43;
| 43.008403 | 78 | 0.47245 |
a18192200e8ac972bf9d994e599c8e3ac5ec050a | 18,910 | ads | Ada | arch/ARM/Nordic/drivers/nrf52/nrf-tasks.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/Nordic/drivers/nrf52/nrf-tasks.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/Nordic/drivers/nrf52/nrf-tasks.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2020, 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 NRF_SVD.POWER;
with NRF_SVD.CLOCK;
with NRF_SVD.GPIOTE;
with NRF_SVD.PPI;
with NRF_SVD.RADIO;
with NRF_SVD.TIMER;
with NRF_SVD.RTC;
with NRF_SVD.WDT;
with NRF_SVD.RNG;
with NRF_SVD.TEMP;
with NRF_SVD.ECB;
with NRF_SVD.CCM;
with NRF_SVD.AAR;
with NRF_SVD.TWI;
with NRF_SVD.UART;
with NRF_SVD.QDEC;
with NRF_SVD.SAADC;
with HAL; use HAL;
package nRF.Tasks is
procedure Trigger (T : Task_Type);
-- Software task trigger
function Get_Address (T : Task_Type) return System.Address;
function Get_Address (T : Task_Type) return UInt32;
-- Power management tasks
Power_CONSTLAT : constant Task_Type;
Power_LOWPWR : constant Task_Type;
-- Clock tasks
Clock_HFCLKSTART : constant Task_Type;
Clock_HFCLKSTOP : constant Task_Type;
Clock_LFCLKSTART : constant Task_Type;
Clock_LFCLKSTOP : constant Task_Type;
Clock_CAL : constant Task_Type;
Clock_CTSTART : constant Task_Type;
Clock_CTSTOP : constant Task_Type;
-- GPIO tasks
GPIOTE_OUT_0 : constant Task_Type;
GPIOTE_OUT_1 : constant Task_Type;
GPIOTE_OUT_2 : constant Task_Type;
GPIOTE_OUT_3 : constant Task_Type;
-- Programmable Peripheral Interconnect tasks
PPI_CHG_0_EN : constant Task_Type;
PPI_CHG_0_DIS : constant Task_Type;
PPI_CHG_1_EN : constant Task_Type;
PPI_CHG_1_DIS : constant Task_Type;
PPI_CHG_2_EN : constant Task_Type;
PPI_CHG_2_DIS : constant Task_Type;
PPI_CHG_3_EN : constant Task_Type;
PPI_CHG_3_DIS : constant Task_Type;
-- Radio tasks
Radio_TXEN : constant Task_Type;
Radio_RXEN : constant Task_Type;
Radio_START : constant Task_Type;
Radio_STOP : constant Task_Type;
Radio_DISABLE : constant Task_Type;
Radio_RSSISTART : constant Task_Type;
Radio_RSSISTOP : constant Task_Type;
Radio_BCSTART : constant Task_Type;
Radio_BCSTOP : constant Task_Type;
-- Timer 0 tasks
Timer_0_START : constant Task_Type;
Timer_0_STOP : constant Task_Type;
Timer_0_COUNT : constant Task_Type;
Timer_0_CLEAR : constant Task_Type;
Timer_0_CAPTURE_0 : constant Task_Type;
Timer_0_CAPTURE_1 : constant Task_Type;
Timer_0_CAPTURE_2 : constant Task_Type;
Timer_0_CAPTURE_3 : constant Task_Type;
-- Timer 1 tasks
Timer_1_START : constant Task_Type;
Timer_1_STOP : constant Task_Type;
Timer_1_COUNT : constant Task_Type;
Timer_1_CLEAR : constant Task_Type;
Timer_1_CAPTURE_0 : constant Task_Type;
Timer_1_CAPTURE_1 : constant Task_Type;
Timer_1_CAPTURE_2 : constant Task_Type;
Timer_1_CAPTURE_3 : constant Task_Type;
-- Timer 2 tasks
Timer_2_START : constant Task_Type;
Timer_2_STOP : constant Task_Type;
Timer_2_COUNT : constant Task_Type;
Timer_2_CLEAR : constant Task_Type;
Timer_2_CAPTURE_0 : constant Task_Type;
Timer_2_CAPTURE_1 : constant Task_Type;
Timer_2_CAPTURE_2 : constant Task_Type;
Timer_2_CAPTURE_3 : constant Task_Type;
-- RTC 0 tasks
RTC_0_START : constant Task_Type;
RTC_0_STOP : constant Task_Type;
RTC_0_CLEAR : constant Task_Type;
RTC_0_TRIGOVRFLW : constant Task_Type;
-- RTC 1 tasks
RTC_1_START : constant Task_Type;
RTC_1_STOP : constant Task_Type;
RTC_1_CLEAR : constant Task_Type;
RTC_1_TRIGOVRFLW : constant Task_Type;
-- Watchdog task
Watchdog_START : constant Task_Type;
-- Random Number Genrator tasks
RNG_START : constant Task_Type;
RNG_STOP : constant Task_Type;
-- Temperature tasks
Temperature_START : constant Task_Type;
Temperature_STOP : constant Task_Type;
-- AES Electronic Codebook mode encryption (ECB) tasks
ECB_START : constant Task_Type;
ECB_STOP : constant Task_Type;
-- AES CCM mode encryption (CCM) tasks
CCM_KSGEN : constant Task_Type;
CCM_CRYPT : constant Task_Type;
CCM_STOP : constant Task_Type;
-- Accelerated Address Resolver (AAR) tasks
AAR_START : constant Task_Type;
AAR_STOP : constant Task_Type;
-- Two Wire Interface (TWI) 0 tasks
TWI_0_STARTRX : constant Task_Type;
TWI_0_STARTTX : constant Task_Type;
TWI_0_STOP : constant Task_Type;
TWI_0_SUSPEND : constant Task_Type;
TWI_0_RESUME : constant Task_Type;
-- Two Wire Interface (TWI) 1 tasks
TWI_1_STARTRX : constant Task_Type;
TWI_1_STARTTX : constant Task_Type;
TWI_1_STOP : constant Task_Type;
TWI_1_SUSPEND : constant Task_Type;
TWI_1_RESUME : constant Task_Type;
-- Universal Asynchronous Receiver/Transmitter (UART) Tasks
UART_STARTRX : constant Task_Type;
UART_STOPRX : constant Task_Type;
UART_STARTTX : constant Task_Type;
UART_STOPTX : constant Task_Type;
-- Quadrature Decoder (QDEC)
QDEC_START : constant Task_Type;
QDEC_STOP : constant Task_Type;
QDEC_READCLRACC : constant Task_Type;
-- Analof to Digital Converter (ADC)
ADC_START : constant Task_Type;
ADC_STOP : constant Task_Type;
private
-- Power management tasks
Power_CONSTLAT : constant Task_Type :=
Task_Type (NRF_SVD.POWER.POWER_Periph.TASKS_CONSTLAT'Address);
Power_LOWPWR : constant Task_Type :=
Task_Type (NRF_SVD.POWER.POWER_Periph.TASKS_LOWPWR'Address);
-- Clock tasks
Clock_HFCLKSTART : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_HFCLKSTART'Address);
Clock_HFCLKSTOP : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_HFCLKSTOP'Address);
Clock_LFCLKSTART : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_LFCLKSTART'Address);
Clock_LFCLKSTOP : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_LFCLKSTOP'Address);
Clock_CAL : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_CAL'Address);
Clock_CTSTART : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_CTSTART'Address);
Clock_CTSTOP : constant Task_Type :=
Task_Type (NRF_SVD.CLOCK.CLOCK_Periph.TASKS_CTSTOP'Address);
-- GPIOTE tasks
GPIOTE_OUT_0 : constant Task_Type :=
Task_Type (NRF_SVD.GPIOTE.GPIOTE_Periph.TASKS_OUT (0)'Address);
GPIOTE_OUT_1 : constant Task_Type :=
Task_Type (NRF_SVD.GPIOTE.GPIOTE_Periph.TASKS_OUT (1)'Address);
GPIOTE_OUT_2 : constant Task_Type :=
Task_Type (NRF_SVD.GPIOTE.GPIOTE_Periph.TASKS_OUT (2)'Address);
GPIOTE_OUT_3 : constant Task_Type :=
Task_Type (NRF_SVD.GPIOTE.GPIOTE_Periph.TASKS_OUT (3)'Address);
-- Programmable Peripheral Interconnect Tasks
PPI_CHG_0_EN : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (0).EN'Address);
PPI_CHG_0_DIS : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (0).DIS'Address);
PPI_CHG_1_EN : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (1).EN'Address);
PPI_CHG_1_DIS : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (1).DIS'Address);
PPI_CHG_2_EN : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (2).EN'Address);
PPI_CHG_2_DIS : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (2).DIS'Address);
PPI_CHG_3_EN : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (3).EN'Address);
PPI_CHG_3_DIS : constant Task_Type :=
Task_Type (NRF_SVD.PPI.PPI_Periph.TASKS_CHG (3).DIS'Address);
-- Radio tasks
Radio_TXEN : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_TXEN'Address);
Radio_RXEN : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_RXEN'Address);
Radio_START : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_START'Address);
Radio_STOP : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_STOP'Address);
Radio_DISABLE : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_DISABLE'Address);
Radio_RSSISTART : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_RSSISTART'Address);
Radio_RSSISTOP : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_RSSISTOP'Address);
Radio_BCSTART : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_BCSTART'Address);
Radio_BCSTOP : constant Task_Type :=
Task_Type (NRF_SVD.RADIO.RADIO_Periph.TASKS_BCSTOP'Address);
-- Timer 0 tasks
Timer_0_START : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_COUNT : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_CLEAR : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_CAPTURE_0 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_CAPTURE_1 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_CAPTURE_2 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
Timer_0_CAPTURE_3 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER0_Periph.TASKS_START'Address);
-- Timer 1 tasks
Timer_1_START : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_COUNT : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_CLEAR : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_CAPTURE_0 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_CAPTURE_1 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_CAPTURE_2 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
Timer_1_CAPTURE_3 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER1_Periph.TASKS_START'Address);
-- Timer 2 tasks
Timer_2_START : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_COUNT : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_CLEAR : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_CAPTURE_0 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_CAPTURE_1 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_CAPTURE_2 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
Timer_2_CAPTURE_3 : constant Task_Type :=
Task_Type (NRF_SVD.TIMER.TIMER2_Periph.TASKS_START'Address);
-- RTC 0 tasks
RTC_0_START : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC0_Periph.TASKS_START'Address);
RTC_0_STOP : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC0_Periph.TASKS_STOP'Address);
RTC_0_CLEAR : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC0_Periph.TASKS_CLEAR'Address);
RTC_0_TRIGOVRFLW : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC0_Periph.TASKS_TRIGOVRFLW'Address);
-- RTC 1 tasks
RTC_1_START : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC1_Periph.TASKS_START'Address);
RTC_1_STOP : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC1_Periph.TASKS_STOP'Address);
RTC_1_CLEAR : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC1_Periph.TASKS_CLEAR'Address);
RTC_1_TRIGOVRFLW : constant Task_Type :=
Task_Type (NRF_SVD.RTC.RTC1_Periph.TASKS_TRIGOVRFLW'Address);
-- Watchdog tasks
Watchdog_START : constant Task_Type :=
Task_Type (NRF_SVD.WDT.WDT_Periph.TASKS_START'Address);
-- Random Number Genrator tasks
RNG_START : constant Task_Type :=
Task_Type (NRF_SVD.RNG.RNG_Periph.TASKS_START'Address);
RNG_STOP : constant Task_Type :=
Task_Type (NRF_SVD.RNG.RNG_Periph.TASKS_START'Address);
-- Temperature tasks
Temperature_START : constant Task_Type :=
Task_Type (NRF_SVD.TEMP.TEMP_Periph.TASKS_START'Address);
Temperature_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TEMP.TEMP_Periph.TASKS_STOP'Address);
-- AES Electronic Codebook mode encryption (ECB) tasks
ECB_START : constant Task_Type :=
Task_Type (NRF_SVD.ECB.ECB_Periph.TASKS_STARTECB'Address);
ECB_STOP : constant Task_Type :=
Task_Type (NRF_SVD.ECB.ECB_Periph.TASKS_STOPECB'Address);
-- AES CCM mode encryption (CCM) tasks
CCM_KSGEN : constant Task_Type :=
Task_Type (NRF_SVD.CCM.CCM_Periph.TASKS_KSGEN'Address);
CCM_CRYPT : constant Task_Type :=
Task_Type (NRF_SVD.CCM.CCM_Periph.TASKS_CRYPT'Address);
CCM_STOP : constant Task_Type :=
Task_Type (NRF_SVD.CCM.CCM_Periph.TASKS_STOP'Address);
-- Accelerated Address Resolver (AAR) tasks
AAR_START : constant Task_Type :=
Task_Type (NRF_SVD.AAR.AAR_Periph.TASKS_START'Address);
AAR_STOP : constant Task_Type :=
Task_Type (NRF_SVD.AAR.AAR_Periph.TASKS_STOP'Address);
-- Two Wire Interface (TWI) 0 tasks
TWI_0_STARTRX : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI0_Periph.TASKS_STARTRX'Address);
TWI_0_STARTTX : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI0_Periph.TASKS_STARTTX'Address);
TWI_0_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI0_Periph.TASKS_STOP'Address);
TWI_0_SUSPEND : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI0_Periph.TASKS_SUSPEND'Address);
TWI_0_RESUME : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI0_Periph.TASKS_RESUME'Address);
-- Two Wire Interface (TWI) 1 tasks
TWI_1_STARTRX : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI1_Periph.TASKS_STARTRX'Address);
TWI_1_STARTTX : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI1_Periph.TASKS_STARTTX'Address);
TWI_1_STOP : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI1_Periph.TASKS_STOP'Address);
TWI_1_SUSPEND : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI1_Periph.TASKS_SUSPEND'Address);
TWI_1_RESUME : constant Task_Type :=
Task_Type (NRF_SVD.TWI.TWI1_Periph.TASKS_RESUME'Address);
-- Universal Asynchronous Receiver/Transmitter (UART) Tasks
UART_STARTRX : constant Task_Type :=
Task_Type (NRF_SVD.UART.UART0_Periph.TASKS_STARTRX'Address);
UART_STOPRX : constant Task_Type :=
Task_Type (NRF_SVD.UART.UART0_Periph.TASKS_STOPRX'Address);
UART_STARTTX : constant Task_Type :=
Task_Type (NRF_SVD.UART.UART0_Periph.TASKS_STARTTX'Address);
UART_STOPTX : constant Task_Type :=
Task_Type (NRF_SVD.UART.UART0_Periph.TASKS_STOPTX'Address);
-- Quadrature Decoder (QDEC)
QDEC_START : constant Task_Type :=
Task_Type (NRF_SVD.QDEC.QDEC_Periph.TASKS_START'Address);
QDEC_STOP : constant Task_Type :=
Task_Type (NRF_SVD.QDEC.QDEC_Periph.TASKS_STOP'Address);
QDEC_READCLRACC : constant Task_Type :=
Task_Type (NRF_SVD.QDEC.QDEC_Periph.TASKS_READCLRACC'Address);
-- Analof to Digital Converter (ADC)
ADC_START : constant Task_Type :=
Task_Type (NRF_SVD.SAADC.SAADC_Periph.TASKS_START'Address);
ADC_STOP : constant Task_Type :=
Task_Type (NRF_SVD.SAADC.SAADC_Periph.TASKS_STOP'Address);
end nRF.Tasks;
| 44.494118 | 78 | 0.674141 |
a1a21fda51bca2a4ec92cab5a5bf7b1a8e1fa662 | 636 | ads | Ada | demo/adainclude/memory_copy.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/memory_copy.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/memory_copy.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | --
-- Copyright (C) 2006-2013, AdaCore
--
-- This package provides a general block copy mechanisms analogous to that
-- provided by the C routine memcpy allowing for copies without overlap.
with System; use System;
with Interfaces.C; use Interfaces.C;
package Memory_Copy is
pragma Preelaborate;
procedure memcpy (Dest : Address; Src : Address; N : size_t);
pragma Export (C, memcpy, "memcpy");
-- Copies N storage units from area starting at Src to area starting
-- at Dest without any check for buffer overflow. The memory areas
-- must not overlap, or the result of this call is undefined.
end Memory_Copy;
| 30.285714 | 75 | 0.72956 |
39f564d576626e4a065e72c8d5e1ea247e744a4b | 2,688 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c48008c.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/c48008c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c48008c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C48008C.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.
--*
-- FOR ALLOCATORS OF THE FORM "NEW T X", CHECK THAT CONSTRAINT_ERROR IS
-- RAISED IF T IS AN UNCONSTRAINED ARRAY TYPE WITH INDEX SUBTYPE(S) S, X
-- IS AN INDEX CONSTRAINT, AND THE BOUNDS OF X ARE NOT COMPATIBLE WITH
-- AN INDEX SUBTYPE OF T.
-- RM 01/08/80
-- NL 10/13/81
-- EG 07/05/84
WITH REPORT;
PROCEDURE C48008C IS
USE REPORT;
BEGIN
TEST("C48008C","FOR ALLOCATORS OF THE FORM 'NEW T X', CHECK " &
"THAT CONSTRAINT_ERROR IS RAISED WHEN " &
"APPROPRIATE - UNCONSTRAINED ARRAY TYPE");
DECLARE
SUBTYPE TWO IS INTEGER RANGE 1..2;
TYPE TF IS ARRAY( TWO RANGE <> , TWO RANGE <> ) OF INTEGER;
TYPE ATF IS ACCESS TF;
VF : ATF;
BEGIN
BEGIN
VF := NEW TF ( 0..1 , 1..2 );
FAILED ("NO EXCEPTION RAISED - CASE 1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - CASE 1");
END;
BEGIN
VF := NEW TF(1 .. 2, 2 .. IDENT_INT(3));
FAILED ("NO EXCEPTION RAISED - CASE 2");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - CASE 2");
END;
END;
RESULT;
END C48008C;
| 33.6 | 79 | 0.585565 |
a129b1895aa76156c7252f886fe5ccbd181d0edf | 1,092 | ads | Ada | gb_02/src_bug/lists-dynamic.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | gb_02/src_bug/lists-dynamic.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | gb_02/src_bug/lists-dynamic.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | with Ada.Containers.Vectors;
generic
package Lists.dynamic is
type List is new List_Interface with private;
overriding
function List_Constant_Reference (Container : aliased in List; Position : Cursor) return Constant_Reference_Type;
overriding
function List_Constant_Reference (Container : aliased in List; Index : Index_Type) return Constant_Reference_Type;
overriding
function List_Reference (Container : aliased in out List; Position : Cursor) return Reference_Type;
overriding
function List_Reference (Container : aliased in out List; Index : Index_Type) return Reference_Type;
overriding
function Iterate (Container : in List) return Iterator_Interface'Class;
-- new methods from ACV.Vector pool; should really be part of interface, here is only a demo of tying all together..
function To_Vector (Length : Index_Type) return List;
private
package ACV is new Ada.Containers.Vectors(Index_Type, Element_Type);
type List is new List_Interface with record
vec : ACV.Vector;
end record;
end Lists.dynamic;
| 31.2 | 120 | 0.754579 |
1cf142da1db2f89fb70b7704c8bdc8abf376b07f | 1,890 | adb | Ada | src/unbounded_sequential_queues.adb | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 5 | 2020-09-25T15:41:33.000Z | 2022-03-24T18:22:06.000Z | src/unbounded_sequential_queues.adb | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 2 | 2020-10-03T12:53:32.000Z | 2021-05-25T19:10:17.000Z | src/unbounded_sequential_queues.adb | mgrojo/qt5ada | 66e8944e98c7671b43e81ef4e3d1979bceb47227 | [
"MIT"
] | 3 | 2020-10-03T11:49:34.000Z | 2021-12-04T13:25:02.000Z | --
-- This library is free software; you can redistribute it and/or modify
-- it under the terms of the GNU Library General Public License as
-- published by the Free Software Foundation; either version 3 of the
-- License; or (at your option) any later version.
package body Unbounded_Sequential_Queues is
------------
-- Insert --
------------
procedure Insert (Into : in out Queue; Item : in Element) is
Ptr : Link;
begin
Ptr := new Node'(Data => Item, Next => null);
if Into.Count = 0 then -- initial case
Into.Rear := Ptr;
Into.Front := Into.Rear;
Into.Count := 1;
else -- nodes already in list
Into.Rear.Next := Ptr;
Into.Rear := Ptr;
Into.Count := Into.Count + 1;
end if;
exception
when Storage_Error =>
raise Overflow;
end Insert;
------------
-- Remove --
------------
procedure Remove (From : in out Queue; Item : out Element) is
begin
if From.Count > 0 then -- have data items to Remove
Item := From.Front.Data;
From.Front := From.Front.Next;
From.Count := From.Count - 1;
else -- user didn't check
raise Underflow;
end if;
end Remove;
-----------
-- Empty --
-----------
function Empty (Q : Queue) return Boolean is
begin
return Q.Count = 0;
end Empty;
----------
-- Size --
----------
function Size (Q : Queue) return Natural is
begin
return Q.Count;
end Size;
---------------
-- Iteration --
---------------
procedure Iteration (Over : in Queue) is
Ptr : Link := Over.Front;
Enabled : Boolean := True;
begin
while Ptr /= null and Enabled loop
Process (Ptr.Data, Enabled);
Ptr := Ptr.Next;
end loop;
end Iteration;
end Unbounded_Sequential_Queues;
| 23.924051 | 73 | 0.539683 |
12ffb8dab26c61840778aaefe9f744df612fbe9f | 7,484 | adb | Ada | src/gen-model-mappings.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/gen-model-mappings.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/gen-model-mappings.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | -----------------------------------------------------------------------
-- gen-model-mappings -- Type mappings for Code Generator
-- Copyright (C) 2011, 2012, 2015, 2018, 2019, 2021 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.Log.Loggers;
-- The <b>Gen.Model.Mappings</b> package controls the mappings to convert an XML
-- type into the Ada type.
package body Gen.Model.Mappings is
use Ada.Strings.Unbounded;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Gen.Model.Mappings");
Types : Mapping_Maps.Map;
Mapping_Name : UString;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Mapping_Definition;
Name : in String) return UBO.Object is
begin
if Name = "name" then
return UBO.To_Object (From.Target);
elsif Name = "isBoolean" then
return UBO.To_Object (From.Kind = T_BOOLEAN);
elsif Name = "isInteger" then
return UBO.To_Object (From.Kind = T_INTEGER or From.Kind = T_ENTITY_TYPE);
elsif Name = "isFloat" then
return UBO.To_Object (From.Kind = T_FLOAT);
elsif Name = "isString" then
return UBO.To_Object (From.Kind = T_STRING);
elsif Name = "isIdentifier" then
return UBO.To_Object (From.Kind = T_IDENTIFIER);
elsif Name = "isDate" then
return UBO.To_Object (From.Kind = T_DATE);
elsif Name = "isBlob" then
return UBO.To_Object (From.Kind = T_BLOB);
elsif Name = "isEnum" then
return UBO.To_Object (From.Kind = T_ENUM);
elsif Name = "isDiscrete" then
return UBO.To_Object (From.Kind = T_ENUM or From.Kind = T_INTEGER);
elsif Name = "isNewDiscrete" then
return UBO.To_Object (False);
elsif Name = "isPrimitiveType" then
return UBO.To_Object (From.Kind /= T_TABLE and From.Kind /= T_BLOB);
elsif Name = "isNullable" then
return UBO.To_Object (From.Nullable);
else
return Definition (From).Get_Value (Name);
end if;
end Get_Value;
-- ------------------------------
-- Get the type name.
-- ------------------------------
function Get_Type_Name (From : Mapping_Definition) return String is
begin
case From.Kind is
when T_BOOLEAN =>
return "boolean";
when T_INTEGER =>
return "integer";
when T_DATE =>
return "date";
when T_IDENTIFIER =>
return "identifier";
when T_STRING =>
return "string";
when T_FLOAT =>
return "float";
when T_ENTITY_TYPE =>
return "entity_type";
when T_BLOB =>
return "blob";
when T_ENUM =>
return From.Get_Name;
when others =>
return From.Get_Name;
end case;
end Get_Type_Name;
-- ------------------------------
-- Find the mapping for the given type name.
-- ------------------------------
function Find_Type (Name : in UString;
Allow_Null : in Boolean)
return Mapping_Definition_Access is
Pos : constant Mapping_Maps.Cursor := Types.Find (Mapping_Name & Name);
begin
if not Mapping_Maps.Has_Element (Pos) then
Log.Info ("Type '{0}' not found in mapping table '{1}'",
To_String (Name), To_String (Mapping_Name));
return null;
elsif Allow_Null then
if Mapping_Maps.Element (Pos).Allow_Null = null then
Log.Info ("Type '{0}' does not allow a null value in mapping table '{1}'",
To_String (Name), To_String (Mapping_Name));
return Mapping_Maps.Element (Pos);
end if;
return Mapping_Maps.Element (Pos).Allow_Null;
else
return Mapping_Maps.Element (Pos);
end if;
end Find_Type;
-- ------------------------------
-- Get the type name according to the mapping definition.
-- ------------------------------
function Get_Type_Name (Name : in UString) return String is
T : constant Mapping_Definition_Access := Find_Type (Name, False);
begin
if T = null then
return To_String (Name);
else
return To_String (T.Target);
end if;
end Get_Type_Name;
procedure Register_Type (Name : in String;
Mapping : in Mapping_Definition_Access;
Kind : in Basic_Type) is
N : constant UString := Mapping_Name & To_UString (Name);
Pos : constant Mapping_Maps.Cursor := Types.Find (N);
begin
Log.Debug ("Register type '{0}'", Name);
if not Mapping_Maps.Has_Element (Pos) then
Mapping.Kind := Kind;
Types.Insert (N, Mapping);
end if;
end Register_Type;
-- ------------------------------
-- Register a type mapping <b>From</b> that is mapped to <b>Target</b>.
-- ------------------------------
procedure Register_Type (Target : in String;
From : in String;
Kind : in Basic_Type;
Allow_Null : in Boolean) is
Name : constant UString := Mapping_Name & To_UString (From);
Pos : constant Mapping_Maps.Cursor := Types.Find (Name);
Mapping : Mapping_Definition_Access;
Found : Boolean;
begin
Log.Debug ("Register type '{0}' mapped to '{1}' type {2}",
From, Target, Basic_Type'Image (Kind));
Found := Mapping_Maps.Has_Element (Pos);
if Found then
Mapping := Mapping_Maps.Element (Pos);
else
Mapping := new Mapping_Definition;
Mapping.Set_Name (From);
Types.Insert (Name, Mapping);
end if;
if Allow_Null then
Mapping.Allow_Null := new Mapping_Definition;
Mapping.Allow_Null.Target := To_UString (Target);
Mapping.Allow_Null.Kind := Kind;
Mapping.Allow_Null.Nullable := True;
if not Found then
Mapping.Target := To_UString (Target);
Mapping.Kind := Kind;
end if;
else
Mapping.Target := To_UString (Target);
Mapping.Kind := Kind;
end if;
end Register_Type;
-- ------------------------------
-- Setup the type mapping for the language identified by the given name.
-- ------------------------------
procedure Set_Mapping_Name (Name : in String) is
begin
Log.Info ("Using type mapping {0}", Name);
Mapping_Name := To_UString (Name & ".");
end Set_Mapping_Name;
end Gen.Model.Mappings;
| 35.469194 | 92 | 0.558792 |
12be8995a216ad8f106b119a6e7af74a4a8386e2 | 176 | adb | Ada | tests/typing/bad/testfile-inout-6.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | tests/typing/bad/testfile-inout-6.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | 1 | 2019-03-10T19:13:21.000Z | 2019-03-10T19:19:46.000Z | tests/typing/bad/testfile-inout-6.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
procedure Test is
function F(X: Integer) return integer is begin X:= 1; return 0; end;
begin
if F(42) = 0 then new_line; end if;
end;
| 22 | 71 | 0.693182 |
0644a23f726433a550c481e971b708eae4cbf22e | 537 | ads | Ada | ctfft.ads | adrianhoe/adactfft | 1a5c3236c62f7cb326da257272f4e862653b924d | [
"MIT"
] | null | null | null | ctfft.ads | adrianhoe/adactfft | 1a5c3236c62f7cb326da257272f4e862653b924d | [
"MIT"
] | null | null | null | ctfft.ads | adrianhoe/adactfft | 1a5c3236c62f7cb326da257272f4e862653b924d | [
"MIT"
] | null | null | null | --------------------------------------------------------------------------------
-- * Spec name ctfft.ads
-- * Project name ctffttest
-- *
-- * Version 1.0
-- * Last update 11/5/08
-- *
-- * Created by Adrian Hoe on 11/5/08.
-- * Copyright (c) 2008 AdaStar Informatics http://adastarinformatics.com
-- * All rights reserved.
-- *
--------------------------------------------------------------------------------
with Vector;
use Vector;
package Ctfft is
procedure Fft (X : in out Real_Vector_Type);
end Ctfft;
| 25.571429 | 80 | 0.435754 |
a18a56affc691548556179c508ba6186f4efe05c | 32,877 | adb | Ada | source/asis/asis-gela-visibility-utils.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/asis/asis-gela-visibility-utils.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/asis/asis-gela-visibility-utils.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $:
with Ada.Characters.Handling;
with Asis.Clauses;
with Asis.Elements;
with Asis.Declarations;
with Asis.Compilation_Units;
with Asis.Gela.Utils;
with Asis.Gela.Errors;
with Asis.Gela.Elements;
with Asis.Gela.Element_Utils;
with XASIS.Utils;
package body Asis.Gela.Visibility.Utils is
function Find_Body_Stub
(Body_Decl : Asis.Declaration;
Subunit : Asis.Declaration) return Asis.Declaration;
function Find_Corresponding_Declaration
(Completion : Asis.Defining_Name;
Point : Visibility.Point) return Asis.Defining_Name;
function Find_In_With_Or_Parent
(Unit : Asis.Compilation_Unit;
Name : Wide_String) return Boolean;
function Find_Name_Internal
(Name : Asis.Program_Text;
Until_Item : Region_Item_Access;
No_Parent_Region : Boolean := False)
return Region_Item_Access;
procedure Unhide_Region_Item
(Defining_Name : in Asis.Defining_Name;
Point : in Visibility.Point);
procedure Is_Char_Literal
(Name : in Asis.Program_Text;
Is_Wide_Wide : out Boolean;
Is_Wide_Char : out Boolean;
Is_Char : out Boolean);
----------------------
-- Check_Completion --
----------------------
procedure Check_Completion
(Declaration : Asis.Declaration;
Point : Visibility.Point)
is
Completion_For : Asis.Defining_Name;
begin
declare
List : constant Asis.Defining_Name_List :=
Asis.Declarations.Names (Declaration);
begin
for I in List'Range loop
Completion_For :=
Find_Corresponding_Declaration (List (I), Point);
Element_Utils.Set_Completion (Completion_For, Declaration);
end loop;
end;
end Check_Completion;
--------------
-- Find_All --
--------------
procedure Find_All
(Item : in Region_Item_Access;
Index : in out ASIS_Natural;
Result : in out Asis.Defining_Name_List;
Unit : in Asis.Compilation_Unit;
Point : in Visibility.Point;
No_Parent_Region : in Boolean := False)
is
use type Asis.List_Index;
function Completion_Not_Exists return Boolean;
function Unit_Withed
(Item : Region_Item_Access;
Unit : Asis.Compilation_Unit) return Boolean;
function Completion_Not_Exists return Boolean is
use XASIS.Utils;
use Asis.Elements;
Comp : Asis.Declaration := Completion_For_Name (Item.Defining_Name);
Decl : Asis.Declaration;
Found : Boolean := False;
begin
if not Assigned (Comp) then
return True;
end if;
for I in 1 .. Index loop
Decl := Enclosing_Element (Result (I));
if Is_Equal (Comp, Decl) then
Found := True;
exit;
end if;
end loop;
return not Found;
end Completion_Not_Exists;
function Unit_Withed
(Item : Region_Item_Access;
Unit : Asis.Compilation_Unit) return Boolean
is
use Asis.Elements;
use Asis.Compilation_Units;
Decl_Unit : Asis.Compilation_Unit :=
Enclosing_Compilation_Unit (Item.Defining_Name);
Unit_Name : Wide_String := Unit_Full_Name (Decl_Unit);
begin
return Find_In_With_Or_Parent (Unit, Unit_Name);
end Unit_Withed;
function Not_Overridden return Boolean is
begin
for I in 1 .. Index loop
if Is_Equal (Item.Defining_Name,
Element_Utils.Override (Result (I)))
then
return False;
end if;
end loop;
return True;
end Not_Overridden;
function Is_Hidden
(First : Asis.Defining_Name;
Second : Asis.Defining_Name) return Boolean
is
use Asis.Elements;
Decl_1 : Asis.Declaration := Enclosing_Element (First);
Decl_2 : Asis.Declaration := Enclosing_Element (Second);
Parent_1 : Asis.Declaration;
Parent_2 : Asis.Declaration;
Comp : Asis.Declaration;
Kind : Asis.Declaration_Kinds := Declaration_Kind (Decl_1);
begin
if Declaration_Kind (Decl_2) /= Kind then
return False;
end if;
if Kind = A_Parameter_Specification then
Parent_1 := Enclosing_Element (Decl_1);
Parent_2 := Enclosing_Element (Decl_2);
elsif Kind = A_Discriminant_Specification then
Parent_1 := Enclosing_Element (Enclosing_Element (Decl_1));
Parent_2 := Enclosing_Element (Enclosing_Element (Decl_2));
else
return False;
end if;
-- How about Accert statement ???
if Declaration_Kind (Parent_1) in A_Body_Stub then
Comp := Asis.Declarations.Corresponding_Subunit (Parent_1);
if Is_Equal (Comp, Parent_2) then
return True;
end if;
end if;
Comp := XASIS.Utils.Completion_For_Declaration (Parent_1);
return Is_Equal (Comp, Parent_2);
end Is_Hidden;
function Not_Hidden return Boolean is
begin
for I in 1 .. Index loop
if Is_Hidden (Item.Defining_Name, Result (I)) then
return False;
end if;
end loop;
return True;
end Not_Hidden;
begin
if (Item.Kind /= Definition or else not Item.Still_Hidden)
and then Completion_Not_Exists
and then Not_Overridden
and then Not_Hidden
and then Visible_From (Item, Point.Item)
and then (Item.Kind /= Definition
or else not Item.Library_Unit
or else Unit_Withed (Item, Unit))
then
Index := Index + 1;
Result (Index) := Item.Defining_Name;
end if;
if No_Parent_Region and then Item.Prev = null then
return;
end if;
if Item.Prev /= null then
Find_All (Item.Prev, Index, Result, Unit, Point, No_Parent_Region);
elsif Item.Up /= null then
Find_All (Item.Up, Index, Result, Unit, Point, No_Parent_Region);
end if;
end Find_All;
--------------------
-- Find_Body_Stub --
--------------------
function Find_Body_Stub
(Body_Decl : Asis.Declaration;
Subunit : Asis.Declaration) return Asis.Declaration
is
use Asis.Elements;
use Asis.Gela.Errors;
use Asis.Declarations;
List : Asis.Element_List := Body_Declarative_Items (Body_Decl);
Name : constant Asis.Program_Text :=
XASIS.Utils.Declaration_Direct_Name (Subunit);
begin
for I in List'Range loop
if Declaration_Kind (List (I)) in A_Body_Stub
and then XASIS.Utils.Has_Defining_Name (List (I), Name)
then
return List (I);
end if;
end loop;
Report (Subunit, Error_No_Such_Stub);
return Asis.Nil_Element;
end Find_Body_Stub;
------------------------------------
-- Find_Corresponding_Declaration --
------------------------------------
function Find_Corresponding_Declaration
(Completion : Asis.Defining_Name;
Point : Visibility.Point) return Asis.Defining_Name
is
use XASIS.Utils;
use Asis.Elements;
use Asis.Gela.Utils;
Possible : Asis.Defining_Name_List :=
Visibility.Lookup_In_Region (Completion, Point, Point);
Index : ASIS_Natural := 0;
Decl : Asis.Declaration;
begin
for I in Possible'Range loop
Decl := Enclosing_Element (Possible (I));
if not Overloadable (Possible (I)) or else
(not Asis.Elements.Is_Part_Of_Implicit (Possible (I)) and then
Are_Type_Conformant (Possible (I), Completion, Completion))
then
Index := I;
exit;
end if;
end loop;
if Index = 0 then
return Nil_Element;
end if;
return Possible (Index);
end Find_Corresponding_Declaration;
----------------------------
-- Find_In_With_Or_Parent --
----------------------------
function Find_In_With_Or_Parent
(Unit : Asis.Compilation_Unit;
Name : Wide_String) return Boolean
is
use Asis.Clauses;
use Asis.Elements;
use XASIS.Utils;
use Asis.Compilation_Units;
function With_Has_Name (Element : Asis.Element;
Name : Program_Text)
return Boolean
is
Item : Asis.Element := Element;
begin
loop
if Are_Equal_Identifiers (Name_Image (Item), Name) then
return True;
end if;
if Expression_Kind (Item.all) = A_Selected_Component then
Item := Prefix (Item.all);
else
return False;
end if;
end loop;
end With_Has_Name;
Next : Asis.Compilation_Unit;
Clauses : constant Context_Clause_List := Context_Clause_Elements (Unit);
Unit_Name : Wide_String := Compilation_Units.Unit_Full_Name (Unit);
begin
if Are_Equal_Identifiers (Unit_Name, Name) then
return True;
end if;
for I in Clauses'Range loop
if Clause_Kind (Clauses (I)) = A_With_Clause then
declare
Names : constant Name_List := Clause_Names (Clauses (I));
begin
for J in Names'Range loop
if With_Has_Name (Names (J), Name) then
return True;
end if;
end loop;
end;
end if;
end loop;
case Unit_Class (Unit) is
when A_Separate_Body =>
Next := Corresponding_Subunit_Parent_Body (Unit);
when A_Private_Body | A_Public_Body =>
Next := Corresponding_Declaration (Unit);
when others =>
Next := Corresponding_Parent_Declaration (Unit);
end case;
if Is_Nil (Next) then
return False;
else
return Find_In_With_Or_Parent (Next, Name);
end if;
end Find_In_With_Or_Parent;
---------------
-- Find_Name --
---------------
function Find_Name
(Name : Asis.Program_Text;
Point : Visibility.Point;
No_Parent_Region : Boolean := False)
return Region_Item_Access
is
begin
if Point.Item = null then
return null;
end if;
return Find_Name_Internal (Name, Point.Item, No_Parent_Region);
end Find_Name;
------------------------
-- Find_Name_Internal --
------------------------
function Find_Name_Internal
(Name : Asis.Program_Text;
Until_Item : Region_Item_Access;
No_Parent_Region : Boolean := False)
return Region_Item_Access
is
Item : Region_Item_Access := Until_Item;
Part : Part_Access := Item.Part;
Region : Region_Access := Part.Region;
Stored_Item : Region_Item_Access;
Is_Wide_Wide : Boolean;
Is_Wide_Char : Boolean;
Is_Char : Boolean;
procedure Fix_Item_Prev is
begin
-- Find the same name in the same region
Item.Prev := Find_Name_Internal
(Name => Name,
Until_Item => Item.Next,
No_Parent_Region => True);
-- Find the same name in upper regions
if Stored_Item.Part.Parent_Item /= null then
Item.Up := Find_Name_Internal
(Name => Name,
Until_Item => Stored_Item.Part.Parent_Item);
end if;
-- Count names in the same region
if Item.Prev = null then
Item.Count := 0;
else
Item.Count := Item.Prev.Count;
if Item.Prev.Up /= null then
Item.Count := Item.Count - Item.Prev.Up.Count;
end if;
end if;
-- Increment count by names in upper regions
if Item.Up /= null then
Item.Count := Item.Count + Item.Up.Count;
end if;
-- Count this name too
Item.Count := Item.Count + 1;
end Fix_Item_Prev;
begin
Is_Char_Literal (Name, Is_Wide_Wide, Is_Wide_Char, Is_Char);
-- loop over regions (Region)
while Region /= null loop
Stored_Item := Item;
-- loop over region items (Item)
while Item /= null loop
case Item.Kind is
when Definition =>
if XASIS.Utils.Has_Name (Item.Defining_Name, Name) then
if Item.Count = 0 then
Fix_Item_Prev;
end if;
return Item;
end if;
when Char | Wide_Char | Wide_Wide_Char =>
if Is_Wide_Wide or
(Is_Wide_Char and Item.Kind in Char .. Wide_Char) or
(Is_Char and Item.Kind = Char)
then
Fix_Item_Prev;
return Item;
end if;
when others =>
null;
end case;
Item := Item.Next;
if Item = null then
Part := Part.Next;
if Part /= null then
Item := Part.Last_Item;
end if;
end if;
end loop;
if No_Parent_Region then
return null;
end if;
Item := Stored_Item.Part.Parent_Item;
if Item /= null then
Part := Item.Part;
if Region.Library_Unit and Part.Kind in A_Children_Part then
Item := Part.Last_Item;
end if;
Region := Part.Region;
else
Part := null;
Region := null;
end if;
end loop;
return null;
end Find_Name_Internal;
------------------------
-- Find_Parent_Region --
------------------------
procedure Find_Parent_Region
(Unit : in Asis.Compilation_Unit;
Point : out Visibility.Point)
is
use Asis.Elements;
use Asis.Compilation_Units;
Parent : Asis.Compilation_Unit;
Decl : Asis.Declaration;
Item : Region_Item_Access;
begin
if Unit_Kind (Unit) in Asis.A_Subunit then
Parent := Corresponding_Subunit_Parent_Body (Unit);
Decl := Unit_Declaration (Parent);
Decl := Find_Body_Stub (Decl, Unit_Declaration (Unit));
Item := Get_Place (Decl);
Point := (Item => Item.Part.Parent_Item);
else
Parent := Corresponding_Parent_Declaration (Unit);
if Is_Nil (Parent) then
Point := (Item => Top_Region.First_Part.Last_Item);
else
Decl := Unit_Declaration (Parent);
Point := Find_Region (Decl);
end if;
end if;
end Find_Parent_Region;
-----------------
-- Find_Region --
-----------------
function Find_Region (Element : Asis.Element) return Visibility.Point is
Item : Region_Item_Access := Get_Place (Element);
begin
return (Item => Item.Part.Region.Last_Part.Last_Item);
end Find_Region;
---------------
-- Get_Place --
---------------
function Get_Place
(Point : in Asis.Element) return Region_Item_Access
is
use Asis.Gela.Elements;
Element : Asis.Element := Point;
Item : Region_Item_Access;
begin
while Item = null loop
case Element_Kind (Element.all) is
when Asis.A_Declaration =>
Item := Place (Declaration_Node (Element.all));
when Asis.An_Exception_Handler =>
Item := Place (Exception_Handler_Node (Element.all));
when Asis.A_Statement =>
Item := Place (Statement_Node (Element.all));
when Asis.A_Defining_Name =>
Item := Place (Defining_Name_Node (Element.all));
when Asis.A_Clause =>
Item := Place (Clause_Node (Element.all));
when others =>
null;
end case;
if Item = null then
Element := Enclosing_Element (Element.all);
end if;
end loop;
return Item;
end Get_Place;
---------------------------
-- Goto_Enclosing_Region --
---------------------------
function Goto_Enclosing_Region
(Stmt : in Asis.Statement)
return Visibility.Point
renames Find_Region;
---------------------
-- Is_Char_Literal --
---------------------
procedure Is_Char_Literal
(Name : in Asis.Program_Text;
Is_Wide_Wide : out Boolean;
Is_Wide_Char : out Boolean;
Is_Char : out Boolean)
is
use Ada.Characters.Handling;
begin
if Name (Name'First) = ''' then
Is_Wide_Wide := True;
Is_Wide_Char := Wide_Character'Pos (Name (Name'First + 1)) not in
16#D800# .. 16#DFFF#;
Is_Char := Is_Character (Name (Name'First + 1));
else
Is_Wide_Wide := False;
Is_Wide_Char := False;
Is_Char := False;
end if;
end Is_Char_Literal;
-----------------
-- Is_Declared --
-----------------
function Is_Declared (Name : in Asis.Defining_Name) return Boolean is
use Asis.Gela.Elements;
Name_Node : Defining_Name_Ptr := Defining_Name_Ptr (Name);
Name_Place : Region_Item_Access := Place (Name_Node.all);
begin
return Name_Place /= null;
end Is_Declared;
-----------------
-- Is_Template --
-----------------
function Is_Template (Decl : Asis.Declaration) return Boolean is
use Asis.Elements;
use Asis.Declarations;
Template : Asis.Declaration;
begin
if Is_Part_Of_Instance (Decl) then
Template := Enclosing_Element (Decl);
case Declaration_Kind (Template) is
when A_Generic_Instantiation |
A_Formal_Package_Declaration |
A_Formal_Package_Declaration_With_Box =>
return True;
when others =>
null;
end case;
end if;
return False;
end Is_Template;
------------------------
-- Is_Top_Declaration --
------------------------
function Is_Top_Declaration (Element : Asis.Element) return Boolean is
use Asis.Elements;
use Asis.Compilation_Units;
Enclosing_Unit : constant Compilation_Unit :=
Enclosing_Compilation_Unit (Element);
begin
return Is_Identical (Element, Unit_Declaration (Enclosing_Unit));
end Is_Top_Declaration;
---------------------
-- Is_Visible_Decl --
---------------------
function Is_Visible_Decl (Tipe : in Asis.Declaration) return Boolean is
Item : Region_Item_Access;
List : Asis.Defining_Name_List := Asis.Declarations.Names (Tipe);
begin
if List'Length = 0 then
return True;
else
Item := Get_Place (List (1));
return Is_Visible (Item.Part.Kind);
end if;
end Is_Visible_Decl;
---------------------
-- Need_New_Region --
---------------------
function Need_New_Region (Element : Asis.Element) return Boolean is
use type Asis.Type_Kinds;
use type Asis.Element_Kinds;
use type Asis.Statement_Kinds;
use type Asis.Definition_Kinds;
use type Asis.Declaration_Kinds;
Kind : Asis.Element_Kinds := Asis.Elements.Element_Kind (Element);
Tipe : Asis.Definition;
Enum : Asis.Type_Kinds;
Stmt : Asis.Statement_Kinds;
Def : Asis.Definition_Kinds;
Decl : Asis.Declaration_Kinds;
begin
if Kind = Asis.An_Exception_Handler then
return True;
elsif Kind = Asis.A_Declaration then
-- if XASIS.Utils.Is_Completion (Element) then
-- return False;
-- end if;
Decl := Asis.Elements.Declaration_Kind (Element);
if Decl = Asis.An_Ordinary_Type_Declaration then
Tipe := Asis.Declarations.Type_Declaration_View (Element);
Def := Asis.Elements.Definition_Kind (Tipe);
if Def = Asis.A_Type_Definition then
Enum := Asis.Elements.Type_Kind (Tipe);
if Enum = Asis.An_Enumeration_Type_Definition then
return False;
end if;
end if;
elsif Decl = Asis.A_Return_Object_Specification then
return False;
end if;
return True;
elsif Kind /= Asis.A_Statement then
return False;
end if;
Stmt := Asis.Elements.Statement_Kind (Element);
if Stmt in Asis.A_Loop_Statement .. Asis.A_Block_Statement
or Stmt = Asis.An_Accept_Statement
or Stmt = Asis.An_Extended_Return_Statement
then
return True;
end if;
return False;
end Need_New_Region;
--------------------
-- Set_Name_Place --
--------------------
procedure Set_Name_Place
(Element : in Asis.Defining_Name;
Point : in Visibility.Point)
is
use Asis.Gela.Elements;
Place : Region_Item_Access := Point.Item;
begin
Set_Place (Defining_Name_Node (Element.all), Place);
end Set_Name_Place;
---------------
-- Set_Place --
---------------
procedure Set_Place
(Element : in Asis.Element;
Point : in Visibility.Point)
is
use Asis.Gela.Elements;
Place : Region_Item_Access := Point.Item;
begin
case Element_Kind (Element.all) is
when Asis.A_Declaration =>
Set_Place (Declaration_Node (Element.all), Place);
when Asis.An_Exception_Handler =>
Set_Place (Exception_Handler_Node (Element.all), Place);
when Asis.A_Statement =>
Set_Place (Statement_Node (Element.all), Place);
when Asis.A_Clause =>
Set_Place (Clause_Node (Element.all), Place);
when others =>
null;
end case;
end Set_Place;
---------------------
-- Strip_Homograph --
---------------------
procedure Strip_Homograph
(Index : in out Asis.List_Index;
Result : in out Asis.Defining_Name_List;
Place : in Asis.Element)
is
use Asis.Gela.Utils;
Passed : Asis.List_Index := 1;
Failed : Boolean;
begin
for I in 2 .. Index loop
Failed := False;
for J in 1 .. Passed loop
if Are_Homographs (Result (J), Result (I), Place) then
Failed := True;
exit;
end if;
end loop;
if not Failed then
Passed := Passed + 1;
Result (Passed) := Result (I);
end if;
end loop;
Index := Passed;
end Strip_Homograph;
------------------------
-- Unhide_Declaration --
------------------------
procedure Unhide_Declaration
(Element : in Asis.Element;
Point : in Visibility.Point)
is
Kind : Asis.Element_Kinds := Asis.Elements.Element_Kind (Element);
begin
pragma Assert (Kind = Asis.A_Declaration,
"Wrong construct in Unhide_Declaration");
declare
Names : Asis.Defining_Name_List :=
Asis.Declarations.Names (Element);
begin
for I in Names'Range loop
Unhide_Region_Item (Names (I), Point);
end loop;
end;
end Unhide_Declaration;
------------------------
-- Unhide_Region_Item --
------------------------
procedure Unhide_Region_Item
(Defining_Name : in Asis.Defining_Name;
Point : in Visibility.Point)
is
Item : Region_Item_Access := Get_Place (Defining_Name);
begin
if Item.Kind = Definition and then
Is_Equal (Item.Defining_Name, Defining_Name)
then
Item.Still_Hidden := False;
end if;
end Unhide_Region_Item;
------------------
-- Visible_From --
------------------
function Visible_From
(Name : in Region_Item_Access;
Place : in Region_Item_Access)
return Boolean
is
function Find_In_Region
(Name : in Region_Item_Access;
Place : in Region_Item_Access;
With_Private : in Boolean) return Boolean
is
Place_Item : Region_Item_Access := Place;
Part : Part_Access := Place_Item.Part;
begin
while Place_Item /= null loop
if Place_Item = Name then
if With_Private or Is_Visible (Name.Part.Kind) then
return True;
else
return False;
end if;
end if;
Place_Item := Place_Item.Next;
if Place_Item = null then
Part := Part.Next;
if Part /= null then
Place_Item := Part.Last_Item;
end if;
end if;
end loop;
return False;
end Find_In_Region;
Name_Item : Region_Item_Access := Name;
Place_Item : Region_Item_Access := Place;
With_Private : Boolean := True;
From_Visible : Boolean := Is_Visible (Place.Part.Kind);
Pl_Reg : Region_Access := Place_Item.Part.Region;
begin
while Pl_Reg.Depth < Name_Item.Part.Region.Depth loop
if not Is_Visible (Name_Item.Part.Kind) then
return False;
end if;
Name_Item := Name_Item.Part.Parent_Item;
end loop;
while Pl_Reg.Depth > Name_Item.Part.Region.Depth loop
if Pl_Reg.Library_Unit and Pl_Reg.Public_Child and From_Visible then
With_Private := False;
else
With_Private := True;
end if;
Place_Item := Place_Item.Part.Parent_Item;
if Pl_Reg.Library_Unit and Place_Item.Part.Kind in A_Children_Part
then
Place_Item := Place_Item.Part.Last_Item;
end if;
From_Visible := Is_Visible (Place_Item.Part.Kind);
Pl_Reg := Place_Item.Part.Region;
end loop;
loop
if Pl_Reg = Name_Item.Part.Region then
return Find_In_Region (Name_Item, Place_Item, With_Private);
end if;
if not Is_Visible (Name_Item.Part.Kind) then
return False;
end if;
if Pl_Reg.Library_Unit and Pl_Reg.Public_Child and From_Visible then
With_Private := False;
else
With_Private := True;
end if;
if Pl_Reg.Library_Unit then
Pl_Reg := Place_Item.Part.Parent_Item.Part.Region;
Place_Item := Pl_Reg.Last_Part.Last_Item;
else
Place_Item := Place_Item.Part.Parent_Item;
Pl_Reg := Place_Item.Part.Region;
end if;
From_Visible := Is_Visible (Place_Item.Part.Kind);
Name_Item := Name_Item.Part.Parent_Item;
end loop;
end Visible_From;
------------------
-- Visible_From --
------------------
function Visible_From
(Name : in Asis.Defining_Name;
Point : in Asis.Element)
return Boolean
is
use Asis.Elements;
use Asis.Gela.Elements;
function Child_Declaration_Part
(Point : Region_Item_Access;
Element : Asis.Element;
Kind : Part_Kinds) return Part_Access;
-- Find child region marked by Element abd return
-- Visible specification part.
----------------------------
-- Child_Declaration_Part --
----------------------------
function Child_Declaration_Part
(Point : Region_Item_Access;
Element : Asis.Element;
Kind : Part_Kinds) return Part_Access
is
Result : Region_Access := Point.Part.Region.First_Child;
Part : Part_Access;
begin
Search_Child_Region:
while Result /= null loop
Part := Result.Last_Part;
while Part /= null loop
if Is_Equal (Part.Element, Element) then
exit Search_Child_Region;
end if;
Part := Part.Next;
end loop;
Result := Result.Next;
end loop Search_Child_Region;
if Result = null then
return null;
end if;
Part := Result.Last_Part;
while Part /= null loop
if Part.Kind = Kind then
return Part;
end if;
Part := Part.Next;
end loop;
return null;
end Child_Declaration_Part;
Name_Node : Defining_Name_Ptr := Defining_Name_Ptr (Name);
Name_Place : Region_Item_Access := Place (Name_Node.all);
Item : Region_Item_Access := Get_Place (Point);
Part : Part_Access;
Decl_Kind : constant Asis.Declaration_Kinds :=
Declaration_Kind (Enclosing_Element (Point));
begin
if Element_Kind (Point) = A_Defining_Name then
if Decl_Kind = A_Package_Declaration then
-- This is a special element to point to end of package
Part := Child_Declaration_Part
(Point => Item,
Element => Enclosing_Element (Point),
Kind => A_Private_Part);
Item := Part.Last_Item;
elsif Decl_Kind = A_Package_Body_Declaration then
Part := Child_Declaration_Part
(Point => Item,
Element => Enclosing_Element (Point),
Kind => A_Body_Part);
Item := Part.Last_Item;
end if;
end if;
if Name_Place = null then
-- Name have not been processed yet
return False;
else
return Visible_From (Name_Place, Item);
end if;
end Visible_From;
begin
Top_Region.Last_Part := Top_Region.First_Part'Access;
Top_Region.First_Part.Region := Top_Region'Access;
Top_Region.First_Part.Kind := A_Public_Children_Part;
Top_Region.First_Part.Last_Item := Top_Region.First_Part.Dummy_Item'Access;
Top_Region.First_Part.Dummy_Item.Part := Top_Region.First_Part'Access;
end Asis.Gela.Visibility.Utils;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
| 30.526462 | 79 | 0.557168 |
124d0ae4990dcf1b6187acfae958af9d00c2d425 | 501 | ads | Ada | source/oasis/program-elements-constraints.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-constraints.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-constraints.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Definitions;
package Program.Elements.Constraints is
pragma Pure (Program.Elements.Constraints);
type Constraint is
limited interface and Program.Elements.Definitions.Definition;
type Constraint_Access is access all Constraint'Class
with Storage_Size => 0;
end Program.Elements.Constraints;
| 26.368421 | 67 | 0.676647 |
06313ef88c4ef56bde6d4434540d81399a07efcc | 434 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/unchecked_union1.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/specs/unchecked_union1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/unchecked_union1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- PR ada/28591
-- Reported by Martin Michlmayr <[email protected]>
-- { dg-do compile }
-- { dg-options "-g" }
with Interfaces; use Interfaces;
package Unchecked_Union1 is
type Mode_Type is (Mode_B2);
type Value_Union (Mode : Mode_Type := Mode_B2) is record
case Mode is
when Mode_B2 =>
B2 : Integer_32;
end case;
end record;
pragma Unchecked_Union (Value_Union);
end Unchecked_Union1;
| 20.666667 | 59 | 0.656682 |
23723fc858367b84c588a0dd88909fc51313f296 | 183,804 | adb | Ada | source/parser/program-parsers-on_reduce_1501.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/parser/program-parsers-on_reduce_1501.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/parser/program-parsers-on_reduce_1501.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z |
with Program.Parsers.Nodes;
use Program.Parsers.Nodes;
pragma Style_Checks ("N");
procedure Program.Parsers.On_Reduce_1501
(Self : access Parse_Context;
Prod : Anagram.Grammars.Production_Index;
Nodes : in out Program.Parsers.Nodes.Node_Array) is
begin
case Prod is
when 1501 =>
Nodes (1) := Self.Factory.
Interface_Type_Definition
(No_Token,
Nodes (1),
Nodes (2));
when 1502 =>
Nodes (1) := Self.Factory.
Interface_Type_Definition
(No_Token,
Nodes (1),
(Self.Factory.Subtype_Mark_Sequence));
when 1503 =>
Nodes (1) := Self.Factory.
Element_Iterator_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6));
when 1504 =>
Nodes (1) := Self.Factory.
Element_Iterator_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
Nodes (5));
when 1505 =>
Nodes (1) := Self.Factory.
Element_Iterator_Specification
(Nodes (1),
No_Token,
None,
Nodes (2),
Nodes (3),
Nodes (4));
when 1506 =>
Nodes (1) := Self.Factory.
Element_Iterator_Specification
(Nodes (1),
No_Token,
None,
Nodes (2),
No_Token,
Nodes (3));
when 1507 =>
declare
List : Node := Nodes (3);
begin
Self.Factory.Prepend_Discriminant_Specification
(List, Nodes (2));
Nodes (1) :=
Self.Factory.Known_Discriminant_Part
(Nodes (1),
List,
Nodes (4));
end;
when 1508 =>
declare
List : Node := Self.
Factory.Discriminant_Specification_Sequence;
begin
Self.Factory.Prepend_Discriminant_Specification
(List, Nodes (2));
Nodes (1) :=
Self.Factory.Known_Discriminant_Part
(Nodes (1),
List,
Nodes (3));
end;
when 1509 =>
Nodes (1) := Nodes (2);
when 1510 =>
declare
List : Node := Nodes (1);
begin
Self.Factory.Append_Defining_Identifier
(List, Nodes (2));
Nodes (1) := List;
end;
when 1511 =>
declare
List : Node := Self.
Factory.Defining_Identifier_Sequence;
begin
Self.Factory.Append_Defining_Identifier
(List, Nodes (1));
Nodes (1) := List;
end;
when 1512 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Declaration
(Nodes (1),
Nodes (2),
Nodes (3));
when 1513 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Declaration
(Nodes (1),
No_Token,
Nodes (2));
when 1514 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Declaration
((Self.Factory.Context_Item_Sequence),
Nodes (1),
Nodes (2));
when 1515 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Declaration
((Self.Factory.Context_Item_Sequence),
No_Token,
Nodes (1));
when 1516 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Body
(Nodes (1),
Nodes (2));
when 1517 =>
Nodes (1) :=
Self.Factory.Compilation_Unit_Body
((Self.Factory.Context_Item_Sequence),
Nodes (1));
when 1518 =>
null;
when 1519 =>
null;
when 1520 =>
null;
when 1521 =>
null;
when 1522 =>
null;
when 1523 =>
null;
when 1524 =>
null;
when 1525 =>
null;
when 1526 =>
null;
when 1527 =>
null;
when 1528 =>
null;
when 1529 =>
null;
when 1530 =>
Nodes (1) :=
Self.Factory.Loop_Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4));
when 1531 =>
Nodes (1) :=
Self.Factory.Loop_Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3));
when 1532 =>
Nodes (1) :=
Self.Factory.While_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1533 =>
Nodes (1) :=
Self.Factory.While_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
Nodes (9));
when 1534 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1535 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
Nodes (9));
when 1536 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1537 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
Nodes (9));
when 1538 =>
Nodes (1) :=
Self.Factory.Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1539 =>
Nodes (1) :=
Self.Factory.Loop_Statement
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
when 1540 =>
Nodes (1) :=
Self.Factory.While_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1541 =>
Nodes (1) :=
Self.Factory.While_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
when 1542 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1543 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
when 1544 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1545 =>
Nodes (1) :=
Self.Factory.For_Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
when 1546 =>
Nodes (1) :=
Self.Factory.Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6));
when 1547 =>
Nodes (1) :=
Self.Factory.Loop_Statement
(None,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
Nodes (5));
when 1548 =>
declare
List : Node :=
Nodes (1);
begin
Self.Factory.Append_Membership_Choice
(List, Nodes (3));
Nodes (1) := List;
end;
when 1549 =>
declare
List : Node :=
Self.Factory.Membership_Choice_Sequence;
begin
Self.Factory.Append_Membership_Choice
(List, Nodes (2));
Nodes (1) := List;
end;
when 1550 =>
null;
when 1551 =>
null;
when 1552 =>
declare
List : Node :=
Nodes (2);
begin
Self.Factory.Prepend_Membership_Choice
(List, Nodes (1));
Nodes (1) := List;
end;
when 1553 =>
declare
List : Node :=
Self.Factory.Membership_Choice_Sequence;
begin
Self.Factory.Prepend_Membership_Choice
(List, Nodes (1));
Nodes (1) := List;
end;
when 1554 =>
Nodes (1) := Self.Factory.Modular_Type_Definition
(Nodes (1), Nodes (2));
when 1555 =>
null;
when 1556 =>
null;
when 1557 =>
null;
when 1558 =>
null;
when 1559 =>
null;
when 1560 =>
Nodes (1) := Self.Factory.Character_Literal
(Nodes (1));
when 1561 =>
null;
when 1562 =>
declare
List : Node :=
Nodes (1);
begin
Self.Factory.Append_Name
(List, Nodes (3));
Nodes (1) := List;
end;
when 1563 =>
declare
List : Node :=
Self.Factory.Name_Sequence;
begin
Self.Factory.Append_Name
(List, Nodes (2));
Nodes (1) := List;
end;
when 1564 =>
null;
when 1565 =>
null;
when 1566 =>
Nodes (1) :=
Self.Factory.Null_Statement
(Nodes (1), Nodes (2));
when 1567 =>
Nodes (1) :=
Self.Factory.Number_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6));
when 1568 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1569 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1570 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
None,
Nodes (6),
Nodes (7));
when 1571 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
None,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1572 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1573 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1574 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
No_Token,
None,
Nodes (5),
Nodes (6));
when 1575 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
No_Token,
None,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1576 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1577 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1578 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
No_Token,
None,
Nodes (5),
Nodes (6));
when 1579 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
No_Token,
None,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1580 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1581 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1582 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
No_Token,
None,
Nodes (4),
Nodes (5));
when 1583 =>
Nodes (1) :=
Self.Factory.Object_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
No_Token,
None,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4));
when 1584 =>
null;
when 1585 =>
null;
when 1586 =>
null;
when 1587 =>
null;
when 1588 =>
null;
when 1589 =>
null;
when 1590 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1591 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1592 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1593 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1594 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1595 =>
Nodes (1) :=
Self.Factory.Object_Renaming_Declaration
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1596 =>
Nodes (1) := Self.Factory.Operator_Symbol
(Nodes (1));
when 1597 =>
Nodes (1) := Self.Factory.Ordinary_Fixed_Point_Definition
(Nodes (1),
Nodes (2),
Nodes (3));
when 1598 =>
Nodes (1) := Self.Factory.Others_Choice
(Nodes (1));
when 1599 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13));
when 1600 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
None,
Nodes (12));
when 1601 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1602 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1603 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1604 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1605 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1606 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1607 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1608 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1609 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1610 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1611 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1612 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1613 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1614 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1615 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1616 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1617 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
when 1618 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
None,
Nodes (10));
when 1619 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1620 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1621 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1622 =>
Nodes (1) :=
Self.Factory.Package_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
None,
Nodes (6));
when 1623 =>
Nodes (1) :=
Self.Factory.Package_Body_Stub
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1624 =>
Nodes (1) :=
Self.Factory.Package_Body_Stub
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1625 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1626 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
None,
Nodes (9));
when 1627 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1628 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (7),
None,
Nodes (8));
when 1629 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1630 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
None,
Nodes (7));
when 1631 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1632 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
None,
Nodes (8));
when 1633 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1634 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
None,
Nodes (7));
when 1635 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1636 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
None,
Nodes (6));
when 1637 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1638 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
None,
Nodes (8));
when 1639 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1640 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (6),
None,
Nodes (7));
when 1641 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1642 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
None,
Nodes (6));
when 1643 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1644 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
None,
Nodes (7));
when 1645 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1646 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (5),
None,
Nodes (6));
when 1647 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
Nodes (6));
when 1648 =>
Nodes (1) :=
Self.Factory.Package_Declaration
(Nodes (1),
Nodes (2),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Basic_Declarative_Item_Sequence),
No_Token,
(Self.Factory.Basic_Declarative_Item_Sequence),
Nodes (4),
None,
Nodes (5));
when 1649 =>
Nodes (1) :=
Self.Factory.Package_Renaming_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6));
when 1650 =>
Nodes (1) :=
Self.Factory.Package_Renaming_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1651 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1652 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
None);
when 1653 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
No_Token,
Nodes (6),
Nodes (7),
Nodes (8));
when 1654 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
No_Token,
Nodes (6),
No_Token,
None);
when 1655 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1656 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
None);
when 1657 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7));
when 1658 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
No_Token,
No_Token,
Nodes (5),
No_Token,
None);
when 1659 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1660 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
None);
when 1661 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7));
when 1662 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
Nodes (4),
No_Token,
No_Token,
Nodes (5),
No_Token,
None);
when 1663 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1664 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
None);
when 1665 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6));
when 1666 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (4),
No_Token,
None);
when 1667 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1668 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
None);
when 1669 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7));
when 1670 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
Nodes (4),
No_Token,
No_Token,
Nodes (5),
No_Token,
None);
when 1671 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1672 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
None);
when 1673 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6));
when 1674 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
Nodes (3),
No_Token,
No_Token,
No_Token,
Nodes (4),
No_Token,
None);
when 1675 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1676 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
None);
when 1677 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6));
when 1678 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
Nodes (3),
No_Token,
No_Token,
Nodes (4),
No_Token,
None);
when 1679 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1680 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
None);
when 1681 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5));
when 1682 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (3),
No_Token,
None);
when 1683 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (3),
Nodes (4),
Nodes (5));
when 1684 =>
Nodes (1) := Self.Factory.Parameter_Specification
(Nodes (1),
Nodes (2),
No_Token,
No_Token,
No_Token,
No_Token,
No_Token,
Nodes (3),
No_Token,
None);
when 1685 =>
declare
List : Node :=
Nodes (1);
begin
Self.Factory.Append_Parameter_Specification
(List, Nodes (3));
Nodes (1) := List;
end;
when 1686 =>
declare
List : Node :=
Self.Factory.Parameter_Specification_Sequence;
begin
Self.Factory.Append_Parameter_Specification
(List, Nodes (2));
Nodes (1) := List;
end;
when 1687 =>
declare
List : Node := Nodes (5);
begin
Self.Factory.Prepend_Pragma_Argument_Association
(List, Nodes (4));
Nodes (1) := Self.Factory.Pragma_Node
(Nodes (1),
Nodes (2),
Nodes (3),
List,
Nodes (6),
Nodes (7));
end;
when 1688 =>
declare
List : Node := Self.
Factory.Pragma_Argument_Association_Sequence;
begin
Self.Factory.Prepend_Pragma_Argument_Association
(List, Nodes (4));
Nodes (1) := Self.Factory.Pragma_Node
(Nodes (1),
Nodes (2),
Nodes (3),
List,
Nodes (5),
Nodes (6));
end;
when 1689 =>
Nodes (1) := Self.Factory.Pragma_Node
(Nodes (1),
Nodes (2),
No_Token,
Self.Factory.Pragma_Argument_Association_Sequence,
No_Token,
Nodes (3));
when 1690 =>
Nodes (1) := Self.Factory.
Pragma_Argument_Association
(Nodes (1),
Nodes (2),
Nodes (3));
when 1691 =>
Nodes (1) := Self.Factory.
Pragma_Argument_Association
(None,
No_Token,
Nodes (1));
when 1692 =>
declare
List : Node := Nodes (1);
begin
Self.Factory.Append_Pragma_Argument_Association
(List, Nodes (3));
Nodes (1) := List;
end;
when 1693 =>
declare
List : Node := Self.
Factory.Pragma_Argument_Association_Sequence;
begin
Self.Factory.Append_Pragma_Argument_Association
(List, Nodes (2));
Nodes (1) := List;
end;
when 1694 =>
null;
when 1695 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (12),
Nodes (13));
end;
when 1696 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (12));
end;
when 1697 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7),
Nodes (8),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (11),
Nodes (12));
end;
when 1698 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7),
Nodes (8),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1699 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (12),
Nodes (13));
end;
when 1700 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (12));
end;
when 1701 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (11),
Nodes (12));
end;
when 1702 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1703 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (11),
Nodes (12));
end;
when 1704 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1705 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (10),
Nodes (11));
end;
when 1706 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (5),
No_Token,
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1707 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (11),
Nodes (12));
end;
when 1708 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1709 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (10),
Nodes (11));
end;
when 1710 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1711 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (11),
Nodes (12));
end;
when 1712 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1713 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (10),
Nodes (11));
end;
when 1714 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1715 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (10),
Nodes (11));
end;
when 1716 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1717 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (9),
Nodes (10));
end;
when 1718 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1719 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (11),
Nodes (12));
end;
when 1720 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1721 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (10),
Nodes (11));
end;
when 1722 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1723 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (11),
Nodes (12));
end;
when 1724 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (11));
end;
when 1725 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (10),
Nodes (11));
end;
when 1726 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1727 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (10),
Nodes (11));
end;
when 1728 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1729 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (9),
Nodes (10));
end;
when 1730 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(Nodes (4),
No_Token,
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1731 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (10),
Nodes (11));
end;
when 1732 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1733 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (9),
Nodes (10));
end;
when 1734 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1735 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (10),
Nodes (11));
end;
when 1736 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
end;
when 1737 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (9),
Nodes (10));
end;
when 1738 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1739 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (9),
Nodes (10));
end;
when 1740 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1741 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (8),
Nodes (9));
end;
when 1742 =>
declare
Def : constant Node :=
Self.Factory.Private_Extension_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Subtype_Mark_Sequence),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Extension_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
end;
when 1743 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (9),
Nodes (10));
end;
when 1744 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
end;
when 1745 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (8),
Nodes (9));
end;
when 1746 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
end;
when 1747 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (5),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (8),
Nodes (9));
end;
when 1748 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (5),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
end;
when 1749 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (7),
Nodes (8));
end;
when 1750 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (5),
No_Token,
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
end;
when 1751 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (7),
Nodes (8));
end;
when 1752 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
Nodes (5),
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
end;
when 1753 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
Nodes (6),
Nodes (7));
end;
when 1754 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
No_Token,
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
end;
when 1755 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (8),
Nodes (9));
end;
when 1756 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
end;
when 1757 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (7),
Nodes (8));
end;
when 1758 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(Nodes (4),
Nodes (5),
No_Token,
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
end;
when 1759 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (4),
Nodes (5),
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (7),
Nodes (8));
end;
when 1760 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (4),
Nodes (5),
Nodes (6));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
end;
when 1761 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (6),
Nodes (7));
end;
when 1762 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
Nodes (4),
No_Token,
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
end;
when 1763 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (6),
Nodes (7));
end;
when 1764 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
Nodes (4),
Nodes (5));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
end;
when 1765 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
Nodes (5),
Nodes (6));
end;
when 1766 =>
declare
Def : constant Node:=
Self.Factory.Private_Type_Definition
(No_Token,
No_Token,
No_Token,
Nodes (4));
begin
Nodes (1) :=
Self.Factory.Private_Type_Declaration
(Nodes (1),
Nodes (2),
None,
Nodes (3),
Def,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
end;
when 1767 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15),
Nodes (16),
Nodes (17));
when 1768 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15),
None,
Nodes (16));
when 1769 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (13),
Nodes (14),
Nodes (15));
when 1770 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (13),
None,
Nodes (14));
when 1771 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
Nodes (12),
Nodes (13));
when 1772 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
None,
Nodes (12));
when 1773 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15),
Nodes (16));
when 1774 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
None,
Nodes (15));
when 1775 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
Nodes (13),
Nodes (14));
when 1776 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
None,
Nodes (13));
when 1777 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1778 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1779 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15),
Nodes (16));
when 1780 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
None,
Nodes (15));
when 1781 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
Nodes (13),
Nodes (14));
when 1782 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
None,
Nodes (13));
when 1783 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1784 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1785 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15));
when 1786 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
None,
Nodes (14));
when 1787 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
Nodes (12),
Nodes (13));
when 1788 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
None,
Nodes (12));
when 1789 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1790 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1791 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14));
when 1792 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
None,
Nodes (13));
when 1793 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1794 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1795 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1796 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1797 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13));
when 1798 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
None,
Nodes (12));
when 1799 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1800 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1801 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1802 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1803 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13));
when 1804 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
None,
Nodes (12));
when 1805 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1806 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1807 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1808 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1809 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1810 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1811 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1812 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1813 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1814 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1815 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15),
Nodes (16));
when 1816 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
None,
Nodes (15));
when 1817 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
Nodes (13),
Nodes (14));
when 1818 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (12),
None,
Nodes (13));
when 1819 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1820 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1821 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15));
when 1822 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
None,
Nodes (14));
when 1823 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
Nodes (12),
Nodes (13));
when 1824 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
None,
Nodes (12));
when 1825 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1826 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1827 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15));
when 1828 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
None,
Nodes (14));
when 1829 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
Nodes (12),
Nodes (13));
when 1830 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
None,
Nodes (12));
when 1831 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1832 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1833 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14));
when 1834 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
None,
Nodes (13));
when 1835 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1836 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1837 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1838 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1839 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13));
when 1840 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
None,
Nodes (12));
when 1841 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1842 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1843 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1844 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1845 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1846 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1847 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1848 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1849 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1850 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4),
Nodes (5),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1851 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1852 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1853 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1854 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1855 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1856 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1857 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
when 1858 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
None,
Nodes (10));
when 1859 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1860 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1861 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1862 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
None,
Nodes (6));
when 1863 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14),
Nodes (15));
when 1864 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
None,
Nodes (14));
when 1865 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
Nodes (12),
Nodes (13));
when 1866 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (11),
None,
Nodes (12));
when 1867 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1868 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1869 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14));
when 1870 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
None,
Nodes (13));
when 1871 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1872 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1873 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1874 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1875 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13),
Nodes (14));
when 1876 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
None,
Nodes (13));
when 1877 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
Nodes (11),
Nodes (12));
when 1878 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (10),
None,
Nodes (11));
when 1879 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1880 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1881 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12),
Nodes (13));
when 1882 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
None,
Nodes (12));
when 1883 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
Nodes (10),
Nodes (11));
when 1884 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (9),
None,
Nodes (10));
when 1885 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1886 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1887 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11),
Nodes (12));
when 1888 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
None,
Nodes (11));
when 1889 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
Nodes (9),
Nodes (10));
when 1890 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (8),
None,
Nodes (9));
when 1891 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1892 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1893 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
when 1894 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
None,
Nodes (10));
when 1895 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1896 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1897 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1898 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3),
Nodes (4),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
None,
Nodes (6));
when 1899 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10),
Nodes (11));
when 1900 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
None,
Nodes (10));
when 1901 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
Nodes (8),
Nodes (9));
when 1902 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (7),
None,
Nodes (8));
when 1903 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1904 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (5),
None,
Nodes (6));
when 1905 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9),
Nodes (10));
when 1906 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
None,
Nodes (9));
when 1907 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1908 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (6),
None,
Nodes (7));
when 1909 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (4),
Nodes (5),
Nodes (6));
when 1910 =>
Nodes (1) :=
Self.Factory.Procedure_Body
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3),
(Self.Factory.Declarative_Item_Sequence),
No_Token,
(Self.Factory.Statement_Sequence),
No_Token,
(Self.Factory.Exception_Handler_Sequence),
Nodes (4),
None,
Nodes (5));
when 1911 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8), No_Token,
No_Token,
None,
No_Token,
Nodes (10),
Nodes (11));
when 1912 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
when 1913 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token, No_Token,
Nodes (8),
Nodes (9),
No_Token,
Nodes (10),
Nodes (11));
when 1914 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token, No_Token,
Nodes (8),
Nodes (9),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
when 1915 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8), No_Token,
No_Token,
None,
Nodes (9),
Nodes (10),
Nodes (11));
when 1916 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8), No_Token,
No_Token,
None,
Nodes (9),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (10));
when 1917 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (8),
Nodes (9));
when 1918 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1919 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5), No_Token,
No_Token,
None,
No_Token,
Nodes (7),
Nodes (8));
when 1920 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1921 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (5),
Nodes (6),
No_Token,
Nodes (7),
Nodes (8));
when 1922 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (5),
Nodes (6),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1923 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5), No_Token,
No_Token,
None,
Nodes (6),
Nodes (7),
Nodes (8));
when 1924 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (5), No_Token,
No_Token,
None,
Nodes (6),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1925 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (5),
Nodes (6));
when 1926 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1927 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7), No_Token,
No_Token,
None,
No_Token,
Nodes (9),
Nodes (10));
when 1928 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
when 1929 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token, No_Token,
Nodes (7),
Nodes (8),
No_Token,
Nodes (9),
Nodes (10));
when 1930 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token, No_Token,
Nodes (7),
Nodes (8),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
when 1931 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7), No_Token,
No_Token,
None,
Nodes (8),
Nodes (9),
Nodes (10));
when 1932 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7), No_Token,
No_Token,
None,
Nodes (8),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (9));
when 1933 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (7),
Nodes (8));
when 1934 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (7));
when 1935 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4), No_Token,
No_Token,
None,
No_Token,
Nodes (6),
Nodes (7));
when 1936 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1937 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (4),
Nodes (5),
No_Token,
Nodes (6),
Nodes (7));
when 1938 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (4),
Nodes (5),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1939 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4), No_Token,
No_Token,
None,
Nodes (5),
Nodes (6),
Nodes (7));
when 1940 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (4), No_Token,
No_Token,
None,
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1941 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (4),
Nodes (5));
when 1942 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4));
when 1943 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6), No_Token,
No_Token,
None,
No_Token,
Nodes (8),
Nodes (9));
when 1944 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1945 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token, No_Token,
Nodes (6),
Nodes (7),
No_Token,
Nodes (8),
Nodes (9));
when 1946 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token, No_Token,
Nodes (6),
Nodes (7),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1947 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6), No_Token,
No_Token,
None,
Nodes (7),
Nodes (8),
Nodes (9));
when 1948 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6), No_Token,
No_Token,
None,
Nodes (7),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (8));
when 1949 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (6),
Nodes (7));
when 1950 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1951 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3), No_Token,
No_Token,
None,
No_Token,
Nodes (5),
Nodes (6));
when 1952 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3), No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1953 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (3),
Nodes (4),
No_Token,
Nodes (5),
Nodes (6));
when 1954 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
Nodes (3),
Nodes (4),
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1955 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3), No_Token,
No_Token,
None,
Nodes (4),
Nodes (5),
Nodes (6));
when 1956 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
Nodes (3), No_Token,
No_Token,
None,
Nodes (4),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (5));
when 1957 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
Nodes (3),
Nodes (4));
when 1958 =>
Nodes (1) :=
Self.Factory.Procedure_Declaration
(No_Token,
No_Token,
Nodes (1),
Nodes (2),
No_Token,
(Self.Factory.Parameter_Specification_Sequence),
No_Token,
No_Token, No_Token,
No_Token,
None,
No_Token,
(Self.Factory.Aspect_Specification_Sequence),
Nodes (3));
when 1959 =>
null;
when 1960 =>
null;
when 1961 =>
declare
List : Node := Nodes (1);
begin
Self.Factory.Append_Program_Unit_Name
(List, Nodes (3));
Nodes (1) := List;
end;
when 1962 =>
declare
List : Node := Self.
Factory.Program_Unit_Name_Sequence;
begin
Self.Factory.Append_Program_Unit_Name
(List, Nodes (2));
Nodes (1) := List;
end;
when 1963 =>
null;
when 1964 =>
null;
when 1965 =>
null;
when 1966 =>
null;
when 1967 =>
null;
when 1968 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8),
Nodes (9));
when 1969 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
No_Token,
Nodes (8));
when 1970 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Protected_Operation_Item_Sequence),
Nodes (6),
Nodes (7),
Nodes (8));
when 1971 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Protected_Operation_Item_Sequence),
Nodes (6),
No_Token,
Nodes (7));
when 1972 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7),
Nodes (8));
when 1973 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
Nodes (5),
Nodes (6),
No_Token,
Nodes (7));
when 1974 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Protected_Operation_Item_Sequence),
Nodes (5),
Nodes (6),
Nodes (7));
when 1975 =>
Nodes (1) :=
Self.Factory.Protected_Body
(Nodes (1),
Nodes (2),
Nodes (3),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (4),
(Self.Factory.Protected_Operation_Item_Sequence),
Nodes (5),
No_Token,
Nodes (6));
when 1976 =>
Nodes (1) :=
Self.Factory.Protected_Body_Stub
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
Nodes (6),
Nodes (7));
when 1977 =>
Nodes (1) :=
Self.Factory.Protected_Body_Stub
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5),
(Self.Factory.Aspect_Specification_Sequence),
Nodes (6));
when 1978 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
Nodes (5));
when 1979 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4),
No_Token);
when 1980 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
Nodes (2),
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (3),
Nodes (4));
when 1981 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
Nodes (2),
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (3),
No_Token);
when 1982 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
No_Token,
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (2),
Nodes (3));
when 1983 =>
Nodes (1) :=
Self.Factory.Protected_Definition
(Nodes (1),
No_Token,
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (2),
No_Token);
when 1984 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
Nodes (1),
Nodes (2),
Nodes (3),
Nodes (4));
when 1985 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
Nodes (1),
Nodes (2),
Nodes (3),
No_Token);
when 1986 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
Nodes (1),
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (2),
Nodes (3));
when 1987 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
Nodes (1),
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (2),
No_Token);
when 1988 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
No_Token,
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (1),
Nodes (2));
when 1989 =>
Nodes (1) :=
Self.Factory.Protected_Definition
((Self.Factory.Protected_Operation_Declaration_Sequence),
No_Token,
(Self.Factory.Protected_Element_Declaration_Sequence),
Nodes (1),
No_Token);
when 1990 =>
null;
when 1991 =>
null;
when 1992 =>
declare
List : Node := Nodes (1);
begin
Self.Factory.Append_Protected_Element_Declaration
(List, Nodes (2));
Nodes (1) := List;
end;
when 1993 =>
declare
List : Node := Self.
Factory.Protected_Element_Declaration_Sequence;
begin
Self.Factory.Append_Protected_Element_Declaration
(List, Nodes (1));
Nodes (1) := List;
end;
when 1994 =>
null;
when 1995 =>
null;
when 1996 =>
null;
when 1997 =>
null;
when 1998 =>
declare
List : Node := Nodes (1);
begin
Self.Factory.Append_Protected_Operation_Declaration
(List, Nodes (2));
Nodes (1) := List;
end;
when 1999 =>
declare
List : Node := Self.
Factory.Protected_Operation_Declaration_Sequence;
begin
Self.Factory.Append_Protected_Operation_Declaration
(List, Nodes (1));
Nodes (1) := List;
end;
when 2000 =>
null;
when others =>
raise Constraint_Error;
end case;
end Program.Parsers.On_Reduce_1501;
| 21.899678 | 66 | 0.447651 |
4d522be6149d6768a3daa3b83a9cf0b3c6352cf0 | 189,757 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_3_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_hw_input_stencil_stream_to_mul_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>72</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_mul_stencil_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>195</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</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>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>195</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_114_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>179</item>
<item>181</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>indvar_flatten_next</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_120_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>182</item>
<item>184</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>p_399</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_399</originalName>
<rtlName>p_399_fu_126_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>p_404_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_404_cast_fu_130_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_415</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_415</originalName>
<rtlName>p_415_fu_134_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>72</item>
<item>74</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_420_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_420_cast_cast_fu_144_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_447</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_447</originalName>
<rtlName>p_447_fu_148_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>79</item>
<item>81</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>p_452_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_452_cast_cast_fu_158_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>p_463</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_463</originalName>
<rtlName>p_463_reg_363</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>86</item>
<item>88</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>p_468_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>287</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>287</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_468_cast_fu_337_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_7_fu_172_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>94</item>
<item>96</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_411</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>223</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_411</originalName>
<rtlName>p_411_fu_182_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>98</item>
<item>99</item>
<item>101</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>p_412_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_412_cast_fu_190_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_413</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_413</originalName>
<rtlName>p_413_fu_194_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_413_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_413_cast_fu_276_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_8</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_8_fu_200_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>109</item>
<item>111</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_427</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>241</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>241</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_427</originalName>
<rtlName>p_427_fu_210_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_428_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_428_cast_cast_fu_218_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_222_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_cast_fu_279_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_429</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_429</originalName>
<rtlName>p_429_fu_282_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_429_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_429_cast_fu_308_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_9</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_9_reg_378</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
<item>126</item>
<item>128</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>p_435</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>250</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>250</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_435</originalName>
<rtlName>p_435_fu_311_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>133</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_436_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>251</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_436_cast_fu_318_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_s_reg_383</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>138</item>
<item>140</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>p_443</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_443</originalName>
<rtlName>p_443_fu_288_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>p_444_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_444_cast_cast_fu_295_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_248_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
<item>148</item>
<item>150</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_459</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_459</originalName>
<rtlName>p_459_fu_258_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>p_460_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_460_cast_cast_fu_266_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp1_fu_322_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp3_fu_270_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp3_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp3_cast_fu_299_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp2_fu_302_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp2_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp2_cast_fu_328_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>p_461</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_461</originalName>
<rtlName>p_461_fu_331_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_461_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_461_cast_fu_340_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_469</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_469</originalName>
<rtlName>p_469_fu_343_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_value_V_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName>p_mul_stencil_stream_V_value_V_din</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name/>
<fileName>hls_target.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>21</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>71</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>80</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_54">
<Value>
<Obj>
<type>2</type>
<id>85</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>87</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_56">
<Value>
<Obj>
<type>2</type>
<id>93</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>95</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>108</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>127</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>132</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>137</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>147</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>149</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>174</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>180</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2067604</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_71">
<Obj>
<type>3</type>
<id>8</id>
<name>newFuncRoot</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>13</id>
<name>.preheader57</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>59</id>
<name>.preheader57.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>41</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>61</id>
<name>.preheader56.exitStub</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>87</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_75">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>176</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>180</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>274</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_162">
<mId>1</mId>
<mTag>Loop_3_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2067609</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_163">
<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>8</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"/>
</item>
<item class_id_reference="22" object_id="_164">
<mId>3</mId>
<mTag>Loop 1</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>13</item>
<item>59</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>2067604</mMinTripCount>
<mMaxTripCount>2067604</mMaxTripCount>
<mMinLatency>2067607</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_165">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>61</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"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_166">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_167">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_168">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_171">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_172">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_173">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_174">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_178">
<id>3</id>
<operations>
<count>22</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_179">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_187">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_190">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_191">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_192">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_193">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_194">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_195">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_199">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_200">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_201">
<id>4</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_202">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_203">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_204">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_207">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_209">
<id>5</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_210">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_215">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_216">
<id>6</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_217">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_219">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_227">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_228">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_229">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</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="_230">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>22</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="_231">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>23</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="_232">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>24</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="_233">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>25</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="_234">
<inState>2</inState>
<outState>7</outState>
<condition>
<id>21</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>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_235">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>26</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_236">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>16</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_pp0_stage0_flag00001001 ( or ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state3_pp0_stage0_iter1 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state6_pp0_stage0_iter4 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_114_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>16</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>13</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_120_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>68</second>
</item>
<item>
<first>LUT</first>
<second>26</second>
</item>
</second>
</item>
<item>
<first>p_413_fu_194_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>p_429_fu_282_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>10</second>
</item>
<item>
<first>(1P1)</first>
<second>10</second>
</item>
<item>
<first>FF</first>
<second>35</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>p_461_fu_331_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>p_469_fu_343_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>12</second>
</item>
<item>
<first>(1P1)</first>
<second>12</second>
</item>
<item>
<first>FF</first>
<second>41</second>
</item>
<item>
<first>LUT</first>
<second>17</second>
</item>
</second>
</item>
<item>
<first>tmp1_fu_322_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp2_fu_302_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>10</second>
</item>
<item>
<first>(1P1)</first>
<second>10</second>
</item>
<item>
<first>FF</first>
<second>35</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>tmp3_fu_270_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>tmp_fu_222_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>9</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>7</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>21</second>
</item>
<item>
<first>(2Count)</first>
<second>42</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_hw_input_stencil_stream_to_mul_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_mul_stencil_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>19</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter2</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter3</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter4</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_pp0_iter2_tmp_9_reg_378</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_354</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>21</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>p_413_reg_368</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_429_reg_393</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>10</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>p_461_reg_403</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>p_463_reg_363</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp2_reg_398</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>10</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>tmp3_reg_388</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp_9_reg_378</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_reg_373</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp_s_reg_383</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>10</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>exitcond_flatten_fu_114_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_120_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>p_413_fu_194_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_429_fu_282_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_461_fu_331_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_469_fu_343_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp1_fu_322_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp2_fu_302_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_fu_270_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_fu_222_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>7</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</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>4</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>8</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>5</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_237">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>13</item>
<item>59</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>43</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>41</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>exitcond_flatten_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_399_fu_126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>p_404_cast_fu_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>p_411_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>p_412_cast_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>p_413_cast_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_413_fu_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_415_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_420_cast_cast_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_427_fu_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_428_cast_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_429_cast_fu_308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_429_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_435_fu_311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_436_cast_fu_318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>p_443_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>p_444_cast_cast_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>p_447_fu_148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>p_452_cast_cast_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>p_459_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_460_cast_cast_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>p_461_cast_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_461_fu_331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_463_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>p_468_cast_fu_337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>p_469_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp1_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp2_cast_fu_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp2_fu_302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_cast_fu_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp3_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_3_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_7_fu_172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_8_fu_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_9_fu_228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_cast_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_fu_238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_value_V_7_fu_349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_59_write_fu_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_value_V_read_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</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="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_413_reg_368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_429_reg_393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_461_reg_403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_463_reg_363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp2_reg_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_reg_388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_9_reg_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_reg_373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_reg_383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>p_hw_input_stencil_stream_to_mul_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</second>
</item>
<item>
<first>p_mul_stencil_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="59" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.814713 | 132 | 0.442656 |
4d4d3f42f4aa834201918370d4561c000a119feb | 244 | adb | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_renaming.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_renaming.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_renaming.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | procedure Function_Renaming is
function Increment (I : Integer) return Integer is
begin
return I + 1;
end Increment;
function RenamedIncrement (NewI : Integer) return Integer renames Increment;
begin
null;
end Function_Renaming;
| 22.181818 | 78 | 0.762295 |
a134ad56773e3a8d393b4855a8c3c4ce31a6799e | 4,077 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2009-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 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/>.
-- This program declares a bunch of unconstrained objects and
-- discrinimated records; the goal is to check that GDB does not crash
-- when printing them even if they are not initialized.
with Parse_Controlled;
procedure Parse is -- START
A : aliased Integer := 1;
type Access_Type is access all Integer;
type String_Access is access String;
type My_Record is record
Field1 : Access_Type;
Field2 : String (1 .. 2);
end record;
type Discriminants_Record (A : Integer; B : Boolean) is record
C : Float;
end record;
Z : Discriminants_Record := (A => 1, B => False, C => 2.0);
type Variable_Record (A : Boolean := True) is record
case A is
when True =>
B : Integer;
when False =>
C : Float;
D : Integer;
end case;
end record;
Y : Variable_Record := (A => True, B => 1);
Y2 : Variable_Record := (A => False, C => 1.0, D => 2);
Nv : Parse_Controlled.Null_Variant;
type Union_Type (A : Boolean := False) is record
case A is
when True => B : Integer;
when False => C : Float;
end case;
end record;
pragma Unchecked_Union (Union_Type);
Ut : Union_Type := (A => True, B => 3);
type Tagged_Type is tagged record
A : Integer;
B : Character;
end record;
Tt : Tagged_Type := (A => 2, B => 'C');
type Child_Tagged_Type is new Tagged_Type with record
C : Float;
end record;
Ctt : Child_Tagged_Type := (Tt with C => 4.5);
type Child_Tagged_Type2 is new Tagged_Type with null record;
Ctt2 : Child_Tagged_Type2 := (Tt with null record);
type My_Record_Array is array (Natural range <>) of My_Record;
W : My_Record_Array := ((Field1 => A'Access, Field2 => "ab"),
(Field1 => A'Access, Field2 => "rt"));
type Discriminant_Record (Num1, Num2,
Num3, Num4 : Natural) is record
Field1 : My_Record_Array (1 .. Num2);
Field2 : My_Record_Array (Num1 .. 10);
Field3 : My_Record_Array (Num1 .. Num2);
Field4 : My_Record_Array (Num3 .. Num2);
Field5 : My_Record_Array (Num4 .. Num2);
end record;
Dire : Discriminant_Record (1, 7, 3, 0);
type Null_Variant_Part (Discr : Integer) is record
case Discr is
when 1 => Var_1 : Integer;
when 2 => Var_2 : Boolean;
when others => null;
end case;
end record;
Nvp : Null_Variant_Part (3);
type T_Type is array (Positive range <>) of Integer;
type T_Ptr_Type is access T_Type;
T_Ptr : T_Ptr_Type := new T_Type' (13, 17);
T_Ptr2 : T_Ptr_Type := new T_Type' (2 => 13, 3 => 17);
function Foos return String is
begin
return "string";
end Foos;
My_Str : String := Foos;
type Value_Var_Type is ( V_Null, V_Boolean, V_Integer );
type Value_Type( Var : Value_Var_Type := V_Null ) is
record
case Var is
when V_Null =>
null;
when V_Boolean =>
Boolean_Value : Boolean;
when V_Integer =>
Integer_Value : Integer;
end case;
end record;
NBI_N : Value_Type := (Var => V_Null);
NBI_I : Value_Type := (Var => V_Integer, Integer_Value => 18);
NBI_B : Value_Type := (Var => V_Boolean, Boolean_Value => True);
begin
null;
end Parse;
| 31.122137 | 73 | 0.616875 |
a13ba1c03767e5024ef1e68c7d070abaf0563365 | 1,513 | ads | Ada | software/modules/sdlog.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/modules/sdlog.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/modules/sdlog.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- Project: StratoX
-- System: Stratosphere Balloon Flight Controller
-- Author: Martin Becker ([email protected])
with FAT_Filesystem.Directories.Files;
with Interfaces; use Interfaces;
-- @summary top-level package for reading/writing logfiles to SD card
package SDLog with SPARK_Mode,
Abstract_State => State,
Initializes => State
is
subtype SDLog_Data is FAT_Filesystem.Directories.Files.File_Data;
procedure Init with
Post => Is_Open = False;
-- initialize the SD log
procedure Close with
Post => Is_Open = False;
-- closes the SD log
procedure Start_Logfile
(dirname : String; filename : String; ret : out Boolean);
-- @summary create new logfile
procedure Write_Log (Data : SDLog_Data; n_written : out Integer) with
Pre => Is_Open;
-- @summary write bytes to logfile
procedure Write_Log (S : String; n_written : out Integer) with
Pre => Is_Open;
-- convenience function for Write_Log (File_Data)
procedure Flush_Log;
-- @summary force writing logfile to disk.
-- Not recommended when time is critical!
function Logsize return Unsigned_32;
-- return log size in bytes
function Is_Open return Boolean;
-- return true if logfile is opened
function To_File_Data (S : String) return SDLog_Data;
private
log_open : Boolean := False with Part_Of => State;
SD_Initialized : Boolean := False with Part_Of => State;
Error_State : Boolean := False with Part_Of => State;
end SDLog;
| 28.54717 | 72 | 0.702578 |
a14e453455ba8cf98cd022228b41e27969746548 | 967 | ads | Ada | src/signals.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 263 | 2015-12-30T22:24:04.000Z | 2022-03-25T03:13:52.000Z | src/signals.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 196 | 2016-01-08T19:50:19.000Z | 2022-03-25T22:02:10.000Z | src/signals.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 34 | 2016-03-08T02:43:35.000Z | 2022-03-25T21:51:03.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
-- with Ada.Interrupts.Names;
package Signals is
-- package BRK renames Ada.Interrupts;
-- Returns True if Interrupt signal (control-C) has been detected
function graceful_shutdown_requested return Boolean;
-- Returns True if a second Interrupt signal has been detected
function immediate_termination_requested return Boolean;
private
-- Disable SIGINT capture until it can work with the builders
-- pragma Unreserve_All_Interrupts;
--
-- protected Signal_Handler is
--
-- procedure capture_control_c;
-- pragma Attach_Handler (capture_control_c, BRK.Names.SIGINT);
--
-- -- procedure capture_terminate;
-- -- pragma Attach_Handler (capture_terminate, BRK.Names.SIGTERM);
--
-- end Signal_Handler;
control_c_break : Boolean := False;
seriously_break : Boolean := False;
end Signals;
| 26.861111 | 75 | 0.716649 |
4d97fa13abc89736fe0c00c699b2569107e2316e | 2,358 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36172c.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/c3/c36172c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36172c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C36172C.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 NO EXCEPTION IS RAISED FOR A NULL ARRAY WHOSE DIFFERENCE
-- IN BOUNDS LIES OUTSIDE THE INDEX BASE TYPE.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- JBG 6/5/85
-- JRL 03/30/93 REMOVED NUMERIC_ERROR FROM TEST.
WITH REPORT; USE REPORT;
PROCEDURE C36172C IS
BEGIN
TEST ("C36172C", "CHECK THAT NO EXCEPTION IS RAISED FOR A NULL " &
"ARRAY WHOSE DIFFERENCE IN BOUNDS LIES OUTSIDE " &
"THE INDEX BASE TYPE");
BEGIN
DECLARE
V : STRING (INTEGER'LAST .. -2);
BEGIN
IF NOT EQUAL (V'FIRST, V'FIRST) THEN
FAILED ("IMPOSSIBLE");
END IF;
END;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED");
WHEN OTHERS =>
FAILED ("OTHER EXCEPTION RAISED");
END;
RESULT;
END C36172C;
| 39.966102 | 79 | 0.611111 |
0bce01f2f792de85b142f4240a8b2b97655892ee | 798 | ads | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/unc_arr_ptr_in_var_rec/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/unc_arr_ptr_in_var_rec/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/unc_arr_ptr_in_var_rec/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2012-2016 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/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
| 39.9 | 73 | 0.738095 |
0bbd78736dcf5b27114e017d47c018b11ddcedef | 5,889 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname-uf.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname-uf.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname-uf.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- F N A M E . U F --
-- --
-- S p e c --
-- --
-- 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. 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. --
-- --
------------------------------------------------------------------------------
-- This child package contains the routines to translate a unit name to
-- a file name taking into account Source_File_Name pragmas. It also
-- contains the auxiliary routines used to record data from the pragmas.
-- Note: the reason we split this into a child unit is that the routines
-- for unit name translation have a significant number of additional
-- dependencies, including osint, and hence sdefault. There are a number
-- of tools that use utility subprograms in the Fname parent, but do not
-- need the functionality in this child package (and certainly do not want
-- to deal with the extra dependencies).
with Casing; use Casing;
with Types; use Types;
package Fname.UF is
-----------------
-- Subprograms --
-----------------
type Expected_Unit_Type is (Expect_Body, Expect_Spec, Unknown);
-- Return value from Get_Expected_Unit_Type
function Get_Expected_Unit_Type
(Fname : File_Name_Type) return Expected_Unit_Type;
-- If possible, determine whether the given file name corresponds to a unit
-- that is a spec or body (e.g. by examining the extension). If this cannot
-- be determined with the file naming conventions in use, then the returned
-- value is set to Unknown.
function Get_File_Name
(Uname : Unit_Name_Type;
Subunit : Boolean;
May_Fail : Boolean := False) return File_Name_Type;
-- This function returns the file name that corresponds to a given unit
-- name, Uname. The Subunit parameter is set True for subunits, and false
-- for all other kinds of units. The caller must ensure that the unit name
-- meets the requirements given in package Uname.
--
-- When May_Fail is True, if the file cannot be found, this function
-- returns No_File. When it is False, if the file cannot be found,
-- a file name compatible with one pattern Source_File_Name pragma is
-- returned.
function Get_Unit_Index (Uname : Unit_Name_Type) return Nat;
-- If there is a specific Source_File_Name pragma for this unit, then
-- return the corresponding unit index value. Return 0 if no index given.
procedure Initialize;
-- Initialize internal tables. This is called automatically when the
-- package body is elaborated, so an explicit call to Initialize is
-- only required if it is necessary to reinitialize the source file
-- name pragma tables.
procedure Lock;
-- Lock tables before calling back end
function File_Name_Of_Spec (Name : Name_Id) return File_Name_Type;
-- Returns the file name that corresponds to the spec of a given unit
-- name. The unit name here is not encoded as a Unit_Name_Type, but is
-- rather just a normal form name in lower case, e.g. "xyz.def".
function File_Name_Of_Body (Name : Name_Id) return File_Name_Type;
-- Returns the file name that corresponds to the body of a given unit
-- name. The unit name here is not encoded as a Unit_Name_Type, but is
-- rather just a normal form name in lower case, e.g. "xyz.def".
procedure Set_File_Name
(U : Unit_Name_Type;
F : File_Name_Type;
Index : Nat);
-- Make association between given unit name, U, and the given file name,
-- F. This is the routine called to process a Source_File_Name pragma.
-- Index is the value from the index parameter of the pragma if present
-- and zero if no index parameter is present.
procedure Set_File_Name_Pattern
(Pat : String_Ptr;
Typ : Character;
Dot : String_Ptr;
Cas : Casing_Type);
-- This is called to process a Source_File_Name pragma whose first
-- argument is a file name pattern string. Pat is this pattern string,
-- which contains an asterisk to correspond to the unit. Typ is one of
-- 'b'/'s'/'u' for body/spec/subunit, Dot is the separator string
-- for child/subunit names, and Cas is one of Lower/Upper/Mixed
-- indicating the required case for the file name.
end Fname.UF;
| 51.208696 | 79 | 0.598574 |
0b872b1dfe9be4646afc9c08f9320ce33c956aeb | 2,375 | ads | Ada | src/secret-values.ads | stcarrez/ada-libsecret | 68be85771a11f6fa0236104999855d09daf68b89 | [
"Apache-2.0"
] | 2 | 2017-06-23T21:23:54.000Z | 2019-02-09T22:21:59.000Z | src/secret-values.ads | stcarrez/ada-libsecret | 68be85771a11f6fa0236104999855d09daf68b89 | [
"Apache-2.0"
] | null | null | null | src/secret-values.ads | stcarrez/ada-libsecret | 68be85771a11f6fa0236104999855d09daf68b89 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- secret-values -- Ada wrapper for Secret Service
-- Copyright (C) 2017 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.
-----------------------------------------------------------------------
-- === Secret Values ===
-- A secret value is represented by the <tt>Secret_Type</tt> type. The value is internally
-- held and managed by the libsecret in some secure memory region. The secret value is
-- associated with a content type that can be retrieved as well. The Ada library only creates
-- secret values with the "text/plain" content type.
--
-- A secret value is only copied by reference that is the secret value stored in the secure
-- memory region is shared among different <tt>Secret_Type</tt> instances. A secret value
-- cannot be modified once it is created.
--
-- To create a secret value, you can use the <tt>Create</tt> function as follows:
--
-- Value : Secret.Values.Secret_Type := Secret.Values.Create ("my-secret-password");
--
package Secret.Values is
-- Represents a value returned by the secret server.
type Secret_Type is new Object_Type with null record;
-- Create a value with the default content type text/plain.
function Create (Value : in String) return Secret_Type
with Post => not Create'Result.Is_Null;
-- Get the value content type.
function Get_Content_Type (Value : in Secret_Type) return String
with Pre => not Value.Is_Null;
-- Get the value as a string.
function Get_Value (Value : in Secret_Type) return String
with Pre => not Value.Is_Null;
private
overriding
procedure Adjust (Object : in out Secret_Type);
overriding
procedure Finalize (Object : in out Secret_Type);
end Secret.Values;
| 40.254237 | 95 | 0.68 |
4d482b3aa4b4b15d8d8cf515e66e4d618e5fcaa9 | 2,663 | ads | Ada | bb-runtimes/src/trap_dump__aarch64.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/trap_dump__aarch64.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/trap_dump__aarch64.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- Copyright (C) 2016-2017, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Interfaces; use Interfaces;
package Trap_Dump is
pragma No_Elaboration_Code_All;
-- CPU registers saved in exception handler
type X_Regs is array (0 .. 31) of Unsigned_64;
pragma Suppress_Initialization (X_Regs);
type Registers_List is record
Xr : X_Regs;
end record;
pragma Convention (C, Registers_List);
pragma Suppress_Initialization (Registers_List);
type Registers_List_Acc is access Registers_List;
procedure Dump (Regs : Registers_List_Acc; Id : Natural);
pragma Export (C, Dump, "__trap_dump");
-- Called from hardware exception
end Trap_Dump;
| 53.26 | 78 | 0.47991 |
1235f23a56e7fa3d2efb721b06ff22b175696a52 | 3,013 | ads | Ada | src/gl/interface/gl-fixed-textures.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/interface/gl-fixed-textures.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/interface/gl-fixed-textures.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 20 | 2015-03-17T07:15:57.000Z | 2022-02-02T17:12:11.000Z | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Low_Level;
with GL.Types.Colors;
package GL.Fixed.Textures is
pragma Preelaborate;
type Texture_Function is (Add, Blend, Replace, Modulate, Decal, Combine);
type Combine_Function is (Add, Replace, Modulate, Subtract, Add_Signed,
Interpolate, Dot3_RGB, Dot3_RGBA);
-- needs to be declared here because of following subtype declaration
for Combine_Function use (Add => 16#0104#,
Replace => 16#1E01#,
Modulate => 16#2100#,
Subtract => 16#84E7#,
Add_Signed => 16#8574#,
Interpolate => 16#8575#,
Dot3_RGB => 16#86AE#,
Dot3_RGBA => 16#86AF#);
for Combine_Function'Size use Low_Level.Enum'Size;
subtype Alpha_Combine_Function is Combine_Function range Add .. Interpolate;
type Source_Kind is (Texture, Constant_Src, Primary_Color, Previous);
subtype Scaling_Factor is Double range 1.0 .. 4.0;
type Source_Index is range 0 .. 2;
procedure Set_Tex_Function (Func : Texture_Function);
function Tex_Function return Texture_Function;
procedure Set_RGB_Combine (Func : Combine_Function);
function RGB_Combine return Combine_Function;
procedure Set_Alpha_Combine (Func : Alpha_Combine_Function);
function Alpha_Combine return Alpha_Combine_Function;
procedure Set_RGB_Source (Source : Source_Kind; Index : Source_Index);
function RGB_Source (Index : Source_Index) return Source_Kind;
procedure Set_Alpha_Source (Source : Source_Kind; Index : Source_Index);
function Alpha_Source (Index : Source_Index) return Source_Kind;
procedure Set_RGB_Scale (Value : Scaling_Factor);
function RGB_Scale return Scaling_Factor;
procedure Set_Alpha_Scale (Value : Scaling_Factor);
function Alpha_Scale return Scaling_Factor;
procedure Set_LoD_Bias (Value : Double);
function LoD_Bias return Double;
procedure Set_Env_Color (Value : Colors.Color);
function Env_Color return Colors.Color;
procedure Toggle_Point_Sprite_Coord_Replace (Enabled : Boolean);
function Point_Sprite_Coord_Replace return Boolean;
private
for Texture_Function use (Add => 16#0104#,
Blend => 16#0BE2#,
Replace => 16#1E01#,
Modulate => 16#2100#,
Decal => 16#2101#,
Combine => 16#8570#);
for Texture_Function'Size use Low_Level.Enum'Size;
for Source_Kind use (Texture => 16#1702#,
Constant_Src => 16#8576#,
Primary_Color => 16#8577#,
Previous => 16#8578#);
for Source_Kind'Size use Low_Level.Enum'Size;
end GL.Fixed.Textures;
| 38.139241 | 79 | 0.627614 |
12a74aae08daf34dadcdf4533c22cd4f1a2ea08c | 3,049 | ads | Ada | src/audio-wavefiles-generic_float_pcm_io.ads | Ada-Audio/wavefiles | 8e1162c5b9dc604a835f60be6a78e8f9d3c85052 | [
"MIT"
] | 10 | 2016-02-29T09:35:56.000Z | 2020-05-16T02:55:20.000Z | src/audio-wavefiles-generic_float_pcm_io.ads | gusthoff/wavefiles | 8e1162c5b9dc604a835f60be6a78e8f9d3c85052 | [
"MIT"
] | null | null | null | src/audio-wavefiles-generic_float_pcm_io.ads | gusthoff/wavefiles | 8e1162c5b9dc604a835f60be6a78e8f9d3c85052 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- THIS IS AN AUTOMATICALLY GENERATED FILE! DO NOT EDIT! --
-- --
-- WAVEFILES --
-- --
-- Wavefile I/O operations for PCM buffers --
-- --
-- The MIT License (MIT) --
-- --
-- Copyright (c) 2015 -- 2020 Gustavo A. Hoffmann --
-- --
-- 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 PCM_Sample is digits <>;
type Channel_Range is (<>);
type PCM_MC_Sample is array (Channel_Range range <>) of PCM_Sample;
package Audio.Wavefiles.Generic_Float_PCM_IO is
function Get
(WF : in out Wavefile) return PCM_MC_Sample
with Inline, Pre => Mode (WF) = In_File;
procedure Get
(WF : in out Wavefile;
PCM : out PCM_MC_Sample)
with Inline, Pre => Mode (WF) = In_File;
procedure Put
(WF : in out Wavefile;
PCM : PCM_MC_Sample)
with Pre => Mode (WF) = Out_File;
end Audio.Wavefiles.Generic_Float_PCM_IO;
| 56.462963 | 78 | 0.442768 |
12d015ef11dd2e9ea201bdab2bd59457b0b60003 | 5,415 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-rbtgso.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/a-rbtgso.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-rbtgso.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_SET_OPERATIONS --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- Tree_Type is used to implement ordered containers. This package declares
-- set-based tree operations.
with Ada.Containers.Red_Black_Trees.Generic_Operations;
generic
with package Tree_Operations is new Generic_Operations (<>);
use Tree_Operations.Tree_Types;
with procedure Insert_With_Hint
(Dst_Tree : in out Tree_Type;
Dst_Hint : Node_Access;
Src_Node : Node_Access;
Dst_Node : out Node_Access);
with function Copy_Tree (Source_Root : Node_Access)
return Node_Access;
with procedure Delete_Tree (X : in out Node_Access);
with function Is_Less (Left, Right : Node_Access) return Boolean;
with procedure Free (X : in out Node_Access);
package Ada.Containers.Red_Black_Trees.Generic_Set_Operations is
pragma Pure;
procedure Union (Target : in out Tree_Type; Source : Tree_Type);
-- Attempts to insert each element of Source in Target. If Target is
-- busy then Program_Error is raised. We say "attempts" here because
-- if these are unique-element sets, then the insertion should fail
-- (not insert a new item) when the insertion item from Source is
-- equivalent to an item already in Target. If these are multisets
-- then of course the attempt should always succeed.
function Union (Left, Right : Tree_Type) return Tree_Type;
-- Makes a copy of Left, and attempts to insert each element of
-- Right into the copy, then returns the copy.
procedure Intersection (Target : in out Tree_Type; Source : Tree_Type);
-- Removes elements from Target that are not equivalent to items in
-- Source. If Target is busy then Program_Error is raised.
function Intersection (Left, Right : Tree_Type) return Tree_Type;
-- Returns a set comprising all the items in Left equivalent to items in
-- Right.
procedure Difference (Target : in out Tree_Type; Source : Tree_Type);
-- Removes elements from Target that are equivalent to items in Source. If
-- Target is busy then Program_Error is raised.
function Difference (Left, Right : Tree_Type) return Tree_Type;
-- Returns a set comprising all the items in Left not equivalent to items
-- in Right.
procedure Symmetric_Difference
(Target : in out Tree_Type;
Source : Tree_Type);
-- Removes from Target elements that are equivalent to items in Source, and
-- inserts into Target items from Source not equivalent elements in
-- Target. If Target is busy then Program_Error is raised.
function Symmetric_Difference (Left, Right : Tree_Type) return Tree_Type;
-- Returns a set comprising the union of the elements in Left not
-- equivalent to items in Right, and the elements in Right not equivalent
-- to items in Left.
function Is_Subset (Subset : Tree_Type; Of_Set : Tree_Type) return Boolean;
-- Returns False if Subset contains at least one element not equivalent to
-- any item in Of_Set; returns True otherwise.
function Overlap (Left, Right : Tree_Type) return Boolean;
-- Returns True if at least one element of Left is equivalent to an item in
-- Right; returns False otherwise.
end Ada.Containers.Red_Black_Trees.Generic_Set_Operations;
| 50.607477 | 79 | 0.555679 |
a14ad51b110f47b9a686b444f895191421a28c7a | 1,540 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_is_list_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_is_list_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_is_list_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_is_list_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
ret_val : aliased xcb.xcb_glx_bool32_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_is_list_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_is_list_reply_t.Item,
Element_Array => xcb.xcb_glx_is_list_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_is_list_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_is_list_reply_t.Pointer,
Element_Array => xcb.xcb_glx_is_list_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_is_list_reply_t;
| 28 | 76 | 0.663636 |
065a8ecfcfdcc4c03e7ccb45b62f2d68951b966e | 10,126 | ads | Ada | workers.ads | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 13 | 2021-09-28T18:14:32.000Z | 2022-02-09T17:48:53.000Z | workers.ads | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 9 | 2021-09-28T19:18:25.000Z | 2022-01-14T22:54:06.000Z | workers.ads | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 1 | 2021-10-21T21:19:08.000Z | 2021-10-21T21:19:08.000Z | ------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2019-2021, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This package contains the core worker pool which executes queued
-- "work orders".
--
-- The intent is that "work orders" are used internally within various
-- subsystems, rather than acting as a general calling convention.
--
-- In general, derrivatives of Work_Order should not appear in package
-- specifications (except in private parts or private packages)
with Ada.Containers;
with Progress;
package Workers is
-----------------
-- Work Orders --
-----------------
type Work_Order is abstract tagged
record
Tracker: Progress.Progress_Tracker_Access := null;
-- If non-null, the Work_Order will invoke Increment_Completed_Items
-- on the successful completion of the Order, or
-- Increment_Failed_Items otherwise
end record;
-- Any derrivative of the Work_Order interface may be submitted to
-- Queue_Order for a Worker task to call Execute on the order.
function Image (Order: Work_Order) return String is abstract;
-- Return a string describing the details of the work order, used by
-- work tasks to create reports when Execute raises an exception.
procedure Execute (Order: in out Work_Order) is abstract;
-- Dispatching operation to execute the work of the work order. Called by
-- a worker tasks when executing an order
procedure Phase_Trigger (Order: in out Work_Order) is null;
-- If Order has a non-null tracker, and at completion of the order
-- when the tracker is incremented, if the tracker is completed
-- (Is_Complete) evaluates True, the worker executes Phase_Trigger
--
-- The concept for a phase trigger is essentially equivalent to the join
-- in a fork-join concurrency model.
--
-- If Phase_Trigger raises an exception, the worker files a failure report
-- using image of the triggering order, with a worker note of
-- "Phase Trigger failed"
--
-- Since Phase_Triggers are often used to schedule (enqueue) more work,
-- and since that work can sometimes include deallocating concurrent shared
-- memory for the just completed task, it is important that any work
-- submitted during a phase trigger is not executed until the phase trigger
-- completes. Therefore all workers will be held while a phase trigger
-- executes - again this is conformant with the fork-join model.
--
-- Note that the worker will not interact with tracker after executing
-- an associated Phase_Trigger.
----------------
-- Work Queue --
----------------
subtype Count_Type is Ada.Containers.Count_Type;
use type Count_Type;
procedure Enqueue_Order (Order: in Work_Order'Class);
-- Enqueus a (normal) Work_Order on the work queue.
procedure Defer_Order
(Order : in Work_Order'Class;
Wait_Tracker: not null Progress.Progress_Tracker_Access);
-- Order Deferral
-- ==============
--
-- Each deferred order is dependent on a Progress_Tracker on which the
-- deferred order is waiting completion.
--
-- Deferred orders are intended to act as triggers pending some other
-- process. It is expected that a given Work Order completes a tracker
-- on which a deferred work order is waiting. That/those Work Orders
-- can then be executed. This ensures that the workers are not exhausted
-- blocking on a progress tracker happening inside of a normal work order.
--
-- When submitted, Deferred Orders are enqueued on to the main work queue.
-- When a worker dequeues a Deferred Order, it immediately checks the
-- Wait_Tracker for completion. If the tracker indicates completion,
-- the worker immediately executes the Deferred Order as it would a
-- regular Work Order. If the tracker does not indicate completion, the
-- Order is then enqueued on a separate "deferral queue".
--
-- Every worker that completes any work order always drains the deferral
-- queue back to the main queue, so that each deferred order may then
-- be re-checked.
--
-- The design of this algorithm has a number of features:
--
-- * It ensures that the minimum time is spent re-checking Deferred Orders
-- that likely have not had their tracker completed, and that the Orders
-- that release Deferred Orders will tend to be processed before the
-- related Deferred Order is processed
--
-- * Once the main queue is empty, all workers will wait for new orders to
-- be enqueued, and will not spin, even if there remains Deferred Orders
-- that have not been released. This is desireable because, if such
-- Deferred Orders remained in this case, it should be impossible for
-- them to complete anyways.
--
-- * In theory, any erroneous Deferred Orders (who's tracker will never
-- complete) will accumulate on the deferral queue after the main queue
-- has been empty. This should be easy to spot since a higher-level
-- process will stall on the Deferred Order, but there will not be
-- misleading behaviour such as high CPU usage, or random performance
-- (and potential live lock) due to spinning.
function Queue_Level return Count_Type;
function Peak_Queue_Level return Count_Type;
-- Number of work order in the Queue, or the peak recorded number, not
-- including deferred orders that have been moved to the deferral queue
function Deferred return Count_Type;
function Peak_Deferred return Count_Type;
-- Number of work orders in the deferral queue
-----------------
-- Worker Pool --
-----------------
-- All Workers simply Execute work orders off the Work Queue or Deferral
-- Queue
--
-- Any exception encountered is contained and reported via the failure
-- reporting facilities
subtype Worker_Count is Natural;
task type Worker_Task;
type Worker_Pool is array (Worker_Count range <>) of Worker_Task;
-- The environment task is expected to initialize an appropriate pool of
-- workers
procedure Enable_Completion_Reports;
procedure Disable_Completion_Reports;
-- If enabled, all workers submit a report on completion of a work order.
-- This setting is Disabled by default
procedure Wait_Workers;
procedure Wait_Workers (Timeout: in Duration; Timedout: out Boolean);
-- Wait until all workers are Idle (no more jobs on the work queue),
-- or until Timeout expires
procedure Disband_Workers;
-- Perminantly terminates all worker tasks in the partition.
-- This cannot be reversed.
function Busy_Workers return Worker_Count;
function Peak_Busy_Workers return Worker_Count;
-- Total number of Worker tasks currently executing a Work_Order
end Workers;
| 48.682692 | 78 | 0.603595 |
503a4d2f31238b4bc49cfa8e78fb6e6cee6a0482 | 1,300 | ads | Ada | src/tests/ahven/util-test_caller.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/tests/ahven/util-test_caller.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/tests/ahven/util-test_caller.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- AUnit utils - Helper for writing unit tests
-- Copyright (C) 2009, 2010 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 Ahven.Framework;
with Util.Tests;
generic
type Test_Fixture is new Ahven.Framework.Test_Case with private;
Name : String := "Test";
package Util.Test_Caller is
type Test_Method is access procedure (T : in out Test_Fixture);
procedure Add_Test (Suite : in Util.Tests.Access_Test_Suite;
Test_Name : in String;
Method : in Test_Method);
end Util.Test_Caller;
| 38.235294 | 76 | 0.625385 |
4dbc3112118b244f045cacaa40180506fb1c2e35 | 1,700 | ads | Ada | source/nls/machine-apple-darwin/a-enenna.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/nls/machine-apple-darwin/a-enenna.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/nls/machine-apple-darwin/a-enenna.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- extended unit specialized for Darwin
private with C;
package Ada.Environment_Encoding.Names is
-- Constants for schemes of system-specific text encoding.
pragma Preelaborate;
UTF_8 : Encoding_Id
renames Environment_Encoding.UTF_8;
UTF_16 : Encoding_Id
renames Environment_Encoding.UTF_16;
UTF_32 : Encoding_Id
renames Environment_Encoding.UTF_32;
UTF_16BE : constant Encoding_Id;
UTF_16LE : constant Encoding_Id;
UTF_32BE : constant Encoding_Id;
UTF_32LE : constant Encoding_Id;
Latin_1 : constant Encoding_Id;
Windows_31J : constant Encoding_Id;
EUC_JP : constant Encoding_Id;
private
use type C.char_array;
UTF_16BE : constant Encoding_Id :=
Encoding_Id (System.Native_Environment_Encoding.UTF_16BE);
UTF_16LE : constant Encoding_Id :=
Encoding_Id (System.Native_Environment_Encoding.UTF_16LE);
UTF_32BE : constant Encoding_Id :=
Encoding_Id (System.Native_Environment_Encoding.UTF_32BE);
UTF_32LE : constant Encoding_Id :=
Encoding_Id (System.Native_Environment_Encoding.UTF_32LE);
Latin_1_Name : aliased constant C.char_array (0 .. 10) :=
"ISO-8859-1" & C.char'Val (0);
Latin_1 : constant Encoding_Id := Latin_1_Name (0)'Access;
Windows_31J_Name : aliased constant C.char_array (0 .. 11) :=
"windows-31j" & C.char'Val (0); -- ibm-943_P15A-2003
Windows_31J : constant Encoding_Id := Windows_31J_Name (0)'Access;
EUC_JP_Name : aliased constant C.char_array (0 .. 6) :=
"EUC-JP" & C.char'Val (0); -- ibm-33722_P12A_P12A-2004_U2
EUC_JP : constant Encoding_Id := EUC_JP_Name (0)'Access;
end Ada.Environment_Encoding.Names;
| 32.075472 | 69 | 0.727059 |
0bed92b216405c8cd0759dc79e00dbe6003ea2ac | 11,407 | adb | Ada | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
openGL.Program.lit,
openGL.Palette,
openGL.Shader,
openGL.Buffer.general,
openGL.Attribute,
openGL.Texture,
openGL.Tasks,
openGL.Errors,
GL.Binding,
GL.lean,
GL.Pointers,
Interfaces.C.Strings,
System.storage_Elements;
package body openGL.Geometry.lit_colored_textured
is
use GL.lean,
GL.Pointers,
Interfaces,
System;
------------------
-- Shader Program
--
type program_Id is (rgba_Texture, alpha_Texture);
type Program is
record
vertex_Shader : aliased Shader.item;
fragment_Shader : aliased Shader.item;
Program : openGL.Program.lit.view;
end record;
type Programs is array (program_Id) of aliased Program;
-----------
--- Globals
--
the_Programs : Programs;
Name_1 : constant String := "Site";
Name_2 : constant String := "Normal";
Name_3 : constant String := "Color";
Name_4 : constant String := "Coords";
Name_5 : constant String := "Shine";
Attribute_1_Name : aliased C.char_array := C.to_C (Name_1);
Attribute_2_Name : aliased C.char_array := C.to_C (Name_2);
Attribute_3_Name : aliased C.char_array := C.to_C (Name_3);
Attribute_4_Name : aliased C.char_array := C.to_C (Name_4);
Attribute_5_Name : aliased C.char_array := C.to_C (Name_5);
Attribute_1_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_1_Name'Access);
Attribute_2_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_2_Name'Access);
Attribute_3_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_3_Name'Access);
Attribute_4_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_4_Name'Access);
Attribute_5_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_5_Name'Access);
white_Texture : openGL.Texture.Object;
---------
-- Forge
--
type Geometry_view is access all Geometry.lit_colored_textured.item'Class;
function new_Geometry (texture_is_Alpha : in Boolean) return access Geometry.lit_colored_textured.item'Class
is
use type openGL.Program.lit.view;
procedure define (the_Program : access Program;
use_fragment_Shader : in String)
is
use openGL.Palette,
Attribute.Forge,
system.Storage_Elements;
Sample : Vertex;
Attribute_1 : openGL.Attribute.view;
Attribute_2 : openGL.Attribute.view;
Attribute_3 : openGL.Attribute.view;
Attribute_4 : openGL.Attribute.view;
Attribute_5 : openGL.Attribute.view;
white_Image : constant openGL.Image := (1 .. 2 => (1 .. 2 => +White));
begin
white_Texture := openGL.Texture.Forge.to_Texture (white_Image);
the_Program.Program := new openGL.Program.lit.item;
the_Program. vertex_Shader.define (Shader.Vertex, "assets/opengl/shader/lit_colored_textured.vert");
the_Program.fragment_Shader.define (Shader.Fragment, use_fragment_Shader);
the_Program.Program.define (the_Program. vertex_Shader'Access,
the_Program.fragment_Shader'Access);
the_Program.Program.enable;
Attribute_1 := new_Attribute (Name => Name_1,
gl_Location => the_Program.Program.attribute_Location (Name_1),
Size => 3,
data_Kind => attribute.GL_FLOAT,
Stride => lit_colored_textured.Vertex'Size / 8,
Offset => 0,
Normalized => False);
Attribute_2 := new_Attribute (Name => Name_2,
gl_Location => the_Program.Program.attribute_Location (Name_2),
Size => 3,
data_Kind => attribute.GL_FLOAT,
Stride => lit_colored_textured.Vertex'Size / 8,
Offset => Sample.Normal (1)'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_3 := new_Attribute (Name => Name_3,
gl_Location => the_Program.Program.attribute_Location (Name_3),
Size => 4,
data_Kind => attribute.GL_UNSIGNED_BYTE,
Stride => lit_colored_textured.Vertex'Size / 8,
Offset => Sample.Color.Primary.Red'Address
- Sample.Site (1) 'Address,
Normalized => True);
Attribute_4 := new_Attribute (Name => Name_4,
gl_Location => the_Program.Program.attribute_Location (Name_4),
Size => 2,
data_Kind => attribute.GL_FLOAT,
Stride => lit_colored_textured.Vertex'Size / 8,
Offset => Sample.Coords.S'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_5 := new_Attribute (Name => Name_5,
gl_Location => the_Program.Program.attribute_Location (Name_5),
Size => 1,
data_Kind => attribute.GL_FLOAT,
Stride => lit_colored_textured.Vertex'Size / 8,
Offset => Sample.Shine 'Address
- Sample.Site (1)'Address,
Normalized => False);
the_Program.Program.add (Attribute_1);
the_Program.Program.add (Attribute_2);
the_Program.Program.add (Attribute_3);
the_Program.Program.add (Attribute_4);
the_Program.Program.add (Attribute_5);
glBindAttribLocation (Program => the_Program.Program.gl_Program,
Index => the_Program.Program.Attribute (named => Name_1).gl_Location,
Name => +Attribute_1_Name_ptr);
Errors.log;
glBindAttribLocation (Program => the_Program.Program.gl_Program,
Index => the_Program.Program.Attribute (named => Name_2).gl_Location,
Name => +Attribute_2_Name_ptr);
Errors.log;
glBindAttribLocation (Program => the_Program.Program.gl_Program,
Index => the_Program.Program.Attribute (named => Name_3).gl_Location,
Name => +Attribute_3_Name_ptr);
Errors.log;
glBindAttribLocation (Program => the_Program.Program.gl_Program,
Index => the_Program.Program.Attribute (named => Name_4).gl_Location,
Name => +Attribute_4_Name_ptr);
Errors.log;
glBindAttribLocation (Program => the_Program.Program.gl_Program,
Index => the_Program.Program.Attribute (named => Name_5).gl_Location,
Name => +Attribute_5_Name_ptr);
Errors.log;
end define;
Self : constant Geometry_view := new Geometry.lit_colored_textured.item;
begin
Tasks.check;
if texture_is_Alpha -- Define the shaders and program, if required.
then
if the_Programs (alpha_Texture).Program = null
then
define (the_Programs (alpha_Texture)'Access,
use_fragment_Shader => "assets/opengl/shader/lit_colored_text.frag");
end if;
else
if the_Programs (rgba_Texture).Program = null
then
define (the_Programs (rgba_Texture)'Access,
use_fragment_Shader => "assets/opengl/shader/lit_colored_textured.frag");
end if;
end if;
if texture_is_Alpha
then Self.is_Transparent := True;
Self.Program_is (the_Programs (alpha_Texture).Program.all'Access);
else Self.Program_is (the_Programs ( rgba_Texture).Program.all'Access);
end if;
return Self;
end new_Geometry;
----------
-- Vertex
--
function is_Transparent (Self : in Vertex_array) return Boolean
is
function get_Color (Index : in Index_t) return rgba_Color
is (Self (Index).Color);
function my_Transparency is new get_Transparency (any_Index_t => Index_t,
get_Color => get_Color);
begin
return my_Transparency (Count => Self'Length);
end is_Transparent;
--------------
-- Attributes
--
package openGL_Buffer_of_geometry_Vertices is new Buffer.general (base_Object => Buffer.array_Object,
Index => Index_t,
Element => Vertex,
Element_Array => Vertex_array);
procedure Vertices_are (Self : in out Item; Now : in Vertex_array)
is
use openGL_Buffer_of_geometry_Vertices;
use type Buffer.view;
begin
if Self.Vertices = null
then
self.Vertices := new openGL_Buffer_of_geometry_Vertices.Object' (Forge.to_Buffer (Now,
usage => Buffer.static_Draw));
else
set (openGL_Buffer_of_geometry_Vertices.Object (Self.Vertices.all),
to => Now);
end if;
Self.is_Transparent := is_Transparent (Now);
-- Set the bounds.
--
declare
function get_Site (Index : in Index_t) return Vector_3
is (Now (Index).Site);
function bounding_Box is new get_Bounds (Index_t, get_Site);
begin
Self.Bounds_are (bounding_Box (Count => Now'Length));
end;
end Vertices_are;
overriding
procedure Indices_are (Self : in out Item; Now : in Indices;
for_Facia : in Positive)
is
begin
raise Error with "TODO";
end Indices_are;
overriding
procedure enable_Texture (Self : in Item)
is
use GL,
GL.Binding,
openGL.Texture;
begin
Tasks.check;
glActiveTexture (gl.GL_TEXTURE0);
Errors.log;
if Self.Texture = openGL.Texture.null_Object
then enable (white_Texture);
else enable (Self.Texture);
end if;
end enable_Texture;
end openGL.Geometry.lit_colored_textured;
| 38.537162 | 121 | 0.532918 |
0be98cd8b24716c0b5aaa56f112ec033d963d3ee | 2,552 | adb | Ada | src/tests/bintoasc-testable.adb | jhumphry/Ada_BinToAsc | b1aa44263d03c46ffe32b766ea01a7710dabbd63 | [
"0BSD"
] | null | null | null | src/tests/bintoasc-testable.adb | jhumphry/Ada_BinToAsc | b1aa44263d03c46ffe32b766ea01a7710dabbd63 | [
"0BSD"
] | null | null | null | src/tests/bintoasc-testable.adb | jhumphry/Ada_BinToAsc | b1aa44263d03c46ffe32b766ea01a7710dabbd63 | [
"0BSD"
] | null | null | null | -- BinToAsc_Suite.Misc_Tests
-- Unit tests for BinToAsc
-- Copyright (c) 2015, James Humphry - see LICENSE file for details
with Ada.Characters.Handling;
with AUnit.Assertions;
package body BinToAsc.Testable is
use Ada.Characters.Handling;
use AUnit.Assertions;
---------------------------------
-- Check_Make_Reverse_Alphabet --
---------------------------------
procedure Check_Make_Reverse_Alphabet (T : in out Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
Reversed : Reverse_Alphabet_Lookup;
Valid : constant Alphabet_16 := "0123456789ABCDEF";
Case_Wise : constant Alphabet_16 := "ABCDEFGHijklmnop";
begin
Reversed := Make_Reverse_Alphabet(Valid, True);
Assert((for all I in Valid'Range =>
Reversed(Valid(I)) = I),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for " & String(Valid));
Assert((for all I in Reversed'Range =>
(Reversed(I) = Invalid_Character_Input or else
Valid(Reversed(I)) = I)),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for " & String(Valid));
Reversed := Make_Reverse_Alphabet(Valid, False);
Assert((for all I in Valid'Range =>
Reversed(To_Upper(Valid(I))) = I and
Reversed(To_Lower(Valid(I))) = I),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for case-insensitive " & String(Valid));
Assert((for all I in Reversed'Range =>
(Reversed(I) = Invalid_Character_Input or else
To_Lower(Valid(Reversed(I))) = To_Lower(I))),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for case-insensitive " & String(Valid));
Reversed := Make_Reverse_Alphabet(Case_Wise, True);
Assert((for all I in Case_Wise'Range =>
Reversed(Case_Wise(I)) = I),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for " & String(Case_Wise));
Assert((for all I in Reversed'Range =>
(Reversed(I) = Invalid_Character_Input or else
Case_Wise(Reversed(I)) = I)),
"Make_Reverse_Alphabet does not create an appropriate reverse " &
"lookup table for " & String(Case_Wise));
end Check_Make_Reverse_Alphabet;
end BinToAsc.Testable;
| 36.985507 | 83 | 0.606583 |
fb0d0c0ae12ee1a7a62786324ed986285465e092 | 1,353 | ads | Ada | STM32F4/Temperature/src/temperature-display.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | STM32F4/Temperature/src/temperature-display.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | STM32F4/Temperature/src/temperature-display.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018, Universidad Politécnica de Madrid --
-- --
-- This 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. This software 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. See the GNU General Public --
-- License for more details. You should have received a copy of the GNU --
-- General Public License distributed with this software; see file --
-- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy --
-- of the license.
-- --
------------------------------------------------------------------------------
package Temperature.Display is
-- write a temperature value on the system screen
procedure Put (T : Temperature);
end Temperature.Display;
| 56.375 | 78 | 0.495935 |
a12ad364b57ca1bcea15d159f9464857e307b1e0 | 2,695 | ads | Ada | src/giza-bitmaps-indexed_8bits.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 7 | 2017-10-18T02:40:24.000Z | 2020-12-19T22:41:19.000Z | src/giza-bitmaps-indexed_8bits.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | null | null | null | src/giza-bitmaps-indexed_8bits.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 2 | 2019-05-06T08:30:26.000Z | 2020-11-22T11:27:27.000Z | ------------------------------------------------------------------------------
-- --
-- Giza --
-- --
-- Copyright (C) 2016 Fabien Chouteau ([email protected]) --
-- --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
package Giza.Bitmaps.Indexed_8bits is
new Giza.Bitmaps.Indexed_Bitmaps (Unsigned_8);
| 72.837838 | 78 | 0.479406 |
065d7e449a22009e14edfd827065760ccaa0ca4d | 1,710 | ads | Ada | src/transport-serial.ads | hgrodriguez/embedded-dashboard-console | af6ac23984ede09cd8505f101e8625b6aca3742b | [
"BSD-3-Clause"
] | null | null | null | src/transport-serial.ads | hgrodriguez/embedded-dashboard-console | af6ac23984ede09cd8505f101e8625b6aca3742b | [
"BSD-3-Clause"
] | null | null | null | src/transport-serial.ads | hgrodriguez/embedded-dashboard-console | af6ac23984ede09cd8505f101e8625b6aca3742b | [
"BSD-3-Clause"
] | null | null | null | --===========================================================================
--
-- This package provides the serial specific procedures for input requests
--
--===========================================================================
--
-- Copyright 2021 (C) Holger Rodriguez
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with Evaluate.LEDs;
with Evaluate.Matrices;
package Transport.Serial is
--------------------------------------------------------------------------
-- Initalize the UART for operation
--------------------------------------------------------------------------
procedure Initialize;
--------------------------------------------------------------------------
-- Get the first character in the communication to determine the area
-- It will return Area_Selector'(None), in case there was a timeout
-- without receiving any input
--------------------------------------------------------------------------
function Get_Area_Selector return Area_Selector;
--------------------------------------------------------------------------
-- Case Get_Area_Selector:
-- when 'L' == LED => Reads the full instruction for LED control
--------------------------------------------------------------------------
function Get_LED_Instruction return Evaluate.LEDs.LED_Instruction;
--------------------------------------------------------------------------
-- Case Get_Area_Selector:
-- when 'M' == LED => Reads the full instruction for Matrix control
--------------------------------------------------------------------------
function Get_Matrix_Instruction return Evaluate.Matrices.Matrix_Instruction;
end Transport.Serial;
| 41.707317 | 79 | 0.400585 |
a176d3d581df76bc834d85a742364a88ed0bdda7 | 20,656 | ads | Ada | thirdparty/adasdl/thin/adasdl/AdaSDL/binding/sdl-events.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL/binding/sdl-events.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL/binding/sdl-events.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null |
-- ----------------------------------------------------------------- --
-- AdaSDL --
-- Binding to Simple Direct Media Layer --
-- Copyright (C) 2001 A.M.F.Vargas --
-- Antonio M. F. Vargas --
-- Ponta Delgada - Azores - Portugal --
-- http://www.adapower.net/~avargas --
-- E-mail: [email protected] --
-- ----------------------------------------------------------------- --
-- --
-- This library 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 2 of the License, 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 along with this library; if not, write to the --
-- Free Software Foundation, Inc., 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. --
-- ----------------------------------------------------------------- --
-- **************************************************************** --
-- This is an Ada binding to SDL ( Simple DirectMedia Layer from --
-- Sam Lantinga - www.libsld.org ) --
-- **************************************************************** --
-- In order to help the Ada programmer, the comments in this file --
-- are, in great extent, a direct copy of the original text in the --
-- SDL header files. --
-- **************************************************************** --
with System;
with Interfaces.C;
with SDL.Types; use SDL.Types;
with SDL.Keyboard;
with SDL.Active;
with SDL.Mouse;
with SDL.Joystick;
package SDL.Events is
type Event_Type is new Interfaces.Unsigned_8;
for Event_Type'Size use 8;
-- pragma Convention (C, Event_Type);
package I renames Interfaces;
package M renames SDL.Mouse;
package Jy renames SDL.Joystick;
-- ------------------
-- Orginal C Event enumerations
-- ------------------
-- Unused (do not remove)
NOEVENT : constant Event_Type := 0;
-- Application loses/gains visibility
ISACTIVEEVENT : constant Event_Type := 1;
-- Keys pressed
KEYDOWN : constant Event_Type := 2;
-- Keys released
KEYUP : constant Event_Type := 3;
-- Mouse moved
MOUSEMOTION : constant Event_Type := 4;
-- Mouse button pressed
MOUSEBUTTONDOWN : constant Event_Type := 5;
-- Mouse button released
MOUSEBUTTONUP : constant Event_Type := 6;
-- Joystick axis motion
JOYAXISMOTION : constant Event_Type := 7;
-- Joystick trackball motion
JOYBALLMOTION : constant Event_Type := 8;
-- Joystick hat position change
JOYHATMOTION : constant Event_Type := 9;
-- Joystick button pressed
JOYBUTTONDOWN : constant Event_Type := 10;
-- Joystick button released
JOYBUTTONUP : constant Event_Type := 11;
-- User-requested quit
QUIT : constant Event_Type := 12;
-- System specific event
ISSYSWMEVENT : constant Event_Type := 13;
-- Reserved for future use..
EVENT_RESERVEDA : constant Event_Type := 14;
-- Reserved for future use..
EVENT_RESERVEDB : constant Event_Type := 15;
-- User resized video mode
VIDEORESIZE : constant Event_Type := 16;
-- Reserved for future use..
EVENT_RESERVED1 : constant Event_Type := 17;
-- Reserved for future use..
EVENT_RESERVED2 : constant Event_Type := 18;
-- Reserved for future use..
EVENT_RESERVED3 : constant Event_Type := 19;
-- Reserved for future use..
EVENT_RESERVED4 : constant Event_Type := 20;
-- Reserved for future use..
EVENT_RESERVED5 : constant Event_Type := 21;
-- Reserved for future use..
EVENT_RESERVED6 : constant Event_Type := 22;
-- Reserved for future use..
EVENT_RESERVED7 : constant Event_Type := 23;
-- Events USEREVENT through MAXEVENTS-1 are for your use
ISUSEREVENT : constant Event_Type := 24;
-- This last event is only for bounding internal arrays
-- It is the number of bits in the event mask datatype -- Uint32
NUMEVENTS : constant Event_Type := 32;
-- Predefined event masks
type Event_Mask is mod 2**Integer (NUMEVENTS);
ACTIVEEVENTMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (ISACTIVEEVENT)));
KEYDOWNMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (KEYDOWN)));
KEYUPMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (KEYUP)));
MOUSEMOTIONMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEMOTION)));
MOUSEBUTTONDOWNMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEBUTTONDOWN)));
MOUSEBUTTONUPMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEBUTTONUP)));
MOUSEEVENTMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEMOTION))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEBUTTONDOWN))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (MOUSEBUTTONUP)));
JOYAXISMOTIONMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYAXISMOTION)));
JOYBALLMOTIONMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBALLMOTION)));
JOYHATMOTIONMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYHATMOTION)));
JOYBUTTONDOWNMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBUTTONDOWN)));
JOYBUTTONUPMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBUTTONUP)));
JOYEVENTMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYAXISMOTION))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBALLMOTION))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYHATMOTION))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBUTTONDOWN))) or
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (JOYBUTTONUP)));
VIDEORESIZEMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (VIDEORESIZE)));
QUITMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (QUIT)));
SYSWMEVENTMASK : constant Event_Mask :=
Event_Mask (I.Shift_Left (I.Unsigned_32 (1), Integer (ISSYSWMEVENT)));
ALLEVENTS : constant Event_Mask := 16#FFFFFFFF#;
-- Application visibility event structure
type ActiveEvent is
record
-- the_type, -- ISACTIVEEVENT
the_type : Event_Type; -- ISACTIVEEVENT;
gain, -- Whether given states were gained or lost (1/0)
state : SDL.Active.Active_State; -- A mask of the focus states
end record;
pragma Convention (C, ActiveEvent);
-- Keyboard event structure
type KeyboardEvent is
record
the_type : Event_Type; -- KEYDOWN or KEYUP
which : Uint8; -- The keyboard device index
state : Uint8; -- PRESSED or RELEASED
keysym : aliased SDL.Keyboard.keysym;
end record;
pragma Convention (C, KeyboardEvent);
-- Mouse motion event structure
type MouseMotionEvent is
record
the_type : Event_Type; -- MOUSEMOTION
which : Uint8; -- The mouse device index
state : Uint8; -- The current state
x, y : Uint16; -- The X/Y coordinates of the mouse
xrel : Sint16; -- The relative motion in the X direction
yrel : Sint16; -- The relative motion in the Y direction
end record;
pragma Convention (C, MouseMotionEvent);
-- Mouse button event structure
type MouseButtonEvent is
record
the_type : Event_Type; -- MOUSEBUTTONDOWN or MOUSEBUTTONUP
which : Uint8; -- The mouse device index
button : Uint8; -- The mouse button index
state : M.Mouse_Button_State; -- PRESSED or RELEASED
x, y : Uint16; -- The X/Y coordinates of the mouse at
-- press time
end record;
pragma Convention (C, MouseButtonEvent);
-- Joystick axis motion event structure
type JoyAxisEvent is
record
the_type : Event_Type; -- JOYAXISMOTION
which : Uint8; -- The joystick device index
axis : Uint8; -- The joystick axis index
value : Sint16; -- The axis value (range: -32768 to 32767)
end record;
pragma Convention (C, JoyAxisEvent);
-- Joystick trackball motion event structure
type JoyBallEvent is
record
the_type : Event_Type; -- JOYBALLMOTION
which : Uint8; -- The joystick device index
ball : Uint8; -- The joystick trackball index
xrel : Sint16; -- The relative motion in the X direction
yrel : Sint16; -- The relative motion in the Y direction
end record;
pragma Convention (C, JoyBallEvent);
-- Joystick hat position change event structure
type JoyHatEvent is
record
the_type : Event_Type; -- JOYHATMOTION
which : Uint8; -- The joystick device index
hat : Uint8; -- The joystick hat index
value : Jy.HAT_State; -- The hat position value
-- 8 1 2
-- 7 0 3
-- 6 5 4
-- Note that zero means the POV is centered.
end record;
pragma Convention (C, JoyHatEvent);
-- Joystick button event structure */
type JoyButtonEvent is
record
the_type : Event_Type; -- JOYBUTTONDOWN or JOYBUTTONUP
which : Uint8; -- The joystick device index
button : Uint8; -- The joystick button index
state : Uint8; -- PRESSED or RELEASED
end record;
pragma Convention (C, JoyButtonEvent);
-- The "window resized" event
-- When you get this event, you are responsible for setting a new video
-- mode with the new width and height.
type ResizeEvent is
record
the_type : Event_Type; -- VIDEORESIZE
w, h : C.int; -- New width and height
end record;
pragma Convention (C, ResizeEvent);
-- The "quit requested" event
type QuitEvent is
record
the_type : Event_Type; -- QUIT
end record;
pragma Convention (C, QuitEvent);
-- A user-defined event type
type UserEvent is
record
the_type : Event_Type; -- USEREVENT through NUMEVENTS-1
code : C.int; -- User defined event code
data1 : void_ptr; -- User defined data pointer
data2 : void_ptr; -- User defined data pointer
end record;
pragma Convention (C, UserEvent);
type SysWMmsg_ptr is new System.Address;
-- If you want to use this event, you should use SDL.Syswm
type SysWMEvent is
record
the_type : Event_Type;
msg : SysWMmsg_ptr;
end record;
pragma Convention (C, SysWMEvent);
type Event_Selection is (
Is_Event_Type,
Is_ActiveEvent,
Is_KeyboardEvent,
Is_MouseMotionEvent,
Is_MouseButtonEvent,
Is_JoyAxisEvent,
Is_JoyBallEvent,
Is_JoyHatEvent,
Is_JoyButtonEvent,
Is_ResizeEvent,
Is_QuitEvent,
Is_UserEvent,
Is_SysWMEvent);
-- General event structure
type Event (Event_Selec : Event_Selection := Is_Event_Type) is
record
case Event_Selec is
when Is_Event_Type => the_type : Event_Type;
when Is_ActiveEvent => active : ActiveEvent;
when Is_KeyboardEvent => key : KeyboardEvent;
when Is_MouseMotionEvent => motion : MouseMotionEvent;
when Is_MouseButtonEvent => button : MouseButtonEvent;
when Is_JoyAxisEvent => jaxis : JoyAxisEvent;
when Is_JoyBallEvent => jball : JoyBallEvent;
when Is_JoyHatEvent => jhat : JoyHatEvent;
when Is_JoyButtonEvent => jbutton : JoyButtonEvent;
when Is_ResizeEvent => resize : ResizeEvent;
when Is_QuitEvent => quit : QuitEvent;
when Is_UserEvent => user : UserEvent;
when Is_SysWMEvent => syswm : SysWMEvent;
end case;
end record;
pragma Convention (C, Event);
pragma Unchecked_Union (Event);
type Event_ptr is access all Event;
pragma Convention (C, Event_ptr);
-- -------------------
-- Function prototypes
-- -------------------
-- Pumps the event loop, gathering events from the input devices.
-- This function updates the event queue and internal input device state.
-- This should only be run in the thread that sets the video mode.
procedure PumpEvents;
pragma Import (C, PumpEvents, "SDL_PumpEvents");
-- Checks the event queue for messages and optionally returns them.
-- If 'action' is ADDEVENT, up to 'numevents' events will be added to
-- the back of the event queue.
-- If 'action' is PEEKEVENT, up to 'numevents' events at the front
-- of the event queue, matching 'mask', will be returned and will not
-- be removed from the queue.
-- If 'action' is GETEVENT, up to 'numevents' events at the front
-- of the event queue, matching 'mask', will be returned and will be
-- removed from the queue.
-- This function returns the number of events actually stored, or -1
-- if there was an error. This function is thread-safe.
type eventaction is new C.int;
ADDEVENT : constant := 0;
PEEKEVENT : constant := 1;
GETEVENT : constant := 2;
type Events_Array is array (Natural range <>) of Event;
procedure PeepEventsVP (
result : out C.int;
events : in out Events_Array;
numevents : C.int;
action : eventaction;
mask : Event_Mask);
pragma Import (C, PeepEventsVP, "SDL_PeepEvents");
pragma Import_Valued_Procedure (PeepEventsVP);
-- From Ada this function is to be called only as
-- ... := PeepEvents (null, 0, the_action, the_mask);
-- in other cases use PeepEventsVP.
function PeepEvents (
events : Event_ptr;
numevents : C.int;
action : eventaction;
mask : Event_Mask)
return C.int;
pragma Import (C, PeepEvents, "SDL_PeepEvents");
-- pending events, or 0 if there are none available. If 'event' is not
-- NULL, the next event is removed from the queue and stored in that area.
function PollEvent (the_event : access Event) return C.int;
pragma Import (C, PollEvent, "SDL_PollEvent");
-- Check the pending events. Doesn't remove them.
function Poll_Event return C.int;
pragma Inline (Poll_Event);
-- A corresponding Valued Procedure
procedure PollEventVP (result : out C.int; the_event : in out Event);
pragma Import (C, PollEventVP, "SDL_PollEvent");
pragma Import_Valued_Procedure (PollEventVP);
-- Waits indefinitely for the next available event, returning 1, or 0
-- if there was an error while waiting for events. If 'event' is not
-- NULL, the next event is removed from the queue and stored in that area.
function WaitEvent (event : Event_ptr) return C.int;
procedure WaitEvent (event : Event_ptr);
procedure WaitEvent (the_event : in out Event);
pragma Import (C, WaitEvent, "SDL_WaitEvent");
procedure Wait_Event (
Result : out C.int;
the_event : in out Event);
pragma Import (C, Wait_Event, "SDL_WaitEvent");
pragma Import_Valued_Procedure (Wait_Event);
function Wait_Any_Event return C.int;
pragma Inline (Wait_Any_Event);
-- Add an event to the event queue.
-- This function returns 0, or -1 if the event couldn't be added to
-- the event queue. If the event queue is full, this function fails.
function PushEvent (event : Event_ptr) return C.int;
procedure PushEvent (event : Event_ptr);
function PushEvent (the_event : Event) return C.int;
procedure PushEvent (the_event : Event);
pragma Import (C, PushEvent, "SDL_PushEvent");
-- This function sets up a filter to process all events before they
-- change internal state and are posted to the internal event queue.
-- The filter is protypted as:
type EventFilter_ptr is access function (event : Event_ptr) return C.int;
pragma Convention (C, EventFilter_ptr);
-- If the filter returns 1, then the event will be added to the internal
-- queue. If it returns 0, then the event will be dropped from the queue,
-- but the internal state will still be updated. This allows selective
-- filtering of dynamically arriving events.
-- WARNING: Be very careful of what you do in the event filter function,
-- as it may run in a different thread!
-- There is one caveat when dealing with the QUITEVENT event type. The
-- event filter is only called when the window manager desires to close the
-- application window. If the event filter returns 1, then the window will
-- be closed, otherwise the window will remain open if possible.
-- If the quit event is generated by an interrupt signal, it will bypass
-- the internal queue and be delivered to the application at the next event
-- poll.
procedure SetEventFilter (filter : EventFilter_ptr);
pragma Import (C, SetEventFilter, "SDL_SetEventFilter");
-- Return the current event filter - can be used to "chain" filters.
-- If there is no event filter set, this function returns NULL.
function GetEventFilter return EventFilter_ptr;
pragma Import (C, GetEventFilter, "SDL_GetEventFilter");
-- This function allows you to set the state of processing certain events.
-- If 'state' is set to IGNORE, that event will be automatically dropped
-- from the event queue and will not event be filtered.
-- If 'state' is set to ENABLE, that event will be processed normally.
-- If 'state' is set to QUERY, EventState will return the
-- current processing state of the specified event.
QUERY : constant := -1;
IGNORE : constant := 0;
DISABLE : constant := 0;
ENABLE : constant := 1;
function EventState (
the_type : Event_Type;
state : C.int) return Uint8;
procedure EventState (
the_type : Event_Type;
state : C.int);
pragma Import (C, EventState, "SDL_EventState");
end SDL.Events;
| 42.854772 | 81 | 0.599342 |
a11d715448ebd7feef4e5d3542382b7dfa0b8a5d | 871 | adb | Ada | src/GBA.Timers.adb | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 7 | 2021-04-08T02:32:54.000Z | 2022-02-14T01:21:43.000Z | src/GBA.Timers.adb | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 15 | 2021-04-09T20:13:33.000Z | 2021-12-22T01:03:59.000Z | src/GBA.Timers.adb | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 1 | 2021-06-12T07:48:05.000Z | 2021-06-12T07:48:05.000Z | -- Copyright (c) 2021 Devin Hill
-- zlib License -- see LICENSE for details.
package body GBA.Timers is
function Get_Count (ID : Timer_ID) return Timer_Value is
( Timers (ID).Value );
procedure Set_Initial_Value (ID : Timer_ID; Value : Timer_Value) is
begin
Timers (ID).Value := Value;
end Set_Initial_Value;
procedure Start_Timer (ID : Timer_ID) is
Control : Timer_Control_Info renames Timers (ID).Control_Info;
begin
Control.Enabled := False;
Control.Enabled := True;
end Start_Timer;
procedure Set_Timer_Scale (ID : Timer_ID; Scale : Timer_Scale) is
begin
Timers (ID).Control_Info.Scale := Scale;
end Set_Timer_Scale;
procedure Set_Timer_Increment_Type (ID : Timer_ID; Increment : Timer_Increment_Type) is
begin
Timers (ID).Control_Info.Increment := Increment;
end Set_Timer_Increment_Type;
end GBA.Timers; | 27.21875 | 89 | 0.726751 |
0b297fa79e15f1b9daa7e14edf2eff792bfe28c4 | 5,118 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-pack41.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/s-pack41.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/s-pack41.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 1 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_41 is
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_41;
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;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
------------
-- Get_41 --
------------
function Get_41 (Arr : System.Address; N : Natural) return Bits_41 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Get_41;
------------
-- Set_41 --
------------
procedure Set_41 (Arr : System.Address; N : Natural; E : Bits_41) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Set_41;
end System.Pack_41;
| 43.008403 | 78 | 0.47245 |
237a61469331352e1b48b4ca066044b23e06856f | 20,306 | ads | Ada | include/sf-network-ftp.ads | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 1 | 2017-10-07T06:20:38.000Z | 2017-10-07T06:20:38.000Z | include/sf-network-ftp.ads | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 3 | 2020-09-15T21:19:34.000Z | 2022-03-02T23:13:46.000Z | include/sf-network-ftp.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.Config;
with Sf.Network.IPAddress;
with Sf.Network.Types;
package Sf.Network.Ftp is
use Sf.Config;
use Sf.Network.IPAddress;
use Sf.Network.Types;
-- ////////////////////////////////////////////////////////////
-- /// Enumerate all the FTP file transfer modes
-- ////////////////////////////////////////////////////////////
type sfFtpTransferMode is (sfFtpBinary, sfFtpAscii, sfFtpEbcdic);
-- ////////////////////////////////////////////////////////////
-- /// Enumerate all the valid status codes returned in
-- /// a FTP response
-- ////////////////////////////////////////////////////////////
subtype sfFtpStatus is sfUint32;
sfFtpRestartMarkerReply : constant sfFtpStatus := 110;
sfFtpServiceReadySoon : constant sfFtpStatus := 120;
sfFtpDataConnectionAlreadyOpened : constant sfFtpStatus := 125;
sfFtpOpeningDataConnection : constant sfFtpStatus := 150;
sfFtpOk : constant sfFtpStatus := 200;
sfFtpPointlessCommand : constant sfFtpStatus := 202;
sfFtpSystemStatus : constant sfFtpStatus := 211;
sfFtpDirectoryStatus : constant sfFtpStatus := 212;
sfFtpFileStatus : constant sfFtpStatus := 213;
sfFtpHelpMessage : constant sfFtpStatus := 214;
sfFtpSystemType : constant sfFtpStatus := 215;
sfFtpServiceReady : constant sfFtpStatus := 220;
sfFtpClosingConnection : constant sfFtpStatus := 221;
sfFtpDataConnectionOpened : constant sfFtpStatus := 225;
sfFtpClosingDataConnection : constant sfFtpStatus := 226;
sfFtpEnteringPassiveMode : constant sfFtpStatus := 227;
sfFtpLoggedIn : constant sfFtpStatus := 230;
sfFtpFileActionOk : constant sfFtpStatus := 250;
sfFtpDirectoryOk : constant sfFtpStatus := 257;
sfFtpNeedPassword : constant sfFtpStatus := 331;
sfFtpNeedAccountToLogIn : constant sfFtpStatus := 332;
sfFtpNeedInformation : constant sfFtpStatus := 350;
sfFtpServiceUnavailable : constant sfFtpStatus := 421;
sfFtpDataConnectionUnavailable : constant sfFtpStatus := 425;
sfFtpTransferAborted : constant sfFtpStatus := 426;
sfFtpFileActionAborted : constant sfFtpStatus := 450;
sfFtpLocalError : constant sfFtpStatus := 451;
sfFtpInsufficientStorageSpace : constant sfFtpStatus := 452;
sfFtpCommandUnknown : constant sfFtpStatus := 500;
sfFtpParametersUnknown : constant sfFtpStatus := 501;
sfFtpCommandNotImplemented : constant sfFtpStatus := 502;
sfFtpBadCommandSequence : constant sfFtpStatus := 503;
sfFtpParameterNotImplemented : constant sfFtpStatus := 504;
sfFtpNotLoggedIn : constant sfFtpStatus := 530;
sfFtpNeedAccountToStore : constant sfFtpStatus := 532;
sfFtpFileUnavailable : constant sfFtpStatus := 550;
sfFtpPageTypeUnknown : constant sfFtpStatus := 551;
sfFtpNotEnoughMemory : constant sfFtpStatus := 552;
sfFtpFilenameNotAllowed : constant sfFtpStatus := 553;
sfFtpInvalidResponse : constant sfFtpStatus := 1000;
sfFtpConnectionFailed : constant sfFtpStatus := 1001;
sfFtpConnectionClosed : constant sfFtpStatus := 1002;
sfFtpInvalidFile : constant sfFtpStatus := 1003;
-- ////////////////////////////////////////////////////////////
-- /// Destroy an existing Ftp listing response
-- ///
-- /// \param FtpResponse : Ftp listing response to destroy
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfFtpListingResponse_Destroy (FtpListingResponse : sfFtpListingResponse_Ptr);
-- ////////////////////////////////////////////////////////////
-- /// Convenience function to check if the response status code
-- /// means a success
-- ///
-- /// \param FtpListingResponse : Ftp listing response
-- ///
-- /// \return sfTrue if status is success (code < 400)
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpListingResponse_IsOk (FtpListingResponse : sfFtpListingResponse_Ptr) return sfBool;
-- ////////////////////////////////////////////////////////////
-- /// Get the response status code
-- ///
-- /// \param FtpListingResponse : Ftp listing response
-- ///
-- /// \return Status code
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpListingResponse_GetStatus (FtpListingResponse : sfFtpListingResponse_Ptr) return sfFtpStatus;
-- ////////////////////////////////////////////////////////////
-- /// Get the full message contained in the response
-- ///
-- /// \param FtpListingResponse : Ftp listing response
-- ///
-- /// \return The response message
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpListingResponse_GetMessage (FtpListingResponse : sfFtpListingResponse_Ptr) return String;
-- ////////////////////////////////////////////////////////////
-- /// Get the number of filenames in the listing
-- ///
-- /// \param FtpListingResponse : Ftp listing response
-- ///
-- /// \return Total number of filenames
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpListingResponse_GetCount (FtpListingResponse : sfFtpListingResponse_Ptr) return sfSize_t;
-- ////////////////////////////////////////////////////////////
-- /// Get the Index-th filename in the directory
-- ///
-- /// \param FtpListingResponse : Ftp listing response
-- /// \param Index : Index of the filename to get
-- ///
-- /// \return Index-th filename
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpListingResponse_GetFilename (FtpListingResponse : sfFtpListingResponse_Ptr; Index : sfSize_t) return String;
-- ////////////////////////////////////////////////////////////
-- /// Destroy an existing Ftp directory response
-- ///
-- /// \param FtpDirectoryResponse : Ftp directory response to destroy
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfFtpDirectoryResponse_Destroy (FtpDirectoryResponse : sfFtpDirectoryResponse_Ptr);
-- ////////////////////////////////////////////////////////////
-- /// Convenience function to check if the response status code
-- /// means a success
-- ///
-- /// \param FtpDirectoryResponse : Ftp directory response
-- ///
-- /// \return sfTrue if status is success (code < 400)
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpDirectoryResponse_IsOk (FtpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return sfBool;
-- ////////////////////////////////////////////////////////////
-- /// Get the response status code
-- ///
-- /// \param FtpDirectoryResponse : Ftp directory response
-- ///
-- /// \return Status code
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpDirectoryResponse_GetStatus (FtpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return sfFtpStatus;
-- ////////////////////////////////////////////////////////////
-- /// Get the full message contained in the response
-- ///
-- /// \param FtpDirectoryResponse : Ftp directory response
-- ///
-- /// \return The response message
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpDirectoryResponse_GetMessage (FtpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return String;
-- ////////////////////////////////////////////////////////////
-- /// Get the directory returned in the response
-- ///
-- /// \param FtpDirectoryResponse : Ftp directory response
-- ///
-- /// \return Directory name
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpDirectoryResponse_GetDirectory (FtpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return String;
-- ////////////////////////////////////////////////////////////
-- /// Destroy an existing Ftp response
-- ///
-- /// \param FtpResponse : Ftp response to destroy
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfFtpResponse_Destroy (FtpResponse : sfFtpResponse_Ptr);
-- ////////////////////////////////////////////////////////////
-- /// Convenience function to check if the response status code
-- /// means a success
-- ///
-- /// \param FtpResponse : Ftp response
-- ///
-- /// \return sfTrue if status is success (code < 400)
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpResponse_IsOk (FtpResponse : sfFtpResponse_Ptr) return sfBool;
-- ////////////////////////////////////////////////////////////
-- /// Get the response status code
-- ///
-- /// \param FtpResponse : Ftp response
-- ///
-- /// \return Status code
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpResponse_GetStatus (FtpResponse : sfFtpResponse_Ptr) return sfFtpStatus;
-- ////////////////////////////////////////////////////////////
-- /// Get the full message contained in the response
-- ///
-- /// \param FtpResponse : Ftp response
-- ///
-- /// \return The response message
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtpResponse_GetMessage (FtpResponse : sfFtpResponse_Ptr) return String;
-- ////////////////////////////////////////////////////////////
-- /// Construct a new Ftp
-- ///
-- /// \return Pointer to the new Ftp
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Create return sfFtp_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Destroy an existing Ftp
-- ///
-- /// \param Ftp : Ftp to destroy
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfFtp_Destroy (Ftp : sfFtp_Ptr);
-- ////////////////////////////////////////////////////////////
-- /// Connect to the specified FTP server
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Server : FTP server to connect to
-- /// \param Port : Port used for connection (21 by default, standard FTP port)
-- /// \param Timeout : Maximum time to wait (0 to use no timeout)
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Connect
(Ftp : sfFtp_Ptr;
Server : sfIPAddress;
Port : sfUint16;
Timeout : Float)
return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Log in using anonymous account
-- ///
-- /// \param Ftp : Ftp instance
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_LoginAnonymous (Ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Log in using a username and a password
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param UserName : User name
-- /// \param Password : Password
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Login
(Ftp : sfFtp_Ptr;
UserName : String;
Password : String)
return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Close the connection with FTP server
-- ///
-- /// \param Ftp : Ftp instance
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Disconnect (Ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Send a null command just to prevent from being disconnected
-- ///
-- /// \param Ftp : Ftp instance
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_KeepAlive (Ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Get the current working directory
-- ///
-- /// \param Ftp : Ftp instance
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_GetWorkingDirectory (Ftp : sfFtp_Ptr) return sfFtpDirectoryResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Get the contents of the given directory
-- /// (subdirectories and files)
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Directory : Directory to list ("" by default, the current one)
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_GetDirectoryListing (Ftp : sfFtp_Ptr; Directory : String) return sfFtpListingResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Change the current working directory
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Directory : New directory, relative to the current one
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_ChangeDirectory (Ftp : sfFtp_Ptr; Directory : String) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Go to the parent directory of the current one
-- ///
-- /// \param Ftp : Ftp instance
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_ParentDirectory (Ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Create a new directory
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Name : Name of the directory to create
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_MakeDirectory (Ftp : sfFtp_Ptr; Name : String) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Remove an existing directory
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Name : Name of the directory to remove
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_DeleteDirectory (Ftp : sfFtp_Ptr; Name : String) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Rename a file
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param File : File to rename
-- /// \param NewName : New name
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_RenameFile
(Ftp : sfFtp_Ptr;
File : String;
NewName : String)
return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Remove an existing file
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param Name : File to remove
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_DeleteFile (Ftp : sfFtp_Ptr; Name : String) return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Download a file from the server
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param DistantFile : Path of the distant file to download
-- /// \param DestPath : Where to put to file on the local computer
-- /// \param Mode : Transfer mode (binary by default)
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Download
(Ftp : sfFtp_Ptr;
DistantFile : String;
DestPath : String;
Mode : sfFtpTransferMode)
return sfFtpResponse_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Upload a file to the server
-- ///
-- /// \param Ftp : Ftp instance
-- /// \param LocalFile : Path of the local file to upload
-- /// \param DestPath : Where to put to file on the server
-- /// \param Mode : Transfer mode (binary by default)
-- ///
-- /// \return Server response to the request
-- ///
-- ////////////////////////////////////////////////////////////
function sfFtp_Upload
(Ftp : sfFtp_Ptr;
LocalFile : String;
DestPath : String;
Mode : sfFtpTransferMode)
return sfFtpResponse_Ptr;
private
pragma Convention (C, sfFtpTransferMode);
pragma Import (C, sfFtpListingResponse_Destroy, "sfFtpListingResponse_Destroy");
pragma Import (C, sfFtpListingResponse_IsOk, "sfFtpListingResponse_IsOk");
pragma Import (C, sfFtpListingResponse_GetStatus, "sfFtpListingResponse_GetStatus");
pragma Import (C, sfFtpListingResponse_GetCount, "sfFtpListingResponse_GetCount");
pragma Import (C, sfFtpDirectoryResponse_Destroy, "sfFtpDirectoryResponse_Destroy");
pragma Import (C, sfFtpDirectoryResponse_IsOk, "sfFtpDirectoryResponse_IsOk");
pragma Import (C, sfFtpDirectoryResponse_GetStatus, "sfFtpDirectoryResponse_GetStatus");
pragma Import (C, sfFtpResponse_Destroy, "sfFtpResponse_Destroy");
pragma Import (C, sfFtpResponse_IsOk, "sfFtpResponse_IsOk");
pragma Import (C, sfFtpResponse_GetStatus, "sfFtpResponse_GetStatus");
pragma Import (C, sfFtp_Create, "sfFtp_Create");
pragma Import (C, sfFtp_Destroy, "sfFtp_Destroy");
pragma Import (C, sfFtp_Connect, "sfFtp_Connect");
pragma Import (C, sfFtp_LoginAnonymous, "sfFtp_LoginAnonymous");
pragma Import (C, sfFtp_Disconnect, "sfFtp_Disconnect");
pragma Import (C, sfFtp_KeepAlive, "sfFtp_KeepAlive");
pragma Import (C, sfFtp_GetWorkingDirectory, "sfFtp_GetWorkingDirectory");
pragma Import (C, sfFtp_ParentDirectory, "sfFtp_ParentDirectory");
end Sf.Network.Ftp;
| 43.204255 | 125 | 0.490791 |
122537d471e2ef08d64972fe32248df3d8fa8d2e | 2,511 | ads | Ada | resources/scripts/cert/facebookct.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | 2 | 2020-11-29T07:30:31.000Z | 2021-11-14T19:52:31.000Z | resources/scripts/cert/facebookct.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | null | null | null | resources/scripts/cert/facebookct.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | 1 | 2020-12-28T06:50:15.000Z | 2020-12-28T06:50:15.000Z | -- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "FacebookCT"
type = "cert"
function start()
setratelimit(20)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and
c.secret ~= nil and c.key ~= "" and c.secret ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or
c.secret == nil or c.key == "" or c.secret == "") then
return
end
local dec
local resp
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(domain, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=authurl(c.key, c.secret),
headers={['Content-Type']="application/json"},
})
if (err ~= nil and err ~= "") then
return
end
dec = json.decode(resp)
if (dec == nil or dec.access_token == nil or dec.access_token == "") then
return
end
resp, err = request({
url=queryurl(domain, dec.access_token),
headers={['Content-Type']="application/json"},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(domain, resp)
end
end
dec = json.decode(resp)
if (dec == nil or #(dec.data) == 0) then
return
end
for i, r in pairs(dec.data) do
for j, name in pairs(r.domains) do
sendnames(ctx, name)
end
end
end
function authurl(id, secret)
return "https://graph.facebook.com/oauth/access_token?client_id=" .. id .. "&client_secret=" .. secret .. "&grant_type=client_credentials"
end
function queryurl(domain, token)
return "https://graph.facebook.com/certificates?fields=domains&access_token=" .. token .. "&query=*." .. domain
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
for i, v in pairs(names) do
newname(ctx, v)
end
end
| 23.914286 | 142 | 0.566706 |
4dc4c814c9f98af428e86fe902276ad8b9a9eb98 | 4,339 | ads | Ada | boards/MicroBit/src/microbit-ios.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | boards/MicroBit/src/microbit-ios.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | boards/MicroBit/src/microbit-ios.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2020, 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 nRF.GPIO; use nRF.GPIO;
package MicroBit.IOs is
type Pin_Id is range 0 .. 20;
type IO_Features is (Digital, Analog, Touch);
function Supports (Pin : Pin_Id; Feature : IO_Features) return Boolean is
(case Feature is
when Digital => (case Pin is
when 0 .. 16 | 19 .. 20 => True,
when others => False),
when Analog => (case Pin is
when 0 .. 4 | 10 => True,
when others => False),
when Touch => (case Pin is
when 0 | 1 | 2 => True,
when others => False));
procedure Set (Pin : Pin_Id; Value : Boolean)
with Pre => Supports (Pin, Digital);
function Set (Pin : Pin_Id) return Boolean
with Pre => Supports (Pin, Digital);
type Analog_Value is range 0 .. 1023;
procedure Set_Analog_Period_Us (Period : Natural);
-- Set the period (in microseconds) of the PWM signal for all analog output
-- pins.
procedure Write (Pin : Pin_Id; Value : Analog_Value)
with Pre => Supports (Pin, Analog);
function Analog (Pin : Pin_Id) return Analog_Value
with Pre => Supports (Pin, Analog);
-- Read the voltagle applied to the pin. 0 means 0V 1023 means 3.3V
private
-- Mapping between pin id and GPIO_Points
Points : array (Pin_Id) of GPIO_Point :=
(0 => MB_P0,
1 => MB_P1,
2 => MB_P2,
3 => MB_P3,
4 => MB_P4,
5 => MB_P5,
6 => MB_P6,
7 => MB_P7,
8 => MB_P8,
9 => MB_P9,
10 => MB_P10,
11 => MB_P11,
12 => MB_P12,
13 => MB_P13,
14 => MB_P14,
15 => MB_P15,
16 => MB_P16,
17 => MB_P0, -- There's no pin17, using P0 to fill in...
18 => MB_P0, -- There's no pin18, using P0 to fill in...
19 => MB_P19,
20 => MB_P20);
end MicroBit.IOs;
| 43.828283 | 79 | 0.510256 |
Subsets and Splits