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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0654d24a94769ac2eae7e27d27ccfba818a60b57 | 174 | adb | Ada | ejercicios6/crear_lista_vacia.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/crear_lista_vacia.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/crear_lista_vacia.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | with Datos;
use Datos;
procedure crear_lista_vacia( L : in out Lista) is
-- pre:
-- post: se ha creado una lista vacia
begin
L := null;
end crear_lista_vacia;
| 14.5 | 49 | 0.666667 |
502459bba7b852c3dd486284b0d05561ce597716 | 653 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert7.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/unchecked_convert7.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert7.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-g -gnatVa" }
with Unchecked_Conversion;
procedure Unchecked_Convert7 is
type BPA is array (1 .. 23) of Boolean;
pragma Pack (BPA);
for BPA'Size use 23;
subtype Byte is Natural range 0 .. 255;
type R is
record
S : Boolean;
E : Byte;
F : BPA;
end record;
for R use
record
S at 0 range 0 .. 0;
E at 0 range 1 .. 8;
F at 0 range 9 .. 31;
end record;
for R'Size use 32;
function Conversion
is new Unchecked_Conversion (Source => R, Target => Float);
F : Float := Conversion (R'(False, Byte'Last, (others => False)));
begin
null;
end;
| 17.648649 | 68 | 0.589587 |
a1f1ac8aeadf53f3bc2c4725f5e833e82bb644ed | 4,373 | adb | Ada | src/glfw-error.adb | zrmyers/GLFWAda | d267c0844f2f088a68dd86f79ad4b0f30d29ea81 | [
"MIT"
] | null | null | null | src/glfw-error.adb | zrmyers/GLFWAda | d267c0844f2f088a68dd86f79ad4b0f30d29ea81 | [
"MIT"
] | null | null | null | src/glfw-error.adb | zrmyers/GLFWAda | d267c0844f2f088a68dd86f79ad4b0f30d29ea81 | [
"MIT"
] | null | null | null | --------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2020 Zane Myers
--
-- 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.
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
-- This file provides an interface to Data Types and operations for raising
-- exceptions after detection of an error in GLFW.
--------------------------------------------------------------------------------
with Glfw.Api;
with Interfaces.C.Strings;
package body Glfw.Error is
procedure Raise_If_Present is
error_message : Interfaces.C.Strings.chars_ptr;
return_code : Enum_Return_Codes;
begin
return_code := Api.glfwGetError(message => error_message);
case return_code is
-- No Errors Occurred, yay!
when NO_ERROR =>
null;
-- Platform error occurred, printing error message.
when PLATFORM_ERROR =>
raise Exceptions.PLATFORM_ERROR
with Interfaces.C.Strings.Value(
Item => error_message);
when NOT_INITIALIZED =>
raise Exceptions.NOT_INITIALIZED
with Interfaces.C.Strings.Value(
Item => error_message);
when NO_CURRENT_CONTEXT =>
raise Exceptions.NO_CURRENT_CONTEXT
with Interfaces.C.Strings.Value(
Item => error_message);
when INVALID_ENUM =>
raise Exceptions.INVALID_ENUM
with Interfaces.C.Strings.Value(
Item => error_message);
when INVALID_VALUE =>
raise Exceptions.INVALID_VALUE
with Interfaces.C.Strings.Value(
Item => error_message);
when OUT_OF_MEMORY =>
raise Exceptions.OUT_OF_MEMORY
with Interfaces.C.Strings.Value(
Item => error_message);
when API_UNAVAILABLE =>
raise Exceptions.API_UNAVAILABLE
with Interfaces.C.Strings.Value(
Item => error_message);
when VERSION_UNAVAILABLE =>
raise Exceptions.VERSION_UNAVAILABLE
with Interfaces.C.Strings.Value(
Item => error_message);
when FORMAT_UNAVAILABLE =>
raise Exceptions.FORMAT_UNAVAILABLE
with Interfaces.C.Strings.Value(
Item => error_message);
when NO_WINDOW_CONTEXT =>
raise Exceptions.NO_WINDOW_CONTEXT
with Interfaces.C.Strings.Value(
Item => error_message);
end case;
end Raise_If_Present;
end Glfw.Error;
| 42.872549 | 82 | 0.509719 |
06d49eb510144fe77d6230f5b4c0c0b197bbd5a3 | 1,651 | ads | Ada | source/environment/machine-apple-darwin/s-prdyli.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/environment/machine-apple-darwin/s-prdyli.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/environment/machine-apple-darwin/s-prdyli.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 POSIX (Darwin, FreeBSD, or Linux)
with Ada.IO_Exceptions;
private with Ada.Finalization;
private with C;
package System.Program.Dynamic_Linking is
-- Loading dynamic-link library.
pragma Preelaborate;
type Library is limited private;
-- subtype Open_Library is Library
-- with
-- Dynamic_Predicate => Is_Open (Open_Library),
-- Predicate_Failure => raise Status_Error;
function Is_Open (Lib : Library) return Boolean;
pragma Inline (Is_Open);
procedure Open (Lib : in out Library; Name : String);
function Open (Name : String) return Library;
procedure Close (Lib : in out Library);
function Import (
Lib : Library; -- Open_Library
Symbol : String)
return Address;
Status_Error : exception
renames Ada.IO_Exceptions.Status_Error;
Name_Error : exception
renames Ada.IO_Exceptions.Name_Error;
Use_Error : exception
renames Ada.IO_Exceptions.Use_Error;
Data_Error : exception
renames Ada.IO_Exceptions.Data_Error;
private
package Controlled is
type Library is limited private;
function Reference (Lib : Dynamic_Linking.Library)
return not null access C.void_ptr;
pragma Inline (Reference);
private
type Library is
limited new Ada.Finalization.Limited_Controlled with
record
Handle : aliased C.void_ptr := C.void_ptr (Null_Address);
end record;
overriding procedure Finalize (Object : in out Library);
end Controlled;
type Library is new Controlled.Library;
end System.Program.Dynamic_Linking;
| 25.796875 | 67 | 0.705027 |
0b2f77b8d930390fdefd97d3854f6c19202459b3 | 12,791 | ads | Ada | awa/plugins/awa-blogs/src/awa-blogs-beans.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-blogs/src/awa-blogs-beans.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-blogs/src/awa-blogs-beans.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-blogs-beans -- Beans for blog module
-- Copyright (C) 2011, 2012, 2013, 2014, 2015, 2016, 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.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Beans.Basic;
with Util.Beans.Objects;
with ADO;
with ADO.Objects;
with AWA.Blogs.Modules;
with AWA.Blogs.Models;
with AWA.Tags.Beans;
with AWA.Counters.Beans;
with AWA.Events;
with ASF.Rest.Definition;
-- == Blog Beans ==
-- Several bean types are provided to represent and manage the blogs and their posts.
-- The blog module registers the bean constructors when it is initialized.
-- To use them, one must declare a bean definition in the application XML configuration.
package AWA.Blogs.Beans is
-- Attributes exposed by <b>Post_Bean</b>
BLOG_ID_ATTR : constant String := "blogId";
POST_ID_ATTR : constant String := "id";
POST_UID_ATTR : constant String := "uid";
POST_TITLE_ATTR : constant String := "title";
POST_TEXT_ATTR : constant String := "text";
POST_URI_ATTR : constant String := "uri";
POST_STATUS_ATTR : constant String := "status";
POST_USERNAME_ATTR : constant String := "username";
POST_TAG_ATTR : constant String := "tags";
POST_ALLOW_COMMENTS_ATTR : constant String := "allow_comments";
COUNTER_ATTR : constant String := "counter";
-- ------------------------------
-- Blog Bean
-- ------------------------------
-- The <b>Blog_Bean</b> holds the information about the current blog.
-- It allows to create the blog as well as update its primary title.
type Blog_Bean is new AWA.Blogs.Models.Blog_Bean with record
Module : AWA.Blogs.Modules.Blog_Module_Access := null;
end record;
type Blog_Bean_Access is access all Blog_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Blog_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Blog_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Create a new blog.
overriding
procedure Create (Bean : in out Blog_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Load the blog information.
overriding
procedure Load (Bean : in out Blog_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Handle an event to create the blog entry automatically.
overriding
procedure Create_Default (Bean : in out Blog_Bean;
Event : in AWA.Events.Module_Event'Class);
-- Create the Blog_Bean bean instance.
function Create_Blog_Bean (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
-- ------------------------------
-- Post Bean
-- ------------------------------
-- The <b>Post_Bean</b> is used to create or update a post associated with a blog.
type Post_Bean is new AWA.Blogs.Models.Post_Bean with record
Module : AWA.Blogs.Modules.Blog_Module_Access := null;
Blog_Id : ADO.Identifier := ADO.NO_IDENTIFIER;
-- List of tags associated with the post.
Tags : aliased AWA.Tags.Beans.Tag_List_Bean;
Tags_Bean : Util.Beans.Basic.Readonly_Bean_Access;
-- The read post counter associated with the post.
Counter : aliased AWA.Counters.Beans.Counter_Bean (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => Models.POST_TABLE);
Counter_Bean : Util.Beans.Basic.Readonly_Bean_Access;
end record;
type Post_Bean_Access is access all Post_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Post_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Post_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Load the post.
procedure Load_Post (Post : in out Post_Bean;
Id : in ADO.Identifier);
-- Create or save the post.
overriding
procedure Save (Bean : in out Post_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Delete a post.
overriding
procedure Delete (Bean : in out Post_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Load the post from the URI for the public display.
overriding
procedure Load (Bean : in out Post_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Load the post from the URI for the administrator.
overriding
procedure Load_Admin (Bean : in out Post_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Load the post from the URI either with visible comments or with all comments.
procedure Load (Bean : in out Post_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String;
Publish_Only : in Boolean);
-- Create the Post_Bean bean instance.
function Create_Post_Bean (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
procedure Create (Bean : in out Post_Bean;
Req : in out ASF.Rest.Request'Class;
Reply : in out ASF.Rest.Response'Class);
procedure Update (Bean : in out Post_Bean;
Req : in out ASF.Rest.Request'Class;
Reply : in out ASF.Rest.Response'Class);
package Post_API is
new ASF.Rest.Definition (Object_Type => Post_Bean,
URI => "/blogs/:blog_id/posts");
--
-- package API_Post_Create is
-- new Post_API.Definition (Create'Access, ASF.Rest.POST, "");
--
-- package API_Post_Update is
-- new Post_API.Definition (Update'Access, ASF.Rest.PUT, ":id");
-- ------------------------------
-- Post List Bean
-- ------------------------------
-- The <b>Post_List_Bean</b> gives a list of visible posts to be displayed to users.
-- The list can be filtered by a given tag. The list pagination is supported.
type Post_List_Bean is new AWA.Blogs.Models.Post_List_Bean with record
Posts : aliased AWA.Blogs.Models.Post_Info_List_Bean;
Service : Modules.Blog_Module_Access := null;
Tags : AWA.Tags.Beans.Entity_Tag_Map;
Posts_Bean : AWA.Blogs.Models.Post_Info_List_Bean_Access;
-- The read post counter associated with the post.
Counter : aliased AWA.Counters.Beans.Counter_Bean (Of_Type => ADO.Objects.KEY_INTEGER,
Of_Class => Models.POST_TABLE);
Counter_Bean : AWA.Counters.Beans.Counter_Bean_Access;
end record;
type Post_List_Bean_Access is access all Post_List_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Post_List_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Post_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
overriding
procedure Load (From : in out Post_List_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Load the list of posts. If a tag was set, filter the list of posts with the tag.
procedure Load_List (Into : in out Post_List_Bean);
-- Create the Post_List_Bean bean instance.
function Create_Post_List_Bean (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
-- Get a select item list which contains a list of post status.
function Create_Status_List (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
type Init_Flag is (INIT_BLOG_LIST, INIT_POST_LIST, INIT_COMMENT_LIST);
type Init_Map is array (Init_Flag) of Boolean;
-- ------------------------------
-- Admin List Bean
-- ------------------------------
-- The <b>Blog_Admin_Bean</b> is used for the administration of a blog. It gives the
-- list of posts that are created, published or not.
type Blog_Admin_Bean is new Util.Beans.Basic.Bean with record
Module : AWA.Blogs.Modules.Blog_Module_Access := null;
-- The blog identifier.
Blog_Id : ADO.Identifier := ADO.NO_IDENTIFIER;
-- List of blogs.
Blog_List : aliased AWA.Blogs.Models.Blog_Info_List_Bean;
Blog_List_Bean : AWA.Blogs.Models.Blog_Info_List_Bean_Access;
-- List of posts.
Post_List : aliased AWA.Blogs.Models.Admin_Post_Info_List_Bean;
Post_List_Bean : AWA.Blogs.Models.Admin_Post_Info_List_Bean_Access;
-- List of comments.
Comment_List : aliased AWA.Blogs.Models.Comment_Info_List_Bean;
Comment_List_Bean : AWA.Blogs.Models.Comment_Info_List_Bean_Access;
-- Initialization flags.
Init_Flags : aliased Init_Map := (others => False);
Flags : access Init_Map;
end record;
type Blog_Admin_Bean_Access is access all Blog_Admin_Bean;
-- Get the blog identifier.
function Get_Blog_Id (List : in Blog_Admin_Bean) return ADO.Identifier;
-- Load the posts associated with the current blog.
procedure Load_Posts (List : in Blog_Admin_Bean);
-- Load the comments associated with the current blog.
procedure Load_Comments (List : in Blog_Admin_Bean);
overriding
function Get_Value (List : in Blog_Admin_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Blog_Admin_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Load the list of blogs.
procedure Load_Blogs (List : in Blog_Admin_Bean);
-- Create the Blog_Admin_Bean bean instance.
function Create_Blog_Admin_Bean (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
-- ------------------------------
-- Blog Statistics Bean
-- ------------------------------
-- The <b>Blog_Stat_Bean</b> is used to report various statistics about the blog or some post.
type Blog_Stat_Bean is new AWA.Blogs.Models.Stat_List_Bean with record
Module : AWA.Blogs.Modules.Blog_Module_Access := null;
Stats : aliased AWA.Blogs.Models.Month_Stat_Info_List_Bean;
Stats_Bean : AWA.Blogs.Models.Month_Stat_Info_List_Bean_Access;
end record;
type Blog_Stat_Bean_Access is access all Blog_Stat_Bean;
overriding
function Get_Value (List : in Blog_Stat_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Blog_Stat_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Load the statistics information.
overriding
procedure Load (List : in out Blog_Stat_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Create the Blog_Stat_Bean bean instance.
function Create_Blog_Stat_Bean (Module : in AWA.Blogs.Modules.Blog_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
end AWA.Blogs.Beans;
| 41.529221 | 98 | 0.628723 |
06e365a9ca3322a0ecf49df52de8c1b9c3ded8ef | 32,172 | adb | Ada | 4-high/gel/source/gel-sprite.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 4-high/gel/source/gel-sprite.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 4-high/gel/source/gel-sprite.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
gel.hinge_Joint,
gel. any_Joint,
gel.World,
ada.Tags,
ada.unchecked_Deallocation,
ada.unchecked_Conversion;
package body gel.Sprite
is
use ada.Tags,
linear_Algebra_3D;
procedure log (Message : in String)
-- renames ada.text_IO.put_Line;
is null;
------------------
--- Initialisation
--
procedure rebuild_Shape (Self : in out Item)
is
use type physics.Model.shape_Kind,
physics.Model.View;
the_Scale : aliased Vector_3;
begin
-- Self.Shape := Self.World.Space.new_Shape (Self.physics_Model);
-- Old
if Self.physics_Model = null then
return;
end if;
the_Scale := Self.physics_Model.Scale;
case Self.physics_Model.shape_Info.Kind
is
when physics.Model.Cube =>
Self.Shape := physics_Shape_view (Self.World.Space. new_box_Shape (Self.physics_Model.shape_Info.half_Extents));
when physics.Model.a_Sphere =>
Self.Shape := physics_Shape_view (Self.World.Space. new_sphere_Shape (Self.physics_Model.shape_Info.sphere_Radius));
when physics.Model.multi_Sphere =>
Self.Shape := physics_Shape_view (Self.World.Space.new_multisphere_Shape (Self.physics_Model.shape_Info.Sites.all,
Self.physics_Model.shape_Info.Radii.all));
when physics.Model.Cone =>
Self.Shape := physics_Shape_view (Self.World.Space. new_cone_Shape (Radius => Real (Self.physics_Model.Scale (1) / 2.0),
Height => Real (Self.physics_Model.Scale (2))));
when physics.Model.a_Capsule =>
Self.Shape := physics_Shape_view (Self.World.Space. new_capsule_Shape (Self.physics_Model.shape_Info.lower_Radius,
Self.physics_Model.shape_Info.Height));
when physics.Model.Cylinder =>
Self.Shape := physics_Shape_view (Self.World.Space. new_cylinder_Shape (Self.physics_Model.shape_Info.half_Extents));
when physics.Model.Hull =>
Self.Shape := physics_Shape_view (Self.World.Space.new_convex_hull_Shape (Self.physics_Model.shape_Info.Points.all));
when physics.Model.Mesh =>
Self.Shape := physics_Shape_view (Self.World.Space .new_mesh_Shape (Self.physics_Model.shape_Info.Model));
when physics.Model.Plane =>
Self.Shape := physics_Shape_view (Self.World.Space. new_plane_Shape (Self.physics_Model.Shape_Info.plane_Normal,
Self.physics_Model.Shape_Info.plane_Offset));
when physics.Model.Heightfield =>
Self.Shape := physics_Shape_view (Self.World.Space.new_heightfield_Shape (Self.physics_Model.shape_Info.Heights.all,
Self.physics_Model.Scale));
when physics.Model.Circle =>
Self.Shape := physics_Shape_view (Self.World.Space. new_circle_Shape (Self.physics_Model.shape_Info.circle_Radius));
when physics.Model.Polygon =>
Self.Shape := physics_Shape_view (Self.World.Space. new_polygon_Shape (physics.space.polygon_Vertices (Self.physics_Model.shape_Info.Vertices (1 .. Self.physics_Model.shape_Info.vertex_Count))));
end case;
end rebuild_Shape;
procedure rebuild_Solid (Self : in out Item; at_Site : Vector_3)
is
use Physics.Object;
begin
if Self.Solid /= null
then
raise Program_Error;
end if;
Self.Solid := physics_Object_view (Self.World.Space.new_Object (physics.Shape.view (Self.Shape),
Self.physics_Model.Mass,
Self.physics_Model.Friction,
Self.physics_Model.Restitution,
at_Site,
Self.is_Kinematic));
end rebuild_Solid;
procedure define (Self : access Item; World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean;
owns_Physics : in Boolean;
is_Kinematic : in Boolean := False)
is
use type physics.Model.view;
begin
Self.Id := World.new_sprite_Id;
Self.World := World;
Self.Visual.Model_is (graphics_Model.all'unchecked_Access);
Self.physics_Model := physics.Model.view (physics_Model);
Self.owns_Graphics := owns_Graphics;
Self.owns_Physics := owns_Physics;
Self.is_Kinematic := is_Kinematic;
-- set_Translation (Self.Transform, To => physics_Model.Site);
-- Physics
--
if Self.physics_Model /= null
then
Self.rebuild_Shape;
Self.rebuild_Solid (at_Site);
null;
end if;
end define;
procedure destroy (Self : access Item; and_Children : in Boolean)
is
use gel.Joint;
begin
if Self.is_Destroyed
then
raise Error with "Sprite is already destroyed.";
end if;
-- Detach parent, if any.
--
if Self.parent_Joint /= null then
Self.parent_Joint.Sprite_A.detach (Sprite.view (Self));
end if;
-- Detach children, if any.
--
while not Self.child_Joints.is_Empty
loop
declare
child_Sprite : constant Sprite.view := Self.child_Joints.Last_Element.Sprite_B.all'Access;
begin
Self.detach (child_Sprite);
if and_Children
then
destroy (child_Sprite, and_Children); -- Recurse.
end if;
end;
end loop;
Self.is_Destroyed := True;
Self.World.destroy (Sprite.view (Self));
lace.Subject_and_deferred_Observer.item (Self.all).destroy; -- Destroy base class.
end destroy;
function is_Destroyed (Self : in Item) return Boolean
is
begin
return Self.is_Destroyed;
end is_Destroyed;
procedure free (Self : in out View)
is
pragma assert (Self.is_Destroyed);
use gel.Joint,
physics.Model,
physics.Object,
physics.Shape;
procedure deallocate is new ada.unchecked_Deallocation (Sprite.item'Class, Sprite.view);
procedure deallocate is new ada.unchecked_Deallocation (Joint.views, access_Joint_views);
pragma Unreferenced (deallocate);
child_Joint : Joint.view;
begin
for Each in 1 .. Integer (Self.child_Joints.Length)
loop
child_Joint := Self.child_Joints.Element (Each);
free (child_Joint);
end loop;
if Self.owns_Physics
then
free (Self.physics_Model);
end if;
free (Self.Shape);
free (Self.Solid);
deallocate (Self);
end free;
----------
--- Forge
--
package body Forge
is
function to_Sprite (Name : in String;
World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean;
owns_Physics : in Boolean;
is_Kinematic : in Boolean := False) return Item
is
begin
return Self : Item := (lace.Subject_and_deferred_Observer.forge.to_Subject_and_Observer (Name)
with others => <>)
do
Self.define (World, at_Site, graphics_Model, physics_Model, owns_Graphics, owns_Physics, is_Kinematic);
end return;
end to_Sprite;
function new_Sprite (Name : in String;
World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean := True;
owns_Physics : in Boolean := True;
is_Kinematic : in Boolean := False) return View
is
Self : constant View := new Item' (to_Sprite (Name,
World,
at_Site,
graphics_Model,
physics_Model,
owns_Graphics,
owns_Physics,
is_Kinematic));
begin
return Self;
end new_Sprite;
end Forge;
--------------
--- Attributes
--
function World (Self : in Item) return access gel.World.item'Class
is
begin
return Self.World;
end World;
function Id (Self : in Item) return gel.sprite_Id
is
begin
return Self.Id;
end Id;
procedure Id_is (Self : in out Item; Now : in gel.sprite_Id)
is
begin
Self.Id := Now;
end Id_is;
function Depth_in_camera_space (Self : in Item) return Real
is
begin
return Self.Depth_in_camera_space;
end Depth_in_camera_space;
function Mass (Self : in Item) return Real
is
begin
return Self.physics_Model.Mass;
end Mass;
function is_Static (Self : in Item) return Boolean
is
begin
return Self.Mass = 0.0;
end is_Static;
function is_Kinematic (Self : in Item) return Boolean
is
begin
return Self.is_Kinematic;
end is_Kinematic;
procedure mvp_Matrix_is (Self : in out Item; Now : in Matrix_4x4)
is
begin
Self.Visual.mvp_Transform_is (Now);
Self.Depth_in_camera_space := Now (4, 3);
end mvp_Matrix_is;
function mvp_Matrix (Self : in Item) return Matrix_4x4
is
begin
return Self.Visual.mvp_Transform;
end mvp_Matrix;
procedure is_Visible (Self : in out Item; Now : in Boolean)
is
begin
Self.is_Visible := Now;
end is_Visible;
function is_Visible (Self : in Item) return Boolean
is
begin
return Self.is_Visible;
end is_Visible;
procedure key_Response_is (Self : in out Item; Now : in lace.Response.view)
is
begin
Self.key_Response := Now;
end key_Response_is;
function key_Response (Self : in Item) return lace.Response.view
is
begin
return Self.key_Response;
end key_Response;
function Visual (Self : access Item) return openGL.Visual.view
is
begin
return Self.Visual;
end Visual;
function graphics_Model (Self : in Item) return openGL.Model.view
is
begin
return Self.visual.Model;
end graphics_Model;
procedure Model_is (Self : in out Item; Now : in openGL.Model.view)
is
begin
Self.Visual.Model_is (Now);
end Model_is;
function owns_Graphics (Self : in Item) return Boolean
is
begin
return Self.owns_Graphics;
end owns_Graphics;
function physics_Model (Self : in Item) return access physics.Model.item'class
is
begin
return Self.physics_Model;
end physics_Model;
procedure physics_Model_is (Self : in out Item; Now : in physics.Model.view)
is
begin
Self.physics_Model := Now;
end physics_Model_is;
procedure Scale_is (Self : in out Item; Now : in math.Vector_3)
is
begin
Self.physics_Model.Scale_is (Now);
Self.World .update_Scale (Self'unchecked_Access, +Now);
end Scale_is;
function Scale (Self : in Item) return Vector_3
is
begin
return Self.physics_Model.Scale;
end Scale;
function Solid (Self : in Item) return physics_Object_view
is
begin
return Self.Solid;
end Solid;
procedure Solid_is (Self : in out Item; Now : in physics_Object_view)
is
begin
Self.Solid := Now;
end Solid_is;
function to_GEL (the_Solid : in physics_Object_view) return gel.Sprite.view
is
begin
return gel.Sprite.view (the_Solid.user_Data);
end to_GEL;
function Shape (Self : in Item) return physics_Shape_view
is
begin
return Self.Shape;
end Shape;
-------------
--- Dynamics
--
--- Bounds
--
function Bounds (Self : in Item) return Geometry_3d.bounding_Box
is
use Geometry_3d;
begin
return Self.graphics_Model.Bounds.Box + Self.Site;
end Bounds;
--- Site
--
function Site (Self : in Item) return Vector_3
is
begin
return Self.Solid.Site;
end Site;
procedure Site_is (Self : in out Item; Now : in Vector_3)
is
begin
Self.Solid.Site_is (Now);
end Site_is;
procedure move (Self : in out Item; to_Site : in Vector_3)
is
the_Offset : constant Vector_3 := to_Site - Self.Site;
child_Sprite : Sprite.view;
begin
-- Do children.
--
for i in 1 .. Integer (Self.child_Joints.Length)
loop
child_Sprite := Self.child_Joints.Element (i).Sprite_B;
child_Sprite.move (to_site => child_Sprite.Site + the_Offset); -- Recurse.
end loop;
Self.Site_is (to_Site);
end move;
procedure set_Speed (Self : in out Item; to_Speed : in Vector_3)
is
child_Sprite : Sprite.view;
begin
-- Do children.
--
for i in 1 .. Integer (Self.child_Joints.Length)
loop
child_Sprite := Self.child_Joints.Element (i).Sprite_B;
child_Sprite.set_Speed (to_Speed);
end loop;
Self.Speed_is (to_Speed);
end set_Speed;
function Spin (Self : in Item) return Matrix_3x3
is
begin
return Self.Solid.Spin;
end Spin;
procedure Spin_is (Self : in out Item; Now : in Matrix_3x3)
is
use type Physics.Object.view;
-- Transform : Matrix_4x4 := Self.Transform.Value;
begin
-- set_Rotation (Self.Transform, Now);
-- Self.Transform_is (Transform);
-- if Self.Solid /= null then
Self.Solid.Spin_is (Now);
-- end if;
end Spin_is;
function xy_Spin (Self : in Item) return Radians
is
begin
return Self.Solid.xy_Spin;
end xy_Spin;
procedure xy_Spin_is (Self : in out Item; Now : in Radians)
is
begin
Self.World.set_xy_Spin (Self'unchecked_Access, Now);
end xy_Spin_is;
procedure rotate (Self : in out Item; to_Spin : in Matrix_3x3)
is
the_spin_Delta : constant Matrix_3x3 := to_Spin * Inverse (Self.Spin); -- The rotation matrix describing the amount by which Self has rotated.
procedure spin_Children (the_Sprite : in Sprite.item'class)
is
begin
if the_Sprite.child_Joints.Is_Empty then
return;
end if;
declare
child_Sprite : Sprite.view;
the_site_Offset : Vector_3;
begin
for i in 1 .. Integer (the_Sprite.child_Joints.Length)
loop
child_Sprite := the_Sprite.child_Joints.Element (i).Sprite_B;
the_site_Offset := the_spin_Delta * (child_Sprite.Site - Self.Site) ;
child_Sprite.Site_is (Self.Site + the_site_Offset);
child_Sprite.Spin_is (the_spin_Delta * child_Sprite.Spin);
spin_Children (child_Sprite.all); -- Recurse.
end loop;
end;
end spin_Children;
begin
spin_Children (Self); -- Do children.
Self.Spin_is (to_Spin);
end rotate;
function Transform (Self : in Item) return Matrix_4x4
is
begin
-- return Self.Transform.Value;
return Self.Solid.Transform;
end Transform;
procedure Transform_is (Self : in out Item; Now : in Matrix_4x4)
is
begin
-- Self.Transform.Value_is (Now);
Self.Solid.Transform_is (Now);
end Transform_is;
function Speed (Self : in Item) return Vector_3
is
begin
return Self.Solid.Speed;
end Speed;
procedure Speed_is (Self : in out Item; Now : in Vector_3)
is
begin
Self.World.set_Speed (Self'unchecked_Access, Now);
end Speed_is;
function Gyre (Self : in Item) return Vector_3
is
begin
return Self.Solid.Gyre;
end Gyre;
procedure Gyre_is (Self : in out Item; Now : in Vector_3)
is
begin
Self.Solid.Gyre_is (Now);
end Gyre_is;
procedure set_Gyre (Self : in out Item; to_Gyre : in Vector_3)
is
child_Sprite : Sprite.view;
begin
-- Do children.
--
for i in 1 .. Integer (Self.child_Joints.Length)
loop
child_Sprite := Self.child_Joints.Element (i).Sprite_B;
child_Sprite.set_Gyre (to_Gyre);
end loop;
Self.Gyre_is (to_Gyre);
end set_Gyre;
--- Forces
--
procedure apply_Force (Self : in out Item; Force : in Vector_3)
is
the_Force : aliased constant Vector_3 := Force;
begin
Self.World.apply_Force (Self'unchecked_Access, the_Force);
end apply_Force;
procedure apply_Torque (Self : in out Item; Torque : in Vector_3)
is
the_Torque : constant Vector_3 := Torque;
begin
Self.Solid.apply_Torque (the_Torque);
end apply_Torque;
procedure apply_Torque_impulse (Self : in out Item; Torque : in Vector_3)
is
the_Torque : constant Vector_3 := Torque;
begin
Self.Solid.apply_Torque_impulse (the_Torque);
end apply_Torque_impulse;
-- Mirrored Dynamics
--
protected
body safe_Interpolation
is
procedure set (desired_Site : in Vector_3;
desired_Spin : in Quaternion)
is
begin
Safe.Site.initial := Safe.Site.desired;
Safe.Site.desired := desired_Site;
Safe.Spin.initial := Safe.Spin.desired;
Safe.Spin.desired := desired_Spin;
Safe.Percent := 0.0;
end set;
procedure get (Site : out Vector_3;
Spin : out Quaternion)
is
begin
Site := Interpolated (Safe.Site.initial,
Safe.Site.desired,
Safe.Percent);
Spin := Interpolated (Safe.Spin.initial,
Safe.Spin.desired,
Safe.Percent);
if gel.World.interpolation_Steps = 0
then
Safe.Percent := 100.0;
else
Safe.Percent := Percentage'Min ( Safe.Percent
+ to_Percentage (1.0 / Real (gel.World.interpolation_Steps + 1)),
unit_Percentage'Last);
end if;
end get;
end safe_Interpolation;
procedure desired_Dynamics_are (Self : in out Item; Site : in Vector_3;
Spin : in Quaternion)
is
begin
Self.Interpolation.set (desired_Site => Site,
desired_Spin => Spin);
end desired_Dynamics_are;
procedure interpolate_Motion (Self : in out Item)
is
begin
if Self.is_Static then
return;
end if;
declare
new_Site : Vector_3;
new_Spin : Quaternion;
begin
Self.Interpolation.get (new_Site,
new_Spin);
Self.Site_is (new_Site);
Self.Spin_is (Transpose (to_Matrix (new_Spin)));
end;
end interpolate_Motion;
--------------
--- Operations
--
--- Hierachy
--
function parent_Joint (Self : in Item) return gel.Joint.view
is
begin
return Self.parent_Joint;
end parent_Joint;
function child_Joints (Self : in Item) return gel.Joint.views
is
the_Joints : Joint.views (1 .. Integer (Self.child_Joints.Length));
begin
for i in the_Joints'Range
loop
the_Joints (i) := Self.child_Joints.Element (i);
end loop;
return the_Joints;
end child_Joints;
function top_Parent (Self : access Item) return gel.Sprite.view
is
begin
if Self.parent_Joint = null
then return gel.Sprite.view (Self);
else return Self.parent_Joint.Sprite_A.top_Parent; -- Recurse.
end if;
end top_Parent;
function Parent (Self : in Item) return gel.Sprite.view
is
begin
if Self.parent_Joint = null
then return null;
else return Self.parent_Joint.Sprite_A;
end if;
end Parent;
function tree_Depth (Self : in Item) return Natural
is
Parent : Sprite.view := Self.Parent;
Depth : Natural := 0;
begin
while Parent /= null
loop
Depth := Depth + 1;
Parent := Parent.Parent;
end loop;
return Depth;
end tree_Depth;
procedure apply (Self : in out Item; do_Action : Action)
is
begin
do_Action (Self);
for i in 1 .. Integer (Self.child_Joints.Length)
loop
Self.child_Joints.Element (i).Sprite_B.apply (do_Action);
end loop;
end apply;
procedure attach (Self : access Item; the_Child : in Sprite.view;
the_Joint : in gel.Joint.view)
is
begin
log ("Attaching " & the_Child.Id'Image & " to " & Self.Id'Image);
Self.child_Joints.append (the_Joint);
the_Child.parent_Joint := the_Joint;
the_Child.relay_responseless_Events (To => Self);
end attach;
procedure detach (Self : in out Item; the_Child : gel.Sprite.view)
is
childs_Joint : Joint.view;
begin
log ("Detaching " & the_Child.Id'Image & " from " & Self.Id'Image);
for i in 1 .. Integer (Self.child_Joints.Length)
loop
if Self.child_Joints.Element (i).Sprite_B = the_Child
then
childs_Joint := Self.child_Joints.Element (i);
Self.child_Joints.delete (i);
the_Child.parent_Joint := null;
Self.World.destroy (childs_Joint);
return;
end if;
end loop;
raise no_such_Child;
end detach;
-- Hinge
--
procedure attach_via_Hinge (Self : access Item; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
Anchor : in Vector_3;
child_Anchor : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
collide_Connected : in Boolean;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.hinge_Joint.view := new gel.hinge_Joint.item;
begin
the_Joint.define (Self.World.Space,
Self, the_Child,
pivot_Axis,
Anchor, child_Anchor,
low_Limit, high_Limit,
collide_Connected);
the_Joint.Limits_are (low_Limit, high_Limit);
Self.attach (the_Child, the_Joint.all'Access);
new_Joint := the_Joint.all'Access;
end attach_via_Hinge;
procedure attach_via_Hinge (Self : access Item; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
pivot_Anchor : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.hinge_Joint.view := new gel.hinge_Joint.item;
begin
the_Joint.define (in_Space => Self.World.Space,
Sprite_A => Self,
Sprite_B => the_Child,
pivot_Axis => pivot_Axis,
pivot_Anchor => pivot_Anchor);
the_Joint.Limits_are (low_Limit, high_Limit);
Self.attach (the_Child, the_Joint.all'Access);
new_Joint := the_Joint.all'Access;
end attach_via_Hinge;
procedure attach_via_Hinge (Self : access Item; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.hinge_Joint.view := new gel.hinge_Joint.item;
begin
the_Joint.define (in_Space => Self.World.Space,
Sprite_A => Self,
Sprite_B => the_Child,
pivot_Axis => pivot_Axis);
the_Joint.Limits_are (low_Limit, high_Limit);
Self.attach (the_Child, the_Joint.all'Access);
new_Joint := the_Joint.all'Access;
end attach_via_Hinge;
procedure attach_via_Hinge (Self : access Item; the_Child : in Sprite.view;
Frame_in_parent : in Matrix_4x4;
Frame_in_child : in Matrix_4x4;
Limits : in DoF_Limits;
collide_Connected : in Boolean;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.hinge_Joint.view := new gel.hinge_Joint.item;
begin
the_Joint.define (Self.World.Space,
Self, the_Child,
Frame_in_parent, Frame_in_child,
Limits.Low, Limits.High,
collide_Connected);
the_Joint.Limits_are (limits.Low, limits.High);
Self.attach (the_Child, the_Joint.all'Access);
new_Joint := the_Joint.all'Access;
end attach_via_Hinge;
-- Ball/Socket
--
procedure internal_attach_via_ball_Socket (Self : access Item; the_Child : in Sprite.view;
pitch_Limits : in DoF_Limits;
yaw_Limits : in DoF_Limits;
roll_Limits : in DoF_Limits;
the_Joint : in gel.any_Joint.view)
is
use gel.any_Joint;
begin
the_Joint.low_Bound_is (Pitch, pitch_Limits.Low);
the_Joint.low_Bound_is (Yaw, yaw_Limits .Low);
the_Joint.low_Bound_is (Roll, roll_Limits .Low);
the_Joint.high_Bound_is (Pitch, pitch_Limits.High);
the_Joint.high_Bound_is (Yaw, yaw_Limits .High);
the_Joint.high_Bound_is (Roll, roll_Limits .High);
Self.attach (the_Child, the_Joint.all'Access);
end internal_attach_via_ball_Socket;
procedure attach_via_ball_Socket (Self : access Item; the_Child : in Sprite.view;
pivot_Anchor : in Vector_3;
pivot_Axis : in Matrix_3x3;
pitch_Limits : in DoF_Limits;
yaw_Limits : in DoF_Limits;
roll_Limits : in DoF_Limits;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.any_Joint.view := new gel.any_Joint.item;
begin
the_Joint.define (Self.World.Space,
Self, the_Child,
pivot_Anchor, pivot_Axis);
Self.internal_attach_via_ball_Socket (the_Child,
pitch_Limits,
yaw_Limits,
roll_Limits,
the_joint);
new_Joint := the_Joint.all'Access;
end attach_via_ball_Socket;
procedure attach_via_ball_Socket (Self : access Item; the_Child : in Sprite.view;
Frame_in_parent : in Matrix_4x4;
Frame_in_child : in Matrix_4x4;
pitch_Limits : in DoF_Limits;
yaw_Limits : in DoF_Limits;
roll_Limits : in DoF_Limits;
new_joint : out gel.Joint.view)
is
the_Joint : constant gel.any_Joint.view := new gel.any_Joint.item;
begin
the_Joint.define (Self.World.Space,
Self, the_Child,
Frame_in_parent, Frame_in_child);
Self.internal_attach_via_ball_Socket (the_Child,
pitch_Limits,
yaw_Limits,
roll_Limits,
the_joint);
new_Joint := the_Joint.all'Access;
end attach_via_ball_Socket;
------------
--- Graphics
--
procedure program_Parameters_are (Self : in out Item; Now : in opengl.Program.Parameters_view)
is
begin
Self.program_Parameters := Now;
end program_Parameters_are;
function program_Parameters (Self : in Item) return opengl.Program.Parameters_view
is
begin
return Self.program_Parameters;
end program_Parameters;
-----------
--- Utility
--
function to_Hash (Self : in ada.Tags.Tag) return ada.Containers.Hash_type
is
function Converted is new ada.unchecked_Conversion (ada.Tags.Tag, ada.Containers.Hash_type);
begin
return Converted (Self);
end to_Hash;
pragma Unreferenced (to_Hash);
-- protected
-- body safe_Matrix_4x4
-- is
-- function Value return Matrix_4x4
-- is
-- begin
-- return the_Value;
-- end Value;
--
-- procedure Value_is (Now : in Matrix_4x4)
-- is
-- begin
-- the_Value := Now;
-- end Value_is;
--
-- procedure Site_is (Now : in Vector_3)
-- is
-- begin
-- the_Value (4, 1) := Now (1);
-- the_Value (4, 2) := Now (2);
-- the_Value (4, 3) := Now (3);
-- end Site_is;
-- end safe_Matrix_4x4;
end gel.Sprite;
| 28.37037 | 210 | 0.533041 |
1297a4b77712781f73d6f78bfefc3e8960bcf202 | 3,525 | ads | Ada | include/bits_time_h.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | 5 | 2021-11-03T04:34:16.000Z | 2021-11-10T23:06:30.000Z | include/bits_time_h.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | null | null | null | include/bits_time_h.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | null | null | null | pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with bits_types_h;
limited with bits_timex_h;
package bits_time_h is
-- unsupported macro: CLOCKS_PER_SEC ((__clock_t) 1000000)
CLOCK_REALTIME : constant := 0; -- /usr/include/bits/time.h:46
CLOCK_MONOTONIC : constant := 1; -- /usr/include/bits/time.h:48
CLOCK_PROCESS_CPUTIME_ID : constant := 2; -- /usr/include/bits/time.h:50
CLOCK_THREAD_CPUTIME_ID : constant := 3; -- /usr/include/bits/time.h:52
CLOCK_MONOTONIC_RAW : constant := 4; -- /usr/include/bits/time.h:54
CLOCK_REALTIME_COARSE : constant := 5; -- /usr/include/bits/time.h:56
CLOCK_MONOTONIC_COARSE : constant := 6; -- /usr/include/bits/time.h:58
CLOCK_BOOTTIME : constant := 7; -- /usr/include/bits/time.h:60
CLOCK_REALTIME_ALARM : constant := 8; -- /usr/include/bits/time.h:62
CLOCK_BOOTTIME_ALARM : constant := 9; -- /usr/include/bits/time.h:64
CLOCK_TAI : constant := 11; -- /usr/include/bits/time.h:66
TIMER_ABSTIME : constant := 1; -- /usr/include/bits/time.h:69
-- System-dependent timing definitions. Linux version.
-- Copyright (C) 1996-2021 Free Software Foundation, Inc.
-- This file is part of the GNU C Library.
-- The GNU C Library is free software; you can redistribute it and/or
-- modify it under the terms of the GNU Lesser General Public
-- License as published by the Free Software Foundation; either
-- version 2.1 of the License, or (at your option) any later version.
-- The GNU C Library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- Lesser General Public License for more details.
-- You should have received a copy of the GNU Lesser General Public
-- License along with the GNU C Library; if not, see
-- <https://www.gnu.org/licenses/>.
-- * Never include this file directly; use <time.h> instead.
--
-- ISO/IEC 9899:1999 7.23.1: Components of time
-- The macro `CLOCKS_PER_SEC' is an expression with type `clock_t' that is
-- the number per second of the value returned by the `clock' function.
-- CAE XSH, Issue 4, Version 2: <time.h>
-- The value of CLOCKS_PER_SEC is required to be 1 million on all
-- XSI-conformant systems.
-- Even though CLOCKS_PER_SEC has such a strange value CLK_TCK
-- presents the real value for clock ticks per second for the system.
-- Identifier for system-wide realtime clock.
-- Monotonic system-wide clock.
-- High-resolution timer from the CPU.
-- Thread-specific CPU-time clock.
-- Monotonic system-wide clock, not adjusted for frequency scaling.
-- Identifier for system-wide realtime clock, updated only on ticks.
-- Monotonic system-wide clock, updated only on ticks.
-- Monotonic system-wide clock that includes time spent in suspension.
-- Like CLOCK_REALTIME but also wakes suspended system.
-- Like CLOCK_BOOTTIME but also wakes suspended system.
-- Like CLOCK_REALTIME but in International Atomic Time.
-- Flag to indicate time is absolute.
-- Tune a POSIX clock.
function clock_adjtime (uu_clock_id : bits_types_h.uu_clockid_t; uu_utx : access bits_timex_h.timex) return int -- /usr/include/bits/time.h:78
with Import => True,
Convention => C,
External_Name => "clock_adjtime";
end bits_time_h;
| 42.46988 | 146 | 0.693901 |
df76d0b26073470031a39112917f94d7c3aaebde | 3,417 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-imgint.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-imgint.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-imgint.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ I N T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- signed integer types up to Size Integer'Size, and also for conversion
-- operations required in Text_IO.Integer_IO for such types.
package System.Img_Int is
pragma Pure;
procedure Image_Integer
(V : Integer;
S : in out String;
P : out Natural);
-- Computes Integer'Image (V) and stores the result in S (1 .. P)
-- setting the resulting value of P. The caller guarantees that S
-- is long enough to hold the result, and that S'First is 1.
procedure Set_Image_Integer
(V : Integer;
S : in out String;
P : in out Natural);
-- Stores the image of V in S starting at S (P + 1), P is updated to point
-- to the last character stored. The value stored is identical to the value
-- of Integer'Image (V) except that no leading space is stored when V is
-- non-negative. The caller guarantees that S is long enough to hold the
-- result. S need not have a lower bound of 1.
end System.Img_Int;
| 58.913793 | 79 | 0.462979 |
0bff217ca4785f08970ca1f45d93d8ba59f12bdb | 1,634 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/atomic6_2.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/atomic6_2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/atomic6_2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-fdump-tree-gimple" }
with Atomic6_Pkg; use Atomic6_Pkg;
procedure Atomic6_2 is
Temp : Integer;
begin
Counter1 := Counter1 + Counter2;
Timer1 := Timer1 + Timer2;
Counter1 := Counter1 + Int(Timer1);
Timer1 := Timer1 + Integer(Counter1);
Temp := Integer(Counter1) + Timer1;
Counter1 := Int(Timer1) + Int(Temp);
Timer1 := Integer(Counter1) + Temp;
if Counter1 /= Counter2 then
raise Program_Error;
end if;
if Timer1 /= Timer2 then
raise Program_Error;
end if;
end;
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&atomic6_pkg__counter1" 6 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&atomic6_pkg__counter2" 2 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&atomic6_pkg__timer1" 6 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&atomic6_pkg__timer2" 2 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&temp" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*ptr" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&atomic6_pkg__counter1" 3 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&atomic6_pkg__counter2" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&atomic6_pkg__timer1" 3 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&atomic6_pkg__timer2" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&temp" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*ptr" 0 "gimple"} }
| 36.311111 | 97 | 0.651775 |
c5b63fd61dfda7c8e0cb761ca36e64a88e9452a9 | 6,365 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3601a.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/ce/ce3601a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3601a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3601A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT GET (FOR STRINGS AND CHARACTERS), PUT (FOR STRINGS AND
-- CHARACTERS), GET_LINE, AND PUT_LINE RAISE STATUS_ERROR WHEN
-- CALLED WITH AN UNOPEN FILE PARAMETER. ALSO CHECK NAMES OF FORMAL
-- PARAMETERS.
-- HISTORY:
-- SPS 08/27/82
-- VKG 02/15/83
-- JBG 03/30/83
-- JLH 09/04/87 ADDED CASE WHICH ATTEMPTS TO CREATE FILE AND THEN
-- RETESTED OBJECTIVE.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE CE3601A IS
BEGIN
TEST ("CE3601A", "STATUS_ERROR RAISED BY GET, PUT, GET_LINE, " &
"PUT_LINE WHEN FILE IS NOT OPEN");
DECLARE
FILE1, FILE2 : FILE_TYPE;
CH: CHARACTER := '%';
LST: NATURAL;
ST: STRING (1 .. 10);
LN : STRING (1 .. 80);
BEGIN
BEGIN
GET (FILE => FILE1, ITEM => CH);
FAILED ("STATUS_ERROR NOT RAISED - GET CHARACTER");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET CHARACTER");
END;
BEGIN
GET (FILE => FILE1, ITEM => ST);
FAILED ("STATUS_ERROR NOT RAISED - GET STRING");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET STRING");
END;
BEGIN
GET_LINE (FILE => FILE1, ITEM => LN, LAST => LST);
FAILED ("STATUS_ERROR NOT RAISED - GET_LINE");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET_LINE");
END;
BEGIN
PUT (FILE => FILE1, ITEM => CH);
FAILED ("STATUS_ERROR NOT RAISED - PUT CHARACTER");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT CHARACTER");
END;
BEGIN
PUT (FILE => FILE1, ITEM => ST);
FAILED ("STATUS_ERROR NOT RAISED - PUT STRING");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT STRING");
END;
BEGIN
PUT_LINE (FILE => FILE1, ITEM => LN);
FAILED ("STATUS_ERROR NOT RAISED - PUT_LINE");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT_LINE");
END;
BEGIN
CREATE (FILE2, OUT_FILE); -- THIS IS ONLY AN ATTEMPT TO
CLOSE (FILE2); -- CREATE A FILE. OK, WHETHER
EXCEPTION -- SUCCESSFUL OR NOT.
WHEN USE_ERROR =>
NULL;
END;
BEGIN
GET (FILE => FILE2, ITEM => CH);
FAILED ("STATUS_ERROR NOT RAISED - GET CHARACTER");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET CHARACTER");
END;
BEGIN
GET (FILE => FILE2, ITEM => ST);
FAILED ("STATUS_ERROR NOT RAISED - GET STRING");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET STRING");
END;
BEGIN
GET_LINE (FILE => FILE2, ITEM => LN, LAST => LST);
FAILED ("STATUS_ERROR NOT RAISED - GET_LINE");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - GET_LINE");
END;
BEGIN
PUT (FILE => FILE2, ITEM => CH);
FAILED ("STATUS_ERROR NOT RAISED - PUT CHARACTER");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT CHARACTER");
END;
BEGIN
PUT (FILE => FILE2, ITEM => ST);
FAILED ("STATUS_ERROR NOT RAISED - PUT STRING");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT STRING");
END;
BEGIN
PUT_LINE (FILE => FILE2, ITEM => LN);
FAILED ("STATUS_ERROR NOT RAISED - PUT_LINE");
EXCEPTION
WHEN STATUS_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - PUT_LINE");
END;
END;
RESULT;
END CE3601A;
| 33.856383 | 79 | 0.495522 |
50d110cc4d044abfc9966adba3f409896eb62585 | 4,352 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_00fc.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_00fc.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_00fc.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 © 2012-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$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_00FC is
pragma Preelaborate;
Group_00FC : aliased constant Core_Second_Stage
:= (16#5E# .. 16#63# => -- FC5E .. FC63
(Other_Letter, Neutral,
Other, A_Letter, O_Letter, Alphabetic,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| Changes_When_NFKC_Casefolded => True,
others => False)),
others =>
(Other_Letter, Neutral,
Other, A_Letter, O_Letter, Alphabetic,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start
| Changes_When_NFKC_Casefolded => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_00FC;
| 57.263158 | 78 | 0.438879 |
d0f6015aad136bfcd3044a8c1e556ca2bd708c25 | 715 | ads | Ada | system-multiprocessors.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | system-multiprocessors.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | system-multiprocessors.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) 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
---------------------------------------------------------------------------
package System.Multiprocessors is
pragma Preelaborate(Multiprocessors);
type CPU_Range is range 0 .. implementation_defined;
Not_A_Specific_CPU : constant CPU_Range := 0;
subtype CPU is CPU_Range range 1 .. CPU_Range'Last;
function Number_Of_CPUs return CPU;
end System.Multiprocessors;
| 39.722222 | 75 | 0.657343 |
06eb2d9f9fefbbceb66e7d249c71967c82b2df3f | 1,402 | adb | Ada | ada-assignment/adaptive_quad.adb | PeterYHChen/nyu-pl-assignments | 5d714a3ef34d01a362490fbd39ba880240ba7fd9 | [
"MIT"
] | null | null | null | ada-assignment/adaptive_quad.adb | PeterYHChen/nyu-pl-assignments | 5d714a3ef34d01a362490fbd39ba880240ba7fd9 | [
"MIT"
] | null | null | null | ada-assignment/adaptive_quad.adb | PeterYHChen/nyu-pl-assignments | 5d714a3ef34d01a362490fbd39ba880240ba7fd9 | [
"MIT"
] | null | null | null | with Text_Io; -- always need these two lines for printing
use Text_Io;
with Ada.Float_Text_IO;
use Ada.Float_Text_IO;
package body Adaptive_Quad is
function SimpsonsRule(a, b:float) return float is
c, h3:float;
begin
c := (a+b) / 2.0;
h3 := abs(b-a) / 6.0;
return h3*(f(a) + 4.0*f(c) + f(b));
end SimpsonsRule;
function RecAQuad(a, b, eps, whole:float) return float is
c, left, right:float;
result1, result2:float;
procedure Rec is
task recurTask1;
task recurTask2;
task body recurTask1 is
begin
result1 := RecAQuad(a, c, eps/2.0, left);
end recurTask1;
task body recurTask2 is
begin
result2 := RecAQuad(c, b, eps/2.0, right);
end recurTask2;
begin -- Rec
null;
end Rec;
begin
c := (a+b) / 2.0;
left := SimpsonsRule(a,c);
right := SimpsonsRule(c,b);
if (abs(left + right - whole) <= 15.0*eps) then
return left + right + (left + right - whole)/15.0;
else
Rec;
end if;
return result1 + result2;
end RecAQuad;
function AQuad(a, b, eps:float) return float is
begin
return RecAQuad(a, b, eps, SimpsonsRule(a,b));
end AQuad;
end Adaptive_Quad; | 25.962963 | 62 | 0.523538 |
4dac1de177f7cd049a29c5d0e680eeebd31e79c4 | 3,221 | adb | Ada | ejercicios6/prueba_interseccion.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/prueba_interseccion.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/prueba_interseccion.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | with Ada.Text_Io, Datos;
with Crear_Lista_Vacia, Esc, Ins, Interseccion;
use Datos;
use Ada.Text_Io;
procedure Prueba_Interseccion is
Lis1, Lis2 : Lista; -- variables del programa principal
procedure Pedir_Return is
begin
Put_Line("pulsa return para continuar ");
Skip_Line;
end Pedir_Return;
begin -- programa principal
-- Casos de prueba:
-- 1. Dos listas vacias.
-- 2. Una lista vacia y la otra no.
-- 3. Listas de un solo elemento que es comun.
-- 4. Listas de un solo elemento que es distinto.
-- 5. Listas de varios elementos.
-- 5.1. Listas de varios elementos. Elementos comunes
-- 5.2. Listas de varios elementos. Elementos disjuntos
Put_Line("Programa de prueba: ");
Put_Line("*********");
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Put_Line("Caso de prueba 1: Listas vacias ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista vacia: ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Ins(Lis1, 3);
Ins(Lis1, 5);
Put_Line("Caso de prueba 2: Una lista vacia y la otra no. ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista vacia: ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Ins(Lis1, 3);
Ins(Lis2, 3);
Put_Line("Caso de prueba 3: Listas de un solo elemento que es comun. ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista <3> ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Ins(Lis1, 3);
Ins(Lis2, 5);
Put_Line("Caso de prueba 4: Listas de un solo elemento que es distinto. ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista <> ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Ins(Lis1, 3);
Ins(Lis1, 5);
Ins(Lis1, 7);
Ins(Lis1, 9);
Ins(Lis2, 5);
Ins(Lis2, 9);
Put_Line("Caso de prueba 5.1: Listas de varios elementos. Elementos comunes. ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista <9, 5> ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Crear_Lista_Vacia(Lis1);
Crear_Lista_Vacia(Lis2);
Ins(Lis1, 3);
Ins(Lis1, 5);
Ins(Lis1, 7);
Ins(Lis1, 9);
Ins(Lis2, 11);
Ins(Lis2, 13);
Put_Line("Caso de prueba 5.2: Listas de varios elementos. Elementos disjuntos. ");
Put_Line("Las listas iniciales contienen ");
Esc(Lis1);
Esc(Lis2);
Put_Line("Ahora deberia escribir la lista <> ");
Esc(Interseccion(Lis1, Lis2));
New_Line;
New_Line;
Pedir_Return;
Put_Line("Se acabo la prueba. Agur ");
end Prueba_Interseccion;
| 23.510949 | 85 | 0.65104 |
cbacf84727da69102a65252d1ce7219b8d45af38 | 4,812 | adb | Ada | source/amf/mofext/amf-internals-modules-mofext_module.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mofext/amf-internals-modules-mofext_module.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mofext/amf-internals-modules-mofext_module.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.Factories.MOF_Factories;
with AMF.Internals.Factories.MOFEXT_Module_Factory;
with AMF.Internals.Tables.MOFEXT_Element_Table;
with AMF.Internals.Tables.MOF_Metamodel.Links;
with AMF.Internals.Tables.MOF_Metamodel.Objects;
with AMF.Internals.Tables.MOF_Metamodel.Properties;
with AMF.Internals.Modules.UML_Module;
pragma Unreferenced (AMF.Internals.Modules.UML_Module);
pragma Elaborate_All (AMF.Internals.Modules.UML_Module);
-- UML nodule package and all its dependencies must be elaborated before
-- elaboration of this package.
package body AMF.Internals.Modules.MOFEXT_Module is
-- Global object of factory for supported metamodel.
MOF_Module_Factory : aliased
AMF.Internals.Factories.MOFEXT_Module_Factory.MOF_Module_Factory;
Module : AMF_Metamodel;
begin
-- Register module's factory.
AMF.Internals.Factories.Register (MOF_Module_Factory'Access, Module);
-- Initialize metamodels.
AMF.Internals.Tables.MOF_Metamodel.Objects.Initialize;
AMF.Internals.Tables.MOF_Metamodel.Properties.Initialize;
AMF.Internals.Tables.MOF_Metamodel.Links.Initialize;
-- Initialize element table of MOF metamodel.
AMF.Internals.Tables.MOFEXT_Element_Table.Initialize (Module);
-- Register factories.
AMF.Internals.Factories.Register
(AMF.Internals.Factories.MOF_Factories.Get_Package,
AMF.Internals.Factories.MOF_Factories.Constructor'Access);
end AMF.Internals.Modules.MOFEXT_Module;
| 55.953488 | 78 | 0.512884 |
06fb630bb4bc66bf159917a14446f9f3d639bf1b | 266 | ada | Ada | Task/Function-prototype/Ada/function-prototype-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Function-prototype/Ada/function-prototype-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Function-prototype/Ada/function-prototype-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | function noargs return Integer;
function twoargs (a, b : Integer) return Integer;
-- varargs do not exist
function optionalargs (a, b : Integer := 0) return Integer;
-- all parameters are always named, only calling by name differs
procedure dostuff (a : Integer);
| 38 | 65 | 0.74812 |
4d1b2909ea8216530cb18ffa7556b7056c15d59e | 5,187 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-tasloc.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-tasloc.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-tasloc.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T A S K _ L O C K --
-- --
-- S p e c --
-- --
-- Copyright (C) 1998-2021, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Simple task lock and unlock routines
-- A small package containing a task lock and unlock routines for creating
-- a critical region. The lock involved is a global lock, shared by all
-- tasks, and by all calls to these routines, so these routines should be
-- used with care to avoid unnecessary reduction of concurrency.
-- These routines may be used in a non-tasking program, and in that case
-- they have no effect (they do NOT cause the tasking runtime to be loaded).
-- Note: this package is in the System hierarchy so that it can be directly
-- be used by other predefined packages. User access to this package is via
-- a renaming of this package in GNAT.Task_Lock (file g-tasloc.ads).
package System.Task_Lock is
pragma Preelaborate;
procedure Lock;
pragma Inline (Lock);
-- Acquires the global lock, starts the execution of a critical region
-- which no other task can enter until the locking task calls Unlock
procedure Unlock;
pragma Inline (Unlock);
-- Releases the global lock, allowing another task to successfully
-- complete a Lock operation. Terminates the critical region.
--
-- The recommended protocol for using these two procedures is as
-- follows:
--
-- Locked_Processing : begin
-- Lock;
-- ...
-- TSL.Unlock;
--
-- exception
-- when others =>
-- Unlock;
-- raise;
-- end Locked_Processing;
--
-- This ensures that the lock is not left set if an exception is raised
-- explicitly or implicitly during the critical locked region.
--
-- Note on multiple calls to Lock: It is permissible to call Lock
-- more than once with no intervening Unlock from a single task,
-- and the lock will not be released until the corresponding number
-- of Unlock operations has been performed. For example:
--
-- System.Task_Lock.Lock; -- acquires lock
-- System.Task_Lock.Lock; -- no effect
-- System.Task_Lock.Lock; -- no effect
-- System.Task_Lock.Unlock; -- no effect
-- System.Task_Lock.Unlock; -- no effect
-- System.Task_Lock.Unlock; -- releases lock
--
-- However, as previously noted, the Task_Lock facility should only
-- be used for very local locks where the probability of conflict is
-- low, so usually this kind of nesting is not a good idea in any case.
-- In more complex locking situations, it is more appropriate to define
-- an appropriate protected type to provide the required locking.
--
-- It is an error to call Unlock when there has been no prior call to
-- Lock. The effect of such an erroneous call is undefined, and may
-- result in deadlock, or other malfunction of the run-time system.
end System.Task_Lock;
| 52.393939 | 78 | 0.50106 |
4defdf2480a7a6d98f8316ce6bfeca1789f2f08e | 8,722 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cofuma.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cofuma.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cofuma.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.FUNCTIONAL_MAPS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2016-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
------------------------------------------------------------------------------
pragma Ada_2012;
package body Ada.Containers.Functional_Maps with SPARK_Mode => Off is
use Key_Containers;
use Element_Containers;
---------
-- "=" --
---------
function "=" (Left : Map; Right : Map) return Boolean is
(Left.Keys <= Right.Keys and Right <= Left);
----------
-- "<=" --
----------
function "<=" (Left : Map; Right : Map) return Boolean is
I2 : Count_Type;
begin
for I1 in 1 .. Length (Left.Keys) loop
I2 := Find (Right.Keys, Get (Left.Keys, I1));
if I2 = 0
or else Get (Right.Elements, I2) /= Get (Left.Elements, I1)
then
return False;
end if;
end loop;
return True;
end "<=";
---------
-- Add --
---------
function Add
(Container : Map;
New_Key : Key_Type;
New_Item : Element_Type) return Map
is
begin
return
(Keys =>
Add (Container.Keys, Length (Container.Keys) + 1, New_Key),
Elements =>
Add
(Container.Elements, Length (Container.Elements) + 1, New_Item));
end Add;
---------------------------
-- Elements_Equal_Except --
---------------------------
function Elements_Equal_Except
(Left : Map;
Right : Map;
New_Key : Key_Type) return Boolean
is
begin
for J in 1 .. Length (Left.Keys) loop
declare
K : constant Key_Type := Get (Left.Keys, J);
begin
if not Equivalent_Keys (K, New_Key)
and then
(Find (Right.Keys, K) = 0
or else Get (Right.Elements, Find (Right.Keys, K)) /=
Get (Left.Elements, J))
then
return False;
end if;
end;
end loop;
return True;
end Elements_Equal_Except;
function Elements_Equal_Except
(Left : Map;
Right : Map;
X : Key_Type;
Y : Key_Type) return Boolean
is
begin
for J in 1 .. Length (Left.Keys) loop
declare
K : constant Key_Type := Get (Left.Keys, J);
begin
if not Equivalent_Keys (K, X)
and then not Equivalent_Keys (K, Y)
and then
(Find (Right.Keys, K) = 0
or else Get (Right.Elements, Find (Right.Keys, K)) /=
Get (Left.Elements, J))
then
return False;
end if;
end;
end loop;
return True;
end Elements_Equal_Except;
---------
-- Get --
---------
function Get (Container : Map; Key : Key_Type) return Element_Type is
begin
return Get (Container.Elements, Find (Container.Keys, Key));
end Get;
-------------
-- Has_Key --
-------------
function Has_Key (Container : Map; Key : Key_Type) return Boolean is
begin
return Find (Container.Keys, Key) > 0;
end Has_Key;
-----------------
-- Has_Witness --
-----------------
function Has_Witness
(Container : Map;
Witness : Count_Type) return Boolean
is
(Witness in 1 .. Length (Container.Keys));
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Map) return Boolean is
begin
return Length (Container.Keys) = 0;
end Is_Empty;
-------------------
-- Keys_Included --
-------------------
function Keys_Included (Left : Map; Right : Map) return Boolean is
begin
for J in 1 .. Length (Left.Keys) loop
declare
K : constant Key_Type := Get (Left.Keys, J);
begin
if Find (Right.Keys, K) = 0 then
return False;
end if;
end;
end loop;
return True;
end Keys_Included;
--------------------------
-- Keys_Included_Except --
--------------------------
function Keys_Included_Except
(Left : Map;
Right : Map;
New_Key : Key_Type) return Boolean
is
begin
for J in 1 .. Length (Left.Keys) loop
declare
K : constant Key_Type := Get (Left.Keys, J);
begin
if not Equivalent_Keys (K, New_Key)
and then Find (Right.Keys, K) = 0
then
return False;
end if;
end;
end loop;
return True;
end Keys_Included_Except;
function Keys_Included_Except
(Left : Map;
Right : Map;
X : Key_Type;
Y : Key_Type) return Boolean
is
begin
for J in 1 .. Length (Left.Keys) loop
declare
K : constant Key_Type := Get (Left.Keys, J);
begin
if not Equivalent_Keys (K, X)
and then not Equivalent_Keys (K, Y)
and then Find (Right.Keys, K) = 0
then
return False;
end if;
end;
end loop;
return True;
end Keys_Included_Except;
------------
-- Length --
------------
function Length (Container : Map) return Count_Type is
begin
return Length (Container.Elements);
end Length;
------------
-- Remove --
------------
function Remove (Container : Map; Key : Key_Type) return Map is
J : constant Extended_Index := Find (Container.Keys, Key);
begin
return
(Keys => Remove (Container.Keys, J),
Elements => Remove (Container.Elements, J));
end Remove;
---------------
-- Same_Keys --
---------------
function Same_Keys (Left : Map; Right : Map) return Boolean is
(Keys_Included (Left, Right)
and Keys_Included (Left => Right, Right => Left));
---------
-- Set --
---------
function Set
(Container : Map;
Key : Key_Type;
New_Item : Element_Type) return Map
is
(Keys => Container.Keys,
Elements =>
Set (Container.Elements, Find (Container.Keys, Key), New_Item));
-----------
-- W_Get --
-----------
function W_Get
(Container : Map;
Witness : Count_Type) return Element_Type
is
(Get (Container.Elements, Witness));
-------------
-- Witness --
-------------
function Witness (Container : Map; Key : Key_Type) return Count_Type is
(Find (Container.Keys, Key));
end Ada.Containers.Functional_Maps;
| 29.367003 | 78 | 0.468127 |
12615af8ff22648cd63ad9261efdaf10bfd32f1c | 10,846 | adb | Ada | test/data/Ada-83/signup.adb | jfitz/code-stat | dd2a13177f3ef03ab42123ef3cfcbbd062a2ae26 | [
"MIT"
] | null | null | null | test/data/Ada-83/signup.adb | jfitz/code-stat | dd2a13177f3ef03ab42123ef3cfcbbd062a2ae26 | [
"MIT"
] | null | null | null | test/data/Ada-83/signup.adb | jfitz/code-stat | dd2a13177f3ef03ab42123ef3cfcbbd062a2ae26 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Exceptions; use Ada.Exceptions;
procedure Checkpres is
-- input file: signups
People : File_Type;
-- output files: times.html, names.html
Times : File_Type;
Pos, Lno : Integer := 0;
Buf : String (1 .. 1024) := (others => ' ');
Last, First : Integer := 0;
type Day_Record is record
Month : Integer;
Day : Integer;
end record;
type Day_Array is array (Natural range <>) of Day_Record;
Presentation_Days : constant Day_Array := ((9, 23), (9, 30), (10, 7), (10, 14), (10, 21),
(10, 28), (11, 04), (11, 18), (12, 2), (12, 9));
type String_Access is access String;
type Student_Index is new Integer range -1 .. 52;
Student_Names : array (Student_Index range 0 .. 52) of String_Access;
Last_Student : Student_Index := Student_Names'First - 1;
Name_Order : array (Student_Names'Range) of Student_Index;
type Presentation is record
Student : Student_Index := -1;
Topic : String_Access := null;
end record;
type Slot_Index is new Integer;
Slots : array (Slot_Index range 0 .. Presentation_Days'Length * 8 - 1) of Presentation;
subtype Time_String is String (1 .. 5);
Presentation_Times : constant array (0 .. 7) of Time_String :=
("12:20", "12:30", "12:40", "12:50", "01:25", "01:35", "01:45", "01:55");
function Time (I : Slot_Index) return String is
begin
return Presentation_Times (Integer (I) mod 8);
end Time;
function Recitation (I : Slot_Index) return Positive is
begin
return 1 + (Integer (I) / 4) mod 2;
end Recitation;
function Month (I : Slot_Index) return Positive is
begin
return Presentation_Days (Integer (I) / 8).Month;
end Month;
function Day (I : Slot_Index) return Positive is
begin
return Presentation_Days (Integer (I) / 8).Day;
end Day;
procedure Error (Msg : String) is
begin
Put_Line (Msg);
raise Data_Error;
end Error;
function Find_Slot (Month : Positive;
Day : Positive;
Recitation : Positive;
Slot : Positive) return Slot_Index is
J, K : Slot_Index;
begin
for I in Presentation_Days'range loop
if Presentation_Days (I).Month = Month and then
Presentation_Days (I).Day = Day then
J := Slot_Index( I - Presentation_Days'First);
K := J * 8 + Slot_Index (Recitation - 1) * 4 + Slot_Index (Slot) - 1;
return Slots'First + Slot_Index (K);
end if;
end loop;
Error ("problem with slot identification");
return -1;
end Find_Slot;
function Find_Slot (S : Student_Index) return Slot_Index is
begin
for I in Slots'range loop
if Slots (I).Student = S then return I;
end if;
end loop;
return -1;
end Find_Slot;
procedure Check_Topic (Topic : String; Section : Integer) is
begin
for I in Slots'range loop
if Recitation (I) = Section then
declare
T : String_Access renames Slots (I).Topic;
begin
if T /= null and then T.all /= "TBD" and then
T.all (T.all'First .. T.all'First + 2) =
Topic (Topic'First .. Topic'First + 2) then
Error ("""" & Topic & """" & " apparently duplicates """ &
T.all & """");
end if;
end;
end if;
end loop;
end Check_Topic;
procedure Sort_Names is
I, J, K : Student_Index;
begin
for L in Name_Order'Range loop
Name_Order (L) := L;
end loop;
I := Student_Names'First;
Sort:
while I < Last_Student loop
-- items 1 .. I are sorted
while Student_Names (Name_Order (I)).all <= Student_Names (Name_Order (I+1)).all
loop
-- items 1 .. I + 1 are sorted
I := I + 1;
if I >= Last_Student then exit Sort; end if;
end loop;
-- items 1 .. I are sorted; item I+1 < item I
K := Name_Order (I + 1); J := I; I := J + 1;
loop
-- items 1 .. J are sorted; tsk < items J+1 .. I are sorted
Name_Order (J + 1) := Name_Order (J);
exit when J = 1 or else
Student_Names (Name_Order (J - 1)).all <= Student_Names (K).all;
J := J - 1;
end loop;
Name_Order (J) := K;
end loop Sort;
end Sort_Names;
begin
-- read in data from signup file
-- line format: "student name" section month day section slot "topic"
Open (People, In_File, "signups");
declare
Month : Integer range 9 .. 12;
Day : Integer range 1 .. 31;
Section : Integer range 1 .. 2;
Slot : Integer range 1 .. 4;
I : Slot_Index;
begin
loop
Get_Line (People, Buf, Last);
exit when Last < Buf'First;
Lno := Lno + 1;
-- extract student name field
if Last = Buf'Last then
Error ("input line longer than " & Integer'Image (Last - 1));
end if;
Pos := Buf'First;
if Buf (Pos) /= '"' then
Error ("missing "" at start of name field");
end if;
Pos := Pos + 1; First := Pos;
while Pos <= Last and then Buf (Pos) /= '"' loop
Pos := Pos + 1;
end loop;
if Buf (Pos) /= '"' then
Error ("missing "" at end of name field");
end if;
Last_Student := Last_Student + 1;
Student_Names (Last_Student) := new String'(Buf (First .. Pos - 1));
Get (Buf (Pos + 1 .. Last), Section, Pos);
if Pos < Last then
-- read month, day, section, and slot as integers
Get (Buf (Pos + 1 .. Last), Month, Pos);
Get (Buf (Pos + 1 .. Last), Day, Pos);
Get (Buf (Pos + 1 .. Last), Slot, Pos);
I := Find_Slot (Month, Day, Section, Slot);
-- read topic
loop
Pos := Pos + 1;
exit when Pos = Last or else Buf (Pos) /= ' ';
end loop;
if Buf (Pos) /= '"' then
Error ("missing "" at start of topic field");
end if;
Pos := Pos + 1; First := Pos;
while Pos <= Last and then Buf (Pos) /= '"' loop
Pos := Pos + 1;
end loop;
if Buf (Pos) /= '"' then
Error ("missing "" at end of topic field");
end if;
Check_Topic (Buf (First .. Pos - 1), Section);
if Slots (I).Student /= -1 then
Error ("conflicting assignments: "
& Student_Names (Last_Student).all & "vs."
& Student_Names (Slots (I).Student).all);
-- don't bother freeing Name_String,
-- since this is a one-shot program
-- and the number of names is few
else
Slots (I).Student := Last_Student;
Slots (I).Topic := new String' (Buf (First .. Pos - 1));
end if;
end if;
end loop;
exception
when End_Error => null;
end;
begin
Open (Times, Out_File, "times.html");
exception
when Name_Error =>
Create (Times, Out_File, "times.html");
end;
Put_Line (Times, "<!DOCTYPE HTML PUBLIC ""-//W3C//DTD HTML 4.01 Transitional//EN""><HTML><HEAD>");
Put_Line (Times, "<TITLE>times.html</TITLE>");
Put_Line (Times, "<META HTTP-EQUIV=""CONTENT-TYPE"" CONTENT=""TEXT/HTML; CHARSET=ISO-8859-1"">");
Put_Line (Times, "<LINK REL=""stylesheet"" TYPE=""text/css"" href=""style.css"" title=""stylesheet"">");
Put_Line (Times, "</HEAD><BODY><TABLE WIDTH=""100%""><TR><TD BGCOLOR=""#660000"" ALIGN=RIGHT>");
Put_Line (Times, "<A HREF=""../index.html""><U><FONT COLOR=""CCCC99""><FONT SIZE=2>");
Put_Line (Times, "COP 4020: Programming Languages</FONT>↑</FONT></U></A></TD></TR></TABLE>");
Put_Line (Times, "<CENTER><H1 ALIGN=""CENTER"">Presentation Schedule</H1></CENTER>");
Put_Line (Times, "<TABLE WIDTH=""100%""><TR><TD BGCOLOR=""#CCCC99""><B>Fall Term 2005</B></TD></TR></TABLE>");
Put_Line (Times, "<P></P><UL><LI><A HREF=""times.html#Name"">by name</A></LI>");
Put_Line (Times, "<LI><A HREF=""times.html#Time"">by time</A></LI></UL><HR>");
Put_Line (Times, "<A NAME=""Time"">");
Put_Line (Times, "<P></P><TABLE BORDER>");
Put_Line (Times, "<TR><TH>Month</TH><TH>Day</TH><TH>Time</TH><TH>Student</TH><TH>Topic</TH></TR>");
for I in Slots'Range loop
if I mod 8 = 0 then
Put (Times, "<TR><TD COLSPAN=5 BGCOLOR=""#ff6600""></TD></TR>");
end if;
-- create html line for this slot, showing the person and topic
Put (Times, "<TR><TD>"); Put (Times, Month (I));
Put (Times, "</TD><TD>"); Put (Times, Day (I));
Put (Times, "</TD><TD>"); Put (Times, Time (I));
if Slots(I).Student /= -1 then
Put (Times, "</TD><TD>"); Put (Times, Student_Names (Slots(I).Student).all);
Put (Times, "</TD><TD>"); Put (Times, Slots(I).Topic.all);
end if;
Put_Line (Times, "</TD></TR>");
end loop;
Sort_Names;
Put_Line (Times, "</TABLE><HR><TABLE BORDER><A NAME=""Name"">");
Put_Line (Times, "<TR><TH>Name</TH><TH>Month</TH><TH>Day</TH><TH>Time</TH><TH>Topic</TH></TR>");
declare
I : Slot_Index;
begin
for S in Student_Names'First .. Last_Student loop
-- create html line for this person, showing time and topic
Put (Times, "<TR><TD>"); Put (Times, Student_Names (Name_Order (S)).all);
I := Find_Slot (Name_Order(S));
if I >= Slots'First then
Put (Times, "</TD><TD>"); Put (Times, Month (I));
Put (Times, "</TD><TD>"); Put (Times, Day (I));
Put (Times, "</TD><TD>"); Put (Times, Time (I));
Put (Times, "</TD><TD>"); Put (Times, Slots(I).Topic.all);
end if;
Put_Line (Times, "</TD></TR>");
end loop;
end;
Put_Line (Times, "</TABLE>");
Put_Line (Times, "<TABLE WIDTH=""100%""><TR><TD BGCOLOR=""#CCCC99""><FONT SIZE=""1"">© 2005");
Put_Line (Times, "<A HREF=""http://www.cs.fsu.edu/~baker"">T. P. Baker</A>. <BR> ($Id: checkpres.adb,v 1.2 2005/09/08 20:36:47 baker Exp baker $)");
Put_Line (Times, "</FONT> </TD></TR></TABLE> </BODY> </HTML>");
Close (Times);
exception
when E : others =>
Put (Lno, 4); Put (": '"); Put (Buf (Buf'First .. Last));
Put_Line ("'"); Put (" ");
for I in 1 .. Pos loop
Put (' ');
end loop;
Put_Line ("^");
Put_Line (Ada.Exceptions.Exception_Name (E)); New_Line;
raise;
end Checkpres; | 37.4 | 151 | 0.535866 |
1285df8f853bd0254873657c76057b5c76a80bf4 | 3,945 | ads | Ada | server/jason-applications.ads | stcarrez/jason | eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc | [
"Apache-2.0"
] | 2 | 2019-01-26T22:14:55.000Z | 2019-01-28T10:49:46.000Z | server/jason-applications.ads | stcarrez/jason | eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc | [
"Apache-2.0"
] | null | null | null | server/jason-applications.ads | stcarrez/jason | eee21b84fb6bab2e05b1f4df408d8f9ed34cbccc | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- jason -- jason applications
-- Copyright (C) 2016, 2018 Stephane.Carrez
-- Written by Stephane.Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ASF.Servlets.Faces;
with Servlet.Core.Files;
with ASF.Servlets.Ajax;
with ASF.Filters.Dump;
with Servlet.Core.Measures;
with ASF.Security.Servlets;
with AWA.Users.Servlets;
with AWA.Users.Modules;
with AWA.Mail.Modules;
with AWA.Comments.Modules;
with AWA.Tags.Modules;
with AWA.Storages.Modules;
with AWA.Applications;
with AWA.Workspaces.Modules;
with AWA.Services.Filters;
with Jason.Projects.Modules;
with Jason.Tickets.Modules;
package Jason.Applications is
CONFIG_PATH : constant String := "/jason";
CONTEXT_PATH : constant String := "/jason";
type Application is new AWA.Applications.Application with private;
type Application_Access is access all Application'Class;
-- Initialize the application.
procedure Initialize (App : in Application_Access);
-- Initialize the servlets provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application servlets.
overriding
procedure Initialize_Servlets (App : in out Application);
-- Initialize the filters provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application filters.
overriding
procedure Initialize_Filters (App : in out Application);
-- Initialize the AWA modules provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the modules used by the application.
overriding
procedure Initialize_Modules (App : in out Application);
-- Create the Jason application instance.
function Create return Application_Access;
private
type Application is new AWA.Applications.Application with record
Self : Application_Access;
-- Application servlets and filters (add new servlet and filter instances here).
Faces : aliased ASF.Servlets.Faces.Faces_Servlet;
Ajax : aliased ASF.Servlets.Ajax.Ajax_Servlet;
Files : aliased Servlet.Core.Files.File_Servlet;
Dump : aliased ASF.Filters.Dump.Dump_Filter;
Service_Filter : aliased AWA.Services.Filters.Service_Filter;
Measures : aliased Servlet.Core.Measures.Measure_Servlet;
-- Authentication servlet and filter.
Auth : aliased ASF.Security.Servlets.Request_Auth_Servlet;
Verify_Auth : aliased AWA.Users.Servlets.Verify_Auth_Servlet;
-- The application modules.
User_Module : aliased AWA.Users.Modules.User_Module;
Workspace_Module : aliased AWA.Workspaces.Modules.Workspace_Module;
Mail_Module : aliased AWA.Mail.Modules.Mail_Module;
Comment_Module : aliased AWA.Comments.Modules.Comment_Module;
Storage_Module : aliased AWA.Storages.Modules.Storage_Module;
Tag_Module : aliased AWA.Tags.Modules.Tag_Module;
-- Add your modules here.
Project_Module : aliased Jason.Projects.Modules.Project_Module;
Ticket_Module : aliased Jason.Tickets.Modules.Ticket_Module;
end record;
end Jason.Applications;
| 39.848485 | 87 | 0.69379 |
a10ba1f42d41ffe3a11997695027e5ddd744876e | 4,745 | adb | Ada | scheduling-execute_image.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 13 | 2021-09-28T18:14:32.000Z | 2022-02-09T17:48:53.000Z | scheduling-execute_image.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 9 | 2021-09-28T19:18:25.000Z | 2022-01-14T22:54:06.000Z | scheduling-execute_image.adb | 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 --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, 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 is the POSIX (execve) implementation
with Interfaces.C.Strings;
separate (Scheduling)
procedure Execute_Image is
use Interfaces.C;
use Interfaces.C.Strings;
Image_Path: constant String := UBS.To_String (Parameters.Executable);
path : constant char_array := To_C (Image_Path);
arg_1: aliased char_array := To_C (Ada.Directories.Simple_Name (Image_Path));
argv : constant chars_ptr_array := (0 => To_Chars_Ptr (arg_1'Unchecked_Access),
1 => Null_Ptr);
environ: access constant chars_ptr_array
with Convention => C, Import => True, External_Name => "environ";
-- environ(7)
function execve (path: char_array; argv, envp: chars_ptr_array) return int
with Convention => C, Import => True, External_Name => "execve";
-- execve(2)
Discard: int;
begin
UI.Put_Info_Tag;
Put_Line (" Running compiled program . . .");
New_Line;
UI.Put_Divider;
Discard := execve (path => To_C (Image_Path),
argv => argv,
envp => environ.all);
-- execve only returns if it failed
pragma Assert (Discard = -1);
raise Process_Failed with "execve failed for image at path: " & Image_Path;
end Execute_Image;
| 54.54023 | 82 | 0.45627 |
4dbd37eaed3329b0ce2fc5157f41c1167753a97e | 2,854 | adb | Ada | ada_lists/src/lists-dynamic.adb | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | 6 | 2020-11-26T20:01:50.000Z | 2022-03-04T22:22:12.000Z | ada_lists/src/lists-dynamic.adb | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | null | null | null | ada_lists/src/lists-dynamic.adb | gerr135/ada_gems | fc1b55e991766110581fcc340c8bc7c51ef7a49b | [
"BSD-2-Clause"
] | null | null | null | package body Lists.dynamic is
overriding
function Element_Constant_Reference (Container : aliased in List; Index : Index_Type) return Constant_Reference_Type is
CVR : ACV.Constant_Reference_Type := Container.vec.Constant_Reference(Index);
R : Constant_Reference_Type(CVR.Element);
begin
return R;
end;
overriding
function Element_Constant_Reference (Container : aliased in List; Position : Cursor) return Constant_Reference_Type is
begin
return Element_Constant_Reference(Container, Position.Index);
end;
overriding
function Element_Reference (Container : aliased in out List; Index : Index_Type) return Reference_Type is
VR : ACV.Reference_Type := Container.vec.Reference(Index);
R : Reference_Type(VR.Element);
begin
return R;
end;
overriding
function Element_Reference (Container : aliased in out List; Position : Cursor) return Reference_Type is
begin
return Element_Reference(Container, Position.Index);
end;
function To_Vector (Length : Index_Type) return List is
L : List := (vec => ACV.To_Vector(Ada.Containers.Count_Type(Length)));
begin
return L;
end;
overriding
function Iterate (Container : in List) return Iterator_Interface'Class is
It : Iterator := (Container'Unrestricted_Access, Index_Base'First);
begin
return It;
end;
function Has_Element (L : List; Position : Index_Base) return Boolean is
begin
return ACV.Has_Element(L.vec.To_Cursor(Position));
end;
overriding
function First (Object : Iterator) return Cursor is
C : Cursor := (Object.Container, Index_Type'First);
begin
return C;
end;
overriding
function Last (Object : Iterator) return Cursor is
C : Cursor := (Object.Container, List(Object.Container.all).vec.Last_Index);
begin
return C;
end;
overriding
function Next (Object : Iterator; Position : Cursor) return Cursor is
C : Cursor := (Object.Container, Position.Index + 1);
begin
return C;
end;
overriding
function Previous (Object : Iterator; Position : Cursor) return Cursor is
C : Cursor := (Object.Container, Position.Index - 1);
begin
return C;
end;
overriding
function Length (Container : aliased in out List) return Index_Base is
begin
return Index_Base(Container.vec.Length);
end;
overriding
function First_Index(Container : aliased in out List) return Index_Type is
begin
return Index_Type'First;
end;
overriding
function Last_Index (Container : aliased in out List) return Index_Type is
begin
return Index_Type'First + Index_Base(Container.vec.Length) - 1;
end;
end Lists.dynamic;
| 28.54 | 123 | 0.67309 |
4abe266cf9ac5060ce0308db4c791a888151fb69 | 5,374 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-exetim__default.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-exetim__default.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-exetim__default.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . E X E C U T I O N _ T I M E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2007-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Task_Identification;
with Ada.Real_Time;
package Ada.Execution_Time with
SPARK_Mode
is
type CPU_Time is private;
CPU_Time_First : constant CPU_Time;
CPU_Time_Last : constant CPU_Time;
CPU_Time_Unit : constant := Ada.Real_Time.Time_Unit;
CPU_Tick : constant Ada.Real_Time.Time_Span;
use type Ada.Task_Identification.Task_Id;
function Clock
(T : Ada.Task_Identification.Task_Id :=
Ada.Task_Identification.Current_Task)
return CPU_Time
with
Volatile_Function,
Global => Ada.Real_Time.Clock_Time,
Pre => T /= Ada.Task_Identification.Null_Task_Id;
function "+"
(Left : CPU_Time;
Right : Ada.Real_Time.Time_Span) return CPU_Time
with
Global => null;
function "+"
(Left : Ada.Real_Time.Time_Span;
Right : CPU_Time) return CPU_Time
with
Global => null;
function "-"
(Left : CPU_Time;
Right : Ada.Real_Time.Time_Span) return CPU_Time
with
Global => null;
function "-"
(Left : CPU_Time;
Right : CPU_Time) return Ada.Real_Time.Time_Span
with
Global => null;
function "<" (Left, Right : CPU_Time) return Boolean with
Global => null;
function "<=" (Left, Right : CPU_Time) return Boolean with
Global => null;
function ">" (Left, Right : CPU_Time) return Boolean with
Global => null;
function ">=" (Left, Right : CPU_Time) return Boolean with
Global => null;
procedure Split
(T : CPU_Time;
SC : out Ada.Real_Time.Seconds_Count;
TS : out Ada.Real_Time.Time_Span)
with
Global => null;
function Time_Of
(SC : Ada.Real_Time.Seconds_Count;
TS : Ada.Real_Time.Time_Span := Ada.Real_Time.Time_Span_Zero)
return CPU_Time
with
Global => null;
Interrupt_Clocks_Supported : constant Boolean := False;
Separate_Interrupt_Clocks_Supported : constant Boolean := False;
pragma Warnings (Off, "check will fail at run time");
function Clock_For_Interrupts return CPU_Time with
Volatile_Function,
Global => Ada.Real_Time.Clock_Time,
Pre => Interrupt_Clocks_Supported;
pragma Warnings (On, "check will fail at run time");
private
pragma SPARK_Mode (Off);
type CPU_Time is new Ada.Real_Time.Time;
CPU_Time_First : constant CPU_Time := CPU_Time (Ada.Real_Time.Time_First);
CPU_Time_Last : constant CPU_Time := CPU_Time (Ada.Real_Time.Time_Last);
CPU_Tick : constant Ada.Real_Time.Time_Span := Ada.Real_Time.Tick;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
end Ada.Execution_Time;
| 40.104478 | 78 | 0.530517 |
a1895dbd260efe381717f2aa806ac57a6e05a7e9 | 2,040 | adb | Ada | day_06.adb | jweese/Ada_Vent_19 | 1d31e5b38ae1ed44aafcd1f9347f9e914fe7165d | [
"MIT"
] | 1 | 2019-12-07T19:20:12.000Z | 2019-12-07T19:20:12.000Z | day_06.adb | jweese/Ada_Vent_19 | 1d31e5b38ae1ed44aafcd1f9347f9e914fe7165d | [
"MIT"
] | null | null | null | day_06.adb | jweese/Ada_Vent_19 | 1d31e5b38ae1ed44aafcd1f9347f9e914fe7165d | [
"MIT"
] | null | null | null | with Ada.Containers.Ordered_Maps;
with Ada.Integer_Text_IO;
with Ada.Text_IO;
procedure Day_06 is
subtype Name is String(1 .. 3);
You: constant Name := "YOU";
Santa: constant Name := "SAN";
type Orbit is record
Self, Parent: Name;
end record;
type Chain is array (Positive range <>) of Name;
package Orbits is new Ada.Containers.Ordered_Maps(
Key_Type => Name, Element_Type => Orbit);
Locals: Orbits.Map;
function Get(S: String) return Orbit is
begin
for I in S'Range loop
if S(I) = ')' then
return (Parent => S(S'First .. I - 1), Self => S(I + 1 .. S'Last));
end if;
end loop;
raise Constraint_Error with "orbit missing ')': " & S;
end Get;
function Count_Orbits(O: Orbit) return Positive is
E: constant Orbits.Cursor := Locals.Find(O.Parent);
use type Orbits.Cursor;
begin
if E = Orbits.No_Element then
return 1; -- only a direct orbit
else
return 1 + Count_Orbits(Orbits.Element(E));
end if;
end Count_Orbits;
function Ancestors(O: Orbit) return Chain is
Size : constant Natural := Count_Orbits(O) - 1;
C: Chain(1 .. Size);
Curr: Orbit := O;
begin
for I in C'Range loop
C(I) := Curr.Parent;
Curr := Locals.Element(Curr.Parent);
end loop;
return C;
end Ancestors;
begin
while (not Ada.Text_IO.End_Of_File) loop
declare
O: constant Orbit := Get(Ada.Text_IO.Get_Line);
begin
Locals.Insert(Key => O.Self, New_Item => O);
end;
end loop;
declare
You_Chain: constant Chain := Ancestors(Locals.Element(You));
Santa_Chain: constant Chain := Ancestors(Locals.Element(Santa));
begin
for I in You_Chain'Range loop
for J in Santa_Chain'Range loop
if You_Chain(I) = Santa_Chain(J) then
Ada.Integer_Text_IO.Put(I + J - 2);
return;
end if;
end loop;
end loop;
end;
end Day_06;
| 26.842105 | 79 | 0.592157 |
394406b39f38ceb75869c59f442a590bd9f98eca | 2,427 | adb | Ada | chat_messages.adb | cborao/Ada-P3 | a099243531f259158eb30450868c31e81783174c | [
"MIT"
] | null | null | null | chat_messages.adb | cborao/Ada-P3 | a099243531f259158eb30450868c31e81783174c | [
"MIT"
] | null | null | null | chat_messages.adb | cborao/Ada-P3 | a099243531f259158eb30450868c31e81783174c | [
"MIT"
] | null | null | null |
--PRÁCTICA 3: CÉSAR BORAO MORATINOS (Chat_Messages.adb)
with Ada.Text_IO;
with Lower_Layer_UDP;
with Ada.Strings.Unbounded;
package body Chat_Messages is
package ATI renames Ada.Text_IO;
use Ada.Strings.Unbounded;
procedure Init_Message (Server_EP: LLU.End_Point_Type;
Client_EP_Receive: LLU.End_Point_Type;
Client_EP_Handler: LLU.End_Point_Type;
Nick: ASU.Unbounded_String;
O_Buffer: Access LLU.Buffer_Type) is
begin
Message_Type'Output(O_Buffer, Init);
LLU.End_Point_Type'Output(O_Buffer, Client_EP_Receive);
LLU.End_Point_Type'Output(O_Buffer, Client_EP_Handler);
ASU.Unbounded_String'Output(O_Buffer, Nick);
LLU.Send(Server_EP, O_Buffer);
LLU.Reset(O_Buffer.all);
end Init_Message;
procedure Welcome_Message (Client_EP_Handler: LLU.End_Point_Type;
Accepted: Boolean;
O_Buffer: Access LLU.Buffer_Type) is
begin
Message_Type'Output(O_Buffer, Welcome);
Boolean'Output(O_Buffer, Accepted);
LLU.Send (Client_EP_Handler, O_Buffer);
LLU.Reset (O_Buffer.all);
end Welcome_Message;
procedure Server_Message (Client_EP_Handler: LLU.End_Point_Type;
Nick: ASU.Unbounded_String;
Comment: ASU.Unbounded_String;
O_Buffer: Access LLU.Buffer_Type) is
begin
Message_Type'Output (O_Buffer,Server);
ASU.Unbounded_String'Output (O_Buffer,Nick);
ASU.Unbounded_String'Output (O_Buffer,Comment);
LLU.Send(Client_EP_Handler, O_Buffer);
LLU.Reset (O_Buffer.all);
end Server_Message;
procedure Writer_Message (Server_EP: LLU.End_Point_Type;
Client_EP_Handler: LLU.End_Point_Type;
Nick: ASU.Unbounded_String;
Comment: ASU.Unbounded_String;
O_Buffer: Access LLU.Buffer_Type) is
begin
Message_Type'Output(O_Buffer, Writer);
LLU.End_Point_Type'Output(O_Buffer, Client_EP_Handler);
ASU.Unbounded_String'Output(O_Buffer, Nick);
ASU.Unbounded_String'Output(O_Buffer, Comment);
LLU.Send(Server_EP, O_Buffer);
LLU.Reset(O_Buffer.all);
end Writer_Message;
procedure Logout_Message (Server_EP: LLU.End_Point_Type;
Client_EP_Handler: LLU.End_Point_Type;
Nick: ASU.Unbounded_String;
O_Buffer: Access LLU.Buffer_Type) is
begin
Message_Type'Output(O_Buffer, Logout);
LLU.End_Point_Type'Output(O_Buffer, Client_EP_Handler);
ASU.Unbounded_String'Output(O_Buffer, Nick);
LLU.Send(Server_EP, O_Buffer);
LLU.Reset(O_Buffer.all);
end Logout_Message;
end Chat_Messages;
| 26.67033 | 66 | 0.759786 |
4dd3c71d02c4fa46537e8cc51240f94f28627528 | 3,275 | ads | Ada | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-wwdg.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-wwdg.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-wwdg.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from STM32F46_79x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.WWDG is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_T_Field is HAL.UInt7;
-- Control register
type CR_Register is record
-- 7-bit counter (MSB to LSB)
T : CR_T_Field := 16#7F#;
-- Activation bit
WDGA : 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 CR_Register use record
T at 0 range 0 .. 6;
WDGA at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CFR_W_Field is HAL.UInt7;
-- CFR_WDGTB array
type CFR_WDGTB_Field_Array is array (0 .. 1) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for CFR_WDGTB
type CFR_WDGTB_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- WDGTB as a value
Val : HAL.UInt2;
when True =>
-- WDGTB as an array
Arr : CFR_WDGTB_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for CFR_WDGTB_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- Configuration register
type CFR_Register is record
-- 7-bit window value
W : CFR_W_Field := 16#7F#;
-- Timer base
WDGTB : CFR_WDGTB_Field := (As_Array => False, Val => 16#0#);
-- Early wakeup interrupt
EWI : 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 CFR_Register use record
W at 0 range 0 .. 6;
WDGTB at 0 range 7 .. 8;
EWI at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- Status register
type SR_Register is record
-- Early wakeup interrupt flag
EWIF : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
EWIF at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Window watchdog
type WWDG_Peripheral is record
-- Control register
CR : aliased CR_Register;
-- Configuration register
CFR : aliased CFR_Register;
-- Status register
SR : aliased SR_Register;
end record
with Volatile;
for WWDG_Peripheral use record
CR at 16#0# range 0 .. 31;
CFR at 16#4# range 0 .. 31;
SR at 16#8# range 0 .. 31;
end record;
-- Window watchdog
WWDG_Periph : aliased WWDG_Peripheral
with Import, Address => System'To_Address (16#40002C00#);
end STM32_SVD.WWDG;
| 26.2 | 76 | 0.571908 |
06e70c09bf9f593e9e0f0859740eb992ce34cd12 | 1,034 | adb | Ada | specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_select.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_select.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/server/ike/tkmrpc-operation_handlers-ike-esa_select.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | with Tkmrpc.Servers.Ike;
with Tkmrpc.Results;
with Tkmrpc.Request.Ike.Esa_Select.Convert;
with Tkmrpc.Response.Ike.Esa_Select.Convert;
package body Tkmrpc.Operation_Handlers.Ike.Esa_Select is
-------------------------------------------------------------------------
procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type) is
Specific_Req : Request.Ike.Esa_Select.Request_Type;
Specific_Res : Response.Ike.Esa_Select.Response_Type;
begin
Specific_Res := Response.Ike.Esa_Select.Null_Response;
Specific_Req := Request.Ike.Esa_Select.Convert.From_Request (S => Req);
if Specific_Req.Data.Esa_Id'Valid then
Servers.Ike.Esa_Select
(Result => Specific_Res.Header.Result,
Esa_Id => Specific_Req.Data.Esa_Id);
Res :=
Response.Ike.Esa_Select.Convert.To_Response (S => Specific_Res);
else
Res.Header.Result := Results.Invalid_Parameter;
end if;
end Handle;
end Tkmrpc.Operation_Handlers.Ike.Esa_Select;
| 32.3125 | 78 | 0.65764 |
a10449e91cc6b3b7b71373d8145917e55d98ca45 | 2,546 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/a49027c.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/a49027c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/a49027c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- A49027C.ADA
--
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
--
-- OBJECTIVE:
-- CHECK THAT IF A GENERIC PARAMETER IS A STATIC EXPRESSION AND THE
-- CORRESPONDING (IN) PARAMETER HAS A STATIC SUBTYPE IN THE INSTANCE,
-- THEN EACH USE OF THE FORMAL PARAMETER IN THE INSTANCE IS SAID TO
-- BE STATIC.
--
-- SEE AI-00505. THIS TEST IS TAKEN FROM THE SECOND EXAMPLE.
--
-- HISTORY:
-- DAS 8 OCT 90 INITIAL VERSION.
-- PWN 12/01/95 CORRECTED FORMAT OF CALL TO REPORT.TEST
-- KAS 25NOV96 CHANGED LITERAL 7 TO (IMPDEF.CHAR_BITS-1)
--!
WITH REPORT; USE REPORT;
WITH IMPDEF;
PROCEDURE A49027C IS
GENERIC
X : INTEGER;
PACKAGE GP IS
TYPE REC IS
RECORD
C : STRING (1..X);
END RECORD;
END GP;
PACKAGE NP IS NEW GP (1);
TYPE NR IS NEW NP.REC;
FOR NR USE
RECORD
C AT 0 RANGE 0..IMPDEF.CHAR_BITS-1; -- SUBTYPE INDICATION
END RECORD; -- FOR C IN NP IS CONSIDERED STATIC.
BEGIN
TEST("A49027C", "CHECK THAT IF A GENERIC PARAMETER IS A STATIC " &
"EXPRESSION AND THE CORRESPONDING (IN) PARAMETER HAS A " &
"STATIC SUBTYPE IN THE INSTANCE, THEN EACH USE OF THE " &
"FORMAL PARAMETER IN THE INSTANCE IS SAID TO BE STATIC.");
RESULT;
END A49027C;
| 35.859155 | 79 | 0.637863 |
06d3aeb1ead07b687405a844d6f6e0a4c23e2ecb | 9,051 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack54.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack54.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack54.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 5 4 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_54 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_54;
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;
-- The following declarations are for the case where the address
-- passed to GetU_54 or SetU_54 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
type Rev_ClusterU is new ClusterU
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_ClusterU_Ref is access Rev_ClusterU;
------------
-- Get_54 --
------------
function Get_54
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_54
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_54;
-------------
-- GetU_54 --
-------------
function GetU_54
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_54
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_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 GetU_54;
------------
-- Set_54 --
------------
procedure Set_54
(Arr : System.Address;
N : Natural;
E : Bits_54;
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_54;
-------------
-- SetU_54 --
-------------
procedure SetU_54
(Arr : System.Address;
N : Natural;
E : Bits_54;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_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 SetU_54;
end System.Pack_54;
| 36.059761 | 78 | 0.467352 |
3123e835b9effa6d6fd7e9b99648e2b1910496d7 | 1,439 | adb | Ada | tools/akt-commands-password-add.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 25 | 2019-05-07T20:35:50.000Z | 2021-11-30T10:35:47.000Z | tools/akt-commands-password-add.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 12 | 2019-12-16T23:30:00.000Z | 2021-09-26T18:52:41.000Z | tools/akt-commands-password-add.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 3 | 2019-12-18T21:30:04.000Z | 2021-01-06T08:30:36.000Z | -----------------------------------------------------------------------
-- akt-commands-password-add -- Add a wallet password
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body AKT.Commands.Password.Add is
-- ------------------------------
-- Add a password to the wallet.
-- ------------------------------
overriding
procedure Execute (Command : in out Command_Type;
Name : in String;
Args : in Argument_List'Class;
Context : in out Context_Type) is
begin
Command.Mode := Keystore.KEY_ADD;
AKT.Commands.Password.Execute (Password.Command_Type (Command), Name, Args, Context);
end Execute;
end AKT.Commands.Password.Add;
| 42.323529 | 91 | 0.578874 |
cb63e9ad916d55851ac86939df4c8fe5c098b76e | 1,422 | ads | Ada | src/ewok-interrupts-handler.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | src/ewok-interrupts-handler.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | src/ewok-interrupts-handler.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
package ewok.interrupts.handler
with spark_mode => off
is
function usagefault_handler
(frame_a : ewok.t_stack_frame_access) return ewok.t_stack_frame_access;
function hardfault_handler
(frame_a : ewok.t_stack_frame_access) return ewok.t_stack_frame_access;
function systick_default_handler
(frame_a : ewok.t_stack_frame_access) return ewok.t_stack_frame_access;
function default_sub_handler
(frame_a : t_stack_frame_access) return t_stack_frame_access
with
convention => c,
export => true,
external_name => "Default_SubHandler";
end ewok.interrupts.handler;
| 31.6 | 79 | 0.71097 |
315d7e19959113e627e603ac26e2c7a22161311e | 195,070 | adb | Ada | HLS/lab2/yuv_filter.prj/solution1/.autopilot/db/yuv_filter.bind.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | 1 | 2021-03-03T16:53:52.000Z | 2021-03-03T16:53:52.000Z | HLS/lab2/yuv_filter.prj/solution1/.autopilot/db/yuv_filter.bind.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | null | null | null | HLS/lab2/yuv_filter.prj/solution1/.autopilot/db/yuv_filter.bind.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | 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></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>yuv_filter</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>13</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_channels_ch1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.channels.ch1</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>2457600</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>in_channels_ch2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.channels.ch2</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>2457600</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>in_channels_ch3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.channels.ch3</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>2457600</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>in_width</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.width</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>in_height</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in.height</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>out_channels_ch1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.channels.ch1</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>2457600</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>out_channels_ch2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.channels.ch2</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>2457600</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>out_channels_ch3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.channels.ch3</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>2457600</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>out_width</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.width</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>out_height</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.height</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>Y_scale</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>Y_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>U_scale</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>U_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_13">
<Value>
<Obj>
<type>1</type>
<id>13</id>
<name>V_scale</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>V_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>64</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>V_scale_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>V_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>108</item>
<item>109</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>U_scale_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>U_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>110</item>
<item>111</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>Y_scale_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>Y_scale</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>p_yuv_channels_ch1</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</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>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>17</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_yuv.channels.ch1</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_yuv_channels_ch2</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>17</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_yuv.channels.ch2</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_yuv_channels_ch3</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>17</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_yuv.channels.ch3</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>p_scale_channels_ch1</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>18</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_scale.channels.ch1</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_scale_channels_ch2</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>18</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_scale.channels.ch2</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>119</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_scale_channels_ch3</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>18</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_scale.channels.ch3</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>in_width_read</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>23</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>23</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>in_height_read</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>23</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>23</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>124</item>
<item>125</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>call_ret</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>23</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>23</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_yuv_width</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>23</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>23</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_yuv.width</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>p_yuv_height</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>23</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>23</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_yuv.height</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>138</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>138</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>138</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>43</id>
<name>tmp_1_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>139</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_2_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</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>141</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>x_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>143</item>
<item>144</item>
<item>145</item>
<item>146</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>exitcond1_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</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>147</item>
<item>148</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>x</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>149</item>
<item>151</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</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>152</item>
<item>153</item>
<item>154</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>p_shl_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
<item>160</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_1</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>p_shl3_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
<item>166</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp_2</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>132</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>169</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>y_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
<item>172</item>
<item>173</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>exitcond_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>132</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>174</item>
<item>175</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>y</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>132</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>132</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>178</item>
<item>179</item>
<item>180</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_5_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>181</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>71</id>
<name>tmp_3</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>tmp_3_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>scale_channels_ch3_a</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>185</item>
<item>187</item>
<item>188</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>scale_channels_ch1_a</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>140</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>140</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>yuv_channels_ch2_add</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>135</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>yuv_channels_ch3_add</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>yuv_channels_ch1_add</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>134</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>134</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>scale_channels_ch2_a</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>141</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>141</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>201</item>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>Y</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>134</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>134</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>Y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>U</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>135</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>135</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>U</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>205</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>V</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>206</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>tmp_6_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>137</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>137</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>tmp_7_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>137</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>137</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_9_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>138</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>138</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>210</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>tmp_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>138</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>138</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_4_i_cast</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>139</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_8_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>139</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>139</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>tmp_10_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>140</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>140</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>220</item>
<item>222</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>140</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>140</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>tmp_11_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>141</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>141</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>225</item>
<item>226</item>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>141</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>141</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>tmp_12_i</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>231</item>
<item>232</item>
<item>233</item>
<item>234</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>132</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>132</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>237</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>yuv_scale</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>24</second>
</item>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_scale</second>
</first>
<second>129</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>238</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>call_ret1</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>25</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>242</item>
<item>243</item>
<item>244</item>
<item>245</item>
<item>246</item>
<item>247</item>
<item>248</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>out_width_ret</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>25</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>249</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>25</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>251</item>
<item>252</item>
<item>253</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>out_height_ret</name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>25</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>254</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>25</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>25</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>255</item>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name></name>
<fileName>yuv_filter.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</fileDirectory>
<lineNumber>26</lineNumber>
<contextFuncName>yuv_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>yuv_filter.c</first>
<second>yuv_filter</second>
</first>
<second>26</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>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>114</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>126</id>
<name>rgb2yuv</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>6</const_type>
<content><constant:rgb2yuv></content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>142</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>150</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_82">
<Value>
<Obj>
<type>2</type>
<id>159</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>165</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>186</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_85">
<Value>
<Obj>
<type>2</type>
<id>219</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>7</content>
</item>
<item class_id_reference="16" object_id="_86">
<Value>
<Obj>
<type>2</type>
<id>221</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>14</content>
</item>
<item class_id_reference="16" object_id="_87">
<Value>
<Obj>
<type>2</type>
<id>239</id>
<name>yuv2rgb</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>6</const_type>
<content><constant:yuv2rgb></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_88">
<Obj>
<type>3</type>
<id>46</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>18</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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>51</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>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>61</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>66</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>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_92">
<Obj>
<type>3</type>
<id>96</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>25</count>
<item_version>0</item_version>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>95</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_93">
<Obj>
<type>3</type>
<id>99</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>98</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_94">
<Obj>
<type>3</type>
<id>106</id>
<name>yuv_scale.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>131</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_95">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>141</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>150</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>171</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>150</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>179</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>180</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>237</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>239</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>325</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>326</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>327</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>328</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>332</id>
<edge_type>2</edge_type>
<source_obj>99</source_obj>
<sink_obj>51</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_226">
<mId>1</mId>
<mTag>yuv_filter</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>73739525</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_227">
<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>46</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>24579842</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_228">
<mId>3</mId>
<mTag>YUV_SCALE_LOOP_X</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>200</mMinTripCount>
<mMaxTripCount>1920</mMaxTripCount>
<mMinLatency>22122240</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_229">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<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"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_230">
<mId>5</mId>
<mTag>YUV_SCALE_LOOP_Y</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>66</item>
<item>96</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>200</mMinTripCount>
<mMaxTripCount>1280</mMaxTripCount>
<mMinLatency>11520</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_231">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_232">
<mId>7</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>27037442</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_233">
<states class_id="25" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_234">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_235">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_237">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_238">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_239">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_242">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_243">
<id>39</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_244">
<id>2</id>
<operations>
<count>24</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_245">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>39</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_269">
<id>3</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_270">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_279">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>100</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_284">
<id>4</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_285">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>79</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>80</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>81</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_300">
<id>5</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_301">
<id>79</id>
<stage>3</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>80</id>
<stage>3</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>81</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_304">
<id>6</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_305">
<id>79</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>80</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>81</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_308">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_309">
<id>79</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_310">
<id>80</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>81</id>
<stage>1</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_312">
<id>8</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_313">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_314">
<id>83</id>
<stage>3</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_315">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>85</id>
<stage>3</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>87</id>
<stage>3</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_319">
<id>9</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_320">
<id>83</id>
<stage>2</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_321">
<id>85</id>
<stage>2</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_322">
<id>87</id>
<stage>2</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_323">
<id>10</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_324">
<id>83</id>
<stage>1</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_325">
<id>85</id>
<stage>1</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_326">
<id>87</id>
<stage>1</stage>
<latency>3</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_330">
<id>11</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_331">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>89</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_335">
<id>91</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_336">
<id>93</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_337">
<id>12</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_338">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_340">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_341">
<id>89</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>91</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_343">
<id>93</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_344">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_345">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_346">
<id>13</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_347">
<id>100</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_353">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>21</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="_354">
<inState>2</inState>
<outState>3</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="_355">
<inState>3</inState>
<outState>13</outState>
<condition>
<id>24</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>48</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_356">
<inState>3</inState>
<outState>4</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>48</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_357">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>27</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>63</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_358">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>29</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="_359">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>30</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="_360">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>31</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="_361">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>32</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="_362">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>33</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="_363">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>34</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_364">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>35</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_365">
<inState>12</inState>
<outState>4</outState>
<condition>
<id>37</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_366">
<inState>4</inState>
<outState>3</outState>
<condition>
<id>39</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>63</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>64</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>28</first>
<second class_id="39" tracking_level="0" version="0">
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>1</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>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>62</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>7</first>
<second>2</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>7</first>
<second>2</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>7</first>
<second>2</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>46</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>3</first>
<second>11</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>57</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>88</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>92</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>79</item>
<item>79</item>
<item>79</item>
<item>79</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>80</item>
<item>80</item>
<item>80</item>
<item>80</item>
</second>
</item>
<item>
<first>184</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>81</item>
<item>81</item>
<item>81</item>
<item>81</item>
</second>
</item>
<item>
<first>189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>207</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>89</item>
</second>
</item>
<item>
<first>212</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>91</item>
</second>
</item>
<item>
<first>217</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>93</item>
<item>93</item>
</second>
</item>
<item>
<first>226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>264</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>100</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>291</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>304</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>351</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>370</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>83</item>
<item>83</item>
<item>83</item>
</second>
</item>
<item>
<first>375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>85</item>
<item>85</item>
<item>85</item>
</second>
</item>
<item>
<first>383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>386</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>87</item>
<item>87</item>
<item>87</item>
</second>
</item>
<item>
<first>391</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="47" tracking_level="0" version="0">
<count>39</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>exitcond1_i_fu_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>exitcond_i_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>out_height_ret_fu_426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>out_width_ret_fu_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>p_scale_channels_ch1_alloca_fu_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>p_scale_channels_ch2_alloca_fu_104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>p_scale_channels_ch3_alloca_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_shl3_cast_fu_326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>p_shl_cast_fu_314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>p_yuv_channels_ch1_alloca_fu_88</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>p_yuv_channels_ch2_alloca_fu_92</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_yuv_channels_ch3_alloca_fu_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_yuv_height_fu_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_yuv_width_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>scale_channels_ch1_a_gep_fu_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>scale_channels_ch2_a_gep_fu_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>scale_channels_ch3_a_gep_fu_189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>tmp_10_i_fu_391</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_11_i_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>tmp_12_i_fu_411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>tmp_1_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_1_i_cast_fu_291</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_2_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp_2_i_cast_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_3_cast_fu_360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>tmp_3_fu_355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>tmp_4_i_cast_fu_383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>tmp_5_i_cast_fu_351</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>tmp_6_i_cast_fu_367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>tmp_9_i_cast_fu_375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_fu_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_i_cast_fu_287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>x_fu_304</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>x_i_phi_fu_226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>y_fu_345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>y_i_phi_fu_237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>yuv_channels_ch1_add_gep_fu_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>yuv_channels_ch2_add_gep_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>yuv_channels_ch3_add_gep_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>5</count>
<item_version>0</item_version>
<item>
<first>grp_fu_370</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>83</item>
<item>83</item>
<item>83</item>
</second>
</item>
<item>
<first>grp_fu_378</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>85</item>
<item>85</item>
<item>85</item>
</second>
</item>
<item>
<first>grp_fu_386</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>87</item>
<item>87</item>
<item>87</item>
</second>
</item>
<item>
<first>grp_rgb2yuv_fu_244</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>39</item>
</second>
</item>
<item>
<first>grp_yuv2rgb_fu_264</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>100</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>7</count>
<item_version>0</item_version>
<item>
<first>StgValue_116_write_fu_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>StgValue_118_write_fu_149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>U_scale_read_read_fu_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>V_scale_read_read_fu_124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>Y_scale_read_read_fu_136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>in_height_read_read_fu_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>in_width_read_read_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</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="49" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first class_id="51" tracking_level="0" version="0">
<first>p_scale_channels_ch1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>89</item>
</second>
</item>
<item>
<first>
<first>p_scale_channels_ch1</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>
<first>p_scale_channels_ch2</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>91</item>
</second>
</item>
<item>
<first>
<first>p_scale_channels_ch2</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>
<first>p_scale_channels_ch3</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>93</item>
<item>93</item>
</second>
</item>
<item>
<first>
<first>p_scale_channels_ch3</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch1</first>
<second>0</second>
</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>79</item>
<item>79</item>
<item>79</item>
<item>79</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch1</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch2</first>
<second>0</second>
</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>80</item>
<item>80</item>
<item>80</item>
<item>80</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch2</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch3</first>
<second>0</second>
</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>81</item>
<item>81</item>
<item>81</item>
<item>81</item>
</second>
</item>
<item>
<first>
<first>p_yuv_channels_ch3</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>28</count>
<item_version>0</item_version>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>441</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>471</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>476</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>484</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>489</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>511</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>521</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>526</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>531</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>536</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>541</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>551</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>561</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>566</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>28</count>
<item_version>0</item_version>
<item>
<first>U_reg_516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>V_reg_521</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>Y_reg_511</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>in_height_read_reg_436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>in_width_read_reg_431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_yuv_height_reg_447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_yuv_width_reg_441</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>scale_channels_ch1_a_reg_561</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>scale_channels_ch2_a_reg_566</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>scale_channels_ch3_a_reg_556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>tmp_10_i_reg_541</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_11_i_reg_546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>tmp_12_i_reg_551</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>tmp_1_i_cast_reg_458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_2_i_cast_reg_463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_2_reg_476</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp_3_cast_reg_489</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>tmp_4_i_cast_reg_536</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>tmp_6_i_cast_reg_526</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>tmp_9_i_cast_reg_531</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_i_cast_reg_453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>x_i_reg_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>x_reg_471</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>y_i_reg_233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>y_reg_484</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>yuv_channels_ch1_add_reg_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>yuv_channels_ch2_add_reg_496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>yuv_channels_ch3_add_reg_501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>x_i_reg_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>y_i_reg_233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="52" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>U_scale</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
</second>
</item>
<item>
<first>V_scale</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
</second>
</item>
<item>
<first>Y_scale</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</second>
</item>
<item>
<first>in_height</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
</second>
</item>
<item>
<first>in_width</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
</second>
</item>
<item>
<first>out_height</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
</second>
</item>
<item>
<first>out_width</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="54" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
<item>
<first>7</first>
<second>RAM</second>
</item>
<item>
<first>8</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>6</count>
<item_version>0</item_version>
<item>
<first>31</first>
<second>RAM</second>
</item>
<item>
<first>32</first>
<second>RAM</second>
</item>
<item>
<first>33</first>
<second>RAM</second>
</item>
<item>
<first>34</first>
<second>RAM</second>
</item>
<item>
<first>35</first>
<second>RAM</second>
</item>
<item>
<first>36</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 24.758218 | 90 | 0.575757 |
4d78981e6c7ffce436b56b1fc39a9f5424625151 | 24,803 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cohama.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cohama.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cohama.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . H A S H E D _ M A P S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2021, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
private with Ada.Containers.Hash_Tables;
private with Ada.Finalization;
private with Ada.Streams;
private with Ada.Strings.Text_Buffers;
-- The language-defined generic package Containers.Hashed_Maps provides
-- private types Map and Cursor, and a set of operations for each type. A map
-- container allows an arbitrary type to be used as a key to find the element
-- associated with that key. A hashed map uses a hash function to organize the
-- keys.
--
-- A map contains pairs of keys and elements, called nodes. Map cursors
-- designate nodes, but also can be thought of as designating an element (the
-- element contained in the node) for consistency with the other containers.
-- There exists an equivalence relation on keys, whose definition is different
-- for hashed maps and ordered maps. A map never contains two or more nodes
-- with equivalent keys. The length of a map is the number of nodes it
-- contains.
--
-- Each nonempty map has two particular nodes called the first node and the
-- last node (which may be the same). Each node except for the last node has a
-- successor node. If there are no other intervening operations, starting with
-- the first node and repeatedly going to the successor node will visit each
-- node in the map exactly once until the last node is reached.
generic
type Key_Type is private;
type Element_Type is private;
with function Hash (Key : Key_Type) return Hash_Type;
-- The actual function for the generic formal function Hash is expected to
-- return the same value each time it is called with a particular key
-- value. For any two equivalent key values, the actual for Hash is
-- expected to return the same value. If the actual for Hash behaves in
-- some other manner, the behavior of this package is unspecified. Which
-- subprograms of this package call Hash, and how many times they call it,
-- is unspecified.
with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
-- The actual function for the generic formal function Equivalent_Keys on
-- Key_Type values is expected to return the same value each time it is
-- called with a particular pair of key values. It should define an
-- equivalence relationship, that is, be reflexive, symmetric, and
-- transitive. If the actual for Equivalent_Keys behaves in some other
-- manner, the behavior of this package is unspecified. Which subprograms
-- of this package call Equivalent_Keys, and how many times they call it,
-- is unspecified.
with function "=" (Left, Right : Element_Type) return Boolean is <>;
-- The actual function for the generic formal function "=" on Element_Type
-- values is expected to define a reflexive and symmetric relationship and
-- return the same result value each time it is called with a particular
-- pair of values. If it behaves in some other manner, the function "=" on
-- map values returns an unspecified value. The exact arguments and number
-- of calls of this generic formal function by the function "=" on map
-- values are unspecified.
package Ada.Containers.Hashed_Maps with
SPARK_Mode => Off
is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
type Map is tagged private
with
Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type,
Aggregate => (Empty => Empty,
Add_Named => Insert);
pragma Preelaborable_Initialization (Map);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Map : constant Map;
-- Map objects declared without an initialization expression are
-- initialized to the value Empty_Map.
No_Element : constant Cursor;
-- Cursor objects declared without an initialization expression are
-- initialized to the value No_Element.
function Empty (Capacity : Count_Type := 1000) return Map;
function Has_Element (Position : Cursor) return Boolean;
-- Returns True if Position designates an element, and returns False
-- otherwise.
package Map_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function "=" (Left, Right : Map) return Boolean;
-- If Left and Right denote the same map object, then the function returns
-- True. If Left and Right have different lengths, then the function
-- returns False. Otherwise, for each key K in Left, the function returns
-- False if:
--
-- * a key equivalent to K is not present in Right; or
--
-- * the element associated with K in Left is not equal to the
-- element associated with K in Right (using the generic formal
-- equality operator for elements).
--
-- If the function has not returned a result after checking all of the
-- keys, it returns True. Any exception raised during evaluation of key
-- equivalence or element equality is propagated.
function Capacity (Container : Map) return Count_Type;
-- Returns the current capacity of the map. Capacity is the maximum length
-- before which rehashing in guaranteed not to occur.
procedure Reserve_Capacity (Container : in out Map; Capacity : Count_Type);
-- Adjusts the current capacity, by allocating a new buckets array. If the
-- requested capacity is less than the current capacity, then the capacity
-- is contracted (to a value not less than the current length). If the
-- requested capacity is greater than the current capacity, then the
-- capacity is expanded (to a value not less than what is requested). In
-- either case, the nodes are rehashed from the old buckets array onto the
-- new buckets array (Hash is called once for each existing key in order to
-- compute the new index), and then the old buckets array is deallocated.
function Length (Container : Map) return Count_Type;
-- Returns the number of items in the map
function Is_Empty (Container : Map) return Boolean;
-- Equivalent to Length (Container) = 0
procedure Clear (Container : in out Map);
-- Removes all of the items from the map
function Key (Position : Cursor) return Key_Type;
-- Key returns the key component of the node designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
function Element (Position : Cursor) return Element_Type;
-- Element returns the element component of the node designated
-- by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
procedure Replace_Element
(Container : in out Map;
Position : Cursor;
New_Item : Element_Type);
-- Replace_Element assigns New_Item to the element of the node designated
-- by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
procedure Query_Element
(Position : Cursor;
Process : not null access
procedure (Key : Key_Type; Element : Element_Type));
-- Query_Element calls Process.all with the key and element from the node
-- designated by Position as the arguments.
--
-- If Position equals No_Element, then Constraint_Error is propagated.
--
-- Tampering with the elements of the map that contains the element
-- designated by Position is prohibited during the execution of the call on
-- Process.all. Any exception raised by Process.all is propagated.
procedure Update_Element
(Container : in out Map;
Position : Cursor;
Process : not null access
procedure (Key : Key_Type; Element : in out Element_Type));
-- Update_Element calls Process.all with the key and element from the node
-- designated by Position as the arguments.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited during the
-- execution of the call on Process.all. Any exception raised by
-- Process.all is propagated.
type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with
Implicit_Dereference => Element;
type Reference_Type (Element : not null access Element_Type) is private
with
Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Map;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
-- This function (combined with the Constant_Indexing and
-- Implicit_Dereference aspects) provides a convenient way to gain read
-- access to an individual element of a map given a cursor.
-- Constant_Reference returns an object whose discriminant is an access
-- value that designates the element designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited
-- while the object returned by Constant_Reference exists and has not been
-- finalized.
function Reference
(Container : aliased in out Map;
Position : Cursor) return Reference_Type;
pragma Inline (Reference);
-- This function (combined with the Variable_Indexing and
-- Implicit_Dereference aspects) provides a convenient way to gain read and
-- write access to an individual element of a map given a cursor.
-- Reference returns an object whose discriminant is an access value that
-- designates the element designated by Position.
--
-- If Position equals No_Element, then Constraint_Error is propagated; if
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
--
-- Tampering with the elements of Container is prohibited while the object
-- returned by Reference exists and has not been finalized.
function Constant_Reference
(Container : aliased Map;
Key : Key_Type) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
-- Equivalent to Constant_Reference (Container, Find (Container, Key)).
function Reference
(Container : aliased in out Map;
Key : Key_Type) return Reference_Type;
pragma Inline (Reference);
-- Equivalent to Reference (Container, Find (Container, Key)).
procedure Assign (Target : in out Map; Source : Map);
-- If Target denotes the same object as Source, the operation has no
-- effect. Otherwise, the key/element pairs of Source are copied to Target
-- as for an assignment_statement assigning Source to Target.
function Copy (Source : Map; Capacity : Count_Type := 0) return Map;
procedure Move (Target : in out Map; Source : in out Map);
-- If Target denotes the same object as Source, then the operation has no
-- effect. Otherwise, the operation is equivalent to Assign (Target,
-- Source) followed by Clear (Source).
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Insert checks if a node with a key equivalent to Key is already present
-- in Container. If a match is found, Inserted is set to False and Position
-- designates the element with the matching key. Otherwise, Insert
-- allocates a new node, initializes it to Key and New_Item, and adds it to
-- Container; Inserted is set to True and Position designates the
-- newly-inserted node. Any exception raised during allocation is
-- propagated and Container is not modified.
procedure Insert
(Container : in out Map;
Key : Key_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Insert inserts Key into Container as per the five-parameter Insert, with
-- the difference that an element initialized by default (see 3.3.1) is
-- inserted.
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Insert inserts Key and New_Item into Container as per the five-parameter
-- Insert, with the difference that if a node with a key equivalent to Key
-- is already in the map, then Constraint_Error is propagated.
procedure Include
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Include inserts Key and New_Item into Container as per the
-- five-parameter Insert, with the difference that if a node with a key
-- equivalent to Key is already in the map, then this operation assigns Key
-- and New_Item to the matching node. Any exception raised during
-- assignment is propagated.
procedure Replace
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type);
-- Replace checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Replace assigns Key and New_Item to the
-- matching node; otherwise, Constraint_Error is propagated.
procedure Exclude (Container : in out Map; Key : Key_Type);
-- Exclude checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Exclude removes the node from the map.
procedure Delete (Container : in out Map; Key : Key_Type);
-- Delete checks if a node with a key equivalent to Key is present in
-- Container. If a match is found, Delete removes the node from the map;
-- otherwise, Constraint_Error is propagated.
procedure Delete (Container : in out Map; Position : in out Cursor);
-- Delete removes the node designated by Position from the map. Position is
-- set to No_Element on return.
--
-- If Position equals No_Element, then Constraint_Error is propagated. If
-- Position does not designate an element in Container, then Program_Error
-- is propagated.
function First (Container : Map) return Cursor;
-- If Length (Container) = 0, then First returns No_Element. Otherwise,
-- First returns a cursor that designates the first node in Container.
function Next (Position : Cursor) return Cursor;
-- Returns a cursor that designates the successor of the node designated by
-- Position. If Position designates the last node, then No_Element is
-- returned. If Position equals No_Element, then No_Element is returned.
procedure Next (Position : in out Cursor);
-- Equivalent to Position := Next (Position)
function Find (Container : Map; Key : Key_Type) return Cursor;
-- If Length (Container) equals 0, then Find returns No_Element.
-- Otherwise, Find checks if a node with a key equivalent to Key is present
-- in Container. If a match is found, a cursor designating the matching
-- node is returned; otherwise, No_Element is returned.
function Contains (Container : Map; Key : Key_Type) return Boolean;
-- Equivalent to Find (Container, Key) /= No_Element.
function Element (Container : Map; Key : Key_Type) return Element_Type;
-- Equivalent to Element (Find (Container, Key))
function Equivalent_Keys (Left, Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Keys with the keys of the nodes
-- designated by cursors Left and Right.
function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean;
-- Returns the result of calling Equivalent_Keys with key of the node
-- designated by Left and key Right.
function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Keys with key Left and the node
-- designated by Right.
procedure Iterate
(Container : Map;
Process : not null access procedure (Position : Cursor));
-- Iterate calls Process.all with a cursor that designates each node in
-- Container, starting with the first node and moving the cursor according
-- to the successor relation. Tampering with the cursors of Container is
-- prohibited during the execution of a call on Process.all. Any exception
-- raised by Process.all is propagated.
function Iterate
(Container : Map) return Map_Iterator_Interfaces.Forward_Iterator'Class;
private
pragma Inline ("=");
pragma Inline (Length);
pragma Inline (Is_Empty);
pragma Inline (Clear);
pragma Inline (Key);
pragma Inline (Element);
pragma Inline (Move);
pragma Inline (Contains);
pragma Inline (Capacity);
pragma Inline (Reserve_Capacity);
pragma Inline (Has_Element);
pragma Inline (Equivalent_Keys);
pragma Inline (Next);
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is limited record
Key : Key_Type;
Element : aliased Element_Type;
Next : Node_Access;
end record;
package HT_Types is
new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
type Map is new Ada.Finalization.Controlled with record
HT : HT_Types.Hash_Table_Type;
end record with Put_Image => Put_Image;
procedure Put_Image
(S : in out Ada.Strings.Text_Buffers.Root_Buffer_Type'Class; V : Map);
overriding procedure Adjust (Container : in out Map);
overriding procedure Finalize (Container : in out Map);
use HT_Types, HT_Types.Implementation;
use Ada.Finalization;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Map);
for Map'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Map);
for Map'Read use Read;
type Map_Access is access all Map;
for Map_Access'Storage_Size use 0;
type Cursor is record
Container : Map_Access;
-- Access to this cursor's container
Node : Node_Access;
-- Access to the node pointed to by this cursor
Position : Hash_Type := Hash_Type'Last;
-- Position of the node in the buckets of the container. If this is
-- equal to Hash_Type'Last, then it will not be used. Position is
-- not requried by the implementation, but improves the efficiency
-- of various operations.
--
-- However, this value must be maintained so that the predefined
-- equality operation acts as required by RM A.18.4-18/2, which
-- states: "The predefined "=" operator for type Cursor returns True
-- if both cursors are No_Element, or designate the same element
-- in the same container."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
type Reference_Type
(Element : not null access Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Map'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type with
Storage_Size => 0;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Map : constant Map := (Controlled with others => <>);
No_Element : constant Cursor := (Container => null, Node => null,
Position => Hash_Type'Last);
type Iterator is new Limited_Controlled and
Map_Iterator_Interfaces.Forward_Iterator with
record
Container : Map_Access;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Hashed_Maps;
| 42.911765 | 79 | 0.668105 |
230f81f772d4e8affd274fe17df341318ff9d12c | 638 | ads | Ada | source/mpfr-root_fr-inside.ads | ytomino/gmp-ada | 72b08a0e8dae5c8576c4d48ef580eb95a5c5455b | [
"Unlicense"
] | 4 | 2017-12-20T00:16:36.000Z | 2020-09-08T09:35:25.000Z | source/mpfr-root_fr-inside.ads | ytomino/gmp-ada | 72b08a0e8dae5c8576c4d48ef580eb95a5c5455b | [
"Unlicense"
] | null | null | null | source/mpfr-root_fr-inside.ads | ytomino/gmp-ada | 72b08a0e8dae5c8576c4d48ef580eb95a5c5455b | [
"Unlicense"
] | null | null | null | with C.mpfr;
package MPFR.Root_FR.Inside is
pragma Preelaborate;
function Reference (X : in out MP_Float)
return not null access C.mpfr.mpfr_struct;
function Constant_Reference (X : MP_Float)
return not null access constant C.mpfr.mpfr_struct;
pragma Inline (Reference); -- renamed
pragma Inline (Constant_Reference); -- renamed
private
function Reference (X : in out MP_Float)
return not null access C.mpfr.mpfr_struct
renames Controlled.Reference;
function Constant_Reference (X : MP_Float)
return not null access constant C.mpfr.mpfr_struct
renames Controlled.Constant_Reference;
end MPFR.Root_FR.Inside;
| 27.73913 | 53 | 0.774295 |
0bc4833fe7ba04d3fa150781e415ec2ffa86ead5 | 58 | ads | Ada | Ada/inc/Problem_42.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/inc/Problem_42.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/inc/Problem_42.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | package Problem_42 is
procedure Solve;
end Problem_42;
| 14.5 | 21 | 0.793103 |
0e68b2d935c90b3359e4964af6af5c04cf2c7e42 | 5,056 | adb | Ada | Formatted_Output-orig/formatted_output-enumeration_output.adb | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | Formatted_Output-orig/formatted_output-enumeration_output.adb | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | Formatted_Output-orig/formatted_output-enumeration_output.adb | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- File: --
-- formatted_output-enumeration_output.adb --
-- --
-- Description: --
-- Formatted_Output.Enumeration_Output generic package body --
-- --
-- Author: --
-- Eugene Nonko, [email protected] --
-- --
-- Revision history: --
-- 27/01/99 - original --
-- 16/03/99 - added support for justification characters --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO,
Ada.Characters.Handling,
Ada.Strings,
Ada.Strings.Fixed,
Ada.Strings.Unbounded;
use Ada.Text_IO,
Ada.Characters.Handling,
Ada.Strings,
Ada.Strings.Fixed,
Ada.Strings.Unbounded;
package body Formatted_Output.Enumeration_Output is
package Item_Type_IO is new Enumeration_IO (Item_Type);
use Item_Type_IO;
type Style_Type is (Capitalized, Upper_Case, Lower_Case);
function Format
(Value : Item_Type; Initial_Width : Integer; Justification : Alignment;
Style : Style_Type) return String is
Img : String (1 .. Maximal_Item_Length);
Width, Real_Width : Integer;
Past_Last : Integer := 1;
begin -- Format
case Style is
when Capitalized =>
Put (Img, Value, Set => Type_Set'(Lower_Case));
Img (1) := To_Upper (Img (1));
when Lower_Case =>
Put (Img, Value, Set => Type_Set'(Lower_Case));
when Upper_Case =>
Put (Img, Value, Set => Type_Set'(Upper_Case));
end case;
while Img (Past_Last) /= ' ' loop
Past_Last := Past_Last + 1;
end loop;
Real_Width := Past_Last - 1;
if Initial_Width < Real_Width then
Width := Real_Width;
else
Width := Initial_Width;
end if;
declare
S : String (1 .. Width);
begin
Move (Img (Past_Last - Real_Width .. Past_Last - 1), S,
Justify => Justification, Pad => Filler);
return S;
end;
end Format;
function "&" (Fmt : Format_Type; Value : Item_Type) return Format_Type is
Command_Start : constant Integer := Scan_To_Percent_Sign (Fmt);
Width : Integer := 0;
Digit_Occured, Justification_Changed : Boolean := False;
Justification : Alignment := Right;
Fmt_Copy : Unbounded_String;
begin -- "&"
if Command_Start /= 0 then
Fmt_Copy := Unbounded_String (Fmt);
for I in Command_Start + 1 .. Length (Fmt_Copy) loop
case Element (Fmt_Copy, I) is
when 'c' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Capitalized));
return Format_Type (Fmt_Copy);
when 'u' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Upper_Case));
return Format_Type (Fmt_Copy);
when 'l' =>
Replace_Slice (Fmt_Copy, Command_Start, I,
Format (Value, Width, Justification, Lower_Case));
return Format_Type (Fmt_Copy);
when '-' | '+' | '*' =>
if Justification_Changed or else Digit_Occured then
raise Format_Error;
end if;
Justification_Changed := True;
case Element (Fmt_Copy, I) is
when '-' =>
Justification := Left;
when '+' =>
Justification := Right;
when '*' =>
Justification := Center;
when others =>
null;
end case;
when '0' .. '9' =>
Width := Width * 10
+ Character'Pos (Element (Fmt_Copy, I))
- Character'Pos ('0');
when others =>
raise Format_Error;
end case;
end loop;
end if;
raise Format_Error;
end "&";
end Formatted_Output.Enumeration_Output;
| 40.126984 | 79 | 0.421282 |
069c48e7163f434573a1e8df6e9ec9e99918b175 | 868 | adb | Ada | build/gnat/rts/common/adainclude/last_chance_handler.adb | Lucretia/bare_bones | 2666092925729aa8b5655211211529b98c5d18bd | [
"CC0-1.0"
] | 70 | 2015-01-03T01:44:38.000Z | 2022-03-20T14:24:24.000Z | build/gnat/rts/common/adainclude/last_chance_handler.adb | Lucretia/bare_bones | 2666092925729aa8b5655211211529b98c5d18bd | [
"CC0-1.0"
] | null | null | null | build/gnat/rts/common/adainclude/last_chance_handler.adb | Lucretia/bare_bones | 2666092925729aa8b5655211211529b98c5d18bd | [
"CC0-1.0"
] | 12 | 2015-07-13T04:36:54.000Z | 2020-06-21T02:55:04.000Z | -- -*- Mode: Ada -*-
-- Filename : last_chance_handler.adb
-- Description : Implementation of the exception handler for the kernel.
-- Author : Luke A. Guest
-- Created On : Thu Jun 14 12:06:48 2012
-- Licence : See LICENCE in the root directory.
-- with Console; use Console;
procedure Last_Chance_Handler
(Source_Location : System.Address; Line : Integer) is
procedure Crash (Source_Location : System.Address; Line : Integer) with
Import => True,
Convention => Ada;
begin
-- TODO: Add in code to dump the info to serial/screen which
-- is obviously board specific.
-- Put ("Exception raised",
-- Screen_Width_Range'First,
-- Screen_Height_Range'Last);
Crash (Source_Location => Source_Location, Line => Line);
end Last_Chance_Handler;
| 37.73913 | 77 | 0.629032 |
06a77f1a100d2f25a60b104f1f4bb29cc061bb6b | 5,530 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/fname.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- F N A M E --
-- --
-- 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. --
-- --
-- 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, together with its child package Fname.UF define the
-- association between source file names and unit names as defined
-- (see package Uname for definition of format of unit names).
with Namet; use Namet;
package Fname is
-- Note: this package spec does not depend on the Uname spec in the Ada
-- sense, but the comments and description of the semantics do depend on
-- the conventions established by Uname.
---------------------------
-- File Name Conventions --
---------------------------
-- GNAT requires that there be a one to one correspondence between source
-- file names (as used in the Osint package interface) and unit names as
-- defined by the Uname package. This correspondence is defined by the
-- two subprograms defined here in the Fname package.
-- For full rules of file naming, see GNAT User's Guide. Note that the
-- naming rules are affected by the presence of Source_File_Name pragmas
-- that have been previously processed.
-- Note that the file name does *not* include the directory name. The
-- management of directories is provided by Osint, and full file names
-- are used only for error message purposes within GNAT itself.
-----------------
-- Subprograms --
-----------------
function Is_Predefined_File_Name
(Fname : String;
Renamings_Included : Boolean := True) return Boolean;
function Is_Predefined_File_Name
(Fname : File_Name_Type;
Renamings_Included : Boolean := True) return Boolean;
-- These functions determine if the given file name (which must be a simple
-- file name with no directory information) is the source or ALI file name
-- for one of the predefined library units (i.e. part of the Ada, System,
-- or Interface hierarchies). Note that units in the GNAT hierarchy are not
-- considered predefined (see Is_Internal_File_Name below).
--
-- The Renamings_Included parameter indicates whether annex J renamings
-- such as Text_IO are to be considered as predefined. If
-- Renamings_Included is True, then Text_IO will return True, otherwise
-- only children of Ada, Interfaces and System return True.
function Is_Predefined_Renaming_File_Name
(Fname : String) return Boolean;
function Is_Predefined_Renaming_File_Name
(Fname : File_Name_Type) return Boolean;
-- True if Fname is the file name for a predefined renaming (the same file
-- names that are included if Renamings_Included => True is passed to
-- Is_Predefined_File_Name).
function Is_Internal_File_Name
(Fname : String;
Renamings_Included : Boolean := True) return Boolean;
function Is_Internal_File_Name
(Fname : File_Name_Type;
Renamings_Included : Boolean := True) return Boolean;
-- Same as Is_Predefined_File_Name, except units in the GNAT hierarchy are
-- included.
function Is_GNAT_File_Name (Fname : String) return Boolean;
function Is_GNAT_File_Name (Fname : File_Name_Type) return Boolean;
-- True for units in the GNAT hierarchy
end Fname;
| 53.173077 | 79 | 0.550995 |
d0d19cbad53f64af3ed690a1a4df927f10e4f164 | 763 | adb | Ada | tests/test.adb | Lucretia/net_time | d077e5c413fbae6ef64a47559ba12015fa994518 | [
"BSD-3-Clause"
] | null | null | null | tests/test.adb | Lucretia/net_time | d077e5c413fbae6ef64a47559ba12015fa994518 | [
"BSD-3-Clause"
] | null | null | null | tests/test.adb | Lucretia/net_time | d077e5c413fbae6ef64a47559ba12015fa994518 | [
"BSD-3-Clause"
] | null | null | null | with Ada.Calendar; use Ada.Calendar;
with Ada.Calendar.Formatting; use Ada.Calendar.Formatting;
with Ada.Calendar.Time_Zones; use Ada.Calendar.Time_Zones;
with Ada.Text_IO; use Ada.Text_IO;
with Net_Times;
procedure Test is
-- use type Time_Offset;
Now : Time := Clock;
PST : Net_Times.Net_Time := Net_Times.Net_Time'(2019, 7, 20, 16, 6, 21,
Sub_Second => 0.0, TZ_Valid => True, Time_Zone => -8 * 60);
EST : Net_Times.Net_Time := Net_Times.Net_Time'(2019, 7, 20, 16, 6, 21,
Sub_Second => 0.0, TZ_Valid => True, Time_Zone => -5 * 60);
begin
Put ("Now: ");
Put_Line (Net_Times.Image (Now));
Put ("PST: ");
Put_Line (Net_Times.Image (PST));
Put ("EST: ");
Put_Line (Net_Times.Image (EST));
end Test; | 31.791667 | 74 | 0.63827 |
312b9c4131aa372bd8377db112ec340fec719034 | 802 | ads | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/atomic_enum/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/atomic_enum/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/atomic_enum/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2008-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/>.
package Pck is
procedure Increment;
function Is_First return Boolean;
end Pck;
| 36.454545 | 73 | 0.739401 |
069afb59f31321f9a3eb4de111856cd949625931 | 1,569 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_query_context_request_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_query_context_request_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_query_context_request_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_query_context_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
minor_opcode : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
context : aliased xcb.xcb_glx_context_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_query_context_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_query_context_request_t.Item,
Element_Array => xcb.xcb_glx_query_context_request_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_query_context_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_query_context_request_t.Pointer,
Element_Array => xcb.xcb_glx_query_context_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_query_context_request_t;
| 28.017857 | 78 | 0.674315 |
12899fa57273e64b9915547d7a353065517ad329 | 572 | ads | Ada | source/oasis/program-elements-defining_names.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-defining_names.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-defining_names.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package Program.Elements.Defining_Names is
pragma Pure (Program.Elements.Defining_Names);
type Defining_Name is limited interface and Program.Elements.Element;
type Defining_Name_Access is access all Defining_Name'Class
with Storage_Size => 0;
not overriding function Image (Self : Defining_Name) return Text
is abstract;
end Program.Elements.Defining_Names;
| 28.6 | 72 | 0.68007 |
316c710658a2b306f8b7ade27203960306fa7cd9 | 4,997 | adb | Ada | source/types/adam-component_definition.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | source/types/adam-component_definition.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | source/types/adam-component_definition.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.Factory;
package body AdaM.component_Definition
is
-- Storage Pool
--
record_Version : constant := 1;
pool_Size : constant := 5_000;
package Pool is new AdaM.Factory.Pools (".adam-store",
"component_Definitions",
pool_Size,
record_Version,
component_Definition.item,
component_Definition.view);
-- Forge
--
procedure define (Self : in out Item; is_subtype_Indication : in Boolean)
is
begin
if is_subtype_Indication
then
Self.subtype_Indication := AdaM.subtype_Indication.new_Indication;
else
Self.access_Definition := AdaM.access_Definition.new_Definition;
end if;
end define;
procedure destruct (Self : in out Item)
is
begin
null;
end destruct;
function new_Definition (is_subtype_Indication : in Boolean) return component_Definition.view
is
new_View : constant component_Definition.view := Pool.new_Item;
begin
define (component_Definition.item (new_View.all),
is_subtype_Indication);
return new_View;
end new_Definition;
procedure free (Self : in out component_Definition.view)
is
begin
destruct (component_Definition.item (Self.all));
Pool.free (Self);
end free;
-- Attributes
--
overriding
function Id (Self : access Item) return AdaM.Id
is
begin
return Pool.to_Id (Self);
end Id;
overriding
function Name (Self : in Item) return Identifier
is
begin
return "";
end Name;
procedure is_Aliased (Self : in out Item; Now : in Boolean := True)
is
begin
Self.is_Aliased := Now;
end is_Aliased;
function is_Aliased (Self : in Item) return Boolean
is
begin
return Self.is_Aliased;
end is_Aliased;
-- procedure subtype_Indication_is (Self : out Item; Now : in AdaM.subtype_Indication.view)
-- is
-- use type AdaM.access_Definition.view;
-- begin
-- if Self.access_Definition /= null
-- then
-- raise program_Error with "access_Definition is already set";
-- end if;
--
-- Self.subtype_Indication := Now;
-- end subtype_Indication_is;
--
-- procedure access_Definition_is (Self : out Item; Now : in AdaM.access_Definition.view)
-- is
-- use type AdaM.subtype_Indication.view;
-- begin
-- if Self.subtype_Indication /= null
-- then
-- raise program_Error with "subtype_Indication is already set";
-- end if;
--
-- Self.access_Definition := Now;
-- end access_Definition_is;
function is_subtype_Indication (Self : in Item) return Boolean
is
use type AdaM.subtype_Indication.view;
begin
return Self.subtype_Indication /= null;
end is_subtype_Indication;
function is_access_Definition (Self : in Item) return Boolean
is
use type AdaM.access_Definition.view;
begin
return Self.access_Definition /= null;
end is_access_Definition;
function subtype_Indication (Self : in Item) return AdaM.subtype_Indication.view
is
begin
return Self.subtype_Indication;
end subtype_Indication;
function access_Definition (Self : in Item) return AdaM.access_Definition.view
is
begin
return Self.access_Definition;
end access_Definition;
-- procedure Type_is (Self : in out Item; Now : in AdaM.a_Type.view)
-- is
-- begin
-- Self.my_Type := Now;
-- end Type_is;
--
--
-- function my_Type (Self : in Item) return AdaM.a_Type.view
-- is
-- begin
-- return Self.my_Type;
-- end my_Type;
--
--
-- function my_Type (Self : access Item) return access AdaM.a_Type.view
-- is
-- begin
-- return Self.my_Type'Access;
-- end my_Type;
--
--
--
-- procedure Initialiser_is (Self : in out Item; Now : in String)
-- is
-- begin
-- Self.Initialiser := +Now;
-- end Initialiser_is;
--
--
-- function Initialiser (Self : in Item) return String
-- is
-- begin
-- return +Self.Initialiser;
-- end Initialiser;
--
overriding
function to_Source (Self : in Item) return text_Vectors.Vector
is
the_Source : text_Vectors.Vector;
begin
return the_Source;
end to_Source;
-- Streams
--
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View)
renames Pool.View_write;
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View)
renames Pool.View_read;
end AdaM.component_Definition;
| 23.24186 | 100 | 0.60016 |
0ba9f9ad245d28de0e192070fb3c2ffe722b90c0 | 38,424 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/lib.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/lib.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/lib.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L I B --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Subprogram ordering not enforced in this unit
-- (because of some logical groupings).
with Atree; use Atree;
with Csets; use Csets;
with Einfo; use Einfo;
with Fname; use Fname;
with Nlists; use Nlists;
with Opt; use Opt;
with Output; use Output;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Stand; use Stand;
with Stringt; use Stringt;
with Tree_IO; use Tree_IO;
with Uname; use Uname;
with Widechar; use Widechar;
package body Lib is
Switch_Storing_Enabled : Boolean := True;
-- Controlled by Enable_Switch_Storing/Disable_Switch_Storing
-----------------------
-- Local Subprograms --
-----------------------
type SEU_Result is (
Yes_Before, -- S1 is in same extended unit as S2 and appears before it
Yes_Same, -- S1 is in same extended unit as S2, Slocs are the same
Yes_After, -- S1 is in same extended unit as S2, and appears after it
No); -- S2 is not in same extended unit as S2
function Check_Same_Extended_Unit (S1, S2 : Source_Ptr) return SEU_Result;
-- Used by In_Same_Extended_Unit and Earlier_In_Extended_Unit. Returns
-- value as described above.
function Get_Code_Or_Source_Unit
(S : Source_Ptr;
Unwind_Instances : Boolean;
Unwind_Subunits : Boolean) return Unit_Number_Type;
-- Common processing for routines Get_Code_Unit, Get_Source_Unit, and
-- Get_Top_Level_Code_Unit. Unwind_Instances is True when the unit for the
-- top-level instantiation should be returned instead of the unit for the
-- template, in the case of an instantiation. Unwind_Subunits is True when
-- the corresponding top-level unit should be returned instead of a
-- subunit, in the case of a subunit.
--------------------------------------------
-- Access Functions for Unit Table Fields --
--------------------------------------------
function Cunit (U : Unit_Number_Type) return Node_Id is
begin
return Units.Table (U).Cunit;
end Cunit;
function Cunit_Entity (U : Unit_Number_Type) return Entity_Id is
begin
return Units.Table (U).Cunit_Entity;
end Cunit_Entity;
function Dependency_Num (U : Unit_Number_Type) return Nat is
begin
return Units.Table (U).Dependency_Num;
end Dependency_Num;
function Dynamic_Elab (U : Unit_Number_Type) return Boolean is
begin
return Units.Table (U).Dynamic_Elab;
end Dynamic_Elab;
function Error_Location (U : Unit_Number_Type) return Source_Ptr is
begin
return Units.Table (U).Error_Location;
end Error_Location;
function Expected_Unit (U : Unit_Number_Type) return Unit_Name_Type is
begin
return Units.Table (U).Expected_Unit;
end Expected_Unit;
function Fatal_Error (U : Unit_Number_Type) return Fatal_Type is
begin
return Units.Table (U).Fatal_Error;
end Fatal_Error;
function Generate_Code (U : Unit_Number_Type) return Boolean is
begin
return Units.Table (U).Generate_Code;
end Generate_Code;
function Has_RACW (U : Unit_Number_Type) return Boolean is
begin
return Units.Table (U).Has_RACW;
end Has_RACW;
function Ident_String (U : Unit_Number_Type) return Node_Id is
begin
return Units.Table (U).Ident_String;
end Ident_String;
function Loading (U : Unit_Number_Type) return Boolean is
begin
return Units.Table (U).Loading;
end Loading;
function Main_CPU (U : Unit_Number_Type) return Int is
begin
return Units.Table (U).Main_CPU;
end Main_CPU;
function Main_Priority (U : Unit_Number_Type) return Int is
begin
return Units.Table (U).Main_Priority;
end Main_Priority;
function Munit_Index (U : Unit_Number_Type) return Nat is
begin
return Units.Table (U).Munit_Index;
end Munit_Index;
function No_Elab_Code_All (U : Unit_Number_Type) return Boolean is
begin
return Units.Table (U).No_Elab_Code_All;
end No_Elab_Code_All;
function OA_Setting (U : Unit_Number_Type) return Character is
begin
return Units.Table (U).OA_Setting;
end OA_Setting;
function Source_Index (U : Unit_Number_Type) return Source_File_Index is
begin
return Units.Table (U).Source_Index;
end Source_Index;
function Unit_File_Name (U : Unit_Number_Type) return File_Name_Type is
begin
return Units.Table (U).Unit_File_Name;
end Unit_File_Name;
function Unit_Name (U : Unit_Number_Type) return Unit_Name_Type is
begin
return Units.Table (U).Unit_Name;
end Unit_Name;
------------------------------------------
-- Subprograms to Set Unit Table Fields --
------------------------------------------
procedure Set_Cunit (U : Unit_Number_Type; N : Node_Id) is
begin
Units.Table (U).Cunit := N;
end Set_Cunit;
procedure Set_Cunit_Entity (U : Unit_Number_Type; E : Entity_Id) is
begin
Units.Table (U).Cunit_Entity := E;
Set_Is_Compilation_Unit (E);
end Set_Cunit_Entity;
procedure Set_Dynamic_Elab (U : Unit_Number_Type; B : Boolean := True) is
begin
Units.Table (U).Dynamic_Elab := B;
end Set_Dynamic_Elab;
procedure Set_Error_Location (U : Unit_Number_Type; W : Source_Ptr) is
begin
Units.Table (U).Error_Location := W;
end Set_Error_Location;
procedure Set_Fatal_Error (U : Unit_Number_Type; V : Fatal_Type) is
begin
Units.Table (U).Fatal_Error := V;
end Set_Fatal_Error;
procedure Set_Generate_Code (U : Unit_Number_Type; B : Boolean := True) is
begin
Units.Table (U).Generate_Code := B;
end Set_Generate_Code;
procedure Set_Has_RACW (U : Unit_Number_Type; B : Boolean := True) is
begin
Units.Table (U).Has_RACW := B;
end Set_Has_RACW;
procedure Set_Ident_String (U : Unit_Number_Type; N : Node_Id) is
begin
Units.Table (U).Ident_String := N;
end Set_Ident_String;
procedure Set_Loading (U : Unit_Number_Type; B : Boolean := True) is
begin
Units.Table (U).Loading := B;
end Set_Loading;
procedure Set_Main_CPU (U : Unit_Number_Type; P : Int) is
begin
Units.Table (U).Main_CPU := P;
end Set_Main_CPU;
procedure Set_Main_Priority (U : Unit_Number_Type; P : Int) is
begin
Units.Table (U).Main_Priority := P;
end Set_Main_Priority;
procedure Set_No_Elab_Code_All
(U : Unit_Number_Type;
B : Boolean := True)
is
begin
Units.Table (U).No_Elab_Code_All := B;
end Set_No_Elab_Code_All;
procedure Set_OA_Setting (U : Unit_Number_Type; C : Character) is
begin
Units.Table (U).OA_Setting := C;
end Set_OA_Setting;
procedure Set_Unit_Name (U : Unit_Number_Type; N : Unit_Name_Type) is
begin
Units.Table (U).Unit_Name := N;
end Set_Unit_Name;
------------------------------
-- Check_Same_Extended_Unit --
------------------------------
function Check_Same_Extended_Unit (S1, S2 : Source_Ptr) return SEU_Result is
Max_Iterations : constant Nat := Maximum_Instantiations * 2;
-- Limit to prevent a potential infinite loop
Counter : Nat := 0;
Depth1 : Nat;
Depth2 : Nat;
Inst1 : Source_Ptr;
Inst2 : Source_Ptr;
Sind1 : Source_File_Index;
Sind2 : Source_File_Index;
Sloc1 : Source_Ptr;
Sloc2 : Source_Ptr;
Unit1 : Node_Id;
Unit2 : Node_Id;
Unum1 : Unit_Number_Type;
Unum2 : Unit_Number_Type;
begin
if S1 = No_Location or else S2 = No_Location then
return No;
elsif S1 = Standard_Location then
if S2 = Standard_Location then
return Yes_Same;
else
return No;
end if;
elsif S2 = Standard_Location then
return No;
end if;
Sloc1 := S1;
Sloc2 := S2;
Unum1 := Get_Source_Unit (Sloc1);
Unum2 := Get_Source_Unit (Sloc2);
loop
-- Step 1: Check whether the two locations are in the same source
-- file.
Sind1 := Get_Source_File_Index (Sloc1);
Sind2 := Get_Source_File_Index (Sloc2);
if Sind1 = Sind2 then
if Sloc1 < Sloc2 then
return Yes_Before;
elsif Sloc1 > Sloc2 then
return Yes_After;
else
return Yes_Same;
end if;
end if;
-- Step 2: Check subunits. If a subunit is instantiated, follow the
-- instantiation chain rather than the stub chain.
Unit1 := Unit (Cunit (Unum1));
Unit2 := Unit (Cunit (Unum2));
Inst1 := Instantiation (Sind1);
Inst2 := Instantiation (Sind2);
if Nkind (Unit1) = N_Subunit
and then Present (Corresponding_Stub (Unit1))
and then Inst1 = No_Location
then
if Nkind (Unit2) = N_Subunit
and then Present (Corresponding_Stub (Unit2))
and then Inst2 = No_Location
then
-- Both locations refer to subunits which may have a common
-- ancestor. If they do, the deeper subunit must have a longer
-- unit name. Replace the deeper one with its corresponding
-- stub in order to find the nearest ancestor.
if Length_Of_Name (Unit_Name (Unum1)) <
Length_Of_Name (Unit_Name (Unum2))
then
Sloc2 := Sloc (Corresponding_Stub (Unit2));
Unum2 := Get_Source_Unit (Sloc2);
goto Continue;
else
Sloc1 := Sloc (Corresponding_Stub (Unit1));
Unum1 := Get_Source_Unit (Sloc1);
goto Continue;
end if;
-- Sloc1 in subunit, Sloc2 not
else
Sloc1 := Sloc (Corresponding_Stub (Unit1));
Unum1 := Get_Source_Unit (Sloc1);
goto Continue;
end if;
-- Sloc2 in subunit, Sloc1 not
elsif Nkind (Unit2) = N_Subunit
and then Present (Corresponding_Stub (Unit2))
and then Inst2 = No_Location
then
Sloc2 := Sloc (Corresponding_Stub (Unit2));
Unum2 := Get_Source_Unit (Sloc2);
goto Continue;
end if;
-- Step 3: Check instances. The two locations may yield a common
-- ancestor.
if Inst1 /= No_Location then
if Inst2 /= No_Location then
-- Both locations denote instantiations
Depth1 := Instantiation_Depth (Sloc1);
Depth2 := Instantiation_Depth (Sloc2);
if Depth1 < Depth2 then
Sloc2 := Inst2;
Unum2 := Get_Source_Unit (Sloc2);
goto Continue;
elsif Depth1 > Depth2 then
Sloc1 := Inst1;
Unum1 := Get_Source_Unit (Sloc1);
goto Continue;
else
Sloc1 := Inst1;
Sloc2 := Inst2;
Unum1 := Get_Source_Unit (Sloc1);
Unum2 := Get_Source_Unit (Sloc2);
goto Continue;
end if;
-- Sloc1 is an instantiation
else
Sloc1 := Inst1;
Unum1 := Get_Source_Unit (Sloc1);
goto Continue;
end if;
-- Sloc2 is an instantiation
elsif Inst2 /= No_Location then
Sloc2 := Inst2;
Unum2 := Get_Source_Unit (Sloc2);
goto Continue;
end if;
-- Step 4: One location in the spec, the other in the corresponding
-- body of the same unit. The location in the spec is considered
-- earlier.
if Nkind (Unit1) = N_Subprogram_Body
or else
Nkind (Unit1) = N_Package_Body
then
if Library_Unit (Cunit (Unum1)) = Cunit (Unum2) then
return Yes_After;
end if;
elsif Nkind (Unit2) = N_Subprogram_Body
or else
Nkind (Unit2) = N_Package_Body
then
if Library_Unit (Cunit (Unum2)) = Cunit (Unum1) then
return Yes_Before;
end if;
end if;
-- At this point it is certain that the two locations denote two
-- entirely separate units.
return No;
<<Continue>>
Counter := Counter + 1;
-- Prevent looping forever
if Counter > Max_Iterations then
-- ??? Not quite right, but return a value to be able to generate
-- SCIL files and hope for the best.
if CodePeer_Mode then
return No;
else
raise Program_Error;
end if;
end if;
end loop;
end Check_Same_Extended_Unit;
-------------------------------
-- Compilation_Switches_Last --
-------------------------------
function Compilation_Switches_Last return Nat is
begin
return Compilation_Switches.Last;
end Compilation_Switches_Last;
---------------------------
-- Enable_Switch_Storing --
---------------------------
procedure Enable_Switch_Storing is
begin
Switch_Storing_Enabled := True;
end Enable_Switch_Storing;
----------------------------
-- Disable_Switch_Storing --
----------------------------
procedure Disable_Switch_Storing is
begin
Switch_Storing_Enabled := False;
end Disable_Switch_Storing;
------------------------------
-- Earlier_In_Extended_Unit --
------------------------------
function Earlier_In_Extended_Unit (S1, S2 : Source_Ptr) return Boolean is
begin
return Check_Same_Extended_Unit (S1, S2) = Yes_Before;
end Earlier_In_Extended_Unit;
-----------------------
-- Exact_Source_Name --
-----------------------
function Exact_Source_Name (Loc : Source_Ptr) return String is
U : constant Unit_Number_Type := Get_Source_Unit (Loc);
Buf : constant Source_Buffer_Ptr := Source_Text (Source_Index (U));
Orig : constant Source_Ptr := Original_Location (Loc);
P : Source_Ptr;
WC : Char_Code;
Err : Boolean;
pragma Warnings (Off, WC);
pragma Warnings (Off, Err);
begin
-- Entity is character literal
if Buf (Orig) = ''' then
return String (Buf (Orig .. Orig + 2));
-- Entity is operator symbol
elsif Buf (Orig) = '"' or else Buf (Orig) = '%' then
P := Orig;
loop
P := P + 1;
exit when Buf (P) = Buf (Orig);
end loop;
return String (Buf (Orig .. P));
-- Entity is identifier
else
P := Orig;
loop
if Is_Start_Of_Wide_Char (Buf, P) then
Scan_Wide (Buf, P, WC, Err);
elsif not Identifier_Char (Buf (P)) then
exit;
else
P := P + 1;
end if;
end loop;
-- Write out the identifier by copying the exact source characters
-- used in its declaration. Note that this means wide characters will
-- be in their original encoded form.
return String (Buf (Orig .. P - 1));
end if;
end Exact_Source_Name;
----------------------------
-- Entity_Is_In_Main_Unit --
----------------------------
function Entity_Is_In_Main_Unit (E : Entity_Id) return Boolean is
S : Entity_Id;
begin
S := Scope (E);
while S /= Standard_Standard loop
if S = Main_Unit_Entity then
return True;
elsif Ekind (S) = E_Package and then Is_Child_Unit (S) then
return False;
else
S := Scope (S);
end if;
end loop;
return False;
end Entity_Is_In_Main_Unit;
--------------------------
-- Generic_May_Lack_ALI --
--------------------------
function Generic_May_Lack_ALI (Sfile : File_Name_Type) return Boolean is
begin
-- We allow internal generic units to be used without having a
-- corresponding ALI files to help bootstrapping with older compilers
-- that did not support generating ALIs for such generics. It is safe
-- to do so because the only thing the generated code would contain
-- is the elaboration boolean, and we are careful to elaborate all
-- predefined units first anyway.
return Is_Internal_File_Name
(Fname => Sfile,
Renamings_Included => True);
end Generic_May_Lack_ALI;
-----------------------------
-- Get_Code_Or_Source_Unit --
-----------------------------
function Get_Code_Or_Source_Unit
(S : Source_Ptr;
Unwind_Instances : Boolean;
Unwind_Subunits : Boolean) return Unit_Number_Type
is
begin
-- Search table unless we have No_Location, which can happen if the
-- relevant location has not been set yet. Happens for example when
-- we obtain Sloc (Cunit (Main_Unit)) before it is set.
if S /= No_Location then
declare
Source_File : Source_File_Index;
Source_Unit : Unit_Number_Type;
Unit_Node : Node_Id;
begin
Source_File := Get_Source_File_Index (S);
if Unwind_Instances then
while Template (Source_File) /= No_Source_File loop
Source_File := Template (Source_File);
end loop;
end if;
Source_Unit := Unit (Source_File);
if Unwind_Subunits then
Unit_Node := Unit (Cunit (Source_Unit));
while Nkind (Unit_Node) = N_Subunit
and then Present (Corresponding_Stub (Unit_Node))
loop
Source_Unit :=
Get_Code_Or_Source_Unit
(Sloc (Corresponding_Stub (Unit_Node)),
Unwind_Instances => Unwind_Instances,
Unwind_Subunits => Unwind_Subunits);
Unit_Node := Unit (Cunit (Source_Unit));
end loop;
end if;
if Source_Unit /= No_Unit then
return Source_Unit;
end if;
end;
end if;
-- If S was No_Location, or was not in the table, we must be in the main
-- source unit (and the value has not been placed in the table yet),
-- or in one of the configuration pragma files.
return Main_Unit;
end Get_Code_Or_Source_Unit;
-------------------
-- Get_Code_Unit --
-------------------
function Get_Code_Unit (S : Source_Ptr) return Unit_Number_Type is
begin
return
Get_Code_Or_Source_Unit
(Top_Level_Location (S),
Unwind_Instances => False,
Unwind_Subunits => False);
end Get_Code_Unit;
function Get_Code_Unit (N : Node_Or_Entity_Id) return Unit_Number_Type is
begin
return Get_Code_Unit (Sloc (N));
end Get_Code_Unit;
----------------------------
-- Get_Compilation_Switch --
----------------------------
function Get_Compilation_Switch (N : Pos) return String_Ptr is
begin
if N <= Compilation_Switches.Last then
return Compilation_Switches.Table (N);
else
return null;
end if;
end Get_Compilation_Switch;
----------------------------------
-- Get_Cunit_Entity_Unit_Number --
----------------------------------
function Get_Cunit_Entity_Unit_Number
(E : Entity_Id) return Unit_Number_Type
is
begin
for U in Units.First .. Units.Last loop
if Cunit_Entity (U) = E then
return U;
end if;
end loop;
-- If not in the table, must be the main source unit, and we just
-- have not got it put into the table yet.
return Main_Unit;
end Get_Cunit_Entity_Unit_Number;
---------------------------
-- Get_Cunit_Unit_Number --
---------------------------
function Get_Cunit_Unit_Number (N : Node_Id) return Unit_Number_Type is
begin
for U in Units.First .. Units.Last loop
if Cunit (U) = N then
return U;
end if;
end loop;
-- If not in the table, must be a spec created for a main unit that is a
-- child subprogram body which we have not inserted into the table yet.
if N = Library_Unit (Cunit (Main_Unit)) then
return Main_Unit;
-- If it is anything else, something is seriously wrong, and we really
-- don't want to proceed, even if assertions are off, so we explicitly
-- raise an exception in this case to terminate compilation.
else
raise Program_Error;
end if;
end Get_Cunit_Unit_Number;
---------------------
-- Get_Source_Unit --
---------------------
function Get_Source_Unit (S : Source_Ptr) return Unit_Number_Type is
begin
return
Get_Code_Or_Source_Unit
(S, Unwind_Instances => True, Unwind_Subunits => False);
end Get_Source_Unit;
function Get_Source_Unit (N : Node_Or_Entity_Id) return Unit_Number_Type is
begin
return Get_Source_Unit (Sloc (N));
end Get_Source_Unit;
-----------------------------
-- Get_Top_Level_Code_Unit --
-----------------------------
function Get_Top_Level_Code_Unit (S : Source_Ptr) return Unit_Number_Type is
begin
return
Get_Code_Or_Source_Unit
(Top_Level_Location (S),
Unwind_Instances => False,
Unwind_Subunits => True);
end Get_Top_Level_Code_Unit;
function Get_Top_Level_Code_Unit
(N : Node_Or_Entity_Id) return Unit_Number_Type is
begin
return Get_Top_Level_Code_Unit (Sloc (N));
end Get_Top_Level_Code_Unit;
--------------------------------
-- In_Extended_Main_Code_Unit --
--------------------------------
function In_Extended_Main_Code_Unit
(N : Node_Or_Entity_Id) return Boolean
is
begin
if Sloc (N) = Standard_Location then
return False;
elsif Sloc (N) = No_Location then
return False;
-- Special case Itypes to test the Sloc of the associated node. The
-- reason we do this is for possible calls from gigi after -gnatD
-- processing is complete in sprint. This processing updates the
-- sloc fields of all nodes in the tree, but itypes are not in the
-- tree so their slocs do not get updated.
elsif Nkind (N) = N_Defining_Identifier
and then Is_Itype (N)
then
return In_Extended_Main_Code_Unit (Associated_Node_For_Itype (N));
-- Otherwise see if we are in the main unit
elsif Get_Code_Unit (Sloc (N)) = Get_Code_Unit (Cunit (Main_Unit)) then
return True;
-- Node may be in spec (or subunit etc) of main unit
else
return
In_Same_Extended_Unit (N, Cunit (Main_Unit));
end if;
end In_Extended_Main_Code_Unit;
function In_Extended_Main_Code_Unit (Loc : Source_Ptr) return Boolean is
begin
if Loc = Standard_Location then
return False;
elsif Loc = No_Location then
return False;
-- Otherwise see if we are in the main unit
elsif Get_Code_Unit (Loc) = Get_Code_Unit (Cunit (Main_Unit)) then
return True;
-- Location may be in spec (or subunit etc) of main unit
else
return
In_Same_Extended_Unit (Loc, Sloc (Cunit (Main_Unit)));
end if;
end In_Extended_Main_Code_Unit;
----------------------------------
-- In_Extended_Main_Source_Unit --
----------------------------------
function In_Extended_Main_Source_Unit
(N : Node_Or_Entity_Id) return Boolean
is
Nloc : constant Source_Ptr := Sloc (N);
Mloc : constant Source_Ptr := Sloc (Cunit (Main_Unit));
begin
-- If parsing, then use the global flag to indicate result
if Compiler_State = Parsing then
return Parsing_Main_Extended_Source;
-- Special value cases
elsif Nloc = Standard_Location then
return False;
elsif Nloc = No_Location then
return False;
-- Special case Itypes to test the Sloc of the associated node. The
-- reason we do this is for possible calls from gigi after -gnatD
-- processing is complete in sprint. This processing updates the
-- sloc fields of all nodes in the tree, but itypes are not in the
-- tree so their slocs do not get updated.
elsif Nkind (N) = N_Defining_Identifier
and then Is_Itype (N)
then
return In_Extended_Main_Source_Unit (Associated_Node_For_Itype (N));
-- Otherwise compare original locations to see if in same unit
else
return
In_Same_Extended_Unit
(Original_Location (Nloc), Original_Location (Mloc));
end if;
end In_Extended_Main_Source_Unit;
function In_Extended_Main_Source_Unit
(Loc : Source_Ptr) return Boolean
is
Mloc : constant Source_Ptr := Sloc (Cunit (Main_Unit));
begin
-- If parsing, then use the global flag to indicate result
if Compiler_State = Parsing then
return Parsing_Main_Extended_Source;
-- Special value cases
elsif Loc = Standard_Location then
return False;
elsif Loc = No_Location then
return False;
-- Otherwise compare original locations to see if in same unit
else
return
In_Same_Extended_Unit
(Original_Location (Loc), Original_Location (Mloc));
end if;
end In_Extended_Main_Source_Unit;
------------------------
-- In_Predefined_Unit --
------------------------
function In_Predefined_Unit (N : Node_Or_Entity_Id) return Boolean is
begin
return In_Predefined_Unit (Sloc (N));
end In_Predefined_Unit;
function In_Predefined_Unit (S : Source_Ptr) return Boolean is
Unit : constant Unit_Number_Type := Get_Source_Unit (S);
File : constant File_Name_Type := Unit_File_Name (Unit);
begin
return Is_Predefined_File_Name (File);
end In_Predefined_Unit;
-----------------------
-- In_Same_Code_Unit --
-----------------------
function In_Same_Code_Unit (N1, N2 : Node_Or_Entity_Id) return Boolean is
S1 : constant Source_Ptr := Sloc (N1);
S2 : constant Source_Ptr := Sloc (N2);
begin
if S1 = No_Location or else S2 = No_Location then
return False;
elsif S1 = Standard_Location then
return S2 = Standard_Location;
elsif S2 = Standard_Location then
return False;
end if;
return Get_Code_Unit (N1) = Get_Code_Unit (N2);
end In_Same_Code_Unit;
---------------------------
-- In_Same_Extended_Unit --
---------------------------
function In_Same_Extended_Unit
(N1, N2 : Node_Or_Entity_Id) return Boolean
is
begin
return Check_Same_Extended_Unit (Sloc (N1), Sloc (N2)) /= No;
end In_Same_Extended_Unit;
function In_Same_Extended_Unit (S1, S2 : Source_Ptr) return Boolean is
begin
return Check_Same_Extended_Unit (S1, S2) /= No;
end In_Same_Extended_Unit;
-------------------------
-- In_Same_Source_Unit --
-------------------------
function In_Same_Source_Unit (N1, N2 : Node_Or_Entity_Id) return Boolean is
S1 : constant Source_Ptr := Sloc (N1);
S2 : constant Source_Ptr := Sloc (N2);
begin
if S1 = No_Location or else S2 = No_Location then
return False;
elsif S1 = Standard_Location then
return S2 = Standard_Location;
elsif S2 = Standard_Location then
return False;
end if;
return Get_Source_Unit (N1) = Get_Source_Unit (N2);
end In_Same_Source_Unit;
-----------------------------
-- Increment_Serial_Number --
-----------------------------
function Increment_Serial_Number return Nat is
TSN : Int renames Units.Table (Current_Sem_Unit).Serial_Number;
begin
TSN := TSN + 1;
return TSN;
end Increment_Serial_Number;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Linker_Option_Lines.Init;
Notes.Init;
Load_Stack.Init;
Units.Init;
Compilation_Switches.Init;
end Initialize;
---------------
-- Is_Loaded --
---------------
function Is_Loaded (Uname : Unit_Name_Type) return Boolean is
begin
for Unum in Units.First .. Units.Last loop
if Uname = Unit_Name (Unum) then
return True;
end if;
end loop;
return False;
end Is_Loaded;
---------------
-- Last_Unit --
---------------
function Last_Unit return Unit_Number_Type is
begin
return Units.Last;
end Last_Unit;
----------
-- List --
----------
procedure List (File_Names_Only : Boolean := False) is separate;
----------
-- Lock --
----------
procedure Lock is
begin
Linker_Option_Lines.Locked := True;
Load_Stack.Locked := True;
Units.Locked := True;
Linker_Option_Lines.Release;
Load_Stack.Release;
Units.Release;
end Lock;
---------------
-- Num_Units --
---------------
function Num_Units return Nat is
begin
return Int (Units.Last) - Int (Main_Unit) + 1;
end Num_Units;
-----------------
-- Remove_Unit --
-----------------
procedure Remove_Unit (U : Unit_Number_Type) is
begin
if U = Units.Last then
Units.Decrement_Last;
end if;
end Remove_Unit;
----------------------------------
-- Replace_Linker_Option_String --
----------------------------------
procedure Replace_Linker_Option_String
(S : String_Id; Match_String : String)
is
begin
if Match_String'Length > 0 then
for J in 1 .. Linker_Option_Lines.Last loop
String_To_Name_Buffer (Linker_Option_Lines.Table (J).Option);
if Match_String = Name_Buffer (1 .. Match_String'Length) then
Linker_Option_Lines.Table (J).Option := S;
return;
end if;
end loop;
end if;
Store_Linker_Option_String (S);
end Replace_Linker_Option_String;
----------
-- Sort --
----------
procedure Sort (Tbl : in out Unit_Ref_Table) is separate;
------------------------------
-- Store_Compilation_Switch --
------------------------------
procedure Store_Compilation_Switch (Switch : String) is
begin
if Switch_Storing_Enabled then
Compilation_Switches.Increment_Last;
Compilation_Switches.Table (Compilation_Switches.Last) :=
new String'(Switch);
-- Fix up --RTS flag which has been transformed by the gcc driver
-- into -fRTS
if Switch'Last >= Switch'First + 4
and then Switch (Switch'First .. Switch'First + 4) = "-fRTS"
then
Compilation_Switches.Table
(Compilation_Switches.Last) (Switch'First + 1) := '-';
end if;
end if;
end Store_Compilation_Switch;
--------------------------------
-- Store_Linker_Option_String --
--------------------------------
procedure Store_Linker_Option_String (S : String_Id) is
begin
Linker_Option_Lines.Append ((Option => S, Unit => Current_Sem_Unit));
end Store_Linker_Option_String;
----------------
-- Store_Note --
----------------
procedure Store_Note (N : Node_Id) is
Sfile : constant Source_File_Index := Get_Source_File_Index (Sloc (N));
begin
-- Notes for a generic are emitted when processing the template, never
-- in instances.
if In_Extended_Main_Code_Unit (N)
and then Instance (Sfile) = No_Instance_Id
then
Notes.Append (N);
end if;
end Store_Note;
-------------------------------
-- Synchronize_Serial_Number --
-------------------------------
procedure Synchronize_Serial_Number is
TSN : Int renames Units.Table (Current_Sem_Unit).Serial_Number;
begin
TSN := TSN + 1;
end Synchronize_Serial_Number;
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
N : Nat;
S : String_Ptr;
begin
Units.Tree_Read;
-- Read Compilation_Switches table. First release the memory occupied
-- by the previously loaded switches.
for J in Compilation_Switches.First .. Compilation_Switches.Last loop
Free (Compilation_Switches.Table (J));
end loop;
Tree_Read_Int (N);
Compilation_Switches.Set_Last (N);
for J in 1 .. N loop
Tree_Read_Str (S);
Compilation_Switches.Table (J) := S;
end loop;
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
Units.Tree_Write;
-- Write Compilation_Switches table
Tree_Write_Int (Compilation_Switches.Last);
for J in 1 .. Compilation_Switches.Last loop
Tree_Write_Str (Compilation_Switches.Table (J));
end loop;
end Tree_Write;
------------
-- Unlock --
------------
procedure Unlock is
begin
Linker_Option_Lines.Locked := False;
Load_Stack.Locked := False;
Units.Locked := False;
end Unlock;
-----------------
-- Version_Get --
-----------------
function Version_Get (U : Unit_Number_Type) return Word_Hex_String is
begin
return Get_Hex_String (Units.Table (U).Version);
end Version_Get;
------------------------
-- Version_Referenced --
------------------------
procedure Version_Referenced (S : String_Id) is
begin
Version_Ref.Append (S);
end Version_Referenced;
---------------------
-- Write_Unit_Info --
---------------------
procedure Write_Unit_Info
(Unit_Num : Unit_Number_Type;
Item : Node_Id;
Prefix : String := "";
Withs : Boolean := False)
is
begin
Write_Str (Prefix);
Write_Unit_Name (Unit_Name (Unit_Num));
Write_Str (", unit ");
Write_Int (Int (Unit_Num));
Write_Str (", ");
Write_Int (Int (Item));
Write_Str ("=");
Write_Str (Node_Kind'Image (Nkind (Item)));
if Item /= Original_Node (Item) then
Write_Str (", orig = ");
Write_Int (Int (Original_Node (Item)));
Write_Str ("=");
Write_Str (Node_Kind'Image (Nkind (Original_Node (Item))));
end if;
Write_Eol;
-- Skip the rest if we're not supposed to print the withs
if not Withs then
return;
end if;
declare
Context_Item : Node_Id;
begin
Context_Item := First (Context_Items (Cunit (Unit_Num)));
while Present (Context_Item)
and then (Nkind (Context_Item) /= N_With_Clause
or else Limited_Present (Context_Item))
loop
Context_Item := Next (Context_Item);
end loop;
if Present (Context_Item) then
Indent;
Write_Line ("withs:");
Indent;
while Present (Context_Item) loop
if Nkind (Context_Item) = N_With_Clause
and then not Limited_Present (Context_Item)
then
pragma Assert (Present (Library_Unit (Context_Item)));
Write_Unit_Name
(Unit_Name
(Get_Cunit_Unit_Number (Library_Unit (Context_Item))));
if Implicit_With (Context_Item) then
Write_Str (" -- implicit");
end if;
Write_Eol;
end if;
Context_Item := Next (Context_Item);
end loop;
Outdent;
Write_Line ("end withs");
Outdent;
end if;
end;
end Write_Unit_Info;
end Lib;
| 29.556923 | 79 | 0.563944 |
a12a236a7704bff6d1635eff3f178c6187c0f72f | 98 | ads | Ada | Practica 03/P03_Crea_Tarea/src/tareas.ads | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | null | null | null | Practica 03/P03_Crea_Tarea/src/tareas.ads | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | null | null | null | Practica 03/P03_Crea_Tarea/src/tareas.ads | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | 1 | 2022-03-06T17:37:39.000Z | 2022-03-06T17:37:39.000Z | package Tareas is
task type Tarea_1;
task type Tarea_2;
task type Tarea_3;
end Tareas;
| 12.25 | 21 | 0.704082 |
06fbab136c53abe9b4234d69d823818d77fce217 | 11,820 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_0019.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_0019.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_0019.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 © 2012-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$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_0019 is
pragma Preelaborate;
Group_0019 : aliased constant Core_Second_Stage
:= (16#00# .. 16#1E# => -- 1900 .. 191E
(Other_Letter, Neutral,
Other, A_Letter, O_Letter, Alphabetic,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#1F# => -- 191F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#20# .. 16#22# => -- 1920 .. 1922
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#23# .. 16#26# => -- 1923 .. 1926
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#27# .. 16#28# => -- 1927 .. 1928
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#29# .. 16#2B# => -- 1929 .. 192B
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#2C# .. 16#2F# => -- 192C .. 192F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#30# .. 16#31# => -- 1930 .. 1931
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#32# => -- 1932
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#33# .. 16#38# => -- 1933 .. 1938
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#39# .. 16#3B# => -- 1939 .. 193B
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#3C# .. 16#3F# => -- 193C .. 193F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#40# => -- 1940
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#41# .. 16#43# => -- 1941 .. 1943
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#44# .. 16#45# => -- 1944 .. 1945
(Other_Punctuation, Neutral,
Other, Other, S_Term, Exclamation,
(STerm
| Terminal_Punctuation
| Grapheme_Base => True,
others => False)),
16#46# .. 16#4F# => -- 1946 .. 194F
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#6E# .. 16#6F# => -- 196E .. 196F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#75# .. 16#7F# => -- 1975 .. 197F
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#AC# .. 16#AF# => -- 19AC .. 19AF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#B0# .. 16#B4# => -- 19B0 .. 19B4
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#B5# .. 16#B7# => -- 19B5 .. 19B7
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#B8# .. 16#B9# => -- 19B8 .. 19B9
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#BA# => -- 19BA
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#BB# .. 16#C0# => -- 19BB .. 19C0
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#C8# .. 16#C9# => -- 19C8 .. 19C9
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#CA# .. 16#CF# => -- 19CA .. 19CF
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#D0# .. 16#D9# => -- 19D0 .. 19D9
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#DA# => -- 19DA
(Other_Number, Neutral,
Other, Other, Other, Complex_Context,
(Other_ID_Continue
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#DB# .. 16#DD# => -- 19DB .. 19DD
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)),
16#DE# .. 16#DF# => -- 19DE .. 19DF
(Other_Symbol, Neutral,
Other, Other, Other, Complex_Context,
(Grapheme_Base => True,
others => False)),
16#E0# .. 16#FF# => -- 19E0 .. 19FF
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
others =>
(Other_Letter, Neutral,
Other, Other, O_Letter, Complex_Context,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_0019;
| 41.473684 | 78 | 0.447885 |
316120998f877fdef341e924092f268e45a39f01 | 2,401 | ada | Ada | archive/test/manual/etags/ada-src/waroquiers.ada | RyanMcCarl/.emacs.d | 2b51577f7288bced8f72f2ecec9ee94387e73458 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | archive/test/manual/etags/ada-src/waroquiers.ada | RyanMcCarl/.emacs.d | 2b51577f7288bced8f72f2ecec9ee94387e73458 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | archive/test/manual/etags/ada-src/waroquiers.ada | RyanMcCarl/.emacs.d | 2b51577f7288bced8f72f2ecec9ee94387e73458 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | -- This file is an Ada file containing test data
-- for etags (Ada83 and Ada95 support).
package Pkg1 is
type Private_T is private;
package Inner1 is
procedure Private_T;
end Inner1;
package Inner2 is
task Private_T;
end Inner2;
type Public_T is
record
A : Integer;
B : Integer;
end record;
procedure Pkg1_Proc1;
procedure Pkg1_Proc2 (I : Integer);
function Pkg1_Func1 return Boolean;
function Pkg1_Func2 (Ijk : Integer; Z : Integer) return Natural;
package Pkg1_Pkg1 is
procedure Pkg1_Pkg1_Proc1;
end Pkg1_Pkg1;
task type Task_Type is
entry Entry1;
entry Entry2 (I : Integer);
end;
private
type Private_T is
record
Z : Integer;
W : Boolean;
end record;
end Pkg1;
package body Pkg1 is
procedure Pkg1_Proc1 is
begin
null;
end;
package body Inner1 is
procedure Private_T is
begin
null;
end;
end Inner1;
package body Inner2 is
task body Private_T is
begin
loop
null;
end loop;
end;
end Inner2;
task body Task_Type is
begin
select
accept Entry1 do
null;
end;
or
accept Entry2 (I : Integer) do
null;
end;
end select;
end;
procedure Pkg1_Proc2 (I : Integer) is
begin
null;
end Pkg1_Proc2;
function Pkg1_Func1 return Boolean is separate;
function Pkg1_Func2 (Ijk : Integer; Z : Integer) return Natural is
begin
return 1;
end;
package body Pkg1_Pkg1 is separate;
end Pkg1;
separate (Pkg1)
package body Pkg1_Pkg1 is
procedure Pkg1_Pkg1_Proc1 is
begin
null;
end;
end Pkg1_Pkg1;
separate (Pkg1)
function Pkg1_Func1 return Boolean is
begin
return False;
end;
-- from now on, this is Ada 95 specific.
package Truc is
I : Integer;
end Truc;
with Pkg1;
package Truc.Bidule is
use type Pkg1.Public_T;
use Pkg1;
use
type Pkg1.Public_T;
use -- comment
type -- comment
Pkg1.Public_T;
protected Bidule is
entry Basar;
private
Ok : Boolean;
end Bidule;
protected type Machin_T is
entry Truc;
private
Ok : Boolean;
end Machin_T;
end Truc.Bidule;
package body Truc.Bidule is
protected body Bidule is
entry Basar when Ok is
begin
null;
end;
end Bidule;
protected body Machin_T is
entry Truc when Ok is
begin
null;
end;
end Machin_T;
end Truc.Bidule;
| 15.590909 | 68 | 0.65681 |
125a087ed1e6b32a971bb7e6ee92112b3b375579 | 4,545 | ads | Ada | src/natools-accumulators.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-accumulators.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-accumulators.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2011, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Accumulators is a collection of interfaces for data structures --
-- that allow efficient accumulation of data. --
-- --
-- String_Accumulator is meant for creation of long strings through --
-- repeated calls of Append, and later retrieval of the full buffer through --
-- one of the To_String subprograms. Length, Tail and Unappend are --
-- helper utilities that might not be very efficient but can occasionnally --
-- be useful. Hard_Reset and Soft_Reset both clear the internal state, with --
-- Soft_Reset aimed for speed while Hard_Reset aims for best memory release --
-- --
-- String_Accumulator_Stack adds a stack structure on top of --
-- String_Accumulator, to allow temporary substrings to be created using --
-- similar facilities. All operations on String_Accumulator except --
-- Hard_Reset and Soft_Reset, when applied to String_Accumulator_Stack, are --
-- meant to be forwarded to the top accumulator of the stack. Push and Pop --
-- change the stack state, while Hard_Reset and Soft_Reset apply to the --
-- whole stack, with the same semantics as for String_Accumulator. --
------------------------------------------------------------------------------
package Natools.Accumulators is
pragma Pure (Accumulators);
type String_Accumulator is interface;
procedure Append (To : in out String_Accumulator; Text : String)
is abstract;
-- Append the given String to the internal buffer
procedure Hard_Reset (Acc : in out String_Accumulator)
is abstract;
-- Empty the internal buffer and free all possible memory
function Length (Acc : String_Accumulator) return Natural
is abstract;
-- Return the length of the internal buffer
procedure Soft_Reset (Acc : in out String_Accumulator)
is abstract;
-- Empty the internal buffer for reuse
function Tail (Acc : String_Accumulator; Size : Natural) return String
is abstract;
-- Return the last characters from the internal buffer
function To_String (Acc : String_Accumulator) return String
is abstract;
-- Output the whole internal buffer as a String
procedure To_String (Acc : String_Accumulator; Output : out String)
is abstract;
-- Write the whole internal buffer into the String, which must be
-- large enough.
procedure Unappend (From : in out String_Accumulator; Text : String)
is abstract;
-- Remove the given suffix from the internal buffer
-- Do nothing if the given text is not a prefix the internal buffer
type String_Accumulator_Stack is interface and String_Accumulator;
procedure Push (Acc : in out String_Accumulator_Stack)
is abstract;
-- Push the current internal buffer and start with an empty one
procedure Pop (Acc : in out String_Accumulator_Stack)
is abstract;
-- Drop the current internal buffer and use the previsouly pushed one
-- instead
-- Raise Program_Error when trying to pop the last internal buffer
end Natools.Accumulators;
| 49.945055 | 78 | 0.60374 |
a104140fccfe6acfdaca6bfdd4359a8817fa4f60 | 2,781 | ads | Ada | tools-src/gnu/gcc/gcc/ada/3ssoliop.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/3ssoliop.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/3ssoliop.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . S O C K E T S . L I N K E R _ O P T I O N S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 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 GNAT.Sockets.Linker_Options is
-- This is the Solaris version of this package.
private
pragma Linker_Options ("-lnsl");
pragma Linker_Options ("-lsocket");
end GNAT.Sockets.Linker_Options;
| 61.8 | 78 | 0.407767 |
50b092ab7ff0cffd12437356565eb3e5e65a456a | 795 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/ptype_array/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/ptype_array/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/ptype_array/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2019-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 Pck;
procedure Foo is
begin
Pck.Do_Nothing (Pck.W.G'Address);
end Foo;
| 36.136364 | 73 | 0.735849 |
3153ad8c1155160d786caf602ab9d455f17b7a1a | 7,095 | adb | Ada | demos/src/calculatorcommands.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | demos/src/calculatorcommands.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | demos/src/calculatorcommands.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- Copyright (c) 2021 Bartek thindil Jasicki <[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.Strings; use Ada.Strings;
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
with Tcl.Strings; use Tcl.Strings;
with Tk.TtkButton; use Tk.TtkButton;
with Tk.TtkLabel; use Tk.TtkLabel;
with Tk.Widget; use Tk.Widget;
package body CalculatorCommands with
SPARK_Mode
is
function Click_Action
(ButtonName, LabelName: String; Interpreter: Tcl_Interpreter)
return Tcl_Results is
Button: constant Ttk_Button :=
Get_Widget(Path_Name => ButtonName, Interpreter => Interpreter);
Display_Label: constant Ttk_Label :=
Get_Widget(Path_Name => LabelName, Interpreter => Interpreter);
Label_Options: Ttk_Label_Options := Get_Options(Label => Display_Label);
Button_Options: constant Ttk_Button_Options :=
Get_Options(Button => Button);
Operators_Set: constant Character_Set := To_Set(Sequence => "*+/-");
No_Minus_Operators_Set: constant Character_Set :=
To_Set(Sequence => "*+/");
Result: Float := 0.0;
Start_Index: Positive := 1;
Sign_Index: Natural := 0;
Expression: constant String :=
To_Ada_String(Source => Label_Options.Text);
Result_String: String(1 .. 30);
Is_Negative: Boolean := False;
begin
-- Remove leading zero from the display text but only when number was
-- pressed
if not Is_In
(Element => To_Ada_String(Source => Button_Options.Text)(1),
Set => No_Minus_Operators_Set)
and then Label_Options.Text = To_Tcl_String(Source => "0") then
Label_Options.Text := Null_Tcl_String;
end if;
-- Find the last occurence of mathematical operator
Sign_Index :=
Index(Source => Expression, Set => Operators_Set, Going => Backward);
if Button_Options.Text = To_Tcl_String(Source => ".") then
if Index(Source => Expression, Pattern => ".", Going => Backward) >
Sign_Index then
return TCL_OK;
end if;
if Label_Options.Text = Null_Tcl_String then
Label_Options.Text := To_Tcl_String(Source => "0");
end if;
end if;
-- If the user pressed equal button, count value of expression from
-- the display
if Button_Options.Text = To_Tcl_String(Source => "=") then
-- If mathematical operator is the last character, quit, probably the
-- user pressed the button by accident
if Sign_Index = Expression'Length then
return TCL_OK;
end if;
-- Count the result of the expression entered by the user
Count_Result_Loop :
loop
-- Find the occurence of a mathematical operator
Sign_Index :=
Index
(Source => Expression, Set => Operators_Set,
From => Start_Index);
-- No operator found, copy the whole text to result and quit
-- the loop
if Sign_Index = 0 then
if Start_Index = 1 then
Result := Float'Value(Expression);
exit Count_Result_Loop;
end if;
Sign_Index := Expression'Last + 1;
end if;
-- The operator is a negative number sign, go to end of loop to
-- find another
if (Sign_Index = 1 and then Expression(Sign_Index) = '-') or
Start_Index = Sign_Index then
Is_Negative := True;
goto End_Of_Count_Loop;
end if;
if Start_Index = 1 then
Result :=
Float'Value(Expression(Start_Index .. Sign_Index - 1));
goto End_Of_Count_Loop;
end if;
-- Get the matematical operator if the number is negative
if Is_Negative and Start_Index > 2 then
Start_Index := Start_Index - 1;
end if;
Is_Negative := False;
-- Count the expression, based on the found mathematical symbol
case Expression(Start_Index - 1) is
when '+' =>
Result :=
Result +
Float'Value(Expression(Start_Index .. Sign_Index - 1));
when '-' =>
Result :=
Result -
Float'Value(Expression(Start_Index .. Sign_Index - 1));
when '*' =>
Result :=
Result *
Float'Value(Expression(Start_Index .. Sign_Index - 1));
when '/' =>
Result :=
Result /
Float'Value(Expression(Start_Index .. Sign_Index - 1));
when others =>
null;
end case;
<<End_Of_Count_Loop>>
-- Set the start looking index to the new value
Start_Index := Sign_Index + 1;
exit Count_Result_Loop when Start_Index > Expression'Last;
end loop Count_Result_Loop;
-- Convert the result value to string with maximum 5 zeros
Put(To => Result_String, Item => Result, Aft => 5, Exp => 0);
-- Remove trailing zeros from the result string
Trim
(Source => Result_String, Left => Null_Set,
Right => To_Set(Sequence => ".0"));
-- Set the result string as the display value, remove also all
-- trailing spaces from it
Configure
(Label => Display_Label,
Options =>
(Text =>
To_Tcl_String
(Source => Trim(Source => Result_String, Side => Both)),
others => <>));
return TCL_OK;
end if;
-- Add the pressed button text (number or operator) to the calculator's
-- display
Configure
(Label => Display_Label,
Options =>
(Text => Label_Options.Text & Button_Options.Text, others => <>));
return TCL_OK;
end Click_Action;
function Clear_Action
(LabelName: String; Interpreter: Tcl_Interpreter) return Tcl_Results is
Display_Label: constant Ttk_Label :=
Get_Widget(Path_Name => LabelName, Interpreter => Interpreter);
begin
Configure
(Label => Display_Label,
Options => (Text => To_Tcl_String(Source => "0"), others => <>));
return TCL_OK;
end Clear_Action;
end CalculatorCommands;
| 40.542857 | 78 | 0.585624 |
06919ae58e9453837f8f754ca0c449b86cda56a4 | 3,513 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-sopco4.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-sopco4.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-sopco4.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . S T R I N G _ O P S _ C O N C A T _ 4 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1998, 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. --
-- --
------------------------------------------------------------------------------
package body System.String_Ops_Concat_4 is
------------------
-- Str_Concat_4 --
------------------
function Str_Concat_4 (S1, S2, S3, S4 : String) return String is
begin
if S1'Length <= 0 then
return S2 & S3 & S4;
else
declare
L12 : constant Natural := S1'Length + S2'Length;
L13 : constant Natural := L12 + S3'Length;
L14 : constant Natural := L13 + S4'Length;
R : String (S1'First .. S1'First + L14 - 1);
begin
R (S1'First .. S1'Last) := S1;
R (S1'Last + 1 .. S1'First + L12 - 1) := S2;
R (S1'First + L12 .. S1'First + L13 - 1) := S3;
R (S1'First + L13 .. R'Last) := S4;
return R;
end;
end if;
end Str_Concat_4;
end System.String_Ops_Concat_4;
| 54.046154 | 78 | 0.411614 |
12538a689e33b51ba8cc8d9cba92f51337428de3 | 106 | ads | Ada | 1-base/math/source/precision/float/float_math.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 1-base/math/source/precision/float/float_math.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 1-base/math/source/precision/float/float_math.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
any_Math;
package float_Math is new any_Math (Real_t => Float);
pragma Pure (float_Math);
| 17.666667 | 58 | 0.688679 |
1cb51796e8f569bfd0751a3be0c565290db7ee47 | 275,175 | adb | Ada | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_dct_2d.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_dct_2d.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_dct_2d.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct_dct_2d</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>in_block</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_block</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</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_block</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>69</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>row_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>row_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>col_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>col_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>col_inbuf</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second class_id="12" tracking_level="0" version="0">
<count>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>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName>col_inbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond5_fu_224_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>109</item>
<item>111</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_4_fu_230_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>112</item>
<item>114</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>115</item>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_dct_1d_fu_209</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>262</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</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>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>125</item>
<item>126</item>
<item>128</item>
<item>129</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>i_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>22</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_236_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>138</item>
<item>140</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>23</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_242_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>141</item>
<item>143</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>24</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>144</item>
<item>145</item>
<item>146</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>exitcond</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_fu_248_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>147</item>
<item>148</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>i_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_1_mid2_fu_254_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>j_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_s_fu_262_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>j_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_mid2_fu_268_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_2_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_trn_cast_fu_309_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_trn_cast_fu_276_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_280_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
<item>163</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>p_addr_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr_cast_fu_288_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>p_addr5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr5_fu_292_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_6_fu_298_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>168</item>
<item>170</item>
<item>171</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_7_fu_312_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>p_addr6_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr6_cast_fu_319_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_addr7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr7_fu_323_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_8</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_8_fu_329_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>col_inbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>181</item>
<item>182</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_6_fu_303_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>51</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>1</count>
<item_version>0</item_version>
<item>187</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>i_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>188</item>
<item>189</item>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>exitcond2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond2_fu_334_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_5_fu_340_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>195</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_dct_1d_fu_209</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>263</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>indvar_flatten2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>j_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>i_3</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>exitcond_flatten2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten2_fu_346_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>indvar_flatten_next2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next2_fu_352_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>68</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>221</item>
<item>222</item>
<item>223</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>exitcond1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond1_fu_358_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>i_3_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_3_mid2_fu_364_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_2_fu_372_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>j_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_1_mid2_fu_378_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>231</item>
<item>232</item>
<item>233</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_4_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_trn_cast_fu_419_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_3_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_trn_cast_fu_386_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>235</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>tmp_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_s_fu_390_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>236</item>
<item>237</item>
<item>238</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>p_addr8_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr8_cast_fu_398_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>p_addr9</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr9_fu_402_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_1_fu_408_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>246</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_422_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>247</item>
<item>248</item>
<item>249</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>p_addr3_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr3_cast_fu_429_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>250</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>p_addr4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr4_fu_433_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>251</item>
<item>252</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_439_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>253</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>254</item>
<item>255</item>
<item>256</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>257</item>
<item>258</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>i_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_7_fu_413_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>95</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>1</count>
<item_version>0</item_version>
<item>261</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_72">
<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>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_73">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_74">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_75">
<Value>
<Obj>
<type>2</type>
<id>113</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>dct_dct_1d</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>
<const_type>6</const_type>
<content><constant:dct_dct_1d></content>
</item>
<item class_id_reference="16" object_id="_77">
<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>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_78">
<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>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>142</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>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>162</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>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>169</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>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_82">
<Obj>
<type>3</type>
<id>8</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>4</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>14</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>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>18</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>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>25</id>
<name>.preheader7.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>6</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>52</id>
<name>.preheader7</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</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>50</item>
<item>51</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>58</id>
<name>.preheader6</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>53</item>
<item>54</item>
<item>56</item>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>62</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>60</item>
<item>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>69</id>
<name>.preheader.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>6</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>96</id>
<name>.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>20</count>
<item_version>0</item_version>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>94</item>
<item>95</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>98</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>1</count>
<item_version>0</item_version>
<item>97</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>163</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_92">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>4</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>103</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>106</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>117</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>129</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>135</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>137</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>189</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>204</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>208</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>216</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>261</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>332</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>333</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>334</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>335</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>336</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>337</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>338</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>339</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>341</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>342</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>69</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_255">
<mId>1</mId>
<mTag>dct_dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>6</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1717</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_256">
<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="_257">
<mId>3</mId>
<mTag>Row_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>792</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_258">
<mId>4</mId>
<mTag>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>52</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_259">
<mId>5</mId>
<mTag>Col_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>62</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>792</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_260">
<mId>6</mId>
<mTag>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>96</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_261">
<mId>7</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>98</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="_262">
<states class_id="25" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_263">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_264">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_268">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_269">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>16</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_275">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_276">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>16</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_279">
<id>4</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_280">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>42</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_298">
<id>5</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_299">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>42</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_309">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_310">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_312">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_313">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_314">
<id>6</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_315">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_319">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_320">
<id>60</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_321">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_322">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_323">
<id>60</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_324">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_325">
<id>8</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_326">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_335">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_336">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_337">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_338">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_340">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_341">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>86</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_343">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_344">
<id>9</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_345">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_346">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_347">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>86</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_353">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_355">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_356">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_357">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_358">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_359">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_360">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_361">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_362">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>51</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="_363">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>54</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>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_364">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>53</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>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_365">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>57</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="_366">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>66</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>54</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_367">
<inState>6</inState>
<outState>8</outState>
<condition>
<id>65</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>54</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_368">
<inState>7</inState>
<outState>6</outState>
<condition>
<id>69</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="_369">
<inState>5</inState>
<outState>4</outState>
<condition>
<id>77</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="_370">
<inState>4</inState>
<outState>6</outState>
<condition>
<id>76</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_371">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>78</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_372">
<inState>9</inState>
<outState>8</outState>
<condition>
<id>80</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="_373">
<inState>8</inState>
<outState>10</outState>
<condition>
<id>79</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>66</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_374">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>81</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>66</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="_375">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>grp_dct_dct_1d_fu_209 (dct_dct_1d)</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>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>111</second>
</item>
<item>
<first>LUT</first>
<second>122</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>22</count>
<item_version>0</item_version>
<item>
<first>exitcond1_fu_358_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond2_fu_334_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond5_fu_224_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>exitcond_fu_248_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254_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>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364_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>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_4_fu_230_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_5_fu_340_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_6_fu_303_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_7_fu_413_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378_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>4</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_2_fu_372_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_mid2_fu_268_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>4</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_s_fu_262_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>p_addr4_fu_433_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr5_fu_292_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr7_fu_323_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr9_fu_402_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</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>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>23</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>9</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>9</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_we0</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>grp_dct_dct_1d_fu_209_src_q0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Count)</first>
<second>48</second>
</item>
<item>
<first>LUT</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_tmp_1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_tmp_11</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>in_block_ce0</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>indvar_flatten2_reg_176</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>j_1_phi_fu_191_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_phi_fu_146_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_we0</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>
</dp_multiplexer_resource>
<dp_register_resource>
<count>22</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>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp0_it0</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_ppiten_pp0_it1</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_ppiten_pp1_it0</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_ppiten_pp1_it1</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_flatten2_reg_492</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_flatten_reg_453</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>grp_dct_dct_1d_fu_209_ap_start_ap_start_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>i_1_mid2_reg_462</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_mid2_reg_501</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_4_reg_448</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_5_reg_487</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</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>
<item>
<first>indvar_flatten_reg_131</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>
<item>
<first>j_1_mid2_reg_506</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_mid2_reg_467</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>grp_dct_dct_1d_fu_209 (dct_dct_1d)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>60</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>22</count>
<item_version>0</item_version>
<item>
<first>exitcond1_fu_358_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>exitcond2_fu_334_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_fu_224_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>exitcond_fu_248_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_4_fu_230_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_fu_340_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_fu_303_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_fu_413_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_2_fu_372_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_mid2_fu_268_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_s_fu_262_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_addr4_fu_433_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>p_addr5_fu_292_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_addr7_fu_323_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_addr9_fu_402_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>69</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>4</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<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>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>17</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>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>35</first>
<second>
<first>3</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>2</first>
<second>1</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>10</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>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_376">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>52</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="50" object_id="_377">
<region_name>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>96</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>58</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>89</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>101</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>86</item>
</second>
</item>
<item>
<first>106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>60</item>
<item>60</item>
</second>
</item>
<item>
<first>224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>col_inbuf_addr_gep_fu_83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>col_inbuf_alloca_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>col_outbuf_addr_gep_fu_95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>col_outbuf_alloca_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>exitcond1_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>exitcond2_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_fu_224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>exitcond_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_1_phi_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_phi_fu_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_3_phi_fu_202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_4_fu_230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_fu_303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_fu_413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>i_phi_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_phi_fu_180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_1_phi_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_2_fu_372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_mid2_fu_268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_phi_fu_146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>j_s_fu_262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>out_block_addr_gep_fu_106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>p_addr3_cast_fu_429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>p_addr4_fu_433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>p_addr5_fu_292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_addr6_cast_fu_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_addr7_fu_323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_addr8_cast_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>p_addr9_fu_402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>p_addr_cast_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>row_outbuf_addr_gep_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>row_outbuf_alloca_fu_60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>tmp_1_fu_408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_2_fu_422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>tmp_2_trn_cast_fu_309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_3_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>tmp_3_trn_cast_fu_386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>tmp_4_trn_cast_fu_419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_6_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_7_fu_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_8_fu_329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_fu_280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_s_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp_trn_cast_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_dct_dct_1d_fu_209</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>60</item>
<item>60</item>
</second>
</item>
</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="56" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first class_id="58" tracking_level="0" version="0">
<first>col_inbuf</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>
<first>col_inbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>86</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>60</item>
</second>
</item>
<item>
<first>
<first>out_block</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>457</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>col_outbuf_addr_reg_512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>exitcond2_reg_483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_reg_444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_reg_492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>i_1_mid2_reg_462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_mid2_reg_501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_4_reg_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_reg_487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_reg_478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_reg_517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_reg_496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_457</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_mid2_reg_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_mid2_reg_467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>row_outbuf_addr_reg_473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>i_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>out_block(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>3</count>
<item_version>0</item_version>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 29.716523 | 94 | 0.433611 |
06d622f1d026b1aeecd070dc04570775beacd3b3 | 88,006 | ads | Ada | source/protocol/lsp-messages.ads | reznikmm/ada_lsp | b0e2666f758d6e46b973b5d7e4b9a7ba66c46157 | [
"MIT"
] | 11 | 2017-10-18T18:22:04.000Z | 2022-01-01T12:22:23.000Z | source/protocol/lsp-messages.ads | reznikmm/ada_lsp | b0e2666f758d6e46b973b5d7e4b9a7ba66c46157 | [
"MIT"
] | null | null | null | source/protocol/lsp-messages.ads | reznikmm/ada_lsp | b0e2666f758d6e46b973b5d7e4b9a7ba66c46157 | [
"MIT"
] | 1 | 2019-09-14T23:13:33.000Z | 2019-09-14T23:13:33.000Z | -- Copyright (c) 2017 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Containers.Hashed_Maps;
with Ada.Containers.Vectors;
with Ada.Streams;
with League.Strings.Hash;
with LSP.Generic_Optional;
with LSP.Types; use LSP.Types;
package LSP.Messages is
pragma Preelaborate;
pragma Style_Checks ("M125-bcht");
--```typescript
--interface Message {
-- jsonrpc: string;
--}
--```
type Message is abstract tagged record
jsonrpc: LSP_String;
end record;
--```typescript
--interface RequestMessage extends Message {
--
-- /**
-- * The request id.
-- */
-- id: number | string;
--
-- /**
-- * The method to be invoked.
-- */
-- method: string;
--
-- /**
-- * The method's params.
-- */
-- params?: any
--}
--```
type RequestMessage is new Message with record
id: LSP_Number_Or_String;
method: LSP_String;
-- params: LSP_Any;
end record;
--```typescript
--interface ResponseMessage extends Message {
-- /**
-- * The request id.
-- */
-- id: number | string | null;
--
-- /**
-- * The result of a request. This can be omitted in
-- * the case of an error.
-- */
-- result?: any;
--
-- /**
-- * The error object in case a request fails.
-- */
-- error?: ResponseError<any>;
--}
--
--interface ResponseError<D> {
-- /**
-- * A number indicating the error type that occurred.
-- */
-- code: number;
--
-- /**
-- * A string providing a short description of the error.
-- */
-- message: string;
--
-- /**
-- * A Primitive or Structured value that contains additional
-- * information about the error. Can be omitted.
-- */
-- data?: D;
--}
--
--export namespace ErrorCodes {
-- // Defined by JSON RPC
-- export const ParseError: number = -32700;
-- export const InvalidRequest: number = -32600;
-- export const MethodNotFound: number = -32601;
-- export const InvalidParams: number = -32602;
-- export const InternalError: number = -32603;
-- export const serverErrorStart: number = -32099;
-- export const serverErrorEnd: number = -32000;
-- export const ServerNotInitialized: number = -32002;
-- export const UnknownErrorCode: number = -32001;
--
-- // Defined by the protocol.
-- export const RequestCancelled: number = -32800;
--}
--```
type ErrorCodes is
(ParseError,
InvalidRequest,
MethodNotFound,
InvalidParams,
InternalError,
serverErrorStart,
serverErrorEnd,
ServerNotInitialized,
UnknownErrorCode,
RequestCancelled);
type ResponseError is record
code: ErrorCodes;
message: LSP_String;
data: LSP_Any;
end record;
not overriding procedure Read_ResponseError
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out ResponseError);
for ResponseError'Read use Read_ResponseError;
not overriding procedure Write_ResponseError
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ResponseError);
for ResponseError'Write use Write_ResponseError;
package Optional_ResponseErrors is new LSP.Generic_Optional (ResponseError);
type Optional_ResponseError is new Optional_ResponseErrors.Optional_Type;
type ResponseMessage is new Message with record
id: LSP_Number_Or_String; -- or null?
-- result: LSP_Any;
error: Optional_ResponseError;
end record;
not overriding procedure Write_ResponseMessage
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ResponseMessage);
for ResponseMessage'Write use Write_ResponseMessage;
--```typescript
--interface NotificationMessage extends Message {
-- /**
-- * The method to be invoked.
-- */
-- method: string;
--
-- /**
-- * The notification's params.
-- */
-- params?: any
--}
--```
type NotificationMessage is new Message with record
method: LSP_String;
-- params: LSP_Any;
end record;
--```typescript
--interface CancelParams {
-- /**
-- * The request id to cancel.
-- */
-- id: number | string;
--}
--```
type CancelParams is record
id: LSP_Number_Or_String;
end record;
--```typescript
--type DocumentUri = string;
--```
subtype DocumentUri is LSP.Types.LSP_String;
--```typescript
--export const EOL: string[] = ['\n', '\r\n', '\r'];
--```
-- This is intentionally empty. Nothing to declare for EOL
--```typescript
--interface Position {
-- /**
-- * Line position in a document (zero-based).
-- */
-- line: number;
--
-- /**
-- * Character offset on a line in a document (zero-based).
-- */
-- character: number;
--}
--```
type Position is record
line: Line_Number;
character: UTF_16_Index;
end record;
not overriding procedure Read_Position
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out Position);
for Position'Read use Read_Position;
not overriding procedure Write_Position
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Position);
for Position'Write use Write_Position;
--```typescript
--interface Range {
-- /**
-- * The range's start position.
-- */
-- start: Position;
--
-- /**
-- * The range's end position.
-- */
-- end: Position;
--}
--```
type Span is record
first: Position;
last: Position; -- end: is reserved work
end record;
not overriding procedure Read_Span
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out Span);
for Span'Read use Read_Span;
not overriding procedure Write_Span
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Span);
for Span'Write use Write_Span;
package Optional_Spans is new LSP.Generic_Optional (Span);
type Optional_Span is new Optional_Spans.Optional_Type;
--```typescript
--interface Location {
-- uri: DocumentUri;
-- range: Range;
--}
--```
type Location is record
uri: DocumentUri;
span: LSP.Messages.Span; -- range: is reserved word
end record;
not overriding procedure Write_Location
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Location);
for Location'Write use Write_Location;
package Location_Vectors is new Ada.Containers.Vectors
(Positive, Location);
--+1
--```typescript
--namespace DiagnosticSeverity {
-- /**
-- * Reports an error.
-- */
-- export const Error = 1;
-- /**
-- * Reports a warning.
-- */
-- export const Warning = 2;
-- /**
-- * Reports an information.
-- */
-- export const Information = 3;
-- /**
-- * Reports a hint.
-- */
-- export const Hint = 4;
--}
--```
type DiagnosticSeverity is (Error, Warning, Information, Hint);
not overriding procedure Write_DiagnosticSeverity
(S : access Ada.Streams.Root_Stream_Type'Class;
V : DiagnosticSeverity);
for DiagnosticSeverity'Write use Write_DiagnosticSeverity;
package Optional_DiagnosticSeveritys is new LSP.Generic_Optional (DiagnosticSeverity);
type Optional_DiagnosticSeverity is new Optional_DiagnosticSeveritys.Optional_Type;
--```typescript
--interface Diagnostic {
-- /**
-- * The range at which the message applies.
-- */
-- range: Range;
--
-- /**
-- * The diagnostic's severity. Can be omitted. If omitted it is up to the
-- * client to interpret diagnostics as error, warning, info or hint.
-- */
-- severity?: number;
--
-- /**
-- * The diagnostic's code. Can be omitted.
-- */
-- code?: number | string;
--
-- /**
-- * A human-readable string describing the source of this
-- * diagnostic, e.g. 'typescript' or 'super lint'.
-- */
-- source?: string;
--
-- /**
-- * The diagnostic's message.
-- */
-- message: string;
--}
--```
type Diagnostic is record
span: LSP.Messages.Span;
severity: Optional_DiagnosticSeverity;
code: LSP_Number_Or_String;
source: Optional_String;
message: LSP_String;
end record;
not overriding procedure Read_Diagnostic
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out Diagnostic);
for Diagnostic'Read use Read_Diagnostic;
not overriding procedure Write_Diagnostic
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Diagnostic);
for Diagnostic'Write use Write_Diagnostic;
package Diagnostic_Vectors is new Ada.Containers.Vectors
(Positive, Diagnostic);
type Diagnostic_Vector is new Diagnostic_Vectors.Vector with null record;
--```typescript
--interface Command {
-- /**
-- * Title of the command, like `save`.
-- */
-- title: string;
-- /**
-- * The identifier of the actual command handler.
-- */
-- command: string;
-- /**
-- * Arguments that the command handler should be
-- * invoked with.
-- */
-- arguments?: any[];
--}
--```
type Command is record
title: LSP_String;
command: LSP_String;
arguments: LSP_Any;
end record;
not overriding procedure Write_Command
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Command);
for Command'Write use Write_Command;
package Command_Vectors is new Ada.Containers.Vectors
(Positive, Command);
type Command_Vector is new Command_Vectors.Vector with null record;
--```typescript
--interface TextEdit {
-- /**
-- * The range of the text document to be manipulated. To insert
-- * text into a document create a range where start === end.
-- */
-- range: Range;
--
-- /**
-- * The string to be inserted. For delete operations use an
-- * empty string.
-- */
-- newText: string;
--}
--```
type TextEdit is record
span: LSP.Messages.Span;
newText: LSP_String;
end record;
not overriding procedure Read_TextEdit
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextEdit);
for TextEdit'Read use Read_TextEdit;
not overriding procedure Write_TextEdit
(S : access Ada.Streams.Root_Stream_Type'Class;
V : TextEdit);
for TextEdit'Write use Write_TextEdit;
package Optional_TextEdits is new LSP.Generic_Optional (TextEdit);
type Optional_TextEdit is new Optional_TextEdits.Optional_Type;
package TextEdit_Vectors is new Ada.Containers.Vectors (Positive, TextEdit);
type TextEdit_Vector is new TextEdit_Vectors.Vector with null record;
not overriding procedure Read_TextEdit_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextEdit_Vector);
for TextEdit_Vector'Read use Read_TextEdit_Vector;
not overriding procedure Write_TextEdit_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : TextEdit_Vector);
for TextEdit_Vector'Write use Write_TextEdit_Vector;
--+N
--```typescript
--interface TextDocumentIdentifier {
-- /**
-- * The text document's URI.
-- */
-- uri: DocumentUri;
--}
--```
type TextDocumentIdentifier is tagged record
uri: DocumentUri;
end record;
not overriding procedure Read_TextDocumentIdentifier
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentIdentifier);
for TextDocumentIdentifier'Read use Read_TextDocumentIdentifier;
--+N+2
--```typescript
--interface VersionedTextDocumentIdentifier extends TextDocumentIdentifier {
-- /**
-- * The version number of this document.
-- */
-- version: number;
--}
--```
type VersionedTextDocumentIdentifier is new TextDocumentIdentifier with record
version: Version_Id;
end record;
not overriding procedure Read_VersionedTextDocumentIdentifier
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out VersionedTextDocumentIdentifier);
for VersionedTextDocumentIdentifier'Read use
Read_VersionedTextDocumentIdentifier;
not overriding procedure Write_VersionedTextDocumentIdentifier
(S : access Ada.Streams.Root_Stream_Type'Class;
V : VersionedTextDocumentIdentifier);
for VersionedTextDocumentIdentifier'Write use
Write_VersionedTextDocumentIdentifier;
--```typescript
--export interface TextDocumentEdit {
-- /**
-- * The text document to change.
-- */
-- textDocument: VersionedTextDocumentIdentifier;
--
-- /**
-- * The edits to be applied.
-- */
-- edits: TextEdit[];
--}
--```
type TextDocumentEdit is record
textDocument: VersionedTextDocumentIdentifier;
edits: TextEdit_Vector;
end record;
not overriding procedure Read_TextDocumentEdit
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentEdit);
for TextDocumentEdit'Read use Read_TextDocumentEdit;
not overriding procedure Write_TextDocumentEdit
(S : access Ada.Streams.Root_Stream_Type'Class;
V : TextDocumentEdit);
for TextDocumentEdit'Write use Write_TextDocumentEdit;
package TextDocumentEdit_Vectors is
new Ada.Containers.Vectors (Positive, TextDocumentEdit);
package TextDocumentEdit_Maps is new Ada.Containers.Hashed_Maps
(Key_Type => League.Strings.Universal_String,
Element_Type => TextEdit_Vector,
Hash => League.Strings.Hash,
Equivalent_Keys => League.Strings."=");
--```typescript
--export interface WorkspaceEdit {
-- /**
-- * Holds changes to existing resources.
-- */
-- changes?: { [uri: string]: TextEdit[]; };
--
-- /**
-- * An array of `TextDocumentEdit`s to express changes to n different text documents
-- * where each text document edit addresses a specific version of a text document.
-- * Whether a client supports versioned document edits is expressed via
-- * `WorkspaceClientCapabilities.workspaceEdit.documentChanges`.
-- */
-- documentChanges?: TextDocumentEdit[];
--}
--```
type WorkspaceEdit is record
changes: TextDocumentEdit_Maps.Map;
documentChanges: TextDocumentEdit_Vectors.Vector;
end record;
--```typescript
--interface TextDocumentItem {
-- /**
-- * The text document's URI.
-- */
-- uri: DocumentUri;
--
-- /**
-- * The text document's language identifier.
-- */
-- languageId: string;
--
-- /**
-- * The version number of this document (it will increase after each
-- * change, including undo/redo).
-- */
-- version: number;
--
-- /**
-- * The content of the opened text document.
-- */
-- text: string;
--}
--```
type TextDocumentItem is record
uri: DocumentUri;
languageId: LSP_String;
version: Version_Id;
text: LSP_String;
end record;
--```typescript
--interface TextDocumentPositionParams {
-- /**
-- * The text document.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The position inside the text document.
-- */
-- position: Position;
--}
--```
type TextDocumentPositionParams is tagged record
textDocument: TextDocumentIdentifier;
position: LSP.Messages.Position;
end record;
not overriding procedure Read_TextDocumentPositionParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentPositionParams);
for TextDocumentPositionParams'Read use Read_TextDocumentPositionParams;
--```typescript
--{ language: 'typescript', scheme: 'file' }
--{ language: 'json', pattern: '**/package.json' }
--```
-- This is just example of filter. Nothing to do
--```typescript
--export interface DocumentFilter {
-- /**
-- * A language id, like `typescript`.
-- */
-- language?: string;
--
-- /**
-- * A Uri [scheme](#Uri.scheme), like `file` or `untitled`.
-- */
-- scheme?: string;
--
-- /**
-- * A glob pattern, like `*.{ts,js}`.
-- */
-- pattern?: string;
--}
--```
type DocumentFilter is record
language: LSP.Types.Optional_String;
scheme: LSP.Types.Optional_String;
pattern: LSP.Types.Optional_String;
end record;
package DocumentFilter_Vectors is new Ada.Containers.Vectors
(Positive, DocumentFilter);
--```typescript
--export type DocumentSelector = DocumentFilter[];
--```
type DocumentSelector is new DocumentFilter_Vectors.Vector with null record;
type dynamicRegistration is new Optional_Boolean;
--+M
--```typescript
--/**
-- * Workspace specific client capabilities.
-- */
--export interface WorkspaceClientCapabilities {
-- /**
-- * The client supports applying batch edits to the workspace by supporting
-- * the request 'workspace/applyEdit'
-- */
-- applyEdit?: boolean;
--
-- /**
-- * Capabilities specific to `WorkspaceEdit`s
-- */
-- workspaceEdit?: {
-- /**
-- * The client supports versioned document changes in `WorkspaceEdit`s
-- */
-- documentChanges?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `workspace/didChangeConfiguration` notification.
-- */
-- didChangeConfiguration?: {
-- /**
-- * Did change configuration notification supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `workspace/didChangeWatchedFiles` notification.
-- */
-- didChangeWatchedFiles?: {
-- /**
-- * Did change watched files notification supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `workspace/symbol` request.
-- */
-- symbol?: {
-- /**
-- * Symbol request supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `workspace/executeCommand` request.
-- */
-- executeCommand?: {
-- /**
-- * Execute command supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--}
--```
type WorkspaceClientCapabilities is record
applyEdit: Optional_Boolean;
workspaceEdit: Optional_Boolean;
didChangeConfiguration: dynamicRegistration;
didChangeWatchedFiles: dynamicRegistration;
symbol: dynamicRegistration;
executeCommand: dynamicRegistration;
end record;
--```typescript
--/**
-- * Text document specific client capabilities.
-- */
--export interface TextDocumentClientCapabilities {
--
-- synchronization?: {
-- /**
-- * Whether text document synchronization supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
--
-- /**
-- * The client supports sending will save notifications.
-- */
-- willSave?: boolean;
--
-- /**
-- * The client supports sending a will save request and
-- * waits for a response providing text edits which will
-- * be applied to the document before it is saved.
-- */
-- willSaveWaitUntil?: boolean;
--
-- /**
-- * The client supports did save notifications.
-- */
-- didSave?: boolean;
-- }
--
-- /**
-- * Capabilities specific to the `textDocument/completion`
-- */
-- completion?: {
-- /**
-- * Whether completion supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
--
-- /**
-- * The client supports the following `CompletionItem` specific
-- * capabilities.
-- */
-- completionItem?: {
-- /**
-- * Client supports snippets as insert text.
-- *
-- * A snippet can define tab stops and placeholders with `$1`, `$2`
-- * and `${3:foo}`. `$0` defines the final tab stop, it defaults to
-- * the end of the snippet. Placeholders with equal identifiers are linked,
-- * that is typing in one will update others too.
-- */
-- snippetSupport?: boolean;
-- }
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/hover`
-- */
-- hover?: {
-- /**
-- * Whether hover supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/signatureHelp`
-- */
-- signatureHelp?: {
-- /**
-- * Whether signature help supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/references`
-- */
-- references?: {
-- /**
-- * Whether references supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/documentHighlight`
-- */
-- documentHighlight?: {
-- /**
-- * Whether document highlight supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/documentSymbol`
-- */
-- documentSymbol?: {
-- /**
-- * Whether document symbol supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/formatting`
-- */
-- formatting?: {
-- /**
-- * Whether formatting supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/rangeFormatting`
-- */
-- rangeFormatting?: {
-- /**
-- * Whether range formatting supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/onTypeFormatting`
-- */
-- onTypeFormatting?: {
-- /**
-- * Whether on type formatting supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/definition`
-- */
-- definition?: {
-- /**
-- * Whether definition supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/codeAction`
-- */
-- codeAction?: {
-- /**
-- * Whether code action supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/codeLens`
-- */
-- codeLens?: {
-- /**
-- * Whether code lens supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/documentLink`
-- */
-- documentLink?: {
-- /**
-- * Whether document link supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--
-- /**
-- * Capabilities specific to the `textDocument/rename`
-- */
-- rename?: {
-- /**
-- * Whether rename supports dynamic registration.
-- */
-- dynamicRegistration?: boolean;
-- };
--}
--```
type synchronization is record
dynamicRegistration : Optional_Boolean;
willSave : Optional_Boolean;
willSaveWaitUntil : Optional_Boolean;
didSave : Optional_Boolean;
end record;
type completion is record
dynamicRegistration : Optional_Boolean;
snippetSupport : Optional_Boolean;
end record;
type TextDocumentClientCapabilities is record
synchronization: LSP.Messages.synchronization;
completion: LSP.Messages.completion;
hover: dynamicRegistration;
signatureHelp: dynamicRegistration;
references: dynamicRegistration;
documentHighlight: dynamicRegistration;
documentSymbol: dynamicRegistration;
formatting: dynamicRegistration;
rangeFormatting: dynamicRegistration;
onTypeFormatting: dynamicRegistration;
definition: dynamicRegistration;
codeAction: dynamicRegistration;
codeLens: dynamicRegistration;
documentLink: dynamicRegistration;
rename: dynamicRegistration;
end record;
--```typescript
--interface ClientCapabilities {
-- /**
-- * Workspace specific client capabilities.
-- */
-- workspace?: WorkspaceClientCapabilities;
--
-- /**
-- * Text document specific client capabilities.
-- */
-- textDocument?: TextDocumentClientCapabilities;
--
-- /**
-- * Experimental client capabilities.
-- */
-- experimental?: any;
--}
--```
type ClientCapabilities is record
workspace: WorkspaceClientCapabilities;
textDocument: TextDocumentClientCapabilities;
-- experimental?: any;
end record;
--```typescript
--interface InitializeParams {
-- /**
-- * The process Id of the parent process that started
-- * the server. Is null if the process has not been started by another process.
-- * If the parent process is not alive then the server should exit (see exit notification) its process.
-- */
-- processId: number | null;
--
-- /**
-- * The rootPath of the workspace. Is null
-- * if no folder is open.
-- *
-- * @deprecated in favour of rootUri.
-- */
-- rootPath?: string | null;
--
-- /**
-- * The rootUri of the workspace. Is null if no
-- * folder is open. If both `rootPath` and `rootUri` are set
-- * `rootUri` wins.
-- */
-- rootUri: DocumentUri | null;
--
-- /**
-- * User provided initialization options.
-- */
-- initializationOptions?: any;
--
-- /**
-- * The capabilities provided by the client (editor or tool)
-- */
-- capabilities: ClientCapabilities;
--
-- /**
-- * The initial trace setting. If omitted trace is disabled ('off').
-- */
-- trace?: 'off' | 'messages' | 'verbose';
--}
--```
type InitializeParams is record
processId: Optional_Number;
rootPath: LSP_String;
rootUri: DocumentUri; -- or null???
-- initializationOptions?: any;
capabilities: ClientCapabilities;
trace: Trace_Kinds;
end record;
--+K
--```typescript
--/**
-- * Defines how the host (editor) should sync document changes to the language server.
-- */
--export namespace TextDocumentSyncKind {
-- /**
-- * Documents should not be synced at all.
-- */
-- export const None = 0;
--
-- /**
-- * Documents are synced by always sending the full content
-- * of the document.
-- */
-- export const Full = 1;
--
-- /**
-- * Documents are synced by sending the full content on open.
-- * After that only incremental updates to the document are
-- * send.
-- */
-- export const Incremental = 2;
--}
--
--/**
-- * Completion options.
-- */
--export interface CompletionOptions {
-- /**
-- * The server provides support to resolve additional
-- * information for a completion item.
-- */
-- resolveProvider?: boolean;
--
-- /**
-- * The characters that trigger completion automatically.
-- */
-- triggerCharacters?: string[];
--}
--/**
-- * Signature help options.
-- */
--export interface SignatureHelpOptions {
-- /**
-- * The characters that trigger signature help
-- * automatically.
-- */
-- triggerCharacters?: string[];
--}
--
--/**
-- * Code Lens options.
-- */
--export interface CodeLensOptions {
-- /**
-- * Code lens has a resolve provider as well.
-- */
-- resolveProvider?: boolean;
--}
--
--/**
-- * Format document on type options
-- */
--export interface DocumentOnTypeFormattingOptions {
-- /**
-- * A character on which formatting should be triggered, like `}`.
-- */
-- firstTriggerCharacter: string;
--
-- /**
-- * More trigger characters.
-- */
-- moreTriggerCharacter?: string[];
--}
--
--/**
-- * Document link options
-- */
--export interface DocumentLinkOptions {
-- /**
-- * Document links have a resolve provider as well.
-- */
-- resolveProvider?: boolean;
--}
--
--/**
-- * Execute command options.
-- */
--export interface ExecuteCommandOptions {
-- /**
-- * The commands to be executed on the server
-- */
-- commands: string[]
--}
--
--/**
-- * Save options.
-- */
--export interface SaveOptions {
-- /**
-- * The client is supposed to include the content on save.
-- */
-- includeText?: boolean;
--}
--
--export interface TextDocumentSyncOptions {
-- /**
-- * Open and close notifications are sent to the server.
-- */
-- openClose?: boolean;
-- /**
-- * Change notificatins are sent to the server. See TextDocumentSyncKind.None, TextDocumentSyncKind.Full
-- * and TextDocumentSyncKindIncremental.
-- */
-- change?: number;
-- /**
-- * Will save notifications are sent to the server.
-- */
-- willSave?: boolean;
-- /**
-- * Will save wait until requests are sent to the server.
-- */
-- willSaveWaitUntil?: boolean;
-- /**
-- * Save notifications are sent to the server.
-- */
-- save?: SaveOptions;
--}
--
--interface ServerCapabilities {
-- /**
-- * Defines how text documents are synced. Is either a detailed structure defining each notification or
-- * for backwards compatibility the TextDocumentSyncKind number.
-- */
-- textDocumentSync?: TextDocumentSyncOptions | number;
-- /**
-- * The server provides hover support.
-- */
-- hoverProvider?: boolean;
-- /**
-- * The server provides completion support.
-- */
-- completionProvider?: CompletionOptions;
-- /**
-- * The server provides signature help support.
-- */
-- signatureHelpProvider?: SignatureHelpOptions;
-- /**
-- * The server provides goto definition support.
-- */
-- definitionProvider?: boolean;
-- /**
-- * The server provides find references support.
-- */
-- referencesProvider?: boolean;
-- /**
-- * The server provides document highlight support.
-- */
-- documentHighlightProvider?: boolean;
-- /**
-- * The server provides document symbol support.
-- */
-- documentSymbolProvider?: boolean;
-- /**
-- * The server provides workspace symbol support.
-- */
-- workspaceSymbolProvider?: boolean;
-- /**
-- * The server provides code actions.
-- */
-- codeActionProvider?: boolean;
-- /**
-- * The server provides code lens.
-- */
-- codeLensProvider?: CodeLensOptions;
-- /**
-- * The server provides document formatting.
-- */
-- documentFormattingProvider?: boolean;
-- /**
-- * The server provides document range formatting.
-- */
-- documentRangeFormattingProvider?: boolean;
-- /**
-- * The server provides document formatting on typing.
-- */
-- documentOnTypeFormattingProvider?: DocumentOnTypeFormattingOptions;
-- /**
-- * The server provides rename support.
-- */
-- renameProvider?: boolean;
-- /**
-- * The server provides document link support.
-- */
-- documentLinkProvider?: DocumentLinkOptions;
-- /**
-- * The server provides execute command support.
-- */
-- executeCommandProvider?: ExecuteCommandOptions;
-- /**
-- * Experimental server capabilities.
-- */
-- experimental?: any;
--}
--```
type TextDocumentSyncKind is (None, Full, Incremental);
not overriding procedure Write_TextDocumentSyncKind
(S : access Ada.Streams.Root_Stream_Type'Class;
V : TextDocumentSyncKind);
for TextDocumentSyncKind'Write use Write_TextDocumentSyncKind;
package Optional_TextDocumentSyncKinds is new LSP.Generic_Optional (TextDocumentSyncKind);
type Optional_TextDocumentSyncKind is new Optional_TextDocumentSyncKinds.Optional_Type;
type TextDocumentSyncOptions is record
openClose: Optional_Boolean;
change: Optional_TextDocumentSyncKind;
willSave: Optional_Boolean;
willSaveWaitUntil: Optional_Boolean;
save: Optional_Boolean;
end record;
type Optional_TextDocumentSyncOptions
(Is_Set : Boolean := False;
Is_Number : Boolean := False) is
record
case Is_Set is
when True =>
case Is_Number is
when True =>
Value : TextDocumentSyncKind;
when False =>
Options : TextDocumentSyncOptions;
end case;
when False => null;
end case;
end record;
type CompletionOptions is record
resolveProvider: LSP.Types.Optional_Boolean;
triggerCharacters: LSP.Types.LSP_String_Vector;
end record;
not overriding procedure Write_CompletionOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CompletionOptions);
for CompletionOptions'Write use Write_CompletionOptions;
package Optional_CompletionOptionss is
new LSP.Generic_Optional (CompletionOptions);
type Optional_CompletionOptions is
new Optional_CompletionOptionss.Optional_Type;
type SignatureHelpOptions is record
triggerCharacters: LSP.Types.LSP_String_Vector;
end record;
not overriding procedure Write_SignatureHelpOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SignatureHelpOptions);
for SignatureHelpOptions'Write use Write_SignatureHelpOptions;
package Optional_SignatureHelpOptionss is
new LSP.Generic_Optional (SignatureHelpOptions);
type Optional_SignatureHelpOptions is
new Optional_SignatureHelpOptionss.Optional_Type;
type CodeLensOptions is record
resolveProvider: LSP.Types.Optional_Boolean;
end record;
not overriding procedure Write_CodeLensOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CodeLensOptions);
for CodeLensOptions'Write use Write_CodeLensOptions;
package Optional_CodeLensOptionss is
new LSP.Generic_Optional (CodeLensOptions);
type Optional_CodeLensOptions is
new Optional_CodeLensOptionss.Optional_Type;
type DocumentOnTypeFormattingOptions is record
firstTriggerCharacter: LSP.Types.LSP_String;
moreTriggerCharacter: LSP.Types.LSP_String_Vector;
end record;
not overriding procedure Write_DocumentOnTypeFormattingOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : DocumentOnTypeFormattingOptions);
for DocumentOnTypeFormattingOptions'Write use Write_DocumentOnTypeFormattingOptions;
package Optional_DocumentOnTypeFormattingOptionss is
new LSP.Generic_Optional (DocumentOnTypeFormattingOptions);
type Optional_DocumentOnTypeFormattingOptions is
new Optional_DocumentOnTypeFormattingOptionss.Optional_Type;
type DocumentLinkOptions is record
resolveProvider: LSP.Types.Optional_Boolean;
end record;
type ExecuteCommandOptions is record
commands: LSP.Types.LSP_String_Vector;
end record;
type ServerCapabilities is record
textDocumentSync: Optional_TextDocumentSyncOptions;
hoverProvider: Optional_Boolean;
completionProvider: Optional_CompletionOptions;
signatureHelpProvider: Optional_SignatureHelpOptions;
definitionProvider: Optional_Boolean;
referencesProvider: Optional_Boolean;
documentHighlightProvider: Optional_Boolean;
documentSymbolProvider: Optional_Boolean;
workspaceSymbolProvider: Optional_Boolean;
codeActionProvider: Optional_Boolean;
codeLensProvider: Optional_CodeLensOptions;
documentFormattingProvider: Optional_Boolean;
documentRangeFormattingProvider: Optional_Boolean;
documentOnTypeFormattingProvider: Optional_DocumentOnTypeFormattingOptions;
renameProvider: Optional_Boolean;
documentLinkProvider: DocumentLinkOptions;
executeCommandProvider: ExecuteCommandOptions;
-- experimental?: any;
end record;
--```typescript
--interface InitializeResult {
-- /**
-- * The capabilities the language server provides.
-- */
-- capabilities: ServerCapabilities;
--}
--```
type InitializeResult is record
capabilities: ServerCapabilities;
end record;
type Initialize_Response is new ResponseMessage with record
result: InitializeResult;
end record;
--```typescript
--/**
-- * Known error codes for an `InitializeError`;
-- */
--export namespace InitializeError {
-- /**
-- * If the protocol version provided by the client can't be handled by the server.
-- * @deprecated This initialize error got replaced by client capabilities. There is
-- * no version handshake in version 3.0x
-- */
-- export const unknownProtocolVersion: number = 1;
--}
--```
unknownProtocolVersion: constant := 1;
--```typescript
--interface InitializeError {
-- /**
-- * Indicates whether the client execute the following retry logic:
-- * (1) show the message provided by the ResponseError to the user
-- * (2) user selects retry or cancel
-- * (3) if user selected retry the initialize method is sent again.
-- */
-- retry: boolean;
--}
--```
type InitializeError is record
retry: Boolean;
end record;
--+J
--```typescript
--export namespace MessageType {
-- /**
-- * An error message.
-- */
-- export const Error = 1;
-- /**
-- * A warning message.
-- */
-- export const Warning = 2;
-- /**
-- * An information message.
-- */
-- export const Info = 3;
-- /**
-- * A log message.
-- */
-- export const Log = 4;
--}
--```
type MessageType is (Error, Warning, Info, Log);
--```typescript
--interface ShowMessageParams {
-- /**
-- * The message type. See {@link MessageType}.
-- */
-- type: number;
--
-- /**
-- * The actual message.
-- */
-- message: string;
--}
--```
type ShowMessageParams is record
the_type: MessageType; -- type: is reserver word
message: LSP_String;
end record;
--```typescript
--interface ShowMessageRequestParams {
-- /**
-- * The message type. See {@link MessageType}
-- */
-- type: number;
--
-- /**
-- * The actual message
-- */
-- message: string;
--
-- /**
-- * The message action items to present.
-- */
-- actions?: MessageActionItem[];
--}
--```
type ShowMessageRequestParams is record
the_type: MessageType; -- type: is reserver word
message: LSP_String;
actions: MessageActionItem_Vector;
end record;
--```typescript
--interface MessageActionItem {
-- /**
-- * A short title like 'Retry', 'Open Log' etc.
-- */
-- title: string;
--}
--```
-- Lets use League.Strings.Universal_String for MessageActionItem
--```typescript
--interface LogMessageParams {
-- /**
-- * The message type. See {@link MessageType}
-- */
-- type: number;
--
-- /**
-- * The actual message
-- */
-- message: string;
--}
--```
type LogMessageParams is record
the_type: MessageType; -- type: is reserver word
message: LSP_String;
end record;
--```typescript
--export interface TextDocumentRegistrationOptions {
-- /**
-- * A document selector to identify the scope of the registration. If set to null
-- * the document selector provided on the client side will be used.
-- */
-- documentSelector: DocumentSelector | null;
--}
--```
type TextDocumentRegistrationOptions is tagged record
documentSelector: LSP.Messages.DocumentSelector;
end record;
--```typescript
--/**
-- * Descibe options to be used when registered for text document change events.
-- */
--export interface TextDocumentChangeRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * How documents are synced to the server. See TextDocumentSyncKind.Full
-- * and TextDocumentSyncKindIncremental.
-- */
-- syncKind: number;
--}
--```
type TextDocumentChangeRegistrationOptions is
new TextDocumentRegistrationOptions with
record
syncKind: TextDocumentSyncKind;
end record;
--```typescript
--export interface TextDocumentSaveRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * The client is supposed to include the content on save.
-- */
-- includeText?: boolean;
--}
--```
type TextDocumentSaveRegistrationOptions is
new TextDocumentRegistrationOptions with record
includeText: Optional_Boolean;
end record;
--```typescript
--export interface CompletionRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * The characters that trigger completion automatically.
-- */
-- triggerCharacters?: string[];
--
-- /**
-- * The server provides support to resolve additional
-- * information for a completion item.
-- */
-- resolveProvider?: boolean;
--}
--```
type CompletionRegistrationOptions is new TextDocumentRegistrationOptions with record
triggerCharacters: LSP_String_Vector;
resolveProvider: Optional_Boolean;
end record;
--```typescript
--export interface SignatureHelpRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * The characters that trigger signature help
-- * automatically.
-- */
-- triggerCharacters?: string[];
--}
--```
type SignatureHelpRegistrationOptions is new TextDocumentRegistrationOptions with record
triggerCharacters: LSP_String_Vector;
end record;
--```typescript
--export interface CodeLensRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * Code lens has a resolve provider as well.
-- */
-- resolveProvider?: boolean;
--}
--```
type CodeLensRegistrationOptions is new TextDocumentRegistrationOptions with record
resolveProvider: Optional_Boolean;
end record;
--```typescript
--export interface DocumentLinkRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * Document links have a resolve provider as well.
-- */
-- resolveProvider?: boolean;
--}
--```
type DocumentLinkRegistrationOptions is new TextDocumentRegistrationOptions with record
resolveProvider: Optional_Boolean;
end record;
--```typescript
--export interface DocumentOnTypeFormattingRegistrationOptions extends TextDocumentRegistrationOptions {
-- /**
-- * A character on which formatting should be triggered, like `}`.
-- */
-- firstTriggerCharacter: string;
-- /**
-- * More trigger characters.
-- */
-- moreTriggerCharacter?: string[]
--}
--```
type DocumentOnTypeFormattingRegistrationOptions is new TextDocumentRegistrationOptions with record
firstTriggerCharacter: LSP_String;
moreTriggerCharacter: LSP_String_Vector;
end record;
--```typescript
--/**
-- * Execute command registration options.
-- */
--export interface ExecuteCommandRegistrationOptions {
-- /**
-- * The commands to be executed on the server
-- */
-- commands: string[]
--}
--```
type ExecuteCommandRegistrationOptions is record
commands: LSP_String_Vector;
end record;
type Registration_Option (Kind : Registration_Option_Kinds := Absent) is record
case Kind is
when Absent =>
null;
when Text_Document_Registration_Option =>
Text_Document : TextDocumentRegistrationOptions;
when Text_Document_Change_Registration_Option =>
Text_Document_Change : TextDocumentChangeRegistrationOptions;
when Text_Document_Save_Registration_Option =>
Text_Document_Save : TextDocumentSaveRegistrationOptions;
when Completion_Registration_Option =>
Completion : CompletionRegistrationOptions;
when Signature_Help_Registration_Option =>
SignatureHelp : SignatureHelpRegistrationOptions;
when Code_Lens_Registration_Option =>
CodeLens : CodeLensRegistrationOptions;
when Document_Link_Registration_Option =>
DocumentLink : DocumentLinkRegistrationOptions;
when Document_On_Type_Formatting_Registration_Option =>
DocumentOnTypeFormatting : DocumentOnTypeFormattingRegistrationOptions;
when Execute_Command_Registration_Option =>
ExecuteCommand : ExecuteCommandRegistrationOptions;
end case;
end record;
--```typescript
--/**
-- * General parameters to register for a capability.
-- */
--export interface Registration {
-- /**
-- * The id used to register the request. The id can be used to deregister
-- * the request again.
-- */
-- id: string;
--
-- /**
-- * The method / capability to register for.
-- */
-- method: string;
--
-- /**
-- * Options necessary for the registration.
-- */
-- registerOptions?: any;
--}
--
--export interface RegistrationParams {
-- registrations: Registration[];
--}
--```
type Registration is record
id: LSP_String;
method: LSP_String;
registerOptions: Registration_Option;
end record;
type Registration_Array is array (Positive range <>) of Registration;
type RegistrationParams (Length : Natural) is record
registrations: Registration_Array (1 .. Length);
end record;
--```typescript
--/**
-- * General parameters to unregister a capability.
-- */
--export interface Unregistration {
-- /**
-- * The id used to unregister the request or notification. Usually an id
-- * provided during the register request.
-- */
-- id: string;
--
-- /**
-- * The method / capability to unregister for.
-- */
-- method: string;
--}
--
--export interface UnregistrationParams {
-- unregisterations: Unregistration[];
--}
--```
type Unregistration is record
id: LSP_String;
method: LSP_String;
end record;
package Unregistration_Vectors is new Ada.Containers.Vectors
(Positive, Unregistration);
type UnregistrationParams is
new Unregistration_Vectors.Vector with null record;
--```typescript
--interface DidChangeConfigurationParams {
-- /**
-- * The actual changed settings
-- */
-- settings: any;
--}
--```
type DidChangeConfigurationParams is record
settings: LSP.Types.LSP_Any;
end record;
--```typescript
--interface DidOpenTextDocumentParams {
-- /**
-- * The document that was opened.
-- */
-- textDocument: TextDocumentItem;
--}
--```
type DidOpenTextDocumentParams is record
textDocument: TextDocumentItem;
end record;
--```typescript
--interface DidChangeTextDocumentParams {
-- /**
-- * The document that did change. The version number points
-- * to the version after all provided content changes have
-- * been applied.
-- */
-- textDocument: VersionedTextDocumentIdentifier;
--
-- /**
-- * The actual content changes. The content changes descibe single state changes
-- * to the document. So if there are two content changes c1 and c2 for a document
-- * in state S10 then c1 move the document to S11 and c2 to S12.
-- */
-- contentChanges: TextDocumentContentChangeEvent[];
--}
--
--/**
-- * An event describing a change to a text document. If range and rangeLength are omitted
-- * the new text is considered to be the full content of the document.
-- */
--interface TextDocumentContentChangeEvent {
-- /**
-- * The range of the document that changed.
-- */
-- range?: Range;
--
-- /**
-- * The length of the range that got replaced.
-- */
-- rangeLength?: number;
--
-- /**
-- * The new text of the range/document.
-- */
-- text: string;
--}
--```
type TextDocumentContentChangeEvent is record
span: Optional_Span;
rangeLength: LSP.Types.Optional_Number;
text: LSP_String;
end record;
not overriding procedure Read_TextDocumentContentChangeEvent
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentContentChangeEvent);
for TextDocumentContentChangeEvent'Read use
Read_TextDocumentContentChangeEvent;
package TextDocumentContentChangeEvent_Vectors is new Ada.Containers.Vectors
(Positive, TextDocumentContentChangeEvent);
type TextDocumentContentChangeEvent_Vector is
new TextDocumentContentChangeEvent_Vectors.Vector with null record;
not overriding procedure Read_TextDocumentContentChangeEvent_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentContentChangeEvent_Vector);
for TextDocumentContentChangeEvent_Vector'Read use
Read_TextDocumentContentChangeEvent_Vector;
type DidChangeTextDocumentParams is record
textDocument: VersionedTextDocumentIdentifier;
contentChanges: TextDocumentContentChangeEvent_Vector;
end record;
--```typescript
--/**
-- * The parameters send in a will save text document notification.
-- */
--export interface WillSaveTextDocumentParams {
-- /**
-- * The document that will be saved.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The 'TextDocumentSaveReason'.
-- */
-- reason: number;
--}
--
--/**
-- * Represents reasons why a text document is saved.
-- */
--export namespace TextDocumentSaveReason {
--
-- /**
-- * Manually triggered, e.g. by the user pressing save, by starting debugging,
-- * or by an API call.
-- */
-- export const Manual = 1;
--
-- /**
-- * Automatic after a delay.
-- */
-- export const AfterDelay = 2;
--
-- /**
-- * When the editor lost focus.
-- */
-- export const FocusOut = 3;
--}
--```
type TextDocumentSaveReason is (Manual, AfterDelay, FocusOut);
type WillSaveTextDocumentParams is record
textDocument: TextDocumentIdentifier;
reason: TextDocumentSaveReason;
end record;
--```typescript
--interface DidSaveTextDocumentParams {
-- /**
-- * The document that was saved.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * Optional the content when saved. Depends on the includeText value
-- * when the save notifcation was requested.
-- */
-- text?: string;
--}
--```
type DidSaveTextDocumentParams is record
textDocument: TextDocumentIdentifier;
text: Optional_String;
end record;
--```typescript
--interface DidCloseTextDocumentParams {
-- /**
-- * The document that was closed.
-- */
-- textDocument: TextDocumentIdentifier;
--}
--```
type DidCloseTextDocumentParams is record
textDocument: TextDocumentIdentifier;
end record;
--```typescript
--/**
-- * An event describing a file change.
-- */
--interface FileEvent {
-- /**
-- * The file's URI.
-- */
-- uri: DocumentUri;
-- /**
-- * The change type.
-- */
-- type: number;
--}
--
--/**
-- * The file event type.
-- */
--export namespace FileChangeType {
-- /**
-- * The file got created.
-- */
-- export const Created = 1;
-- /**
-- * The file got changed.
-- */
-- export const Changed = 2;
-- /**
-- * The file got deleted.
-- */
-- export const Deleted = 3;
--}
--```
type FileChangeType is (Created, Changed, Deleted);
type FileEvent is record
uri: DocumentUri;
the_type : FileChangeType; -- type: is reserver word
end record;
package FileEvent_Vectors is new Ada.Containers.Vectors (Positive, FileEvent);
--```typescript
--interface DidChangeWatchedFilesParams {
-- /**
-- * The actual file events.
-- */
-- changes: FileEvent[];
--}
--```
type DidChangeWatchedFilesParams is record
changes: FileEvent_Vectors.Vector;
end record;
--```typescript
--interface PublishDiagnosticsParams {
-- /**
-- * The URI for which diagnostic information is reported.
-- */
-- uri: DocumentUri;
--
-- /**
-- * An array of diagnostic information items.
-- */
-- diagnostics: Diagnostic[];
--}
--```
type PublishDiagnosticsParams is record
uri: DocumentUri;
diagnostics: Diagnostic_Vector;
end record;
--```typescript
--/**
-- * Represents a collection of [completion items](#CompletionItem) to be presented
-- * in the editor.
-- */
--interface CompletionList {
-- /**
-- * This list it not complete. Further typing should result in recomputing
-- * this list.
-- */
-- isIncomplete: boolean;
-- /**
-- * The completion items.
-- */
-- items: CompletionItem[];
--}
--
--/**
-- * Defines whether the insert text in a completion item should be interpreted as
-- * plain text or a snippet.
-- */
--namespace InsertTextFormat {
-- /**
-- * The primary text to be inserted is treated as a plain string.
-- */
-- export const PlainText = 1;
--
-- /**
-- * The primary text to be inserted is treated as a snippet.
-- *
-- * A snippet can define tab stops and placeholders with `$1`, `$2`
-- * and `${3:foo}`. `$0` defines the final tab stop, it defaults to
-- * the end of the snippet. Placeholders with equal identifiers are linked,
-- * that is typing in one will update others too.
-- *
-- * See also: https://github.com/Microsoft/vscode/blob/master/src/vs/editor/contrib/snippet/common/snippet.md
-- */
-- export const Snippet = 2;
--}
--
--type InsertTextFormat = 1 | 2;
--
--interface CompletionItem {
-- /**
-- * The label of this completion item. By default
-- * also the text that is inserted when selecting
-- * this completion.
-- */
-- label: string;
-- /**
-- * The kind of this completion item. Based of the kind
-- * an icon is chosen by the editor.
-- */
-- kind?: number;
-- /**
-- * A human-readable string with additional information
-- * about this item, like type or symbol information.
-- */
-- detail?: string;
-- /**
-- * A human-readable string that represents a doc-comment.
-- */
-- documentation?: string;
-- /**
-- * A string that shoud be used when comparing this item
-- * with other items. When `falsy` the label is used.
-- */
-- sortText?: string;
-- /**
-- * A string that should be used when filtering a set of
-- * completion items. When `falsy` the label is used.
-- */
-- filterText?: string;
-- /**
-- * A string that should be inserted a document when selecting
-- * this completion. When `falsy` the label is used.
-- */
-- insertText?: string;
-- /**
-- * The format of the insert text. The format applies to both the `insertText` property
-- * and the `newText` property of a provided `textEdit`.
-- */
-- insertTextFormat?: InsertTextFormat;
-- /**
-- * An edit which is applied to a document when selecting this completion. When an edit is provided the value of
-- * `insertText` is ignored.
-- *
-- * *Note:* The range of the edit must be a single line range and it must contain the position at which completion
-- * has been requested.
-- */
-- textEdit?: TextEdit;
-- /**
-- * An optional array of additional text edits that are applied when
-- * selecting this completion. Edits must not overlap with the main edit
-- * nor with themselves.
-- */
-- additionalTextEdits?: TextEdit[];
-- /**
-- * An optional set of characters that when pressed while this completion is active will accept it first and
-- * then type that character. *Note* that all commit characters should have `length=1` and that superfluous
-- * characters will be ignored.
-- */
-- commitCharacters?: string[];
-- /**
-- * An optional command that is executed *after* inserting this completion. *Note* that
-- * additional modifications to the current document should be described with the
-- * additionalTextEdits-property.
-- */
-- command?: Command;
-- /**
-- * An data entry field that is preserved on a completion item between
-- * a completion and a completion resolve request.
-- */
-- data?: any
--}
--
--/**
-- * The kind of a completion entry.
-- */
--namespace CompletionItemKind {
-- export const Text = 1;
-- export const Method = 2;
-- export const Function = 3;
-- export const Constructor = 4;
-- export const Field = 5;
-- export const Variable = 6;
-- export const Class = 7;
-- export const Interface = 8;
-- export const Module = 9;
-- export const Property = 10;
-- export const Unit = 11;
-- export const Value = 12;
-- export const Enum = 13;
-- export const Keyword = 14;
-- export const Snippet = 15;
-- export const Color = 16;
-- export const File = 17;
-- export const Reference = 18;
--}
--```
type InsertTextFormat is (PlainText, Snippet);
not overriding procedure Write_InsertTextFormat
(S : access Ada.Streams.Root_Stream_Type'Class;
V : InsertTextFormat);
for InsertTextFormat'Write use Write_InsertTextFormat;
package Optional_InsertTextFormats is new LSP.Generic_Optional (InsertTextFormat);
type Optional_InsertTextFormat is new Optional_InsertTextFormats.Optional_Type;
type CompletionItemKind is (
Text,
Method,
A_Function,
Constructor,
Field,
Variable,
Class,
An_Interface,
Module,
Property,
Unit,
Value,
Enum,
Keyword,
Snippet,
Color,
File,
Reference);
not overriding procedure Write_CompletionItemKind
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CompletionItemKind);
for CompletionItemKind'Write use Write_CompletionItemKind;
package Optional_CompletionItemKinds is new LSP.Generic_Optional (CompletionItemKind);
type Optional_CompletionItemKind is new Optional_CompletionItemKinds.Optional_Type;
type CompletionItem is record
label: LSP_String;
kind: Optional_CompletionItemKind;
detail: Optional_String;
documentation: Optional_String;
sortText: Optional_String;
filterText: Optional_String;
insertText: Optional_String;
insertTextFormat: Optional_InsertTextFormat;
textEdit: Optional_TextEdit;
additionalTextEdits: TextEdit_Vector;
commitCharacters: LSP_String_Vector;
command: LSP.Messages.Command; -- Optional ???
-- data?: any
end record;
not overriding procedure Write_CompletionItem
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CompletionItem);
for CompletionItem'Write use Write_CompletionItem;
package CompletionItem_Vectors is new Ada.Containers.Vectors
(Positive, CompletionItem);
type CompletionList is record
isIncomplete: Boolean := False;
items: CompletionItem_Vectors.Vector;
end record;
type Completion_Response is new ResponseMessage with record
result: CompletionList;
end record;
--```typescript
--/**
-- * MarkedString can be used to render human readable text. It is either a markdown string
-- * or a code-block that provides a language and a code snippet. The language identifier
-- * is sematically equal to the optional language identifier in fenced code blocks in GitHub
-- * issues. See https://help.github.com/articles/creating-and-highlighting-code-blocks/#syntax-highlighting
-- *
-- * The pair of a language and a value is an equivalent to markdown:
-- * ```${language}
-- * ${value}
-- * ```
-- *
-- * Note that markdown strings will be sanitized - that means html will be escaped.
-- */
--type MarkedString = string | { language: string; value: string };
--```
type MarkedString (Is_String : Boolean := True) is record
value : LSP_String;
case Is_String is
when True =>
null;
when False =>
language : LSP_String;
end case;
end record;
not overriding procedure Write_MarkedString
(S : access Ada.Streams.Root_Stream_Type'Class;
V : MarkedString);
for MarkedString'Write use Write_MarkedString;
package MarkedString_Vectors is new Ada.Containers.Vectors
(Positive, MarkedString);
--```typescript
--/**
-- * The result of a hover request.
-- */
--interface Hover {
-- /**
-- * The hover's content
-- */
-- contents: MarkedString | MarkedString[];
--
-- /**
-- * An optional range is a range inside a text document
-- * that is used to visualize a hover, e.g. by changing the background color.
-- */
-- range?: Range;
--}
--```
type Hover is record
contents: MarkedString_Vectors.Vector;
Span: Optional_Span;
end record;
type Hover_Response is new ResponseMessage with record
result: Hover;
end record;
--```typescript
--/**
-- * Signature help represents the signature of something
-- * callable. There can be multiple signature but only one
-- * active and only one active parameter.
-- */
--interface SignatureHelp {
-- /**
-- * One or more signatures.
-- */
-- signatures: SignatureInformation[];
--
-- /**
-- * The active signature. If omitted or the value lies outside the
-- * range of `signatures` the value defaults to zero or is ignored if
-- * `signatures.length === 0`. Whenever possible implementors should
-- * make an active decision about the active signature and shouldn't
-- * rely on a default value.
-- * In future version of the protocol this property might become
-- * mandantory to better express this.
-- */
-- activeSignature?: number;
--
-- /**
-- * The active parameter of the active signature. If omitted or the value
-- * lies outside the range of `signatures[activeSignature].parameters`
-- * defaults to 0 if the active signature has parameters. If
-- * the active signature has no parameters it is ignored.
-- * In future version of the protocol this property might become
-- * mandantory to better express the active parameter if the
-- * active signature does have any.
-- */
-- activeParameter?: number;
--}
--
--/**
-- * Represents the signature of something callable. A signature
-- * can have a label, like a function-name, a doc-comment, and
-- * a set of parameters.
-- */
--interface SignatureInformation {
-- /**
-- * The label of this signature. Will be shown in
-- * the UI.
-- */
-- label: string;
--
-- /**
-- * The human-readable doc-comment of this signature. Will be shown
-- * in the UI but can be omitted.
-- */
-- documentation?: string;
--
-- /**
-- * The parameters of this signature.
-- */
-- parameters?: ParameterInformation[];
--}
--
--/**
-- * Represents a parameter of a callable-signature. A parameter can
-- * have a label and a doc-comment.
-- */
--interface ParameterInformation {
-- /**
-- * The label of this parameter. Will be shown in
-- * the UI.
-- */
-- label: string;
--
-- /**
-- * The human-readable doc-comment of this parameter. Will be shown
-- * in the UI but can be omitted.
-- */
-- documentation?: string;
--}
--```
type ParameterInformation is record
label: LSP_String;
documentation: Optional_String;
end record;
not overriding procedure Write_ParameterInformation
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ParameterInformation);
for ParameterInformation'Write use Write_ParameterInformation;
package ParameterInformation_Vectors is new Ada.Containers.Vectors
(Positive, ParameterInformation);
type SignatureInformation is record
label: LSP_String;
documentation: Optional_String;
parameters: ParameterInformation_Vectors.Vector;
end record;
not overriding procedure Write_SignatureInformation
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SignatureInformation);
for SignatureInformation'Write use Write_SignatureInformation;
package SignatureInformation_Vectors is new Ada.Containers.Vectors
(Positive, SignatureInformation);
type SignatureHelp is record
signatures: SignatureInformation_Vectors.Vector;
activeSignature: Optional_Number;
activeParameter: Optional_Number;
end record;
type SignatureHelp_Response is new ResponseMessage with record
result: SignatureHelp;
end record;
--```typescript
--interface ReferenceContext {
-- /**
-- * Include the declaration of the current symbol.
-- */
-- includeDeclaration: boolean;
--}
--```
type ReferenceContext is record
includeDeclaration: Boolean;
end record;
--```typescript
--interface ReferenceParams extends TextDocumentPositionParams {
-- context: ReferenceContext
--}
--```
type ReferenceParams is new TextDocumentPositionParams with record
context: ReferenceContext;
end record;
--```typescript
--/**
-- * A document highlight is a range inside a text document which deserves
-- * special attention. Usually a document highlight is visualized by changing
-- * the background color of its range.
-- *
-- */
--interface DocumentHighlight {
-- /**
-- * The range this highlight applies to.
-- */
-- range: Range;
--
-- /**
-- * The highlight kind, default is DocumentHighlightKind.Text.
-- */
-- kind?: number;
--}
--
--/**
-- * A document highlight kind.
-- */
--export namespace DocumentHighlightKind {
-- /**
-- * A textual occurrence.
-- */
-- export const Text = 1;
--
-- /**
-- * Read-access of a symbol, like reading a variable.
-- */
-- export const Read = 2;
--
-- /**
-- * Write-access of a symbol, like writing to a variable.
-- */
-- export const Write = 3;
--}
--```
type DocumentHighlightKind is (Unspecified, Text, Read, Write);
type DocumentHighlight is record
span: LSP.Messages.Span;
kind: DocumentHighlightKind;
end record;
not overriding procedure Write_DocumentHighlight
(S : access Ada.Streams.Root_Stream_Type'Class;
V : DocumentHighlight);
for DocumentHighlight'Write use Write_DocumentHighlight;
package DocumentHighlight_Vectors is new Ada.Containers.Vectors
(Positive, DocumentHighlight);
type Highlight_Response is new ResponseMessage with record
result: DocumentHighlight_Vectors.Vector;
end record;
--```typescript
--interface DocumentSymbolParams {
-- /**
-- * The text document.
-- */
-- textDocument: TextDocumentIdentifier;
--}
--```
type DocumentSymbolParams is record
textDocument: TextDocumentIdentifier;
end record;
--```typescript
--/**
-- * Represents information about programming constructs like variables, classes,
-- * interfaces etc.
-- */
--interface SymbolInformation {
-- /**
-- * The name of this symbol.
-- */
-- name: string;
--
-- /**
-- * The kind of this symbol.
-- */
-- kind: number;
--
-- /**
-- * The location of this symbol. The location's range is used by a tool
-- * to reveal the location in the editor. If the symbol is selected in the
-- * tool the range's start information is used to position the cursor. So
-- * the range usually spwans more then the actual symbol's name and does
-- * normally include thinks like visibility modifiers.
-- *
-- * The range doesn't have to denote a node range in the sense of a abstract
-- * syntax tree. It can therefore not be used to re-construct a hierarchy of
-- * the symbols.
-- */
-- location: Location;
--
-- /**
-- * The name of the symbol containing this symbol. This information is for
-- * user interface purposes (e.g. to render a qaulifier in the user interface
-- * if necessary). It can't be used to re-infer a hierarchy for the document
-- * symbols.
-- */
-- containerName?: string;
--}
--
--/**
-- * A symbol kind.
-- */
--export namespace SymbolKind {
-- export const File = 1;
-- export const Module = 2;
-- export const Namespace = 3;
-- export const Package = 4;
-- export const Class = 5;
-- export const Method = 6;
-- export const Property = 7;
-- export const Field = 8;
-- export const Constructor = 9;
-- export const Enum = 10;
-- export const Interface = 11;
-- export const Function = 12;
-- export const Variable = 13;
-- export const Constant = 14;
-- export const String = 15;
-- export const Number = 16;
-- export const Boolean = 17;
-- export const Array = 18;
--}
--```
type SymbolKind is
(File,
Module,
Namespace,
A_Package,
Class,
Method,
Property,
Field,
Constructor,
Enum,
An_Interface,
A_Function,
Variable,
A_Constant,
String,
Number,
A_Boolean,
An_Array);
type SymbolInformation is record
name: LSP_String;
kind: SymbolKind;
location: LSP.Messages.Location;
containerName: Optional_String;
end record;
not overriding procedure Write_SymbolInformation
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SymbolInformation);
for SymbolInformation'Write use Write_SymbolInformation;
package SymbolInformation_Vectors is new Ada.Containers.Vectors
(Positive, SymbolInformation);
type SymbolInformation_Vector is
new SymbolInformation_Vectors.Vector with null record;
type Symbol_Response is new ResponseMessage with record
result: SymbolInformation_Vector;
end record;
--```typescript
--/**
-- * The parameters of a Workspace Symbol Request.
-- */
--interface WorkspaceSymbolParams {
-- /**
-- * A non-empty query string
-- */
-- query: string;
--}
--```
type WorkspaceSymbolParams is record
query: LSP_String;
end record;
--```typescript
--/**
-- * Params for the CodeActionRequest
-- */
--interface CodeActionParams {
-- /**
-- * The document in which the command was invoked.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The range for which the command was invoked.
-- */
-- range: Range;
--
-- /**
-- * Context carrying additional information.
-- */
-- context: CodeActionContext;
--}
--
--/**
-- * Contains additional diagnostic information about the context in which
-- * a code action is run.
-- */
--interface CodeActionContext {
-- /**
-- * An array of diagnostics.
-- */
-- diagnostics: Diagnostic[];
--}
--```
type CodeActionContext is record
diagnostics: Diagnostic_Vector;
end record;
type CodeActionParams is record
textDocument: TextDocumentIdentifier;
span: LSP.Messages.Span;
context: CodeActionContext;
end record;
type CodeAction_Response is new ResponseMessage with record
result: Command_Vector;
end record;
--```typescript
--interface CodeLensParams {
-- /**
-- * The document to request code lens for.
-- */
-- textDocument: TextDocumentIdentifier;
--}
--```
type CodeLensParams is record
textDocument: TextDocumentIdentifier;
end record;
--```typescript
--/**
-- * A code lens represents a command that should be shown along with
-- * source text, like the number of references, a way to run tests, etc.
-- *
-- * A code lens is _unresolved_ when no command is associated to it. For performance
-- * reasons the creation of a code lens and resolving should be done in two stages.
-- */
--interface CodeLens {
-- /**
-- * The range in which this code lens is valid. Should only span a single line.
-- */
-- range: Range;
--
-- /**
-- * The command this code lens represents.
-- */
-- command?: Command;
--
-- /**
-- * A data entry field that is preserved on a code lens item between
-- * a code lens and a code lens resolve request.
-- */
-- data?: any
--}
--```
type CodeLens is record
span: LSP.Messages.Span;
command: LSP.Messages.Command; -- Optional ???
-- data?: any
end record;
--```typescript
--interface DocumentLinkParams {
-- /**
-- * The document to provide document links for.
-- */
-- textDocument: TextDocumentIdentifier;
--}
--```
type DocumentLinkParams is record
textDocument: TextDocumentIdentifier;
end record;
--```typescript
--/**
-- * A document link is a range in a text document that links to an internal or external resource, like another
-- * text document or a web site.
-- */
--interface DocumentLink {
-- /**
-- * The range this link applies to.
-- */
-- range: Range;
-- /**
-- * The uri this link points to. If missing a resolve request is sent later.
-- */
-- target?: DocumentUri;
--}
--```
type DocumentLink is record
span: LSP.Messages.Span;
target: DocumentUri; -- Optional ???
end record;
--```typescript
--interface DocumentFormattingParams {
-- /**
-- * The document to format.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The format options.
-- */
-- options: FormattingOptions;
--}
--
--/**
-- * Value-object describing what options formatting should use.
-- */
--interface FormattingOptions {
-- /**
-- * Size of a tab in spaces.
-- */
-- tabSize: number;
--
-- /**
-- * Prefer spaces over tabs.
-- */
-- insertSpaces: boolean;
--
-- /**
-- * Signature for further properties.
-- */
-- [key: string]: boolean | number | string;
--}
--```
type FormattingOptions is record
tabSize: LSP_Number;
insertSpaces: Boolean;
-- [key: string]: boolean | number | string; ???
end record;
type DocumentFormattingParams is record
textDocument: TextDocumentIdentifier;
options: FormattingOptions;
end record;
--```typescript
--interface DocumentRangeFormattingParams {
-- /**
-- * The document to format.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The range to format
-- */
-- range: Range;
--
-- /**
-- * The format options
-- */
-- options: FormattingOptions;
--}
--```
type DocumentRangeFormattingParams is record
textDocument: TextDocumentIdentifier;
span: LSP.Messages.Span;
options: FormattingOptions;
end record;
--```typescript
--interface DocumentOnTypeFormattingParams {
-- /**
-- * The document to format.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The position at which this request was sent.
-- */
-- position: Position;
--
-- /**
-- * The character that has been typed.
-- */
-- ch: string;
--
-- /**
-- * The format options.
-- */
-- options: FormattingOptions;
--}
--```
type DocumentOnTypeFormattingParams is record
textDocument: TextDocumentIdentifier;
position: LSP.Messages.Position;
ch: LSP_String;
options: FormattingOptions;
end record;
--```typescript
--interface RenameParams {
-- /**
-- * The document to format.
-- */
-- textDocument: TextDocumentIdentifier;
--
-- /**
-- * The position at which this request was sent.
-- */
-- position: Position;
--
-- /**
-- * The new name of the symbol. If the given name is not valid the
-- * request must return a [ResponseError](#ResponseError) with an
-- * appropriate message set.
-- */
-- newName: string;
--}
--```
type RenameParams is record
textDocument: TextDocumentIdentifier;
position: LSP.Messages.Position;
newName: LSP_String;
end record;
--```typescript
--export interface ExecuteCommandParams {
--
-- /**
-- * The identifier of the actual command handler.
-- */
-- command: string;
-- /**
-- * Arguments that the command should be invoked with.
-- */
-- arguments?: any[];
--}
--```
type ExecuteCommandParams is record
command: LSP_String;
arguments: LSP_Any;
end record;
type ExecuteCommand_Response is new ResponseMessage with null record;
--```typescript
--export interface ApplyWorkspaceEditParams {
-- /**
-- * The edits to apply.
-- */
-- edit: WorkspaceEdit;
--}
--```
type ApplyWorkspaceEditParams is record
edit: WorkspaceEdit;
end record;
--```typescript
--export interface ApplyWorkspaceEditResponse {
-- /**
-- * Indicates whether the edit was applied or not.
-- */
-- applied: boolean;
--}
--```
type ApplyWorkspaceEditResponse is record
applied: Boolean;
end record;
type PublishDiagnostics_Notification is new NotificationMessage with record
params : PublishDiagnosticsParams;
end record;
type ApplyWorkspaceEdit_Request is new RequestMessage with record
params : ApplyWorkspaceEditParams;
end record;
type Location_Response is new ResponseMessage with record
result : Location_Vectors.Vector;
end record;
private
not overriding procedure Read_ClientCapabilities
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out ClientCapabilities);
not overriding procedure Read_CodeActionContext
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out CodeActionContext);
not overriding procedure Read_CodeActionParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out CodeActionParams);
not overriding procedure Read_completion
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out completion);
not overriding procedure Read_Diagnostic_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out Diagnostic_Vector);
not overriding procedure Read_DidChangeConfigurationParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DidChangeConfigurationParams);
not overriding procedure Read_DidChangeTextDocumentParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DidChangeTextDocumentParams);
not overriding procedure Read_DidCloseTextDocumentParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DidCloseTextDocumentParams);
not overriding procedure Read_DidOpenTextDocumentParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DidOpenTextDocumentParams);
not overriding procedure Read_DidSaveTextDocumentParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DidSaveTextDocumentParams);
not overriding procedure Read_DocumentSymbolParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out DocumentSymbolParams);
not overriding procedure Read_dynamicRegistration
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out dynamicRegistration);
not overriding procedure Read_ExecuteCommandParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out ExecuteCommandParams);
not overriding procedure Read_InitializeParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out InitializeParams);
not overriding procedure Read_ReferenceContext
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out ReferenceContext);
not overriding procedure Read_ReferenceParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out ReferenceParams);
not overriding procedure Read_synchronization
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out synchronization);
not overriding procedure Read_TextDocumentClientCapabilities
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentClientCapabilities);
not overriding procedure Read_TextDocumentItem
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out TextDocumentItem);
not overriding procedure Read_WorkspaceClientCapabilities
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out WorkspaceClientCapabilities);
not overriding procedure Read_WorkspaceSymbolParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : out WorkspaceSymbolParams);
not overriding procedure Write_ApplyWorkspaceEdit_Request
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ApplyWorkspaceEdit_Request);
not overriding procedure Write_ApplyWorkspaceEditParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ApplyWorkspaceEditParams);
not overriding procedure Write_CodeAction_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CodeAction_Response);
not overriding procedure Write_Command_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Command_Vector);
not overriding procedure Write_Completion_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Completion_Response);
not overriding procedure Write_CompletionList
(S : access Ada.Streams.Root_Stream_Type'Class;
V : CompletionList);
not overriding procedure Write_Diagnostic_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Diagnostic_Vector);
not overriding procedure Write_DocumentLinkOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : DocumentLinkOptions);
not overriding procedure Write_ExecuteCommand_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ExecuteCommand_Response);
not overriding procedure Write_ExecuteCommandOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ExecuteCommandOptions);
not overriding procedure Write_Highlight_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Highlight_Response);
not overriding procedure Write_Hover
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Hover);
not overriding procedure Write_Hover_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Hover_Response);
not overriding procedure Write_Initialize_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Initialize_Response);
not overriding procedure Write_InitializeResult
(S : access Ada.Streams.Root_Stream_Type'Class;
V : InitializeResult);
not overriding procedure Write_Location_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Location_Response);
not overriding procedure Write_Optional_TextDocumentSyncOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Optional_TextDocumentSyncOptions);
not overriding procedure Write_PublishDiagnostics_Notification
(S : access Ada.Streams.Root_Stream_Type'Class;
V : PublishDiagnostics_Notification);
not overriding procedure Write_PublishDiagnosticsParams
(S : access Ada.Streams.Root_Stream_Type'Class;
V : PublishDiagnosticsParams);
not overriding procedure Write_ServerCapabilities
(S : access Ada.Streams.Root_Stream_Type'Class;
V : ServerCapabilities);
not overriding procedure Write_SignatureHelp
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SignatureHelp);
not overriding procedure Write_SignatureHelp_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SignatureHelp_Response);
not overriding procedure Write_Symbol_Response
(S : access Ada.Streams.Root_Stream_Type'Class;
V : Symbol_Response);
not overriding procedure Write_SymbolInformation_Vector
(S : access Ada.Streams.Root_Stream_Type'Class;
V : SymbolInformation_Vector);
not overriding procedure Write_TextDocumentSyncOptions
(S : access Ada.Streams.Root_Stream_Type'Class;
V : TextDocumentSyncOptions);
not overriding procedure Write_WorkspaceEdit
(S : access Ada.Streams.Root_Stream_Type'Class;
V : WorkspaceEdit);
for ApplyWorkspaceEdit_Request'Write use Write_ApplyWorkspaceEdit_Request;
for ApplyWorkspaceEditParams'Write use Write_ApplyWorkspaceEditParams;
for CodeAction_Response'Write use Write_CodeAction_Response;
for Command_Vector'Write use Write_Command_Vector;
for Completion_Response'Write use Write_Completion_Response;
for CompletionList'Write use Write_CompletionList;
for Diagnostic_Vector'Write use Write_Diagnostic_Vector;
for DocumentLinkOptions'Write use Write_DocumentLinkOptions;
for ExecuteCommand_Response'Write use Write_ExecuteCommand_Response;
for ExecuteCommandOptions'Write use Write_ExecuteCommandOptions;
for Highlight_Response'Write use Write_Highlight_Response;
for Hover'Write use Write_Hover;
for Hover_Response'Write use Write_Hover_Response;
for Initialize_Response'Write use Write_Initialize_Response;
for InitializeResult'Write use Write_InitializeResult;
for Location_Response'Write use Write_Location_Response;
for Optional_TextDocumentSyncOptions'Write use Write_Optional_TextDocumentSyncOptions;
for PublishDiagnostics_Notification'Write use Write_PublishDiagnostics_Notification;
for PublishDiagnosticsParams'Write use Write_PublishDiagnosticsParams;
for ServerCapabilities'Write use Write_ServerCapabilities;
for SignatureHelp'Write use Write_SignatureHelp;
for SignatureHelp_Response'Write use Write_SignatureHelp_Response;
for Symbol_Response'Write use Write_Symbol_Response;
for SymbolInformation_Vector'Write use Write_SymbolInformation_Vector;
for TextDocumentItem'Read use Read_TextDocumentItem;
for TextDocumentSyncOptions'Write use Write_TextDocumentSyncOptions;
for WorkspaceEdit'Write use Write_WorkspaceEdit;
for ClientCapabilities'Read use Read_ClientCapabilities;
for CodeActionContext'Read use Read_CodeActionContext;
for CodeActionParams'Read use Read_CodeActionParams;
for completion'Read use Read_completion;
for Diagnostic_Vector'Read use Read_Diagnostic_Vector;
for DidChangeConfigurationParams'Read use Read_DidChangeConfigurationParams;
for DidChangeTextDocumentParams'Read use Read_DidChangeTextDocumentParams;
for DidCloseTextDocumentParams'Read use Read_DidCloseTextDocumentParams;
for DidOpenTextDocumentParams'Read use Read_DidOpenTextDocumentParams;
for DidSaveTextDocumentParams'Read use Read_DidSaveTextDocumentParams;
for DocumentSymbolParams'Read use Read_DocumentSymbolParams;
for dynamicRegistration'Read use Read_dynamicRegistration;
for ExecuteCommandParams'Read use Read_ExecuteCommandParams;
for InitializeParams'Read use Read_InitializeParams;
for ReferenceContext'Read use Read_ReferenceContext;
for ReferenceParams'Read use Read_ReferenceParams;
for synchronization'Read use Read_synchronization;
for TextDocumentClientCapabilities'Read use Read_TextDocumentClientCapabilities;
for WorkspaceClientCapabilities'Read use Read_WorkspaceClientCapabilities;
for WorkspaceSymbolParams'Read use Read_WorkspaceSymbolParams;
end LSP.Messages;
| 28.713214 | 119 | 0.644683 |
5067f05bfeacfd745036608f0352b775bca8ff6c | 3,004 | adb | Ada | src/gl/implementation/gl-objects-textures-with_3d_loader.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/implementation/gl-objects-textures-with_3d_loader.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/implementation/gl-objects-textures-with_3d_loader.adb | 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 System;
with GL.API;
package body GL.Objects.Textures.With_3D_Loader is
procedure Load_Empty_Texture (Object : Target;
Level : Mipmap_Level;
Internal_Format : Pixels.Internal_Format;
Width, Height, Depth : Types.Size) is
begin
API.Tex_Image_3D (Texture_Proxy (Object).Kind, Level, Internal_Format,
Width, Height, Depth, 0,
Format_For_Loading_Empty_Texture (Internal_Format),
Pixels.Data_Type'First,
Image_Source (System.Null_Address));
Raise_Exception_On_OpenGL_Error;
end Load_Empty_Texture;
procedure Load_From_Data (Object : Fillable_Target;
Level : Mipmap_Level;
Internal_Format : Pixels.Internal_Format;
Width, Height, Depth : Types.Size;
Source_Format : Pixels.Data_Format;
Source_Type : Pixels.Data_Type;
Source : Image_Source) is
begin
API.Tex_Image_3D (Texture_Proxy (Object).Kind, Level, Internal_Format,
Width, Height, Depth, 0, Source_Format, Source_Type,
Source);
Raise_Exception_On_OpenGL_Error;
end Load_From_Data;
procedure Load_Sub_Image_From_Data
(Object : Fillable_Target;
Level : Mipmap_Level;
X_Offset, Y_Offset : Int;
Width, Height : Size;
Format : Pixels.Data_Format;
Data_Type : Pixels.Data_Type;
Source : Image_Source) is
begin
API.Tex_Sub_Image_3D (Texture_Proxy (Object).Kind, Level, X_Offset, Y_Offset,
Width, Height, Format, Data_Type, Source);
Raise_Exception_On_OpenGL_Error;
end Load_Sub_Image_From_Data;
procedure Load_Compressed
(Object : Fillable_Target;
Level : Mipmap_Level;
Internal_Format : Pixels.Internal_Format;
Width, Height, Depth, Image_Size : Types.Size;
Source : Image_Source) is
begin
API.Compressed_Tex_Image_3D
(Texture_Proxy (Object).Kind, Level, Internal_Format, Width, Height,
Depth, 0, Image_Size, Source);
Raise_Exception_On_OpenGL_Error;
end Load_Compressed;
procedure Storage (Object : Target; Levels : Types.Size;
Internal_Format : Pixels.Internal_Format;
Width, Height, Depth : Types.Size) is
begin
API.Tex_Storage_3D (Texture_Proxy (Object).Kind, Levels, Internal_Format,
Width, Height, Depth);
Raise_Exception_On_OpenGL_Error;
end Storage;
end GL.Objects.Textures.With_3D_Loader;
| 41.150685 | 83 | 0.583555 |
fbdaacfe1759ea275fd409a2da9ff943f12c1ca5 | 1,585 | ads | Ada | src/system_random.ads | AntonMeep/system_random | 3db7f76e04f09ade5811abd8c09686750bc733ae | [
"0BSD"
] | null | null | null | src/system_random.ads | AntonMeep/system_random | 3db7f76e04f09ade5811abd8c09686750bc733ae | [
"0BSD"
] | null | null | null | src/system_random.ads | AntonMeep/system_random | 3db7f76e04f09ade5811abd8c09686750bc733ae | [
"0BSD"
] | null | null | null | with Interfaces; use Interfaces;
with Interfaces.C; use Interfaces.C;
generic
type Element is mod <>;
-- ELement type, must be mod 2**8, i.e. represent a byte
type Index is range <>;
-- Index type
type Element_Array is array (Index range <>) of aliased Element;
-- An array of aliased Elements
package System_Random with
Preelaborate
is
-- @summary
-- Ada interface to system sources of randomness
--
-- @description
-- This package provides generic interface to OS' sources of randomeness.
-- On Windows, BCryptGenRandom() is used, on other platforms such as Linux,
-- BSD, Mac OS portable getentropy() is used.
--
-- This is a generic package as it is intended to be used with user-defined
-- byte array type, that would later be converted to a seed value used to
-- seed an appropriate strong PRNG algorithm.
pragma Compile_Time_Error
(Element'Modulus /= 2**8,
"'Element' type must be mod 2**8, i.e. represent a byte");
System_Random_Error : exception;
-- Raised whenever an underlying system function has failed
procedure Random (Output : aliased out Element_Array) with
Pre => Output'Length <= Interfaces.Unsigned_32'Last and
Output'Length <= Interfaces.C.size_t'Last;
-- Fill Output with random data. This function call blocks, thus it's
-- better to call it as few times as possible.
--
-- Maximum length of Output array is determined by the underlying system
-- implementation, and for unix is equal to 256 bytes.
end System_Random;
| 36.022727 | 79 | 0.688328 |
1c882cbe8f4675441f4ee8356c50efa57fb3d517 | 9,519 | adb | Ada | src/asf-components-html-text.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-components-html-text.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-components-html-text.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- html -- ASF HTML Components
-- Copyright (C) 2009, 2010, 2011, 2012 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.Exceptions;
with EL.Objects;
with ASF.Components.Core;
with ASF.Utils;
package body ASF.Components.Html.Text is
use EL.Objects;
TEXT_ATTRIBUTE_NAMES : Util.Strings.String_Set.Set;
LABEL_ATTRIBUTE_NAMES : Util.Strings.String_Set.Set;
-- ------------------------------
-- Get the local value of the component without evaluating
-- the associated Value_Expression.
-- ------------------------------
overriding
function Get_Local_Value (UI : in UIOutput) return EL.Objects.Object is
begin
return UI.Value;
end Get_Local_Value;
-- ------------------------------
-- Get the value to write on the output.
-- ------------------------------
overriding
function Get_Value (UI : in UIOutput) return EL.Objects.Object is
begin
if not EL.Objects.Is_Null (UI.Value) then
return UI.Value;
else
return UI.Get_Attribute (UI.Get_Context.all, "value");
end if;
end Get_Value;
-- ------------------------------
-- Set the value to write on the output.
-- ------------------------------
overriding
procedure Set_Value (UI : in out UIOutput;
Value : in EL.Objects.Object) is
begin
UI.Value := Value;
end Set_Value;
-- ------------------------------
-- Get the converter that is registered on the component.
-- ------------------------------
overriding
function Get_Converter (UI : in UIOutput)
return ASF.Converters.Converter_Access is
begin
return UI.Converter;
end Get_Converter;
-- ------------------------------
-- Set the converter to be used on the component.
-- ------------------------------
overriding
procedure Set_Converter (UI : in out UIOutput;
Converter : in ASF.Converters.Converter_Access) is
use type ASF.Converters.Converter_Access;
begin
if Converter = null then
UI.Converter := null;
else
UI.Converter := Converter.all'Unchecked_Access;
end if;
end Set_Converter;
-- ------------------------------
-- Get the value of the component and apply the converter on it if there is one.
-- ------------------------------
function Get_Formatted_Value (UI : in UIOutput;
Context : in Faces_Context'Class) return String is
Value : constant EL.Objects.Object := UIOutput'Class (UI).Get_Value;
begin
return UIOutput'Class (UI).Get_Formatted_Value (Value, Context);
end Get_Formatted_Value;
-- ------------------------------
-- Format the value by appling the To_String converter on it if there is one.
-- ------------------------------
function Get_Formatted_Value (UI : in UIOutput;
Value : in Util.Beans.Objects.Object;
Context : in Contexts.Faces.Faces_Context'Class) return String is
use type ASF.Converters.Converter_Access;
begin
if UI.Converter /= null then
return UI.Converter.To_String (Context => Context,
Component => UI,
Value => Value);
else
declare
Converter : constant access ASF.Converters.Converter'Class
:= UI.Get_Converter (Context);
begin
if Converter /= null then
return Converter.To_String (Context => Context,
Component => UI,
Value => Value);
elsif not Is_Null (Value) then
return EL.Objects.To_String (Value);
else
return "";
end if;
end;
end if;
-- If the converter raises an exception, report an error in the logs.
-- At this stage, we know the value and we can report it in this log message.
-- We must queue the exception in the context, so this is done later.
exception
when E : others =>
UI.Log_Error ("Error when converting value '{0}': {1}: {2}",
Util.Beans.Objects.To_String (Value),
Ada.Exceptions.Exception_Name (E),
Ada.Exceptions.Exception_Message (E));
raise;
end Get_Formatted_Value;
procedure Write_Output (UI : in UIOutput;
Context : in out Faces_Context'Class;
Value : in String) is
Writer : constant Response_Writer_Access := Context.Get_Response_Writer;
Escape : constant Object := UI.Get_Attribute (Context, "escape");
begin
Writer.Start_Optional_Element ("span");
UI.Render_Attributes (Context, TEXT_ATTRIBUTE_NAMES, Writer);
if Is_Null (Escape) or To_Boolean (Escape) then
Writer.Write_Text (Value);
else
Writer.Write_Raw (Value);
end if;
Writer.End_Optional_Element ("span");
end Write_Output;
procedure Encode_Begin (UI : in UIOutput;
Context : in out Faces_Context'Class) is
begin
if UI.Is_Rendered (Context) then
UI.Write_Output (Context => Context,
Value => UIOutput'Class (UI).Get_Formatted_Value (Context));
end if;
-- Queue any block converter exception that could be raised.
exception
when E : others =>
Context.Queue_Exception (E);
end Encode_Begin;
-- ------------------------------
-- Label Component
-- ------------------------------
procedure Encode_Begin (UI : in UIOutputLabel;
Context : in out Faces_Context'Class) is
Writer : Response_Writer_Access;
begin
if UI.Is_Rendered (Context) then
Writer := Context.Get_Response_Writer;
Writer.Start_Element ("label");
UI.Render_Attributes (Context, LABEL_ATTRIBUTE_NAMES, Writer);
declare
Value : Util.Beans.Objects.Object := UI.Get_Attribute (Name => "for",
Context => Context);
begin
if not Util.Beans.Objects.Is_Null (Value) then
Writer.Write_Attribute ("for", Value);
end if;
Value := UIOutputLabel'Class (UI).Get_Value;
if not Util.Beans.Objects.Is_Null (Value) then
declare
S : constant String
:= UIOutputLabel'Class (UI).Get_Formatted_Value (Value, Context);
begin
if UI.Get_Attribute (Name => "escape", Context => Context, Default => True) then
Writer.Write_Text (S);
else
Writer.Write_Raw (S);
end if;
end;
end if;
-- Queue and block any converter exception that could be raised.
exception
when E : others =>
Context.Queue_Exception (E);
end;
end if;
end Encode_Begin;
procedure Encode_End (UI : in UIOutputLabel;
Context : in out Faces_Context'Class) is
Writer : Response_Writer_Access;
begin
if UI.Is_Rendered (Context) then
Writer := Context.Get_Response_Writer;
Writer.End_Element ("label");
end if;
end Encode_End;
-- ------------------------------
-- OutputFormat Component
-- ------------------------------
procedure Encode_Begin (UI : in UIOutputFormat;
Context : in out Faces_Context'Class) is
use ASF.Components.Core;
use ASF.Utils;
begin
if not UI.Is_Rendered (Context) then
return;
end if;
declare
Params : constant UIParameter_Access_Array := Get_Parameters (UI);
Values : Object_Array (Params'Range);
Result : Ada.Strings.Unbounded.Unbounded_String;
Fmt : constant String := EL.Objects.To_String (UI.Get_Value);
begin
-- Get the values associated with the parameters.
for I in Params'Range loop
Values (I) := Params (I).Get_Value (Context);
end loop;
Formats.Format (Fmt, Values, Result);
UI.Write_Output (Context => Context,
Value => To_String (Result));
end;
end Encode_Begin;
begin
Utils.Set_Text_Attributes (TEXT_ATTRIBUTE_NAMES);
Utils.Set_Text_Attributes (LABEL_ATTRIBUTE_NAMES);
Utils.Set_Interactive_Attributes (LABEL_ATTRIBUTE_NAMES);
end ASF.Components.Html.Text;
| 36.895349 | 98 | 0.544385 |
fb8c92f6e9f8f6aa60ef45c55a777a376234178f | 1,002 | ads | Ada | gdb/testsuite/gdb.ada/disc_arr_bound/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/disc_arr_bound/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/disc_arr_bound/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2015-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 System;
package Pck is
type Array_Type is array (Integer range <>) of Integer;
type Record_Type (N : Integer) is record
A : Array_Type (1 .. N);
end record;
function Get (N : Integer) return Record_Type;
procedure Do_Nothing (A : System.Address);
end Pck;
| 33.4 | 73 | 0.718563 |
122a40f519942d665cf4672f9b820c06b83a996c | 22,869 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_cg.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_cg.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_cg.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C G --
-- --
-- B o d y --
-- --
-- Copyright (C) 2010-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. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Einfo; use Einfo;
with Elists; use Elists;
with Exp_Dbug; use Exp_Dbug;
with Exp_Tss; use Exp_Tss;
with Lib; use Lib;
with Namet; use Namet;
with Opt; use Opt;
with Output; use Output;
with Sem_Aux; use Sem_Aux;
with Sem_Disp; use Sem_Disp;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with System; use System;
with Table;
with Uintp; use Uintp;
package body Exp_CG is
-- We duplicate here some declarations from packages Interfaces.C and
-- Interfaces.C_Streams because adding their dependence to the frontend
-- causes bootstrapping problems with old versions of the compiler.
subtype FILEs is System.Address;
-- Corresponds to the C type FILE*
subtype C_chars is System.Address;
-- Pointer to null-terminated array of characters
function fputs (Strng : C_chars; Stream : FILEs) return Integer;
pragma Import (C, fputs, "fputs");
-- Import the file stream associated with the "ci" output file. Done to
-- generate the output in the file created and left opened by routine
-- toplev.c before calling gnat1drv.
Callgraph_Info_File : FILEs;
pragma Import (C, Callgraph_Info_File);
package Call_Graph_Nodes is new Table.Table (
Table_Component_Type => Node_Id,
Table_Index_Type => Natural,
Table_Low_Bound => 1,
Table_Initial => 50,
Table_Increment => 100,
Table_Name => "Call_Graph_Nodes");
-- This table records nodes associated with dispatching calls and tagged
-- type declarations found in the main compilation unit. Used as an
-- auxiliary storage because the call-graph output requires fully qualified
-- names and they are not available until the backend is called.
function Is_Predefined_Dispatching_Operation (E : Entity_Id) return Boolean;
-- Determines if E is a predefined primitive operation.
-- Note: This routine should replace the routine with the same name that is
-- currently available in exp_disp because it extends its functionality to
-- handle fully qualified names. It's actually in Sem_Util. ???
function Slot_Number (Prim : Entity_Id) return Uint;
-- Returns the slot number associated with Prim. For predefined primitives
-- the slot is returned as a negative number.
procedure Write_Output (Str : String);
-- Used to print a line in the output file (this is used as the
-- argument for a call to Set_Special_Output in package Output).
procedure Write_Call_Info (Call : Node_Id);
-- Subsidiary of Generate_CG_Output that generates the output associated
-- with a dispatching call.
procedure Write_Type_Info (Typ : Entity_Id);
-- Subsidiary of Generate_CG_Output that generates the output associated
-- with a tagged type declaration.
------------------------
-- Generate_CG_Output --
------------------------
procedure Generate_CG_Output is
N : Node_Id;
begin
-- No output if the "ci" output file has not been previously opened
-- by toplev.c
if Callgraph_Info_File = Null_Address then
return;
end if;
-- Setup write routine, create the output file and generate the output
Set_Special_Output (Write_Output'Access);
for J in Call_Graph_Nodes.First .. Call_Graph_Nodes.Last loop
N := Call_Graph_Nodes.Table (J);
-- No action needed for subprogram calls removed by the expander
-- (for example, calls to ignored ghost entities).
if Nkind (N) = N_Null_Statement then
pragma Assert (Nkind (Original_Node (N)) in N_Subprogram_Call);
null;
elsif Nkind (N) in N_Subprogram_Call then
Write_Call_Info (N);
else pragma Assert (Nkind (N) = N_Defining_Identifier);
-- The type may be a private untagged type whose completion is
-- tagged, in which case we must use the full tagged view.
if not Is_Tagged_Type (N) and then Is_Private_Type (N) then
N := Full_View (N);
end if;
pragma Assert (Is_Tagged_Type (N));
Write_Type_Info (N);
end if;
end loop;
Cancel_Special_Output;
end Generate_CG_Output;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Call_Graph_Nodes.Init;
end Initialize;
-----------------------------------------
-- Is_Predefined_Dispatching_Operation --
-----------------------------------------
function Is_Predefined_Dispatching_Operation
(E : Entity_Id) return Boolean
is
function Homonym_Suffix_Length (E : Entity_Id) return Natural;
-- Returns the length of the homonym suffix corresponding to E.
-- Note: This routine relies on the functionality provided by routines
-- of Exp_Dbug. Further work needed here to decide if it should be
-- located in that package???
---------------------------
-- Homonym_Suffix_Length --
---------------------------
function Homonym_Suffix_Length (E : Entity_Id) return Natural is
Prefix_Length : constant := 2;
-- Length of prefix "__"
H : Entity_Id;
Nr : Nat := 1;
begin
if not Has_Homonym (E) then
return 0;
else
H := Homonym (E);
while Present (H) loop
if Scope (H) = Scope (E) then
Nr := Nr + 1;
end if;
H := Homonym (H);
end loop;
if Nr = 1 then
return 0;
-- Prefix "__" followed by number
else
declare
Result : Natural := Prefix_Length + 1;
begin
while Nr >= 10 loop
Result := Result + 1;
Nr := Nr / 10;
end loop;
return Result;
end;
end if;
end if;
end Homonym_Suffix_Length;
-- Local variables
Full_Name : constant String := Get_Name_String (Chars (E));
Suffix_Length : Natural;
TSS_Name : TSS_Name_Type;
-- Start of processing for Is_Predefined_Dispatching_Operation
begin
if not Is_Dispatching_Operation (E) then
return False;
end if;
-- Search for and strip suffix for body-nested package entities
Suffix_Length := Homonym_Suffix_Length (E);
for J in reverse Full_Name'First + 2 .. Full_Name'Last loop
if Full_Name (J) = 'X' then
-- Include the "X", "Xb", "Xn", ... in the part of the
-- suffix to be removed.
Suffix_Length := Suffix_Length + Full_Name'Last - J + 1;
exit;
end if;
exit when Full_Name (J) /= 'b' and then Full_Name (J) /= 'n';
end loop;
-- Most predefined primitives have internally generated names. Equality
-- must be treated differently; the predefined operation is recognized
-- as a homogeneous binary operator that returns Boolean.
if Full_Name'Length > TSS_Name_Type'Length then
TSS_Name :=
TSS_Name_Type
(Full_Name
(Full_Name'Last - TSS_Name'Length - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length));
if TSS_Name = TSS_Stream_Read
or else TSS_Name = TSS_Stream_Write
or else TSS_Name = TSS_Stream_Input
or else TSS_Name = TSS_Stream_Output
or else TSS_Name = TSS_Put_Image
or else TSS_Name = TSS_Deep_Adjust
or else TSS_Name = TSS_Deep_Finalize
then
return True;
elsif not Has_Fully_Qualified_Name (E) then
if Chars (E) in Name_uSize | Name_uAlignment | Name_uAssign
or else
(Chars (E) = Name_Op_Eq
and then Etype (First_Formal (E)) = Etype (Last_Formal (E)))
or else Is_Predefined_Interface_Primitive (E)
then
return True;
end if;
-- Handle fully qualified names
else
declare
type Names_Table is array (Positive range <>) of Name_Id;
Predef_Names_95 : constant Names_Table :=
(Name_uSize,
Name_uAlignment,
Name_Op_Eq,
Name_uAssign);
Predef_Names_05 : constant Names_Table :=
(Name_uDisp_Asynchronous_Select,
Name_uDisp_Conditional_Select,
Name_uDisp_Get_Prim_Op_Kind,
Name_uDisp_Get_Task_Id,
Name_uDisp_Requeue,
Name_uDisp_Timed_Select);
begin
for J in Predef_Names_95'Range loop
Get_Name_String (Predef_Names_95 (J));
-- The predefined primitive operations are identified by the
-- names "_size", "_alignment", etc. If we try a pattern
-- matching against this string, we can wrongly match other
-- primitive operations like "get_size". To avoid this, we
-- add the "__" scope separator, which can only prepend
-- predefined primitive operations because other primitive
-- operations can neither start with an underline nor
-- contain two consecutive underlines in its name.
if Full_Name'Last - Suffix_Length > Name_Len + 2
and then
Full_Name
(Full_Name'Last - Name_Len - 2 - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length) =
"__" & Name_Buffer (1 .. Name_Len)
then
-- For the equality operator the type of the two operands
-- must also match.
return Predef_Names_95 (J) /= Name_Op_Eq
or else
Etype (First_Formal (E)) = Etype (Last_Formal (E));
end if;
end loop;
if Ada_Version >= Ada_2005 then
for J in Predef_Names_05'Range loop
Get_Name_String (Predef_Names_05 (J));
if Full_Name'Last - Suffix_Length > Name_Len + 2
and then
Full_Name
(Full_Name'Last - Name_Len - 2 - Suffix_Length + 1
.. Full_Name'Last - Suffix_Length) =
"__" & Name_Buffer (1 .. Name_Len)
then
return True;
end if;
end loop;
end if;
end;
end if;
end if;
return False;
end Is_Predefined_Dispatching_Operation;
----------------------
-- Register_CG_Node --
----------------------
procedure Register_CG_Node (N : Node_Id) is
begin
if Nkind (N) in N_Subprogram_Call then
if Current_Scope = Main_Unit_Entity
or else Entity_Is_In_Main_Unit (Current_Scope)
then
-- Register a copy of the dispatching call node. Needed since the
-- node containing a dispatching call is rewritten by the
-- expander.
declare
Copy : constant Node_Id := New_Copy (N);
Par : Node_Id;
begin
-- Determine the enclosing scope to use when generating the
-- call graph. This must be done now to avoid problems with
-- control structures that may be rewritten during expansion.
Par := Parent (N);
while Nkind (Par) /= N_Subprogram_Body
and then Nkind (Parent (Par)) /= N_Compilation_Unit
loop
Par := Parent (Par);
pragma Assert (Present (Par));
end loop;
Set_Parent (Copy, Par);
Call_Graph_Nodes.Append (Copy);
end;
end if;
else pragma Assert (Nkind (N) = N_Defining_Identifier);
if Entity_Is_In_Main_Unit (N) then
Call_Graph_Nodes.Append (N);
end if;
end if;
end Register_CG_Node;
-----------------
-- Slot_Number --
-----------------
function Slot_Number (Prim : Entity_Id) return Uint is
E : constant Entity_Id := Ultimate_Alias (Prim);
begin
if Is_Predefined_Dispatching_Operation (E) then
return -DT_Position (E);
else
return DT_Position (E);
end if;
end Slot_Number;
------------------
-- Write_Output --
------------------
procedure Write_Output (Str : String) is
Nul : constant Character := Character'First;
Line : String (Str'First .. Str'Last + 1);
Errno : Integer;
begin
-- Add the null character to the string as required by fputs
Line := Str & Nul;
Errno := fputs (Line'Address, Callgraph_Info_File);
pragma Assert (Errno >= 0);
end Write_Output;
---------------------
-- Write_Call_Info --
---------------------
procedure Write_Call_Info (Call : Node_Id) is
Ctrl_Arg : constant Node_Id := Controlling_Argument (Call);
Ctrl_Typ : constant Entity_Id := Base_Type (Etype (Ctrl_Arg));
Prim : constant Entity_Id := Entity (Sinfo.Name (Call));
P : constant Node_Id := Parent (Call);
begin
Write_Str ("edge: { sourcename: ");
Write_Char ('"');
-- The parent node is the construct that contains the call: subprogram
-- body or library-level package. Display the qualified name of the
-- entity of the construct. For a subprogram, it is the entity of the
-- spec, which carries a homonym counter when it is overloaded.
if Nkind (P) = N_Subprogram_Body
and then not Acts_As_Spec (P)
then
Get_External_Name (Corresponding_Spec (P));
else
Get_External_Name (Defining_Entity (P));
end if;
Write_Str (Name_Buffer (1 .. Name_Len));
if Nkind (P) = N_Package_Declaration then
Write_Str ("___elabs");
elsif Nkind (P) = N_Package_Body then
Write_Str ("___elabb");
end if;
Write_Char ('"');
Write_Eol;
-- The targetname is a triple:
-- N: the index in a vtable used for dispatch
-- V: the type who's vtable is used
-- S: the static type of the expression
Write_Str (" targetname: ");
Write_Char ('"');
pragma Assert (No (Interface_Alias (Prim)));
-- The check on Is_Ancestor is done here to avoid problems with
-- renamings of primitives. For example:
-- type Root is tagged ...
-- procedure Base (Obj : Root);
-- procedure Base2 (Obj : Root) renames Base;
if Present (Alias (Prim))
and then
Is_Ancestor
(Find_Dispatching_Type (Ultimate_Alias (Prim)),
Root_Type (Ctrl_Typ),
Use_Full_View => True)
then
-- This is a special case in which we generate in the ci file the
-- slot number of the renaming primitive (i.e. Base2) but instead of
-- generating the name of this renaming entity we reference directly
-- the renamed entity (i.e. Base).
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
Write_Name
(Chars (Find_Dispatching_Type (Ultimate_Alias (Prim))));
else
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
Write_Name (Chars (Root_Type (Ctrl_Typ)));
end if;
Write_Char (',');
Write_Name (Chars (Root_Type (Ctrl_Typ)));
Write_Char ('"');
Write_Eol;
Write_Str (" label: ");
Write_Char ('"');
Write_Location (Sloc (Call));
Write_Char ('"');
Write_Eol;
Write_Char ('}');
Write_Eol;
end Write_Call_Info;
---------------------
-- Write_Type_Info --
---------------------
procedure Write_Type_Info (Typ : Entity_Id) is
Elmt : Elmt_Id;
Prim : Node_Id;
Parent_Typ : Entity_Id;
Separator_Needed : Boolean := False;
begin
-- Initialize Parent_Typ handling private types
Parent_Typ := Etype (Typ);
if Present (Full_View (Parent_Typ)) then
Parent_Typ := Full_View (Parent_Typ);
end if;
Write_Str ("class {");
Write_Eol;
Write_Str (" classname: ");
Write_Char ('"');
Write_Name (Chars (Typ));
Write_Char ('"');
Write_Eol;
Write_Str (" label: ");
Write_Char ('"');
Write_Name (Chars (Typ));
Write_Char ('\');
Write_Location (Sloc (Typ));
Write_Char ('"');
Write_Eol;
if Parent_Typ /= Typ then
Write_Str (" parent: ");
Write_Char ('"');
Write_Name (Chars (Parent_Typ));
-- Note: Einfo prefix not needed if this routine is moved to
-- exp_disp???
if Present (Einfo.Interfaces (Typ))
and then not Is_Empty_Elmt_List (Einfo.Interfaces (Typ))
then
Elmt := First_Elmt (Einfo.Interfaces (Typ));
while Present (Elmt) loop
Write_Str (", ");
Write_Name (Chars (Node (Elmt)));
Next_Elmt (Elmt);
end loop;
end if;
Write_Char ('"');
Write_Eol;
end if;
Write_Str (" virtuals: ");
Write_Char ('"');
Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Elmt) loop
Prim := Node (Elmt);
-- Skip internal entities associated with overridden interface
-- primitives, and also inherited primitives.
if Present (Interface_Alias (Prim))
or else
(Present (Alias (Prim))
and then Find_Dispatching_Type (Prim) /=
Find_Dispatching_Type (Alias (Prim)))
then
goto Continue;
end if;
-- Do not generate separator for output of first primitive
if Separator_Needed then
Write_Str ("\n");
Write_Eol;
Write_Str (" ");
else
Separator_Needed := True;
end if;
Write_Int (UI_To_Int (Slot_Number (Prim)));
Write_Char (':');
-- Handle renamed primitives
if Present (Alias (Prim)) then
Write_Name (Chars (Ultimate_Alias (Prim)));
else
Write_Name (Chars (Prim));
end if;
-- Display overriding of parent primitives
if Present (Overridden_Operation (Prim))
and then
Is_Ancestor
(Find_Dispatching_Type (Overridden_Operation (Prim)), Typ,
Use_Full_View => True)
then
Write_Char (',');
Write_Int
(UI_To_Int (Slot_Number (Overridden_Operation (Prim))));
Write_Char (':');
Write_Name
(Chars (Find_Dispatching_Type (Overridden_Operation (Prim))));
end if;
-- Display overriding of interface primitives
if Has_Interfaces (Typ) then
declare
Prim_Elmt : Elmt_Id;
Prim_Op : Node_Id;
Int_Alias : Entity_Id;
begin
Prim_Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Prim_Elmt) loop
Prim_Op := Node (Prim_Elmt);
Int_Alias := Interface_Alias (Prim_Op);
if Present (Int_Alias)
and then
not Is_Ancestor (Find_Dispatching_Type (Int_Alias), Typ,
Use_Full_View => True)
and then (Alias (Prim_Op)) = Prim
then
Write_Char (',');
Write_Int (UI_To_Int (Slot_Number (Int_Alias)));
Write_Char (':');
Write_Name (Chars (Find_Dispatching_Type (Int_Alias)));
end if;
Next_Elmt (Prim_Elmt);
end loop;
end;
end if;
<<Continue>>
Next_Elmt (Elmt);
end loop;
Write_Char ('"');
Write_Eol;
Write_Char ('}');
Write_Eol;
end Write_Type_Info;
end Exp_CG;
| 33.680412 | 79 | 0.532249 |
06d04422764f843bbb3106b39e7a256d4102510e | 4,975 | adb | Ada | components/src/keyboard/bbq10kbd.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | components/src/keyboard/bbq10kbd.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | components/src/keyboard/bbq10kbd.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 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 HAL; use HAL;
with HAL.I2C; use HAL.I2C;
package body BBQ10KBD is
----------
-- Read --
----------
procedure Read (This : in out BBQ10KBD_Device;
Reg : HAL.UInt8;
Data : out HAL.I2C.I2C_Data)
is
Status : I2C_Status;
begin
This.Port.Mem_Read (Device_Addr,
UInt16 (Reg),
Memory_Size_8b,
Data,
Status);
if Status /= Ok then
raise Program_Error;
end if;
end Read;
-----------
-- Write --
-----------
procedure Write (This : in out BBQ10KBD_Device;
Reg : HAL.UInt8;
Data : HAL.I2C.I2C_Data)
is
Status : I2C_Status;
begin
This.Port.Mem_Write (Device_Addr,
UInt16 (Reg),
Memory_Size_8b,
Data,
Status);
if Status /= Ok then
raise Program_Error;
end if;
end Write;
-------------
-- Version --
-------------
function Version (This : in out BBQ10KBD_Device) return HAL.UInt8 is
Data : I2C_Data (0 .. 0);
begin
This.Read (REG_VER, Data);
return Data (Data'First);
end Version;
------------------
-- Key_FIFO_Pop --
------------------
function Key_FIFO_Pop (This : in out BBQ10KBD_Device) return Key_State is
Data : I2C_Data (0 .. 1);
begin
This.Read (REG_FIF, Data);
return State : Key_State do
case Data (Data'First) is
when 1 => State.Kind := Pressed;
when 2 => State.Kind := Held_Pressed;
when 3 => State.Kind := Released;
when others => State.Kind := Error;
end case;
State.Code := Data (Data'Last);
end return;
end Key_FIFO_Pop;
------------
-- Status --
------------
function Status (This : in out BBQ10KBD_Device) return KBD_Status is
Data : I2C_Data (0 .. 0);
D : UInt8 renames Data (Data'First);
begin
This.Read (REG_KEY, Data);
return Stat : KBD_Status do
Stat.Numlock := (D and 1) /= 0;
Stat.Capslock := (D and 1) /= 0;
Stat.Key_Count := UInt5 (D and 16#1F#);
end return;
end Status;
-------------------
-- Set_Backlight --
-------------------
procedure Set_Backlight (This : in out BBQ10KBD_Device; Lvl : HAL.UInt8) is
begin
This.Write (REG_BKL, (0 => Lvl));
end Set_Backlight;
end BBQ10KBD;
| 36.851852 | 78 | 0.486834 |
0be62f037cd8d0bdab4a32150ca26426ba212ced | 2,519 | ads | Ada | src/natools-web-simple_pages-markdown_pages.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | 1 | 2020-09-10T10:14:35.000Z | 2020-09-10T10:14:35.000Z | src/natools-web-simple_pages-markdown_pages.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | null | null | null | src/natools-web-simple_pages-markdown_pages.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | 1 | 2020-01-06T14:16:55.000Z | 2020-01-06T14:16:55.000Z | ------------------------------------------------------------------------------
-- Copyright (c) 2015-2019, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Web.Simple_Pages.Markdown_Pages extends simple pages with a new --
-- file format, starting with the usual simple-page S-expression embeded in --
-- a list, followed by markdown text which is rendered as the element --
-- named "markdown-text". --
------------------------------------------------------------------------------
with Natools.S_Expressions;
with Natools.Web.Sites;
private with Ada.Calendar;
private with Natools.S_Expressions.Atom_Refs;
package Natools.Web.Simple_Pages.Markdown_Pages is
type Loader is new Sites.Page_Loader with private;
overriding procedure Load
(Object : in out Loader;
Builder : in out Sites.Site_Builder;
Path : in S_Expressions.Atom);
not overriding procedure Force_Load
(Object : in out Loader;
Builder : in out Sites.Site_Builder;
Path : in S_Expressions.Atom);
function Create (File : in S_Expressions.Atom)
return Sites.Page_Loader'Class;
private
type Loader is new Sites.Page_Loader with record
File_Path : S_Expressions.Atom_Refs.Immutable_Reference;
File_Time : Ada.Calendar.Time;
Cache : Page_Ref;
end record;
end Natools.Web.Simple_Pages.Markdown_Pages;
| 44.982143 | 78 | 0.564113 |
0bfdbcea0ef48b26cdba274c7ea4ae8c6278037c | 769 | ads | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/int_deref/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/int_deref/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/int_deref/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
Watch : Integer := 4874;
end Pck;
| 36.619048 | 73 | 0.730819 |
1232d76664d72f2a85e0f582f21fbc69044323c2 | 3,237 | adb | Ada | src/ast_printers.adb | aeszter/lox-spark | 3ec66f9620c41884463bb33a1b140d8bd7797bec | [
"MIT"
] | 6 | 2017-02-11T05:57:22.000Z | 2021-05-12T22:20:26.000Z | src/ast_printers.adb | aeszter/lox-spark | 3ec66f9620c41884463bb33a1b140d8bd7797bec | [
"MIT"
] | null | null | null | src/ast_printers.adb | aeszter/lox-spark | 3ec66f9620c41884463bb33a1b140d8bd7797bec | [
"MIT"
] | 2 | 2017-02-28T12:04:23.000Z | 2017-03-08T19:14:23.000Z | package body Ast_Printers is
function Print (The_Expr : Expr'Class) return String is
V : Ast_Printer;
begin
Accept_Visitor (The_Expr, V);
return Print (V);
end Print;
function Print (V : Ast_Printer) return String is
begin
return To_String (V.Image);
end Print;
function Print (The_Expr : Binary) return String is
begin
return "(" & To_String (The_Expr.Get_operator.Lexeme) & " "
& Print (Retrieve (The_Expr.Get_left)) & " "
& Print (Retrieve (The_Expr.Get_right)) & ")";
end Print;
function Print (The_Expr : Grouping) return String is
begin
return "(group " & Print (Retrieve (The_Expr.Get_expression)) & ")";
end Print;
function Print (The_Expr : Float_Literal) return String is
begin
return Float'Image (The_Expr.Get_value);
end Print;
function Print (The_Expr : Num_Literal) return String is
begin
return Integer'Image (The_Expr.Get_value);
end Print;
function Print (The_Expr : Str_Literal) return String is
begin
return L_Strings.To_String (The_Expr.Get_value);
end Print;
function Print (The_Expr : Unary) return String is
begin
return "(" & To_String (The_Expr.Get_operator.Lexeme) & " " & Print (Retrieve (The_Expr.Get_right)) & ")";
end Print;
generic
type Expr_Type (<>) is abstract new Expr with private;
with function Print (The_Expr : Expr_Type) return String is <>;
procedure Visit_Expr (V : in out Ast_Printer; The_Expr : Expr_Type);
procedure Visit_Expr (V : in out Ast_Printer; The_Expr : Expr_Type) is
function Local_Print (E : Expr_Type) return String
renames Print; -- resolve ambiguity
Image : constant String := Local_Print (The_Expr);
begin
V.Image := To_Bounded_String (Image);
end Visit_Expr;
procedure Do_Visit_Binary_Expr is new Visit_Expr (Binary);
overriding
procedure visit_Binary_Expr (Self : in out Ast_Printer; The_Expr : Binary)
renames Do_Visit_Binary_Expr;
procedure Do_Visit_Grouping_Expr is new Visit_Expr (Grouping);
overriding
procedure visit_Grouping_Expr (Self : in out Ast_Printer; The_Expr : Grouping)
renames Do_Visit_Grouping_Expr;
procedure Do_Visit_Float_Literal_Expr is new Visit_Expr (Float_Literal);
overriding
procedure visit_Float_Literal_Expr (Self : in out Ast_Printer; The_Expr : Float_Literal)
renames Do_Visit_Float_Literal_Expr;
procedure Do_Visit_Num_Literal_Expr is new Visit_Expr (Num_Literal);
overriding
procedure visit_Num_Literal_Expr (Self : in out Ast_Printer; The_Expr : Num_Literal)
renames Do_Visit_Num_Literal_Expr;
procedure Do_Visit_str_literal_Expr is new Visit_Expr (Str_Literal);
overriding
procedure visit_Str_Literal_Expr (Self : in out Ast_Printer; The_Expr : Str_Literal)
renames Do_Visit_str_literal_Expr;
procedure Do_Visit_unary_Expr is new Visit_Expr (Unary);
overriding
procedure visit_Unary_Expr (Self : in out Ast_Printer; The_Expr : Unary)
renames Do_Visit_unary_Expr;
end Ast_Printers;
| 33.71875 | 112 | 0.683967 |
dc60699d5ff5814513d863fd06cebf9ebf381c3a | 1,628 | ads | Ada | src/babel-base.ads | stcarrez/babel | 727461babd0305344427bf8a56cdae2b68d08caf | [
"Apache-2.0"
] | 1 | 2015-08-05T14:26:52.000Z | 2015-08-05T14:26:52.000Z | src/babel-base.ads | stcarrez/babel | 727461babd0305344427bf8a56cdae2b68d08caf | [
"Apache-2.0"
] | null | null | null | src/babel-base.ads | stcarrez/babel | 727461babd0305344427bf8a56cdae2b68d08caf | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- babel-base -- Database for files
-- Copyright (C) 2014 Stephane.Carrez
-- Written by Stephane.Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Finalization;
with ADO;
with Babel.Files;
package Babel.Base is
type Database is abstract new Ada.Finalization.Limited_Controlled with private;
type Database_Access is access all Database'Class;
-- Insert the file in the database.
procedure Insert (Into : in out Database;
File : in Babel.Files.File_Type) is abstract;
procedure Iterate (From : in Database;
Process : not null access
procedure (File : in Babel.Files.File_Type)) is abstract;
procedure Copy (Into : in out Database'Class;
From : in Database'Class);
private
type Database is abstract new Ada.Finalization.Limited_Controlled with record
Name : Integer;
end record;
end Babel.Base;
| 36.177778 | 82 | 0.633907 |
a1445cebdcb386f8e4b2e3eac9be8953d781c2bc | 834 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/entry_queues2.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/entry_queues2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/entry_queues2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
procedure Entry_Queues2 is
F1 : Integer := 17;
generic
type T is limited private;
procedure Check;
procedure Check is
begin
declare
type Poe is new T;
begin
declare
type Arr is array (1 .. 2) of Poe;
X : Arr;
pragma Unreferenced (X);
begin
null;
end;
end;
end;
begin
declare
protected type Poe (D3 : Integer := F1) is
entry E (D3 .. F1); -- F1 evaluated
end Poe;
protected body Poe is
entry E (for I in D3 .. F1) when True is
begin
null;
end E;
end Poe;
procedure Chk is new Check (Poe);
begin
Chk;
end;
end;
| 18.130435 | 52 | 0.447242 |
a169606307c8b1d9848832f448b5f9d109b7d619 | 3,614 | ads | Ada | source/amf/utp/amf-utp-finish_actions-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-utp-finish_actions-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-utp-finish_actions-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.Utp.Finish_Actions.Hash is
new AMF.Elements.Generic_Hash (Utp_Finish_Action, Utp_Finish_Action_Access);
| 72.28 | 78 | 0.401771 |
c553e25efc98d963efa020273553e80ae20e5a49 | 5,629 | ads | Ada | src/util-log-loggers.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-log-loggers.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-log-loggers.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- Logs -- Utility Log Package
-- Copyright (C) 2006, 2008, 2009, 2011 Free Software Foundation, Inc.
-- 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.Exceptions;
with Ada.Strings.Unbounded;
with Util.Log.Appenders;
with Util.Properties;
with Ada.Finalization;
package Util.Log.Loggers is
use Ada.Exceptions;
use Ada.Strings.Unbounded;
-- The logger identifies and configures the log produced
-- by a component that uses it. The logger has a name
-- which can be printed in the log outputs. The logger instance
-- contains a log level which can be used to control the level of
-- logs.
type Logger is tagged limited private;
type Logger_Access is access constant Logger;
-- Create a logger with the given name.
function Create (Name : in String) return Logger;
-- Create a logger with the given name and use the specified level.
function Create (Name : in String;
Level : in Level_Type) return Logger;
-- Initialize the logger and create a logger with the given name.
function Create (Name : in String;
Config : in String) return Logger;
-- Change the log level
procedure Set_Level (Log : in out Logger;
Level : in Level_Type);
-- Get the log level.
function Get_Level (Log : in Logger) return Level_Type;
-- Get the log level name.
function Get_Level_Name (Log : in Logger) return String;
procedure Print (Log : in Logger;
Level : in Level_Type;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "";
Arg4 : in String := "");
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "");
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in String := "";
Arg3 : in String := "");
procedure Debug (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in Unbounded_String;
Arg3 : in String := "");
procedure Info (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "");
procedure Info (Log : in Logger'Class;
Message : in String;
Arg1 : in Unbounded_String;
Arg2 : in String := "";
Arg3 : in String := "");
procedure Warn (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "");
procedure Error (Log : in Logger'Class;
Message : in String;
Arg1 : in String := "";
Arg2 : in String := "";
Arg3 : in String := "");
procedure Error (Log : in Logger'Class;
Message : in String;
E : in Exception_Occurrence;
Trace : in Boolean := False);
-- Set the appender that will handle the log events
procedure Set_Appender (Log : in out Logger'Class;
Appender : in Util.Log.Appenders.Appender_Access);
-- Initialize the log environment with the property file.
procedure Initialize (Name : in String);
-- Initialize the log environment with the properties.
procedure Initialize (Properties : in Util.Properties.Manager);
type Logger_Info (<>) is limited private;
-- Get the logger name.
function Get_Logger_Name (Log : in Logger_Info) return String;
-- Return a printable traceback that correspond to the exception.
function Traceback (E : in Exception_Occurrence) return String;
private
type Logger_Info_Access is access all Logger_Info;
type Logger_Info (Len : Positive) is record
Next_Logger : Logger_Info_Access;
Prev_Logger : Logger_Info_Access;
Level : Level_Type := INFO_LEVEL;
Appender : Util.Log.Appenders.Appender_Access;
Name : String (1 .. Len);
end record;
type Logger is new Ada.Finalization.Limited_Controlled with record
Instance : Logger_Info_Access;
end record;
-- Finalize the logger and flush the associated appender
overriding
procedure Finalize (Log : in out Logger);
end Util.Log.Loggers;
| 37.032895 | 77 | 0.55676 |
4d0a58f8520014bdbc4c2a9134725c0232df732b | 1,126 | adb | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/null_array/foo.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/null_array/foo.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/null_array/foo.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
type Table is array (Integer range <>) of Integer;
type Matrix is array (1 .. 10, 1 .. 0) of Character;
type Wrapper is record
M : Matrix;
end record;
My_Table : Table (Ident (10) .. Ident (1));
My_Matrix : Wrapper := (M => (others => (others => 'a')));
begin
Do_Nothing (My_Table'Address); -- START
Do_Nothing (My_Matrix'Address);
end Foo;
| 35.1875 | 73 | 0.695382 |
1206ae7424692c003504b89b7b81767d7ee169eb | 912 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/arrayparam/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/arrayparam/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/arrayparam/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2008-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
My_String : constant String := "Hello World";
begin
First := ASCII.NUL;
Last := ASCII.NUL;
Length := -1;
Call_Me (My_String); -- STOP
end Foo;
| 33.777778 | 73 | 0.713816 |
5046d16e3a6e23d2d072b627c7f2b08af21f5511 | 354 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt25.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/opt25.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt25.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-O" }
with Opt25_Pkg1;
with Opt25_Pkg2;
procedure Opt25 (B1, B2 : in out Boolean) is
package Local_Pack_Instance is new Opt25_Pkg1 (Boolean, True);
package Local_Stack is new Opt25_Pkg2 (Integer, 0);
S : Local_Stack.Stack := Local_Stack.Default_Stack;
begin
Local_Pack_Instance.Swap (B1, B2);
end;
| 19.666667 | 65 | 0.706215 |
df5fdeb57c87e119897a0feb57ee936d78a40168 | 305 | ads | Ada | sources/driver/load_library.ads | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | 4 | 2020-06-17T16:45:16.000Z | 2022-01-19T22:55:48.000Z | sources/driver/load_library.ads | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | null | null | null | sources/driver/load_library.ads | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2020 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
with League.Strings;
procedure Load_Library
(Name : League.Strings.Universal_String;
Error : out League.Strings.Universal_String);
| 27.727273 | 64 | 0.596721 |
3129dfd76a742b15d7ab4fa274db2e7306d8edf3 | 14,064 | adb | Ada | Ada95/samples/sample-explanation.adb | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | Ada95/samples/sample-explanation.adb | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | Ada95/samples/sample-explanation.adb | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Explanation --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998-2006,2009 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.21 $
-- $Date: 2009/12/26 17:38:58 $
-- Binding Version 01.00
------------------------------------------------------------------------------
-- Poor mans help system. This scans a sequential file for key lines and
-- then reads the lines up to the next key. Those lines are presented in
-- a window as help or explanation.
--
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Unchecked_Deallocation;
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels;
with Sample.Keyboard_Handler; use Sample.Keyboard_Handler;
with Sample.Manifest; use Sample.Manifest;
with Sample.Function_Key_Setting; use Sample.Function_Key_Setting;
with Sample.Helpers; use Sample.Helpers;
package body Sample.Explanation is
Help_Keys : constant String := "HELPKEYS";
In_Help : constant String := "INHELP";
File_Name : constant String := "explain.msg";
F : File_Type;
type Help_Line;
type Help_Line_Access is access Help_Line;
pragma Controlled (Help_Line_Access);
type String_Access is access String;
pragma Controlled (String_Access);
type Help_Line is
record
Prev, Next : Help_Line_Access;
Line : String_Access;
end record;
procedure Explain (Key : String;
Win : Window);
procedure Release_String is
new Ada.Unchecked_Deallocation (String,
String_Access);
procedure Release_Help_Line is
new Ada.Unchecked_Deallocation (Help_Line,
Help_Line_Access);
function Search (Key : String) return Help_Line_Access;
procedure Release_Help (Root : in out Help_Line_Access);
procedure Explain (Key : String)
is
begin
Explain (Key, Null_Window);
end Explain;
procedure Explain (Key : String;
Win : Window)
is
-- Retrieve the text associated with this key and display it in this
-- window. If no window argument is passed, the routine will create
-- a temporary window and use it.
function Filter_Key return Real_Key_Code;
procedure Unknown_Key;
procedure Redo;
procedure To_Window (C : in out Help_Line_Access;
More : in out Boolean);
Frame : Window := Null_Window;
W : Window := Win;
K : Real_Key_Code;
P : Panel;
Height : Line_Count;
Width : Column_Count;
Help : Help_Line_Access := Search (Key);
Current : Help_Line_Access;
Top_Line : Help_Line_Access;
Has_More : Boolean := True;
procedure Unknown_Key
is
begin
Add (W, "Help message with ID ");
Add (W, Key);
Add (W, " not found.");
Add (W, Character'Val (10));
Add (W, "Press the Function key labelled 'Quit' key to continue.");
end Unknown_Key;
procedure Redo
is
H : Help_Line_Access := Top_Line;
begin
if Top_Line /= null then
for L in 0 .. (Height - 1) loop
Add (W, L, 0, H.Line.all);
exit when H.Next = null;
H := H.Next;
end loop;
else
Unknown_Key;
end if;
end Redo;
function Filter_Key return Real_Key_Code
is
K : Real_Key_Code;
begin
loop
K := Get_Key (W);
if K in Special_Key_Code'Range then
case K is
when HELP_CODE =>
if not Find_Context (In_Help) then
Push_Environment (In_Help, False);
Explain (In_Help, W);
Pop_Environment;
Redo;
end if;
when EXPLAIN_CODE =>
if not Find_Context (Help_Keys) then
Push_Environment (Help_Keys, False);
Explain (Help_Keys, W);
Pop_Environment;
Redo;
end if;
when others => exit;
end case;
else
exit;
end if;
end loop;
return K;
end Filter_Key;
procedure To_Window (C : in out Help_Line_Access;
More : in out Boolean)
is
L : Line_Position := 0;
begin
loop
Add (W, L, 0, C.Line.all);
L := L + 1;
exit when C.Next = null or else L = Height;
C := C.Next;
end loop;
if C.Next /= null then
pragma Assert (L = Height);
More := True;
else
More := False;
end if;
end To_Window;
begin
if W = Null_Window then
Push_Environment ("HELP");
Default_Labels;
Frame := New_Window (Lines - 2, Columns, 0, 0);
if Has_Colors then
Set_Background (Win => Frame,
Ch => (Ch => ' ',
Color => Help_Color,
Attr => Normal_Video));
Set_Character_Attributes (Win => Frame,
Attr => Normal_Video,
Color => Help_Color);
Erase (Frame);
end if;
Box (Frame);
Set_Character_Attributes (Frame, (Reverse_Video => True,
others => False));
Add (Frame, Lines - 3, 2, "Cursor Up/Down scrolls");
Set_Character_Attributes (Frame); -- Back to default.
Window_Title (Frame, "Explanation");
W := Derived_Window (Frame, Lines - 4, Columns - 2, 1, 1);
Refresh_Without_Update (Frame);
Get_Size (W, Height, Width);
Set_Meta_Mode (W);
Set_KeyPad_Mode (W);
Allow_Scrolling (W, True);
Set_Echo_Mode (False);
P := Create (Frame);
Top (P);
Update_Panels;
else
Clear (W);
Refresh_Without_Update (W);
end if;
Current := Help; Top_Line := Help;
if null = Help then
Unknown_Key;
loop
K := Filter_Key;
exit when K = QUIT_CODE;
end loop;
else
To_Window (Current, Has_More);
if Has_More then
-- This means there are more lines available, so we have to go
-- into a scroll manager.
loop
K := Filter_Key;
if K in Special_Key_Code'Range then
case K is
when Key_Cursor_Down =>
if Current.Next /= null then
Move_Cursor (W, Height - 1, 0);
Scroll (W, 1);
Current := Current.Next;
Top_Line := Top_Line.Next;
Add (W, Current.Line.all);
end if;
when Key_Cursor_Up =>
if Top_Line.Prev /= null then
Move_Cursor (W, 0, 0);
Scroll (W, -1);
Top_Line := Top_Line.Prev;
Current := Current.Prev;
Add (W, Top_Line.Line.all);
end if;
when QUIT_CODE => exit;
when others => null;
end case;
end if;
end loop;
else
loop
K := Filter_Key;
exit when K = QUIT_CODE;
end loop;
end if;
end if;
Clear (W);
if Frame /= Null_Window then
Clear (Frame);
Delete (P);
Delete (W);
Delete (Frame);
Pop_Environment;
end if;
Update_Panels;
Update_Screen;
Release_Help (Help);
end Explain;
function Search (Key : String) return Help_Line_Access
is
Last : Natural;
Buffer : String (1 .. 256);
Root : Help_Line_Access := null;
Current : Help_Line_Access;
Tail : Help_Line_Access := null;
function Next_Line return Boolean;
function Next_Line return Boolean
is
H_End : constant String := "#END";
begin
Get_Line (F, Buffer, Last);
if Last = H_End'Length and then H_End = Buffer (1 .. Last) then
return False;
else
return True;
end if;
end Next_Line;
begin
Reset (F);
Outer :
loop
exit Outer when not Next_Line;
if Last = (1 + Key'Length) and then Key = Buffer (2 .. Last)
and then Buffer (1) = '#' then
loop
exit when not Next_Line;
exit when Buffer (1) = '#';
Current := new Help_Line'(null, null,
new String'(Buffer (1 .. Last)));
if Tail = null then
Release_Help (Root);
Root := Current;
else
Tail.Next := Current;
Current.Prev := Tail;
end if;
Tail := Current;
end loop;
exit Outer;
end if;
end loop Outer;
return Root;
end Search;
procedure Release_Help (Root : in out Help_Line_Access)
is
Next : Help_Line_Access;
begin
loop
exit when Root = null;
Next := Root.Next;
Release_String (Root.Line);
Release_Help_Line (Root);
Root := Next;
end loop;
end Release_Help;
procedure Explain_Context
is
begin
Explain (Context);
end Explain_Context;
procedure Notepad (Key : String)
is
H : constant Help_Line_Access := Search (Key);
T : Help_Line_Access := H;
N : Line_Count := 1;
L : Line_Position := 0;
W : Window;
P : Panel;
begin
if H /= null then
loop
T := T.Next;
exit when T = null;
N := N + 1;
end loop;
W := New_Window (N + 2, Columns, Lines - N - 2, 0);
if Has_Colors then
Set_Background (Win => W,
Ch => (Ch => ' ',
Color => Notepad_Color,
Attr => Normal_Video));
Set_Character_Attributes (Win => W,
Attr => Normal_Video,
Color => Notepad_Color);
Erase (W);
end if;
Box (W);
Window_Title (W, "Notepad");
P := New_Panel (W);
T := H;
loop
Add (W, L + 1, 1, T.Line.all, Integer (Columns - 2));
L := L + 1;
T := T.Next;
exit when T = null;
end loop;
T := H;
Release_Help (T);
Refresh_Without_Update (W);
Notepad_To_Context (P);
end if;
end Notepad;
begin
Open (F, In_File, File_Name);
end Sample.Explanation;
| 34.386308 | 78 | 0.468999 |
0bcfd4fb21bb46c122dc89b90c548cc938ec45b3 | 14,343 | adb | Ada | source/league/matreshka-internals-calendars-formatting-iso_8601.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/matreshka-internals-calendars-formatting-iso_8601.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/matreshka-internals-calendars-formatting-iso_8601.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 © 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 Matreshka.Internals.Calendars.Gregorian;
package body Matreshka.Internals.Calendars.Formatting.ISO_8601 is
procedure Append
(Result : in out League.Strings.Universal_String;
Value : Natural;
Padding : Positive);
------------
-- Append --
------------
procedure Append
(Result : in out League.Strings.Universal_String;
Value : Natural;
Padding : Positive)
is
Image : constant Wide_Wide_String := Integer'Wide_Wide_Image (Value);
begin
for J in 1 .. Padding - Image'Length + 1 loop
Result.Append ('0');
end loop;
Result.Append (Image (Image'First + 1 .. Image'Last));
end Append;
----------------------------
-- Append_Abbreviated_Era --
----------------------------
overriding procedure Append_Abbreviated_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Era_Padding) is
begin
-- XXX Not yet implemented.
null;
end Append_Abbreviated_Era;
------------------------------
-- Append_Abbreviated_Month --
------------------------------
overriding procedure Append_Abbreviated_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean)
is
pragma Unreferenced (Self, Is_Stand_Alone);
Index : constant Gregorian.Month_Number
:= Calendars.Gregorian.Month (Date);
Names : constant array (Gregorian.Month_Number) of
Wide_Wide_String (1 .. 3)
:= ("Jan", "Feb", "Mar", "Apr", "May", "Jun",
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec");
begin
-- XXX Is_Stand_Alone Not yet implemented.
Output.Append (Names (Index));
end Append_Abbreviated_Month;
--------------------------------
-- Append_Abbreviated_Quarter --
--------------------------------
overriding procedure Append_Abbreviated_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Abbreviated_Quarter;
-------------------------------
-- Append_Chinese_Leap_Month --
-------------------------------
overriding procedure Append_Chinese_Leap_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number) is
begin
-- XXX Not yet implemented.
null;
end Append_Chinese_Leap_Month;
-------------------------
-- Append_Day_Of_Month --
-------------------------
overriding procedure Append_Day_Of_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
Append
(Output,
Matreshka.Internals.Calendars.Gregorian.Day (Date),
Padding);
end Append_Day_Of_Month;
---------------------------------
-- Append_Day_Of_Week_In_Month --
---------------------------------
overriding procedure Append_Day_Of_Week_In_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number) is
begin
-- XXX Not yet implemented.
null;
end Append_Day_Of_Week_In_Month;
------------------------
-- Append_Day_Of_Year --
------------------------
overriding procedure Append_Day_Of_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
-- XXX Not yet implemented.
null;
end Append_Day_Of_Year;
--------------------------
-- Append_Extended_Year --
--------------------------
overriding procedure Append_Extended_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
-- XXX Not yet implemented.
null;
end Append_Extended_Year;
-----------------------------
-- Append_Full_Day_Of_Week --
-----------------------------
overriding procedure Append_Full_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Full_Day_Of_Week;
-----------------------
-- Append_Full_Month --
-----------------------
overriding procedure Append_Full_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Full_Month;
-------------------------
-- Append_Full_Quarter --
-------------------------
overriding procedure Append_Full_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Full_Quarter;
-----------------------
-- Append_Julian_Day --
-----------------------
overriding procedure Append_Julian_Day
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
-- XXX Not yet implemented.
null;
end Append_Julian_Day;
---------------------
-- Append_Long_Era --
---------------------
overriding procedure Append_Long_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number) is
begin
-- XXX Not yet implemented.
null;
end Append_Long_Era;
-------------------------------
-- Append_Narrow_Day_Of_Week --
-------------------------------
overriding procedure Append_Narrow_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Narrow_Day_Of_Week;
-----------------------
-- Append_Narrow_Era --
-----------------------
overriding procedure Append_Narrow_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number) is
begin
-- XXX Not yet implemented.
null;
end Append_Narrow_Era;
-------------------------
-- Append_Narrow_Month --
-------------------------
overriding procedure Append_Narrow_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Narrow_Month;
----------------------------------
-- Append_Numerical_Day_Of_Week --
----------------------------------
overriding procedure Append_Numerical_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Numerical_Day_Of_Week;
----------------------------
-- Append_Numerical_Month --
----------------------------
overriding procedure Append_Numerical_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean) is
begin
Append
(Output,
Matreshka.Internals.Calendars.Gregorian.Month (Date),
Padding);
end Append_Numerical_Month;
------------------------------
-- Append_Numerical_Quarter --
------------------------------
overriding procedure Append_Numerical_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean) is
begin
-- XXX Not yet implemented.
null;
end Append_Numerical_Quarter;
------------------------------
-- Append_Short_Day_Of_Week --
------------------------------
overriding procedure Append_Short_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean)
is
pragma Unreferenced (Self, Padding, Is_Stand_Alone);
Index : constant Gregorian.Day_Of_Week_Number
:= Calendars.Gregorian.Day_Of_Week (Date);
Names : constant array (Gregorian.Day_Of_Week_Number) of
Wide_Wide_String (1 .. 3)
:= ("Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun");
begin
-- XXX Is_Stand_Alone Not yet implemented.
Output.Append (Names (Index));
end Append_Short_Day_Of_Week;
--------------------------
-- Append_Week_Of_Month --
--------------------------
overriding procedure Append_Week_Of_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number) is
begin
-- XXX Not yet implemented.
null;
end Append_Week_Of_Month;
-------------------------
-- Append_Week_Of_Year --
-------------------------
overriding procedure Append_Week_Of_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
-- XXX Not yet implemented.
null;
end Append_Week_Of_Year;
-----------------
-- Append_Year --
-----------------
overriding procedure Append_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
Append
(Output,
Matreshka.Internals.Calendars.Gregorian.Year (Date),
Padding);
end Append_Year;
----------------------
-- Append_Year_Week --
----------------------
overriding procedure Append_Year_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive) is
begin
-- XXX Not yet implemented.
null;
end Append_Year_Week;
end Matreshka.Internals.Calendars.Formatting.ISO_8601;
| 31.732301 | 78 | 0.522694 |
23a134fac65eac14727d0ceaf19c61365f2481f8 | 66,008 | adb | Ada | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.sched.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.sched.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Introduction/lab3/fir_prj/solution2/.autopilot/db/fir.sched.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>fir</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</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>y</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>y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</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>c</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>c</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>11</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>x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>x_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</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>fir.c</first>
<second>fir</second>
</first>
<second>66</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>54</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>acc</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>acc</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>i_cast</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</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>67</item>
<item>68</item>
<item>70</item>
</oprand_edges>
<opcode>bitselect</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</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>71</item>
<item>72</item>
<item>73</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_1</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>67</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>74</item>
<item>76</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>67</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>77</item>
<item>78</item>
<item>79</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_7</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_2</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_3</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>shift_reg_addr</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>90</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>data</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>data</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_4</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>shift_reg_addr_1</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>68</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>68</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>83</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>70</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>data1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_5</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>c_addr</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>c_load</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_6</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>acc_1</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>acc</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>i_1</name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>115</item>
<item>117</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>66</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>66</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>118</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>76</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>120</item>
<item>121</item>
<item>122</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>fir.c</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>fir</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Introduction/lab3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>fir.c</first>
<second>fir</second>
</first>
<second>77</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>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>55</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>60</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>69</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>4</content>
</item>
<item class_id_reference="16" object_id="_37">
<Value>
<Obj>
<type>2</type>
<id>75</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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_38">
<Value>
<Obj>
<type>2</type>
<id>81</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>3</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_39">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>91</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_41">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_42">
<Obj>
<type>3</type>
<id>14</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>9</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_43">
<Obj>
<type>3</type>
<id>21</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_44">
<Obj>
<type>3</type>
<id>25</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_45">
<Obj>
<type>3</type>
<id>35</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>9</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_46">
<Obj>
<type>3</type>
<id>38</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_47">
<Obj>
<type>3</type>
<id>47</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>8</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_48">
<Obj>
<type>3</type>
<id>50</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>66</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_49">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>54</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>59</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>72</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>73</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>101</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>103</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>105</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>118</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>179</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>180</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>181</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>182</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>183</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>21</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="_115">
<mId>1</mId>
<mTag>fir</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>78</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_116">
<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>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_117">
<mId>3</mId>
<mTag>Shift_Accum_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>5</count>
<item_version>0</item_version>
<item>21</item>
<item>25</item>
<item>35</item>
<item>38</item>
<item>47</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>11</mMinTripCount>
<mMaxTripCount>11</mMaxTripCount>
<mMinLatency>77</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_118">
<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>50</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="25" tracking_level="1" version="0" object_id="_119">
<dp_component_resource class_id="26" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>0</count>
<item_version>0</item_version>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>0</count>
<item_version>0</item_version>
</dp_register_resource>
<dp_component_map class_id="27" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="28" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="29" tracking_level="0" version="0">
<first>9</first>
<second class_id="30" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</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>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>1</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>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>2</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>7</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>7</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="31" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="0" version="0">
<first>14</first>
<second class_id="33" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>7</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="36" 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="37" 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="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="39" 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>
| 26.028391 | 95 | 0.58902 |
1c6507d37bd5a052ae24ad927bd2aaea4e962128 | 663 | ads | Ada | src/API/protypo-api-consumers-buffers.ads | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | null | null | null | src/API/protypo-api-consumers-buffers.ads | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | 4 | 2019-10-09T11:16:38.000Z | 2019-10-09T11:20:38.000Z | src/API/protypo-api-consumers-buffers.ads | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | null | null | null | with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package Protypo.Api.Consumers.Buffers is
type Buffer (<>) is
new Consumer_Interface
with private;
type Buffer_Access is access Api.Consumers.Buffers.Buffer;
function New_Buffer return Buffer_Access;
procedure Destroy (Item : in out Buffer_Access);
overriding procedure Process (Consumer : in out Buffer;
Parameter : String);
function Get_Data (Consumer : Buffer) return String;
private
type Buffer is new Consumer_Interface
with
record
Data : Unbounded_String;
end record;
end Protypo.Api.Consumers.Buffers;
| 25.5 | 61 | 0.692308 |
1821553236fb493a2c68f274385d076ff86b3dbd | 8,058 | adb | Ada | applet/aide/source/editors/aide-editor-of_block.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | applet/aide/source/editors/aide-editor-of_block.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | applet/aide/source/editors/aide-editor-of_block.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
aIDE.GUI,
AdaM.exception_Handler,
glib,
glib.Error,
gtk.Builder,
gdk.Event;
package body aIDE.Editor.of_block
is
use gtk.Builder,
gtk.Widget,
glib,
glib.Error;
function exception_Button_Press
(Self : access Gtk_Widget_Record'Class;
Event : Gdk.Event.Gdk_Event_Button) return Boolean
is
Expander : constant my_Expander := my_Expander (Self);
begin
case Event.Button
is
when 1 =>
return False;
when 2 =>
declare
new_Handler : constant AdaM.exception_Handler.view
:= AdaM.exception_Handler.new_Handler (--"constraint_Error",
Expander.Editor.Block);
begin
Expander.Editor.Block.add (new_Handler);
Expander.Editor.exception_Handler := aIDE.Editor.of_exception_handler.new_Editor (new_Handler);
Expander.Editor.exception_Handler.top_Widget.reparent (Expander.Editor.exception_Box);
end;
when others =>
null;
end case;
return True;
end exception_Button_Press;
function Button_Press
(Self : access Gtk_Widget_Record'Class;
Event : Gdk.Event.Gdk_Event_Button) return Boolean
is
Expander : constant my_Expander := my_Expander (Self);
begin
case Event.Button
is
when 1 =>
return False;
when 2 =>
aIDE.GUI.show_source_entities_Palette (Invoked_by => Expander.Editor.all'Access,
Target => Expander.Target);
when others =>
null;
end case;
return True;
end Button_Press;
package body Forge
is
function to_block_Editor (the_Block : in AdaM.Block.view) return View
is
Self : constant Editor.of_block.view := new Editor.of_block.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
use gdk.Event;
begin
Gtk_New (the_Builder);
Result := the_Builder.Add_From_File ("glade/editor/block_editor.glade", Error'Access);
if Error /= null
then
Error_Free (Error);
end if;
Self.block_editor_Frame := gtk_Frame (the_Builder.get_Object ("block_editor_Frame"));
Self.top_Box := gtk_Box (the_Builder.get_Object ("top_Box"));
-- declare region
--
Self.declare_Expander := new my_Expander_Record;
Self.declare_Expander.Target := the_Block.my_Declarations;
Self.declare_Expander.Editor := Self;
gtk.Expander.Initialize (Self.declare_Expander, "declare");
Self.declare_Expander.On_Button_Press_Event (Button_Press'Access);
Self.top_Box.Pack_Start (Self.declare_Expander);
Self.declare_Label := Gtk_Label (the_Builder.get_Object ("declare_Label"));
Gtk_New_Vbox (Self.declare_Box);
Self.declare_Expander.Add (Self.declare_Box);
-- begin region
--
Self.begin_Expander := new my_Expander_Record;
Self.begin_Expander.Target := the_Block.my_Statements;
Self.begin_Expander.Editor := Self;
gtk.Expander.Initialize (Self.begin_Expander, "begin");
Self.begin_Expander.On_Button_Press_Event (Button_Press'Access);
Self.top_Box.Pack_Start (Self.begin_Expander);
Gtk_New_Vbox (Self.begin_Box);
Self.begin_Expander.Add (Self.begin_Box);
-- exception region
--
Self.exception_Expander := new my_Expander_Record;
Self.exception_Expander.Target := the_Block.my_Handlers;
Self.exception_Expander.Editor := Self;
gtk.Expander.Initialize (Self.exception_Expander, "exception");
Self.exception_Expander.On_Button_Press_Event (exception_Button_Press'Access);
Self.top_Box.Pack_Start (Self.exception_Expander);
Gtk_New_Vbox (Self.exception_Box);
Self.exception_Expander.Add (Self.exception_Box);
Self.Block := the_Block;
Self.top_Widget.Show_All;
Self.freshen;
return Self;
end to_block_Editor;
end Forge;
overriding
procedure freshen (Self : in out Item)
is
use AdaM;
begin
-- 'declare' Region
--
-- Destroy all prior 'declare' entity widgets.
--
loop
declare
the_Child : constant gtk_Widget := Self.declare_Box.get_Child (0);
begin
exit when the_Child = null;
the_Child.destroy;
end;
end loop;
-- Create all 'declare' entity widgets.
--
declare
-- the_Entities : constant AdaM.Source.Entities_View := Self.Block.my_Declarations;
the_Entities : constant AdaM.Entity.Entities_View := Self.Block.my_Declarations;
begin
for i in 1 .. Integer (the_Entities.Length)
loop
declare
-- the_Entity : AdaM.Source.Entity_view renames the_Entities.Element (i);
the_Entity : AdaM.Entity.view renames the_Entities.Element (i);
the_Editor : constant aIDE.Editor.view := aIDE.Editor.to_Editor (the_Entity);
begin
the_Editor.top_Widget.reparent (Self.declare_Box);
end;
end loop;
end;
-- 'begin' Region
--
-- Destroy all prior 'begin' entity widgets.
--
loop
declare
the_Child : constant gtk_Widget := Self.begin_Box.get_Child (0);
begin
exit when the_Child = null;
the_Child.destroy;
end;
end loop;
-- Create all 'begin' entity widgets.
--
declare
-- the_Entities : constant access AdaM.Source.Entities := Self.Block.my_Statements;
the_Entities : constant access AdaM.Entity.Entities := Self.Block.my_Statements;
begin
for i in 1 .. Integer (the_Entities.Length)
loop
declare
-- the_Entity : AdaM.Source.Entity_view renames the_Entities.Element (i);
the_Entity : AdaM.Entity.view renames the_Entities.Element (i);
the_Editor : constant aIDE.Editor.view := aIDE.Editor.to_Editor (the_Entity);
begin
the_Editor.top_Widget.reparent (Self.begin_Box);
end;
end loop;
end;
-- Exceptions
--
loop
declare
use gtk.Widget;
the_Child : constant gtk_Widget := Self.exception_Box.Get_Child (0);
begin
exit when the_Child = null;
the_Child.destroy;
end;
end loop;
for i in 1 .. Integer (Self.Block.my_Handlers.Length)
loop
declare
-- the_Entity : constant AdaM.Source.Entity_View := Self.Block.my_Handlers.Element (i);
the_Entity : constant AdaM.Entity.view := Self.Block.my_Handlers.Element (i);
the_Exception : constant AdaM.exception_Handler.view := AdaM.exception_Handler.view (the_Entity);
begin
Self.exception_Handler := aIDE.Editor.of_exception_handler.new_Editor (the_Exception);
Self.exception_Handler.top_Widget.reparent (Self.exception_Box);
end;
end loop;
end freshen;
procedure Target_is (Self : in out Item; Now : AdaM.Block.view)
is
Unused : Boolean;
begin
Self.Block := Now;
Self.freshen;
end Target_is;
function Target (Self : in Item) return AdaM.Block.view
is
begin
return Self.Block;
end Target;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.block_editor_Frame);
end top_Widget;
end aIDE.Editor.of_block;
| 28.076655 | 110 | 0.59593 |
12409d453a254897174af1722dd3e8f87cdfe779 | 79 | ads | Ada | src/orig/dds-request_reply-treqtreprequester.ads | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | null | null | null | src/orig/dds-request_reply-treqtreprequester.ads | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | null | null | null | src/orig/dds-request_reply-treqtreprequester.ads | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | 2 | 2020-04-06T19:34:15.000Z | 2020-04-06T19:50:03.000Z | package DDS.Request_Reply.Treqtreprequester is
pragma Elaborate_Body;
end;
| 19.75 | 47 | 0.822785 |
502bcb8f1f5ad5380ccd4f59930b594f97b76815 | 11,239 | ads | Ada | src/asf-components-html-forms.ads | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | src/asf-components-html-forms.ads | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | src/asf-components-html-forms.ads | My-Colaborations/ada-asf | 29cf62f17755c3af6f1be542d072c007bc569f7e | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- html.forms -- ASF HTML Form Components
-- Copyright (C) 2010, 2011, 2012, 2013, 2014, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ASF.Components.Holders;
with ASF.Components.Html.Text;
with ASF.Validators;
with ASF.Events.Faces;
with EL.Objects;
with EL.Expressions;
package ASF.Components.Html.Forms is
-- A UIComponent can have several validators. To keep the implementation light and
-- simple, a fixed array is used. Most components will have one or two validators.
-- Define the number of validators per component (UIInput).
MAX_VALIDATORS_PER_COMPONENT : constant Positive := 5;
-- Message displayed when the submitted value is required but is empty.
REQUIRED_MESSAGE_ID : constant String := "asf.faces.component.UIInput.REQUIRED";
-- ------------------------------
-- Form Component
-- ------------------------------
type UIForm is new UIHtmlComponent with private;
type UIForm_Access is access all UIForm'Class;
-- Check whether the form is submitted.
function Is_Submitted (UI : in UIForm) return Boolean;
-- Called during the <b>Apply Request</b> phase to indicate that this
-- form is submitted.
procedure Set_Submitted (UI : in out UIForm);
-- Get the action URL to set on the HTML form
function Get_Action (UI : in UIForm;
Context : in Faces_Context'Class) return String;
overriding
procedure Encode_Begin (UI : in UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Encode_End (UI : in UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Decode (UI : in out UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Process_Decodes (UI : in out UIForm;
Context : in out Faces_Context'Class);
-- ------------------------------
-- Input Component
-- ------------------------------
type UIInput is new Text.UIOutput and Holders.Editable_Value_Holder with private;
type UIInput_Access is access all UIInput'Class;
-- Check if this component has the required attribute set.
function Is_Required (UI : in UIInput;
Context : in Faces_Context'Class) return Boolean;
-- Find the form component which contains the input component.
-- Returns null if the input is not within a form component.
function Get_Form (UI : in UIInput) return UIForm_Access;
-- Get the value of the component. If the component has a submitted value, returns it.
-- If the component has a local value which is not null, returns it.
-- Otherwise, if we have a Value_Expression evaluate and returns the value.
overriding
function Get_Value (UI : in UIInput) return EL.Objects.Object;
-- Convert the string into a value. If a converter is specified on the component,
-- use it to convert the value.
function Convert_Value (UI : in UIInput;
Value : in String;
Context : in Faces_Context'Class) return EL.Objects.Object;
-- Get the input parameter from the submitted context. This operation is called by
-- <tt>Process_Decodes</tt> to retrieve the request parameter associated with the component.
function Get_Parameter (UI : in UIInput;
Context : in Faces_Context'Class) return String;
-- Set the input component as a password field.
procedure Set_Secret (UI : in out UIInput;
Value : in Boolean);
-- Render the input element.
procedure Render_Input (UI : in UIInput;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
overriding
procedure Encode_Begin (UI : in UIInput;
Context : in out Faces_Context'Class);
overriding
procedure Process_Decodes (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Perform the component tree processing required by the <b>Process Validations</b>
-- phase of the request processing lifecycle for all facets of this component,
-- all children of this component, and this component itself, as follows:
-- <ul>
-- <li>If this component <b>rendered</b> property is false, skip further processing.
-- <li>Call the <b>Process_Validators</b> of all facets and children.
-- <ul>
procedure Process_Validators (UI : in out UIInput;
Context : in out Faces_Context'Class);
overriding
procedure Process_Updates (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Validate the submitted value.
-- <ul>
-- <li>Retreive the submitted value
-- <li>If the value is null, exit without further processing.
-- <li>Validate the value by calling <b>Validate_Value</b>
-- </ul>
procedure Validate (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Set the <b>valid</b> property:
-- <ul>
-- <li>If the <b>required</b> property is true, ensure the
-- value is not empty
-- <li>Call the <b>Validate</b> procedure on each validator
-- registered on this component.
-- <li>Set the <b>valid</b> property if all validator passed.
-- </ul>
procedure Validate_Value (UI : in out UIInput;
Value : in EL.Objects.Object;
Context : in out Faces_Context'Class);
-- Add the validator to be used on the component. The ASF implementation limits
-- to 5 the number of validators that can be set on a component (See UIInput).
-- The validator instance will be freed when the editable value holder is deleted
-- unless <b>Shared</b> is true.
overriding
procedure Add_Validator (UI : in out UIInput;
Validator : in ASF.Validators.Validator_Access;
Shared : in Boolean := False);
-- Delete the UI input instance.
overriding
procedure Finalize (UI : in out UIInput);
-- ------------------------------
-- InputTextarea Component
-- ------------------------------
type UIInputTextarea is new UIInput with private;
type UIInputTextarea_Access is access all UIInputTextarea'Class;
-- Render the textarea element.
overriding
procedure Render_Input (UI : in UIInputTextarea;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- ------------------------------
-- Input_Hidden Component
-- ------------------------------
type UIInput_Hidden is new UIInput with private;
type UIInput_Hidden_Access is access all UIInput_Hidden'Class;
-- Render the inputHidden element.
overriding
procedure Render_Input (UI : in UIInput_Hidden;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- ------------------------------
-- InputFile Component
-- ------------------------------
type UIInput_File is new UIInput with private;
type UIInput_File_Access is access all UIInput_File'Class;
-- Render the input file element.
overriding
procedure Render_Input (UI : in UIInput_File;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- Validate the submitted file.
-- <ul>
-- <li>Retreive the submitted value
-- <li>If the value is null, exit without further processing.
-- <li>Validate the value by calling <b>Validate_Value</b>
-- </ul>
overriding
procedure Validate (UI : in out UIInput_File;
Context : in out Faces_Context'Class);
overriding
procedure Process_Updates (UI : in out UIInput_File;
Context : in out Faces_Context'Class);
-- ------------------------------
-- Button Component
-- ------------------------------
type UICommand is new UIHtmlComponent with private;
overriding
procedure Encode_Begin (UI : in UICommand;
Context : in out Faces_Context'Class);
-- Get the value to write on the output.
function Get_Value (UI : in UICommand) return EL.Objects.Object;
-- Set the value to write on the output.
procedure Set_Value (UI : in out UICommand;
Value : in EL.Objects.Object);
-- Get the action method expression to invoke if the command is pressed.
function Get_Action_Expression (UI : in UICommand;
Context : in Faces_Context'Class)
return EL.Expressions.Method_Expression;
overriding
procedure Process_Decodes (UI : in out UICommand;
Context : in out Faces_Context'Class);
-- Broadcast the event to the event listeners installed on this component.
-- Listeners are called in the order in which they were added.
overriding
procedure Broadcast (UI : in out UICommand;
Event : not null access ASF.Events.Faces.Faces_Event'Class;
Context : in out Faces_Context'Class);
private
type Validator is record
Validator : ASF.Validators.Validator_Access := null;
Shared : Boolean := False;
end record;
type Validator_Array is array (1 .. MAX_VALIDATORS_PER_COMPONENT) of Validator;
type UIInput is new Text.UIOutput and Holders.Editable_Value_Holder with record
Submitted_Value : EL.Objects.Object;
Is_Valid : Boolean := False;
Is_Secret : Boolean := False;
Validators : Validator_Array;
end record;
type UIInputTextarea is new UIInput with record
Rows : Natural;
Cols : Natural;
end record;
type UIInput_Hidden is new UIInput with null record;
type UIInput_File is new UIInput with null record;
type UICommand is new UIHtmlComponent with record
Value : EL.Objects.Object;
end record;
type UIForm is new UIHtmlComponent with record
Is_Submitted : Boolean := False;
end record;
end ASF.Components.Html.Forms;
| 40.283154 | 96 | 0.605125 |
0bc5cdfbc62bf82401253bdcc09be7b8f68a3d66 | 8,658 | adb | Ada | awa/src/awa-services-contexts.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 81 | 2015-01-18T23:02:30.000Z | 2022-03-19T17:34:57.000Z | awa/src/awa-services-contexts.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 20 | 2015-12-09T19:26:19.000Z | 2022-03-23T14:32:43.000Z | awa/src/awa-services-contexts.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- awa-services -- Services
-- Copyright (C) 2011, 2012, 2013, 2014, 2016, 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.
-----------------------------------------------------------------------
with Ada.Task_Attributes;
with Security.Contexts;
package body AWA.Services.Contexts is
use type ADO.Sessions.Connection_Status;
use type AWA.Users.Principals.Principal_Access;
package Task_Context is new Ada.Task_Attributes
(Service_Context_Access, null);
-- ------------------------------
-- Get the application associated with the current service operation.
-- ------------------------------
function Get_Application (Ctx : in Service_Context)
return AWA.Applications.Application_Access is
begin
return Ctx.Application;
end Get_Application;
-- ------------------------------
-- Get the current database connection for reading.
-- ------------------------------
function Get_Session (Ctx : in Service_Context_Access) return ADO.Sessions.Session is
begin
-- If a master database session was created, use it.
if Ctx.Master.Get_Status = ADO.Sessions.OPEN then
return ADO.Sessions.Session (Ctx.Master);
elsif Ctx.Slave.Get_Status /= ADO.Sessions.OPEN then
Ctx.Slave := Ctx.Application.Get_Session;
end if;
return Ctx.Slave;
end Get_Session;
-- ------------------------------
-- Get the current database connection for reading and writing.
-- ------------------------------
function Get_Master_Session (Ctx : in Service_Context_Access)
return ADO.Sessions.Master_Session is
begin
if Ctx.Master.Get_Status /= ADO.Sessions.OPEN then
Ctx.Master := Ctx.Application.Get_Master_Session;
end if;
return Ctx.Master;
end Get_Master_Session;
-- ------------------------------
-- Get the current user invoking the service operation.
-- Returns a null user if there is none.
-- ------------------------------
function Get_User (Ctx : in Service_Context) return AWA.Users.Models.User_Ref is
begin
if Ctx.Principal = null then
return AWA.Users.Models.Null_User;
else
return Ctx.Principal.Get_User;
end if;
end Get_User;
-- ------------------------------
-- Get the current user identifier invoking the service operation.
-- Returns NO_IDENTIFIER if there is none.
-- ------------------------------
function Get_User_Identifier (Ctx : in Service_Context) return ADO.Identifier is
begin
if Ctx.Principal = null then
return ADO.NO_IDENTIFIER;
else
return Ctx.Principal.Get_User_Identifier;
end if;
end Get_User_Identifier;
-- ------------------------------
-- Get the current user session from the user invoking the service operation.
-- Returns a null session if there is none.
-- ------------------------------
function Get_User_Session (Ctx : in Service_Context) return AWA.Users.Models.Session_Ref is
begin
if Ctx.Principal = null then
return AWA.Users.Models.Null_Session;
else
return Ctx.Principal.Get_Session;
end if;
end Get_User_Session;
-- ------------------------------
-- Starts a transaction.
-- ------------------------------
procedure Start (Ctx : in out Service_Context) is
begin
if Ctx.Transaction = 0 and then not Ctx.Active_Transaction then
Ctx.Master.Begin_Transaction;
Ctx.Active_Transaction := True;
end if;
Ctx.Transaction := Ctx.Transaction + 1;
end Start;
-- ------------------------------
-- Commits the current transaction. The database transaction is really committed by the
-- last <b>Commit</b> called.
-- ------------------------------
procedure Commit (Ctx : in out Service_Context) is
begin
Ctx.Transaction := Ctx.Transaction - 1;
if Ctx.Transaction = 0 and then Ctx.Active_Transaction then
Ctx.Master.Commit;
Ctx.Active_Transaction := False;
end if;
end Commit;
-- ------------------------------
-- Rollback the current transaction. The database transaction is rollback at the first
-- call to <b>Rollback</b>.
-- ------------------------------
procedure Rollback (Ctx : in out Service_Context) is
begin
null;
end Rollback;
-- ------------------------------
-- Get the attribute registered under the given name in the HTTP session.
-- ------------------------------
function Get_Session_Attribute (Ctx : in Service_Context;
Name : in String) return Util.Beans.Objects.Object is
pragma Unreferenced (Ctx, Name);
begin
return Util.Beans.Objects.Null_Object;
end Get_Session_Attribute;
-- ------------------------------
-- Set the attribute registered under the given name in the HTTP session.
-- ------------------------------
procedure Set_Session_Attribute (Ctx : in out Service_Context;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
null;
end Set_Session_Attribute;
-- ------------------------------
-- Set the current application and user context.
-- ------------------------------
procedure Set_Context (Ctx : in out Service_Context;
Application : in AWA.Applications.Application_Access;
Principal : in AWA.Users.Principals.Principal_Access) is
begin
Ctx.Application := Application;
Ctx.Principal := Principal;
end Set_Context;
-- ------------------------------
-- Initializes the service context.
-- ------------------------------
overriding
procedure Initialize (Ctx : in out Service_Context) is
use type AWA.Applications.Application_Access;
begin
Ctx.Previous := Task_Context.Value;
Task_Context.Set_Value (Ctx'Unchecked_Access);
if Ctx.Previous /= null and then Ctx.Application = null then
Ctx.Application := Ctx.Previous.Application;
end if;
end Initialize;
-- ------------------------------
-- Finalize the service context, rollback non-committed transaction, releases any object.
-- ------------------------------
overriding
procedure Finalize (Ctx : in out Service_Context) is
begin
-- When the service context is released, we must not have any active transaction.
-- This means we are leaving the service in an abnormal way such as when an
-- exception is raised. If this is the case, rollback the transaction.
if Ctx.Active_Transaction then
Ctx.Master.Rollback;
end if;
Task_Context.Set_Value (Ctx.Previous);
end Finalize;
-- ------------------------------
-- Get the current service context.
-- Returns null if the current thread is not associated with any service context.
-- ------------------------------
function Current return Service_Context_Access is
begin
return Task_Context.Value;
end Current;
-- ------------------------------
-- Run the process procedure on behalf of the specific user and session.
-- This operation changes temporarily the identity of the current user principal and
-- executes the <tt>Process</tt> procedure.
-- ------------------------------
procedure Run_As (User : in AWA.Users.Models.User_Ref;
Session : in AWA.Users.Models.Session_Ref) is
Ctx : Service_Context;
Sec : Security.Contexts.Security_Context;
Principal : aliased AWA.Users.Principals.Principal
:= AWA.Users.Principals.Create (User, Session);
begin
Ctx.Principal := Principal'Unchecked_Access;
Sec.Set_Context (Ctx.Application.Get_Security_Manager, Principal'Unchecked_Access);
Process;
end Run_As;
end AWA.Services.Contexts;
| 38.309735 | 94 | 0.578309 |
0b8b65671510e8b6e5b080e8d4c66cfb6499748d | 10,766 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valueu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valueu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valueu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L U E _ U --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Val_Util; use System.Val_Util;
package body System.Value_U is
-----------------------
-- Scan_Raw_Unsigned --
-----------------------
function Scan_Raw_Unsigned
(Str : String;
Ptr : not null access Integer;
Max : Integer) return Uns
is
P : Integer;
-- Local copy of the pointer
Uval : Uns;
-- Accumulated unsigned integer result
Expon : Integer;
-- Exponent value
Overflow : Boolean := False;
-- Set True if overflow is detected at any point
Base_Char : Character;
-- Base character (# or :) in based case
Base : Uns := 10;
-- Base value (reset in based case)
Digit : Uns;
-- Digit value
begin
-- We do not tolerate strings with Str'Last = Positive'Last
if Str'Last = Positive'Last then
raise Program_Error with
"string upper bound is Positive'Last, not supported";
end if;
P := Ptr.all;
Uval := Character'Pos (Str (P)) - Character'Pos ('0');
P := P + 1;
-- Scan out digits of what is either the number or the base.
-- In either case, we are definitely scanning out in base 10.
declare
Umax : constant Uns := (Uns'Last - 9) / 10;
-- Max value which cannot overflow on accumulating next digit
Umax10 : constant Uns := Uns'Last / 10;
-- Numbers bigger than Umax10 overflow if multiplied by 10
begin
-- Loop through decimal digits
loop
exit when P > Max;
Digit := Character'Pos (Str (P)) - Character'Pos ('0');
-- Non-digit encountered
if Digit > 9 then
if Str (P) = '_' then
Scan_Underscore (Str, P, Ptr, Max, False);
else
exit;
end if;
-- Accumulate result, checking for overflow
else
if Uval <= Umax then
Uval := 10 * Uval + Digit;
elsif Uval > Umax10 then
Overflow := True;
else
Uval := 10 * Uval + Digit;
if Uval < Umax10 then
Overflow := True;
end if;
end if;
P := P + 1;
end if;
end loop;
end;
Ptr.all := P;
-- Deal with based case. We recognize either the standard '#' or the
-- allowed alternative replacement ':' (see RM J.2(3)).
if P < Max and then (Str (P) = '#' or else Str (P) = ':') then
Base_Char := Str (P);
P := P + 1;
Base := Uval;
Uval := 0;
-- Check base value. Overflow is set True if we find a bad base, or
-- a digit that is out of range of the base. That way, we scan out
-- the numeral that is still syntactically correct, though illegal.
-- We use a safe base of 16 for this scan, to avoid zero divide.
if Base not in 2 .. 16 then
Overflow := True;
Base := 16;
end if;
-- Scan out based integer
declare
Umax : constant Uns := (Uns'Last - Base + 1) / Base;
-- Max value which cannot overflow on accumulating next digit
UmaxB : constant Uns := Uns'Last / Base;
-- Numbers bigger than UmaxB overflow if multiplied by base
begin
-- Loop to scan out based integer value
loop
-- We require a digit at this stage
if Str (P) in '0' .. '9' then
Digit := Character'Pos (Str (P)) - Character'Pos ('0');
elsif Str (P) in 'A' .. 'F' then
Digit :=
Character'Pos (Str (P)) - (Character'Pos ('A') - 10);
elsif Str (P) in 'a' .. 'f' then
Digit :=
Character'Pos (Str (P)) - (Character'Pos ('a') - 10);
-- If we don't have a digit, then this is not a based number
-- after all, so we use the value we scanned out as the base
-- (now in Base), and the pointer to the base character was
-- already stored in Ptr.all.
else
Uval := Base;
exit;
end if;
-- If digit is too large, just signal overflow and continue.
-- The idea here is to keep scanning as long as the input is
-- syntactically valid, even if we have detected overflow
if Digit >= Base then
Overflow := True;
-- Here we accumulate the value, checking overflow
elsif Uval <= Umax then
Uval := Base * Uval + Digit;
elsif Uval > UmaxB then
Overflow := True;
else
Uval := Base * Uval + Digit;
if Uval < UmaxB then
Overflow := True;
end if;
end if;
-- If at end of string with no base char, not a based number
-- but we signal Constraint_Error and set the pointer past
-- the end of the field, since this is what the ACVC tests
-- seem to require, see CE3704N, line 204.
P := P + 1;
if P > Max then
Ptr.all := P;
Bad_Value (Str);
end if;
-- If terminating base character, we are done with loop
if Str (P) = Base_Char then
Ptr.all := P + 1;
exit;
-- Deal with underscore
elsif Str (P) = '_' then
Scan_Underscore (Str, P, Ptr, Max, True);
end if;
end loop;
end;
end if;
-- Come here with scanned unsigned value in Uval. The only remaining
-- required step is to deal with exponent if one is present.
Expon := Scan_Exponent (Str, Ptr, Max);
if Expon /= 0 and then Uval /= 0 then
-- For non-zero value, scale by exponent value. No need to do this
-- efficiently, since use of exponent in integer literals is rare,
-- and in any case the exponent cannot be very large.
declare
UmaxB : constant Uns := Uns'Last / Base;
-- Numbers bigger than UmaxB overflow if multiplied by base
begin
for J in 1 .. Expon loop
if Uval > UmaxB then
Overflow := True;
exit;
end if;
Uval := Uval * Base;
end loop;
end;
end if;
-- Return result, dealing with sign and overflow
if Overflow then
Bad_Value (Str);
else
return Uval;
end if;
end Scan_Raw_Unsigned;
-------------------
-- Scan_Unsigned --
-------------------
function Scan_Unsigned
(Str : String;
Ptr : not null access Integer;
Max : Integer) return Uns
is
Start : Positive;
-- Save location of first non-blank character
begin
Scan_Plus_Sign (Str, Ptr, Max, Start);
if Str (Ptr.all) not in '0' .. '9' then
Ptr.all := Start;
Bad_Value (Str);
end if;
return Scan_Raw_Unsigned (Str, Ptr, Max);
end Scan_Unsigned;
--------------------
-- Value_Unsigned --
--------------------
function Value_Unsigned (Str : String) return Uns is
begin
-- We have to special case Str'Last = Positive'Last because the normal
-- circuit ends up setting P to Str'Last + 1 which is out of bounds. We
-- deal with this by converting to a subtype which fixes the bounds.
if Str'Last = Positive'Last then
declare
subtype NT is String (1 .. Str'Length);
begin
return Value_Unsigned (NT (Str));
end;
-- Normal case where Str'Last < Positive'Last
else
declare
V : Uns;
P : aliased Integer := Str'First;
begin
V := Scan_Unsigned (Str, P'Access, Str'Last);
Scan_Trailing_Blanks (Str, P);
return V;
end;
end if;
end Value_Unsigned;
end System.Value_U;
| 33.126154 | 78 | 0.449285 |
4d8e52cee742eb2bf60943328251d2eeb3523159 | 333,136 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/freeze.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/freeze.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/freeze.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- F R E E Z E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Aspects; use Aspects;
with Atree; use Atree;
with Checks; use Checks;
with Contracts; use Contracts;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Exp_Ch3; use Exp_Ch3;
with Exp_Ch7; use Exp_Ch7;
with Exp_Disp; use Exp_Disp;
with Exp_Pakd; use Exp_Pakd;
with Exp_Util; use Exp_Util;
with Exp_Tss; use Exp_Tss;
with Fname; use Fname;
with Ghost; use Ghost;
with Layout; use Layout;
with Lib; use Lib;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Cat; use Sem_Cat;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch7; use Sem_Ch7;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch13; use Sem_Ch13;
with Sem_Eval; use Sem_Eval;
with Sem_Mech; use Sem_Mech;
with Sem_Prag; use Sem_Prag;
with Sem_Res; use Sem_Res;
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;
with Urealp; use Urealp;
with Warnsw; use Warnsw;
package body Freeze is
-----------------------
-- Local Subprograms --
-----------------------
procedure Adjust_Esize_For_Alignment (Typ : Entity_Id);
-- Typ is a type that is being frozen. If no size clause is given,
-- but a default Esize has been computed, then this default Esize is
-- adjusted up if necessary to be consistent with a given alignment,
-- but never to a value greater than Long_Long_Integer'Size. This
-- is used for all discrete types and for fixed-point types.
procedure Build_And_Analyze_Renamed_Body
(Decl : Node_Id;
New_S : Entity_Id;
After : in out Node_Id);
-- Build body for a renaming declaration, insert in tree and analyze
procedure Check_Address_Clause (E : Entity_Id);
-- Apply legality checks to address clauses for object declarations,
-- at the point the object is frozen. Also ensure any initialization is
-- performed only after the object has been frozen.
procedure Check_Component_Storage_Order
(Encl_Type : Entity_Id;
Comp : Entity_Id;
ADC : Node_Id;
Comp_ADC_Present : out Boolean);
-- For an Encl_Type that has a Scalar_Storage_Order attribute definition
-- clause, verify that the component type has an explicit and compatible
-- attribute/aspect. For arrays, Comp is Empty; for records, it is the
-- entity of the component under consideration. For an Encl_Type that
-- does not have a Scalar_Storage_Order attribute definition clause,
-- verify that the component also does not have such a clause.
-- ADC is the attribute definition clause if present (or Empty). On return,
-- Comp_ADC_Present is set True if the component has a Scalar_Storage_Order
-- attribute definition clause.
procedure Check_Debug_Info_Needed (T : Entity_Id);
-- As each entity is frozen, this routine is called to deal with the
-- setting of Debug_Info_Needed for the entity. This flag is set if
-- the entity comes from source, or if we are in Debug_Generated_Code
-- mode or if the -gnatdV debug flag is set. However, it never sets
-- the flag if Debug_Info_Off is set. This procedure also ensures that
-- subsidiary entities have the flag set as required.
procedure Check_Expression_Function (N : Node_Id; Nam : Entity_Id);
-- When an expression function is frozen by a use of it, the expression
-- itself is frozen. Check that the expression does not include references
-- to deferred constants without completion. We report this at the freeze
-- point of the function, to provide a better error message.
--
-- In most cases the expression itself is frozen by the time the function
-- itself is frozen, because the formals will be frozen by then. However,
-- Attribute references to outer types are freeze points for those types;
-- this routine generates the required freeze nodes for them.
procedure Check_Inherited_Conditions (R : Entity_Id);
-- For a tagged derived type, create wrappers for inherited operations
-- that have a class-wide condition, so it can be properly rewritten if
-- it involves calls to other overriding primitives.
procedure Check_Strict_Alignment (E : Entity_Id);
-- E is a base type. If E is tagged or has a component that is aliased
-- or tagged or contains something this is aliased or tagged, set
-- Strict_Alignment.
procedure Check_Unsigned_Type (E : Entity_Id);
pragma Inline (Check_Unsigned_Type);
-- If E is a fixed-point or discrete type, then all the necessary work
-- to freeze it is completed except for possible setting of the flag
-- Is_Unsigned_Type, which is done by this procedure. The call has no
-- effect if the entity E is not a discrete or fixed-point type.
procedure Freeze_And_Append
(Ent : Entity_Id;
N : Node_Id;
Result : in out List_Id);
-- Freezes Ent using Freeze_Entity, and appends the resulting list of
-- nodes to Result, modifying Result from No_List if necessary. N has
-- the same usage as in Freeze_Entity.
procedure Freeze_Enumeration_Type (Typ : Entity_Id);
-- Freeze enumeration type. The Esize field is set as processing
-- proceeds (i.e. set by default when the type is declared and then
-- adjusted by rep clauses. What this procedure does is to make sure
-- that if a foreign convention is specified, and no specific size
-- is given, then the size must be at least Integer'Size.
procedure Freeze_Static_Object (E : Entity_Id);
-- If an object is frozen which has Is_Statically_Allocated set, then
-- all referenced types must also be marked with this flag. This routine
-- is in charge of meeting this requirement for the object entity E.
procedure Freeze_Subprogram (E : Entity_Id);
-- Perform freezing actions for a subprogram (create extra formals,
-- and set proper default mechanism values). Note that this routine
-- is not called for internal subprograms, for which neither of these
-- actions is needed (or desirable, we do not want for example to have
-- these extra formals present in initialization procedures, where they
-- would serve no purpose). In this call E is either a subprogram or
-- a subprogram type (i.e. an access to a subprogram).
function Is_Fully_Defined (T : Entity_Id) return Boolean;
-- True if T is not private and has no private components, or has a full
-- view. Used to determine whether the designated type of an access type
-- should be frozen when the access type is frozen. This is done when an
-- allocator is frozen, or an expression that may involve attributes of
-- the designated type. Otherwise freezing the access type does not freeze
-- the designated type.
procedure Process_Default_Expressions
(E : Entity_Id;
After : in out Node_Id);
-- This procedure is called for each subprogram to complete processing of
-- default expressions at the point where all types are known to be frozen.
-- The expressions must be analyzed in full, to make sure that all error
-- processing is done (they have only been pre-analyzed). If the expression
-- is not an entity or literal, its analysis may generate code which must
-- not be executed. In that case we build a function body to hold that
-- code. This wrapper function serves no other purpose (it used to be
-- called to evaluate the default, but now the default is inlined at each
-- point of call).
procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id);
-- Typ is a record or array type that is being frozen. This routine sets
-- the default component alignment from the scope stack values if the
-- alignment is otherwise not specified.
procedure Set_SSO_From_Default (T : Entity_Id);
-- T is a record or array type that is being frozen. If it is a base type,
-- and if SSO_Set_Low/High_By_Default is set, then Reverse_Storage order
-- will be set appropriately. Note that an explicit occurrence of aspect
-- Scalar_Storage_Order or an explicit setting of this aspect with an
-- attribute definition clause occurs, then these two flags are reset in
-- any case, so call will have no effect.
procedure Undelay_Type (T : Entity_Id);
-- T is a type of a component that we know to be an Itype. We don't want
-- this to have a Freeze_Node, so ensure it doesn't. Do the same for any
-- Full_View or Corresponding_Record_Type.
procedure Warn_Overlay (Expr : Node_Id; Typ : Entity_Id; Nam : Node_Id);
-- Expr is the expression for an address clause for entity Nam whose type
-- is Typ. If Typ has a default initialization, and there is no explicit
-- initialization in the source declaration, check whether the address
-- clause might cause overlaying of an entity, and emit a warning on the
-- side effect that the initialization will cause.
-------------------------------
-- Adjust_Esize_For_Alignment --
-------------------------------
procedure Adjust_Esize_For_Alignment (Typ : Entity_Id) is
Align : Uint;
begin
if Known_Esize (Typ) and then Known_Alignment (Typ) then
Align := Alignment_In_Bits (Typ);
if Align > Esize (Typ)
and then Align <= Standard_Long_Long_Integer_Size
then
Set_Esize (Typ, Align);
end if;
end if;
end Adjust_Esize_For_Alignment;
------------------------------------
-- Build_And_Analyze_Renamed_Body --
------------------------------------
procedure Build_And_Analyze_Renamed_Body
(Decl : Node_Id;
New_S : Entity_Id;
After : in out Node_Id)
is
Body_Decl : constant Node_Id := Unit_Declaration_Node (New_S);
Ent : constant Entity_Id := Defining_Entity (Decl);
Body_Node : Node_Id;
Renamed_Subp : Entity_Id;
begin
-- If the renamed subprogram is intrinsic, there is no need for a
-- wrapper body: we set the alias that will be called and expanded which
-- completes the declaration. This transformation is only legal if the
-- renamed entity has already been elaborated.
-- Note that it is legal for a renaming_as_body to rename an intrinsic
-- subprogram, as long as the renaming occurs before the new entity
-- is frozen (RM 8.5.4 (5)).
if Nkind (Body_Decl) = N_Subprogram_Renaming_Declaration
and then Is_Entity_Name (Name (Body_Decl))
then
Renamed_Subp := Entity (Name (Body_Decl));
else
Renamed_Subp := Empty;
end if;
if Present (Renamed_Subp)
and then Is_Intrinsic_Subprogram (Renamed_Subp)
and then
(not In_Same_Source_Unit (Renamed_Subp, Ent)
or else Sloc (Renamed_Subp) < Sloc (Ent))
-- We can make the renaming entity intrinsic if the renamed function
-- has an interface name, or if it is one of the shift/rotate
-- operations known to the compiler.
and then
(Present (Interface_Name (Renamed_Subp))
or else Nam_In (Chars (Renamed_Subp), Name_Rotate_Left,
Name_Rotate_Right,
Name_Shift_Left,
Name_Shift_Right,
Name_Shift_Right_Arithmetic))
then
Set_Interface_Name (Ent, Interface_Name (Renamed_Subp));
if Present (Alias (Renamed_Subp)) then
Set_Alias (Ent, Alias (Renamed_Subp));
else
Set_Alias (Ent, Renamed_Subp);
end if;
Set_Is_Intrinsic_Subprogram (Ent);
Set_Has_Completion (Ent);
else
Body_Node := Build_Renamed_Body (Decl, New_S);
Insert_After (After, Body_Node);
Mark_Rewrite_Insertion (Body_Node);
Analyze (Body_Node);
After := Body_Node;
end if;
end Build_And_Analyze_Renamed_Body;
------------------------
-- Build_Renamed_Body --
------------------------
function Build_Renamed_Body
(Decl : Node_Id;
New_S : Entity_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (New_S);
-- We use for the source location of the renamed body, the location of
-- the spec entity. It might seem more natural to use the location of
-- the renaming declaration itself, but that would be wrong, since then
-- the body we create would look as though it was created far too late,
-- and this could cause problems with elaboration order analysis,
-- particularly in connection with instantiations.
N : constant Node_Id := Unit_Declaration_Node (New_S);
Nam : constant Node_Id := Name (N);
Old_S : Entity_Id;
Spec : constant Node_Id := New_Copy_Tree (Specification (Decl));
Actuals : List_Id := No_List;
Call_Node : Node_Id;
Call_Name : Node_Id;
Body_Node : Node_Id;
Formal : Entity_Id;
O_Formal : Entity_Id;
Param_Spec : Node_Id;
Pref : Node_Id := Empty;
-- If the renamed entity is a primitive operation given in prefix form,
-- the prefix is the target object and it has to be added as the first
-- actual in the generated call.
begin
-- Determine the entity being renamed, which is the target of the call
-- statement. If the name is an explicit dereference, this is a renaming
-- of a subprogram type rather than a subprogram. The name itself is
-- fully analyzed.
if Nkind (Nam) = N_Selected_Component then
Old_S := Entity (Selector_Name (Nam));
elsif Nkind (Nam) = N_Explicit_Dereference then
Old_S := Etype (Nam);
elsif Nkind (Nam) = N_Indexed_Component then
if Is_Entity_Name (Prefix (Nam)) then
Old_S := Entity (Prefix (Nam));
else
Old_S := Entity (Selector_Name (Prefix (Nam)));
end if;
elsif Nkind (Nam) = N_Character_Literal then
Old_S := Etype (New_S);
else
Old_S := Entity (Nam);
end if;
if Is_Entity_Name (Nam) then
-- If the renamed entity is a predefined operator, retain full name
-- to ensure its visibility.
if Ekind (Old_S) = E_Operator
and then Nkind (Nam) = N_Expanded_Name
then
Call_Name := New_Copy (Name (N));
else
Call_Name := New_Occurrence_Of (Old_S, Loc);
end if;
else
if Nkind (Nam) = N_Selected_Component
and then Present (First_Formal (Old_S))
and then
(Is_Controlling_Formal (First_Formal (Old_S))
or else Is_Class_Wide_Type (Etype (First_Formal (Old_S))))
then
-- Retrieve the target object, to be added as a first actual
-- in the call.
Call_Name := New_Occurrence_Of (Old_S, Loc);
Pref := Prefix (Nam);
else
Call_Name := New_Copy (Name (N));
end if;
-- Original name may have been overloaded, but is fully resolved now
Set_Is_Overloaded (Call_Name, False);
end if;
-- For simple renamings, subsequent calls can be expanded directly as
-- calls to the renamed entity. The body must be generated in any case
-- for calls that may appear elsewhere. This is not done in the case
-- where the subprogram is an instantiation because the actual proper
-- body has not been built yet.
if Ekind_In (Old_S, E_Function, E_Procedure)
and then Nkind (Decl) = N_Subprogram_Declaration
and then not Is_Generic_Instance (Old_S)
then
Set_Body_To_Inline (Decl, Old_S);
end if;
-- Check whether the return type is a limited view. If the subprogram
-- is already frozen the generated body may have a non-limited view
-- of the type, that must be used, because it is the one in the spec
-- of the renaming declaration.
if Ekind (Old_S) = E_Function
and then Is_Entity_Name (Result_Definition (Spec))
then
declare
Ret_Type : constant Entity_Id := Etype (Result_Definition (Spec));
begin
if Has_Non_Limited_View (Ret_Type) then
Set_Result_Definition
(Spec, New_Occurrence_Of (Non_Limited_View (Ret_Type), Loc));
end if;
end;
end if;
-- The body generated for this renaming is an internal artifact, and
-- does not constitute a freeze point for the called entity.
Set_Must_Not_Freeze (Call_Name);
Formal := First_Formal (Defining_Entity (Decl));
if Present (Pref) then
declare
Pref_Type : constant Entity_Id := Etype (Pref);
Form_Type : constant Entity_Id := Etype (First_Formal (Old_S));
begin
-- The controlling formal may be an access parameter, or the
-- actual may be an access value, so adjust accordingly.
if Is_Access_Type (Pref_Type)
and then not Is_Access_Type (Form_Type)
then
Actuals := New_List
(Make_Explicit_Dereference (Loc, Relocate_Node (Pref)));
elsif Is_Access_Type (Form_Type)
and then not Is_Access_Type (Pref)
then
Actuals :=
New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Access,
Prefix => Relocate_Node (Pref)));
else
Actuals := New_List (Pref);
end if;
end;
elsif Present (Formal) then
Actuals := New_List;
else
Actuals := No_List;
end if;
if Present (Formal) then
while Present (Formal) loop
Append (New_Occurrence_Of (Formal, Loc), Actuals);
Next_Formal (Formal);
end loop;
end if;
-- If the renamed entity is an entry, inherit its profile. For other
-- renamings as bodies, both profiles must be subtype conformant, so it
-- is not necessary to replace the profile given in the declaration.
-- However, default values that are aggregates are rewritten when
-- partially analyzed, so we recover the original aggregate to insure
-- that subsequent conformity checking works. Similarly, if the default
-- expression was constant-folded, recover the original expression.
Formal := First_Formal (Defining_Entity (Decl));
if Present (Formal) then
O_Formal := First_Formal (Old_S);
Param_Spec := First (Parameter_Specifications (Spec));
while Present (Formal) loop
if Is_Entry (Old_S) then
if Nkind (Parameter_Type (Param_Spec)) /=
N_Access_Definition
then
Set_Etype (Formal, Etype (O_Formal));
Set_Entity (Parameter_Type (Param_Spec), Etype (O_Formal));
end if;
elsif Nkind (Default_Value (O_Formal)) = N_Aggregate
or else Nkind (Original_Node (Default_Value (O_Formal))) /=
Nkind (Default_Value (O_Formal))
then
Set_Expression (Param_Spec,
New_Copy_Tree (Original_Node (Default_Value (O_Formal))));
end if;
Next_Formal (Formal);
Next_Formal (O_Formal);
Next (Param_Spec);
end loop;
end if;
-- If the renamed entity is a function, the generated body contains a
-- return statement. Otherwise, build a procedure call. If the entity is
-- an entry, subsequent analysis of the call will transform it into the
-- proper entry or protected operation call. If the renamed entity is
-- a character literal, return it directly.
if Ekind (Old_S) = E_Function
or else Ekind (Old_S) = E_Operator
or else (Ekind (Old_S) = E_Subprogram_Type
and then Etype (Old_S) /= Standard_Void_Type)
then
Call_Node :=
Make_Simple_Return_Statement (Loc,
Expression =>
Make_Function_Call (Loc,
Name => Call_Name,
Parameter_Associations => Actuals));
elsif Ekind (Old_S) = E_Enumeration_Literal then
Call_Node :=
Make_Simple_Return_Statement (Loc,
Expression => New_Occurrence_Of (Old_S, Loc));
elsif Nkind (Nam) = N_Character_Literal then
Call_Node :=
Make_Simple_Return_Statement (Loc, Expression => Call_Name);
else
Call_Node :=
Make_Procedure_Call_Statement (Loc,
Name => Call_Name,
Parameter_Associations => Actuals);
end if;
-- Create entities for subprogram body and formals
Set_Defining_Unit_Name (Spec,
Make_Defining_Identifier (Loc, Chars => Chars (New_S)));
Param_Spec := First (Parameter_Specifications (Spec));
while Present (Param_Spec) loop
Set_Defining_Identifier (Param_Spec,
Make_Defining_Identifier (Loc,
Chars => Chars (Defining_Identifier (Param_Spec))));
Next (Param_Spec);
end loop;
Body_Node :=
Make_Subprogram_Body (Loc,
Specification => Spec,
Declarations => New_List,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (Call_Node)));
if Nkind (Decl) /= N_Subprogram_Declaration then
Rewrite (N,
Make_Subprogram_Declaration (Loc,
Specification => Specification (N)));
end if;
-- Link the body to the entity whose declaration it completes. If
-- the body is analyzed when the renamed entity is frozen, it may
-- be necessary to restore the proper scope (see package Exp_Ch13).
if Nkind (N) = N_Subprogram_Renaming_Declaration
and then Present (Corresponding_Spec (N))
then
Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
else
Set_Corresponding_Spec (Body_Node, New_S);
end if;
return Body_Node;
end Build_Renamed_Body;
--------------------------
-- Check_Address_Clause --
--------------------------
procedure Check_Address_Clause (E : Entity_Id) is
Addr : constant Node_Id := Address_Clause (E);
Typ : constant Entity_Id := Etype (E);
Decl : Node_Id;
Expr : Node_Id;
Init : Node_Id;
Lhs : Node_Id;
Tag_Assign : Node_Id;
begin
if Present (Addr) then
-- For a deferred constant, the initialization value is on full view
if Ekind (E) = E_Constant and then Present (Full_View (E)) then
Decl := Declaration_Node (Full_View (E));
else
Decl := Declaration_Node (E);
end if;
Expr := Expression (Addr);
if Needs_Constant_Address (Decl, Typ) then
Check_Constant_Address_Clause (Expr, E);
-- Has_Delayed_Freeze was set on E when the address clause was
-- analyzed, and must remain set because we want the address
-- clause to be elaborated only after any entity it references
-- has been elaborated.
end if;
-- If Rep_Clauses are to be ignored, remove address clause from
-- list attached to entity, because it may be illegal for gigi,
-- for example by breaking order of elaboration..
if Ignore_Rep_Clauses then
declare
Rep : Node_Id;
begin
Rep := First_Rep_Item (E);
if Rep = Addr then
Set_First_Rep_Item (E, Next_Rep_Item (Addr));
else
while Present (Rep)
and then Next_Rep_Item (Rep) /= Addr
loop
Rep := Next_Rep_Item (Rep);
end loop;
end if;
if Present (Rep) then
Set_Next_Rep_Item (Rep, Next_Rep_Item (Addr));
end if;
end;
-- And now remove the address clause
Kill_Rep_Clause (Addr);
elsif not Error_Posted (Expr)
and then not Needs_Finalization (Typ)
then
Warn_Overlay (Expr, Typ, Name (Addr));
end if;
Init := Expression (Decl);
-- If a variable, or a non-imported constant, overlays a constant
-- object and has an initialization value, then the initialization
-- may end up writing into read-only memory. Detect the cases of
-- statically identical values and remove the initialization. In
-- the other cases, give a warning. We will give other warnings
-- later for the variable if it is assigned.
if (Ekind (E) = E_Variable
or else (Ekind (E) = E_Constant
and then not Is_Imported (E)))
and then Overlays_Constant (E)
and then Present (Init)
then
declare
O_Ent : Entity_Id;
Off : Boolean;
begin
Find_Overlaid_Entity (Addr, O_Ent, Off);
if Ekind (O_Ent) = E_Constant
and then Etype (O_Ent) = Typ
and then Present (Constant_Value (O_Ent))
and then Compile_Time_Compare
(Init,
Constant_Value (O_Ent),
Assume_Valid => True) = EQ
then
Set_No_Initialization (Decl);
return;
elsif Comes_From_Source (Init)
and then Address_Clause_Overlay_Warnings
then
Error_Msg_Sloc := Sloc (Addr);
Error_Msg_NE
("??constant& may be modified via address clause#",
Decl, O_Ent);
end if;
end;
end if;
if Present (Init) then
-- Capture initialization value at point of declaration,
-- and make explicit assignment legal, because object may
-- be a constant.
Remove_Side_Effects (Init);
Lhs := New_Occurrence_Of (E, Sloc (Decl));
Set_Assignment_OK (Lhs);
-- Move initialization to freeze actions, once the object has
-- been frozen and the address clause alignment check has been
-- performed.
Append_Freeze_Action (E,
Make_Assignment_Statement (Sloc (Decl),
Name => Lhs,
Expression => Expression (Decl)));
Set_No_Initialization (Decl);
-- If the objet is tagged, check whether the tag must be
-- reassigned explicitly.
Tag_Assign := Make_Tag_Assignment (Decl);
if Present (Tag_Assign) then
Append_Freeze_Action (E, Tag_Assign);
end if;
end if;
end if;
end Check_Address_Clause;
-----------------------------
-- Check_Compile_Time_Size --
-----------------------------
procedure Check_Compile_Time_Size (T : Entity_Id) is
procedure Set_Small_Size (T : Entity_Id; S : Uint);
-- Sets the compile time known size (64 bits or less) in the RM_Size
-- field of T, checking for a size clause that was given which attempts
-- to give a smaller size.
function Size_Known (T : Entity_Id) return Boolean;
-- Recursive function that does all the work
function Static_Discriminated_Components (T : Entity_Id) return Boolean;
-- If T is a constrained subtype, its size is not known if any of its
-- discriminant constraints is not static and it is not a null record.
-- The test is conservative and doesn't check that the components are
-- in fact constrained by non-static discriminant values. Could be made
-- more precise ???
--------------------
-- Set_Small_Size --
--------------------
procedure Set_Small_Size (T : Entity_Id; S : Uint) is
begin
if S > 64 then
return;
-- Check for bad size clause given
elsif Has_Size_Clause (T) then
if RM_Size (T) < S then
Error_Msg_Uint_1 := S;
Error_Msg_NE
("size for& too small, minimum allowed is ^",
Size_Clause (T), T);
end if;
-- Set size if not set already
elsif Unknown_RM_Size (T) then
Set_RM_Size (T, S);
end if;
end Set_Small_Size;
----------------
-- Size_Known --
----------------
function Size_Known (T : Entity_Id) return Boolean is
Index : Entity_Id;
Comp : Entity_Id;
Ctyp : Entity_Id;
Low : Node_Id;
High : Node_Id;
begin
if Size_Known_At_Compile_Time (T) then
return True;
-- Always True for elementary types, even generic formal elementary
-- types. We used to return False in the latter case, but the size
-- is known at compile time, even in the template, we just do not
-- know the exact size but that's not the point of this routine.
elsif Is_Elementary_Type (T) or else Is_Task_Type (T) then
return True;
-- Array types
elsif Is_Array_Type (T) then
-- String literals always have known size, and we can set it
if Ekind (T) = E_String_Literal_Subtype then
Set_Small_Size
(T, Component_Size (T) * String_Literal_Length (T));
return True;
-- Unconstrained types never have known at compile time size
elsif not Is_Constrained (T) then
return False;
-- Don't do any recursion on type with error posted, since we may
-- have a malformed type that leads us into a loop.
elsif Error_Posted (T) then
return False;
-- Otherwise if component size unknown, then array size unknown
elsif not Size_Known (Component_Type (T)) then
return False;
end if;
-- Check for all indexes static, and also compute possible size
-- (in case it is not greater than 64 and may be packable).
declare
Size : Uint := Component_Size (T);
Dim : Uint;
begin
Index := First_Index (T);
while Present (Index) loop
if Nkind (Index) = N_Range then
Get_Index_Bounds (Index, Low, High);
elsif Error_Posted (Scalar_Range (Etype (Index))) then
return False;
else
Low := Type_Low_Bound (Etype (Index));
High := Type_High_Bound (Etype (Index));
end if;
if not Compile_Time_Known_Value (Low)
or else not Compile_Time_Known_Value (High)
or else Etype (Index) = Any_Type
then
return False;
else
Dim := Expr_Value (High) - Expr_Value (Low) + 1;
if Dim >= 0 then
Size := Size * Dim;
else
Size := Uint_0;
end if;
end if;
Next_Index (Index);
end loop;
Set_Small_Size (T, Size);
return True;
end;
-- For non-generic private types, go to underlying type if present
elsif Is_Private_Type (T)
and then not Is_Generic_Type (T)
and then Present (Underlying_Type (T))
then
-- Don't do any recursion on type with error posted, since we may
-- have a malformed type that leads us into a loop.
if Error_Posted (T) then
return False;
else
return Size_Known (Underlying_Type (T));
end if;
-- Record types
elsif Is_Record_Type (T) then
-- A class-wide type is never considered to have a known size
if Is_Class_Wide_Type (T) then
return False;
-- A subtype of a variant record must not have non-static
-- discriminated components.
elsif T /= Base_Type (T)
and then not Static_Discriminated_Components (T)
then
return False;
-- Don't do any recursion on type with error posted, since we may
-- have a malformed type that leads us into a loop.
elsif Error_Posted (T) then
return False;
end if;
-- Now look at the components of the record
declare
-- The following two variables are used to keep track of the
-- size of packed records if we can tell the size of the packed
-- record in the front end. Packed_Size_Known is True if so far
-- we can figure out the size. It is initialized to True for a
-- packed record, unless the record has discriminants or atomic
-- components or independent components.
-- The reason we eliminate the discriminated case is that
-- we don't know the way the back end lays out discriminated
-- packed records. If Packed_Size_Known is True, then
-- Packed_Size is the size in bits so far.
Packed_Size_Known : Boolean :=
Is_Packed (T)
and then not Has_Discriminants (T)
and then not Has_Atomic_Components (T)
and then not Has_Independent_Components (T);
Packed_Size : Uint := Uint_0;
-- Size in bits so far
begin
-- Test for variant part present
if Has_Discriminants (T)
and then Present (Parent (T))
and then Nkind (Parent (T)) = N_Full_Type_Declaration
and then Nkind (Type_Definition (Parent (T))) =
N_Record_Definition
and then not Null_Present (Type_Definition (Parent (T)))
and then
Present (Variant_Part
(Component_List (Type_Definition (Parent (T)))))
then
-- If variant part is present, and type is unconstrained,
-- then we must have defaulted discriminants, or a size
-- clause must be present for the type, or else the size
-- is definitely not known at compile time.
if not Is_Constrained (T)
and then
No (Discriminant_Default_Value (First_Discriminant (T)))
and then Unknown_RM_Size (T)
then
return False;
end if;
end if;
-- Loop through components
Comp := First_Component_Or_Discriminant (T);
while Present (Comp) loop
Ctyp := Etype (Comp);
-- We do not know the packed size if there is a component
-- clause present (we possibly could, but this would only
-- help in the case of a record with partial rep clauses.
-- That's because in the case of full rep clauses, the
-- size gets figured out anyway by a different circuit).
if Present (Component_Clause (Comp)) then
Packed_Size_Known := False;
end if;
-- We do not know the packed size for an atomic/VFA type
-- or component, or an independent type or component, or a
-- by-reference type or aliased component (because packing
-- does not touch these).
if Is_Atomic_Or_VFA (Ctyp)
or else Is_Atomic_Or_VFA (Comp)
or else Is_Independent (Ctyp)
or else Is_Independent (Comp)
or else Is_By_Reference_Type (Ctyp)
or else Is_Aliased (Comp)
then
Packed_Size_Known := False;
end if;
-- We need to identify a component that is an array where
-- the index type is an enumeration type with non-standard
-- representation, and some bound of the type depends on a
-- discriminant.
-- This is because gigi computes the size by doing a
-- substitution of the appropriate discriminant value in
-- the size expression for the base type, and gigi is not
-- clever enough to evaluate the resulting expression (which
-- involves a call to rep_to_pos) at compile time.
-- It would be nice if gigi would either recognize that
-- this expression can be computed at compile time, or
-- alternatively figured out the size from the subtype
-- directly, where all the information is at hand ???
if Is_Array_Type (Etype (Comp))
and then Present (Packed_Array_Impl_Type (Etype (Comp)))
then
declare
Ocomp : constant Entity_Id :=
Original_Record_Component (Comp);
OCtyp : constant Entity_Id := Etype (Ocomp);
Ind : Node_Id;
Indtyp : Entity_Id;
Lo, Hi : Node_Id;
begin
Ind := First_Index (OCtyp);
while Present (Ind) loop
Indtyp := Etype (Ind);
if Is_Enumeration_Type (Indtyp)
and then Has_Non_Standard_Rep (Indtyp)
then
Lo := Type_Low_Bound (Indtyp);
Hi := Type_High_Bound (Indtyp);
if Is_Entity_Name (Lo)
and then Ekind (Entity (Lo)) = E_Discriminant
then
return False;
elsif Is_Entity_Name (Hi)
and then Ekind (Entity (Hi)) = E_Discriminant
then
return False;
end if;
end if;
Next_Index (Ind);
end loop;
end;
end if;
-- Clearly size of record is not known if the size of one of
-- the components is not known.
if not Size_Known (Ctyp) then
return False;
end if;
-- Accumulate packed size if possible
if Packed_Size_Known then
-- We can deal with elementary types, small packed arrays
-- if the representation is a modular type and also small
-- record types (if the size is not greater than 64, but
-- the condition is checked by Set_Small_Size).
if Is_Elementary_Type (Ctyp)
or else (Is_Array_Type (Ctyp)
and then Present
(Packed_Array_Impl_Type (Ctyp))
and then Is_Modular_Integer_Type
(Packed_Array_Impl_Type (Ctyp)))
or else Is_Record_Type (Ctyp)
then
-- If RM_Size is known and static, then we can keep
-- accumulating the packed size.
if Known_Static_RM_Size (Ctyp) then
Packed_Size := Packed_Size + RM_Size (Ctyp);
-- If we have a field whose RM_Size is not known then
-- we can't figure out the packed size here.
else
Packed_Size_Known := False;
end if;
-- For other types we can't figure out the packed size
else
Packed_Size_Known := False;
end if;
end if;
Next_Component_Or_Discriminant (Comp);
end loop;
if Packed_Size_Known then
Set_Small_Size (T, Packed_Size);
end if;
return True;
end;
-- All other cases, size not known at compile time
else
return False;
end if;
end Size_Known;
-------------------------------------
-- Static_Discriminated_Components --
-------------------------------------
function Static_Discriminated_Components
(T : Entity_Id) return Boolean
is
Constraint : Elmt_Id;
begin
if Has_Discriminants (T)
and then Present (Discriminant_Constraint (T))
and then Present (First_Component (T))
then
Constraint := First_Elmt (Discriminant_Constraint (T));
while Present (Constraint) loop
if not Compile_Time_Known_Value (Node (Constraint)) then
return False;
end if;
Next_Elmt (Constraint);
end loop;
end if;
return True;
end Static_Discriminated_Components;
-- Start of processing for Check_Compile_Time_Size
begin
Set_Size_Known_At_Compile_Time (T, Size_Known (T));
end Check_Compile_Time_Size;
-----------------------------------
-- Check_Component_Storage_Order --
-----------------------------------
procedure Check_Component_Storage_Order
(Encl_Type : Entity_Id;
Comp : Entity_Id;
ADC : Node_Id;
Comp_ADC_Present : out Boolean)
is
Comp_Base : Entity_Id;
Comp_ADC : Node_Id;
Encl_Base : Entity_Id;
Err_Node : Node_Id;
Component_Aliased : Boolean;
Comp_Byte_Aligned : Boolean;
-- Set for the record case, True if Comp starts on a byte boundary
-- (in which case it is allowed to have different storage order).
Comp_SSO_Differs : Boolean;
-- Set True when the component is a nested composite, and it does not
-- have the same scalar storage order as Encl_Type.
begin
-- Record case
if Present (Comp) then
Err_Node := Comp;
Comp_Base := Etype (Comp);
if Is_Tag (Comp) then
Comp_Byte_Aligned := True;
Component_Aliased := False;
else
-- If a component clause is present, check if the component starts
-- on a storage element boundary. Otherwise conservatively assume
-- it does so only in the case where the record is not packed.
if Present (Component_Clause (Comp)) then
Comp_Byte_Aligned :=
Normalized_First_Bit (Comp) mod System_Storage_Unit = 0;
else
Comp_Byte_Aligned := not Is_Packed (Encl_Type);
end if;
Component_Aliased := Is_Aliased (Comp);
end if;
-- Array case
else
Err_Node := Encl_Type;
Comp_Base := Component_Type (Encl_Type);
Component_Aliased := Has_Aliased_Components (Encl_Type);
end if;
-- Note: the Reverse_Storage_Order flag is set on the base type, but
-- the attribute definition clause is attached to the first subtype.
-- Also, if the base type is incomplete or private, go to full view
-- if known
Encl_Base := Base_Type (Encl_Type);
if Present (Underlying_Type (Encl_Base)) then
Encl_Base := Underlying_Type (Encl_Base);
end if;
Comp_Base := Base_Type (Comp_Base);
if Present (Underlying_Type (Comp_Base)) then
Comp_Base := Underlying_Type (Comp_Base);
end if;
Comp_ADC :=
Get_Attribute_Definition_Clause
(First_Subtype (Comp_Base), Attribute_Scalar_Storage_Order);
Comp_ADC_Present := Present (Comp_ADC);
-- Case of record or array component: check storage order compatibility.
-- But, if the record has Complex_Representation, then it is treated as
-- a scalar in the back end so the storage order is irrelevant.
if (Is_Record_Type (Comp_Base)
and then not Has_Complex_Representation (Comp_Base))
or else Is_Array_Type (Comp_Base)
then
Comp_SSO_Differs :=
Reverse_Storage_Order (Encl_Base) /=
Reverse_Storage_Order (Comp_Base);
-- Parent and extension must have same storage order
if Present (Comp) and then Chars (Comp) = Name_uParent then
if Comp_SSO_Differs then
Error_Msg_N
("record extension must have same scalar storage order as "
& "parent", Err_Node);
end if;
-- If component and composite SSO differs, check that component
-- falls on byte boundaries and isn't bit packed.
elsif Comp_SSO_Differs then
-- Component SSO differs from enclosing composite:
-- Reject if component is a bit-packed array, as it is represented
-- as a scalar internally.
if Is_Bit_Packed_Array (Comp_Base) then
Error_Msg_N
("type of packed component must have same scalar storage "
& "order as enclosing composite", Err_Node);
-- Reject if composite is a bit-packed array, as it is rewritten
-- into an array of scalars.
elsif Is_Bit_Packed_Array (Encl_Base) then
Error_Msg_N
("type of packed array must have same scalar storage order "
& "as component", Err_Node);
-- Reject if not byte aligned
elsif Is_Record_Type (Encl_Base)
and then not Comp_Byte_Aligned
then
Error_Msg_N
("type of non-byte-aligned component must have same scalar "
& "storage order as enclosing composite", Err_Node);
-- Warn if specified only for the outer composite
elsif Present (ADC) and then No (Comp_ADC) then
Error_Msg_NE
("scalar storage order specified for & does not apply to "
& "component?", Err_Node, Encl_Base);
end if;
end if;
-- Enclosing type has explicit SSO: non-composite component must not
-- be aliased.
elsif Present (ADC) and then Component_Aliased then
Error_Msg_N
("aliased component not permitted for type with explicit "
& "Scalar_Storage_Order", Err_Node);
end if;
end Check_Component_Storage_Order;
-----------------------------
-- Check_Debug_Info_Needed --
-----------------------------
procedure Check_Debug_Info_Needed (T : Entity_Id) is
begin
if Debug_Info_Off (T) then
return;
elsif Comes_From_Source (T)
or else Debug_Generated_Code
or else Debug_Flag_VV
or else Needs_Debug_Info (T)
then
Set_Debug_Info_Needed (T);
end if;
end Check_Debug_Info_Needed;
-------------------------------
-- Check_Expression_Function --
-------------------------------
procedure Check_Expression_Function (N : Node_Id; Nam : Entity_Id) is
function Find_Constant (Nod : Node_Id) return Traverse_Result;
-- Function to search for deferred constant
-------------------
-- Find_Constant --
-------------------
function Find_Constant (Nod : Node_Id) return Traverse_Result is
begin
-- When a constant is initialized with the result of a dispatching
-- call, the constant declaration is rewritten as a renaming of the
-- displaced function result. This scenario is not a premature use of
-- a constant even though the Has_Completion flag is not set.
if Is_Entity_Name (Nod)
and then Present (Entity (Nod))
and then Ekind (Entity (Nod)) = E_Constant
and then Scope (Entity (Nod)) = Current_Scope
and then Nkind (Declaration_Node (Entity (Nod))) =
N_Object_Declaration
and then not Is_Imported (Entity (Nod))
and then not Has_Completion (Entity (Nod))
and then not Is_Frozen (Entity (Nod))
then
Error_Msg_NE
("premature use of& in call or instance", N, Entity (Nod));
elsif Nkind (Nod) = N_Attribute_Reference then
Analyze (Prefix (Nod));
if Is_Entity_Name (Prefix (Nod))
and then Is_Type (Entity (Prefix (Nod)))
then
Freeze_Before (N, Entity (Prefix (Nod)));
end if;
end if;
return OK;
end Find_Constant;
procedure Check_Deferred is new Traverse_Proc (Find_Constant);
-- Local variables
Decl : Node_Id;
-- Start of processing for Check_Expression_Function
begin
Decl := Original_Node (Unit_Declaration_Node (Nam));
if Scope (Nam) = Current_Scope
and then Nkind (Decl) = N_Expression_Function
then
Check_Deferred (Expression (Decl));
end if;
end Check_Expression_Function;
--------------------------------
-- Check_Inherited_Conditions --
--------------------------------
procedure Check_Inherited_Conditions (R : Entity_Id) is
Prim_Ops : constant Elist_Id := Primitive_Operations (R);
A_Post : Node_Id;
A_Pre : Node_Id;
Op_Node : Elmt_Id;
Par_Prim : Entity_Id;
Prim : Entity_Id;
begin
Op_Node := First_Elmt (Prim_Ops);
while Present (Op_Node) loop
Prim := Node (Op_Node);
-- Map the overridden primitive to the overriding one. This takes
-- care of all overridings and is done only once.
if Present (Overridden_Operation (Prim))
and then Comes_From_Source (Prim)
then
Update_Primitives_Mapping (Overridden_Operation (Prim), Prim);
-- In SPARK mode this is where we can collect the inherited
-- conditions, because we do not create the Check pragmas that
-- normally convey the the modified class-wide conditions on
-- overriding operations.
if SPARK_Mode = On then
-- Analyze the contract items of the parent operation, before
-- they are rewritten when inherited.
Analyze_Entry_Or_Subprogram_Contract
(Overridden_Operation (Prim));
-- Now verify the legality of inherited contracts for LSP
-- conformance.
Collect_Inherited_Class_Wide_Conditions (Prim);
end if;
end if;
Next_Elmt (Op_Node);
end loop;
-- In all cases, we examine inherited operations to check whether they
-- require a wrapper to handle inherited conditions that call other
-- primitives, so that LSP can be verified/enforced.
-- Wrapper construction TBD.
Op_Node := First_Elmt (Prim_Ops);
while Present (Op_Node) loop
Prim := Node (Op_Node);
if not Comes_From_Source (Prim) and then Present (Alias (Prim)) then
Par_Prim := Alias (Prim);
-- Analyze the contract items of the parent operation, before
-- they are rewritten when inherited.
Analyze_Entry_Or_Subprogram_Contract (Par_Prim);
A_Pre := Get_Pragma (Par_Prim, Pragma_Precondition);
if Present (A_Pre) and then Class_Present (A_Pre) then
Build_Class_Wide_Expression
(Prag => New_Copy_Tree (A_Pre),
Subp => Prim,
Par_Subp => Par_Prim,
Adjust_Sloc => False);
end if;
A_Post := Get_Pragma (Par_Prim, Pragma_Postcondition);
if Present (A_Post) and then Class_Present (A_Post) then
Build_Class_Wide_Expression
(Prag => New_Copy_Tree (A_Post),
Subp => Prim,
Par_Subp => Par_Prim,
Adjust_Sloc => False);
end if;
end if;
Next_Elmt (Op_Node);
end loop;
end Check_Inherited_Conditions;
----------------------------
-- Check_Strict_Alignment --
----------------------------
procedure Check_Strict_Alignment (E : Entity_Id) is
Comp : Entity_Id;
begin
if Is_Tagged_Type (E) or else Is_Concurrent_Type (E) then
Set_Strict_Alignment (E);
elsif Is_Array_Type (E) then
Set_Strict_Alignment (E, Strict_Alignment (Component_Type (E)));
elsif Is_Record_Type (E) then
if Is_Limited_Record (E) then
Set_Strict_Alignment (E);
return;
end if;
Comp := First_Component (E);
while Present (Comp) loop
if not Is_Type (Comp)
and then (Strict_Alignment (Etype (Comp))
or else Is_Aliased (Comp))
then
Set_Strict_Alignment (E);
return;
end if;
Next_Component (Comp);
end loop;
end if;
end Check_Strict_Alignment;
-------------------------
-- Check_Unsigned_Type --
-------------------------
procedure Check_Unsigned_Type (E : Entity_Id) is
Ancestor : Entity_Id;
Lo_Bound : Node_Id;
Btyp : Entity_Id;
begin
if not Is_Discrete_Or_Fixed_Point_Type (E) then
return;
end if;
-- Do not attempt to analyze case where range was in error
if No (Scalar_Range (E)) or else Error_Posted (Scalar_Range (E)) then
return;
end if;
-- The situation that is nontrivial is something like:
-- subtype x1 is integer range -10 .. +10;
-- subtype x2 is x1 range 0 .. V1;
-- subtype x3 is x2 range V2 .. V3;
-- subtype x4 is x3 range V4 .. V5;
-- where Vn are variables. Here the base type is signed, but we still
-- know that x4 is unsigned because of the lower bound of x2.
-- The only way to deal with this is to look up the ancestor chain
Ancestor := E;
loop
if Ancestor = Any_Type or else Etype (Ancestor) = Any_Type then
return;
end if;
Lo_Bound := Type_Low_Bound (Ancestor);
if Compile_Time_Known_Value (Lo_Bound) then
if Expr_Rep_Value (Lo_Bound) >= 0 then
Set_Is_Unsigned_Type (E, True);
end if;
return;
else
Ancestor := Ancestor_Subtype (Ancestor);
-- If no ancestor had a static lower bound, go to base type
if No (Ancestor) then
-- Note: the reason we still check for a compile time known
-- value for the base type is that at least in the case of
-- generic formals, we can have bounds that fail this test,
-- and there may be other cases in error situations.
Btyp := Base_Type (E);
if Btyp = Any_Type or else Etype (Btyp) = Any_Type then
return;
end if;
Lo_Bound := Type_Low_Bound (Base_Type (E));
if Compile_Time_Known_Value (Lo_Bound)
and then Expr_Rep_Value (Lo_Bound) >= 0
then
Set_Is_Unsigned_Type (E, True);
end if;
return;
end if;
end if;
end loop;
end Check_Unsigned_Type;
-----------------------------
-- Is_Atomic_VFA_Aggregate --
-----------------------------
function Is_Atomic_VFA_Aggregate (N : Node_Id) return Boolean is
Loc : constant Source_Ptr := Sloc (N);
New_N : Node_Id;
Par : Node_Id;
Temp : Entity_Id;
Typ : Entity_Id;
begin
Par := Parent (N);
-- Array may be qualified, so find outer context
if Nkind (Par) = N_Qualified_Expression then
Par := Parent (Par);
end if;
if not Comes_From_Source (Par) then
return False;
end if;
case Nkind (Par) is
when N_Assignment_Statement =>
Typ := Etype (Name (Par));
if not Is_Atomic_Or_VFA (Typ)
and then not (Is_Entity_Name (Name (Par))
and then Is_Atomic_Or_VFA (Entity (Name (Par))))
then
return False;
end if;
when N_Object_Declaration =>
Typ := Etype (Defining_Identifier (Par));
if not Is_Atomic_Or_VFA (Typ)
and then not Is_Atomic_Or_VFA (Defining_Identifier (Par))
then
return False;
end if;
when others =>
return False;
end case;
Temp := Make_Temporary (Loc, 'T', N);
New_N :=
Make_Object_Declaration (Loc,
Defining_Identifier => Temp,
Object_Definition => New_Occurrence_Of (Typ, Loc),
Expression => Relocate_Node (N));
Insert_Before (Par, New_N);
Analyze (New_N);
Set_Expression (Par, New_Occurrence_Of (Temp, Loc));
return True;
end Is_Atomic_VFA_Aggregate;
-----------------------------------------------
-- Explode_Initialization_Compound_Statement --
-----------------------------------------------
procedure Explode_Initialization_Compound_Statement (E : Entity_Id) is
Init_Stmts : constant Node_Id := Initialization_Statements (E);
begin
if Present (Init_Stmts)
and then Nkind (Init_Stmts) = N_Compound_Statement
then
Insert_List_Before (Init_Stmts, Actions (Init_Stmts));
-- Note that we rewrite Init_Stmts into a NULL statement, rather than
-- just removing it, because Freeze_All may rely on this particular
-- Node_Id still being present in the enclosing list to know where to
-- stop freezing.
Rewrite (Init_Stmts, Make_Null_Statement (Sloc (Init_Stmts)));
Set_Initialization_Statements (E, Empty);
end if;
end Explode_Initialization_Compound_Statement;
----------------
-- Freeze_All --
----------------
-- Note: the easy coding for this procedure would be to just build a
-- single list of freeze nodes and then insert them and analyze them
-- all at once. This won't work, because the analysis of earlier freeze
-- nodes may recursively freeze types which would otherwise appear later
-- on in the freeze list. So we must analyze and expand the freeze nodes
-- as they are generated.
procedure Freeze_All (From : Entity_Id; After : in out Node_Id) is
procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id);
-- This is the internal recursive routine that does freezing of entities
-- (but NOT the analysis of default expressions, which should not be
-- recursive, we don't want to analyze those till we are sure that ALL
-- the types are frozen).
--------------------
-- Freeze_All_Ent --
--------------------
procedure Freeze_All_Ent (From : Entity_Id; After : in out Node_Id) is
E : Entity_Id;
Flist : List_Id;
Lastn : Node_Id;
procedure Process_Flist;
-- If freeze nodes are present, insert and analyze, and reset cursor
-- for next insertion.
-------------------
-- Process_Flist --
-------------------
procedure Process_Flist is
begin
if Is_Non_Empty_List (Flist) then
Lastn := Next (After);
Insert_List_After_And_Analyze (After, Flist);
if Present (Lastn) then
After := Prev (Lastn);
else
After := Last (List_Containing (After));
end if;
end if;
end Process_Flist;
-- Start of processing for Freeze_All_Ent
begin
E := From;
while Present (E) loop
-- If the entity is an inner package which is not a package
-- renaming, then its entities must be frozen at this point. Note
-- that such entities do NOT get frozen at the end of the nested
-- package itself (only library packages freeze).
-- Same is true for task declarations, where anonymous records
-- created for entry parameters must be frozen.
if Ekind (E) = E_Package
and then No (Renamed_Object (E))
and then not Is_Child_Unit (E)
and then not Is_Frozen (E)
then
Push_Scope (E);
Install_Visible_Declarations (E);
Install_Private_Declarations (E);
Freeze_All (First_Entity (E), After);
End_Package_Scope (E);
if Is_Generic_Instance (E)
and then Has_Delayed_Freeze (E)
then
Set_Has_Delayed_Freeze (E, False);
Expand_N_Package_Declaration (Unit_Declaration_Node (E));
end if;
elsif Ekind (E) in Task_Kind
and then Nkind_In (Parent (E), N_Single_Task_Declaration,
N_Task_Type_Declaration)
then
Push_Scope (E);
Freeze_All (First_Entity (E), After);
End_Scope;
-- For a derived tagged type, we must ensure that all the
-- primitive operations of the parent have been frozen, so that
-- their addresses will be in the parent's dispatch table at the
-- point it is inherited.
elsif Ekind (E) = E_Record_Type
and then Is_Tagged_Type (E)
and then Is_Tagged_Type (Etype (E))
and then Is_Derived_Type (E)
then
declare
Prim_List : constant Elist_Id :=
Primitive_Operations (Etype (E));
Prim : Elmt_Id;
Subp : Entity_Id;
begin
Prim := First_Elmt (Prim_List);
while Present (Prim) loop
Subp := Node (Prim);
if Comes_From_Source (Subp)
and then not Is_Frozen (Subp)
then
Flist := Freeze_Entity (Subp, After);
Process_Flist;
end if;
Next_Elmt (Prim);
end loop;
end;
end if;
if not Is_Frozen (E) then
Flist := Freeze_Entity (E, After);
Process_Flist;
-- If already frozen, and there are delayed aspects, this is where
-- we do the visibility check for these aspects (see Sem_Ch13 spec
-- for a description of how we handle aspect visibility).
elsif Has_Delayed_Aspects (E) then
-- Retrieve the visibility to the discriminants in order to
-- analyze properly the aspects.
Push_Scope_And_Install_Discriminants (E);
declare
Ritem : Node_Id;
begin
Ritem := First_Rep_Item (E);
while Present (Ritem) loop
if Nkind (Ritem) = N_Aspect_Specification
and then Entity (Ritem) = E
and then Is_Delayed_Aspect (Ritem)
then
Check_Aspect_At_End_Of_Declarations (Ritem);
end if;
Ritem := Next_Rep_Item (Ritem);
end loop;
end;
Uninstall_Discriminants_And_Pop_Scope (E);
end if;
-- If an incomplete type is still not frozen, this may be a
-- premature freezing because of a body declaration that follows.
-- Indicate where the freezing took place. Freezing will happen
-- if the body comes from source, but not if it is internally
-- generated, for example as the body of a type invariant.
-- If the freezing is caused by the end of the current declarative
-- part, it is a Taft Amendment type, and there is no error.
if not Is_Frozen (E)
and then Ekind (E) = E_Incomplete_Type
then
declare
Bod : constant Node_Id := Next (After);
begin
-- The presence of a body freezes all entities previously
-- declared in the current list of declarations, but this
-- does not apply if the body does not come from source.
-- A type invariant is transformed into a subprogram body
-- which is placed at the end of the private part of the
-- current package, but this body does not freeze incomplete
-- types that may be declared in this private part.
if (Nkind_In (Bod, N_Entry_Body,
N_Package_Body,
N_Protected_Body,
N_Subprogram_Body,
N_Task_Body)
or else Nkind (Bod) in N_Body_Stub)
and then
List_Containing (After) = List_Containing (Parent (E))
and then Comes_From_Source (Bod)
then
Error_Msg_Sloc := Sloc (Next (After));
Error_Msg_NE
("type& is frozen# before its full declaration",
Parent (E), E);
end if;
end;
end if;
Next_Entity (E);
end loop;
end Freeze_All_Ent;
-- Local variables
Decl : Node_Id;
E : Entity_Id;
Item : Entity_Id;
-- Start of processing for Freeze_All
begin
Freeze_All_Ent (From, After);
-- Now that all types are frozen, we can deal with default expressions
-- that require us to build a default expression functions. This is the
-- point at which such functions are constructed (after all types that
-- might be used in such expressions have been frozen).
-- For subprograms that are renaming_as_body, we create the wrapper
-- bodies as needed.
-- We also add finalization chains to access types whose designated
-- types are controlled. This is normally done when freezing the type,
-- but this misses recursive type definitions where the later members
-- of the recursion introduce controlled components.
-- Loop through entities
E := From;
while Present (E) loop
if Is_Subprogram (E) then
if not Default_Expressions_Processed (E) then
Process_Default_Expressions (E, After);
end if;
if not Has_Completion (E) then
Decl := Unit_Declaration_Node (E);
if Nkind (Decl) = N_Subprogram_Renaming_Declaration then
if Error_Posted (Decl) then
Set_Has_Completion (E);
else
Build_And_Analyze_Renamed_Body (Decl, E, After);
end if;
elsif Nkind (Decl) = N_Subprogram_Declaration
and then Present (Corresponding_Body (Decl))
and then
Nkind (Unit_Declaration_Node (Corresponding_Body (Decl))) =
N_Subprogram_Renaming_Declaration
then
Build_And_Analyze_Renamed_Body
(Decl, Corresponding_Body (Decl), After);
end if;
end if;
-- Freeze the default expressions of entries, entry families, and
-- protected subprograms.
elsif Is_Concurrent_Type (E) then
Item := First_Entity (E);
while Present (Item) loop
if (Is_Entry (Item) or else Is_Subprogram (Item))
and then not Default_Expressions_Processed (Item)
then
Process_Default_Expressions (Item, After);
end if;
Next_Entity (Item);
end loop;
end if;
-- Historical note: We used to create a finalization master for an
-- access type whose designated type is not controlled, but contains
-- private controlled compoments. This form of postprocessing is no
-- longer needed because the finalization master is now created when
-- the access type is frozen (see Exp_Ch3.Freeze_Type).
Next_Entity (E);
end loop;
end Freeze_All;
-----------------------
-- Freeze_And_Append --
-----------------------
procedure Freeze_And_Append
(Ent : Entity_Id;
N : Node_Id;
Result : in out List_Id)
is
L : constant List_Id := Freeze_Entity (Ent, N);
begin
if Is_Non_Empty_List (L) then
if Result = No_List then
Result := L;
else
Append_List (L, Result);
end if;
end if;
end Freeze_And_Append;
-------------------
-- Freeze_Before --
-------------------
procedure Freeze_Before
(N : Node_Id;
T : Entity_Id;
Do_Freeze_Profile : Boolean := True)
is
-- Freeze T, then insert the generated Freeze nodes before the node N.
-- Flag Freeze_Profile is used when T is an overloadable entity, and
-- indicates whether its profile should be frozen at the same time.
Freeze_Nodes : constant List_Id :=
Freeze_Entity (T, N, Do_Freeze_Profile);
begin
if Ekind (T) = E_Function then
Check_Expression_Function (N, T);
end if;
if Is_Non_Empty_List (Freeze_Nodes) then
Insert_Actions (N, Freeze_Nodes);
end if;
end Freeze_Before;
-------------------
-- Freeze_Entity --
-------------------
-- WARNING: This routine manages Ghost regions. Return statements must be
-- replaced by gotos which jump to the end of the routine and restore the
-- Ghost mode.
function Freeze_Entity
(E : Entity_Id;
N : Node_Id;
Do_Freeze_Profile : Boolean := True) return List_Id
is
Loc : constant Source_Ptr := Sloc (N);
Atype : Entity_Id;
Comp : Entity_Id;
F_Node : Node_Id;
Formal : Entity_Id;
Indx : Node_Id;
Has_Default_Initialization : Boolean := False;
-- This flag gets set to true for a variable with default initialization
Result : List_Id := No_List;
-- List of freezing actions, left at No_List if none
Test_E : Entity_Id := E;
-- This could use a comment ???
procedure Add_To_Result (N : Node_Id);
-- N is a freezing action to be appended to the Result
function After_Last_Declaration return Boolean;
-- If Loc is a freeze_entity that appears after the last declaration
-- in the scope, inhibit error messages on late completion.
procedure Check_Current_Instance (Comp_Decl : Node_Id);
-- Check that an Access or Unchecked_Access attribute with a prefix
-- which is the current instance type can only be applied when the type
-- is limited.
procedure Check_Suspicious_Convention (Rec_Type : Entity_Id);
-- Give a warning for pragma Convention with language C or C++ applied
-- to a discriminated record type. This is suppressed for the unchecked
-- union case, since the whole point in this case is interface C. We
-- also do not generate this within instantiations, since we will have
-- generated a message on the template.
procedure Check_Suspicious_Modulus (Utype : Entity_Id);
-- Give warning for modulus of 8, 16, 32, or 64 given as an explicit
-- integer literal without an explicit corresponding size clause. The
-- caller has checked that Utype is a modular integer type.
procedure Freeze_Array_Type (Arr : Entity_Id);
-- Freeze array type, including freezing index and component types
procedure Freeze_Object_Declaration (E : Entity_Id);
-- Perform checks and generate freeze node if needed for a constant or
-- variable declared by an object declaration.
function Freeze_Generic_Entities (Pack : Entity_Id) return List_Id;
-- Create Freeze_Generic_Entity nodes for types declared in a generic
-- package. Recurse on inner generic packages.
function Freeze_Profile (E : Entity_Id) return Boolean;
-- Freeze formals and return type of subprogram. If some type in the
-- profile is incomplete and we are in an instance, freezing of the
-- entity will take place elsewhere, and the function returns False.
procedure Freeze_Record_Type (Rec : Entity_Id);
-- Freeze record type, including freezing component types, and freezing
-- primitive operations if this is a tagged type.
function Has_Boolean_Aspect_Import (E : Entity_Id) return Boolean;
-- Determine whether an arbitrary entity is subject to Boolean aspect
-- Import and its value is specified as True.
procedure Inherit_Freeze_Node
(Fnod : Node_Id;
Typ : Entity_Id);
-- Set type Typ's freeze node to refer to Fnode. This routine ensures
-- that any attributes attached to Typ's original node are preserved.
procedure Wrap_Imported_Subprogram (E : Entity_Id);
-- If E is an entity for an imported subprogram with pre/post-conditions
-- then this procedure will create a wrapper to ensure that proper run-
-- time checking of the pre/postconditions. See body for details.
-------------------
-- Add_To_Result --
-------------------
procedure Add_To_Result (N : Node_Id) is
begin
if No (Result) then
Result := New_List (N);
else
Append (N, Result);
end if;
end Add_To_Result;
----------------------------
-- After_Last_Declaration --
----------------------------
function After_Last_Declaration return Boolean is
Spec : constant Node_Id := Parent (Current_Scope);
begin
if Nkind (Spec) = N_Package_Specification then
if Present (Private_Declarations (Spec)) then
return Loc >= Sloc (Last (Private_Declarations (Spec)));
elsif Present (Visible_Declarations (Spec)) then
return Loc >= Sloc (Last (Visible_Declarations (Spec)));
else
return False;
end if;
else
return False;
end if;
end After_Last_Declaration;
----------------------------
-- Check_Current_Instance --
----------------------------
procedure Check_Current_Instance (Comp_Decl : Node_Id) is
function Is_Aliased_View_Of_Type (Typ : Entity_Id) return Boolean;
-- Determine whether Typ is compatible with the rules for aliased
-- views of types as defined in RM 3.10 in the various dialects.
function Process (N : Node_Id) return Traverse_Result;
-- Process routine to apply check to given node
-----------------------------
-- Is_Aliased_View_Of_Type --
-----------------------------
function Is_Aliased_View_Of_Type (Typ : Entity_Id) return Boolean is
Typ_Decl : constant Node_Id := Parent (Typ);
begin
-- Common case
if Nkind (Typ_Decl) = N_Full_Type_Declaration
and then Limited_Present (Type_Definition (Typ_Decl))
then
return True;
-- The following paragraphs describe what a legal aliased view of
-- a type is in the various dialects of Ada.
-- Ada 95
-- The current instance of a limited type, and a formal parameter
-- or generic formal object of a tagged type.
-- Ada 95 limited type
-- * Type with reserved word "limited"
-- * A protected or task type
-- * A composite type with limited component
elsif Ada_Version <= Ada_95 then
return Is_Limited_Type (Typ);
-- Ada 2005
-- The current instance of a limited tagged type, a protected
-- type, a task type, or a type that has the reserved word
-- "limited" in its full definition ... a formal parameter or
-- generic formal object of a tagged type.
-- Ada 2005 limited type
-- * Type with reserved word "limited", "synchronized", "task"
-- or "protected"
-- * A composite type with limited component
-- * A derived type whose parent is a non-interface limited type
elsif Ada_Version = Ada_2005 then
return
(Is_Limited_Type (Typ) and then Is_Tagged_Type (Typ))
or else
(Is_Derived_Type (Typ)
and then not Is_Interface (Etype (Typ))
and then Is_Limited_Type (Etype (Typ)));
-- Ada 2012 and beyond
-- The current instance of an immutably limited type ... a formal
-- parameter or generic formal object of a tagged type.
-- Ada 2012 limited type
-- * Type with reserved word "limited", "synchronized", "task"
-- or "protected"
-- * A composite type with limited component
-- * A derived type whose parent is a non-interface limited type
-- * An incomplete view
-- Ada 2012 immutably limited type
-- * Explicitly limited record type
-- * Record extension with "limited" present
-- * Non-formal limited private type that is either tagged
-- or has at least one access discriminant with a default
-- expression
-- * Task type, protected type or synchronized interface
-- * Type derived from immutably limited type
else
return
Is_Immutably_Limited_Type (Typ)
or else Is_Incomplete_Type (Typ);
end if;
end Is_Aliased_View_Of_Type;
-------------
-- Process --
-------------
function Process (N : Node_Id) return Traverse_Result is
begin
case Nkind (N) is
when N_Attribute_Reference =>
if Nam_In (Attribute_Name (N), Name_Access,
Name_Unchecked_Access)
and then Is_Entity_Name (Prefix (N))
and then Is_Type (Entity (Prefix (N)))
and then Entity (Prefix (N)) = E
then
if Ada_Version < Ada_2012 then
Error_Msg_N
("current instance must be a limited type",
Prefix (N));
else
Error_Msg_N
("current instance must be an immutably limited "
& "type (RM-2012, 7.5 (8.1/3))", Prefix (N));
end if;
return Abandon;
else
return OK;
end if;
when others =>
return OK;
end case;
end Process;
procedure Traverse is new Traverse_Proc (Process);
-- Local variables
Rec_Type : constant Entity_Id :=
Scope (Defining_Identifier (Comp_Decl));
-- Start of processing for Check_Current_Instance
begin
if not Is_Aliased_View_Of_Type (Rec_Type) then
Traverse (Comp_Decl);
end if;
end Check_Current_Instance;
---------------------------------
-- Check_Suspicious_Convention --
---------------------------------
procedure Check_Suspicious_Convention (Rec_Type : Entity_Id) is
begin
if Has_Discriminants (Rec_Type)
and then Is_Base_Type (Rec_Type)
and then not Is_Unchecked_Union (Rec_Type)
and then (Convention (Rec_Type) = Convention_C
or else
Convention (Rec_Type) = Convention_CPP)
and then Comes_From_Source (Rec_Type)
and then not In_Instance
and then not Has_Warnings_Off (Rec_Type)
then
declare
Cprag : constant Node_Id :=
Get_Rep_Pragma (Rec_Type, Name_Convention);
A2 : Node_Id;
begin
if Present (Cprag) then
A2 := Next (First (Pragma_Argument_Associations (Cprag)));
if Convention (Rec_Type) = Convention_C then
Error_Msg_N
("?x?discriminated record has no direct equivalent in "
& "C", A2);
else
Error_Msg_N
("?x?discriminated record has no direct equivalent in "
& "C++", A2);
end if;
Error_Msg_NE
("\?x?use of convention for type& is dubious",
A2, Rec_Type);
end if;
end;
end if;
end Check_Suspicious_Convention;
------------------------------
-- Check_Suspicious_Modulus --
------------------------------
procedure Check_Suspicious_Modulus (Utype : Entity_Id) is
Decl : constant Node_Id := Declaration_Node (Underlying_Type (Utype));
begin
if not Warn_On_Suspicious_Modulus_Value then
return;
end if;
if Nkind (Decl) = N_Full_Type_Declaration then
declare
Tdef : constant Node_Id := Type_Definition (Decl);
begin
if Nkind (Tdef) = N_Modular_Type_Definition then
declare
Modulus : constant Node_Id :=
Original_Node (Expression (Tdef));
begin
if Nkind (Modulus) = N_Integer_Literal then
declare
Modv : constant Uint := Intval (Modulus);
Sizv : constant Uint := RM_Size (Utype);
begin
-- First case, modulus and size are the same. This
-- happens if you have something like mod 32, with
-- an explicit size of 32, this is for sure a case
-- where the warning is given, since it is seems
-- very unlikely that someone would want e.g. a
-- five bit type stored in 32 bits. It is much
-- more likely they wanted a 32-bit type.
if Modv = Sizv then
null;
-- Second case, the modulus is 32 or 64 and no
-- size clause is present. This is a less clear
-- case for giving the warning, but in the case
-- of 32/64 (5-bit or 6-bit types) these seem rare
-- enough that it is a likely error (and in any
-- case using 2**5 or 2**6 in these cases seems
-- clearer. We don't include 8 or 16 here, simply
-- because in practice 3-bit and 4-bit types are
-- more common and too many false positives if
-- we warn in these cases.
elsif not Has_Size_Clause (Utype)
and then (Modv = Uint_32 or else Modv = Uint_64)
then
null;
-- No warning needed
else
return;
end if;
-- If we fall through, give warning
Error_Msg_Uint_1 := Modv;
Error_Msg_N
("?M?2 '*'*^' may have been intended here",
Modulus);
end;
end if;
end;
end if;
end;
end if;
end Check_Suspicious_Modulus;
-----------------------
-- Freeze_Array_Type --
-----------------------
procedure Freeze_Array_Type (Arr : Entity_Id) is
FS : constant Entity_Id := First_Subtype (Arr);
Ctyp : constant Entity_Id := Component_Type (Arr);
Clause : Entity_Id;
Non_Standard_Enum : Boolean := False;
-- Set true if any of the index types is an enumeration type with a
-- non-standard representation.
begin
Freeze_And_Append (Ctyp, N, Result);
Indx := First_Index (Arr);
while Present (Indx) loop
Freeze_And_Append (Etype (Indx), N, Result);
if Is_Enumeration_Type (Etype (Indx))
and then Has_Non_Standard_Rep (Etype (Indx))
then
Non_Standard_Enum := True;
end if;
Next_Index (Indx);
end loop;
-- Processing that is done only for base types
if Ekind (Arr) = E_Array_Type then
-- Deal with default setting of reverse storage order
Set_SSO_From_Default (Arr);
-- Propagate flags for component type
if Is_Controlled_Active (Component_Type (Arr))
or else Has_Controlled_Component (Ctyp)
then
Set_Has_Controlled_Component (Arr);
end if;
if Has_Unchecked_Union (Component_Type (Arr)) then
Set_Has_Unchecked_Union (Arr);
end if;
-- The array type requires its own invariant procedure in order to
-- verify the component invariant over all elements. In GNATprove
-- mode, the component invariants are checked by other means. They
-- should not be added to the array type invariant procedure, so
-- that the procedure can be used to check the array type
-- invariants if any.
if Has_Invariants (Component_Type (Arr))
and then not GNATprove_Mode
then
Set_Has_Own_Invariants (Arr);
-- The array type is an implementation base type. Propagate the
-- same property to the first subtype.
if Is_Itype (Arr) then
Set_Has_Own_Invariants (First_Subtype (Arr));
end if;
end if;
-- Warn for pragma Pack overriding foreign convention
if Has_Foreign_Convention (Ctyp)
and then Has_Pragma_Pack (Arr)
then
declare
CN : constant Name_Id :=
Get_Convention_Name (Convention (Ctyp));
PP : constant Node_Id :=
Get_Pragma (First_Subtype (Arr), Pragma_Pack);
begin
if Present (PP) then
Error_Msg_Name_1 := CN;
Error_Msg_Sloc := Sloc (Arr);
Error_Msg_N
("pragma Pack affects convention % components #??", PP);
Error_Msg_Name_1 := CN;
Error_Msg_N
("\array components may not have % compatible "
& "representation??", PP);
end if;
end;
end if;
-- If packing was requested or if the component size was
-- set explicitly, then see if bit packing is required. This
-- processing is only done for base types, since all of the
-- representation aspects involved are type-related.
-- This is not just an optimization, if we start processing the
-- subtypes, they interfere with the settings on the base type
-- (this is because Is_Packed has a slightly different meaning
-- before and after freezing).
declare
Csiz : Uint;
Esiz : Uint;
begin
if (Is_Packed (Arr) or else Has_Pragma_Pack (Arr))
and then Known_Static_RM_Size (Ctyp)
and then not Has_Component_Size_Clause (Arr)
then
Csiz := UI_Max (RM_Size (Ctyp), 1);
elsif Known_Component_Size (Arr) then
Csiz := Component_Size (Arr);
elsif not Known_Static_Esize (Ctyp) then
Csiz := Uint_0;
else
Esiz := Esize (Ctyp);
-- We can set the component size if it is less than 16,
-- rounding it up to the next storage unit size.
if Esiz <= 8 then
Csiz := Uint_8;
elsif Esiz <= 16 then
Csiz := Uint_16;
else
Csiz := Uint_0;
end if;
-- Set component size up to match alignment if it would
-- otherwise be less than the alignment. This deals with
-- cases of types whose alignment exceeds their size (the
-- padded type cases).
if Csiz /= 0 then
declare
A : constant Uint := Alignment_In_Bits (Ctyp);
begin
if Csiz < A then
Csiz := A;
end if;
end;
end if;
end if;
-- Case of component size that may result in bit packing
if 1 <= Csiz and then Csiz <= 64 then
declare
Ent : constant Entity_Id :=
First_Subtype (Arr);
Pack_Pragma : constant Node_Id :=
Get_Rep_Pragma (Ent, Name_Pack);
Comp_Size_C : constant Node_Id :=
Get_Attribute_Definition_Clause
(Ent, Attribute_Component_Size);
begin
-- Warn if we have pack and component size so that the
-- pack is ignored.
-- Note: here we must check for the presence of a
-- component size before checking for a Pack pragma to
-- deal with the case where the array type is a derived
-- type whose parent is currently private.
if Present (Comp_Size_C)
and then Has_Pragma_Pack (Ent)
and then Warn_On_Redundant_Constructs
then
Error_Msg_Sloc := Sloc (Comp_Size_C);
Error_Msg_NE
("?r?pragma Pack for& ignored!", Pack_Pragma, Ent);
Error_Msg_N
("\?r?explicit component size given#!", Pack_Pragma);
Set_Is_Packed (Base_Type (Ent), False);
Set_Is_Bit_Packed_Array (Base_Type (Ent), False);
end if;
-- Set component size if not already set by a component
-- size clause.
if not Present (Comp_Size_C) then
Set_Component_Size (Arr, Csiz);
end if;
-- Check for base type of 8, 16, 32 bits, where an
-- unsigned subtype has a length one less than the
-- base type (e.g. Natural subtype of Integer).
-- In such cases, if a component size was not set
-- explicitly, then generate a warning.
if Has_Pragma_Pack (Arr)
and then not Present (Comp_Size_C)
and then (Csiz = 7 or else Csiz = 15 or else Csiz = 31)
and then Esize (Base_Type (Ctyp)) = Csiz + 1
then
Error_Msg_Uint_1 := Csiz;
if Present (Pack_Pragma) then
Error_Msg_N
("??pragma Pack causes component size to be ^!",
Pack_Pragma);
Error_Msg_N
("\??use Component_Size to set desired value!",
Pack_Pragma);
end if;
end if;
-- Bit packing is never needed for 8, 16, 32, 64
if Addressable (Csiz) then
-- If the Esize of the component is known and equal to
-- the component size then even packing is not needed.
if Known_Static_Esize (Component_Type (Arr))
and then Esize (Component_Type (Arr)) = Csiz
then
-- Here the array was requested to be packed, but
-- the packing request had no effect whatsoever,
-- so flag Is_Packed is reset.
-- Note: semantically this means that we lose track
-- of the fact that a derived type inherited pragma
-- Pack that was non-effective, but that is fine.
-- We regard a Pack pragma as a request to set a
-- representation characteristic, and this request
-- may be ignored.
Set_Is_Packed (Base_Type (Arr), False);
Set_Has_Non_Standard_Rep (Base_Type (Arr), False);
else
Set_Is_Packed (Base_Type (Arr), True);
Set_Has_Non_Standard_Rep (Base_Type (Arr), True);
end if;
Set_Is_Bit_Packed_Array (Base_Type (Arr), False);
-- Bit packing is not needed for multiples of the storage
-- unit if the type is composite because the back end can
-- byte pack composite types.
elsif Csiz mod System_Storage_Unit = 0
and then Is_Composite_Type (Ctyp)
then
Set_Is_Packed (Base_Type (Arr), True);
Set_Has_Non_Standard_Rep (Base_Type (Arr), True);
Set_Is_Bit_Packed_Array (Base_Type (Arr), False);
-- In all other cases, bit packing is needed
else
Set_Is_Packed (Base_Type (Arr), True);
Set_Has_Non_Standard_Rep (Base_Type (Arr), True);
Set_Is_Bit_Packed_Array (Base_Type (Arr), True);
end if;
end;
end if;
end;
-- Check for Aliased or Atomic_Components/Atomic/VFA with
-- unsuitable packing or explicit component size clause given.
if (Has_Aliased_Components (Arr)
or else Has_Atomic_Components (Arr)
or else Is_Atomic_Or_VFA (Ctyp))
and then
(Has_Component_Size_Clause (Arr) or else Is_Packed (Arr))
then
Alias_Atomic_Check : declare
procedure Complain_CS (T : String);
-- Outputs error messages for incorrect CS clause or pragma
-- Pack for aliased or atomic/VFA components (T is "aliased"
-- or "atomic/vfa");
-----------------
-- Complain_CS --
-----------------
procedure Complain_CS (T : String) is
begin
if Has_Component_Size_Clause (Arr) then
Clause :=
Get_Attribute_Definition_Clause
(FS, Attribute_Component_Size);
Error_Msg_N
("incorrect component size for "
& T & " components", Clause);
Error_Msg_Uint_1 := Esize (Ctyp);
Error_Msg_N
("\only allowed value is^", Clause);
else
Error_Msg_N
("cannot pack " & T & " components",
Get_Rep_Pragma (FS, Name_Pack));
end if;
end Complain_CS;
-- Start of processing for Alias_Atomic_Check
begin
-- If object size of component type isn't known, we cannot
-- be sure so we defer to the back end.
if not Known_Static_Esize (Ctyp) then
null;
-- Case where component size has no effect. First check for
-- object size of component type multiple of the storage
-- unit size.
elsif Esize (Ctyp) mod System_Storage_Unit = 0
-- OK in both packing case and component size case if RM
-- size is known and static and same as the object size.
and then
((Known_Static_RM_Size (Ctyp)
and then Esize (Ctyp) = RM_Size (Ctyp))
-- Or if we have an explicit component size clause and
-- the component size and object size are equal.
or else
(Has_Component_Size_Clause (Arr)
and then Component_Size (Arr) = Esize (Ctyp)))
then
null;
elsif Has_Aliased_Components (Arr) then
Complain_CS ("aliased");
elsif Has_Atomic_Components (Arr)
or else Is_Atomic (Ctyp)
then
Complain_CS ("atomic");
elsif Is_Volatile_Full_Access (Ctyp) then
Complain_CS ("volatile full access");
end if;
end Alias_Atomic_Check;
end if;
-- Check for Independent_Components/Independent with unsuitable
-- packing or explicit component size clause given.
if (Has_Independent_Components (Arr) or else Is_Independent (Ctyp))
and then
(Has_Component_Size_Clause (Arr) or else Is_Packed (Arr))
then
begin
-- If object size of component type isn't known, we cannot
-- be sure so we defer to the back end.
if not Known_Static_Esize (Ctyp) then
null;
-- Case where component size has no effect. First check for
-- object size of component type multiple of the storage
-- unit size.
elsif Esize (Ctyp) mod System_Storage_Unit = 0
-- OK in both packing case and component size case if RM
-- size is known and multiple of the storage unit size.
and then
((Known_Static_RM_Size (Ctyp)
and then RM_Size (Ctyp) mod System_Storage_Unit = 0)
-- Or if we have an explicit component size clause and
-- the component size is larger than the object size.
or else
(Has_Component_Size_Clause (Arr)
and then Component_Size (Arr) >= Esize (Ctyp)))
then
null;
else
if Has_Component_Size_Clause (Arr) then
Clause :=
Get_Attribute_Definition_Clause
(FS, Attribute_Component_Size);
Error_Msg_N
("incorrect component size for "
& "independent components", Clause);
Error_Msg_Uint_1 := Esize (Ctyp);
Error_Msg_N
("\minimum allowed is^", Clause);
else
Error_Msg_N
("cannot pack independent components",
Get_Rep_Pragma (FS, Name_Pack));
end if;
end if;
end;
end if;
-- Warn for case of atomic type
Clause := Get_Rep_Pragma (FS, Name_Atomic);
if Present (Clause)
and then not Addressable (Component_Size (FS))
then
Error_Msg_NE
("non-atomic components of type& may not be "
& "accessible by separate tasks??", Clause, Arr);
if Has_Component_Size_Clause (Arr) then
Error_Msg_Sloc := Sloc (Get_Attribute_Definition_Clause
(FS, Attribute_Component_Size));
Error_Msg_N ("\because of component size clause#??", Clause);
elsif Has_Pragma_Pack (Arr) then
Error_Msg_Sloc := Sloc (Get_Rep_Pragma (FS, Name_Pack));
Error_Msg_N ("\because of pragma Pack#??", Clause);
end if;
end if;
-- Check for scalar storage order
declare
Dummy : Boolean;
begin
Check_Component_Storage_Order
(Encl_Type => Arr,
Comp => Empty,
ADC => Get_Attribute_Definition_Clause
(First_Subtype (Arr),
Attribute_Scalar_Storage_Order),
Comp_ADC_Present => Dummy);
end;
-- Processing that is done only for subtypes
else
-- Acquire alignment from base type
if Unknown_Alignment (Arr) then
Set_Alignment (Arr, Alignment (Base_Type (Arr)));
Adjust_Esize_Alignment (Arr);
end if;
end if;
-- Specific checks for bit-packed arrays
if Is_Bit_Packed_Array (Arr) then
-- Check number of elements for bit-packed arrays that come from
-- source and have compile time known ranges. The bit-packed
-- arrays circuitry does not support arrays with more than
-- Integer'Last + 1 elements, and when this restriction is
-- violated, causes incorrect data access.
-- For the case where this is not compile time known, a run-time
-- check should be generated???
if Comes_From_Source (Arr) and then Is_Constrained (Arr) then
declare
Elmts : Uint;
Index : Node_Id;
Ilen : Node_Id;
Ityp : Entity_Id;
begin
Elmts := Uint_1;
Index := First_Index (Arr);
while Present (Index) loop
Ityp := Etype (Index);
-- Never generate an error if any index is of a generic
-- type. We will check this in instances.
if Is_Generic_Type (Ityp) then
Elmts := Uint_0;
exit;
end if;
Ilen :=
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Ityp, Loc),
Attribute_Name => Name_Range_Length);
Analyze_And_Resolve (Ilen);
-- No attempt is made to check number of elements if not
-- compile time known.
if Nkind (Ilen) /= N_Integer_Literal then
Elmts := Uint_0;
exit;
end if;
Elmts := Elmts * Intval (Ilen);
Next_Index (Index);
end loop;
if Elmts > Intval (High_Bound
(Scalar_Range (Standard_Integer))) + 1
then
Error_Msg_N
("bit packed array type may not have "
& "more than Integer''Last+1 elements", Arr);
end if;
end;
end if;
-- Check size
if Known_RM_Size (Arr) then
declare
SizC : constant Node_Id := Size_Clause (Arr);
Discard : Boolean;
begin
-- It is not clear if it is possible to have no size clause
-- at this stage, but it is not worth worrying about. Post
-- error on the entity name in the size clause if present,
-- else on the type entity itself.
if Present (SizC) then
Check_Size (Name (SizC), Arr, RM_Size (Arr), Discard);
else
Check_Size (Arr, Arr, RM_Size (Arr), Discard);
end if;
end;
end if;
end if;
-- If any of the index types was an enumeration type with a non-
-- standard rep clause, then we indicate that the array type is
-- always packed (even if it is not bit-packed).
if Non_Standard_Enum then
Set_Has_Non_Standard_Rep (Base_Type (Arr));
Set_Is_Packed (Base_Type (Arr));
end if;
Set_Component_Alignment_If_Not_Set (Arr);
-- If the array is packed and bit-packed or packed to eliminate holes
-- in the non-contiguous enumeration index types, we must create the
-- packed array type to be used to actually implement the type. This
-- is only needed for real array types (not for string literal types,
-- since they are present only for the front end).
if Is_Packed (Arr)
and then (Is_Bit_Packed_Array (Arr) or else Non_Standard_Enum)
and then Ekind (Arr) /= E_String_Literal_Subtype
then
Create_Packed_Array_Impl_Type (Arr);
Freeze_And_Append (Packed_Array_Impl_Type (Arr), N, Result);
-- Make sure that we have the necessary routines to implement the
-- packing, and complain now if not. Note that we only test this
-- for constrained array types.
if Is_Constrained (Arr)
and then Is_Bit_Packed_Array (Arr)
and then Present (Packed_Array_Impl_Type (Arr))
and then Is_Array_Type (Packed_Array_Impl_Type (Arr))
then
declare
CS : constant Uint := Component_Size (Arr);
RE : constant RE_Id := Get_Id (UI_To_Int (CS));
begin
if RE /= RE_Null
and then not RTE_Available (RE)
then
Error_Msg_CRT
("packing of " & UI_Image (CS) & "-bit components",
First_Subtype (Etype (Arr)));
-- Cancel the packing
Set_Is_Packed (Base_Type (Arr), False);
Set_Is_Bit_Packed_Array (Base_Type (Arr), False);
Set_Packed_Array_Impl_Type (Arr, Empty);
goto Skip_Packed;
end if;
end;
end if;
-- Size information of packed array type is copied to the array
-- type, since this is really the representation. But do not
-- override explicit existing size values. If the ancestor subtype
-- is constrained the Packed_Array_Impl_Type will be inherited
-- from it, but the size may have been provided already, and
-- must not be overridden either.
if not Has_Size_Clause (Arr)
and then
(No (Ancestor_Subtype (Arr))
or else not Has_Size_Clause (Ancestor_Subtype (Arr)))
then
Set_Esize (Arr, Esize (Packed_Array_Impl_Type (Arr)));
Set_RM_Size (Arr, RM_Size (Packed_Array_Impl_Type (Arr)));
end if;
if not Has_Alignment_Clause (Arr) then
Set_Alignment (Arr, Alignment (Packed_Array_Impl_Type (Arr)));
end if;
end if;
<<Skip_Packed>>
-- For non-packed arrays set the alignment of the array to the
-- alignment of the component type if it is unknown. Skip this
-- in atomic/VFA case (atomic/VFA arrays may need larger alignments).
if not Is_Packed (Arr)
and then Unknown_Alignment (Arr)
and then Known_Alignment (Ctyp)
and then Known_Static_Component_Size (Arr)
and then Known_Static_Esize (Ctyp)
and then Esize (Ctyp) = Component_Size (Arr)
and then not Is_Atomic_Or_VFA (Arr)
then
Set_Alignment (Arr, Alignment (Component_Type (Arr)));
end if;
-- A Ghost type cannot have a component of protected or task type
-- (SPARK RM 6.9(19)).
if Is_Ghost_Entity (Arr) and then Is_Concurrent_Type (Ctyp) then
Error_Msg_N
("ghost array type & cannot have concurrent component type",
Arr);
end if;
end Freeze_Array_Type;
-------------------------------
-- Freeze_Object_Declaration --
-------------------------------
procedure Freeze_Object_Declaration (E : Entity_Id) is
begin
-- Abstract type allowed only for C++ imported variables or constants
-- Note: we inhibit this check for objects that do not come from
-- source because there is at least one case (the expansion of
-- x'Class'Input where x is abstract) where we legitimately
-- generate an abstract object.
if Is_Abstract_Type (Etype (E))
and then Comes_From_Source (Parent (E))
and then not (Is_Imported (E) and then Is_CPP_Class (Etype (E)))
then
Error_Msg_N ("type of object cannot be abstract",
Object_Definition (Parent (E)));
if Is_CPP_Class (Etype (E)) then
Error_Msg_NE
("\} may need a cpp_constructor",
Object_Definition (Parent (E)), Etype (E));
elsif Present (Expression (Parent (E))) then
Error_Msg_N -- CODEFIX
("\maybe a class-wide type was meant",
Object_Definition (Parent (E)));
end if;
end if;
-- For object created by object declaration, perform required
-- categorization (preelaborate and pure) checks. Defer these
-- checks to freeze time since pragma Import inhibits default
-- initialization and thus pragma Import affects these checks.
Validate_Object_Declaration (Declaration_Node (E));
-- If there is an address clause, check that it is valid
-- and if need be move initialization to the freeze node.
Check_Address_Clause (E);
-- Similar processing is needed for aspects that may affect
-- object layout, like Alignment, if there is an initialization
-- expression.
if Has_Delayed_Aspects (E)
and then Expander_Active
and then Is_Array_Type (Etype (E))
and then Present (Expression (Parent (E)))
then
declare
Decl : constant Node_Id := Parent (E);
Lhs : constant Node_Id := New_Occurrence_Of (E, Loc);
begin
-- Capture initialization value at point of declaration, and
-- make explicit assignment legal, because object may be a
-- constant.
Remove_Side_Effects (Expression (Decl));
Set_Assignment_OK (Lhs);
-- Move initialization to freeze actions.
Append_Freeze_Action (E,
Make_Assignment_Statement (Loc,
Name => Lhs,
Expression => Expression (Decl)));
Set_No_Initialization (Decl);
-- Set_Is_Frozen (E, False);
end;
end if;
-- Reset Is_True_Constant for non-constant aliased object. We
-- consider that the fact that a non-constant object is aliased may
-- indicate that some funny business is going on, e.g. an aliased
-- object is passed by reference to a procedure which captures the
-- address of the object, which is later used to assign a new value,
-- even though the compiler thinks that it is not modified. Such
-- code is highly dubious, but we choose to make it "work" for
-- non-constant aliased objects.
-- Note that we used to do this for all aliased objects, whether or
-- not constant, but this caused anomalies down the line because we
-- ended up with static objects that were not Is_True_Constant. Not
-- resetting Is_True_Constant for (aliased) constant objects ensures
-- that this anomaly never occurs.
-- However, we don't do that for internal entities. We figure that if
-- we deliberately set Is_True_Constant for an internal entity, e.g.
-- a dispatch table entry, then we mean it.
if Ekind (E) /= E_Constant
and then (Is_Aliased (E) or else Is_Aliased (Etype (E)))
and then not Is_Internal_Name (Chars (E))
then
Set_Is_True_Constant (E, False);
end if;
-- If the object needs any kind of default initialization, an error
-- must be issued if No_Default_Initialization applies. The check
-- doesn't apply to imported objects, which are not ever default
-- initialized, and is why the check is deferred until freezing, at
-- which point we know if Import applies. Deferred constants are also
-- exempted from this test because their completion is explicit, or
-- through an import pragma.
if Ekind (E) = E_Constant and then Present (Full_View (E)) then
null;
elsif Comes_From_Source (E)
and then not Is_Imported (E)
and then not Has_Init_Expression (Declaration_Node (E))
and then
((Has_Non_Null_Base_Init_Proc (Etype (E))
and then not No_Initialization (Declaration_Node (E))
and then not Initialization_Suppressed (Etype (E)))
or else
(Needs_Simple_Initialization (Etype (E))
and then not Is_Internal (E)))
then
Has_Default_Initialization := True;
Check_Restriction
(No_Default_Initialization, Declaration_Node (E));
end if;
-- Check that a Thread_Local_Storage variable does not have
-- default initialization, and any explicit initialization must
-- either be the null constant or a static constant.
if Has_Pragma_Thread_Local_Storage (E) then
declare
Decl : constant Node_Id := Declaration_Node (E);
begin
if Has_Default_Initialization
or else
(Has_Init_Expression (Decl)
and then
(No (Expression (Decl))
or else not
(Is_OK_Static_Expression (Expression (Decl))
or else Nkind (Expression (Decl)) = N_Null)))
then
Error_Msg_NE
("Thread_Local_Storage variable& is "
& "improperly initialized", Decl, E);
Error_Msg_NE
("\only allowed initialization is explicit "
& "NULL or static expression", Decl, E);
end if;
end;
end if;
-- For imported objects, set Is_Public unless there is also an
-- address clause, which means that there is no external symbol
-- needed for the Import (Is_Public may still be set for other
-- unrelated reasons). Note that we delayed this processing
-- till freeze time so that we can be sure not to set the flag
-- if there is an address clause. If there is such a clause,
-- then the only purpose of the Import pragma is to suppress
-- implicit initialization.
if Is_Imported (E) and then No (Address_Clause (E)) then
Set_Is_Public (E);
end if;
-- For source objects that are not Imported and are library
-- level, if no linker section pragma was given inherit the
-- appropriate linker section from the corresponding type.
if Comes_From_Source (E)
and then not Is_Imported (E)
and then Is_Library_Level_Entity (E)
and then No (Linker_Section_Pragma (E))
then
Set_Linker_Section_Pragma
(E, Linker_Section_Pragma (Etype (E)));
end if;
-- For convention C objects of an enumeration type, warn if the
-- size is not integer size and no explicit size given. Skip
-- warning for Boolean, and Character, assume programmer expects
-- 8-bit sizes for these cases.
if (Convention (E) = Convention_C
or else
Convention (E) = Convention_CPP)
and then Is_Enumeration_Type (Etype (E))
and then not Is_Character_Type (Etype (E))
and then not Is_Boolean_Type (Etype (E))
and then Esize (Etype (E)) < Standard_Integer_Size
and then not Has_Size_Clause (E)
then
Error_Msg_Uint_1 := UI_From_Int (Standard_Integer_Size);
Error_Msg_N
("??convention C enumeration object has size less than ^", E);
Error_Msg_N ("\??use explicit size clause to set size", E);
end if;
end Freeze_Object_Declaration;
-----------------------------
-- Freeze_Generic_Entities --
-----------------------------
function Freeze_Generic_Entities (Pack : Entity_Id) return List_Id is
E : Entity_Id;
F : Node_Id;
Flist : List_Id;
begin
Flist := New_List;
E := First_Entity (Pack);
while Present (E) loop
if Is_Type (E) and then not Is_Generic_Type (E) then
F := Make_Freeze_Generic_Entity (Sloc (Pack));
Set_Entity (F, E);
Append_To (Flist, F);
elsif Ekind (E) = E_Generic_Package then
Append_List_To (Flist, Freeze_Generic_Entities (E));
end if;
Next_Entity (E);
end loop;
return Flist;
end Freeze_Generic_Entities;
--------------------
-- Freeze_Profile --
--------------------
function Freeze_Profile (E : Entity_Id) return Boolean is
F_Type : Entity_Id;
R_Type : Entity_Id;
Warn_Node : Node_Id;
begin
-- Loop through formals
Formal := First_Formal (E);
while Present (Formal) loop
F_Type := Etype (Formal);
-- AI05-0151: incomplete types can appear in a profile. By the
-- time the entity is frozen, the full view must be available,
-- unless it is a limited view.
if Is_Incomplete_Type (F_Type)
and then Present (Full_View (F_Type))
and then not From_Limited_With (F_Type)
then
F_Type := Full_View (F_Type);
Set_Etype (Formal, F_Type);
end if;
if not From_Limited_With (F_Type) then
Freeze_And_Append (F_Type, N, Result);
end if;
if Is_Private_Type (F_Type)
and then Is_Private_Type (Base_Type (F_Type))
and then No (Full_View (Base_Type (F_Type)))
and then not Is_Generic_Type (F_Type)
and then not Is_Derived_Type (F_Type)
then
-- If the type of a formal is incomplete, subprogram is being
-- frozen prematurely. Within an instance (but not within a
-- wrapper package) this is an artifact of our need to regard
-- the end of an instantiation as a freeze point. Otherwise it
-- is a definite error.
if In_Instance then
Set_Is_Frozen (E, False);
Result := No_List;
return False;
elsif not After_Last_Declaration
and then not Freezing_Library_Level_Tagged_Type
then
Error_Msg_Node_1 := F_Type;
Error_Msg
("type & must be fully defined before this point", Loc);
end if;
end if;
-- Check suspicious parameter for C function. These tests apply
-- only to exported/imported subprograms.
if Warn_On_Export_Import
and then Comes_From_Source (E)
and then (Convention (E) = Convention_C
or else
Convention (E) = Convention_CPP)
and then (Is_Imported (E) or else Is_Exported (E))
and then Convention (E) /= Convention (Formal)
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (F_Type)
and then not Has_Warnings_Off (Formal)
then
-- Qualify mention of formals with subprogram name
Error_Msg_Qual_Level := 1;
-- Check suspicious use of fat C pointer
if Is_Access_Type (F_Type)
and then Esize (F_Type) > Ttypes.System_Address_Size
then
Error_Msg_N
("?x?type of & does not correspond to C pointer!", Formal);
-- Check suspicious return of boolean
elsif Root_Type (F_Type) = Standard_Boolean
and then Convention (F_Type) = Convention_Ada
and then not Has_Warnings_Off (F_Type)
and then not Has_Size_Clause (F_Type)
then
Error_Msg_N
("& is an 8-bit Ada Boolean?x?", Formal);
Error_Msg_N
("\use appropriate corresponding type in C "
& "(e.g. char)?x?", Formal);
-- Check suspicious tagged type
elsif (Is_Tagged_Type (F_Type)
or else
(Is_Access_Type (F_Type)
and then Is_Tagged_Type (Designated_Type (F_Type))))
and then Convention (E) = Convention_C
then
Error_Msg_N
("?x?& involves a tagged type which does not "
& "correspond to any C type!", Formal);
-- Check wrong convention subprogram pointer
elsif Ekind (F_Type) = E_Access_Subprogram_Type
and then not Has_Foreign_Convention (F_Type)
then
Error_Msg_N
("?x?subprogram pointer & should "
& "have foreign convention!", Formal);
Error_Msg_Sloc := Sloc (F_Type);
Error_Msg_NE
("\?x?add Convention pragma to declaration of &#",
Formal, F_Type);
end if;
-- Turn off name qualification after message output
Error_Msg_Qual_Level := 0;
end if;
-- Check for unconstrained array in exported foreign convention
-- case.
if Has_Foreign_Convention (E)
and then not Is_Imported (E)
and then Is_Array_Type (F_Type)
and then not Is_Constrained (F_Type)
and then Warn_On_Export_Import
then
Error_Msg_Qual_Level := 1;
-- If this is an inherited operation, place the warning on
-- the derived type declaration, rather than on the original
-- subprogram.
if Nkind (Original_Node (Parent (E))) = N_Full_Type_Declaration
then
Warn_Node := Parent (E);
if Formal = First_Formal (E) then
Error_Msg_NE ("??in inherited operation&", Warn_Node, E);
end if;
else
Warn_Node := Formal;
end if;
Error_Msg_NE ("?x?type of argument& is unconstrained array",
Warn_Node, Formal);
Error_Msg_NE ("?x?foreign caller must pass bounds explicitly",
Warn_Node, Formal);
Error_Msg_Qual_Level := 0;
end if;
if not From_Limited_With (F_Type) then
if Is_Access_Type (F_Type) then
F_Type := Designated_Type (F_Type);
end if;
-- If the formal is an anonymous_access_to_subprogram
-- freeze the subprogram type as well, to prevent
-- scope anomalies in gigi, because there is no other
-- clear point at which it could be frozen.
if Is_Itype (Etype (Formal))
and then Ekind (F_Type) = E_Subprogram_Type
then
Freeze_And_Append (F_Type, N, Result);
end if;
end if;
Next_Formal (Formal);
end loop;
-- Case of function: similar checks on return type
if Ekind (E) = E_Function then
-- Freeze return type
R_Type := Etype (E);
-- AI05-0151: the return type may have been incomplete at the
-- point of declaration. Replace it with the full view, unless the
-- current type is a limited view. In that case the full view is
-- in a different unit, and gigi finds the non-limited view after
-- the other unit is elaborated.
if Ekind (R_Type) = E_Incomplete_Type
and then Present (Full_View (R_Type))
and then not From_Limited_With (R_Type)
then
R_Type := Full_View (R_Type);
Set_Etype (E, R_Type);
end if;
Freeze_And_Append (R_Type, N, Result);
-- Check suspicious return type for C function
if Warn_On_Export_Import
and then (Convention (E) = Convention_C
or else
Convention (E) = Convention_CPP)
and then (Is_Imported (E) or else Is_Exported (E))
then
-- Check suspicious return of fat C pointer
if Is_Access_Type (R_Type)
and then Esize (R_Type) > Ttypes.System_Address_Size
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (R_Type)
then
Error_Msg_N
("?x?return type of& does not correspond to C pointer!",
E);
-- Check suspicious return of boolean
elsif Root_Type (R_Type) = Standard_Boolean
and then Convention (R_Type) = Convention_Ada
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (R_Type)
and then not Has_Size_Clause (R_Type)
then
declare
N : constant Node_Id :=
Result_Definition (Declaration_Node (E));
begin
Error_Msg_NE
("return type of & is an 8-bit Ada Boolean?x?", N, E);
Error_Msg_NE
("\use appropriate corresponding type in C "
& "(e.g. char)?x?", N, E);
end;
-- Check suspicious return tagged type
elsif (Is_Tagged_Type (R_Type)
or else (Is_Access_Type (R_Type)
and then
Is_Tagged_Type
(Designated_Type (R_Type))))
and then Convention (E) = Convention_C
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (R_Type)
then
Error_Msg_N ("?x?return type of & does not "
& "correspond to C type!", E);
-- Check return of wrong convention subprogram pointer
elsif Ekind (R_Type) = E_Access_Subprogram_Type
and then not Has_Foreign_Convention (R_Type)
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (R_Type)
then
Error_Msg_N ("?x?& should return a foreign "
& "convention subprogram pointer", E);
Error_Msg_Sloc := Sloc (R_Type);
Error_Msg_NE
("\?x?add Convention pragma to declaration of& #",
E, R_Type);
end if;
end if;
-- Give warning for suspicious return of a result of an
-- unconstrained array type in a foreign convention function.
if Has_Foreign_Convention (E)
-- We are looking for a return of unconstrained array
and then Is_Array_Type (R_Type)
and then not Is_Constrained (R_Type)
-- Exclude imported routines, the warning does not belong on
-- the import, but rather on the routine definition.
and then not Is_Imported (E)
-- Check that general warning is enabled, and that it is not
-- suppressed for this particular case.
and then Warn_On_Export_Import
and then not Has_Warnings_Off (E)
and then not Has_Warnings_Off (R_Type)
then
Error_Msg_N
("?x?foreign convention function& should not return "
& "unconstrained array!", E);
end if;
end if;
-- Check suspicious use of Import in pure unit (cases where the RM
-- allows calls to be omitted).
if Is_Imported (E)
-- It might be suspicious if the compilation unit has the Pure
-- aspect/pragma.
and then Has_Pragma_Pure (Cunit_Entity (Current_Sem_Unit))
-- The RM allows omission of calls only in the case of
-- library-level subprograms (see RM-10.2.1(18)).
and then Is_Library_Level_Entity (E)
-- Ignore internally generated entity. This happens in some cases
-- of subprograms in specs, where we generate an implied body.
and then Comes_From_Source (Import_Pragma (E))
-- Assume run-time knows what it is doing
and then not GNAT_Mode
-- Assume explicit Pure_Function means import is pure
and then not Has_Pragma_Pure_Function (E)
-- Don't need warning in relaxed semantics mode
and then not Relaxed_RM_Semantics
-- Assume convention Intrinsic is OK, since this is specialized.
-- This deals with the DEC unit current_exception.ads
and then Convention (E) /= Convention_Intrinsic
-- Assume that ASM interface knows what it is doing. This deals
-- with e.g. unsigned.ads in the AAMP back end.
and then Convention (E) /= Convention_Assembler
then
Error_Msg_N
("pragma Import in Pure unit??", Import_Pragma (E));
Error_Msg_NE
("\calls to & may be omitted (RM 10.2.1(18/3))??",
Import_Pragma (E), E);
end if;
return True;
end Freeze_Profile;
------------------------
-- Freeze_Record_Type --
------------------------
procedure Freeze_Record_Type (Rec : Entity_Id) is
ADC : Node_Id;
Comp : Entity_Id;
IR : Node_Id;
Prev : Entity_Id;
Junk : Boolean;
pragma Warnings (Off, Junk);
Aliased_Component : Boolean := False;
-- Set True if we find at least one component which is aliased. This
-- is used to prevent Implicit_Packing of the record, since packing
-- cannot modify the size of alignment of an aliased component.
All_Elem_Components : Boolean := True;
-- Set False if we encounter a component of a composite type
All_Sized_Components : Boolean := True;
-- Set False if we encounter a component with unknown RM_Size
All_Storage_Unit_Components : Boolean := True;
-- Set False if we encounter a component of a composite type whose
-- RM_Size is not a multiple of the storage unit.
Elem_Component_Total_Esize : Uint := Uint_0;
-- Accumulates total Esize values of all elementary components. Used
-- for processing of Implicit_Packing.
Placed_Component : Boolean := False;
-- Set True if we find at least one component with a component
-- clause (used to warn about useless Bit_Order pragmas, and also
-- to detect cases where Implicit_Packing may have an effect).
Rec_Pushed : Boolean := False;
-- Set True if the record type scope Rec has been pushed on the scope
-- stack. Needed for the analysis of delayed aspects specified to the
-- components of Rec.
Sized_Component_Total_RM_Size : Uint := Uint_0;
-- Accumulates total RM_Size values of all sized components. Used
-- for processing of Implicit_Packing.
SSO_ADC : Node_Id;
-- Scalar_Storage_Order attribute definition clause for the record
SSO_ADC_Component : Boolean := False;
-- Set True if we find at least one component whose type has a
-- Scalar_Storage_Order attribute definition clause.
Unplaced_Component : Boolean := False;
-- Set True if we find at least one component with no component
-- clause (used to warn about useless Pack pragmas).
function Check_Allocator (N : Node_Id) return Node_Id;
-- If N is an allocator, possibly wrapped in one or more level of
-- qualified expression(s), return the inner allocator node, else
-- return Empty.
procedure Check_Itype (Typ : Entity_Id);
-- If the component subtype is an access to a constrained subtype of
-- an already frozen type, make the subtype frozen as well. It might
-- otherwise be frozen in the wrong scope, and a freeze node on
-- subtype has no effect. Similarly, if the component subtype is a
-- regular (not protected) access to subprogram, set the anonymous
-- subprogram type to frozen as well, to prevent an out-of-scope
-- freeze node at some eventual point of call. Protected operations
-- are handled elsewhere.
procedure Freeze_Choices_In_Variant_Part (VP : Node_Id);
-- Make sure that all types mentioned in Discrete_Choices of the
-- variants referenceed by the Variant_Part VP are frozen. This is
-- a recursive routine to deal with nested variants.
---------------------
-- Check_Allocator --
---------------------
function Check_Allocator (N : Node_Id) return Node_Id is
Inner : Node_Id;
begin
Inner := N;
loop
if Nkind (Inner) = N_Allocator then
return Inner;
elsif Nkind (Inner) = N_Qualified_Expression then
Inner := Expression (Inner);
else
return Empty;
end if;
end loop;
end Check_Allocator;
-----------------
-- Check_Itype --
-----------------
procedure Check_Itype (Typ : Entity_Id) is
Desig : constant Entity_Id := Designated_Type (Typ);
begin
if not Is_Frozen (Desig)
and then Is_Frozen (Base_Type (Desig))
then
Set_Is_Frozen (Desig);
-- In addition, add an Itype_Reference to ensure that the
-- access subtype is elaborated early enough. This cannot be
-- done if the subtype may depend on discriminants.
if Ekind (Comp) = E_Component
and then Is_Itype (Etype (Comp))
and then not Has_Discriminants (Rec)
then
IR := Make_Itype_Reference (Sloc (Comp));
Set_Itype (IR, Desig);
Add_To_Result (IR);
end if;
elsif Ekind (Typ) = E_Anonymous_Access_Subprogram_Type
and then Convention (Desig) /= Convention_Protected
then
Set_Is_Frozen (Desig);
end if;
end Check_Itype;
------------------------------------
-- Freeze_Choices_In_Variant_Part --
------------------------------------
procedure Freeze_Choices_In_Variant_Part (VP : Node_Id) is
pragma Assert (Nkind (VP) = N_Variant_Part);
Variant : Node_Id;
Choice : Node_Id;
CL : Node_Id;
begin
-- Loop through variants
Variant := First_Non_Pragma (Variants (VP));
while Present (Variant) loop
-- Loop through choices, checking that all types are frozen
Choice := First_Non_Pragma (Discrete_Choices (Variant));
while Present (Choice) loop
if Nkind (Choice) in N_Has_Etype
and then Present (Etype (Choice))
then
Freeze_And_Append (Etype (Choice), N, Result);
end if;
Next_Non_Pragma (Choice);
end loop;
-- Check for nested variant part to process
CL := Component_List (Variant);
if not Null_Present (CL) then
if Present (Variant_Part (CL)) then
Freeze_Choices_In_Variant_Part (Variant_Part (CL));
end if;
end if;
Next_Non_Pragma (Variant);
end loop;
end Freeze_Choices_In_Variant_Part;
-- Start of processing for Freeze_Record_Type
begin
-- Deal with delayed aspect specifications for components. The
-- analysis of the aspect is required to be delayed to the freeze
-- point, thus we analyze the pragma or attribute definition
-- clause in the tree at this point. We also analyze the aspect
-- specification node at the freeze point when the aspect doesn't
-- correspond to pragma/attribute definition clause.
Comp := First_Entity (Rec);
while Present (Comp) loop
if Ekind (Comp) = E_Component
and then Has_Delayed_Aspects (Comp)
then
if not Rec_Pushed then
Push_Scope (Rec);
Rec_Pushed := True;
-- The visibility to the discriminants must be restored in
-- order to properly analyze the aspects.
if Has_Discriminants (Rec) then
Install_Discriminants (Rec);
end if;
end if;
Analyze_Aspects_At_Freeze_Point (Comp);
end if;
Next_Entity (Comp);
end loop;
-- Pop the scope if Rec scope has been pushed on the scope stack
-- during the delayed aspect analysis process.
if Rec_Pushed then
if Has_Discriminants (Rec) then
Uninstall_Discriminants (Rec);
end if;
Pop_Scope;
end if;
-- Freeze components and embedded subtypes
Comp := First_Entity (Rec);
Prev := Empty;
while Present (Comp) loop
if Is_Aliased (Comp) then
Aliased_Component := True;
end if;
-- Handle the component and discriminant case
if Ekind_In (Comp, E_Component, E_Discriminant) then
declare
CC : constant Node_Id := Component_Clause (Comp);
begin
-- Freezing a record type freezes the type of each of its
-- components. However, if the type of the component is
-- part of this record, we do not want or need a separate
-- Freeze_Node. Note that Is_Itype is wrong because that's
-- also set in private type cases. We also can't check for
-- the Scope being exactly Rec because of private types and
-- record extensions.
if Is_Itype (Etype (Comp))
and then Is_Record_Type (Underlying_Type
(Scope (Etype (Comp))))
then
Undelay_Type (Etype (Comp));
end if;
Freeze_And_Append (Etype (Comp), N, Result);
-- Warn for pragma Pack overriding foreign convention
if Has_Foreign_Convention (Etype (Comp))
and then Has_Pragma_Pack (Rec)
-- Don't warn for aliased components, since override
-- cannot happen in that case.
and then not Is_Aliased (Comp)
then
declare
CN : constant Name_Id :=
Get_Convention_Name (Convention (Etype (Comp)));
PP : constant Node_Id :=
Get_Pragma (Rec, Pragma_Pack);
begin
if Present (PP) then
Error_Msg_Name_1 := CN;
Error_Msg_Sloc := Sloc (Comp);
Error_Msg_N
("pragma Pack affects convention % component#??",
PP);
Error_Msg_Name_1 := CN;
Error_Msg_NE
("\component & may not have % compatible "
& "representation??", PP, Comp);
end if;
end;
end if;
-- Check for error of component clause given for variable
-- sized type. We have to delay this test till this point,
-- since the component type has to be frozen for us to know
-- if it is variable length.
if Present (CC) then
Placed_Component := True;
-- We omit this test in a generic context, it will be
-- applied at instantiation time.
if Inside_A_Generic then
null;
-- Also omit this test in CodePeer mode, since we do not
-- have sufficient info on size and rep clauses.
elsif CodePeer_Mode then
null;
-- Omit check if component has a generic type. This can
-- happen in an instantiation within a generic in ASIS
-- mode, where we force freeze actions without full
-- expansion.
elsif Is_Generic_Type (Etype (Comp)) then
null;
-- Do the check
elsif not
Size_Known_At_Compile_Time
(Underlying_Type (Etype (Comp)))
then
Error_Msg_N
("component clause not allowed for variable " &
"length component", CC);
end if;
else
Unplaced_Component := True;
end if;
-- Case of component requires byte alignment
if Must_Be_On_Byte_Boundary (Etype (Comp)) then
-- Set the enclosing record to also require byte align
Set_Must_Be_On_Byte_Boundary (Rec);
-- Check for component clause that is inconsistent with
-- the required byte boundary alignment.
if Present (CC)
and then Normalized_First_Bit (Comp) mod
System_Storage_Unit /= 0
then
Error_Msg_N
("component & must be byte aligned",
Component_Name (Component_Clause (Comp)));
end if;
end if;
end;
end if;
-- Gather data for possible Implicit_Packing later. Note that at
-- this stage we might be dealing with a real component, or with
-- an implicit subtype declaration.
if Known_Static_RM_Size (Etype (Comp)) then
Sized_Component_Total_RM_Size :=
Sized_Component_Total_RM_Size + RM_Size (Etype (Comp));
if Is_Elementary_Type (Etype (Comp)) then
Elem_Component_Total_Esize :=
Elem_Component_Total_Esize + Esize (Etype (Comp));
else
All_Elem_Components := False;
if RM_Size (Etype (Comp)) mod System_Storage_Unit /= 0 then
All_Storage_Unit_Components := False;
end if;
end if;
else
All_Sized_Components := False;
end if;
-- If the component is an Itype with Delayed_Freeze and is either
-- a record or array subtype and its base type has not yet been
-- frozen, we must remove this from the entity list of this record
-- and put it on the entity list of the scope of its base type.
-- Note that we know that this is not the type of a component
-- since we cleared Has_Delayed_Freeze for it in the previous
-- loop. Thus this must be the Designated_Type of an access type,
-- which is the type of a component.
if Is_Itype (Comp)
and then Is_Type (Scope (Comp))
and then Is_Composite_Type (Comp)
and then Base_Type (Comp) /= Comp
and then Has_Delayed_Freeze (Comp)
and then not Is_Frozen (Base_Type (Comp))
then
declare
Will_Be_Frozen : Boolean := False;
S : Entity_Id;
begin
-- We have a difficult case to handle here. Suppose Rec is
-- subtype being defined in a subprogram that's created as
-- part of the freezing of Rec'Base. In that case, we know
-- that Comp'Base must have already been frozen by the time
-- we get to elaborate this because Gigi doesn't elaborate
-- any bodies until it has elaborated all of the declarative
-- part. But Is_Frozen will not be set at this point because
-- we are processing code in lexical order.
-- We detect this case by going up the Scope chain of Rec
-- and seeing if we have a subprogram scope before reaching
-- the top of the scope chain or that of Comp'Base. If we
-- do, then mark that Comp'Base will actually be frozen. If
-- so, we merely undelay it.
S := Scope (Rec);
while Present (S) loop
if Is_Subprogram (S) then
Will_Be_Frozen := True;
exit;
elsif S = Scope (Base_Type (Comp)) then
exit;
end if;
S := Scope (S);
end loop;
if Will_Be_Frozen then
Undelay_Type (Comp);
else
if Present (Prev) then
Set_Next_Entity (Prev, Next_Entity (Comp));
else
Set_First_Entity (Rec, Next_Entity (Comp));
end if;
-- Insert in entity list of scope of base type (which
-- must be an enclosing scope, because still unfrozen).
Append_Entity (Comp, Scope (Base_Type (Comp)));
end if;
end;
-- If the component is an access type with an allocator as default
-- value, the designated type will be frozen by the corresponding
-- expression in init_proc. In order to place the freeze node for
-- the designated type before that for the current record type,
-- freeze it now.
-- Same process if the component is an array of access types,
-- initialized with an aggregate. If the designated type is
-- private, it cannot contain allocators, and it is premature
-- to freeze the type, so we check for this as well.
elsif Is_Access_Type (Etype (Comp))
and then Present (Parent (Comp))
and then Present (Expression (Parent (Comp)))
then
declare
Alloc : constant Node_Id :=
Check_Allocator (Expression (Parent (Comp)));
begin
if Present (Alloc) then
-- If component is pointer to a class-wide type, freeze
-- the specific type in the expression being allocated.
-- The expression may be a subtype indication, in which
-- case freeze the subtype mark.
if Is_Class_Wide_Type
(Designated_Type (Etype (Comp)))
then
if Is_Entity_Name (Expression (Alloc)) then
Freeze_And_Append
(Entity (Expression (Alloc)), N, Result);
elsif Nkind (Expression (Alloc)) = N_Subtype_Indication
then
Freeze_And_Append
(Entity (Subtype_Mark (Expression (Alloc))),
N, Result);
end if;
elsif Is_Itype (Designated_Type (Etype (Comp))) then
Check_Itype (Etype (Comp));
else
Freeze_And_Append
(Designated_Type (Etype (Comp)), N, Result);
end if;
end if;
end;
elsif Is_Access_Type (Etype (Comp))
and then Is_Itype (Designated_Type (Etype (Comp)))
then
Check_Itype (Etype (Comp));
-- Freeze the designated type when initializing a component with
-- an aggregate in case the aggregate contains allocators.
-- type T is ...;
-- type T_Ptr is access all T;
-- type T_Array is array ... of T_Ptr;
-- type Rec is record
-- Comp : T_Array := (others => ...);
-- end record;
elsif Is_Array_Type (Etype (Comp))
and then Is_Access_Type (Component_Type (Etype (Comp)))
then
declare
Comp_Par : constant Node_Id := Parent (Comp);
Desig_Typ : constant Entity_Id :=
Designated_Type
(Component_Type (Etype (Comp)));
begin
-- The only case when this sort of freezing is not done is
-- when the designated type is class-wide and the root type
-- is the record owning the component. This scenario results
-- in a circularity because the class-wide type requires
-- primitives that have not been created yet as the root
-- type is in the process of being frozen.
-- type Rec is tagged;
-- type Rec_Ptr is access all Rec'Class;
-- type Rec_Array is array ... of Rec_Ptr;
-- type Rec is record
-- Comp : Rec_Array := (others => ...);
-- end record;
if Is_Class_Wide_Type (Desig_Typ)
and then Root_Type (Desig_Typ) = Rec
then
null;
elsif Is_Fully_Defined (Desig_Typ)
and then Present (Comp_Par)
and then Nkind (Comp_Par) = N_Component_Declaration
and then Present (Expression (Comp_Par))
and then Nkind (Expression (Comp_Par)) = N_Aggregate
then
Freeze_And_Append (Desig_Typ, N, Result);
end if;
end;
end if;
Prev := Comp;
Next_Entity (Comp);
end loop;
SSO_ADC :=
Get_Attribute_Definition_Clause
(Rec, Attribute_Scalar_Storage_Order);
-- If the record type has Complex_Representation, then it is treated
-- as a scalar in the back end so the storage order is irrelevant.
if Has_Complex_Representation (Rec) then
if Present (SSO_ADC) then
Error_Msg_N
("??storage order has no effect with Complex_Representation",
SSO_ADC);
end if;
else
-- Deal with default setting of reverse storage order
Set_SSO_From_Default (Rec);
-- Check consistent attribute setting on component types
declare
Comp_ADC_Present : Boolean;
begin
Comp := First_Component (Rec);
while Present (Comp) loop
Check_Component_Storage_Order
(Encl_Type => Rec,
Comp => Comp,
ADC => SSO_ADC,
Comp_ADC_Present => Comp_ADC_Present);
SSO_ADC_Component := SSO_ADC_Component or Comp_ADC_Present;
Next_Component (Comp);
end loop;
end;
-- Now deal with reverse storage order/bit order issues
if Present (SSO_ADC) then
-- Check compatibility of Scalar_Storage_Order with Bit_Order,
-- if the former is specified.
if Reverse_Bit_Order (Rec) /= Reverse_Storage_Order (Rec) then
-- Note: report error on Rec, not on SSO_ADC, as ADC may
-- apply to some ancestor type.
Error_Msg_Sloc := Sloc (SSO_ADC);
Error_Msg_N
("scalar storage order for& specified# inconsistent with "
& "bit order", Rec);
end if;
-- Warn if there is a Scalar_Storage_Order attribute definition
-- clause but no component clause, no component that itself has
-- such an attribute definition, and no pragma Pack.
if not (Placed_Component
or else
SSO_ADC_Component
or else
Is_Packed (Rec))
then
Error_Msg_N
("??scalar storage order specified but no component "
& "clause", SSO_ADC);
end if;
end if;
end if;
-- Deal with Bit_Order aspect
ADC := Get_Attribute_Definition_Clause (Rec, Attribute_Bit_Order);
if Present (ADC) and then Base_Type (Rec) = Rec then
if not (Placed_Component
or else Present (SSO_ADC)
or else Is_Packed (Rec))
then
-- Warn if clause has no effect when no component clause is
-- present, but suppress warning if the Bit_Order is required
-- due to the presence of a Scalar_Storage_Order attribute.
Error_Msg_N
("??bit order specification has no effect", ADC);
Error_Msg_N
("\??since no component clauses were specified", ADC);
-- Here is where we do the processing to adjust component clauses
-- for reversed bit order, when not using reverse SSO. If an error
-- has been reported on Rec already (such as SSO incompatible with
-- bit order), don't bother adjusting as this may generate extra
-- noise.
elsif Reverse_Bit_Order (Rec)
and then not Reverse_Storage_Order (Rec)
and then not Error_Posted (Rec)
then
Adjust_Record_For_Reverse_Bit_Order (Rec);
-- Case where we have both an explicit Bit_Order and the same
-- Scalar_Storage_Order: leave record untouched, the back-end
-- will take care of required layout conversions.
else
null;
end if;
end if;
-- Complete error checking on record representation clause (e.g.
-- overlap of components). This is called after adjusting the
-- record for reverse bit order.
declare
RRC : constant Node_Id := Get_Record_Representation_Clause (Rec);
begin
if Present (RRC) then
Check_Record_Representation_Clause (RRC);
end if;
end;
-- Set OK_To_Reorder_Components depending on debug flags
if Is_Base_Type (Rec) and then Convention (Rec) = Convention_Ada then
if (Has_Discriminants (Rec) and then Debug_Flag_Dot_V)
or else
(not Has_Discriminants (Rec) and then Debug_Flag_Dot_R)
then
Set_OK_To_Reorder_Components (Rec);
end if;
end if;
-- Check for useless pragma Pack when all components placed. We only
-- do this check for record types, not subtypes, since a subtype may
-- have all its components placed, and it still makes perfectly good
-- sense to pack other subtypes or the parent type. We do not give
-- this warning if Optimize_Alignment is set to Space, since the
-- pragma Pack does have an effect in this case (it always resets
-- the alignment to one).
if Ekind (Rec) = E_Record_Type
and then Is_Packed (Rec)
and then not Unplaced_Component
and then Optimize_Alignment /= 'S'
then
-- Reset packed status. Probably not necessary, but we do it so
-- that there is no chance of the back end doing something strange
-- with this redundant indication of packing.
Set_Is_Packed (Rec, False);
-- Give warning if redundant constructs warnings on
if Warn_On_Redundant_Constructs then
Error_Msg_N -- CODEFIX
("??pragma Pack has no effect, no unplaced components",
Get_Rep_Pragma (Rec, Name_Pack));
end if;
end if;
-- If this is the record corresponding to a remote type, freeze the
-- remote type here since that is what we are semantically freezing.
-- This prevents the freeze node for that type in an inner scope.
if Ekind (Rec) = E_Record_Type then
if Present (Corresponding_Remote_Type (Rec)) then
Freeze_And_Append (Corresponding_Remote_Type (Rec), N, Result);
end if;
-- Check for controlled components, unchecked unions, and type
-- invariants.
Comp := First_Component (Rec);
while Present (Comp) loop
-- Do not set Has_Controlled_Component on a class-wide
-- equivalent type. See Make_CW_Equivalent_Type.
if not Is_Class_Wide_Equivalent_Type (Rec)
and then
(Has_Controlled_Component (Etype (Comp))
or else
(Chars (Comp) /= Name_uParent
and then Is_Controlled_Active (Etype (Comp)))
or else
(Is_Protected_Type (Etype (Comp))
and then
Present (Corresponding_Record_Type (Etype (Comp)))
and then
Has_Controlled_Component
(Corresponding_Record_Type (Etype (Comp)))))
then
Set_Has_Controlled_Component (Rec);
end if;
if Has_Unchecked_Union (Etype (Comp)) then
Set_Has_Unchecked_Union (Rec);
end if;
-- The record type requires its own invariant procedure in
-- order to verify the invariant of each individual component.
-- Do not consider internal components such as _parent because
-- parent class-wide invariants are always inherited.
-- In GNATprove mode, the component invariants are checked by
-- other means. They should not be added to the record type
-- invariant procedure, so that the procedure can be used to
-- check the recordy type invariants if any.
if Comes_From_Source (Comp)
and then Has_Invariants (Etype (Comp))
and then not GNATprove_Mode
then
Set_Has_Own_Invariants (Rec);
end if;
-- Scan component declaration for likely misuses of current
-- instance, either in a constraint or a default expression.
if Has_Per_Object_Constraint (Comp) then
Check_Current_Instance (Parent (Comp));
end if;
Next_Component (Comp);
end loop;
end if;
-- Enforce the restriction that access attributes with a current
-- instance prefix can only apply to limited types. This comment
-- is floating here, but does not seem to belong here???
-- Set component alignment if not otherwise already set
Set_Component_Alignment_If_Not_Set (Rec);
-- For first subtypes, check if there are any fixed-point fields with
-- component clauses, where we must check the size. This is not done
-- till the freeze point since for fixed-point types, we do not know
-- the size until the type is frozen. Similar processing applies to
-- bit-packed arrays.
if Is_First_Subtype (Rec) then
Comp := First_Component (Rec);
while Present (Comp) loop
if Present (Component_Clause (Comp))
and then (Is_Fixed_Point_Type (Etype (Comp))
or else Is_Bit_Packed_Array (Etype (Comp)))
then
Check_Size
(Component_Name (Component_Clause (Comp)),
Etype (Comp),
Esize (Comp),
Junk);
end if;
Next_Component (Comp);
end loop;
end if;
-- See if Size is too small as is (and implicit packing might help)
if not Is_Packed (Rec)
-- No implicit packing if even one component is explicitly placed
and then not Placed_Component
-- Or even one component is aliased
and then not Aliased_Component
-- Must have size clause and all sized components
and then Has_Size_Clause (Rec)
and then All_Sized_Components
-- Do not try implicit packing on records with discriminants, too
-- complicated, especially in the variant record case.
and then not Has_Discriminants (Rec)
-- We want to implicitly pack if the specified size of the record
-- is less than the sum of the object sizes (no point in packing
-- if this is not the case), if we can compute it, i.e. if we have
-- only elementary components. Otherwise, we have at least one
-- composite component and we want to implicitly pack only if bit
-- packing is required for it, as we are sure in this case that
-- the back end cannot do the expected layout without packing.
and then
((All_Elem_Components
and then RM_Size (Rec) < Elem_Component_Total_Esize)
or else
(not All_Elem_Components
and then not All_Storage_Unit_Components))
-- And the total RM size cannot be greater than the specified size
-- since otherwise packing will not get us where we have to be.
and then RM_Size (Rec) >= Sized_Component_Total_RM_Size
-- Never do implicit packing in CodePeer or SPARK modes since
-- we don't do any packing in these modes, since this generates
-- over-complex code that confuses static analysis, and in
-- general, neither CodePeer not GNATprove care about the
-- internal representation of objects.
and then not (CodePeer_Mode or GNATprove_Mode)
then
-- If implicit packing enabled, do it
if Implicit_Packing then
Set_Is_Packed (Rec);
-- Otherwise flag the size clause
else
declare
Sz : constant Node_Id := Size_Clause (Rec);
begin
Error_Msg_NE -- CODEFIX
("size given for& too small", Sz, Rec);
Error_Msg_N -- CODEFIX
("\use explicit pragma Pack "
& "or use pragma Implicit_Packing", Sz);
end;
end if;
end if;
-- The following checks are relevant only when SPARK_Mode is on as
-- they are not standard Ada legality rules.
if SPARK_Mode = On then
if Is_Effectively_Volatile (Rec) then
-- A discriminated type cannot be effectively volatile
-- (SPARK RM C.6(4)).
if Has_Discriminants (Rec) then
Error_Msg_N ("discriminated type & cannot be volatile", Rec);
-- A tagged type cannot be effectively volatile
-- (SPARK RM C.6(5)).
elsif Is_Tagged_Type (Rec) then
Error_Msg_N ("tagged type & cannot be volatile", Rec);
end if;
-- A non-effectively volatile record type cannot contain
-- effectively volatile components (SPARK RM C.6(2)).
else
Comp := First_Component (Rec);
while Present (Comp) loop
if Comes_From_Source (Comp)
and then Is_Effectively_Volatile (Etype (Comp))
then
Error_Msg_Name_1 := Chars (Rec);
Error_Msg_N
("component & of non-volatile type % cannot be "
& "volatile", Comp);
end if;
Next_Component (Comp);
end loop;
end if;
-- A type which does not yield a synchronized object cannot have
-- a component that yields a synchronized object (SPARK RM 9.5).
if not Yields_Synchronized_Object (Rec) then
Comp := First_Component (Rec);
while Present (Comp) loop
if Comes_From_Source (Comp)
and then Yields_Synchronized_Object (Etype (Comp))
then
Error_Msg_Name_1 := Chars (Rec);
Error_Msg_N
("component & of non-synchronized type % cannot be "
& "synchronized", Comp);
end if;
Next_Component (Comp);
end loop;
end if;
-- A Ghost type cannot have a component of protected or task type
-- (SPARK RM 6.9(19)).
if Is_Ghost_Entity (Rec) then
Comp := First_Component (Rec);
while Present (Comp) loop
if Comes_From_Source (Comp)
and then Is_Concurrent_Type (Etype (Comp))
then
Error_Msg_Name_1 := Chars (Rec);
Error_Msg_N
("component & of ghost type % cannot be concurrent",
Comp);
end if;
Next_Component (Comp);
end loop;
end if;
end if;
-- Make sure that if we have an iterator aspect, then we have
-- either Constant_Indexing or Variable_Indexing.
declare
Iterator_Aspect : Node_Id;
begin
Iterator_Aspect := Find_Aspect (Rec, Aspect_Iterator_Element);
if No (Iterator_Aspect) then
Iterator_Aspect := Find_Aspect (Rec, Aspect_Default_Iterator);
end if;
if Present (Iterator_Aspect) then
if Has_Aspect (Rec, Aspect_Constant_Indexing)
or else
Has_Aspect (Rec, Aspect_Variable_Indexing)
then
null;
else
Error_Msg_N
("Iterator_Element requires indexing aspect",
Iterator_Aspect);
end if;
end if;
end;
-- All done if not a full record definition
if Ekind (Rec) /= E_Record_Type then
return;
end if;
-- Finally we need to check the variant part to make sure that
-- all types within choices are properly frozen as part of the
-- freezing of the record type.
Check_Variant_Part : declare
D : constant Node_Id := Declaration_Node (Rec);
T : Node_Id;
C : Node_Id;
begin
-- Find component list
C := Empty;
if Nkind (D) = N_Full_Type_Declaration then
T := Type_Definition (D);
if Nkind (T) = N_Record_Definition then
C := Component_List (T);
elsif Nkind (T) = N_Derived_Type_Definition
and then Present (Record_Extension_Part (T))
then
C := Component_List (Record_Extension_Part (T));
end if;
end if;
-- Case of variant part present
if Present (C) and then Present (Variant_Part (C)) then
Freeze_Choices_In_Variant_Part (Variant_Part (C));
end if;
-- Note: we used to call Check_Choices here, but it is too early,
-- since predicated subtypes are frozen here, but their freezing
-- actions are in Analyze_Freeze_Entity, which has not been called
-- yet for entities frozen within this procedure, so we moved that
-- call to the Analyze_Freeze_Entity for the record type.
end Check_Variant_Part;
-- Check that all the primitives of an interface type are abstract
-- or null procedures.
if Is_Interface (Rec)
and then not Error_Posted (Parent (Rec))
then
declare
Elmt : Elmt_Id;
Subp : Entity_Id;
begin
Elmt := First_Elmt (Primitive_Operations (Rec));
while Present (Elmt) loop
Subp := Node (Elmt);
if not Is_Abstract_Subprogram (Subp)
-- Avoid reporting the error on inherited primitives
and then Comes_From_Source (Subp)
then
Error_Msg_Name_1 := Chars (Subp);
if Ekind (Subp) = E_Procedure then
if not Null_Present (Parent (Subp)) then
Error_Msg_N
("interface procedure % must be abstract or null",
Parent (Subp));
end if;
else
Error_Msg_N
("interface function % must be abstract",
Parent (Subp));
end if;
end if;
Next_Elmt (Elmt);
end loop;
end;
end if;
-- For a derived tagged type, check whether inherited primitives
-- might require a wrapper to handle class-wide conditions.
if Is_Tagged_Type (Rec) and then Is_Derived_Type (Rec) then
Check_Inherited_Conditions (Rec);
end if;
end Freeze_Record_Type;
-------------------------------
-- Has_Boolean_Aspect_Import --
-------------------------------
function Has_Boolean_Aspect_Import (E : Entity_Id) return Boolean is
Decl : constant Node_Id := Declaration_Node (E);
Asp : Node_Id;
Expr : Node_Id;
begin
if Has_Aspects (Decl) then
Asp := First (Aspect_Specifications (Decl));
while Present (Asp) loop
Expr := Expression (Asp);
-- The value of aspect Import is True when the expression is
-- either missing or it is explicitly set to True.
if Get_Aspect_Id (Asp) = Aspect_Import
and then (No (Expr)
or else (Compile_Time_Known_Value (Expr)
and then Is_True (Expr_Value (Expr))))
then
return True;
end if;
Next (Asp);
end loop;
end if;
return False;
end Has_Boolean_Aspect_Import;
-------------------------
-- Inherit_Freeze_Node --
-------------------------
procedure Inherit_Freeze_Node
(Fnod : Node_Id;
Typ : Entity_Id)
is
Typ_Fnod : constant Node_Id := Freeze_Node (Typ);
begin
Set_Freeze_Node (Typ, Fnod);
Set_Entity (Fnod, Typ);
-- The input type had an existing node. Propagate relevant attributes
-- from the old freeze node to the inherited freeze node.
-- ??? if both freeze nodes have attributes, would they differ?
if Present (Typ_Fnod) then
-- Attribute Access_Types_To_Process
if Present (Access_Types_To_Process (Typ_Fnod))
and then No (Access_Types_To_Process (Fnod))
then
Set_Access_Types_To_Process (Fnod,
Access_Types_To_Process (Typ_Fnod));
end if;
-- Attribute Actions
if Present (Actions (Typ_Fnod)) and then No (Actions (Fnod)) then
Set_Actions (Fnod, Actions (Typ_Fnod));
end if;
-- Attribute First_Subtype_Link
if Present (First_Subtype_Link (Typ_Fnod))
and then No (First_Subtype_Link (Fnod))
then
Set_First_Subtype_Link (Fnod, First_Subtype_Link (Typ_Fnod));
end if;
-- Attribute TSS_Elist
if Present (TSS_Elist (Typ_Fnod))
and then No (TSS_Elist (Fnod))
then
Set_TSS_Elist (Fnod, TSS_Elist (Typ_Fnod));
end if;
end if;
end Inherit_Freeze_Node;
------------------------------
-- Wrap_Imported_Subprogram --
------------------------------
-- The issue here is that our normal approach of checking preconditions
-- and postconditions does not work for imported procedures, since we
-- are not generating code for the body. To get around this we create
-- a wrapper, as shown by the following example:
-- procedure K (A : Integer);
-- pragma Import (C, K);
-- The spec is rewritten by removing the effects of pragma Import, but
-- leaving the convention unchanged, as though the source had said:
-- procedure K (A : Integer);
-- pragma Convention (C, K);
-- and we create a body, added to the entity K freeze actions, which
-- looks like:
-- procedure K (A : Integer) is
-- procedure K (A : Integer);
-- pragma Import (C, K);
-- begin
-- K (A);
-- end K;
-- Now the contract applies in the normal way to the outer procedure,
-- and the inner procedure has no contracts, so there is no problem
-- in just calling it to get the original effect.
-- In the case of a function, we create an appropriate return statement
-- for the subprogram body that calls the inner procedure.
procedure Wrap_Imported_Subprogram (E : Entity_Id) is
function Copy_Import_Pragma return Node_Id;
-- Obtain a copy of the Import_Pragma which belongs to subprogram E
------------------------
-- Copy_Import_Pragma --
------------------------
function Copy_Import_Pragma return Node_Id is
-- The subprogram should have an import pragma, otherwise it does
-- need a wrapper.
Prag : constant Node_Id := Import_Pragma (E);
pragma Assert (Present (Prag));
-- Save all semantic fields of the pragma
Save_Asp : constant Node_Id := Corresponding_Aspect (Prag);
Save_From : constant Boolean := From_Aspect_Specification (Prag);
Save_Prag : constant Node_Id := Next_Pragma (Prag);
Save_Rep : constant Node_Id := Next_Rep_Item (Prag);
Result : Node_Id;
begin
-- Reset all semantic fields. This avoids a potential infinite
-- loop when the pragma comes from an aspect as the duplication
-- will copy the aspect, then copy the corresponding pragma and
-- so on.
Set_Corresponding_Aspect (Prag, Empty);
Set_From_Aspect_Specification (Prag, False);
Set_Next_Pragma (Prag, Empty);
Set_Next_Rep_Item (Prag, Empty);
Result := Copy_Separate_Tree (Prag);
-- Restore the original semantic fields
Set_Corresponding_Aspect (Prag, Save_Asp);
Set_From_Aspect_Specification (Prag, Save_From);
Set_Next_Pragma (Prag, Save_Prag);
Set_Next_Rep_Item (Prag, Save_Rep);
return Result;
end Copy_Import_Pragma;
-- Local variables
Loc : constant Source_Ptr := Sloc (E);
CE : constant Name_Id := Chars (E);
Bod : Node_Id;
Forml : Entity_Id;
Parms : List_Id;
Prag : Node_Id;
Spec : Node_Id;
Stmt : Node_Id;
-- Start of processing for Wrap_Imported_Subprogram
begin
-- Nothing to do if not imported
if not Is_Imported (E) then
return;
-- Test enabling conditions for wrapping
elsif Is_Subprogram (E)
and then Present (Contract (E))
and then Present (Pre_Post_Conditions (Contract (E)))
and then not GNATprove_Mode
then
-- Here we do the wrap
-- Note on calls to Copy_Separate_Tree. The trees we are copying
-- here are fully analyzed, but we definitely want fully syntactic
-- unanalyzed trees in the body we construct, so that the analysis
-- generates the right visibility, and that is exactly what the
-- calls to Copy_Separate_Tree give us.
Prag := Copy_Import_Pragma;
-- Fix up spec to be not imported any more
Set_Has_Completion (E, False);
Set_Import_Pragma (E, Empty);
Set_Interface_Name (E, Empty);
Set_Is_Imported (E, False);
-- Grab the subprogram declaration and specification
Spec := Declaration_Node (E);
-- Build parameter list that we need
Parms := New_List;
Forml := First_Formal (E);
while Present (Forml) loop
Append_To (Parms, Make_Identifier (Loc, Chars (Forml)));
Next_Formal (Forml);
end loop;
-- Build the call
if Ekind_In (E, E_Function, E_Generic_Function) then
Stmt :=
Make_Simple_Return_Statement (Loc,
Expression =>
Make_Function_Call (Loc,
Name => Make_Identifier (Loc, CE),
Parameter_Associations => Parms));
else
Stmt :=
Make_Procedure_Call_Statement (Loc,
Name => Make_Identifier (Loc, CE),
Parameter_Associations => Parms);
end if;
-- Now build the body
Bod :=
Make_Subprogram_Body (Loc,
Specification =>
Copy_Separate_Tree (Spec),
Declarations => New_List (
Make_Subprogram_Declaration (Loc,
Specification => Copy_Separate_Tree (Spec)),
Prag),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (Stmt),
End_Label => Make_Identifier (Loc, CE)));
-- Append the body to freeze result
Add_To_Result (Bod);
return;
-- Case of imported subprogram that does not get wrapped
else
-- Set Is_Public. All imported entities need an external symbol
-- created for them since they are always referenced from another
-- object file. Note this used to be set when we set Is_Imported
-- back in Sem_Prag, but now we delay it to this point, since we
-- don't want to set this flag if we wrap an imported subprogram.
Set_Is_Public (E);
end if;
end Wrap_Imported_Subprogram;
-- Local variables
Mode : Ghost_Mode_Type;
-- Start of processing for Freeze_Entity
begin
-- The entity being frozen may be subject to pragma Ghost. Set the mode
-- now to ensure that any nodes generated during freezing are properly
-- flagged as Ghost.
Set_Ghost_Mode (E, Mode);
-- We are going to test for various reasons why this entity need not be
-- frozen here, but in the case of an Itype that's defined within a
-- record, that test actually applies to the record.
if Is_Itype (E) and then Is_Record_Type (Scope (E)) then
Test_E := Scope (E);
elsif Is_Itype (E) and then Present (Underlying_Type (Scope (E)))
and then Is_Record_Type (Underlying_Type (Scope (E)))
then
Test_E := Underlying_Type (Scope (E));
end if;
-- Do not freeze if already frozen since we only need one freeze node
if Is_Frozen (E) then
Result := No_List;
goto Leave;
elsif Ekind (E) = E_Generic_Package then
Result := Freeze_Generic_Entities (E);
goto Leave;
-- It is improper to freeze an external entity within a generic because
-- its freeze node will appear in a non-valid context. The entity will
-- be frozen in the proper scope after the current generic is analyzed.
-- However, aspects must be analyzed because they may be queried later
-- within the generic itself, and the corresponding pragma or attribute
-- definition has not been analyzed yet.
elsif Inside_A_Generic and then External_Ref_In_Generic (Test_E) then
if Has_Delayed_Aspects (E) then
Analyze_Aspects_At_Freeze_Point (E);
end if;
Result := No_List;
goto Leave;
-- AI05-0213: A formal incomplete type does not freeze the actual. In
-- the instance, the same applies to the subtype renaming the actual.
elsif Is_Private_Type (E)
and then Is_Generic_Actual_Type (E)
and then No (Full_View (Base_Type (E)))
and then Ada_Version >= Ada_2012
then
Result := No_List;
goto Leave;
-- Formal subprograms are never frozen
elsif Is_Formal_Subprogram (E) then
Result := No_List;
goto Leave;
-- Generic types are never frozen as they lack delayed semantic checks
elsif Is_Generic_Type (E) then
Result := No_List;
goto Leave;
-- Do not freeze a global entity within an inner scope created during
-- expansion. A call to subprogram E within some internal procedure
-- (a stream attribute for example) might require freezing E, but the
-- freeze node must appear in the same declarative part as E itself.
-- The two-pass elaboration mechanism in gigi guarantees that E will
-- be frozen before the inner call is elaborated. We exclude constants
-- from this test, because deferred constants may be frozen early, and
-- must be diagnosed (e.g. in the case of a deferred constant being used
-- in a default expression). If the enclosing subprogram comes from
-- source, or is a generic instance, then the freeze point is the one
-- mandated by the language, and we freeze the entity. A subprogram that
-- is a child unit body that acts as a spec does not have a spec that
-- comes from source, but can only come from source.
elsif In_Open_Scopes (Scope (Test_E))
and then Scope (Test_E) /= Current_Scope
and then Ekind (Test_E) /= E_Constant
then
declare
S : Entity_Id;
begin
S := Current_Scope;
while Present (S) loop
if Is_Overloadable (S) then
if Comes_From_Source (S)
or else Is_Generic_Instance (S)
or else Is_Child_Unit (S)
then
exit;
else
Result := No_List;
goto Leave;
end if;
end if;
S := Scope (S);
end loop;
end;
-- Similarly, an inlined instance body may make reference to global
-- entities, but these references cannot be the proper freezing point
-- for them, and in the absence of inlining freezing will take place in
-- their own scope. Normally instance bodies are analyzed after the
-- enclosing compilation, and everything has been frozen at the proper
-- place, but with front-end inlining an instance body is compiled
-- before the end of the enclosing scope, and as a result out-of-order
-- freezing must be prevented.
elsif Front_End_Inlining
and then In_Instance_Body
and then Present (Scope (Test_E))
then
declare
S : Entity_Id;
begin
S := Scope (Test_E);
while Present (S) loop
if Is_Generic_Instance (S) then
exit;
else
S := Scope (S);
end if;
end loop;
if No (S) then
Result := No_List;
goto Leave;
end if;
end;
end if;
-- Add checks to detect proper initialization of scalars that may appear
-- as subprogram parameters.
if Is_Subprogram (E) and then Check_Validity_Of_Parameters then
Apply_Parameter_Validity_Checks (E);
end if;
-- Deal with delayed aspect specifications. The analysis of the aspect
-- is required to be delayed to the freeze point, thus we analyze the
-- pragma or attribute definition clause in the tree at this point. We
-- also analyze the aspect specification node at the freeze point when
-- the aspect doesn't correspond to pragma/attribute definition clause.
if Has_Delayed_Aspects (E) then
Analyze_Aspects_At_Freeze_Point (E);
end if;
-- Here to freeze the entity
Set_Is_Frozen (E);
-- Case of entity being frozen is other than a type
if not Is_Type (E) then
-- If entity is exported or imported and does not have an external
-- name, now is the time to provide the appropriate default name.
-- Skip this if the entity is stubbed, since we don't need a name
-- for any stubbed routine. For the case on intrinsics, if no
-- external name is specified, then calls will be handled in
-- Exp_Intr.Expand_Intrinsic_Call, and no name is needed. If an
-- external name is provided, then Expand_Intrinsic_Call leaves
-- calls in place for expansion by GIGI.
if (Is_Imported (E) or else Is_Exported (E))
and then No (Interface_Name (E))
and then Convention (E) /= Convention_Stubbed
and then Convention (E) /= Convention_Intrinsic
then
Set_Encoded_Interface_Name
(E, Get_Default_External_Name (E));
-- If entity is an atomic object appearing in a declaration and
-- the expression is an aggregate, assign it to a temporary to
-- ensure that the actual assignment is done atomically rather
-- than component-wise (the assignment to the temp may be done
-- component-wise, but that is harmless).
elsif Is_Atomic_Or_VFA (E)
and then Nkind (Parent (E)) = N_Object_Declaration
and then Present (Expression (Parent (E)))
and then Nkind (Expression (Parent (E))) = N_Aggregate
and then Is_Atomic_VFA_Aggregate (Expression (Parent (E)))
then
null;
end if;
-- Subprogram case
if Is_Subprogram (E) then
-- Check for needing to wrap imported subprogram
Wrap_Imported_Subprogram (E);
-- Freeze all parameter types and the return type (RM 13.14(14)).
-- However skip this for internal subprograms. This is also where
-- any extra formal parameters are created since we now know
-- whether the subprogram will use a foreign convention.
-- In Ada 2012, freezing a subprogram does not always freeze the
-- corresponding profile (see AI05-019). An attribute reference
-- is not a freezing point of the profile. Flag Do_Freeze_Profile
-- indicates whether the profile should be frozen now.
-- Other constructs that should not freeze ???
-- This processing doesn't apply to internal entities (see below)
if not Is_Internal (E) and then Do_Freeze_Profile then
if not Freeze_Profile (E) then
goto Leave;
end if;
end if;
-- Must freeze its parent first if it is a derived subprogram
if Present (Alias (E)) then
Freeze_And_Append (Alias (E), N, Result);
end if;
-- We don't freeze internal subprograms, because we don't normally
-- want addition of extra formals or mechanism setting to happen
-- for those. However we do pass through predefined dispatching
-- cases, since extra formals may be needed in some cases, such as
-- for the stream 'Input function (build-in-place formals).
if not Is_Internal (E)
or else Is_Predefined_Dispatching_Operation (E)
then
Freeze_Subprogram (E);
end if;
-- If warning on suspicious contracts then check for the case of
-- a postcondition other than False for a No_Return subprogram.
if No_Return (E)
and then Warn_On_Suspicious_Contract
and then Present (Contract (E))
then
declare
Prag : Node_Id := Pre_Post_Conditions (Contract (E));
Exp : Node_Id;
begin
while Present (Prag) loop
if Nam_In (Pragma_Name_Unmapped (Prag),
Name_Post,
Name_Postcondition,
Name_Refined_Post)
then
Exp :=
Expression
(First (Pragma_Argument_Associations (Prag)));
if Nkind (Exp) /= N_Identifier
or else Chars (Exp) /= Name_False
then
Error_Msg_NE
("useless postcondition, & is marked "
& "No_Return?T?", Exp, E);
end if;
end if;
Prag := Next_Pragma (Prag);
end loop;
end;
end if;
-- Here for other than a subprogram or type
else
-- If entity has a type, and it is not a generic unit, then
-- freeze it first (RM 13.14(10)).
if Present (Etype (E))
and then Ekind (E) /= E_Generic_Function
then
Freeze_And_Append (Etype (E), N, Result);
-- For an object of an anonymous array type, aspects on the
-- object declaration apply to the type itself. This is the
-- case for Atomic_Components, Volatile_Components, and
-- Independent_Components. In these cases analysis of the
-- generated pragma will mark the anonymous types accordingly,
-- and the object itself does not require a freeze node.
if Ekind (E) = E_Variable
and then Is_Itype (Etype (E))
and then Is_Array_Type (Etype (E))
and then Has_Delayed_Aspects (E)
then
Set_Has_Delayed_Aspects (E, False);
Set_Has_Delayed_Freeze (E, False);
Set_Freeze_Node (E, Empty);
end if;
end if;
-- Special processing for objects created by object declaration
if Nkind (Declaration_Node (E)) = N_Object_Declaration then
Freeze_Object_Declaration (E);
end if;
-- Check that a constant which has a pragma Volatile[_Components]
-- or Atomic[_Components] also has a pragma Import (RM C.6(13)).
-- Note: Atomic[_Components] also sets Volatile[_Components]
if Ekind (E) = E_Constant
and then (Has_Volatile_Components (E) or else Is_Volatile (E))
and then not Is_Imported (E)
and then not Has_Boolean_Aspect_Import (E)
then
-- Make sure we actually have a pragma, and have not merely
-- inherited the indication from elsewhere (e.g. an address
-- clause, which is not good enough in RM terms).
if Has_Rep_Pragma (E, Name_Atomic)
or else
Has_Rep_Pragma (E, Name_Atomic_Components)
then
Error_Msg_N
("stand alone atomic constant must be " &
"imported (RM C.6(13))", E);
elsif Has_Rep_Pragma (E, Name_Volatile)
or else
Has_Rep_Pragma (E, Name_Volatile_Components)
then
Error_Msg_N
("stand alone volatile constant must be " &
"imported (RM C.6(13))", E);
end if;
end if;
-- Static objects require special handling
if (Ekind (E) = E_Constant or else Ekind (E) = E_Variable)
and then Is_Statically_Allocated (E)
then
Freeze_Static_Object (E);
end if;
-- Remaining step is to layout objects
if Ekind_In (E, E_Variable, E_Constant, E_Loop_Parameter)
or else Is_Formal (E)
then
Layout_Object (E);
end if;
-- For an object that does not have delayed freezing, and whose
-- initialization actions have been captured in a compound
-- statement, move them back now directly within the enclosing
-- statement sequence.
if Ekind_In (E, E_Constant, E_Variable)
and then not Has_Delayed_Freeze (E)
then
Explode_Initialization_Compound_Statement (E);
end if;
end if;
-- Case of a type or subtype being frozen
else
-- We used to check here that a full type must have preelaborable
-- initialization if it completes a private type specified with
-- pragma Preelaborable_Initialization, but that missed cases where
-- the types occur within a generic package, since the freezing
-- that occurs within a containing scope generally skips traversal
-- of a generic unit's declarations (those will be frozen within
-- instances). This check was moved to Analyze_Package_Specification.
-- The type may be defined in a generic unit. This can occur when
-- freezing a generic function that returns the type (which is
-- defined in a parent unit). It is clearly meaningless to freeze
-- this type. However, if it is a subtype, its size may be determi-
-- nable and used in subsequent checks, so might as well try to
-- compute it.
-- In Ada 2012, Freeze_Entities is also used in the front end to
-- trigger the analysis of aspect expressions, so in this case we
-- want to continue the freezing process.
-- Is_Generic_Unit (Scope (E)) is dubious here, do we want instead
-- In_Generic_Scope (E)???
if Present (Scope (E))
and then Is_Generic_Unit (Scope (E))
and then
(not Has_Predicates (E)
and then not Has_Delayed_Freeze (E))
then
Check_Compile_Time_Size (E);
Result := No_List;
goto Leave;
end if;
-- Check for error of Type_Invariant'Class applied to an untagged
-- type (check delayed to freeze time when full type is available).
declare
Prag : constant Node_Id := Get_Pragma (E, Pragma_Invariant);
begin
if Present (Prag)
and then Class_Present (Prag)
and then not Is_Tagged_Type (E)
then
Error_Msg_NE
("Type_Invariant''Class cannot be specified for &", Prag, E);
Error_Msg_N
("\can only be specified for a tagged type", Prag);
end if;
end;
if Is_Ghost_Entity (E) then
-- A Ghost type cannot be concurrent (SPARK RM 6.9(19)). Verify
-- this legality rule first to five a finer-grained diagnostic.
if Is_Concurrent_Type (E) then
Error_Msg_N ("ghost type & cannot be concurrent", E);
-- A Ghost type cannot be effectively volatile (SPARK RM 6.9(7))
elsif Is_Effectively_Volatile (E) then
Error_Msg_N ("ghost type & cannot be volatile", E);
end if;
end if;
-- Deal with special cases of freezing for subtype
if E /= Base_Type (E) then
-- Before we do anything else, a specific test for the case of a
-- size given for an array where the array would need to be packed
-- in order for the size to be honored, but is not. This is the
-- case where implicit packing may apply. The reason we do this so
-- early is that, if we have implicit packing, the layout of the
-- base type is affected, so we must do this before we freeze the
-- base type.
-- We could do this processing only if implicit packing is enabled
-- since in all other cases, the error would be caught by the back
-- end. However, we choose to do the check even if we do not have
-- implicit packing enabled, since this allows us to give a more
-- useful error message (advising use of pragma Implicit_Packing
-- or pragma Pack).
if Is_Array_Type (E) then
declare
Ctyp : constant Entity_Id := Component_Type (E);
Rsiz : constant Uint := RM_Size (Ctyp);
SZ : constant Node_Id := Size_Clause (E);
Btyp : constant Entity_Id := Base_Type (E);
Lo : Node_Id;
Hi : Node_Id;
Indx : Node_Id;
Dim : Uint;
Num_Elmts : Uint := Uint_1;
-- Number of elements in array
begin
-- Check enabling conditions. These are straightforward
-- except for the test for a limited composite type. This
-- eliminates the rare case of a array of limited components
-- where there are issues of whether or not we can go ahead
-- and pack the array (since we can't freely pack and unpack
-- arrays if they are limited).
-- Note that we check the root type explicitly because the
-- whole point is we are doing this test before we have had
-- a chance to freeze the base type (and it is that freeze
-- action that causes stuff to be inherited).
-- The conditions on the size are identical to those used in
-- Freeze_Array_Type to set the Is_Packed flag.
if Has_Size_Clause (E)
and then Known_Static_RM_Size (E)
and then not Is_Packed (E)
and then not Has_Pragma_Pack (E)
and then not Has_Component_Size_Clause (E)
and then Known_Static_RM_Size (Ctyp)
and then Rsiz <= 64
and then not (Addressable (Rsiz)
and then Known_Static_Esize (Ctyp)
and then Esize (Ctyp) = Rsiz)
and then not (Rsiz mod System_Storage_Unit = 0
and then Is_Composite_Type (Ctyp))
and then not Is_Limited_Composite (E)
and then not Is_Packed (Root_Type (E))
and then not Has_Component_Size_Clause (Root_Type (E))
and then not (CodePeer_Mode or GNATprove_Mode)
then
-- Compute number of elements in array
Indx := First_Index (E);
while Present (Indx) loop
Get_Index_Bounds (Indx, Lo, Hi);
if not (Compile_Time_Known_Value (Lo)
and then
Compile_Time_Known_Value (Hi))
then
goto No_Implicit_Packing;
end if;
Dim := Expr_Value (Hi) - Expr_Value (Lo) + 1;
if Dim >= 0 then
Num_Elmts := Num_Elmts * Dim;
else
Num_Elmts := Uint_0;
end if;
Next_Index (Indx);
end loop;
-- What we are looking for here is the situation where
-- the RM_Size given would be exactly right if there was
-- a pragma Pack, resulting in the component size being
-- the RM_Size of the component type.
if RM_Size (E) = Num_Elmts * Rsiz then
-- For implicit packing mode, just set the component
-- size and Freeze_Array_Type will do the rest.
if Implicit_Packing then
Set_Component_Size (Btyp, Rsiz);
-- Otherwise give an error message
else
Error_Msg_NE
("size given for& too small", SZ, E);
Error_Msg_N -- CODEFIX
("\use explicit pragma Pack or use pragma "
& "Implicit_Packing", SZ);
end if;
end if;
end if;
end;
end if;
<<No_Implicit_Packing>>
-- If ancestor subtype present, freeze that first. Note that this
-- will also get the base type frozen. Need RM reference ???
Atype := Ancestor_Subtype (E);
if Present (Atype) then
Freeze_And_Append (Atype, N, Result);
-- No ancestor subtype present
else
-- See if we have a nearest ancestor that has a predicate.
-- That catches the case of derived type with a predicate.
-- Need RM reference here ???
Atype := Nearest_Ancestor (E);
if Present (Atype) and then Has_Predicates (Atype) then
Freeze_And_Append (Atype, N, Result);
end if;
-- Freeze base type before freezing the entity (RM 13.14(15))
if E /= Base_Type (E) then
Freeze_And_Append (Base_Type (E), N, Result);
end if;
end if;
-- A subtype inherits all the type-related representation aspects
-- from its parents (RM 13.1(8)).
Inherit_Aspects_At_Freeze_Point (E);
-- For a derived type, freeze its parent type first (RM 13.14(15))
elsif Is_Derived_Type (E) then
Freeze_And_Append (Etype (E), N, Result);
Freeze_And_Append (First_Subtype (Etype (E)), N, Result);
-- A derived type inherits each type-related representation aspect
-- of its parent type that was directly specified before the
-- declaration of the derived type (RM 13.1(15)).
Inherit_Aspects_At_Freeze_Point (E);
end if;
-- Check for incompatible size and alignment for record type
if Warn_On_Size_Alignment
and then Is_Record_Type (E)
and then Has_Size_Clause (E) and then Has_Alignment_Clause (E)
-- If explicit Object_Size clause given assume that the programmer
-- knows what he is doing, and expects the compiler behavior.
and then not Has_Object_Size_Clause (E)
-- Check for size not a multiple of alignment
and then RM_Size (E) mod (Alignment (E) * System_Storage_Unit) /= 0
then
declare
SC : constant Node_Id := Size_Clause (E);
AC : constant Node_Id := Alignment_Clause (E);
Loc : Node_Id;
Abits : constant Uint := Alignment (E) * System_Storage_Unit;
begin
if Present (SC) and then Present (AC) then
-- Give a warning
if Sloc (SC) > Sloc (AC) then
Loc := SC;
Error_Msg_NE
("?Z?size is not a multiple of alignment for &",
Loc, E);
Error_Msg_Sloc := Sloc (AC);
Error_Msg_Uint_1 := Alignment (E);
Error_Msg_N ("\?Z?alignment of ^ specified #", Loc);
else
Loc := AC;
Error_Msg_NE
("?Z?size is not a multiple of alignment for &",
Loc, E);
Error_Msg_Sloc := Sloc (SC);
Error_Msg_Uint_1 := RM_Size (E);
Error_Msg_N ("\?Z?size of ^ specified #", Loc);
end if;
Error_Msg_Uint_1 := ((RM_Size (E) / Abits) + 1) * Abits;
Error_Msg_N ("\?Z?Object_Size will be increased to ^", Loc);
end if;
end;
end if;
-- Array type
if Is_Array_Type (E) then
Freeze_Array_Type (E);
-- For a class-wide type, the corresponding specific type is
-- frozen as well (RM 13.14(15))
elsif Is_Class_Wide_Type (E) then
Freeze_And_Append (Root_Type (E), N, Result);
-- If the base type of the class-wide type is still incomplete,
-- the class-wide remains unfrozen as well. This is legal when
-- E is the formal of a primitive operation of some other type
-- which is being frozen.
if not Is_Frozen (Root_Type (E)) then
Set_Is_Frozen (E, False);
goto Leave;
end if;
-- The equivalent type associated with a class-wide subtype needs
-- to be frozen to ensure that its layout is done.
if Ekind (E) = E_Class_Wide_Subtype
and then Present (Equivalent_Type (E))
then
Freeze_And_Append (Equivalent_Type (E), N, Result);
end if;
-- Generate an itype reference for a library-level class-wide type
-- at the freeze point. Otherwise the first explicit reference to
-- the type may appear in an inner scope which will be rejected by
-- the back-end.
if Is_Itype (E)
and then Is_Compilation_Unit (Scope (E))
then
declare
Ref : constant Node_Id := Make_Itype_Reference (Loc);
begin
Set_Itype (Ref, E);
-- From a gigi point of view, a class-wide subtype derives
-- from its record equivalent type. As a result, the itype
-- reference must appear after the freeze node of the
-- equivalent type or gigi will reject the reference.
if Ekind (E) = E_Class_Wide_Subtype
and then Present (Equivalent_Type (E))
then
Insert_After (Freeze_Node (Equivalent_Type (E)), Ref);
else
Add_To_Result (Ref);
end if;
end;
end if;
-- For a record type or record subtype, freeze all component types
-- (RM 13.14(15)). We test for E_Record_(sub)Type here, rather than
-- using Is_Record_Type, because we don't want to attempt the freeze
-- for the case of a private type with record extension (we will do
-- that later when the full type is frozen).
elsif Ekind_In (E, E_Record_Type, E_Record_Subtype) then
if not In_Generic_Scope (E) then
Freeze_Record_Type (E);
end if;
-- Report a warning if a discriminated record base type has a
-- convention with language C or C++ applied to it. This check is
-- done even within generic scopes (but not in instantiations),
-- which is why we don't do it as part of Freeze_Record_Type.
Check_Suspicious_Convention (E);
-- For a concurrent type, freeze corresponding record type. This does
-- not correspond to any specific rule in the RM, but the record type
-- is essentially part of the concurrent type. Also freeze all local
-- entities. This includes record types created for entry parameter
-- blocks and whatever local entities may appear in the private part.
elsif Is_Concurrent_Type (E) then
if Present (Corresponding_Record_Type (E)) then
Freeze_And_Append (Corresponding_Record_Type (E), N, Result);
end if;
Comp := First_Entity (E);
while Present (Comp) loop
if Is_Type (Comp) then
Freeze_And_Append (Comp, N, Result);
elsif (Ekind (Comp)) /= E_Function then
-- The guard on the presence of the Etype seems to be needed
-- for some CodePeer (-gnatcC) cases, but not clear why???
if Present (Etype (Comp)) then
if Is_Itype (Etype (Comp))
and then Underlying_Type (Scope (Etype (Comp))) = E
then
Undelay_Type (Etype (Comp));
end if;
Freeze_And_Append (Etype (Comp), N, Result);
end if;
end if;
Next_Entity (Comp);
end loop;
-- Private types are required to point to the same freeze node as
-- their corresponding full views. The freeze node itself has to
-- point to the partial view of the entity (because from the partial
-- view, we can retrieve the full view, but not the reverse).
-- However, in order to freeze correctly, we need to freeze the full
-- view. If we are freezing at the end of a scope (or within the
-- scope) of the private type, the partial and full views will have
-- been swapped, the full view appears first in the entity chain and
-- the swapping mechanism ensures that the pointers are properly set
-- (on scope exit).
-- If we encounter the partial view before the full view (e.g. when
-- freezing from another scope), we freeze the full view, and then
-- set the pointers appropriately since we cannot rely on swapping to
-- fix things up (subtypes in an outer scope might not get swapped).
-- If the full view is itself private, the above requirements apply
-- to the underlying full view instead of the full view. But there is
-- no swapping mechanism for the underlying full view so we need to
-- set the pointers appropriately in both cases.
elsif Is_Incomplete_Or_Private_Type (E)
and then not Is_Generic_Type (E)
then
-- The construction of the dispatch table associated with library
-- level tagged types forces freezing of all the primitives of the
-- type, which may cause premature freezing of the partial view.
-- For example:
-- package Pkg is
-- type T is tagged private;
-- type DT is new T with private;
-- procedure Prim (X : in out T; Y : in out DT'Class);
-- private
-- type T is tagged null record;
-- Obj : T;
-- type DT is new T with null record;
-- end;
-- In this case the type will be frozen later by the usual
-- mechanism: an object declaration, an instantiation, or the
-- end of a declarative part.
if Is_Library_Level_Tagged_Type (E)
and then not Present (Full_View (E))
then
Set_Is_Frozen (E, False);
goto Leave;
-- Case of full view present
elsif Present (Full_View (E)) then
-- If full view has already been frozen, then no further
-- processing is required
if Is_Frozen (Full_View (E)) then
Set_Has_Delayed_Freeze (E, False);
Set_Freeze_Node (E, Empty);
-- Otherwise freeze full view and patch the pointers so that
-- the freeze node will elaborate both views in the back end.
-- However, if full view is itself private, freeze underlying
-- full view instead and patch the pointers so that the freeze
-- node will elaborate the three views in the back end.
else
declare
Full : Entity_Id := Full_View (E);
begin
if Is_Private_Type (Full)
and then Present (Underlying_Full_View (Full))
then
Full := Underlying_Full_View (Full);
end if;
Freeze_And_Append (Full, N, Result);
if Full /= Full_View (E)
and then Has_Delayed_Freeze (Full_View (E))
then
F_Node := Freeze_Node (Full);
if Present (F_Node) then
Inherit_Freeze_Node
(Fnod => F_Node,
Typ => Full_View (E));
else
Set_Has_Delayed_Freeze (Full_View (E), False);
Set_Freeze_Node (Full_View (E), Empty);
end if;
end if;
if Has_Delayed_Freeze (E) then
F_Node := Freeze_Node (Full_View (E));
if Present (F_Node) then
Inherit_Freeze_Node
(Fnod => F_Node,
Typ => E);
else
-- {Incomplete,Private}_Subtypes with Full_Views
-- constrained by discriminants.
Set_Has_Delayed_Freeze (E, False);
Set_Freeze_Node (E, Empty);
end if;
end if;
end;
end if;
Check_Debug_Info_Needed (E);
-- AI-117 requires that the convention of a partial view be the
-- same as the convention of the full view. Note that this is a
-- recognized breach of privacy, but it's essential for logical
-- consistency of representation, and the lack of a rule in
-- RM95 was an oversight.
Set_Convention (E, Convention (Full_View (E)));
Set_Size_Known_At_Compile_Time (E,
Size_Known_At_Compile_Time (Full_View (E)));
-- Size information is copied from the full view to the
-- incomplete or private view for consistency.
-- We skip this is the full view is not a type. This is very
-- strange of course, and can only happen as a result of
-- certain illegalities, such as a premature attempt to derive
-- from an incomplete type.
if Is_Type (Full_View (E)) then
Set_Size_Info (E, Full_View (E));
Set_RM_Size (E, RM_Size (Full_View (E)));
end if;
goto Leave;
-- Case of underlying full view present
elsif Is_Private_Type (E)
and then Present (Underlying_Full_View (E))
then
if not Is_Frozen (Underlying_Full_View (E)) then
Freeze_And_Append (Underlying_Full_View (E), N, Result);
end if;
-- Patch the pointers so that the freeze node will elaborate
-- both views in the back end.
if Has_Delayed_Freeze (E) then
F_Node := Freeze_Node (Underlying_Full_View (E));
if Present (F_Node) then
Inherit_Freeze_Node
(Fnod => F_Node,
Typ => E);
else
Set_Has_Delayed_Freeze (E, False);
Set_Freeze_Node (E, Empty);
end if;
end if;
Check_Debug_Info_Needed (E);
goto Leave;
-- Case of no full view present. If entity is derived or subtype,
-- it is safe to freeze, correctness depends on the frozen status
-- of parent. Otherwise it is either premature usage, or a Taft
-- amendment type, so diagnosis is at the point of use and the
-- type might be frozen later.
elsif E /= Base_Type (E) or else Is_Derived_Type (E) then
null;
else
Set_Is_Frozen (E, False);
Result := No_List;
goto Leave;
end if;
-- For access subprogram, freeze types of all formals, the return
-- type was already frozen, since it is the Etype of the function.
-- Formal types can be tagged Taft amendment types, but otherwise
-- they cannot be incomplete.
elsif Ekind (E) = E_Subprogram_Type then
Formal := First_Formal (E);
while Present (Formal) loop
if Ekind (Etype (Formal)) = E_Incomplete_Type
and then No (Full_View (Etype (Formal)))
then
if Is_Tagged_Type (Etype (Formal)) then
null;
-- AI05-151: Incomplete types are allowed in access to
-- subprogram specifications.
elsif Ada_Version < Ada_2012 then
Error_Msg_NE
("invalid use of incomplete type&", E, Etype (Formal));
end if;
end if;
Freeze_And_Append (Etype (Formal), N, Result);
Next_Formal (Formal);
end loop;
Freeze_Subprogram (E);
-- For access to a protected subprogram, freeze the equivalent type
-- (however this is not set if we are not generating code or if this
-- is an anonymous type used just for resolution).
elsif Is_Access_Protected_Subprogram_Type (E) then
if Present (Equivalent_Type (E)) then
Freeze_And_Append (Equivalent_Type (E), N, Result);
end if;
end if;
-- Generic types are never seen by the back-end, and are also not
-- processed by the expander (since the expander is turned off for
-- generic processing), so we never need freeze nodes for them.
if Is_Generic_Type (E) then
goto Leave;
end if;
-- Some special processing for non-generic types to complete
-- representation details not known till the freeze point.
if Is_Fixed_Point_Type (E) then
Freeze_Fixed_Point_Type (E);
-- Some error checks required for ordinary fixed-point type. Defer
-- these till the freeze-point since we need the small and range
-- values. We only do these checks for base types
if Is_Ordinary_Fixed_Point_Type (E) and then Is_Base_Type (E) then
if Small_Value (E) < Ureal_2_M_80 then
Error_Msg_Name_1 := Name_Small;
Error_Msg_N
("`&''%` too small, minimum allowed is 2.0'*'*(-80)", E);
elsif Small_Value (E) > Ureal_2_80 then
Error_Msg_Name_1 := Name_Small;
Error_Msg_N
("`&''%` too large, maximum allowed is 2.0'*'*80", E);
end if;
if Expr_Value_R (Type_Low_Bound (E)) < Ureal_M_10_36 then
Error_Msg_Name_1 := Name_First;
Error_Msg_N
("`&''%` too small, minimum allowed is -10.0'*'*36", E);
end if;
if Expr_Value_R (Type_High_Bound (E)) > Ureal_10_36 then
Error_Msg_Name_1 := Name_Last;
Error_Msg_N
("`&''%` too large, maximum allowed is 10.0'*'*36", E);
end if;
end if;
elsif Is_Enumeration_Type (E) then
Freeze_Enumeration_Type (E);
elsif Is_Integer_Type (E) then
Adjust_Esize_For_Alignment (E);
if Is_Modular_Integer_Type (E)
and then Warn_On_Suspicious_Modulus_Value
then
Check_Suspicious_Modulus (E);
end if;
-- The pool applies to named and anonymous access types, but not
-- to subprogram and to internal types generated for 'Access
-- references.
elsif Is_Access_Type (E)
and then not Is_Access_Subprogram_Type (E)
and then Ekind (E) /= E_Access_Attribute_Type
then
-- If a pragma Default_Storage_Pool applies, and this type has no
-- Storage_Pool or Storage_Size clause (which must have occurred
-- before the freezing point), then use the default. This applies
-- only to base types.
-- None of this applies to access to subprograms, for which there
-- are clearly no pools.
if Present (Default_Pool)
and then Is_Base_Type (E)
and then not Has_Storage_Size_Clause (E)
and then No (Associated_Storage_Pool (E))
then
-- Case of pragma Default_Storage_Pool (null)
if Nkind (Default_Pool) = N_Null then
Set_No_Pool_Assigned (E);
-- Case of pragma Default_Storage_Pool (storage_pool_NAME)
else
Set_Associated_Storage_Pool (E, Entity (Default_Pool));
end if;
end if;
-- Check restriction for standard storage pool
if No (Associated_Storage_Pool (E)) then
Check_Restriction (No_Standard_Storage_Pools, E);
end if;
-- Deal with error message for pure access type. This is not an
-- error in Ada 2005 if there is no pool (see AI-366).
if Is_Pure_Unit_Access_Type (E)
and then (Ada_Version < Ada_2005
or else not No_Pool_Assigned (E))
and then not Is_Generic_Unit (Scope (E))
then
Error_Msg_N ("named access type not allowed in pure unit", E);
if Ada_Version >= Ada_2005 then
Error_Msg_N
("\would be legal if Storage_Size of 0 given??", E);
elsif No_Pool_Assigned (E) then
Error_Msg_N
("\would be legal in Ada 2005??", E);
else
Error_Msg_N
("\would be legal in Ada 2005 if "
& "Storage_Size of 0 given??", E);
end if;
end if;
end if;
-- Case of composite types
if Is_Composite_Type (E) then
-- AI-117 requires that all new primitives of a tagged type must
-- inherit the convention of the full view of the type. Inherited
-- and overriding operations are defined to inherit the convention
-- of their parent or overridden subprogram (also specified in
-- AI-117), which will have occurred earlier (in Derive_Subprogram
-- and New_Overloaded_Entity). Here we set the convention of
-- primitives that are still convention Ada, which will ensure
-- that any new primitives inherit the type's convention. Class-
-- wide types can have a foreign convention inherited from their
-- specific type, but are excluded from this since they don't have
-- any associated primitives.
if Is_Tagged_Type (E)
and then not Is_Class_Wide_Type (E)
and then Convention (E) /= Convention_Ada
then
declare
Prim_List : constant Elist_Id := Primitive_Operations (E);
Prim : Elmt_Id;
begin
Prim := First_Elmt (Prim_List);
while Present (Prim) loop
if Convention (Node (Prim)) = Convention_Ada then
Set_Convention (Node (Prim), Convention (E));
end if;
Next_Elmt (Prim);
end loop;
end;
end if;
-- If the type is a simple storage pool type, then this is where
-- we attempt to locate and validate its Allocate, Deallocate, and
-- Storage_Size operations (the first is required, and the latter
-- two are optional). We also verify that the full type for a
-- private type is allowed to be a simple storage pool type.
if Present (Get_Rep_Pragma (E, Name_Simple_Storage_Pool_Type))
and then (Is_Base_Type (E) or else Has_Private_Declaration (E))
then
-- If the type is marked Has_Private_Declaration, then this is
-- a full type for a private type that was specified with the
-- pragma Simple_Storage_Pool_Type, and here we ensure that the
-- pragma is allowed for the full type (for example, it can't
-- be an array type, or a nonlimited record type).
if Has_Private_Declaration (E) then
if (not Is_Record_Type (E) or else not Is_Limited_View (E))
and then not Is_Private_Type (E)
then
Error_Msg_Name_1 := Name_Simple_Storage_Pool_Type;
Error_Msg_N
("pragma% can only apply to full type that is an " &
"explicitly limited type", E);
end if;
end if;
Validate_Simple_Pool_Ops : declare
Pool_Type : Entity_Id renames E;
Address_Type : constant Entity_Id := RTE (RE_Address);
Stg_Cnt_Type : constant Entity_Id := RTE (RE_Storage_Count);
procedure Validate_Simple_Pool_Op_Formal
(Pool_Op : Entity_Id;
Pool_Op_Formal : in out Entity_Id;
Expected_Mode : Formal_Kind;
Expected_Type : Entity_Id;
Formal_Name : String;
OK_Formal : in out Boolean);
-- Validate one formal Pool_Op_Formal of the candidate pool
-- operation Pool_Op. The formal must be of Expected_Type
-- and have mode Expected_Mode. OK_Formal will be set to
-- False if the formal doesn't match. If OK_Formal is False
-- on entry, then the formal will effectively be ignored
-- (because validation of the pool op has already failed).
-- Upon return, Pool_Op_Formal will be updated to the next
-- formal, if any.
procedure Validate_Simple_Pool_Operation
(Op_Name : Name_Id);
-- Search for and validate a simple pool operation with the
-- name Op_Name. If the name is Allocate, then there must be
-- exactly one such primitive operation for the simple pool
-- type. If the name is Deallocate or Storage_Size, then
-- there can be at most one such primitive operation. The
-- profile of the located primitive must conform to what
-- is expected for each operation.
------------------------------------
-- Validate_Simple_Pool_Op_Formal --
------------------------------------
procedure Validate_Simple_Pool_Op_Formal
(Pool_Op : Entity_Id;
Pool_Op_Formal : in out Entity_Id;
Expected_Mode : Formal_Kind;
Expected_Type : Entity_Id;
Formal_Name : String;
OK_Formal : in out Boolean)
is
begin
-- If OK_Formal is False on entry, then simply ignore
-- the formal, because an earlier formal has already
-- been flagged.
if not OK_Formal then
return;
-- If no formal is passed in, then issue an error for a
-- missing formal.
elsif not Present (Pool_Op_Formal) then
Error_Msg_NE
("simple storage pool op missing formal " &
Formal_Name & " of type&", Pool_Op, Expected_Type);
OK_Formal := False;
return;
end if;
if Etype (Pool_Op_Formal) /= Expected_Type then
-- If the pool type was expected for this formal, then
-- this will not be considered a candidate operation
-- for the simple pool, so we unset OK_Formal so that
-- the op and any later formals will be ignored.
if Expected_Type = Pool_Type then
OK_Formal := False;
return;
else
Error_Msg_NE
("wrong type for formal " & Formal_Name &
" of simple storage pool op; expected type&",
Pool_Op_Formal, Expected_Type);
end if;
end if;
-- Issue error if formal's mode is not the expected one
if Ekind (Pool_Op_Formal) /= Expected_Mode then
Error_Msg_N
("wrong mode for formal of simple storage pool op",
Pool_Op_Formal);
end if;
-- Advance to the next formal
Next_Formal (Pool_Op_Formal);
end Validate_Simple_Pool_Op_Formal;
------------------------------------
-- Validate_Simple_Pool_Operation --
------------------------------------
procedure Validate_Simple_Pool_Operation
(Op_Name : Name_Id)
is
Op : Entity_Id;
Found_Op : Entity_Id := Empty;
Formal : Entity_Id;
Is_OK : Boolean;
begin
pragma Assert
(Nam_In (Op_Name, Name_Allocate,
Name_Deallocate,
Name_Storage_Size));
Error_Msg_Name_1 := Op_Name;
-- For each homonym declared immediately in the scope
-- of the simple storage pool type, determine whether
-- the homonym is an operation of the pool type, and,
-- if so, check that its profile is as expected for
-- a simple pool operation of that name.
Op := Get_Name_Entity_Id (Op_Name);
while Present (Op) loop
if Ekind_In (Op, E_Function, E_Procedure)
and then Scope (Op) = Current_Scope
then
Formal := First_Entity (Op);
Is_OK := True;
-- The first parameter must be of the pool type
-- in order for the operation to qualify.
if Op_Name = Name_Storage_Size then
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_In_Parameter, Pool_Type,
"Pool", Is_OK);
else
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_In_Out_Parameter, Pool_Type,
"Pool", Is_OK);
end if;
-- If another operation with this name has already
-- been located for the type, then flag an error,
-- since we only allow the type to have a single
-- such primitive.
if Present (Found_Op) and then Is_OK then
Error_Msg_NE
("only one % operation allowed for " &
"simple storage pool type&", Op, Pool_Type);
end if;
-- In the case of Allocate and Deallocate, a formal
-- of type System.Address is required.
if Op_Name = Name_Allocate then
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_Out_Parameter,
Address_Type, "Storage_Address", Is_OK);
elsif Op_Name = Name_Deallocate then
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_In_Parameter,
Address_Type, "Storage_Address", Is_OK);
end if;
-- In the case of Allocate and Deallocate, formals
-- of type Storage_Count are required as the third
-- and fourth parameters.
if Op_Name /= Name_Storage_Size then
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_In_Parameter,
Stg_Cnt_Type, "Size_In_Storage_Units", Is_OK);
Validate_Simple_Pool_Op_Formal
(Op, Formal, E_In_Parameter,
Stg_Cnt_Type, "Alignment", Is_OK);
end if;
-- If no mismatched formals have been found (Is_OK)
-- and no excess formals are present, then this
-- operation has been validated, so record it.
if not Present (Formal) and then Is_OK then
Found_Op := Op;
end if;
end if;
Op := Homonym (Op);
end loop;
-- There must be a valid Allocate operation for the type,
-- so issue an error if none was found.
if Op_Name = Name_Allocate
and then not Present (Found_Op)
then
Error_Msg_N ("missing % operation for simple " &
"storage pool type", Pool_Type);
elsif Present (Found_Op) then
-- Simple pool operations can't be abstract
if Is_Abstract_Subprogram (Found_Op) then
Error_Msg_N
("simple storage pool operation must not be " &
"abstract", Found_Op);
end if;
-- The Storage_Size operation must be a function with
-- Storage_Count as its result type.
if Op_Name = Name_Storage_Size then
if Ekind (Found_Op) = E_Procedure then
Error_Msg_N
("% operation must be a function", Found_Op);
elsif Etype (Found_Op) /= Stg_Cnt_Type then
Error_Msg_NE
("wrong result type for%, expected type&",
Found_Op, Stg_Cnt_Type);
end if;
-- Allocate and Deallocate must be procedures
elsif Ekind (Found_Op) = E_Function then
Error_Msg_N
("% operation must be a procedure", Found_Op);
end if;
end if;
end Validate_Simple_Pool_Operation;
-- Start of processing for Validate_Simple_Pool_Ops
begin
Validate_Simple_Pool_Operation (Name_Allocate);
Validate_Simple_Pool_Operation (Name_Deallocate);
Validate_Simple_Pool_Operation (Name_Storage_Size);
end Validate_Simple_Pool_Ops;
end if;
end if;
-- Now that all types from which E may depend are frozen, see if the
-- size is known at compile time, if it must be unsigned, or if
-- strict alignment is required
Check_Compile_Time_Size (E);
Check_Unsigned_Type (E);
if Base_Type (E) = E then
Check_Strict_Alignment (E);
end if;
-- Do not allow a size clause for a type which does not have a size
-- that is known at compile time
if Has_Size_Clause (E)
and then not Size_Known_At_Compile_Time (E)
then
-- Suppress this message if errors posted on E, even if we are
-- in all errors mode, since this is often a junk message
if not Error_Posted (E) then
Error_Msg_N
("size clause not allowed for variable length type",
Size_Clause (E));
end if;
end if;
-- Now we set/verify the representation information, in particular
-- the size and alignment values. This processing is not required for
-- generic types, since generic types do not play any part in code
-- generation, and so the size and alignment values for such types
-- are irrelevant. Ditto for types declared within a generic unit,
-- which may have components that depend on generic parameters, and
-- that will be recreated in an instance.
if Inside_A_Generic then
null;
-- Otherwise we call the layout procedure
else
Layout_Type (E);
end if;
-- If this is an access to subprogram whose designated type is itself
-- a subprogram type, the return type of this anonymous subprogram
-- type must be decorated as well.
if Ekind (E) = E_Anonymous_Access_Subprogram_Type
and then Ekind (Designated_Type (E)) = E_Subprogram_Type
then
Layout_Type (Etype (Designated_Type (E)));
end if;
-- If the type has a Defaut_Value/Default_Component_Value aspect,
-- this is where we analye the expression (after the type is frozen,
-- since in the case of Default_Value, we are analyzing with the
-- type itself, and we treat Default_Component_Value similarly for
-- the sake of uniformity).
if Is_First_Subtype (E) and then Has_Default_Aspect (E) then
declare
Nam : Name_Id;
Exp : Node_Id;
Typ : Entity_Id;
begin
if Is_Scalar_Type (E) then
Nam := Name_Default_Value;
Typ := E;
Exp := Default_Aspect_Value (Typ);
else
Nam := Name_Default_Component_Value;
Typ := Component_Type (E);
Exp := Default_Aspect_Component_Value (E);
end if;
Analyze_And_Resolve (Exp, Typ);
if Etype (Exp) /= Any_Type then
if not Is_OK_Static_Expression (Exp) then
Error_Msg_Name_1 := Nam;
Flag_Non_Static_Expr
("aspect% requires static expression", Exp);
end if;
end if;
end;
end if;
-- End of freeze processing for type entities
end if;
-- Here is where we logically freeze the current entity. If it has a
-- freeze node, then this is the point at which the freeze node is
-- linked into the result list.
if Has_Delayed_Freeze (E) then
-- If a freeze node is already allocated, use it, otherwise allocate
-- a new one. The preallocation happens in the case of anonymous base
-- types, where we preallocate so that we can set First_Subtype_Link.
-- Note that we reset the Sloc to the current freeze location.
if Present (Freeze_Node (E)) then
F_Node := Freeze_Node (E);
Set_Sloc (F_Node, Loc);
else
F_Node := New_Node (N_Freeze_Entity, Loc);
Set_Freeze_Node (E, F_Node);
Set_Access_Types_To_Process (F_Node, No_Elist);
Set_TSS_Elist (F_Node, No_Elist);
Set_Actions (F_Node, No_List);
end if;
Set_Entity (F_Node, E);
Add_To_Result (F_Node);
-- A final pass over record types with discriminants. If the type
-- has an incomplete declaration, there may be constrained access
-- subtypes declared elsewhere, which do not depend on the discrimi-
-- nants of the type, and which are used as component types (i.e.
-- the full view is a recursive type). The designated types of these
-- subtypes can only be elaborated after the type itself, and they
-- need an itype reference.
if Ekind (E) = E_Record_Type and then Has_Discriminants (E) then
declare
Comp : Entity_Id;
IR : Node_Id;
Typ : Entity_Id;
begin
Comp := First_Component (E);
while Present (Comp) loop
Typ := Etype (Comp);
if Ekind (Comp) = E_Component
and then Is_Access_Type (Typ)
and then Scope (Typ) /= E
and then Base_Type (Designated_Type (Typ)) = E
and then Is_Itype (Designated_Type (Typ))
then
IR := Make_Itype_Reference (Sloc (Comp));
Set_Itype (IR, Designated_Type (Typ));
Append (IR, Result);
end if;
Next_Component (Comp);
end loop;
end;
end if;
end if;
-- When a type is frozen, the first subtype of the type is frozen as
-- well (RM 13.14(15)). This has to be done after freezing the type,
-- since obviously the first subtype depends on its own base type.
if Is_Type (E) then
Freeze_And_Append (First_Subtype (E), N, Result);
-- If we just froze a tagged non-class wide record, then freeze the
-- corresponding class-wide type. This must be done after the tagged
-- type itself is frozen, because the class-wide type refers to the
-- tagged type which generates the class.
if Is_Tagged_Type (E)
and then not Is_Class_Wide_Type (E)
and then Present (Class_Wide_Type (E))
then
Freeze_And_Append (Class_Wide_Type (E), N, Result);
end if;
end if;
Check_Debug_Info_Needed (E);
-- Special handling for subprograms
if Is_Subprogram (E) then
-- If subprogram has address clause then reset Is_Public flag, since
-- we do not want the backend to generate external references.
if Present (Address_Clause (E))
and then not Is_Library_Level_Entity (E)
then
Set_Is_Public (E, False);
end if;
end if;
<<Leave>>
Restore_Ghost_Mode (Mode);
return Result;
end Freeze_Entity;
-----------------------------
-- Freeze_Enumeration_Type --
-----------------------------
procedure Freeze_Enumeration_Type (Typ : Entity_Id) is
begin
-- By default, if no size clause is present, an enumeration type with
-- Convention C is assumed to interface to a C enum, and has integer
-- size. This applies to types. For subtypes, verify that its base
-- type has no size clause either. Treat other foreign conventions
-- in the same way, and also make sure alignment is set right.
if Has_Foreign_Convention (Typ)
and then not Has_Size_Clause (Typ)
and then not Has_Size_Clause (Base_Type (Typ))
and then Esize (Typ) < Standard_Integer_Size
-- Don't do this if Short_Enums on target
and then not Target_Short_Enums
then
Init_Esize (Typ, Standard_Integer_Size);
Set_Alignment (Typ, Alignment (Standard_Integer));
-- Normal Ada case or size clause present or not Long_C_Enums on target
else
-- If the enumeration type interfaces to C, and it has a size clause
-- that specifies less than int size, it warrants a warning. The
-- user may intend the C type to be an enum or a char, so this is
-- not by itself an error that the Ada compiler can detect, but it
-- it is a worth a heads-up. For Boolean and Character types we
-- assume that the programmer has the proper C type in mind.
if Convention (Typ) = Convention_C
and then Has_Size_Clause (Typ)
and then Esize (Typ) /= Esize (Standard_Integer)
and then not Is_Boolean_Type (Typ)
and then not Is_Character_Type (Typ)
-- Don't do this if Short_Enums on target
and then not Target_Short_Enums
then
Error_Msg_N
("C enum types have the size of a C int??", Size_Clause (Typ));
end if;
Adjust_Esize_For_Alignment (Typ);
end if;
end Freeze_Enumeration_Type;
-----------------------
-- Freeze_Expression --
-----------------------
procedure Freeze_Expression (N : Node_Id) is
In_Spec_Exp : constant Boolean := In_Spec_Expression;
Typ : Entity_Id;
Nam : Entity_Id;
Desig_Typ : Entity_Id;
P : Node_Id;
Parent_P : Node_Id;
Freeze_Outside : Boolean := False;
-- This flag is set true if the entity must be frozen outside the
-- current subprogram. This happens in the case of expander generated
-- subprograms (_Init_Proc, _Input, _Output, _Read, _Write) which do
-- not freeze all entities like other bodies, but which nevertheless
-- may reference entities that have to be frozen before the body and
-- obviously cannot be frozen inside the body.
function Find_Aggregate_Component_Desig_Type return Entity_Id;
-- If the expression is an array aggregate, the type of the component
-- expressions is also frozen. If the component type is an access type
-- and the expressions include allocators, the designed type is frozen
-- as well.
function In_Expanded_Body (N : Node_Id) return Boolean;
-- Given an N_Handled_Sequence_Of_Statements node N, determines whether
-- it is the handled statement sequence of an expander-generated
-- subprogram (init proc, stream subprogram, or renaming as body).
-- If so, this is not a freezing context.
-----------------------------------------
-- Find_Aggregate_Component_Desig_Type --
-----------------------------------------
function Find_Aggregate_Component_Desig_Type return Entity_Id is
Assoc : Node_Id;
Exp : Node_Id;
begin
if Present (Expressions (N)) then
Exp := First (Expressions (N));
while Present (Exp) loop
if Nkind (Exp) = N_Allocator then
return Designated_Type (Component_Type (Etype (N)));
end if;
Next (Exp);
end loop;
end if;
if Present (Component_Associations (N)) then
Assoc := First (Component_Associations (N));
while Present (Assoc) loop
if Nkind (Expression (Assoc)) = N_Allocator then
return Designated_Type (Component_Type (Etype (N)));
end if;
Next (Assoc);
end loop;
end if;
return Empty;
end Find_Aggregate_Component_Desig_Type;
----------------------
-- In_Expanded_Body --
----------------------
function In_Expanded_Body (N : Node_Id) return Boolean is
P : Node_Id;
Id : Entity_Id;
begin
if Nkind (N) = N_Subprogram_Body then
P := N;
else
P := Parent (N);
end if;
if Nkind (P) /= N_Subprogram_Body then
return False;
else
Id := Defining_Unit_Name (Specification (P));
-- The following are expander-created bodies, or bodies that
-- are not freeze points.
if Nkind (Id) = N_Defining_Identifier
and then (Is_Init_Proc (Id)
or else Is_TSS (Id, TSS_Stream_Input)
or else Is_TSS (Id, TSS_Stream_Output)
or else Is_TSS (Id, TSS_Stream_Read)
or else Is_TSS (Id, TSS_Stream_Write)
or else Nkind_In (Original_Node (P),
N_Subprogram_Renaming_Declaration,
N_Expression_Function))
then
return True;
else
return False;
end if;
end if;
end In_Expanded_Body;
-- Start of processing for Freeze_Expression
begin
-- Immediate return if freezing is inhibited. This flag is set by the
-- analyzer to stop freezing on generated expressions that would cause
-- freezing if they were in the source program, but which are not
-- supposed to freeze, since they are created.
if Must_Not_Freeze (N) then
return;
end if;
-- If expression is non-static, then it does not freeze in a default
-- expression, see section "Handling of Default Expressions" in the
-- spec of package Sem for further details. Note that we have to make
-- sure that we actually have a real expression (if we have a subtype
-- indication, we can't test Is_OK_Static_Expression). However, we
-- exclude the case of the prefix of an attribute of a static scalar
-- subtype from this early return, because static subtype attributes
-- should always cause freezing, even in default expressions, but
-- the attribute may not have been marked as static yet (because in
-- Resolve_Attribute, the call to Eval_Attribute follows the call of
-- Freeze_Expression on the prefix).
if In_Spec_Exp
and then Nkind (N) in N_Subexpr
and then not Is_OK_Static_Expression (N)
and then (Nkind (Parent (N)) /= N_Attribute_Reference
or else not (Is_Entity_Name (N)
and then Is_Type (Entity (N))
and then Is_OK_Static_Subtype (Entity (N))))
then
return;
end if;
-- Freeze type of expression if not frozen already
Typ := Empty;
if Nkind (N) in N_Has_Etype then
if not Is_Frozen (Etype (N)) then
Typ := Etype (N);
-- Base type may be an derived numeric type that is frozen at
-- the point of declaration, but first_subtype is still unfrozen.
elsif not Is_Frozen (First_Subtype (Etype (N))) then
Typ := First_Subtype (Etype (N));
end if;
end if;
-- For entity name, freeze entity if not frozen already. A special
-- exception occurs for an identifier that did not come from source.
-- We don't let such identifiers freeze a non-internal entity, i.e.
-- an entity that did come from source, since such an identifier was
-- generated by the expander, and cannot have any semantic effect on
-- the freezing semantics. For example, this stops the parameter of
-- an initialization procedure from freezing the variable.
if Is_Entity_Name (N)
and then not Is_Frozen (Entity (N))
and then (Nkind (N) /= N_Identifier
or else Comes_From_Source (N)
or else not Comes_From_Source (Entity (N)))
then
Nam := Entity (N);
if Present (Nam) and then Ekind (Nam) = E_Function then
Check_Expression_Function (N, Nam);
end if;
else
Nam := Empty;
end if;
-- For an allocator freeze designated type if not frozen already
-- For an aggregate whose component type is an access type, freeze the
-- designated type now, so that its freeze does not appear within the
-- loop that might be created in the expansion of the aggregate. If the
-- designated type is a private type without full view, the expression
-- cannot contain an allocator, so the type is not frozen.
-- For a function, we freeze the entity when the subprogram declaration
-- is frozen, but a function call may appear in an initialization proc.
-- before the declaration is frozen. We need to generate the extra
-- formals, if any, to ensure that the expansion of the call includes
-- the proper actuals. This only applies to Ada subprograms, not to
-- imported ones.
Desig_Typ := Empty;
case Nkind (N) is
when N_Allocator =>
Desig_Typ := Designated_Type (Etype (N));
when N_Aggregate =>
if Is_Array_Type (Etype (N))
and then Is_Access_Type (Component_Type (Etype (N)))
then
-- Check whether aggregate includes allocators.
Desig_Typ := Find_Aggregate_Component_Desig_Type;
end if;
when N_Indexed_Component
| N_Selected_Component
| N_Slice
=>
if Is_Access_Type (Etype (Prefix (N))) then
Desig_Typ := Designated_Type (Etype (Prefix (N)));
end if;
when N_Identifier =>
if Present (Nam)
and then Ekind (Nam) = E_Function
and then Nkind (Parent (N)) = N_Function_Call
and then Convention (Nam) = Convention_Ada
then
Create_Extra_Formals (Nam);
end if;
when others =>
null;
end case;
if Desig_Typ /= Empty
and then (Is_Frozen (Desig_Typ)
or else (not Is_Fully_Defined (Desig_Typ)))
then
Desig_Typ := Empty;
end if;
-- All done if nothing needs freezing
if No (Typ)
and then No (Nam)
and then No (Desig_Typ)
then
return;
end if;
-- Examine the enclosing context by climbing the parent chain. The
-- traversal serves two purposes - to detect scenarios where freezeing
-- is not needed and to find the proper insertion point for the freeze
-- nodes. Although somewhat similar to Insert_Actions, this traversal
-- is freezing semantics-sensitive. Inserting freeze nodes blindly in
-- the tree may result in types being frozen too early.
P := N;
loop
Parent_P := Parent (P);
-- If we don't have a parent, then we are not in a well-formed tree.
-- This is an unusual case, but there are some legitimate situations
-- in which this occurs, notably when the expressions in the range of
-- a type declaration are resolved. We simply ignore the freeze
-- request in this case. Is this right ???
if No (Parent_P) then
return;
end if;
-- See if we have got to an appropriate point in the tree
case Nkind (Parent_P) is
-- A special test for the exception of (RM 13.14(8)) for the case
-- of per-object expressions (RM 3.8(18)) occurring in component
-- definition or a discrete subtype definition. Note that we test
-- for a component declaration which includes both cases we are
-- interested in, and furthermore the tree does not have explicit
-- nodes for either of these two constructs.
when N_Component_Declaration =>
-- The case we want to test for here is an identifier that is
-- a per-object expression, this is either a discriminant that
-- appears in a context other than the component declaration
-- or it is a reference to the type of the enclosing construct.
-- For either of these cases, we skip the freezing
if not In_Spec_Expression
and then Nkind (N) = N_Identifier
and then (Present (Entity (N)))
then
-- We recognize the discriminant case by just looking for
-- a reference to a discriminant. It can only be one for
-- the enclosing construct. Skip freezing in this case.
if Ekind (Entity (N)) = E_Discriminant then
return;
-- For the case of a reference to the enclosing record,
-- (or task or protected type), we look for a type that
-- matches the current scope.
elsif Entity (N) = Current_Scope then
return;
end if;
end if;
-- If we have an enumeration literal that appears as the choice in
-- the aggregate of an enumeration representation clause, then
-- freezing does not occur (RM 13.14(10)).
when N_Enumeration_Representation_Clause =>
-- The case we are looking for is an enumeration literal
if (Nkind (N) = N_Identifier or Nkind (N) = N_Character_Literal)
and then Is_Enumeration_Type (Etype (N))
then
-- If enumeration literal appears directly as the choice,
-- do not freeze (this is the normal non-overloaded case)
if Nkind (Parent (N)) = N_Component_Association
and then First (Choices (Parent (N))) = N
then
return;
-- If enumeration literal appears as the name of function
-- which is the choice, then also do not freeze. This
-- happens in the overloaded literal case, where the
-- enumeration literal is temporarily changed to a function
-- call for overloading analysis purposes.
elsif Nkind (Parent (N)) = N_Function_Call
and then
Nkind (Parent (Parent (N))) = N_Component_Association
and then
First (Choices (Parent (Parent (N)))) = Parent (N)
then
return;
end if;
end if;
-- Normally if the parent is a handled sequence of statements,
-- then the current node must be a statement, and that is an
-- appropriate place to insert a freeze node.
when N_Handled_Sequence_Of_Statements =>
-- An exception occurs when the sequence of statements is for
-- an expander generated body that did not do the usual freeze
-- all operation. In this case we usually want to freeze
-- outside this body, not inside it, and we skip past the
-- subprogram body that we are inside.
if In_Expanded_Body (Parent_P) then
declare
Subp : constant Node_Id := Parent (Parent_P);
Spec : Entity_Id;
begin
-- Freeze the entity only when it is declared inside the
-- body of the expander generated procedure. This case
-- is recognized by the scope of the entity or its type,
-- which is either the spec for some enclosing body, or
-- (in the case of init_procs, for which there are no
-- separate specs) the current scope.
if Nkind (Subp) = N_Subprogram_Body then
Spec := Corresponding_Spec (Subp);
if (Present (Typ) and then Scope (Typ) = Spec)
or else
(Present (Nam) and then Scope (Nam) = Spec)
then
exit;
elsif Present (Typ)
and then Scope (Typ) = Current_Scope
and then Defining_Entity (Subp) = Current_Scope
then
exit;
end if;
end if;
-- An expression function may act as a completion of
-- a function declaration. As such, it can reference
-- entities declared between the two views:
-- Hidden []; -- 1
-- function F return ...;
-- private
-- function Hidden return ...;
-- function F return ... is (Hidden); -- 2
-- Refering to the example above, freezing the expression
-- of F (2) would place Hidden's freeze node (1) in the
-- wrong place. Avoid explicit freezing and let the usual
-- scenarios do the job - for example, reaching the end
-- of the private declarations, or a call to F.
if Nkind (Original_Node (Subp)) =
N_Expression_Function
then
null;
-- Freeze outside the body
else
Parent_P := Parent (Parent_P);
Freeze_Outside := True;
end if;
end;
-- Here if normal case where we are in handled statement
-- sequence and want to do the insertion right there.
else
exit;
end if;
-- If parent is a body or a spec or a block, then the current node
-- is a statement or declaration and we can insert the freeze node
-- before it.
when N_Block_Statement
| N_Entry_Body
| N_Package_Body
| N_Package_Specification
| N_Protected_Body
| N_Subprogram_Body
| N_Task_Body
=>
exit;
-- The expander is allowed to define types in any statements list,
-- so any of the following parent nodes also mark a freezing point
-- if the actual node is in a list of statements or declarations.
when N_Abortable_Part
| N_Accept_Alternative
| N_And_Then
| N_Case_Statement_Alternative
| N_Compilation_Unit_Aux
| N_Conditional_Entry_Call
| N_Delay_Alternative
| N_Elsif_Part
| N_Entry_Call_Alternative
| N_Exception_Handler
| N_Extended_Return_Statement
| N_Freeze_Entity
| N_If_Statement
| N_Or_Else
| N_Selective_Accept
| N_Triggering_Alternative
=>
exit when Is_List_Member (P);
-- Freeze nodes produced by an expression coming from the Actions
-- list of a N_Expression_With_Actions node must remain within the
-- Actions list. Inserting the freeze nodes further up the tree
-- may lead to use before declaration issues in the case of array
-- types.
when N_Expression_With_Actions =>
if Is_List_Member (P)
and then List_Containing (P) = Actions (Parent_P)
then
exit;
end if;
-- Note: N_Loop_Statement is a special case. A type that appears
-- in the source can never be frozen in a loop (this occurs only
-- because of a loop expanded by the expander), so we keep on
-- going. Otherwise we terminate the search. Same is true of any
-- entity which comes from source. (if they have predefined type,
-- that type does not appear to come from source, but the entity
-- should not be frozen here).
when N_Loop_Statement =>
exit when not Comes_From_Source (Etype (N))
and then (No (Nam) or else not Comes_From_Source (Nam));
-- For all other cases, keep looking at parents
when others =>
null;
end case;
-- We fall through the case if we did not yet find the proper
-- place in the free for inserting the freeze node, so climb.
P := Parent_P;
end loop;
-- If the expression appears in a record or an initialization procedure,
-- the freeze nodes are collected and attached to the current scope, to
-- be inserted and analyzed on exit from the scope, to insure that
-- generated entities appear in the correct scope. If the expression is
-- a default for a discriminant specification, the scope is still void.
-- The expression can also appear in the discriminant part of a private
-- or concurrent type.
-- If the expression appears in a constrained subcomponent of an
-- enclosing record declaration, the freeze nodes must be attached to
-- the outer record type so they can eventually be placed in the
-- enclosing declaration list.
-- The other case requiring this special handling is if we are in a
-- default expression, since in that case we are about to freeze a
-- static type, and the freeze scope needs to be the outer scope, not
-- the scope of the subprogram with the default parameter.
-- For default expressions and other spec expressions in generic units,
-- the Move_Freeze_Nodes mechanism (see sem_ch12.adb) takes care of
-- placing them at the proper place, after the generic unit.
if (In_Spec_Exp and not Inside_A_Generic)
or else Freeze_Outside
or else (Is_Type (Current_Scope)
and then (not Is_Concurrent_Type (Current_Scope)
or else not Has_Completion (Current_Scope)))
or else Ekind (Current_Scope) = E_Void
then
declare
N : constant Node_Id := Current_Scope;
Freeze_Nodes : List_Id := No_List;
Pos : Int := Scope_Stack.Last;
begin
if Present (Desig_Typ) then
Freeze_And_Append (Desig_Typ, N, Freeze_Nodes);
end if;
if Present (Typ) then
Freeze_And_Append (Typ, N, Freeze_Nodes);
end if;
if Present (Nam) then
Freeze_And_Append (Nam, N, Freeze_Nodes);
end if;
-- The current scope may be that of a constrained component of
-- an enclosing record declaration, or of a loop of an enclosing
-- quantified expression, which is above the current scope in the
-- scope stack. Indeed in the context of a quantified expression,
-- a scope is created and pushed above the current scope in order
-- to emulate the loop-like behavior of the quantified expression.
-- If the expression is within a top-level pragma, as for a pre-
-- condition on a library-level subprogram, nothing to do.
if not Is_Compilation_Unit (Current_Scope)
and then (Is_Record_Type (Scope (Current_Scope))
or else Nkind (Parent (Current_Scope)) =
N_Quantified_Expression)
then
Pos := Pos - 1;
end if;
if Is_Non_Empty_List (Freeze_Nodes) then
if No (Scope_Stack.Table (Pos).Pending_Freeze_Actions) then
Scope_Stack.Table (Pos).Pending_Freeze_Actions :=
Freeze_Nodes;
else
Append_List (Freeze_Nodes,
Scope_Stack.Table (Pos).Pending_Freeze_Actions);
end if;
end if;
end;
return;
end if;
-- Now we have the right place to do the freezing. First, a special
-- adjustment, if we are in spec-expression analysis mode, these freeze
-- actions must not be thrown away (normally all inserted actions are
-- thrown away in this mode. However, the freeze actions are from static
-- expressions and one of the important reasons we are doing this
-- special analysis is to get these freeze actions. Therefore we turn
-- off the In_Spec_Expression mode to propagate these freeze actions.
-- This also means they get properly analyzed and expanded.
In_Spec_Expression := False;
-- Freeze the designated type of an allocator (RM 13.14(13))
if Present (Desig_Typ) then
Freeze_Before (P, Desig_Typ);
end if;
-- Freeze type of expression (RM 13.14(10)). Note that we took care of
-- the enumeration representation clause exception in the loop above.
if Present (Typ) then
Freeze_Before (P, Typ);
end if;
-- Freeze name if one is present (RM 13.14(11))
if Present (Nam) then
Freeze_Before (P, Nam);
end if;
-- Restore In_Spec_Expression flag
In_Spec_Expression := In_Spec_Exp;
end Freeze_Expression;
-----------------------------
-- Freeze_Fixed_Point_Type --
-----------------------------
-- Certain fixed-point types and subtypes, including implicit base types
-- and declared first subtypes, have not yet set up a range. This is
-- because the range cannot be set until the Small and Size values are
-- known, and these are not known till the type is frozen.
-- To signal this case, Scalar_Range contains an unanalyzed syntactic range
-- whose bounds are unanalyzed real literals. This routine will recognize
-- this case, and transform this range node into a properly typed range
-- with properly analyzed and resolved values.
procedure Freeze_Fixed_Point_Type (Typ : Entity_Id) is
Rng : constant Node_Id := Scalar_Range (Typ);
Lo : constant Node_Id := Low_Bound (Rng);
Hi : constant Node_Id := High_Bound (Rng);
Btyp : constant Entity_Id := Base_Type (Typ);
Brng : constant Node_Id := Scalar_Range (Btyp);
BLo : constant Node_Id := Low_Bound (Brng);
BHi : constant Node_Id := High_Bound (Brng);
Small : constant Ureal := Small_Value (Typ);
Loval : Ureal;
Hival : Ureal;
Atype : Entity_Id;
Orig_Lo : Ureal;
Orig_Hi : Ureal;
-- Save original bounds (for shaving tests)
Actual_Size : Nat;
-- Actual size chosen
function Fsize (Lov, Hiv : Ureal) return Nat;
-- Returns size of type with given bounds. Also leaves these
-- bounds set as the current bounds of the Typ.
-----------
-- Fsize --
-----------
function Fsize (Lov, Hiv : Ureal) return Nat is
begin
Set_Realval (Lo, Lov);
Set_Realval (Hi, Hiv);
return Minimum_Size (Typ);
end Fsize;
-- Start of processing for Freeze_Fixed_Point_Type
begin
-- If Esize of a subtype has not previously been set, set it now
if Unknown_Esize (Typ) then
Atype := Ancestor_Subtype (Typ);
if Present (Atype) then
Set_Esize (Typ, Esize (Atype));
else
Set_Esize (Typ, Esize (Base_Type (Typ)));
end if;
end if;
-- Immediate return if the range is already analyzed. This means that
-- the range is already set, and does not need to be computed by this
-- routine.
if Analyzed (Rng) then
return;
end if;
-- Immediate return if either of the bounds raises Constraint_Error
if Raises_Constraint_Error (Lo)
or else Raises_Constraint_Error (Hi)
then
return;
end if;
Loval := Realval (Lo);
Hival := Realval (Hi);
Orig_Lo := Loval;
Orig_Hi := Hival;
-- Ordinary fixed-point case
if Is_Ordinary_Fixed_Point_Type (Typ) then
-- For the ordinary fixed-point case, we are allowed to fudge the
-- end-points up or down by small. Generally we prefer to fudge up,
-- i.e. widen the bounds for non-model numbers so that the end points
-- are included. However there are cases in which this cannot be
-- done, and indeed cases in which we may need to narrow the bounds.
-- The following circuit makes the decision.
-- Note: our terminology here is that Incl_EP means that the bounds
-- are widened by Small if necessary to include the end points, and
-- Excl_EP means that the bounds are narrowed by Small to exclude the
-- end-points if this reduces the size.
-- Note that in the Incl case, all we care about is including the
-- end-points. In the Excl case, we want to narrow the bounds as
-- much as permitted by the RM, to give the smallest possible size.
Fudge : declare
Loval_Incl_EP : Ureal;
Hival_Incl_EP : Ureal;
Loval_Excl_EP : Ureal;
Hival_Excl_EP : Ureal;
Size_Incl_EP : Nat;
Size_Excl_EP : Nat;
Model_Num : Ureal;
First_Subt : Entity_Id;
Actual_Lo : Ureal;
Actual_Hi : Ureal;
begin
-- First step. Base types are required to be symmetrical. Right
-- now, the base type range is a copy of the first subtype range.
-- This will be corrected before we are done, but right away we
-- need to deal with the case where both bounds are non-negative.
-- In this case, we set the low bound to the negative of the high
-- bound, to make sure that the size is computed to include the
-- required sign. Note that we do not need to worry about the
-- case of both bounds negative, because the sign will be dealt
-- with anyway. Furthermore we can't just go making such a bound
-- symmetrical, since in a twos-complement system, there is an
-- extra negative value which could not be accommodated on the
-- positive side.
if Typ = Btyp
and then not UR_Is_Negative (Loval)
and then Hival > Loval
then
Loval := -Hival;
Set_Realval (Lo, Loval);
end if;
-- Compute the fudged bounds. If the number is a model number,
-- then we do nothing to include it, but we are allowed to backoff
-- to the next adjacent model number when we exclude it. If it is
-- not a model number then we straddle the two values with the
-- model numbers on either side.
Model_Num := UR_Trunc (Loval / Small) * Small;
if Loval = Model_Num then
Loval_Incl_EP := Model_Num;
else
Loval_Incl_EP := Model_Num - Small;
end if;
-- The low value excluding the end point is Small greater, but
-- we do not do this exclusion if the low value is positive,
-- since it can't help the size and could actually hurt by
-- crossing the high bound.
if UR_Is_Negative (Loval_Incl_EP) then
Loval_Excl_EP := Loval_Incl_EP + Small;
-- If the value went from negative to zero, then we have the
-- case where Loval_Incl_EP is the model number just below
-- zero, so we want to stick to the negative value for the
-- base type to maintain the condition that the size will
-- include signed values.
if Typ = Btyp
and then UR_Is_Zero (Loval_Excl_EP)
then
Loval_Excl_EP := Loval_Incl_EP;
end if;
else
Loval_Excl_EP := Loval_Incl_EP;
end if;
-- Similar processing for upper bound and high value
Model_Num := UR_Trunc (Hival / Small) * Small;
if Hival = Model_Num then
Hival_Incl_EP := Model_Num;
else
Hival_Incl_EP := Model_Num + Small;
end if;
if UR_Is_Positive (Hival_Incl_EP) then
Hival_Excl_EP := Hival_Incl_EP - Small;
else
Hival_Excl_EP := Hival_Incl_EP;
end if;
-- One further adjustment is needed. In the case of subtypes, we
-- cannot go outside the range of the base type, or we get
-- peculiarities, and the base type range is already set. This
-- only applies to the Incl values, since clearly the Excl values
-- are already as restricted as they are allowed to be.
if Typ /= Btyp then
Loval_Incl_EP := UR_Max (Loval_Incl_EP, Realval (BLo));
Hival_Incl_EP := UR_Min (Hival_Incl_EP, Realval (BHi));
end if;
-- Get size including and excluding end points
Size_Incl_EP := Fsize (Loval_Incl_EP, Hival_Incl_EP);
Size_Excl_EP := Fsize (Loval_Excl_EP, Hival_Excl_EP);
-- No need to exclude end-points if it does not reduce size
if Fsize (Loval_Incl_EP, Hival_Excl_EP) = Size_Excl_EP then
Loval_Excl_EP := Loval_Incl_EP;
end if;
if Fsize (Loval_Excl_EP, Hival_Incl_EP) = Size_Excl_EP then
Hival_Excl_EP := Hival_Incl_EP;
end if;
-- Now we set the actual size to be used. We want to use the
-- bounds fudged up to include the end-points but only if this
-- can be done without violating a specifically given size
-- size clause or causing an unacceptable increase in size.
-- Case of size clause given
if Has_Size_Clause (Typ) then
-- Use the inclusive size only if it is consistent with
-- the explicitly specified size.
if Size_Incl_EP <= RM_Size (Typ) then
Actual_Lo := Loval_Incl_EP;
Actual_Hi := Hival_Incl_EP;
Actual_Size := Size_Incl_EP;
-- If the inclusive size is too large, we try excluding
-- the end-points (will be caught later if does not work).
else
Actual_Lo := Loval_Excl_EP;
Actual_Hi := Hival_Excl_EP;
Actual_Size := Size_Excl_EP;
end if;
-- Case of size clause not given
else
-- If we have a base type whose corresponding first subtype
-- has an explicit size that is large enough to include our
-- end-points, then do so. There is no point in working hard
-- to get a base type whose size is smaller than the specified
-- size of the first subtype.
First_Subt := First_Subtype (Typ);
if Has_Size_Clause (First_Subt)
and then Size_Incl_EP <= Esize (First_Subt)
then
Actual_Size := Size_Incl_EP;
Actual_Lo := Loval_Incl_EP;
Actual_Hi := Hival_Incl_EP;
-- If excluding the end-points makes the size smaller and
-- results in a size of 8,16,32,64, then we take the smaller
-- size. For the 64 case, this is compulsory. For the other
-- cases, it seems reasonable. We like to include end points
-- if we can, but not at the expense of moving to the next
-- natural boundary of size.
elsif Size_Incl_EP /= Size_Excl_EP
and then Addressable (Size_Excl_EP)
then
Actual_Size := Size_Excl_EP;
Actual_Lo := Loval_Excl_EP;
Actual_Hi := Hival_Excl_EP;
-- Otherwise we can definitely include the end points
else
Actual_Size := Size_Incl_EP;
Actual_Lo := Loval_Incl_EP;
Actual_Hi := Hival_Incl_EP;
end if;
-- One pathological case: normally we never fudge a low bound
-- down, since it would seem to increase the size (if it has
-- any effect), but for ranges containing single value, or no
-- values, the high bound can be small too large. Consider:
-- type t is delta 2.0**(-14)
-- range 131072.0 .. 0;
-- That lower bound is *just* outside the range of 32 bits, and
-- does need fudging down in this case. Note that the bounds
-- will always have crossed here, since the high bound will be
-- fudged down if necessary, as in the case of:
-- type t is delta 2.0**(-14)
-- range 131072.0 .. 131072.0;
-- So we detect the situation by looking for crossed bounds,
-- and if the bounds are crossed, and the low bound is greater
-- than zero, we will always back it off by small, since this
-- is completely harmless.
if Actual_Lo > Actual_Hi then
if UR_Is_Positive (Actual_Lo) then
Actual_Lo := Loval_Incl_EP - Small;
Actual_Size := Fsize (Actual_Lo, Actual_Hi);
-- And of course, we need to do exactly the same parallel
-- fudge for flat ranges in the negative region.
elsif UR_Is_Negative (Actual_Hi) then
Actual_Hi := Hival_Incl_EP + Small;
Actual_Size := Fsize (Actual_Lo, Actual_Hi);
end if;
end if;
end if;
Set_Realval (Lo, Actual_Lo);
Set_Realval (Hi, Actual_Hi);
end Fudge;
-- For the decimal case, none of this fudging is required, since there
-- are no end-point problems in the decimal case (the end-points are
-- always included).
else
Actual_Size := Fsize (Loval, Hival);
end if;
-- At this stage, the actual size has been calculated and the proper
-- required bounds are stored in the low and high bounds.
if Actual_Size > 64 then
Error_Msg_Uint_1 := UI_From_Int (Actual_Size);
Error_Msg_N
("size required (^) for type& too large, maximum allowed is 64",
Typ);
Actual_Size := 64;
end if;
-- Check size against explicit given size
if Has_Size_Clause (Typ) then
if Actual_Size > RM_Size (Typ) then
Error_Msg_Uint_1 := RM_Size (Typ);
Error_Msg_Uint_2 := UI_From_Int (Actual_Size);
Error_Msg_NE
("size given (^) for type& too small, minimum allowed is ^",
Size_Clause (Typ), Typ);
else
Actual_Size := UI_To_Int (Esize (Typ));
end if;
-- Increase size to next natural boundary if no size clause given
else
if Actual_Size <= 8 then
Actual_Size := 8;
elsif Actual_Size <= 16 then
Actual_Size := 16;
elsif Actual_Size <= 32 then
Actual_Size := 32;
else
Actual_Size := 64;
end if;
Init_Esize (Typ, Actual_Size);
Adjust_Esize_For_Alignment (Typ);
end if;
-- If we have a base type, then expand the bounds so that they extend to
-- the full width of the allocated size in bits, to avoid junk range
-- checks on intermediate computations.
if Base_Type (Typ) = Typ then
Set_Realval (Lo, -(Small * (Uint_2 ** (Actual_Size - 1))));
Set_Realval (Hi, (Small * (Uint_2 ** (Actual_Size - 1) - 1)));
end if;
-- Final step is to reanalyze the bounds using the proper type
-- and set the Corresponding_Integer_Value fields of the literals.
Set_Etype (Lo, Empty);
Set_Analyzed (Lo, False);
Analyze (Lo);
-- Resolve with universal fixed if the base type, and the base type if
-- it is a subtype. Note we can't resolve the base type with itself,
-- that would be a reference before definition.
if Typ = Btyp then
Resolve (Lo, Universal_Fixed);
else
Resolve (Lo, Btyp);
end if;
-- Set corresponding integer value for bound
Set_Corresponding_Integer_Value
(Lo, UR_To_Uint (Realval (Lo) / Small));
-- Similar processing for high bound
Set_Etype (Hi, Empty);
Set_Analyzed (Hi, False);
Analyze (Hi);
if Typ = Btyp then
Resolve (Hi, Universal_Fixed);
else
Resolve (Hi, Btyp);
end if;
Set_Corresponding_Integer_Value
(Hi, UR_To_Uint (Realval (Hi) / Small));
-- Set type of range to correspond to bounds
Set_Etype (Rng, Etype (Lo));
-- Set Esize to calculated size if not set already
if Unknown_Esize (Typ) then
Init_Esize (Typ, Actual_Size);
end if;
-- Set RM_Size if not already set. If already set, check value
declare
Minsiz : constant Uint := UI_From_Int (Minimum_Size (Typ));
begin
if RM_Size (Typ) /= Uint_0 then
if RM_Size (Typ) < Minsiz then
Error_Msg_Uint_1 := RM_Size (Typ);
Error_Msg_Uint_2 := Minsiz;
Error_Msg_NE
("size given (^) for type& too small, minimum allowed is ^",
Size_Clause (Typ), Typ);
end if;
else
Set_RM_Size (Typ, Minsiz);
end if;
end;
-- Check for shaving
if Comes_From_Source (Typ) then
-- In SPARK mode the given bounds must be strictly representable
if SPARK_Mode = On then
if Orig_Lo < Expr_Value_R (Lo) then
Error_Msg_NE
("declared low bound of type & is outside type range",
Lo, Typ);
end if;
if Orig_Hi > Expr_Value_R (Hi) then
Error_Msg_NE
("declared high bound of type & is outside type range",
Hi, Typ);
end if;
else
if Orig_Lo < Expr_Value_R (Lo) then
Error_Msg_N
("declared low bound of type & is outside type range??", Typ);
Error_Msg_N
("\low bound adjusted up by delta (RM 3.5.9(13))??", Typ);
end if;
if Orig_Hi > Expr_Value_R (Hi) then
Error_Msg_N
("declared high bound of type & is outside type range??",
Typ);
Error_Msg_N
("\high bound adjusted down by delta (RM 3.5.9(13))??", Typ);
end if;
end if;
end if;
end Freeze_Fixed_Point_Type;
------------------
-- Freeze_Itype --
------------------
procedure Freeze_Itype (T : Entity_Id; N : Node_Id) is
L : List_Id;
begin
Set_Has_Delayed_Freeze (T);
L := Freeze_Entity (T, N);
if Is_Non_Empty_List (L) then
Insert_Actions (N, L);
end if;
end Freeze_Itype;
--------------------------
-- Freeze_Static_Object --
--------------------------
procedure Freeze_Static_Object (E : Entity_Id) is
Cannot_Be_Static : exception;
-- Exception raised if the type of a static object cannot be made
-- static. This happens if the type depends on non-global objects.
procedure Ensure_Expression_Is_SA (N : Node_Id);
-- Called to ensure that an expression used as part of a type definition
-- is statically allocatable, which means that the expression type is
-- statically allocatable, and the expression is either static, or a
-- reference to a library level constant.
procedure Ensure_Type_Is_SA (Typ : Entity_Id);
-- Called to mark a type as static, checking that it is possible
-- to set the type as static. If it is not possible, then the
-- exception Cannot_Be_Static is raised.
-----------------------------
-- Ensure_Expression_Is_SA --
-----------------------------
procedure Ensure_Expression_Is_SA (N : Node_Id) is
Ent : Entity_Id;
begin
Ensure_Type_Is_SA (Etype (N));
if Is_OK_Static_Expression (N) then
return;
elsif Nkind (N) = N_Identifier then
Ent := Entity (N);
if Present (Ent)
and then Ekind (Ent) = E_Constant
and then Is_Library_Level_Entity (Ent)
then
return;
end if;
end if;
raise Cannot_Be_Static;
end Ensure_Expression_Is_SA;
-----------------------
-- Ensure_Type_Is_SA --
-----------------------
procedure Ensure_Type_Is_SA (Typ : Entity_Id) is
N : Node_Id;
C : Entity_Id;
begin
-- If type is library level, we are all set
if Is_Library_Level_Entity (Typ) then
return;
end if;
-- We are also OK if the type already marked as statically allocated,
-- which means we processed it before.
if Is_Statically_Allocated (Typ) then
return;
end if;
-- Mark type as statically allocated
Set_Is_Statically_Allocated (Typ);
-- Check that it is safe to statically allocate this type
if Is_Scalar_Type (Typ) or else Is_Real_Type (Typ) then
Ensure_Expression_Is_SA (Type_Low_Bound (Typ));
Ensure_Expression_Is_SA (Type_High_Bound (Typ));
elsif Is_Array_Type (Typ) then
N := First_Index (Typ);
while Present (N) loop
Ensure_Type_Is_SA (Etype (N));
Next_Index (N);
end loop;
Ensure_Type_Is_SA (Component_Type (Typ));
elsif Is_Access_Type (Typ) then
if Ekind (Designated_Type (Typ)) = E_Subprogram_Type then
declare
F : Entity_Id;
T : constant Entity_Id := Etype (Designated_Type (Typ));
begin
if T /= Standard_Void_Type then
Ensure_Type_Is_SA (T);
end if;
F := First_Formal (Designated_Type (Typ));
while Present (F) loop
Ensure_Type_Is_SA (Etype (F));
Next_Formal (F);
end loop;
end;
else
Ensure_Type_Is_SA (Designated_Type (Typ));
end if;
elsif Is_Record_Type (Typ) then
C := First_Entity (Typ);
while Present (C) loop
if Ekind (C) = E_Discriminant
or else Ekind (C) = E_Component
then
Ensure_Type_Is_SA (Etype (C));
elsif Is_Type (C) then
Ensure_Type_Is_SA (C);
end if;
Next_Entity (C);
end loop;
elsif Ekind (Typ) = E_Subprogram_Type then
Ensure_Type_Is_SA (Etype (Typ));
C := First_Formal (Typ);
while Present (C) loop
Ensure_Type_Is_SA (Etype (C));
Next_Formal (C);
end loop;
else
raise Cannot_Be_Static;
end if;
end Ensure_Type_Is_SA;
-- Start of processing for Freeze_Static_Object
begin
Ensure_Type_Is_SA (Etype (E));
exception
when Cannot_Be_Static =>
-- If the object that cannot be static is imported or exported, then
-- issue an error message saying that this object cannot be imported
-- or exported. If it has an address clause it is an overlay in the
-- current partition and the static requirement is not relevant.
-- Do not issue any error message when ignoring rep clauses.
if Ignore_Rep_Clauses then
null;
elsif Is_Imported (E) then
if No (Address_Clause (E)) then
Error_Msg_N
("& cannot be imported (local type is not constant)", E);
end if;
-- Otherwise must be exported, something is wrong if compiler
-- is marking something as statically allocated which cannot be).
else pragma Assert (Is_Exported (E));
Error_Msg_N
("& cannot be exported (local type is not constant)", E);
end if;
end Freeze_Static_Object;
-----------------------
-- Freeze_Subprogram --
-----------------------
procedure Freeze_Subprogram (E : Entity_Id) is
procedure Set_Profile_Convention (Subp_Id : Entity_Id);
-- Set the conventions of all anonymous access-to-subprogram formals and
-- result subtype of subprogram Subp_Id to the convention of Subp_Id.
----------------------------
-- Set_Profile_Convention --
----------------------------
procedure Set_Profile_Convention (Subp_Id : Entity_Id) is
Conv : constant Convention_Id := Convention (Subp_Id);
procedure Set_Type_Convention (Typ : Entity_Id);
-- Set the convention of anonymous access-to-subprogram type Typ and
-- its designated type to Conv.
-------------------------
-- Set_Type_Convention --
-------------------------
procedure Set_Type_Convention (Typ : Entity_Id) is
begin
-- Set the convention on both the anonymous access-to-subprogram
-- type and the subprogram type it points to because both types
-- participate in conformance-related checks.
if Ekind (Typ) = E_Anonymous_Access_Subprogram_Type then
Set_Convention (Typ, Conv);
Set_Convention (Designated_Type (Typ), Conv);
end if;
end Set_Type_Convention;
-- Local variables
Formal : Entity_Id;
-- Start of processing for Set_Profile_Convention
begin
Formal := First_Formal (Subp_Id);
while Present (Formal) loop
Set_Type_Convention (Etype (Formal));
Next_Formal (Formal);
end loop;
if Ekind (Subp_Id) = E_Function then
Set_Type_Convention (Etype (Subp_Id));
end if;
end Set_Profile_Convention;
-- Local variables
F : Entity_Id;
Retype : Entity_Id;
-- Start of processing for Freeze_Subprogram
begin
-- Subprogram may not have an address clause unless it is imported
if Present (Address_Clause (E)) then
if not Is_Imported (E) then
Error_Msg_N
("address clause can only be given for imported subprogram",
Name (Address_Clause (E)));
end if;
end if;
-- Reset the Pure indication on an imported subprogram unless an
-- explicit Pure_Function pragma was present or the subprogram is an
-- intrinsic. We do this because otherwise it is an insidious error
-- to call a non-pure function from pure unit and have calls
-- mysteriously optimized away. What happens here is that the Import
-- can bypass the normal check to ensure that pure units call only pure
-- subprograms.
-- The reason for the intrinsic exception is that in general, intrinsic
-- functions (such as shifts) are pure anyway. The only exceptions are
-- the intrinsics in GNAT.Source_Info, and that unit is not marked Pure
-- in any case, so no problem arises.
if Is_Imported (E)
and then Is_Pure (E)
and then not Has_Pragma_Pure_Function (E)
and then not Is_Intrinsic_Subprogram (E)
then
Set_Is_Pure (E, False);
end if;
-- We also reset the Pure indication on a subprogram with an Address
-- parameter, because the parameter may be used as a pointer and the
-- referenced data may change even if the address value does not.
-- Note that if the programmer gave an explicit Pure_Function pragma,
-- then we believe the programmer, and leave the subprogram Pure. We
-- also suppress this check on run-time files.
if Is_Pure (E)
and then Is_Subprogram (E)
and then not Has_Pragma_Pure_Function (E)
and then not Is_Internal_File_Name (Unit_File_Name (Current_Sem_Unit))
then
Check_Function_With_Address_Parameter (E);
end if;
-- Ensure that all anonymous access-to-subprogram types inherit the
-- convention of their related subprogram (RM 6.3.1 13.1/3). This is
-- not done for a defaulted convention Ada because those types also
-- default to Ada. Convention Protected must not be propagated when
-- the subprogram is an entry because this would be illegal. The only
-- way to force convention Protected on these kinds of types is to
-- include keyword "protected" in the access definition.
if Convention (E) /= Convention_Ada
and then Convention (E) /= Convention_Protected
then
Set_Profile_Convention (E);
end if;
-- For non-foreign convention subprograms, this is where we create
-- the extra formals (for accessibility level and constrained bit
-- information). We delay this till the freeze point precisely so
-- that we know the convention.
if not Has_Foreign_Convention (E) then
Create_Extra_Formals (E);
Set_Mechanisms (E);
-- If this is convention Ada and a Valued_Procedure, that's odd
if Ekind (E) = E_Procedure
and then Is_Valued_Procedure (E)
and then Convention (E) = Convention_Ada
and then Warn_On_Export_Import
then
Error_Msg_N
("??Valued_Procedure has no effect for convention Ada", E);
Set_Is_Valued_Procedure (E, False);
end if;
-- Case of foreign convention
else
Set_Mechanisms (E);
-- For foreign conventions, warn about return of unconstrained array
if Ekind (E) = E_Function then
Retype := Underlying_Type (Etype (E));
-- If no return type, probably some other error, e.g. a
-- missing full declaration, so ignore.
if No (Retype) then
null;
-- If the return type is generic, we have emitted a warning
-- earlier on, and there is nothing else to check here. Specific
-- instantiations may lead to erroneous behavior.
elsif Is_Generic_Type (Etype (E)) then
null;
-- Display warning if returning unconstrained array
elsif Is_Array_Type (Retype)
and then not Is_Constrained (Retype)
-- Check appropriate warning is enabled (should we check for
-- Warnings (Off) on specific entities here, probably so???)
and then Warn_On_Export_Import
then
Error_Msg_N
("?x?foreign convention function& should not return " &
"unconstrained array", E);
return;
end if;
end if;
-- If any of the formals for an exported foreign convention
-- subprogram have defaults, then emit an appropriate warning since
-- this is odd (default cannot be used from non-Ada code)
if Is_Exported (E) then
F := First_Formal (E);
while Present (F) loop
if Warn_On_Export_Import
and then Present (Default_Value (F))
then
Error_Msg_N
("?x?parameter cannot be defaulted in non-Ada call",
Default_Value (F));
end if;
Next_Formal (F);
end loop;
end if;
end if;
-- Pragma Inline_Always is disallowed for dispatching subprograms
-- because the address of such subprograms is saved in the dispatch
-- table to support dispatching calls, and dispatching calls cannot
-- be inlined. This is consistent with the restriction against using
-- 'Access or 'Address on an Inline_Always subprogram.
if Is_Dispatching_Operation (E)
and then Has_Pragma_Inline_Always (E)
then
Error_Msg_N
("pragma Inline_Always not allowed for dispatching subprograms", E);
end if;
-- Because of the implicit representation of inherited predefined
-- operators in the front-end, the overriding status of the operation
-- may be affected when a full view of a type is analyzed, and this is
-- not captured by the analysis of the corresponding type declaration.
-- Therefore the correctness of a not-overriding indicator must be
-- rechecked when the subprogram is frozen.
if Nkind (E) = N_Defining_Operator_Symbol
and then not Error_Posted (Parent (E))
then
Check_Overriding_Indicator (E, Empty, Is_Primitive (E));
end if;
if Modify_Tree_For_C
and then Nkind (Parent (E)) = N_Function_Specification
and then Is_Array_Type (Etype (E))
and then Is_Constrained (Etype (E))
and then not Is_Unchecked_Conversion_Instance (E)
and then not Rewritten_For_C (E)
then
Build_Procedure_Form (Unit_Declaration_Node (E));
end if;
end Freeze_Subprogram;
----------------------
-- Is_Fully_Defined --
----------------------
function Is_Fully_Defined (T : Entity_Id) return Boolean is
begin
if Ekind (T) = E_Class_Wide_Type then
return Is_Fully_Defined (Etype (T));
elsif Is_Array_Type (T) then
return Is_Fully_Defined (Component_Type (T));
elsif Is_Record_Type (T)
and not Is_Private_Type (T)
then
-- Verify that the record type has no components with private types
-- without completion.
declare
Comp : Entity_Id;
begin
Comp := First_Component (T);
while Present (Comp) loop
if not Is_Fully_Defined (Etype (Comp)) then
return False;
end if;
Next_Component (Comp);
end loop;
return True;
end;
-- For the designated type of an access to subprogram, all types in
-- the profile must be fully defined.
elsif Ekind (T) = E_Subprogram_Type then
declare
F : Entity_Id;
begin
F := First_Formal (T);
while Present (F) loop
if not Is_Fully_Defined (Etype (F)) then
return False;
end if;
Next_Formal (F);
end loop;
return Is_Fully_Defined (Etype (T));
end;
else
return not Is_Private_Type (T)
or else Present (Full_View (Base_Type (T)));
end if;
end Is_Fully_Defined;
---------------------------------
-- Process_Default_Expressions --
---------------------------------
procedure Process_Default_Expressions
(E : Entity_Id;
After : in out Node_Id)
is
Loc : constant Source_Ptr := Sloc (E);
Dbody : Node_Id;
Formal : Node_Id;
Dcopy : Node_Id;
Dnam : Entity_Id;
begin
Set_Default_Expressions_Processed (E);
-- A subprogram instance and its associated anonymous subprogram share
-- their signature. The default expression functions are defined in the
-- wrapper packages for the anonymous subprogram, and should not be
-- generated again for the instance.
if Is_Generic_Instance (E)
and then Present (Alias (E))
and then Default_Expressions_Processed (Alias (E))
then
return;
end if;
Formal := First_Formal (E);
while Present (Formal) loop
if Present (Default_Value (Formal)) then
-- We work with a copy of the default expression because we
-- do not want to disturb the original, since this would mess
-- up the conformance checking.
Dcopy := New_Copy_Tree (Default_Value (Formal));
-- The analysis of the expression may generate insert actions,
-- which of course must not be executed. We wrap those actions
-- in a procedure that is not called, and later on eliminated.
-- The following cases have no side-effects, and are analyzed
-- directly.
if Nkind (Dcopy) = N_Identifier
or else Nkind_In (Dcopy, N_Expanded_Name,
N_Integer_Literal,
N_Character_Literal,
N_String_Literal,
N_Real_Literal)
or else (Nkind (Dcopy) = N_Attribute_Reference
and then Attribute_Name (Dcopy) = Name_Null_Parameter)
or else Known_Null (Dcopy)
then
-- If there is no default function, we must still do a full
-- analyze call on the default value, to ensure that all error
-- checks are performed, e.g. those associated with static
-- evaluation. Note: this branch will always be taken if the
-- analyzer is turned off (but we still need the error checks).
-- Note: the setting of parent here is to meet the requirement
-- that we can only analyze the expression while attached to
-- the tree. Really the requirement is that the parent chain
-- be set, we don't actually need to be in the tree.
Set_Parent (Dcopy, Declaration_Node (Formal));
Analyze (Dcopy);
-- Default expressions are resolved with their own type if the
-- context is generic, to avoid anomalies with private types.
if Ekind (Scope (E)) = E_Generic_Package then
Resolve (Dcopy);
else
Resolve (Dcopy, Etype (Formal));
end if;
-- If that resolved expression will raise constraint error,
-- then flag the default value as raising constraint error.
-- This allows a proper error message on the calls.
if Raises_Constraint_Error (Dcopy) then
Set_Raises_Constraint_Error (Default_Value (Formal));
end if;
-- If the default is a parameterless call, we use the name of
-- the called function directly, and there is no body to build.
elsif Nkind (Dcopy) = N_Function_Call
and then No (Parameter_Associations (Dcopy))
then
null;
-- Else construct and analyze the body of a wrapper procedure
-- that contains an object declaration to hold the expression.
-- Given that this is done only to complete the analysis, it is
-- simpler to build a procedure than a function which might
-- involve secondary stack expansion.
else
Dnam := Make_Temporary (Loc, 'D');
Dbody :=
Make_Subprogram_Body (Loc,
Specification =>
Make_Procedure_Specification (Loc,
Defining_Unit_Name => Dnam),
Declarations => New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Make_Temporary (Loc, 'T'),
Object_Definition =>
New_Occurrence_Of (Etype (Formal), Loc),
Expression => New_Copy_Tree (Dcopy))),
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => Empty_List));
Set_Scope (Dnam, Scope (E));
Set_Assignment_OK (First (Declarations (Dbody)));
Set_Is_Eliminated (Dnam);
Insert_After (After, Dbody);
Analyze (Dbody);
After := Dbody;
end if;
end if;
Next_Formal (Formal);
end loop;
end Process_Default_Expressions;
----------------------------------------
-- Set_Component_Alignment_If_Not_Set --
----------------------------------------
procedure Set_Component_Alignment_If_Not_Set (Typ : Entity_Id) is
begin
-- Ignore if not base type, subtypes don't need anything
if Typ /= Base_Type (Typ) then
return;
end if;
-- Do not override existing representation
if Is_Packed (Typ) then
return;
elsif Has_Specified_Layout (Typ) then
return;
elsif Component_Alignment (Typ) /= Calign_Default then
return;
else
Set_Component_Alignment
(Typ, Scope_Stack.Table
(Scope_Stack.Last).Component_Alignment_Default);
end if;
end Set_Component_Alignment_If_Not_Set;
--------------------------
-- Set_SSO_From_Default --
--------------------------
procedure Set_SSO_From_Default (T : Entity_Id) is
Reversed : Boolean;
begin
-- Set default SSO for an array or record base type, except in case of
-- a type extension (which always inherits the SSO of its parent type).
if Is_Base_Type (T)
and then (Is_Array_Type (T)
or else (Is_Record_Type (T)
and then not (Is_Tagged_Type (T)
and then Is_Derived_Type (T))))
then
Reversed :=
(Bytes_Big_Endian and then SSO_Set_Low_By_Default (T))
or else
(not Bytes_Big_Endian and then SSO_Set_High_By_Default (T));
if (SSO_Set_Low_By_Default (T) or else SSO_Set_High_By_Default (T))
-- For a record type, if bit order is specified explicitly,
-- then do not set SSO from default if not consistent. Note that
-- we do not want to look at a Bit_Order attribute definition
-- for a parent: if we were to inherit Bit_Order, then both
-- SSO_Set_*_By_Default flags would have been cleared already
-- (by Inherit_Aspects_At_Freeze_Point).
and then not
(Is_Record_Type (T)
and then
Has_Rep_Item (T, Name_Bit_Order, Check_Parents => False)
and then Reverse_Bit_Order (T) /= Reversed)
then
-- If flags cause reverse storage order, then set the result. Note
-- that we would have ignored the pragma setting the non default
-- storage order in any case, hence the assertion at this point.
pragma Assert
(not Reversed or else Support_Nondefault_SSO_On_Target);
Set_Reverse_Storage_Order (T, Reversed);
-- For a record type, also set reversed bit order. Note: if a bit
-- order has been specified explicitly, then this is a no-op.
if Is_Record_Type (T) then
Set_Reverse_Bit_Order (T, Reversed);
end if;
end if;
end if;
end Set_SSO_From_Default;
------------------
-- Undelay_Type --
------------------
procedure Undelay_Type (T : Entity_Id) is
begin
Set_Has_Delayed_Freeze (T, False);
Set_Freeze_Node (T, Empty);
-- Since we don't want T to have a Freeze_Node, we don't want its
-- Full_View or Corresponding_Record_Type to have one either.
-- ??? Fundamentally, this whole handling is unpleasant. What we really
-- want is to be sure that for an Itype that's part of record R and is a
-- subtype of type T, that it's frozen after the later of the freeze
-- points of R and T. We have no way of doing that directly, so what we
-- do is force most such Itypes to be frozen as part of freezing R via
-- this procedure and only delay the ones that need to be delayed
-- (mostly the designated types of access types that are defined as part
-- of the record).
if Is_Private_Type (T)
and then Present (Full_View (T))
and then Is_Itype (Full_View (T))
and then Is_Record_Type (Scope (Full_View (T)))
then
Undelay_Type (Full_View (T));
end if;
if Is_Concurrent_Type (T)
and then Present (Corresponding_Record_Type (T))
and then Is_Itype (Corresponding_Record_Type (T))
and then Is_Record_Type (Scope (Corresponding_Record_Type (T)))
then
Undelay_Type (Corresponding_Record_Type (T));
end if;
end Undelay_Type;
------------------
-- Warn_Overlay --
------------------
procedure Warn_Overlay (Expr : Node_Id; Typ : Entity_Id; Nam : Entity_Id) is
Ent : constant Entity_Id := Entity (Nam);
-- The object to which the address clause applies
Init : Node_Id;
Old : Entity_Id := Empty;
Decl : Node_Id;
begin
-- No warning if address clause overlay warnings are off
if not Address_Clause_Overlay_Warnings then
return;
end if;
-- No warning if there is an explicit initialization
Init := Original_Node (Expression (Declaration_Node (Ent)));
if Present (Init) and then Comes_From_Source (Init) then
return;
end if;
-- We only give the warning for non-imported entities of a type for
-- which a non-null base init proc is defined, or for objects of access
-- types with implicit null initialization, or when Normalize_Scalars
-- applies and the type is scalar or a string type (the latter being
-- tested for because predefined String types are initialized by inline
-- code rather than by an init_proc). Note that we do not give the
-- warning for Initialize_Scalars, since we suppressed initialization
-- in this case. Also, do not warn if Suppress_Initialization is set.
if Present (Expr)
and then not Is_Imported (Ent)
and then not Initialization_Suppressed (Typ)
and then (Has_Non_Null_Base_Init_Proc (Typ)
or else Is_Access_Type (Typ)
or else (Normalize_Scalars
and then (Is_Scalar_Type (Typ)
or else Is_String_Type (Typ))))
then
if Nkind (Expr) = N_Attribute_Reference
and then Is_Entity_Name (Prefix (Expr))
then
Old := Entity (Prefix (Expr));
elsif Is_Entity_Name (Expr)
and then Ekind (Entity (Expr)) = E_Constant
then
Decl := Declaration_Node (Entity (Expr));
if Nkind (Decl) = N_Object_Declaration
and then Present (Expression (Decl))
and then Nkind (Expression (Decl)) = N_Attribute_Reference
and then Is_Entity_Name (Prefix (Expression (Decl)))
then
Old := Entity (Prefix (Expression (Decl)));
elsif Nkind (Expr) = N_Function_Call then
return;
end if;
-- A function call (most likely to To_Address) is probably not an
-- overlay, so skip warning. Ditto if the function call was inlined
-- and transformed into an entity.
elsif Nkind (Original_Node (Expr)) = N_Function_Call then
return;
end if;
-- If a pragma Import follows, we assume that it is for the current
-- target of the address clause, and skip the warning. There may be
-- a source pragma or an aspect that specifies import and generates
-- the corresponding pragma. These will indicate that the entity is
-- imported and that is checked above so that the spurious warning
-- (generated when the entity is frozen) will be suppressed. The
-- pragma may be attached to the aspect, so it is not yet a list
-- member.
if Is_List_Member (Parent (Expr)) then
Decl := Next (Parent (Expr));
if Present (Decl)
and then Nkind (Decl) = N_Pragma
and then Pragma_Name (Decl) = Name_Import
then
return;
end if;
end if;
-- Otherwise give warning message
if Present (Old) then
Error_Msg_Node_2 := Old;
Error_Msg_N
("default initialization of & may modify &??",
Nam);
else
Error_Msg_N
("default initialization of & may modify overlaid storage??",
Nam);
end if;
-- Add friendly warning if initialization comes from a packed array
-- component.
if Is_Record_Type (Typ) then
declare
Comp : Entity_Id;
begin
Comp := First_Component (Typ);
while Present (Comp) loop
if Nkind (Parent (Comp)) = N_Component_Declaration
and then Present (Expression (Parent (Comp)))
then
exit;
elsif Is_Array_Type (Etype (Comp))
and then Present (Packed_Array_Impl_Type (Etype (Comp)))
then
Error_Msg_NE
("\packed array component& " &
"will be initialized to zero??",
Nam, Comp);
exit;
else
Next_Component (Comp);
end if;
end loop;
end;
end if;
Error_Msg_N
("\use pragma Import for & to " &
"suppress initialization (RM B.1(24))??",
Nam);
end if;
end Warn_Overlay;
end Freeze;
| 38.508381 | 79 | 0.538005 |
0bf5f4356cb9d256fa0f065ba01cc295f79ed9f8 | 4,654 | ads | Ada | src/util-serialize-io-json.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-serialize-io-json.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-serialize-io-json.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- util-serialize-io-json -- JSON Serialization Driver
-- Copyright (C) 2010, 2011, 2012 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.Strings.Unbounded;
with Util.Streams.Texts;
with Util.Stacks;
package Util.Serialize.IO.JSON is
-- ------------------------------
-- JSON Output Stream
-- ------------------------------
-- The <b>Output_Stream</b> provides methods for creating a JSON output stream.
-- The stream object takes care of the JSON escape rules.
type Output_Stream is
new Util.Streams.Texts.Print_Stream and Util.Serialize.IO.Output_Stream with private;
-- Start a JSON document. This operation writes the initial JSON marker ('{').
procedure Start_Document (Stream : in out Output_Stream);
-- Finish a JSON document by writing the final JSON marker ('}').
procedure End_Document (Stream : in out Output_Stream);
-- Write the value as a JSON string. Special characters are escaped using the JSON
-- escape rules.
procedure Write_String (Stream : in out Output_Stream;
Value : in String);
-- Start a new JSON object. If the name is not empty, write it as a string
-- followed by the ':' (colon). The JSON object starts with '{' (curly brace).
-- Example: "list": {
procedure Start_Entity (Stream : in out Output_Stream;
Name : in String);
-- Terminates the current JSON object.
procedure End_Entity (Stream : in out Output_Stream;
Name : in String);
-- Write a JSON name/value pair. The value is written according to its type
-- Example: "name": null
-- "name": false
-- "name": 12
-- "name": "value"
procedure Write_Attribute (Stream : in out Output_Stream;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Write a JSON name/value pair (see Write_Attribute).
procedure Write_Entity (Stream : in out Output_Stream;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Starts a JSON array.
-- Example: "list": [
procedure Start_Array (Stream : in out Output_Stream;
Name : in String;
Length : in Ada.Containers.Count_Type);
-- Terminates a JSON array.
procedure End_Array (Stream : in out Output_Stream);
type Parser is new Serialize.IO.Parser with private;
-- Parse the stream using the JSON parser.
procedure Parse (Handler : in out Parser;
Stream : in out Util.Streams.Buffered.Buffered_Stream'Class);
-- Get the current location (file and line) to report an error message.
function Get_Location (Handler : in Parser) return String;
private
type Node_Info is record
Is_Array : Boolean := False;
Has_Fields : Boolean := False;
end record;
type Node_Info_Access is access all Node_Info;
package Node_Info_Stack is new Util.Stacks (Element_Type => Node_Info,
Element_Type_Access => Node_Info_Access);
type Output_Stream is
new Util.Streams.Texts.Print_Stream and Util.Serialize.IO.Output_Stream with record
Stack : Node_Info_Stack.Stack;
end record;
type Token_Type is (T_EOF, T_LEFT_BRACE, T_RIGHT_BRACE, T_LEFT_BRACKET,
T_RIGHT_BRACKET, T_COLON, T_COMMA, T_TRUE, T_FALSE,
T_STRING, T_NUMBER, T_BOOLEAN, T_UNKNOWN, T_NULL);
type Parser is new Util.Serialize.IO.Parser with record
Token : Ada.Strings.Unbounded.Unbounded_String;
Pending_Token : Token_Type := T_EOF;
Line_Number : Natural := 1;
Has_Pending_Char : Boolean := False;
Pending_Char : Character;
end record;
end Util.Serialize.IO.JSON;
| 41.185841 | 90 | 0.61517 |
fb9c07edb3e79faf58a2da0cb7eea942c54829c8 | 3,514 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-expont.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-expont.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-expont.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X P O N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
function System.Expont (Left : Int; Right : Natural) return Int is
-- Note that negative exponents get a constraint error because the
-- subtype of the Right argument (the exponent) is Natural.
Result : Int := 1;
Factor : Int := Left;
Exp : Natural := Right;
begin
-- We use the standard logarithmic approach, Exp gets shifted right
-- testing successive low order bits and Factor is the value of the
-- base raised to the next power of 2.
-- Note: it is not worth special casing base values -1, 0, +1 since
-- the expander does this when the base is a literal, and other cases
-- will be extremely rare.
if Exp /= 0 then
loop
if Exp rem 2 /= 0 then
declare
pragma Unsuppress (Overflow_Check);
begin
Result := Result * Factor;
end;
end if;
Exp := Exp / 2;
exit when Exp = 0;
declare
pragma Unsuppress (Overflow_Check);
begin
Factor := Factor * Factor;
end;
end loop;
end if;
return Result;
end System.Expont;
| 48.136986 | 78 | 0.386739 |
062f73dfb1132aaa5978b7726585cbd39af2b637 | 4,312 | adb | Ada | Ada/src/Problem_11.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/src/Problem_11.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/src/Problem_11.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | with Ada.Integer_Text_IO;
with Ada.Text_IO;
package body Problem_11 is
package IO renames Ada.Text_IO;
package I_IO renames Ada.Integer_Text_IO;
procedure Solve is
type Row is new Positive range 1 .. 20;
type Column is new Positive range 1 .. 20;
type Grid is Array(Row range <>, Column range <>) of Natural;
table : constant Grid :=
(( 8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8),
(49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0),
(81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65),
(52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91),
(22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80),
(24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50),
(32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70),
(67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21),
(24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72),
(21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95),
(78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92),
(16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57),
(86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58),
(19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40),
( 4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66),
(88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69),
( 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36),
(20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16),
(20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54),
( 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48));
function Check_Right(r : in Row; c: in Column) return Natural is
begin
if c + 3 > Column'Last then
return 0;
end if;
return table(r,c)
* table(r,c+1)
* table(r,c+2)
* table(r,c+3);
end Check_Right;
function Check_Down(r: in Row; c: in Column) return Natural is
begin
if r + 3 > Row'Last then
return 0;
end if;
return table(r,c)
* table(r+1,c)
* table(r+2,c)
* table(r+3,c);
end Check_Down;
function Check_Left_Down(r: in Row; c: in Column) return Natural is
begin
if c - 3 < Column'First or r + 3 > Row'Last then
return 0;
end if;
return table(r,c)
* table(r+1,c-1)
* table(r+2,c-2)
* table(r+3,c-3);
end Check_Left_Down;
function Check_Right_Down(r: in row; c: in Column) return Natural is
begin
if c + 3 > Column'Last or r + 3 > Row'Last then
return 0;
end if;
return table(r,c)
* table(r+1,c+1)
* table(r+2,c+2)
* table(r+3,c+3);
end Check_Right_Down;
best : Natural := 0;
begin
for r in Row loop
for c in Column loop
declare
right : constant Natural := Check_Right(r, c);
down : constant Natural := Check_Down(r, c);
left_down : constant Natural := Check_Left_Down(r, c);
right_down : constant Natural := Check_Right_Down(r, c);
begin
if right > best then
best := right;
end if;
if down > best then
best := down;
end if;
if left_down > best then
best := left_down;
end if;
if right_down > best then
best := right_down;
end if;
end;
end loop;
end loop;
I_IO.Put(best);
IO.New_Line;
end Solve;
end Problem_11;
| 43.12 | 90 | 0.461967 |
103275a9b8279b37d430892e54611ab7247198c2 | 182 | ads | Ada | src/_for_debug_purposes/apsepp-debug_trace_class-output-create.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/_for_debug_purposes/apsepp-debug_trace_class-output-create.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/_for_debug_purposes/apsepp-debug_trace_class-output-create.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | -- Copyright (C) 2019 Thierry Rascle <[email protected]>
-- MIT license. Please refer to the LICENSE file.
function Apsepp.Debug_Trace_Class.Output.Create return Debug_Trace_Output;
| 36.4 | 74 | 0.796703 |
06355e3fc8dd6ada0d7fd0f14d6ac78eeb2733c1 | 9,352 | ads | Ada | awa/src/model/awa-permissions-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/model/awa-permissions-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/model/awa-permissions-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- AWA.Permissions.Models -- AWA.Permissions.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) 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.
-----------------------------------------------------------------------
pragma Warnings (Off, "unit * is not referenced");
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, "unit * is not referenced");
package AWA.Permissions.Models is
type ACL_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- The ACL table records permissions which are granted for a user to access a given database entity.
-- --------------------
-- Create an object key for ACL.
function ACL_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for ACL from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function ACL_Key (Id : in String) return ADO.Objects.Object_Key;
Null_ACL : constant ACL_Ref;
function "=" (Left, Right : ACL_Ref'Class) return Boolean;
-- Set the ACL identifier
procedure Set_Id (Object : in out Acl_Ref;
Value : in ADO.Identifier);
-- Get the ACL identifier
function Get_Id (Object : in Acl_Ref)
return ADO.Identifier;
-- Set the entity identifier to which the ACL applies
procedure Set_Entity_Id (Object : in out Acl_Ref;
Value : in ADO.Identifier);
-- Get the entity identifier to which the ACL applies
function Get_Entity_Id (Object : in Acl_Ref)
return ADO.Identifier;
-- Set the writeable flag
procedure Set_Writeable (Object : in out Acl_Ref;
Value : in Boolean);
-- Get the writeable flag
function Get_Writeable (Object : in Acl_Ref)
return Boolean;
--
procedure Set_User_Id (Object : in out Acl_Ref;
Value : in ADO.Identifier);
--
function Get_User_Id (Object : in Acl_Ref)
return ADO.Identifier;
-- Set the entity type concerned by the ACL.
procedure Set_Entity_Type (Object : in out Acl_Ref;
Value : in ADO.Entity_Type);
-- Get the entity type concerned by the ACL.
function Get_Entity_Type (Object : in Acl_Ref)
return ADO.Entity_Type;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Acl_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 Acl_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 Acl_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 Acl_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Acl_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Acl_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
ACL_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Acl_Ref);
-- Copy of the object.
procedure Copy (Object : in Acl_Ref;
Into : in out Acl_Ref);
Query_Check_Entity_Permission : constant ADO.Queries.Query_Definition_Access;
Query_Remove_Permission : constant ADO.Queries.Query_Definition_Access;
Query_Remove_Entity_Permission : constant ADO.Queries.Query_Definition_Access;
Query_Remove_User_Permission : constant ADO.Queries.Query_Definition_Access;
private
ACL_NAME : aliased constant String := "awa_acl";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "entity_id";
COL_2_1_NAME : aliased constant String := "writeable";
COL_3_1_NAME : aliased constant String := "user_id";
COL_4_1_NAME : aliased constant String := "entity_type";
ACL_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 5,
Table => ACL_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access,
3 => COL_2_1_NAME'Access,
4 => COL_3_1_NAME'Access,
5 => COL_4_1_NAME'Access
)
);
ACL_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= ACL_DEF'Access;
Null_ACL : constant ACL_Ref
:= ACL_Ref'(ADO.Objects.Object_Ref with others => <>);
type Acl_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => ACL_DEF'Access)
with record
Entity_Id : ADO.Identifier;
Writeable : Boolean;
User_Id : ADO.Identifier;
Entity_Type : ADO.Entity_Type;
end record;
type Acl_Access is access all Acl_Impl;
overriding
procedure Destroy (Object : access Acl_Impl);
overriding
procedure Find (Object : in out Acl_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Acl_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Acl_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Acl_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Acl_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Acl_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Acl_Ref'Class;
Impl : out Acl_Access);
package File_1 is
new ADO.Queries.Loaders.File (Path => "permissions.xml",
Sha1 => "9B2B599473F75F92CB5AB5045675E4CCEF926543");
package Def_Check_Entity_Permission is
new ADO.Queries.Loaders.Query (Name => "check-entity-permission",
File => File_1.File'Access);
Query_Check_Entity_Permission : constant ADO.Queries.Query_Definition_Access
:= Def_Check_Entity_Permission.Query'Access;
package Def_Remove_Permission is
new ADO.Queries.Loaders.Query (Name => "remove-permission",
File => File_1.File'Access);
Query_Remove_Permission : constant ADO.Queries.Query_Definition_Access
:= Def_Remove_Permission.Query'Access;
package Def_Remove_Entity_Permission is
new ADO.Queries.Loaders.Query (Name => "remove-entity-permission",
File => File_1.File'Access);
Query_Remove_Entity_Permission : constant ADO.Queries.Query_Definition_Access
:= Def_Remove_Entity_Permission.Query'Access;
package Def_Remove_User_Permission is
new ADO.Queries.Loaders.Query (Name => "remove-user-permission",
File => File_1.File'Access);
Query_Remove_User_Permission : constant ADO.Queries.Query_Definition_Access
:= Def_Remove_User_Permission.Query'Access;
end AWA.Permissions.Models;
| 38.171429 | 104 | 0.631202 |
a1a12fa8522ac11a28c5f0d1a6f34a67a58cfbcf | 3,177 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-fore.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-fore.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-fore.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 . F O R E --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994 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. --
-- --
------------------------------------------------------------------------------
package body System.Fore is
----------
-- Fore --
----------
function Fore (Lo, Hi : Long_Long_Float) return Natural is
T : Long_Long_Float := Long_Long_Float'Max (abs Lo, abs Hi);
R : Natural;
begin
-- Initial value of 2 allows for sign and mandatory single digit
R := 2;
-- Loop to increase Fore as needed to include full range of values
while T >= 10.0 loop
T := T / 10.0;
R := R + 1;
end loop;
return R;
end Fore;
end System.Fore;
| 52.081967 | 78 | 0.41706 |
2030d919549db52db309a1580f10478e9ab25ba8 | 152 | ads | Ada | generated/natools-static_maps-web-acl-commands.ads | faelys/natools-web | f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750 | [
"0BSD"
] | 1 | 2015-04-23T10:48:58.000Z | 2015-04-23T10:48:58.000Z | generated/natools-static_maps-web-acl-commands.ads | faelys/natools-web | f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750 | [
"0BSD"
] | null | null | null | generated/natools-static_maps-web-acl-commands.ads | faelys/natools-web | f7ba99f2ffb6f5a06d1b1e8becbf5f92fd58c750 | [
"0BSD"
] | null | null | null | package Natools.Static_Maps.Web.ACL.Commands is
pragma Pure;
function Hash (S : String) return Natural;
end Natools.Static_Maps.Web.ACL.Commands;
| 30.4 | 47 | 0.776316 |
31bcbb8b0ec593eb232979741f1330e4cc002b7d | 1,194 | adb | Ada | memsim-master/src/bram.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/bram.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/bram.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null |
with Util; use Util;
with Device;
package body BRAM is
function Get_Count(width : Natural;
depth : Natural) return Natural is
bram_width : constant Natural := Device.Get_BRAM_Width;
bram_depth : constant Natural := Device.Get_BRAM_Depth;
result : Natural := 0;
begin
-- Handle the BRAM that is less than bram_width wide (if there is one).
if (width mod bram_width) /= 0 then
declare
max_width : constant Natural := bram_width * bram_depth;
small_width : constant Natural := width mod bram_width;
rounded_width : constant Natural := Round_Power2(small_width);
small_depth : constant Natural := max_width / rounded_width;
begin
result := (depth + small_depth - 1) / small_depth;
end;
end if;
-- Handle BRAMs that are bram_width wide.
declare
big_count : constant Natural := width / bram_width;
big_depth : constant Natural := (depth + bram_depth - 1) / bram_depth;
begin
result := result + big_depth * big_count;
end;
return result;
end Get_Count;
end BRAM;
| 30.615385 | 79 | 0.605528 |
10a9e92ba0deae781a1fc0824efb0c85b6ed9ac8 | 22,302 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-crbtgk.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-crbtgk.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-crbtgk.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_KEYS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
package body Ada.Containers.Red_Black_Trees.Generic_Keys is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
package Ops renames Tree_Operations;
-------------
-- Ceiling --
-------------
-- AKA Lower_Bound
function Ceiling (Tree : Tree_Type; Key : Key_Type) return Node_Access is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Tree.TC'Unrestricted_Access);
Y : Node_Access;
X : Node_Access;
begin
-- If the container is empty, return a result immediately, so that we do
-- not manipulate the tamper bits unnecessarily.
if Tree.Root = null then
return null;
end if;
X := Tree.Root;
while X /= null loop
if Is_Greater_Key_Node (Key, X) then
X := Ops.Right (X);
else
Y := X;
X := Ops.Left (X);
end if;
end loop;
return Y;
end Ceiling;
----------
-- Find --
----------
function Find (Tree : Tree_Type; Key : Key_Type) return Node_Access is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Tree.TC'Unrestricted_Access);
Y : Node_Access;
X : Node_Access;
begin
-- If the container is empty, return a result immediately, so that we do
-- not manipulate the tamper bits unnecessarily.
if Tree.Root = null then
return null;
end if;
X := Tree.Root;
while X /= null loop
if Is_Greater_Key_Node (Key, X) then
X := Ops.Right (X);
else
Y := X;
X := Ops.Left (X);
end if;
end loop;
if Y = null or else Is_Less_Key_Node (Key, Y) then
return null;
else
return Y;
end if;
end Find;
-----------
-- Floor --
-----------
function Floor (Tree : Tree_Type; Key : Key_Type) return Node_Access is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Tree.TC'Unrestricted_Access);
Y : Node_Access;
X : Node_Access;
begin
-- If the container is empty, return a result immediately, so that we do
-- not manipulate the tamper bits unnecessarily.
if Tree.Root = null then
return null;
end if;
X := Tree.Root;
while X /= null loop
if Is_Less_Key_Node (Key, X) then
X := Ops.Left (X);
else
Y := X;
X := Ops.Right (X);
end if;
end loop;
return Y;
end Floor;
--------------------------------
-- Generic_Conditional_Insert --
--------------------------------
procedure Generic_Conditional_Insert
(Tree : in out Tree_Type;
Key : Key_Type;
Node : out Node_Access;
Inserted : out Boolean)
is
X : Node_Access;
Y : Node_Access;
Compare : Boolean;
begin
-- This is a "conditional" insertion, meaning that the insertion request
-- can "fail" in the sense that no new node is created. If the Key is
-- equivalent to an existing node, then we return the existing node and
-- Inserted is set to False. Otherwise, we allocate a new node (via
-- Insert_Post) and Inserted is set to True.
-- Note that we are testing for equivalence here, not equality. Key must
-- be strictly less than its next neighbor, and strictly greater than
-- its previous neighbor, in order for the conditional insertion to
-- succeed.
-- Handle insertion into an empty container as a special case, so that
-- we do not manipulate the tamper bits unnecessarily.
if Tree.Root = null then
Insert_Post (Tree, null, True, Node);
Inserted := True;
return;
end if;
-- We search the tree to find the nearest neighbor of Key, which is
-- either the smallest node greater than Key (Inserted is True), or the
-- largest node less or equivalent to Key (Inserted is False).
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
X := Tree.Root;
Y := null;
Inserted := True;
while X /= null loop
Y := X;
Inserted := Is_Less_Key_Node (Key, X);
X := (if Inserted then Ops.Left (X) else Ops.Right (X));
end loop;
end;
if Inserted then
-- Key is less than Y. If Y is the first node in the tree, then there
-- are no other nodes that we need to search for, and we insert a new
-- node into the tree.
if Y = Tree.First then
Insert_Post (Tree, Y, True, Node);
return;
end if;
-- Y is the next nearest-neighbor of Key. We know that Key is not
-- equivalent to Y (because Key is strictly less than Y), so we move
-- to the previous node, the nearest-neighbor just smaller or
-- equivalent to Key.
Node := Ops.Previous (Y);
else
-- Y is the previous nearest-neighbor of Key. We know that Key is not
-- less than Y, which means either that Key is equivalent to Y, or
-- greater than Y.
Node := Y;
end if;
-- Key is equivalent to or greater than Node. We must resolve which is
-- the case, to determine whether the conditional insertion succeeds.
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Greater_Key_Node (Key, Node);
end;
if Compare then
-- Key is strictly greater than Node, which means that Key is not
-- equivalent to Node. In this case, the insertion succeeds, and we
-- insert a new node into the tree.
Insert_Post (Tree, Y, Inserted, Node);
Inserted := True;
return;
end if;
-- Key is equivalent to Node. This is a conditional insertion, so we do
-- not insert a new node in this case. We return the existing node and
-- report that no insertion has occurred.
Inserted := False;
end Generic_Conditional_Insert;
------------------------------------------
-- Generic_Conditional_Insert_With_Hint --
------------------------------------------
procedure Generic_Conditional_Insert_With_Hint
(Tree : in out Tree_Type;
Position : Node_Access;
Key : Key_Type;
Node : out Node_Access;
Inserted : out Boolean)
is
Test : Node_Access;
Compare : Boolean;
begin
-- The purpose of a hint is to avoid a search from the root of
-- tree. If we have it hint it means we only need to traverse the
-- subtree rooted at the hint to find the nearest neighbor. Note
-- that finding the neighbor means merely walking the tree; this
-- is not a search and the only comparisons that occur are with
-- the hint and its neighbor.
-- Handle insertion into an empty container as a special case, so that
-- we do not manipulate the tamper bits unnecessarily.
if Tree.Root = null then
Insert_Post (Tree, null, True, Node);
Inserted := True;
return;
end if;
-- If Position is null, this is interpreted to mean that Key is large
-- relative to the nodes in the tree. If Key is greater than the last
-- node in the tree, then we're done; otherwise the hint was "wrong" and
-- we must search.
if Position = null then -- largest
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Greater_Key_Node (Key, Tree.Last);
end;
if Compare then
Insert_Post (Tree, Tree.Last, False, Node);
Inserted := True;
else
Conditional_Insert_Sans_Hint (Tree, Key, Node, Inserted);
end if;
return;
end if;
pragma Assert (Tree.Length > 0);
-- A hint can either name the node that immediately follows Key,
-- or immediately precedes Key. We first test whether Key is
-- less than the hint, and if so we compare Key to the node that
-- precedes the hint. If Key is both less than the hint and
-- greater than the hint's preceding neighbor, then we're done;
-- otherwise we must search.
-- Note also that a hint can either be an anterior node or a leaf
-- node. A new node is always inserted at the bottom of the tree
-- (at least prior to rebalancing), becoming the new left or
-- right child of leaf node (which prior to the insertion must
-- necessarily be null, since this is a leaf). If the hint names
-- an anterior node then its neighbor must be a leaf, and so
-- (here) we insert after the neighbor. If the hint names a leaf
-- then its neighbor must be anterior and so we insert before the
-- hint.
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Less_Key_Node (Key, Position);
end;
if Compare then
Test := Ops.Previous (Position); -- "before"
if Test = null then -- new first node
Insert_Post (Tree, Tree.First, True, Node);
Inserted := True;
return;
end if;
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Greater_Key_Node (Key, Test);
end;
if Compare then
if Ops.Right (Test) = null then
Insert_Post (Tree, Test, False, Node);
else
Insert_Post (Tree, Position, True, Node);
end if;
Inserted := True;
else
Conditional_Insert_Sans_Hint (Tree, Key, Node, Inserted);
end if;
return;
end if;
-- We know that Key isn't less than the hint so we try again, this time
-- to see if it's greater than the hint. If so we compare Key to the
-- node that follows the hint. If Key is both greater than the hint and
-- less than the hint's next neighbor, then we're done; otherwise we
-- must search.
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Greater_Key_Node (Key, Position);
end;
if Compare then
Test := Ops.Next (Position); -- "after"
if Test = null then -- new last node
Insert_Post (Tree, Tree.Last, False, Node);
Inserted := True;
return;
end if;
declare
Lock : With_Lock (Tree.TC'Unrestricted_Access);
begin
Compare := Is_Less_Key_Node (Key, Test);
end;
if Compare then
if Ops.Right (Position) = null then
Insert_Post (Tree, Position, False, Node);
else
Insert_Post (Tree, Test, True, Node);
end if;
Inserted := True;
else
Conditional_Insert_Sans_Hint (Tree, Key, Node, Inserted);
end if;
return;
end if;
-- We know that Key is neither less than the hint nor greater than the
-- hint, and that's the definition of equivalence. There's nothing else
-- we need to do, since a search would just reach the same conclusion.
Node := Position;
Inserted := False;
end Generic_Conditional_Insert_With_Hint;
-------------------------
-- Generic_Insert_Post --
-------------------------
procedure Generic_Insert_Post
(Tree : in out Tree_Type;
Y : Node_Access;
Before : Boolean;
Z : out Node_Access)
is
begin
if Checks and then Tree.Length = Count_Type'Last then
raise Constraint_Error with "too many elements";
end if;
TC_Check (Tree.TC);
Z := New_Node;
pragma Assert (Z /= null);
pragma Assert (Ops.Color (Z) = Red);
if Y = null then
pragma Assert (Tree.Length = 0);
pragma Assert (Tree.Root = null);
pragma Assert (Tree.First = null);
pragma Assert (Tree.Last = null);
Tree.Root := Z;
Tree.First := Z;
Tree.Last := Z;
elsif Before then
pragma Assert (Ops.Left (Y) = null);
Ops.Set_Left (Y, Z);
if Y = Tree.First then
Tree.First := Z;
end if;
else
pragma Assert (Ops.Right (Y) = null);
Ops.Set_Right (Y, Z);
if Y = Tree.Last then
Tree.Last := Z;
end if;
end if;
Ops.Set_Parent (Z, Y);
Ops.Rebalance_For_Insert (Tree, Z);
Tree.Length := Tree.Length + 1;
end Generic_Insert_Post;
-----------------------
-- Generic_Iteration --
-----------------------
procedure Generic_Iteration
(Tree : Tree_Type;
Key : Key_Type)
is
procedure Iterate (Node : Node_Access);
-------------
-- Iterate --
-------------
procedure Iterate (Node : Node_Access) is
N : Node_Access;
begin
N := Node;
while N /= null loop
if Is_Less_Key_Node (Key, N) then
N := Ops.Left (N);
elsif Is_Greater_Key_Node (Key, N) then
N := Ops.Right (N);
else
Iterate (Ops.Left (N));
Process (N);
N := Ops.Right (N);
end if;
end loop;
end Iterate;
-- Start of processing for Generic_Iteration
begin
Iterate (Tree.Root);
end Generic_Iteration;
-------------------------------
-- Generic_Reverse_Iteration --
-------------------------------
procedure Generic_Reverse_Iteration
(Tree : Tree_Type;
Key : Key_Type)
is
procedure Iterate (Node : Node_Access);
-------------
-- Iterate --
-------------
procedure Iterate (Node : Node_Access) is
N : Node_Access;
begin
N := Node;
while N /= null loop
if Is_Less_Key_Node (Key, N) then
N := Ops.Left (N);
elsif Is_Greater_Key_Node (Key, N) then
N := Ops.Right (N);
else
Iterate (Ops.Right (N));
Process (N);
N := Ops.Left (N);
end if;
end loop;
end Iterate;
-- Start of processing for Generic_Reverse_Iteration
begin
Iterate (Tree.Root);
end Generic_Reverse_Iteration;
----------------------------------
-- Generic_Unconditional_Insert --
----------------------------------
procedure Generic_Unconditional_Insert
(Tree : in out Tree_Type;
Key : Key_Type;
Node : out Node_Access)
is
Y : Node_Access;
X : Node_Access;
Before : Boolean;
begin
Y := null;
Before := False;
X := Tree.Root;
while X /= null loop
Y := X;
Before := Is_Less_Key_Node (Key, X);
X := (if Before then Ops.Left (X) else Ops.Right (X));
end loop;
Insert_Post (Tree, Y, Before, Node);
end Generic_Unconditional_Insert;
--------------------------------------------
-- Generic_Unconditional_Insert_With_Hint --
--------------------------------------------
procedure Generic_Unconditional_Insert_With_Hint
(Tree : in out Tree_Type;
Hint : Node_Access;
Key : Key_Type;
Node : out Node_Access)
is
begin
-- There are fewer constraints for an unconditional insertion
-- than for a conditional insertion, since we allow duplicate
-- keys. So instead of having to check (say) whether Key is
-- (strictly) greater than the hint's previous neighbor, here we
-- allow Key to be equal to or greater than the previous node.
-- There is the issue of what to do if Key is equivalent to the
-- hint. Does the new node get inserted before or after the hint?
-- We decide that it gets inserted after the hint, reasoning that
-- this is consistent with behavior for non-hint insertion, which
-- inserts a new node after existing nodes with equivalent keys.
-- First we check whether the hint is null, which is interpreted
-- to mean that Key is large relative to existing nodes.
-- Following our rule above, if Key is equal to or greater than
-- the last node, then we insert the new node immediately after
-- last. (We don't have an operation for testing whether a key is
-- "equal to or greater than" a node, so we must say instead "not
-- less than", which is equivalent.)
if Hint = null then -- largest
if Tree.Last = null then
Insert_Post (Tree, null, False, Node);
elsif Is_Less_Key_Node (Key, Tree.Last) then
Unconditional_Insert_Sans_Hint (Tree, Key, Node);
else
Insert_Post (Tree, Tree.Last, False, Node);
end if;
return;
end if;
pragma Assert (Tree.Length > 0);
-- We decide here whether to insert the new node prior to the
-- hint. Key could be equivalent to the hint, so in theory we
-- could write the following test as "not greater than" (same as
-- "less than or equal to"). If Key were equivalent to the hint,
-- that would mean that the new node gets inserted before an
-- equivalent node. That wouldn't break any container invariants,
-- but our rule above says that new nodes always get inserted
-- after equivalent nodes. So here we test whether Key is both
-- less than the hint and equal to or greater than the hint's
-- previous neighbor, and if so insert it before the hint.
if Is_Less_Key_Node (Key, Hint) then
declare
Before : constant Node_Access := Ops.Previous (Hint);
begin
if Before = null then
Insert_Post (Tree, Hint, True, Node);
elsif Is_Less_Key_Node (Key, Before) then
Unconditional_Insert_Sans_Hint (Tree, Key, Node);
elsif Ops.Right (Before) = null then
Insert_Post (Tree, Before, False, Node);
else
Insert_Post (Tree, Hint, True, Node);
end if;
end;
return;
end if;
-- We know that Key isn't less than the hint, so it must be equal
-- or greater. So we just test whether Key is less than or equal
-- to (same as "not greater than") the hint's next neighbor, and
-- if so insert it after the hint.
declare
After : constant Node_Access := Ops.Next (Hint);
begin
if After = null then
Insert_Post (Tree, Hint, False, Node);
elsif Is_Greater_Key_Node (Key, After) then
Unconditional_Insert_Sans_Hint (Tree, Key, Node);
elsif Ops.Right (Hint) = null then
Insert_Post (Tree, Hint, False, Node);
else
Insert_Post (Tree, After, True, Node);
end if;
end;
end Generic_Unconditional_Insert_With_Hint;
-----------------
-- Upper_Bound --
-----------------
function Upper_Bound
(Tree : Tree_Type;
Key : Key_Type) return Node_Access
is
Y : Node_Access;
X : Node_Access;
begin
X := Tree.Root;
while X /= null loop
if Is_Less_Key_Node (Key, X) then
Y := X;
X := Ops.Left (X);
else
X := Ops.Right (X);
end if;
end loop;
return Y;
end Upper_Bound;
end Ada.Containers.Red_Black_Trees.Generic_Keys;
| 32.274964 | 79 | 0.543763 |
313cb6d3dccbd45a69501a6c9e79c0763622098b | 4,850 | ads | Ada | source/amf/dd/amf-dg-lines.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-dg-lines.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-dg-lines.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- Line is a marked element that defines a shape consisting of one straight
-- line between two points.
------------------------------------------------------------------------------
limited with AMF.DC;
with AMF.DG.Marked_Elements;
package AMF.DG.Lines is
pragma Preelaborate;
type DG_Line is limited interface
and AMF.DG.Marked_Elements.DG_Marked_Element;
type DG_Line_Access is
access all DG_Line'Class;
for DG_Line_Access'Storage_Size use 0;
not overriding function Get_Start
(Self : not null access constant DG_Line)
return AMF.DC.DC_Point is abstract;
-- Getter of Line::start.
--
-- the starting point of the line in the x-y coordinate system.
not overriding procedure Set_Start
(Self : not null access DG_Line;
To : AMF.DC.DC_Point) is abstract;
-- Setter of Line::start.
--
-- the starting point of the line in the x-y coordinate system.
not overriding function Get_End
(Self : not null access constant DG_Line)
return AMF.DC.DC_Point is abstract;
-- Getter of Line::end.
--
-- the ending point of the line in the x-y coordinate system.
not overriding procedure Set_End
(Self : not null access DG_Line;
To : AMF.DC.DC_Point) is abstract;
-- Setter of Line::end.
--
-- the ending point of the line in the x-y coordinate system.
end AMF.DG.Lines;
| 52.717391 | 78 | 0.459175 |
066dbf0ead5d65ca72ba9c566a8059cbcd287697 | 7,362 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-taskin.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-taskin.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-taskin.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with System.Task_Primitives.Operations;
-- used for Self
with System.Storage_Elements;
-- Needed for initializing Stack_Info.Size
package body System.Tasking is
package STPO renames System.Task_Primitives.Operations;
---------------------
-- Detect_Blocking --
---------------------
function Detect_Blocking return Boolean is
GL_Detect_Blocking : Integer;
pragma Import (C, GL_Detect_Blocking, "__gl_detect_blocking");
-- Global variable exported by the binder generated file.
-- A value equal to 1 indicates that pragma Detect_Blocking is active,
-- while 0 is used for the pragma not being present.
begin
return GL_Detect_Blocking = 1;
end Detect_Blocking;
----------
-- Self --
----------
function Self return Task_Id renames STPO.Self;
---------------------
-- Initialize_ATCB --
---------------------
procedure Initialize_ATCB
(Self_ID : Task_Id;
Task_Entry_Point : Task_Procedure_Access;
Task_Arg : System.Address;
Parent : Task_Id;
Elaborated : Access_Boolean;
Base_Priority : System.Any_Priority;
Task_Info : System.Task_Info.Task_Info_Type;
Stack_Size : System.Parameters.Size_Type;
T : Task_Id;
Success : out Boolean) is
begin
T.Common.State := Unactivated;
-- Initialize T.Common.LL
STPO.Initialize_TCB (T, Success);
if not Success then
return;
end if;
T.Common.Parent := Parent;
T.Common.Base_Priority := Base_Priority;
T.Common.Current_Priority := 0;
T.Common.Protected_Action_Nesting := 0;
T.Common.Call := null;
T.Common.Task_Arg := Task_Arg;
T.Common.Task_Entry_Point := Task_Entry_Point;
T.Common.Activator := Self_ID;
T.Common.Wait_Count := 0;
T.Common.Elaborated := Elaborated;
T.Common.Activation_Failed := False;
T.Common.Task_Info := Task_Info;
T.Common.Global_Task_Lock_Nesting := 0;
T.Common.Fall_Back_Handler := null;
T.Common.Specific_Handler := null;
if T.Common.Parent = null then
-- For the environment task, the adjusted stack size is
-- meaningless. For example, an unspecified Stack_Size means
-- that the stack size is determined by the environment, or
-- can grow dynamically. The Stack_Checking algorithm
-- therefore needs to use the requested size, or 0 in
-- case of an unknown size.
T.Common.Compiler_Data.Pri_Stack_Info.Size :=
Storage_Elements.Storage_Offset (Stack_Size);
else
T.Common.Compiler_Data.Pri_Stack_Info.Size :=
Storage_Elements.Storage_Offset
(Parameters.Adjust_Storage_Size (Stack_Size));
end if;
-- Link the task into the list of all tasks
T.Common.All_Tasks_Link := All_Tasks_List;
All_Tasks_List := T;
end Initialize_ATCB;
----------------
-- Initialize --
----------------
Main_Task_Image : constant String := "main_task";
-- Image of environment task
Main_Priority : Integer;
pragma Import (C, Main_Priority, "__gl_main_priority");
-- Priority for main task. Note that this is of type Integer, not
-- Priority, because we use the value -1 to indicate the default
-- main priority, and that is of course not in Priority'range.
Initialized : Boolean := False;
-- Used to prevent multiple calls to Initialize
procedure Initialize is
T : Task_Id;
Success : Boolean;
Base_Priority : Any_Priority;
begin
if Initialized then
return;
end if;
Initialized := True;
-- Initialize Environment Task
if Main_Priority = Unspecified_Priority then
Base_Priority := Default_Priority;
else
Base_Priority := Priority (Main_Priority);
end if;
Success := True;
T := STPO.New_ATCB (0);
Initialize_ATCB
(null, null, Null_Address, Null_Task, null, Base_Priority,
Task_Info.Unspecified_Task_Info, 0, T, Success);
pragma Assert (Success);
STPO.Initialize (T);
STPO.Set_Priority (T, T.Common.Base_Priority);
T.Common.State := Runnable;
T.Common.Task_Image_Len := Main_Task_Image'Length;
T.Common.Task_Image (Main_Task_Image'Range) := Main_Task_Image;
-- Only initialize the first element since others are not relevant
-- in ravenscar mode. Rest of the initialization is done in Init_RTS.
T.Entry_Calls (1).Self := T;
end Initialize;
end System.Tasking;
| 38.747368 | 78 | 0.556506 |
d042062465a060114ac1f20676dc9feaaafdb609 | 21,661 | ads | Ada | arch/ARM/STM32/svd/stm32l4x6/stm32_svd-sai.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x6/stm32_svd-sai.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x6/stm32_svd-sai.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x6.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.SAI is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype ACR1_MODE_Field is HAL.UInt2;
subtype ACR1_PRTCFG_Field is HAL.UInt2;
subtype ACR1_DS_Field is HAL.UInt3;
subtype ACR1_SYNCEN_Field is HAL.UInt2;
subtype ACR1_MCJDIV_Field is HAL.UInt4;
-- AConfiguration register 1
type ACR1_Register is record
-- Audio block mode
MODE : ACR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : ACR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : ACR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : ACR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block A enable
SAIAEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : ACR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIAEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype ACR2_FTH_Field is HAL.UInt3;
subtype ACR2_MUTECN_Field is HAL.UInt6;
subtype ACR2_COMP_Field is HAL.UInt2;
-- AConfiguration register 2
type ACR2_Register is record
-- FIFO threshold
FTH : ACR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : ACR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : ACR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype AFRCR_FRL_Field is HAL.UInt8;
subtype AFRCR_FSALL_Field is HAL.UInt7;
-- AFRCR
type AFRCR_Register is record
-- Frame length
FRL : AFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : AFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype ASLOTR_FBOFF_Field is HAL.UInt5;
subtype ASLOTR_SLOTSZ_Field is HAL.UInt2;
subtype ASLOTR_NBSLOT_Field is HAL.UInt4;
subtype ASLOTR_SLOTEN_Field is HAL.UInt16;
-- ASlot register
type ASLOTR_Register is record
-- First bit offset
FBOFF : ASLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : ASLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : ASLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : ASLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- AInterrupt mask register2
type AIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDET : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype ASR_FLVL_Field is HAL.UInt3;
-- AStatus register
type ASR_Register is record
-- Overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection
MUTEDET : Boolean := False;
-- Wrong clock configuration flag. This bit is read only
WCKCFG : Boolean := False;
-- FIFO request
FREQ : Boolean := False;
-- Codec not ready
CNRDY : Boolean := False;
-- Anticipated frame synchronization detection
AFSDET : Boolean := False;
-- Late frame synchronization detection
LFSDET : Boolean := False;
-- unspecified
Reserved_7_15 : HAL.UInt9 := 16#0#;
-- FIFO level threshold
FLVL : ASR_FLVL_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ASR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- AClear flag register
type ACLRFR_Register is record
-- Clear overrun / underrun
OVRUDR : Boolean := False;
-- Mute detection flag
MUTEDET : Boolean := False;
-- Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Clear codec not ready flag
CNRDY : Boolean := False;
-- Clear anticipated frame synchronization detection flag
CAFSDET : Boolean := False;
-- Clear late frame synchronization detection flag
LFSDET : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ACLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BCR1_MODE_Field is HAL.UInt2;
subtype BCR1_PRTCFG_Field is HAL.UInt2;
subtype BCR1_DS_Field is HAL.UInt3;
subtype BCR1_SYNCEN_Field is HAL.UInt2;
subtype BCR1_MCJDIV_Field is HAL.UInt4;
-- BConfiguration register 1
type BCR1_Register is record
-- Audio block mode
MODE : BCR1_MODE_Field := 16#0#;
-- Protocol configuration
PRTCFG : BCR1_PRTCFG_Field := 16#0#;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Data size
DS : BCR1_DS_Field := 16#2#;
-- Least significant bit first
LSBFIRST : Boolean := False;
-- Clock strobing edge
CKSTR : Boolean := False;
-- Synchronization enable
SYNCEN : BCR1_SYNCEN_Field := 16#0#;
-- Mono mode
MONO : Boolean := False;
-- Output drive
OutDri : Boolean := False;
-- unspecified
Reserved_14_15 : HAL.UInt2 := 16#0#;
-- Audio block B enable
SAIBEN : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- unspecified
Reserved_18_18 : HAL.Bit := 16#0#;
-- No divider
NODIV : Boolean := False;
-- Master clock divider
MCJDIV : BCR1_MCJDIV_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR1_Register use record
MODE at 0 range 0 .. 1;
PRTCFG at 0 range 2 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
DS at 0 range 5 .. 7;
LSBFIRST at 0 range 8 .. 8;
CKSTR at 0 range 9 .. 9;
SYNCEN at 0 range 10 .. 11;
MONO at 0 range 12 .. 12;
OutDri at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
SAIBEN at 0 range 16 .. 16;
DMAEN at 0 range 17 .. 17;
Reserved_18_18 at 0 range 18 .. 18;
NODIV at 0 range 19 .. 19;
MCJDIV at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype BCR2_FTH_Field is HAL.UInt3;
subtype BCR2_MUTECN_Field is HAL.UInt6;
subtype BCR2_COMP_Field is HAL.UInt2;
-- BConfiguration register 2
type BCR2_Register is record
-- FIFO threshold
FTH : BCR2_FTH_Field := 16#0#;
-- FIFO flush
FFLUS : Boolean := False;
-- Tristate management on data line
TRIS : Boolean := False;
-- Mute
MUTE : Boolean := False;
-- Mute value
MUTEVAL : Boolean := False;
-- Mute counter
MUTECN : BCR2_MUTECN_Field := 16#0#;
-- Complement bit
CPL : Boolean := False;
-- Companding mode
COMP : BCR2_COMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR2_Register use record
FTH at 0 range 0 .. 2;
FFLUS at 0 range 3 .. 3;
TRIS at 0 range 4 .. 4;
MUTE at 0 range 5 .. 5;
MUTEVAL at 0 range 6 .. 6;
MUTECN at 0 range 7 .. 12;
CPL at 0 range 13 .. 13;
COMP at 0 range 14 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype BFRCR_FRL_Field is HAL.UInt8;
subtype BFRCR_FSALL_Field is HAL.UInt7;
-- BFRCR
type BFRCR_Register is record
-- Frame length
FRL : BFRCR_FRL_Field := 16#7#;
-- Frame synchronization active level length
FSALL : BFRCR_FSALL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Frame synchronization definition
FSDEF : Boolean := False;
-- Frame synchronization polarity
FSPOL : Boolean := False;
-- Frame synchronization offset
FSOFF : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BFRCR_Register use record
FRL at 0 range 0 .. 7;
FSALL at 0 range 8 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
FSDEF at 0 range 16 .. 16;
FSPOL at 0 range 17 .. 17;
FSOFF at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype BSLOTR_FBOFF_Field is HAL.UInt5;
subtype BSLOTR_SLOTSZ_Field is HAL.UInt2;
subtype BSLOTR_NBSLOT_Field is HAL.UInt4;
subtype BSLOTR_SLOTEN_Field is HAL.UInt16;
-- BSlot register
type BSLOTR_Register is record
-- First bit offset
FBOFF : BSLOTR_FBOFF_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Slot size
SLOTSZ : BSLOTR_SLOTSZ_Field := 16#0#;
-- Number of slots in an audio frame
NBSLOT : BSLOTR_NBSLOT_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Slot enable
SLOTEN : BSLOTR_SLOTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSLOTR_Register use record
FBOFF at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SLOTSZ at 0 range 6 .. 7;
NBSLOT at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SLOTEN at 0 range 16 .. 31;
end record;
-- BInterrupt mask register2
type BIM_Register is record
-- Overrun/underrun interrupt enable
OVRUDRIE : Boolean := False;
-- Mute detection interrupt enable
MUTEDET : Boolean := False;
-- Wrong clock configuration interrupt enable
WCKCFG : Boolean := False;
-- FIFO request interrupt enable
FREQIE : Boolean := False;
-- Codec not ready interrupt enable
CNRDYIE : Boolean := False;
-- Anticipated frame synchronization detection interrupt enable
AFSDETIE : Boolean := False;
-- Late frame synchronization detection interrupt enable
LFSDETIE : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BIM_Register use record
OVRUDRIE at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQIE at 0 range 3 .. 3;
CNRDYIE at 0 range 4 .. 4;
AFSDETIE at 0 range 5 .. 5;
LFSDETIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype BSR_FLVL_Field is HAL.UInt3;
-- BStatus register
type BSR_Register is record
-- Read-only. Overrun / underrun
OVRUDR : Boolean;
-- Read-only. Mute detection
MUTEDET : Boolean;
-- Read-only. Wrong clock configuration flag
WCKCFG : Boolean;
-- Read-only. FIFO request
FREQ : Boolean;
-- Read-only. Codec not ready
CNRDY : Boolean;
-- Read-only. Anticipated frame synchronization detection
AFSDET : Boolean;
-- Read-only. Late frame synchronization detection
LFSDET : Boolean;
-- unspecified
Reserved_7_15 : HAL.UInt9;
-- Read-only. FIFO level threshold
FLVL : BSR_FLVL_Field;
-- unspecified
Reserved_19_31 : HAL.UInt13;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
FREQ at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
AFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
FLVL at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- BClear flag register
type BCLRFR_Register is record
-- Write-only. Clear overrun / underrun
OVRUDR : Boolean := False;
-- Write-only. Mute detection flag
MUTEDET : Boolean := False;
-- Write-only. Clear wrong clock configuration flag
WCKCFG : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Write-only. Clear codec not ready flag
CNRDY : Boolean := False;
-- Write-only. Clear anticipated frame synchronization detection flag
CAFSDET : Boolean := False;
-- Write-only. Clear late frame synchronization detection flag
LFSDET : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCLRFR_Register use record
OVRUDR at 0 range 0 .. 0;
MUTEDET at 0 range 1 .. 1;
WCKCFG at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
CNRDY at 0 range 4 .. 4;
CAFSDET at 0 range 5 .. 5;
LFSDET at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Serial audio interface
type SAI_Peripheral is record
-- AConfiguration register 1
ACR1 : aliased ACR1_Register;
-- AConfiguration register 2
ACR2 : aliased ACR2_Register;
-- AFRCR
AFRCR : aliased AFRCR_Register;
-- ASlot register
ASLOTR : aliased ASLOTR_Register;
-- AInterrupt mask register2
AIM : aliased AIM_Register;
-- AStatus register
ASR : aliased ASR_Register;
-- AClear flag register
ACLRFR : aliased ACLRFR_Register;
-- AData register
ADR : aliased HAL.UInt32;
-- BConfiguration register 1
BCR1 : aliased BCR1_Register;
-- BConfiguration register 2
BCR2 : aliased BCR2_Register;
-- BFRCR
BFRCR : aliased BFRCR_Register;
-- BSlot register
BSLOTR : aliased BSLOTR_Register;
-- BInterrupt mask register2
BIM : aliased BIM_Register;
-- BStatus register
BSR : aliased BSR_Register;
-- BClear flag register
BCLRFR : aliased BCLRFR_Register;
-- BData register
BDR : aliased HAL.UInt32;
end record
with Volatile;
for SAI_Peripheral use record
ACR1 at 16#4# range 0 .. 31;
ACR2 at 16#8# range 0 .. 31;
AFRCR at 16#C# range 0 .. 31;
ASLOTR at 16#10# range 0 .. 31;
AIM at 16#14# range 0 .. 31;
ASR at 16#18# range 0 .. 31;
ACLRFR at 16#1C# range 0 .. 31;
ADR at 16#20# range 0 .. 31;
BCR1 at 16#24# range 0 .. 31;
BCR2 at 16#28# range 0 .. 31;
BFRCR at 16#2C# range 0 .. 31;
BSLOTR at 16#30# range 0 .. 31;
BIM at 16#34# range 0 .. 31;
BSR at 16#38# range 0 .. 31;
BCLRFR at 16#3C# range 0 .. 31;
BDR at 16#40# range 0 .. 31;
end record;
-- Serial audio interface
SAI1_Periph : aliased SAI_Peripheral
with Import, Address => System'To_Address (16#40015400#);
-- Serial audio interface
SAI2_Periph : aliased SAI_Peripheral
with Import, Address => System'To_Address (16#40015800#);
end STM32_SVD.SAI;
| 34.058176 | 76 | 0.553622 |
12763f12a6759d70131b954fc3bee4fcbfbc8906 | 2,847 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cgaaso.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-cgaaso.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cgaaso.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.GENERIC_ANONYMOUS_ARRAY_SORT --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2011, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- This unit was originally a GNAT-specific addition to Ada 2005. A unit
-- providing the same feature, Ada.Containers.Generic_Sort, was defined for
-- Ada 2012. We retain Generic_Anonymous_Array_Sort for compatibility, but
-- implement it in terms of the official unit, Generic_Sort.
with Ada.Containers.Generic_Sort;
procedure Ada.Containers.Generic_Anonymous_Array_Sort
(First, Last : Index_Type'Base)
is
procedure Sort is new Ada.Containers.Generic_Sort
(Index_Type => Index_Type,
Before => Less,
Swap => Swap);
begin
Sort (First, Last);
end Ada.Containers.Generic_Anonymous_Array_Sort;
| 59.3125 | 78 | 0.454865 |
1c8a2949180ff8f76c76dcbbed52072514d62655 | 162,744 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/rtsfind.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/rtsfind.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/rtsfind.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- R T S F I N D --
-- --
-- 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 package contains the routine that is used to obtain runtime library
-- entities, loading in the required runtime library packages on demand. It
-- is also used for such purposes as finding System.Address when System has
-- not been explicitly With'ed.
with Types; use Types;
package Rtsfind is
------------------------
-- Runtime Unit Table --
------------------------
-- The following type includes an enumeration literal for each runtime
-- unit. The enumeration literal is the full expanded name of the unit
-- with "." replaced by "_". For example, the enumeration literal for
-- Ada.Interrupts.Names is Ada_Interrupts_Names
-- This list can contain both subprogram and package unit names. For
-- packages, the accessible entities in the package are separately listed
-- in the package entity table. The units must be either library level
-- package declarations, or library level subprogram declarations. Generic
-- units, library level instantiations and subprogram bodies acting as
-- specs must not be referenced. (All these cases could be added at the
-- expense of additional complexity in the body of Rtsfind, but it doesn't
-- seem worthwhile, since the implementation controls the set of units that
-- are referenced, and this restriction is easily met.)
-- IMPORTANT NOTE: the specs of packages and procedures with'ed using
-- this mechanism must not contain use clauses. This is because these
-- subprograms are compiled in the current visibility environment, and it
-- would be too much trouble to establish a clean environment for the
-- compilation. The presence of extraneous visible stuff has no effect on
-- the compilation except in the presence of use clauses, which might
-- result in unexpected ambiguities.
-- NOTE: If RTU_Id is modified, the subtypes of RTU_Id in the package body
-- might need to be modified. See Get_Unit_Name.
type RTU_Id is (
-- Runtime packages, for list of accessible entities in each package,
-- see declarations in the runtime entity table below.
RTU_Null,
-- Used as a null entry (will cause an error if referenced)
-- Package Ada
Ada,
-- Children of Ada
Ada_Calendar,
Ada_Dispatching,
Ada_Exceptions,
Ada_Finalization,
Ada_Interrupts,
Ada_Numerics,
Ada_Real_Time,
Ada_Streams,
Ada_Strings,
Ada_Synchronous_Barriers,
Ada_Synchronous_Task_Control,
Ada_Tags,
Ada_Task_Identification,
Ada_Task_Termination,
Ada_Text_IO,
Ada_Wide_Text_IO,
Ada_Wide_Wide_Text_IO,
-- Children of Ada.Calendar
Ada_Calendar_Delays,
-- Children of Ada.Dispatching
Ada_Dispatching_EDF,
-- Children of Ada.Interrupts
Ada_Interrupts_Names,
-- Children of Ada.Numerics
Ada_Numerics_Generic_Elementary_Functions,
-- Children of Ada.Real_Time
Ada_Real_Time_Delays,
Ada_Real_Time_Timing_Events,
-- Children of Ada.Streams
Ada_Streams_Stream_IO,
-- Children of Ada.Strings
Ada_Strings_Superbounded,
Ada_Strings_Wide_Superbounded,
Ada_Strings_Wide_Wide_Superbounded,
Ada_Strings_Unbounded,
Ada_Strings_Text_Output,
-- Children of Ada.Strings.Text_Output
Ada_Strings_Text_Output_Utils,
Ada_Strings_Text_Output_Buffers,
-- Children of Ada.Text_IO (for Check_Text_IO_Special_Unit)
Ada_Text_IO_Decimal_IO,
Ada_Text_IO_Enumeration_IO,
Ada_Text_IO_Fixed_IO,
Ada_Text_IO_Float_IO,
Ada_Text_IO_Integer_IO,
Ada_Text_IO_Modular_IO,
-- Children of Ada.Wide_Text_IO (for Check_Text_IO_Special_Unit)
Ada_Wide_Text_IO_Decimal_IO,
Ada_Wide_Text_IO_Enumeration_IO,
Ada_Wide_Text_IO_Fixed_IO,
Ada_Wide_Text_IO_Float_IO,
Ada_Wide_Text_IO_Integer_IO,
Ada_Wide_Text_IO_Modular_IO,
-- Children of Ada.Wide_Wide_Text_IO (for Check_Text_IO_Special_Unit)
Ada_Wide_Wide_Text_IO_Decimal_IO,
Ada_Wide_Wide_Text_IO_Enumeration_IO,
Ada_Wide_Wide_Text_IO_Fixed_IO,
Ada_Wide_Wide_Text_IO_Float_IO,
Ada_Wide_Wide_Text_IO_Integer_IO,
Ada_Wide_Wide_Text_IO_Modular_IO,
-- Package CUDA
CUDA,
-- Children of CUDA
CUDA_Driver_Types,
CUDA_Internal,
CUDA_Runtime_Api,
CUDA_Vector_Types,
-- Interfaces
Interfaces,
-- Children of Interfaces
Interfaces_C,
Interfaces_Packed_Decimal,
-- Children of Interfaces.C
Interfaces_C_Strings,
-- Package System
System,
-- Children of System
System_Address_Image,
System_Address_To_Access_Conversions,
System_Arith_64,
System_AST_Handling,
System_Assertions,
System_Atomic_Primitives,
System_Aux_DEC,
System_Bignums,
System_Bitfields,
System_Bit_Ops,
System_Boolean_Array_Operations,
System_Byte_Swapping,
System_Checked_Pools,
System_Compare_Array_Signed_16,
System_Compare_Array_Signed_32,
System_Compare_Array_Signed_64,
System_Compare_Array_Signed_8,
System_Compare_Array_Unsigned_16,
System_Compare_Array_Unsigned_32,
System_Compare_Array_Unsigned_64,
System_Compare_Array_Unsigned_8,
System_Concat_2,
System_Concat_3,
System_Concat_4,
System_Concat_5,
System_Concat_6,
System_Concat_7,
System_Concat_8,
System_Concat_9,
System_Dim,
System_DSA_Services,
System_DSA_Types,
System_Elaboration_Allocators,
System_Exception_Table,
System_Exceptions_Debug,
System_Exn_Int,
System_Exn_LLF,
System_Exn_LLI,
System_Exp_Int,
System_Exp_LInt,
System_Exp_LLI,
System_Exp_LLU,
System_Exp_Mod,
System_Exp_Uns,
System_Fat_Flt,
System_Fat_IEEE_Long_Float,
System_Fat_IEEE_Short_Float,
System_Fat_LFlt,
System_Fat_LLF,
System_Fat_SFlt,
System_Fat_VAX_D_Float,
System_Fat_VAX_F_Float,
System_Fat_VAX_G_Float,
System_Finalization_Masters,
System_Finalization_Root,
System_Fore,
System_Img_Bool,
System_Img_Char,
System_Img_Dec,
System_Img_Enum,
System_Img_Enum_New,
System_Img_Int,
System_Img_LLD,
System_Img_LLI,
System_Img_LLU,
System_Img_Name,
System_Img_Real,
System_Img_Uns,
System_Img_WChar,
System_Interrupts,
System_Long_Long_Float_Expon,
System_Machine_Code,
System_Mantissa,
System_Memcop,
System_Memory,
System_Multiprocessors,
System_Pack_03,
System_Pack_05,
System_Pack_06,
System_Pack_07,
System_Pack_09,
System_Pack_10,
System_Pack_11,
System_Pack_12,
System_Pack_13,
System_Pack_14,
System_Pack_15,
System_Pack_17,
System_Pack_18,
System_Pack_19,
System_Pack_20,
System_Pack_21,
System_Pack_22,
System_Pack_23,
System_Pack_24,
System_Pack_25,
System_Pack_26,
System_Pack_27,
System_Pack_28,
System_Pack_29,
System_Pack_30,
System_Pack_31,
System_Pack_33,
System_Pack_34,
System_Pack_35,
System_Pack_36,
System_Pack_37,
System_Pack_38,
System_Pack_39,
System_Pack_40,
System_Pack_41,
System_Pack_42,
System_Pack_43,
System_Pack_44,
System_Pack_45,
System_Pack_46,
System_Pack_47,
System_Pack_48,
System_Pack_49,
System_Pack_50,
System_Pack_51,
System_Pack_52,
System_Pack_53,
System_Pack_54,
System_Pack_55,
System_Pack_56,
System_Pack_57,
System_Pack_58,
System_Pack_59,
System_Pack_60,
System_Pack_61,
System_Pack_62,
System_Pack_63,
System_Parameters,
System_Partition_Interface,
System_Pool_32_Global,
System_Pool_Global,
System_Pool_Empty,
System_Pool_Local,
System_Pool_Size,
System_Put_Images,
System_Put_Task_Images,
System_Relative_Delays,
System_RPC,
System_Scalar_Values,
System_Secondary_Stack,
System_Shared_Storage,
System_Soft_Links,
System_Standard_Library,
System_Storage_Elements,
System_Storage_Pools,
System_Stream_Attributes,
System_Task_Info,
System_Tasking,
System_Threads,
System_Unsigned_Types,
System_Val_Bool,
System_Val_Char,
System_Val_Dec,
System_Val_Enum,
System_Val_Int,
System_Val_LLD,
System_Val_LLI,
System_Val_LLU,
System_Val_Name,
System_Val_Real,
System_Val_Uns,
System_Val_WChar,
System_Version_Control,
System_WCh_StW,
System_WCh_WtS,
System_Wid_Bool,
System_Wid_Char,
System_Wid_Enum,
System_Wid_LLI,
System_Wid_LLU,
System_Wid_Name,
System_Wid_WChar,
System_WWd_Char,
System_WWd_Enum,
System_WWd_Wchar,
-- Children of System.Dim
System_Dim_Float_IO,
System_Dim_Integer_IO,
-- Children of System.Multiprocessors
System_Multiprocessors_Dispatching_Domains,
-- Children of System.Storage_Pools
System_Storage_Pools_Subpools,
-- Children of System.Strings
System_Strings_Stream_Ops,
-- Children of System.Tasking
System_Tasking_Async_Delays,
System_Tasking_Async_Delays_Enqueue_Calendar,
System_Tasking_Async_Delays_Enqueue_RT,
System_Tasking_Protected_Objects,
System_Tasking_Protected_Objects_Entries,
System_Tasking_Protected_Objects_Operations,
System_Tasking_Protected_Objects_Single_Entry,
System_Tasking_Restricted_Stages,
System_Tasking_Rendezvous,
System_Tasking_Stages);
--------------------------
-- Runtime Entity Table --
--------------------------
-- This is the enumeration type used to define the argument passed to
-- the RTE function. The name must exactly match the name of the entity
-- involved, and in the case of a package entity, this name must uniquely
-- imply the package containing the entity.
-- As far as possible, we avoid duplicate names in runtime packages, so
-- that the name RE_nnn uniquely identifies the entity nnn. In some cases,
-- it is impossible to avoid such duplication because the names come from
-- RM defined packages. In such cases, the name is of the form RO_XX_nnn
-- where XX is two letters used to differentiate the multiple occurrences
-- of the name xx, and nnn is the entity name.
-- Note that not all entities in the units contained in the run-time unit
-- table are included in the following table, only those that actually
-- have to be referenced from generated code.
-- Note on RE_Null. This value is used as a null entry where an RE_Id
-- value is required syntactically, but no real entry is required or
-- needed. Use of this value will cause a fatal error in an RTE call.
-- Note that under no circumstances can any of these entities be defined
-- more than once in a given package, i.e. no overloading is allowed for
-- any entity that is found using rtsfind. A fatal error is given if this
-- rule is violated. The one exception is for Save_Occurrence, where the
-- RM mandates the overloading. In this case, the compiler only uses the
-- procedure, not the function, and the procedure must come first so that
-- the compiler finds it and not the function.
type RE_Id is (
RE_Null,
RO_CA_Clock_Time, -- Ada.Calendar
RO_CA_Time, -- Ada.Calendar
RO_CA_Delay_For, -- Ada.Calendar.Delays
RO_CA_Delay_Until, -- Ada.Calendar.Delays
RO_CA_To_Duration, -- Ada.Calendar.Delays
RE_Yield, -- Ada_Dispatching
RE_Set_Deadline, -- Ada.Dispatching.EDF
RE_Code_Loc, -- Ada.Exceptions
RE_Exception_Id, -- Ada.Exceptions
RE_Exception_Identity, -- Ada.Exceptions
RE_Exception_Information, -- Ada.Exceptions
RE_Exception_Message, -- Ada.Exceptions
RE_Exception_Name_Simple, -- Ada.Exceptions
RE_Exception_Occurrence, -- Ada.Exceptions
RE_Exception_Occurrence_Access, -- Ada.Exceptions
RE_Null_Id, -- Ada.Exceptions
RE_Null_Occurrence, -- Ada.Exceptions
RE_Poll, -- Ada.Exceptions
RE_Raise_Exception, -- Ada.Exceptions
RE_Raise_Exception_Always, -- Ada.Exceptions
RE_Raise_From_Controlled_Operation, -- Ada.Exceptions
RE_Reraise_Occurrence, -- Ada.Exceptions
RE_Reraise_Occurrence_Always, -- Ada.Exceptions
RE_Reraise_Occurrence_No_Defer, -- Ada.Exceptions
RE_Save_Occurrence, -- Ada.Exceptions
RE_Triggered_By_Abort, -- Ada.Exceptions
RE_Interrupt_ID, -- Ada.Interrupts
RE_Is_Reserved, -- Ada.Interrupts
RE_Is_Attached, -- Ada.Interrupts
RE_Current_Handler, -- Ada.Interrupts
RE_Attach_Handler, -- Ada.Interrupts
RE_Exchange_Handler, -- Ada.Interrupts
RE_Detach_Handler, -- Ada.Interrupts
RE_Reference, -- Ada.Interrupts
RE_Names, -- Ada.Interrupts.Names
RE_Clock, -- Ada.Real_Time
RE_Clock_Time, -- Ada.Real_Time
RE_Time_Span, -- Ada.Real_Time
RE_Time_Span_Zero, -- Ada.Real_Time
RO_RT_Time, -- Ada.Real_Time
RO_RT_Delay_Until, -- Ada.Real_Time.Delays
RO_RT_To_Duration, -- Ada.Real_Time.Delays
RE_Set_Handler, -- Ada.Real_Time.Timing_Events
RE_Timing_Event, -- Ada.Real_Time.Timing_Events
RE_Root_Stream_Type, -- Ada.Streams
RE_Stream_Element, -- Ada.Streams
RE_Stream_Element_Array, -- Ada.Streams
RE_Stream_Element_Offset, -- Ada.Streams
RE_Stream_Access, -- Ada.Streams.Stream_IO
RO_SU_Super_String, -- Ada.Strings.Superbounded
RO_WI_Super_String, -- Ada.Strings.Wide_Superbounded
RO_WW_Super_String, -- Ada.Strings.Wide_Wide_Superbounded
RE_Unbounded_String, -- Ada.Strings.Unbounded
RE_Sink, -- Ada.Strings.Text_Output
RE_Put_UTF_8, -- Ada.Strings.Text_Output.Utils
RE_Put_Wide_Wide_String, -- Ada.Strings.Text_Output.Utils
RE_Buffer, -- Ada.Strings.Text_Output.Buffers
RE_New_Buffer, -- Ada.Strings.Text_Output.Buffers
RE_Destroy, -- Ada.Strings.Text_Output.Buffers
RE_Get, -- Ada.Strings.Text_Output.Buffers
RE_Wait_For_Release, -- Ada.Synchronous_Barriers
RE_Suspend_Until_True, -- Ada.Synchronous_Task_Control
RE_Access_Level, -- Ada.Tags
RE_Alignment, -- Ada.Tags
RE_Address_Array, -- Ada.Tags
RE_Addr_Ptr, -- Ada.Tags
RE_Base_Address, -- Ada.Tags
RE_Check_Interface_Conversion, -- Ada.Tags
RE_Check_TSD, -- Ada.Tags
RE_Cstring_Ptr, -- Ada.Tags
RE_CW_Membership, -- Ada.Tags
RE_Descendant_Tag, -- Ada.Tags
RE_Dispatch_Table, -- Ada.Tags
RE_Dispatch_Table_Wrapper, -- Ada.Tags
RE_Displace, -- Ada.Tags
RE_DT, -- Ada.Tags
RE_DT_Offset_To_Top_Offset, -- Ada.Tags
RE_DT_Predef_Prims_Offset, -- Ada.Tags
RE_DT_Typeinfo_Ptr_Size, -- Ada.Tags
RE_External_Tag, -- Ada.Tags
RO_TA_External_Tag, -- Ada.Tags
RE_Get_Access_Level, -- Ada.Tags
RE_Get_Alignment, -- Ada.Tags
RE_Get_Entry_Index, -- Ada.Tags
RE_Get_Offset_Index, -- Ada.Tags
RE_Get_Prim_Op_Kind, -- Ada.Tags
RE_Get_Tagged_Kind, -- Ada.Tags
RE_HT_Link, -- Ada.Tags
RE_Idepth, -- Ada.Tags
RE_Interfaces_Array, -- Ada.Tags
RE_Interfaces_Table, -- Ada.Tags
RE_Interface_Data, -- Ada.Tags
RE_Interface_Data_Element, -- Ada.Tags
RE_Interface_Tag, -- Ada.Tags
RE_Is_Abstract, -- Ada.Tags
RE_IW_Membership, -- Ada.Tags
RE_Max_Predef_Prims, -- Ada.Tags
RE_Needs_Finalization, -- Ada.Tags
RE_No_Dispatch_Table_Wrapper, -- Ada.Tags
RE_No_Tag, -- Ada.Tags
RE_NDT_Prims_Ptr, -- Ada.Tags
RE_NDT_TSD, -- Ada.Tags
RE_Num_Prims, -- Ada.Tags
RE_Object_Specific_Data, -- Ada.Tags
RE_Offset_To_Top, -- Ada.Tags
RE_Offset_To_Top_Ptr, -- Ada.Tags
RE_Offset_To_Top_Function_Ptr, -- Ada.Tags
RE_OSD_Table, -- Ada.Tags
RE_OSD_Num_Prims, -- Ada.Tags
RE_POK_Function, -- Ada.Tags
RE_POK_Procedure, -- Ada.Tags
RE_POK_Protected_Entry, -- Ada.Tags
RE_POK_Protected_Function, -- Ada.Tags
RE_POK_Protected_Procedure, -- Ada.Tags
RE_POK_Task_Entry, -- Ada.Tags
RE_POK_Task_Function, -- Ada.Tags
RE_POK_Task_Procedure, -- Ada.Tags
RE_Predef_Prims, -- Ada.Tags
RE_Predef_Prims_Table_Ptr, -- Ada.Tags
RE_Prim_Op_Kind, -- Ada.Tags
RE_Prim_Ptr, -- Ada.Tags
RE_Prims_Ptr, -- Ada.Tags
RE_Primary_DT, -- Ada.Tags
RE_Signature, -- Ada.Tags
RE_SSD, -- Ada.Tags
RE_TSD, -- Ada.Tags
RE_Type_Specific_Data, -- Ada.Tags
RE_Register_Interface_Offset, -- Ada.Tags
RE_Register_Tag, -- Ada.Tags
RE_Register_TSD, -- Ada.Tags
RE_Transportable, -- Ada.Tags
RE_Secondary_DT, -- Ada.Tags
RE_Secondary_Tag, -- Ada.Tags
RE_Select_Specific_Data, -- Ada.Tags
RE_Set_Entry_Index, -- Ada.Tags
RE_Set_Dynamic_Offset_To_Top, -- Ada.Tags
RE_Set_Prim_Op_Kind, -- Ada.Tags
RE_Size_Func, -- Ada.Tags
RE_Size_Ptr, -- Ada.Tags
RE_Tag, -- Ada.Tags
RE_Tag_Error, -- Ada.Tags
RE_Tag_Kind, -- Ada.Tags
RE_Tag_Ptr, -- Ada.Tags
RE_Tag_Table, -- Ada.Tags
RE_Tags_Table, -- Ada.Tags
RE_Tagged_Kind, -- Ada.Tags
RE_Type_Specific_Data_Ptr, -- Ada.Tags
RE_TK_Abstract_Limited_Tagged, -- Ada.Tags
RE_TK_Abstract_Tagged, -- Ada.Tags
RE_TK_Limited_Tagged, -- Ada.Tags
RE_TK_Protected, -- Ada.Tags
RE_TK_Tagged, -- Ada.Tags
RE_TK_Task, -- Ada.Tags
RE_Unregister_Tag, -- Ada.Tags
RE_Set_Specific_Handler, -- Ada.Task_Termination
RE_Specific_Handler, -- Ada.Task_Termination
RE_Abort_Task, -- Ada.Task_Identification
RE_Current_Task, -- Ada.Task_Identification
RO_AT_Task_Id, -- Ada.Task_Identification
RE_Tasking_State, -- Ada.Task_Identification
RE_Decimal_IO, -- Ada.Text_IO
RE_Fixed_IO, -- Ada.Text_IO
RO_WT_Decimal_IO, -- Ada.Wide_Text_IO
RO_WT_Fixed_IO, -- Ada.Wide_Text_IO
RO_WW_Decimal_IO, -- Ada.Wide_Wide_Text_IO
RO_WW_Fixed_IO, -- Ada.Wide_Wide_Text_IO
RE_Stream_T, -- CUDA.Driver_Types
RE_Fatbin_Wrapper, -- CUDA.Internal
RE_Push_Call_Configuration, -- CUDA.Internal
RE_Pop_Call_Configuration, -- CUDA.Internal
RE_Register_Fat_Binary, -- CUDA.Internal
RE_Register_Fat_Binary_End, -- CUDA.Internal
RE_Register_Function, -- CUDA.Internal
RE_Launch_Kernel, -- CUDA.Runtime_Api
RE_Dim3, -- CUDA.Vector_Types
RE_Integer_8, -- Interfaces
RE_Integer_16, -- Interfaces
RE_Integer_32, -- Interfaces
RE_Integer_64, -- Interfaces
RE_Unsigned_8, -- Interfaces
RE_Unsigned_16, -- Interfaces
RE_Unsigned_32, -- Interfaces
RE_Unsigned_64, -- Interfaces
RO_IC_Unsigned, -- Interfaces.C
RO_IC_Unsigned_Long_Long, -- Interfaces.C
RE_Chars_Ptr, -- Interfaces.C.Strings
RE_New_Char_Array, -- Interfaces.C.Strings
RE_Address, -- System
RE_Any_Priority, -- System
RE_Bit_Order, -- System
RE_Default_Priority, -- System
RE_High_Order_First, -- System
RE_Interrupt_Priority, -- System
RE_Lib_Stop, -- System
RE_Low_Order_First, -- System
RE_Max_Base_Digits, -- System
RE_Max_Priority, -- System
RE_Null_Address, -- System
RE_Priority, -- System
RE_Address_Image, -- System.Address_Image
RE_Add_With_Ovflo_Check, -- System.Arith_64
RE_Double_Divide, -- System.Arith_64
RE_Multiply_With_Ovflo_Check, -- System.Arith_64
RE_Scaled_Divide, -- System.Arith_64
RE_Subtract_With_Ovflo_Check, -- System.Arith_64
RE_Create_AST_Handler, -- System.AST_Handling
RE_Assert_Failure, -- System.Assertions
RE_Raise_Assert_Failure, -- System.Assertions
RE_Lock_Free_Read_8, -- System.Atomic_Primitives
RE_Lock_Free_Read_16, -- System.Atomic_Primitives
RE_Lock_Free_Read_32, -- System.Atomic_Primitives
RE_Lock_Free_Read_64, -- System.Atomic_Primitives
RE_Lock_Free_Try_Write_8, -- System.Atomic_Primitives
RE_Lock_Free_Try_Write_16, -- System.Atomic_Primitives
RE_Lock_Free_Try_Write_32, -- System.Atomic_Primitives
RE_Lock_Free_Try_Write_64, -- System.Atomic_Primitives
RE_Uint8, -- System.Atomic_Primitives
RE_Uint16, -- System.Atomic_Primitives
RE_Uint32, -- System.Atomic_Primitives
RE_Uint64, -- System.Atomic_Primitives
RE_AST_Handler, -- System.Aux_DEC
RE_Import_Address, -- System.Aux_DEC
RE_Import_Value, -- System.Aux_DEC
RE_No_AST_Handler, -- System.Aux_DEC
RE_Type_Class, -- System.Aux_DEC
RE_Type_Class_Enumeration, -- System.Aux_DEC
RE_Type_Class_Integer, -- System.Aux_DEC
RE_Type_Class_Fixed_Point, -- System.Aux_DEC
RE_Type_Class_Floating_Point, -- System.Aux_DEC
RE_Type_Class_Array, -- System.Aux_DEC
RE_Type_Class_Record, -- System.Aux_DEC
RE_Type_Class_Access, -- System.Aux_DEC
RE_Type_Class_Task, -- System.Aux_DEC
RE_Type_Class_Address, -- System.Aux_DEC
RE_Big_Abs, -- System.Bignums
RE_Big_Add, -- System.Bignums
RE_Big_Div, -- System.Bignums
RE_Big_Exp, -- System.Bignums
RE_Big_Mod, -- System.Bignums
RE_Big_Mul, -- System.Bignums
RE_Big_Neg, -- System.Bignums
RE_Big_Rem, -- System.Bignums
RE_Big_Sub, -- System.Bignums
RE_Big_EQ, -- System.Bignums
RE_Big_GE, -- System.Bignums
RE_Big_GT, -- System.Bignums
RE_Big_LE, -- System.Bignums
RE_Big_LT, -- System.Bignums
RE_Big_NE, -- System.Bignums
RE_Bignum, -- System.Bignums
RE_Bignum_In_LLI_Range, -- System.Bignums
RE_To_Bignum, -- System.Bignums
RE_From_Bignum, -- System.Bignums
RE_Copy_Bitfield, -- System.Bitfields
RE_Bit_And, -- System.Bit_Ops
RE_Bit_Eq, -- System.Bit_Ops
RE_Bit_Not, -- System.Bit_Ops
RE_Bit_Or, -- System.Bit_Ops
RE_Bit_Xor, -- System.Bit_Ops
RE_Vector_Not, -- System.Boolean_Array_Operations,
RE_Vector_And, -- System.Boolean_Array_Operations,
RE_Vector_Or, -- System.Boolean_Array_Operations,
RE_Vector_Nand, -- System.Boolean_Array_Operations,
RE_Vector_Nor, -- System.Boolean_Array_Operations,
RE_Vector_Nxor, -- System.Boolean_Array_Operations,
RE_Vector_Xor, -- System.Boolean_Array_Operations,
RE_Bswap_16, -- System.Byte_Swapping
RE_Bswap_32, -- System.Byte_Swapping
RE_Bswap_64, -- System.Byte_Swapping
RE_Checked_Pool, -- System.Checked_Pools
RE_Compare_Array_S8, -- System.Compare_Array_Signed_8
RE_Compare_Array_S8_Unaligned, -- System.Compare_Array_Signed_8
RE_Compare_Array_S16, -- System.Compare_Array_Signed_16
RE_Compare_Array_S32, -- System.Compare_Array_Signed_16
RE_Compare_Array_S64, -- System.Compare_Array_Signed_16
RE_Compare_Array_U8, -- System.Compare_Array_Unsigned_8
RE_Compare_Array_U8_Unaligned, -- System.Compare_Array_Unsigned_8
RE_Compare_Array_U16, -- System.Compare_Array_Unsigned_16
RE_Compare_Array_U32, -- System.Compare_Array_Unsigned_16
RE_Compare_Array_U64, -- System.Compare_Array_Unsigned_16
RE_Str_Concat_2, -- System.Concat_2
RE_Str_Concat_3, -- System.Concat_3
RE_Str_Concat_4, -- System.Concat_4
RE_Str_Concat_5, -- System.Concat_5
RE_Str_Concat_6, -- System.Concat_6
RE_Str_Concat_7, -- System.Concat_7
RE_Str_Concat_8, -- System.Concat_8
RE_Str_Concat_9, -- System.Concat_9
RE_Str_Concat_Bounds_2, -- System.Concat_2
RE_Str_Concat_Bounds_3, -- System.Concat_3
RE_Str_Concat_Bounds_4, -- System.Concat_4
RE_Str_Concat_Bounds_5, -- System.Concat_5
RE_Str_Concat_Bounds_6, -- System.Concat_6
RE_Str_Concat_Bounds_7, -- System.Concat_7
RE_Str_Concat_Bounds_8, -- System.Concat_8
RE_Str_Concat_Bounds_9, -- System.Concat_9
RE_Get_Active_Partition_Id, -- System.DSA_Services
RE_Get_Local_Partition_Id, -- System.DSA_Services
RE_Get_Passive_Partition_Id, -- System.DSA_Services
RE_Any_Container_Ptr, -- System.DSA_Types
RE_Check_Standard_Allocator, -- System.Elaboration_Allocators
RE_Register_Exception, -- System.Exception_Table
RE_Local_Raise, -- System.Exceptions_Debug
RE_Exn_Integer, -- System.Exn_Int
RE_Exn_Float, -- System.Exn_LLF
RE_Exn_Long_Float, -- System.Exn_LLF
RE_Exn_Long_Long_Float, -- System.Exn_LLF
RE_Exn_Long_Long_Integer, -- System.Exn_LLI
RE_Exp_Integer, -- System.Exp_Int
RE_Exp_Long_Long_Integer, -- System.Exp_LLI
RE_Exp_Long_Long_Unsigned, -- System.Exp_LLU
RE_Exp_Modular, -- System.Exp_Mod
RE_Exp_Unsigned, -- System.Exp_Uns
RE_Attr_Float, -- System.Fat_Flt
RE_Attr_IEEE_Long, -- System.Fat_IEEE_Long_Float
RE_Fat_IEEE_Long, -- System.Fat_IEEE_Long_Float
RE_Attr_IEEE_Short, -- System.Fat_IEEE_Short_Float
RE_Fat_IEEE_Short, -- System.Fat_IEEE_Short_Float
RE_Attr_Long_Float, -- System.Fat_LFlt
RE_Attr_Long_Long_Float, -- System.Fat_LLF
RE_Attr_Short_Float, -- System.Fat_SFlt
RE_Attr_VAX_D_Float, -- System.Fat_VAX_D_Float
RE_Fat_VAX_D, -- System.Fat_VAX_D_Float
RE_Attr_VAX_F_Float, -- System.Fat_VAX_F_Float
RE_Fat_VAX_F, -- System.Fat_VAX_F_Float
RE_Attr_VAX_G_Float, -- System.Fat_VAX_G_Float
RE_Fat_VAX_G, -- System.Fat_VAX_G_Float
RE_Add_Offset_To_Address, -- System.Finalization_Masters
RE_Attach, -- System.Finalization_Masters
RE_Base_Pool, -- System.Finalization_Masters
RE_Detach, -- System.Finalization_Masters
RE_Finalization_Master, -- System.Finalization_Masters
RE_Finalization_Master_Ptr, -- System.Finalization_Masters
RE_Set_Base_Pool, -- System.Finalization_Masters
RE_Set_Finalize_Address, -- System.Finalization_Masters
RE_Set_Is_Heterogeneous, -- System.Finalization_Masters
RE_Root_Controlled, -- System.Finalization_Root
RE_Root_Controlled_Ptr, -- System.Finalization_Root
RE_Fore, -- System.Fore
RE_Image_Boolean, -- System.Img_Bool
RE_Image_Character, -- System.Img_Char
RE_Image_Character_05, -- System.Img_Char
RE_Image_Decimal, -- System.Img_Dec
RE_Image_Enumeration_8, -- System.Img_Enum_New
RE_Image_Enumeration_16, -- System.Img_Enum_New
RE_Image_Enumeration_32, -- System.Img_Enum_New
RE_Image_Integer, -- System.Img_Int
RE_Image_Long_Long_Decimal, -- System.Img_LLD
RE_Image_Long_Long_Integer, -- System.Img_LLI
RE_Image_Long_Long_Unsigned, -- System.Img_LLU
RE_Image_Ordinary_Fixed_Point, -- System.Img_Real
RE_Image_Floating_Point, -- System.Img_Real
RE_Image_Unsigned, -- System.Img_Uns
RE_Image_Wide_Character, -- System.Img_WChar
RE_Image_Wide_Wide_Character, -- System.Img_WChar
RE_Bind_Interrupt_To_Entry, -- System.Interrupts
RE_Default_Interrupt_Priority, -- System.Interrupts
RE_Dynamic_Interrupt_Protection, -- System.Interrupts
RE_Install_Handlers, -- System.Interrupts
RE_Install_Restricted_Handlers, -- System.Interrupts
RE_Register_Interrupt_Handler, -- System.Interrupts
RE_Static_Interrupt_Protection, -- System.Interrupts
RE_System_Interrupt_Id, -- System.Interrupts
RE_Expon_LLF, -- System.Long_Long_Float_Expon
RE_Asm_Insn, -- System.Machine_Code
RE_Asm_Input_Operand, -- System.Machine_Code
RE_Asm_Output_Operand, -- System.Machine_Code
RE_Mantissa_Value, -- System.Mantissa
RE_Free, -- System.Memory
RE_CPU_Range, -- System.Multiprocessors
RE_Bits_03, -- System.Pack_03
RE_Get_03, -- System.Pack_03
RE_Set_03, -- System.Pack_03
RE_Bits_05, -- System.Pack_05
RE_Get_05, -- System.Pack_05
RE_Set_05, -- System.Pack_05
RE_Bits_06, -- System.Pack_06
RE_Get_06, -- System.Pack_06
RE_GetU_06, -- System.Pack_06
RE_Set_06, -- System.Pack_06
RE_SetU_06, -- System.Pack_06
RE_Bits_07, -- System.Pack_07
RE_Get_07, -- System.Pack_07
RE_Set_07, -- System.Pack_07
RE_Bits_09, -- System.Pack_09
RE_Get_09, -- System.Pack_09
RE_Set_09, -- System.Pack_09
RE_Bits_10, -- System.Pack_10
RE_Get_10, -- System.Pack_10
RE_GetU_10, -- System.Pack_10
RE_Set_10, -- System.Pack_10
RE_SetU_10, -- System.Pack_10
RE_Bits_11, -- System.Pack_11
RE_Get_11, -- System.Pack_11
RE_Set_11, -- System.Pack_11
RE_Bits_12, -- System.Pack_12
RE_Get_12, -- System.Pack_12
RE_GetU_12, -- System.Pack_12
RE_Set_12, -- System.Pack_12
RE_SetU_12, -- System.Pack_12
RE_Bits_13, -- System.Pack_13
RE_Get_13, -- System.Pack_13
RE_Set_13, -- System.Pack_13
RE_Bits_14, -- System.Pack_14
RE_Get_14, -- System.Pack_14
RE_GetU_14, -- System.Pack_14
RE_Set_14, -- System.Pack_14
RE_SetU_14, -- System.Pack_14
RE_Bits_15, -- System.Pack_15
RE_Get_15, -- System.Pack_15
RE_Set_15, -- System.Pack_15
RE_Bits_17, -- System.Pack_17
RE_Get_17, -- System.Pack_17
RE_Set_17, -- System.Pack_17
RE_Bits_18, -- System.Pack_18
RE_Get_18, -- System.Pack_18
RE_GetU_18, -- System.Pack_18
RE_Set_18, -- System.Pack_18
RE_SetU_18, -- System.Pack_18
RE_Bits_19, -- System.Pack_19
RE_Get_19, -- System.Pack_19
RE_Set_19, -- System.Pack_19
RE_Bits_20, -- System.Pack_20
RE_Get_20, -- System.Pack_20
RE_GetU_20, -- System.Pack_20
RE_Set_20, -- System.Pack_20
RE_SetU_20, -- System.Pack_20
RE_Bits_21, -- System.Pack_21
RE_Get_21, -- System.Pack_21
RE_Set_21, -- System.Pack_21
RE_Bits_22, -- System.Pack_22
RE_Get_22, -- System.Pack_22
RE_GetU_22, -- System.Pack_22
RE_Set_22, -- System.Pack_22
RE_SetU_22, -- System.Pack_22
RE_Bits_23, -- System.Pack_23
RE_Get_23, -- System.Pack_23
RE_Set_23, -- System.Pack_23
RE_Bits_24, -- System.Pack_24
RE_Get_24, -- System.Pack_24
RE_GetU_24, -- System.Pack_24
RE_Set_24, -- System.Pack_24
RE_SetU_24, -- System.Pack_24
RE_Bits_25, -- System.Pack_25
RE_Get_25, -- System.Pack_25
RE_Set_25, -- System.Pack_25
RE_Bits_26, -- System.Pack_26
RE_Get_26, -- System.Pack_26
RE_GetU_26, -- System.Pack_26
RE_Set_26, -- System.Pack_26
RE_SetU_26, -- System.Pack_26
RE_Bits_27, -- System.Pack_27
RE_Get_27, -- System.Pack_27
RE_Set_27, -- System.Pack_27
RE_Bits_28, -- System.Pack_28
RE_Get_28, -- System.Pack_28
RE_GetU_28, -- System.Pack_28
RE_Set_28, -- System.Pack_28
RE_SetU_28, -- System.Pack_28
RE_Bits_29, -- System.Pack_29
RE_Get_29, -- System.Pack_29
RE_Set_29, -- System.Pack_29
RE_Bits_30, -- System.Pack_30
RE_Get_30, -- System.Pack_30
RE_GetU_30, -- System.Pack_30
RE_Set_30, -- System.Pack_30
RE_SetU_30, -- System.Pack_30
RE_Bits_31, -- System.Pack_31
RE_Get_31, -- System.Pack_31
RE_Set_31, -- System.Pack_31
RE_Bits_33, -- System.Pack_33
RE_Get_33, -- System.Pack_33
RE_Set_33, -- System.Pack_33
RE_Bits_34, -- System.Pack_34
RE_Get_34, -- System.Pack_34
RE_GetU_34, -- System.Pack_34
RE_Set_34, -- System.Pack_34
RE_SetU_34, -- System.Pack_34
RE_Bits_35, -- System.Pack_35
RE_Get_35, -- System.Pack_35
RE_Set_35, -- System.Pack_35
RE_Bits_36, -- System.Pack_36
RE_Get_36, -- System.Pack_36
RE_GetU_36, -- System.Pack_36
RE_Set_36, -- System.Pack_36
RE_SetU_36, -- System.Pack_36
RE_Bits_37, -- System.Pack_37
RE_Get_37, -- System.Pack_37
RE_Set_37, -- System.Pack_37
RE_Bits_38, -- System.Pack_38
RE_Get_38, -- System.Pack_38
RE_GetU_38, -- System.Pack_38
RE_Set_38, -- System.Pack_38
RE_SetU_38, -- System.Pack_38
RE_Bits_39, -- System.Pack_39
RE_Get_39, -- System.Pack_39
RE_Set_39, -- System.Pack_39
RE_Bits_40, -- System.Pack_40
RE_Get_40, -- System.Pack_40
RE_GetU_40, -- System.Pack_40
RE_Set_40, -- System.Pack_40
RE_SetU_40, -- System.Pack_40
RE_Bits_41, -- System.Pack_41
RE_Get_41, -- System.Pack_41
RE_Set_41, -- System.Pack_41
RE_Bits_42, -- System.Pack_42
RE_Get_42, -- System.Pack_42
RE_GetU_42, -- System.Pack_42
RE_Set_42, -- System.Pack_42
RE_SetU_42, -- System.Pack_42
RE_Bits_43, -- System.Pack_43
RE_Get_43, -- System.Pack_43
RE_Set_43, -- System.Pack_43
RE_Bits_44, -- System.Pack_44
RE_Get_44, -- System.Pack_44
RE_GetU_44, -- System.Pack_44
RE_Set_44, -- System.Pack_44
RE_SetU_44, -- System.Pack_44
RE_Bits_45, -- System.Pack_45
RE_Get_45, -- System.Pack_45
RE_Set_45, -- System.Pack_45
RE_Bits_46, -- System.Pack_46
RE_Get_46, -- System.Pack_46
RE_GetU_46, -- System.Pack_46
RE_Set_46, -- System.Pack_46
RE_SetU_46, -- System.Pack_46
RE_Bits_47, -- System.Pack_47
RE_Get_47, -- System.Pack_47
RE_Set_47, -- System.Pack_47
RE_Bits_48, -- System.Pack_48
RE_Get_48, -- System.Pack_48
RE_GetU_48, -- System.Pack_48
RE_Set_48, -- System.Pack_48
RE_SetU_48, -- System.Pack_48
RE_Bits_49, -- System.Pack_49
RE_Get_49, -- System.Pack_49
RE_Set_49, -- System.Pack_49
RE_Bits_50, -- System.Pack_50
RE_Get_50, -- System.Pack_50
RE_GetU_50, -- System.Pack_50
RE_Set_50, -- System.Pack_50
RE_SetU_50, -- System.Pack_50
RE_Bits_51, -- System.Pack_51
RE_Get_51, -- System.Pack_51
RE_Set_51, -- System.Pack_51
RE_Bits_52, -- System.Pack_52
RE_Get_52, -- System.Pack_52
RE_GetU_52, -- System.Pack_52
RE_Set_52, -- System.Pack_52
RE_SetU_52, -- System.Pack_52
RE_Bits_53, -- System.Pack_53
RE_Get_53, -- System.Pack_53
RE_Set_53, -- System.Pack_53
RE_Bits_54, -- System.Pack_54
RE_Get_54, -- System.Pack_54
RE_GetU_54, -- System.Pack_54
RE_Set_54, -- System.Pack_54
RE_SetU_54, -- System.Pack_54
RE_Bits_55, -- System.Pack_55
RE_Get_55, -- System.Pack_55
RE_Set_55, -- System.Pack_55
RE_Bits_56, -- System.Pack_56
RE_Get_56, -- System.Pack_56
RE_GetU_56, -- System.Pack_56
RE_Set_56, -- System.Pack_56
RE_SetU_56, -- System.Pack_56
RE_Bits_57, -- System.Pack_57
RE_Get_57, -- System.Pack_57
RE_Set_57, -- System.Pack_57
RE_Bits_58, -- System.Pack_58
RE_Get_58, -- System.Pack_58
RE_GetU_58, -- System.Pack_58
RE_Set_58, -- System.Pack_58
RE_SetU_58, -- System.Pack_58
RE_Bits_59, -- System.Pack_59
RE_Get_59, -- System.Pack_59
RE_Set_59, -- System.Pack_59
RE_Bits_60, -- System.Pack_60
RE_Get_60, -- System.Pack_60
RE_GetU_60, -- System.Pack_60
RE_Set_60, -- System.Pack_60
RE_SetU_60, -- System.Pack_60
RE_Bits_61, -- System.Pack_61
RE_Get_61, -- System.Pack_61
RE_Set_61, -- System.Pack_61
RE_Bits_62, -- System.Pack_62
RE_Get_62, -- System.Pack_62
RE_GetU_62, -- System.Pack_62
RE_Set_62, -- System.Pack_62
RE_SetU_62, -- System.Pack_62
RE_Bits_63, -- System.Pack_63
RE_Get_63, -- System.Pack_63
RE_Set_63, -- System.Pack_63
RE_Adjust_Storage_Size, -- System.Parameters
RE_Default_Secondary_Stack_Size, -- System.Parameters
RE_Default_Stack_Size, -- System.Parameters
RE_Garbage_Collected, -- System.Parameters
RE_Size_Type, -- System.Parameters
RE_Unspecified_Size, -- System.Parameters
RE_DSA_Implementation, -- System.Partition_Interface
RE_PCS_Version, -- System.Partition_Interface
RE_Get_RACW, -- System.Partition_Interface
RE_Get_RCI_Package_Receiver, -- System.Partition_Interface
RE_Get_Unique_Remote_Pointer, -- System.Partition_Interface
RE_RACW_Stub_Type, -- System.Partition_Interface
RE_RACW_Stub_Type_Access, -- System.Partition_Interface
RE_RAS_Proxy_Type_Access, -- System.Partition_Interface
RE_Raise_Program_Error_Unknown_Tag, -- System.Partition_Interface
RE_Register_Passive_Package, -- System.Partition_Interface
RE_Register_Receiving_Stub, -- System.Partition_Interface
RE_Request, -- System.Partition_Interface
RE_Request_Access, -- System.Partition_Interface
RE_RCI_Locator, -- System.Partition_Interface
RE_RCI_Subp_Info, -- System.Partition_Interface
RE_RCI_Subp_Info_Array, -- System.Partition_Interface
RE_Same_Partition, -- System.Partition_Interface
RE_Subprogram_Id, -- System.Partition_Interface
RE_Get_RAS_Info, -- System.Partition_Interface
RE_Global_Pool_Object, -- System.Pool_Global
RE_Global_Pool_32_Object, -- System.Pool_32_Global
RE_Stack_Bounded_Pool, -- System.Pool_Size
RE_Put_Image_Integer, -- System.Put_Images
RE_Put_Image_Long_Long_Integer, -- System.Put_Images
RE_Put_Image_Unsigned, -- System.Put_Images
RE_Put_Image_Long_Long_Unsigned, -- System.Put_Images
RE_Put_Image_Thin_Pointer, -- System.Put_Images
RE_Put_Image_Fat_Pointer, -- System.Put_Images
RE_Put_Image_Access_Subp, -- System.Put_Images
RE_Put_Image_Access_Prot_Subp, -- System.Put_Images
RE_Put_Image_String, -- System.Put_Images
RE_Put_Image_Wide_String, -- System.Put_Images
RE_Put_Image_Wide_Wide_String, -- System.Put_Images
RE_Array_Before, -- System.Put_Images
RE_Array_Between, -- System.Put_Images
RE_Array_After, -- System.Put_Images
RE_Simple_Array_Between, -- System.Put_Images
RE_Record_Before, -- System.Put_Images
RE_Record_Between, -- System.Put_Images
RE_Record_After, -- System.Put_Images
RE_Put_Image_Unknown, -- System.Put_Images
RE_Put_Image_Protected, -- System.Put_Task_Images
RE_Put_Image_Task, -- System.Put_Task_Images
RE_Do_Apc, -- System.RPC
RE_Do_Rpc, -- System.RPC
RE_Params_Stream_Type, -- System.RPC
RE_Partition_ID, -- System.RPC
RE_To_PolyORB_String, -- System.Partition_Interface
RE_Caseless_String_Eq, -- System.Partition_Interface
RE_TypeCode, -- System.Partition_Interface
RE_Any, -- System.Partition_Interface
RE_Mode_In, -- System.Partition_Interface
RE_Mode_Out, -- System.Partition_Interface
RE_Mode_Inout, -- System.Partition_Interface
RE_NamedValue, -- System.Partition_Interface
RE_Result_Name, -- System.Partition_Interface
RE_Object_Ref, -- System.Partition_Interface
RE_Create_Any, -- System.Partition_Interface
RE_Any_Aggregate_Build, -- System.Partition_Interface
RE_Add_Aggregate_Element, -- System.Partition_Interface
RE_Get_Aggregate_Element, -- System.Partition_Interface
RE_Content_Type, -- System.Partition_Interface
RE_Any_Member_Type, -- System.Partition_Interface
RE_Get_Nested_Sequence_Length, -- System.Partition_Interface
RE_Get_Any_Type, -- System.Partition_Interface
RE_Extract_Union_Value, -- System.Partition_Interface
RE_NVList_Ref, -- System.Partition_Interface
RE_NVList_Create, -- System.Partition_Interface
RE_NVList_Add_Item, -- System.Partition_Interface
RE_Request_Arguments, -- System.Partition_Interface
RE_Request_Invoke, -- System.Partition_Interface
RE_Request_Raise_Occurrence, -- System.Partition_Interface
RE_Request_Set_Out, -- System.Partition_Interface
RE_Request_Setup, -- System.Partition_Interface
RE_Nil_Exc_List, -- System.Partition_Interface
RE_Servant, -- System.Partition_Interface
RE_Move_Any_Value, -- System.Partition_Interface
RE_Set_Result, -- System.Partition_Interface
RE_Register_Obj_Receiving_Stub, -- System.Partition_Interface
RE_Register_Pkg_Receiving_Stub, -- System.Partition_Interface
RE_Is_Nil, -- System.Partition_Interface
RE_Entity_Ptr, -- System.Partition_Interface
RE_Entity_Of, -- System.Partition_Interface
RE_Inc_Usage, -- System.Partition_Interface
RE_Set_Ref, -- System.Partition_Interface
RE_Make_Ref, -- System.Partition_Interface
RE_Get_Local_Address, -- System.Partition_Interface
RE_Get_Reference, -- System.Partition_Interface
RE_Asynchronous_P_To_Sync_Scope, -- System.Partition_Interface
RE_Buffer_Stream_Type, -- System.Partition_Interface
RE_Release_Buffer, -- System.Partition_Interface
RE_BS_To_Any, -- System.Partition_Interface
RE_Any_To_BS, -- System.Partition_Interface
RE_Build_Complex_TC, -- System.Partition_Interface
RE_Get_TC, -- System.Partition_Interface
RE_Set_TC, -- System.Partition_Interface
RE_FA_A, -- System.Partition_Interface
RE_FA_B, -- System.Partition_Interface
RE_FA_C, -- System.Partition_Interface
RE_FA_F, -- System.Partition_Interface
RE_FA_I8, -- System.Partition_Interface
RE_FA_I16, -- System.Partition_Interface
RE_FA_I32, -- System.Partition_Interface
RE_FA_I64, -- System.Partition_Interface
RE_FA_LF, -- System.Partition_Interface
RE_FA_LLF, -- System.Partition_Interface
RE_FA_SF, -- System.Partition_Interface
RE_FA_U8, -- System.Partition_Interface
RE_FA_U16, -- System.Partition_Interface
RE_FA_U32, -- System.Partition_Interface
RE_FA_U64, -- System.Partition_Interface
RE_FA_WC, -- System.Partition_Interface
RE_FA_WWC, -- System.Partition_Interface
RE_FA_String, -- System.Partition_Interface
RE_FA_ObjRef, -- System.Partition_Interface
RE_TA_A, -- System.Partition_Interface
RE_TA_B, -- System.Partition_Interface
RE_TA_C, -- System.Partition_Interface
RE_TA_F, -- System.Partition_Interface
RE_TA_I8, -- System.Partition_Interface
RE_TA_I16, -- System.Partition_Interface
RE_TA_I32, -- System.Partition_Interface
RE_TA_I64, -- System.Partition_Interface
RE_TA_LF, -- System.Partition_Interface
RE_TA_LLF, -- System.Partition_Interface
RE_TA_SF, -- System.Partition_Interface
RE_TA_U8, -- System.Partition_Interface
RE_TA_U16, -- System.Partition_Interface
RE_TA_U32, -- System.Partition_Interface
RE_TA_U64, -- System.Partition_Interface
RE_TA_WC, -- System.Partition_Interface
RE_TA_WWC, -- System.Partition_Interface
RE_TA_String, -- System.Partition_Interface
RE_TA_ObjRef, -- System.Partition_Interface
RE_TA_Std_String, -- System.Partition_Interface
RE_TA_TC, -- System.Partition_Interface
RE_TC_A, -- System.Partition_Interface
RE_TC_B, -- System.Partition_Interface
RE_TC_C, -- System.Partition_Interface
RE_TC_F, -- System.Partition_Interface
RE_TC_I8, -- System.Partition_Interface
RE_TC_I16, -- System.Partition_Interface
RE_TC_I32, -- System.Partition_Interface
RE_TC_I64, -- System.Partition_Interface
RE_TC_LF, -- System.Partition_Interface
RE_TC_LLF, -- System.Partition_Interface
RE_TC_SF, -- System.Partition_Interface
RE_TC_U8, -- System.Partition_Interface
RE_TC_U16, -- System.Partition_Interface
RE_TC_U32, -- System.Partition_Interface
RE_TC_U64, -- System.Partition_Interface
RE_TC_Void, -- System.Partition_Interface
RE_TC_Opaque, -- System.Partition_Interface
RE_TC_WC, -- System.Partition_Interface
RE_TC_WWC, -- System.Partition_Interface
RE_TC_String, -- System.Partition_Interface
RE_Tk_Alias, -- System.Partition_Interface
RE_Tk_Array, -- System.Partition_Interface
RE_Tk_Sequence, -- System.Partition_Interface
RE_Tk_Struct, -- System.Partition_Interface
RE_Tk_Objref, -- System.Partition_Interface
RE_Tk_Union, -- System.Partition_Interface
RO_RD_Delay_For, -- System.Relative_Delays
RE_IS_Is1, -- System.Scalar_Values
RE_IS_Is2, -- System.Scalar_Values
RE_IS_Is4, -- System.Scalar_Values
RE_IS_Is8, -- System.Scalar_Values
RE_IS_Iu1, -- System.Scalar_Values
RE_IS_Iu2, -- System.Scalar_Values
RE_IS_Iu4, -- System.Scalar_Values
RE_IS_Iu8, -- System.Scalar_Values
RE_IS_Iz1, -- System.Scalar_Values
RE_IS_Iz2, -- System.Scalar_Values
RE_IS_Iz4, -- System.Scalar_Values
RE_IS_Iz8, -- System.Scalar_Values
RE_IS_Isf, -- System.Scalar_Values
RE_IS_Ifl, -- System.Scalar_Values
RE_IS_Ilf, -- System.Scalar_Values
RE_IS_Ill, -- System.Scalar_Values
RE_Mark_Id, -- System.Secondary_Stack
RE_SS_Allocate, -- System.Secondary_Stack
RE_SS_Pool, -- System.Secondary_Stack
RE_SS_Mark, -- System.Secondary_Stack
RE_SS_Release, -- System.Secondary_Stack
RE_SS_Stack, -- System.Secondary_Stack
RE_Shared_Var_Lock, -- System.Shared_Storage
RE_Shared_Var_Unlock, -- System.Shared_Storage
RE_Shared_Var_Procs, -- System.Shared_Storage
RE_Abort_Undefer_Direct, -- System.Standard_Library
RE_Exception_Data_Ptr, -- System.Standard_Library
RE_Integer_Address, -- System.Storage_Elements
RE_Storage_Array, -- System.Storage_Elements
RE_Storage_Count, -- System.Storage_Elements
RE_Storage_Offset, -- System.Storage_Elements
RE_To_Address, -- System.Storage_Elements
RE_Allocate_Any, -- System.Storage_Pools
RE_Deallocate_Any, -- System.Storage_Pools
RE_Root_Storage_Pool, -- System.Storage_Pools
RE_Root_Storage_Pool_Ptr, -- System.Storage_Pools
RE_Adjust_Controlled_Dereference, -- System.Storage_Pools.Subpools
RE_Allocate_Any_Controlled, -- System.Storage_Pools.Subpools
RE_Deallocate_Any_Controlled, -- System.Storage_Pools.Subpools
RE_Header_Size_With_Padding, -- System.Storage_Pools.Subpools
RE_Root_Storage_Pool_With_Subpools, -- System.Storage_Pools.Subpools
RE_Root_Subpool, -- System.Storage_Pools.Subpools
RE_Subpool_Handle, -- System.Storage_Pools.Subpools
RE_I_AD, -- System.Stream_Attributes
RE_I_AS, -- System.Stream_Attributes
RE_I_B, -- System.Stream_Attributes
RE_I_C, -- System.Stream_Attributes
RE_I_F, -- System.Stream_Attributes
RE_I_I, -- System.Stream_Attributes
RE_I_I24, -- System.Stream_Attributes
RE_I_LF, -- System.Stream_Attributes
RE_I_LI, -- System.Stream_Attributes
RE_I_LLF, -- System.Stream_Attributes
RE_I_LLI, -- System.Stream_Attributes
RE_I_LLU, -- System.Stream_Attributes
RE_I_LU, -- System.Stream_Attributes
RE_I_SF, -- System.Stream_Attributes
RE_I_SI, -- System.Stream_Attributes
RE_I_SSI, -- System.Stream_Attributes
RE_I_SSU, -- System.Stream_Attributes
RE_I_SU, -- System.Stream_Attributes
RE_I_U, -- System.Stream_Attributes
RE_I_U24, -- System.Stream_Attributes
RE_I_WC, -- System.Stream_Attributes
RE_I_WWC, -- System.Stream_Attributes
RE_W_AD, -- System.Stream_Attributes
RE_W_AS, -- System.Stream_Attributes
RE_W_B, -- System.Stream_Attributes
RE_W_C, -- System.Stream_Attributes
RE_W_F, -- System.Stream_Attributes
RE_W_I, -- System.Stream_Attributes
RE_W_I24, -- System.Stream_Attributes
RE_W_LF, -- System.Stream_Attributes
RE_W_LI, -- System.Stream_Attributes
RE_W_LLF, -- System.Stream_Attributes
RE_W_LLI, -- System.Stream_Attributes
RE_W_LLU, -- System.Stream_Attributes
RE_W_LU, -- System.Stream_Attributes
RE_W_SF, -- System.Stream_Attributes
RE_W_SI, -- System.Stream_Attributes
RE_W_SSI, -- System.Stream_Attributes
RE_W_SSU, -- System.Stream_Attributes
RE_W_SU, -- System.Stream_Attributes
RE_W_U, -- System.Stream_Attributes
RE_W_U24, -- System.Stream_Attributes
RE_W_WC, -- System.Stream_Attributes
RE_W_WWC, -- System.Stream_Attributes
RE_Storage_Array_Input, -- System.Strings.Stream_Ops
RE_Storage_Array_Input_Blk_IO, -- System.Strings.Stream_Ops
RE_Storage_Array_Output, -- System.Strings.Stream_Ops
RE_Storage_Array_Output_Blk_IO, -- System.Strings.Stream_Ops
RE_Storage_Array_Read, -- System.Strings.Stream_Ops
RE_Storage_Array_Read_Blk_IO, -- System.Strings.Stream_Ops
RE_Storage_Array_Write, -- System.Strings.Stream_Ops
RE_Storage_Array_Write_Blk_IO, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Input, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Input_Blk_IO, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Output, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Output_Blk_IO, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Read, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Read_Blk_IO, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Write, -- System.Strings.Stream_Ops
RE_Stream_Element_Array_Write_Blk_IO, -- System.Strings.Stream_Ops
RE_String_Input, -- System.Strings.Stream_Ops
RE_String_Input_Blk_IO, -- System.Strings.Stream_Ops
RE_String_Input_Tag, -- System.Strings.Stream_Ops
RE_String_Output, -- System.Strings.Stream_Ops
RE_String_Output_Blk_IO, -- System.Strings.Stream_Ops
RE_String_Read, -- System.Strings.Stream_Ops
RE_String_Read_Blk_IO, -- System.Strings.Stream_Ops
RE_String_Write, -- System.Strings.Stream_Ops
RE_String_Write_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_String_Input, -- System.Strings.Stream_Ops
RE_Wide_String_Input_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_String_Output, -- System.Strings.Stream_Ops
RE_Wide_String_Output_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_String_Read, -- System.Strings.Stream_Ops
RE_Wide_String_Read_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_String_Write, -- System.Strings.Stream_Ops
RE_Wide_String_Write_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Input, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Input_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Output, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Output_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Read, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Read_Blk_IO, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Write, -- System.Strings.Stream_Ops
RE_Wide_Wide_String_Write_Blk_IO, -- System.Strings.Stream_Ops
RE_Task_Info_Type, -- System.Task_Info
RE_Unspecified_Task_Info, -- System.Task_Info
RE_Task_Procedure_Access, -- System.Tasking
RO_ST_Number_Of_Entries, -- System.Tasking
RO_ST_Task_Id, -- System.Tasking
RO_ST_Null_Task, -- System.Tasking
RE_Call_Modes, -- System.Tasking
RE_Simple_Call, -- System.Tasking
RE_Conditional_Call, -- System.Tasking
RE_Asynchronous_Call, -- System.Tasking
RE_Foreign_Task_Level, -- System.Tasking
RE_Environment_Task_Level, -- System.Tasking
RE_Independent_Task_Level, -- System.Tasking
RE_Library_Task_Level, -- System.Tasking
RE_Ada_Task_Control_Block, -- System.Tasking
RE_Task_List, -- System.Tasking
RE_Accept_List, -- System.Tasking
RE_No_Rendezvous, -- System.Tasking
RE_Null_Task_Entry, -- System.Tasking
RE_Select_Index, -- System.Tasking
RE_Else_Mode, -- System.Tasking
RE_Simple_Mode, -- System.Tasking
RE_Terminate_Mode, -- System.Tasking
RE_Delay_Mode, -- System.Tasking
RE_Entry_Index, -- System.Tasking
RE_Task_Entry_Index, -- System.Tasking
RE_Self, -- System.Tasking
RE_Master_Id, -- System.Tasking
RE_Unspecified_Priority, -- System.Tasking
RE_Activation_Chain, -- System.Tasking
RE_Activation_Chain_Access, -- System.Tasking
RE_Storage_Size, -- System.Tasking
RE_Unspecified_CPU, -- System.Tasking
RE_Dispatching_Domain_Access, -- System.Tasking
RE_Abort_Defer, -- System.Soft_Links
RE_Abort_Undefer, -- System.Soft_Links
RE_Complete_Master, -- System.Soft_Links
RE_Current_Master, -- System.Soft_Links
RE_Dummy_Communication_Block, -- System.Soft_Links
RE_Enter_Master, -- System.Soft_Links
RE_Get_Current_Excep, -- System.Soft_Links
RE_Get_GNAT_Exception, -- System.Soft_Links
RE_Save_Library_Occurrence, -- System.Soft_Links
RE_Bits_1, -- System.Unsigned_Types
RE_Bits_2, -- System.Unsigned_Types
RE_Bits_4, -- System.Unsigned_Types
RE_Float_Unsigned, -- System.Unsigned_Types
RE_Long_Unsigned, -- System.Unsigned_Types
RE_Long_Long_Unsigned, -- System.Unsigned_Types
RE_Packed_Byte, -- System.Unsigned_Types
RE_Packed_Bytes1, -- System.Unsigned_Types
RE_Packed_Bytes2, -- System.Unsigned_Types
RE_Packed_Bytes4, -- System.Unsigned_Types
RE_Rev_Packed_Bytes1, -- System.Unsigned_Types
RE_Rev_Packed_Bytes2, -- System.Unsigned_Types
RE_Rev_Packed_Bytes4, -- System.Unsigned_Types
RE_Short_Unsigned, -- System.Unsigned_Types
RE_Short_Short_Unsigned, -- System.Unsigned_Types
RE_Unsigned, -- System.Unsigned_Types
RE_Value_Boolean, -- System.Val_Bool
RE_Value_Character, -- System.Val_Char
RE_Value_Decimal, -- System.Val_Dec
RE_Value_Enumeration_8, -- System.Val_Enum
RE_Value_Enumeration_16, -- System.Val_Enum
RE_Value_Enumeration_32, -- System.Val_Enum
RE_Value_Integer, -- System.Val_Int
RE_Value_Long_Long_Decimal, -- System.Val_LLD
RE_Value_Long_Long_Integer, -- System.Val_LLI
RE_Value_Long_Long_Unsigned, -- System.Val_LLU
RE_Value_Real, -- System.Val_Real
RE_Value_Unsigned, -- System.Val_Uns
RE_Value_Wide_Character, -- System.Val_WChar
RE_Value_Wide_Wide_Character, -- System.Val_WChar
RE_Version_String, -- System.Version_Control
RE_Get_Version_String, -- System.Version_Control
RE_String_To_Wide_String, -- System.WCh_StW
RE_String_To_Wide_Wide_String, -- System.WCh_StW
RE_Wide_String_To_String, -- System.WCh_WtS
RE_Wide_Wide_String_To_String, -- System.WCh_WtS
RE_Wide_Width_Character, -- System.WWd_Char
RE_Wide_Wide_Width_Character, -- System.WWd_Char
RE_Wide_Wide_Width_Enumeration_8, -- System.WWd_Enum
RE_Wide_Wide_Width_Enumeration_16, -- System.WWd_Enum
RE_Wide_Wide_Width_Enumeration_32, -- System.WWd_Enum
RE_Wide_Width_Enumeration_8, -- System.WWd_Enum
RE_Wide_Width_Enumeration_16, -- System.WWd_Enum
RE_Wide_Width_Enumeration_32, -- System.WWd_Enum
RE_Wide_Wide_Width_Wide_Character, -- System.WWd_Wchar
RE_Wide_Wide_Width_Wide_Wide_Char, -- System.WWd_Wchar
RE_Wide_Width_Wide_Character, -- System.WWd_Wchar
RE_Wide_Width_Wide_Wide_Character, -- System.WWd_Wchar
RE_Width_Boolean, -- System.Wid_Bool
RE_Width_Character, -- System.Wid_Char
RE_Width_Enumeration_8, -- System.Wid_Enum
RE_Width_Enumeration_16, -- System.Wid_Enum
RE_Width_Enumeration_32, -- System.Wid_Enum
RE_Width_Long_Long_Integer, -- System.Wid_LLI
RE_Width_Long_Long_Unsigned, -- System.Wid_LLU
RE_Width_Wide_Character, -- System.Wid_WChar
RE_Width_Wide_Wide_Character, -- System.Wid_WChar
RE_Dispatching_Domain, -- Multiprocessors.Dispatching_Domains
RE_Protected_Entry_Body_Array, -- Tasking.Protected_Objects.Entries
RE_Protected_Entry_Queue_Max_Array, -- Tasking.Protected_Objects.Entries
RE_Protection_Entries, -- Tasking.Protected_Objects.Entries
RE_Protection_Entries_Access, -- Tasking.Protected_Objects.Entries
RE_Initialize_Protection_Entries, -- Tasking.Protected_Objects.Entries
RE_Lock_Entries, -- Tasking.Protected_Objects.Entries
RE_Unlock_Entries, -- Tasking.Protected_Objects.Entries
RO_PE_Get_Ceiling, -- Tasking.Protected_Objects.Entries
RO_PE_Number_Of_Entries, -- Tasking.Protected_Objects.Entries
RO_PE_Set_Ceiling, -- Tasking.Protected_Objects.Entries
RE_Communication_Block, -- Protected_Objects.Operations
RE_Protected_Entry_Call, -- Protected_Objects.Operations
RE_Service_Entries, -- Protected_Objects.Operations
RE_Cancel_Protected_Entry_Call, -- Protected_Objects.Operations
RE_Enqueued, -- Protected_Objects.Operations
RE_Cancelled, -- Protected_Objects.Operations
RE_Complete_Entry_Body, -- Protected_Objects.Operations
RE_Exceptional_Complete_Entry_Body, -- Protected_Objects.Operations
RE_Requeue_Protected_Entry, -- Protected_Objects.Operations
RE_Requeue_Task_To_Protected_Entry, -- Protected_Objects.Operations
RE_Protected_Count, -- Protected_Objects.Operations
RE_Protected_Entry_Caller, -- Protected_Objects.Operations
RE_Timed_Protected_Entry_Call, -- Protected_Objects.Operations
RE_Protection_Entry, -- Protected_Objects.Single_Entry
RE_Initialize_Protection_Entry, -- Protected_Objects.Single_Entry
RE_Lock_Entry, -- Protected_Objects.Single_Entry
RE_Unlock_Entry, -- Protected_Objects.Single_Entry
RE_Protected_Single_Entry_Call, -- Protected_Objects.Single_Entry
RE_Service_Entry, -- Protected_Objects.Single_Entry
RE_Exceptional_Complete_Single_Entry_Body,
RE_Protected_Count_Entry, -- Protected_Objects.Single_Entry
RE_Protected_Single_Entry_Caller, -- Protected_Objects.Single_Entry
RE_Protected_Entry_Index, -- System.Tasking.Protected_Objects
RE_Entry_Body, -- System.Tasking.Protected_Objects
RE_Protection, -- System.Tasking.Protected_Objects
RE_Initialize_Protection, -- System.Tasking.Protected_Objects
RE_Finalize_Protection, -- System.Tasking.Protected_Objects
RE_Lock, -- System.Tasking.Protected_Objects
RE_Lock_Read_Only, -- System.Tasking.Protected_Objects
RE_Get_Ceiling, -- System.Tasking.Protected_Objects
RE_Set_Ceiling, -- System.Tasking.Protected_Objects
RE_Unlock, -- System.Tasking.Protected_Objects
RE_Delay_Block, -- System.Tasking.Async_Delays
RE_Timed_Out, -- System.Tasking.Async_Delays
RE_Cancel_Async_Delay, -- System.Tasking.Async_Delays
RE_Enqueue_Duration, -- System.Tasking.Async_Delays
RE_Enqueue_Calendar, -- System.Tasking.Async_Delays
RE_Enqueue_RT, -- System.Tasking.Async_Delays
RE_Accept_Call, -- System.Tasking.Rendezvous
RE_Accept_Trivial, -- System.Tasking.Rendezvous
RE_Callable, -- System.Tasking.Rendezvous
RE_Call_Simple, -- System.Tasking.Rendezvous
RE_Requeue_Task_Entry, -- System.Tasking.Rendezvous
RE_Requeue_Protected_To_Task_Entry, -- System.Tasking.Rendezvous
RE_Cancel_Task_Entry_Call, -- System.Tasking.Rendezvous
RE_Complete_Rendezvous, -- System.Tasking.Rendezvous
RE_Task_Count, -- System.Tasking.Rendezvous
RE_Exceptional_Complete_Rendezvous, -- System.Tasking.Rendezvous
RE_Selective_Wait, -- System.Tasking.Rendezvous
RE_Task_Entry_Call, -- System.Tasking.Rendezvous
RE_Task_Entry_Caller, -- System.Tasking.Rendezvous
RE_Timed_Task_Entry_Call, -- System.Tasking.Rendezvous
RE_Timed_Selective_Wait, -- System.Tasking.Rendezvous
RE_Activate_Restricted_Tasks, -- System.Tasking.Restricted.Stages
RE_Complete_Restricted_Activation, -- System.Tasking.Restricted.Stages
RE_Create_Restricted_Task, -- System.Tasking.Restricted.Stages
RE_Create_Restricted_Task_Sequential, -- System.Tasking.Restricted.Stages
RE_Complete_Restricted_Task, -- System.Tasking.Restricted.Stages
RE_Restricted_Terminated, -- System.Tasking.Restricted.Stages
RE_Abort_Tasks, -- System.Tasking.Stages
RE_Activate_Tasks, -- System.Tasking.Stages
RE_Complete_Activation, -- System.Tasking.Stages
RE_Create_Task, -- System.Tasking.Stages
RE_Complete_Task, -- System.Tasking.Stages
RE_Free_Task, -- System.Tasking.Stages
RE_Expunge_Unactivated_Tasks, -- System.Tasking.Stages
RE_Move_Activation_Chain, -- System.Tasking_Stages
RE_Terminated); -- System.Tasking.Stages
-- The following declarations build a table that is indexed by the RTE
-- function to determine the unit containing the given entity. This table
-- is sorted in order of package names.
RE_Unit_Table : constant array (RE_Id) of RTU_Id := (
RE_Null => RTU_Null,
RO_CA_Clock_Time => Ada_Calendar,
RO_CA_Time => Ada_Calendar,
RO_CA_Delay_For => Ada_Calendar_Delays,
RO_CA_Delay_Until => Ada_Calendar_Delays,
RO_CA_To_Duration => Ada_Calendar_Delays,
RE_Yield => Ada_Dispatching,
RE_Set_Deadline => Ada_Dispatching_EDF,
RE_Code_Loc => Ada_Exceptions,
RE_Exception_Id => Ada_Exceptions,
RE_Exception_Identity => Ada_Exceptions,
RE_Exception_Information => Ada_Exceptions,
RE_Exception_Message => Ada_Exceptions,
RE_Exception_Name_Simple => Ada_Exceptions,
RE_Exception_Occurrence => Ada_Exceptions,
RE_Exception_Occurrence_Access => Ada_Exceptions,
RE_Null_Id => Ada_Exceptions,
RE_Null_Occurrence => Ada_Exceptions,
RE_Poll => Ada_Exceptions,
RE_Raise_Exception => Ada_Exceptions,
RE_Raise_Exception_Always => Ada_Exceptions,
RE_Raise_From_Controlled_Operation => Ada_Exceptions,
RE_Reraise_Occurrence => Ada_Exceptions,
RE_Reraise_Occurrence_Always => Ada_Exceptions,
RE_Reraise_Occurrence_No_Defer => Ada_Exceptions,
RE_Save_Occurrence => Ada_Exceptions,
RE_Triggered_By_Abort => Ada_Exceptions,
RE_Interrupt_ID => Ada_Interrupts,
RE_Is_Reserved => Ada_Interrupts,
RE_Is_Attached => Ada_Interrupts,
RE_Current_Handler => Ada_Interrupts,
RE_Attach_Handler => Ada_Interrupts,
RE_Exchange_Handler => Ada_Interrupts,
RE_Detach_Handler => Ada_Interrupts,
RE_Reference => Ada_Interrupts,
RE_Names => Ada_Interrupts_Names,
RE_Clock => Ada_Real_Time,
RE_Clock_Time => Ada_Real_Time,
RE_Time_Span => Ada_Real_Time,
RE_Time_Span_Zero => Ada_Real_Time,
RO_RT_Time => Ada_Real_Time,
RO_RT_Delay_Until => Ada_Real_Time_Delays,
RO_RT_To_Duration => Ada_Real_Time_Delays,
RE_Set_Handler => Ada_Real_Time_Timing_Events,
RE_Timing_Event => Ada_Real_Time_Timing_Events,
RE_Root_Stream_Type => Ada_Streams,
RE_Stream_Element => Ada_Streams,
RE_Stream_Element_Array => Ada_Streams,
RE_Stream_Element_Offset => Ada_Streams,
RE_Stream_Access => Ada_Streams_Stream_IO,
RO_SU_Super_String => Ada_Strings_Superbounded,
RO_WI_Super_String => Ada_Strings_Wide_Superbounded,
RO_WW_Super_String => Ada_Strings_Wide_Wide_Superbounded,
RE_Unbounded_String => Ada_Strings_Unbounded,
RE_Sink => Ada_Strings_Text_Output,
RE_Put_UTF_8 => Ada_Strings_Text_Output_Utils,
RE_Put_Wide_Wide_String => Ada_Strings_Text_Output_Utils,
RE_Buffer => Ada_Strings_Text_Output_Buffers,
RE_New_Buffer => Ada_Strings_Text_Output_Buffers,
RE_Destroy => Ada_Strings_Text_Output_Buffers,
RE_Get => Ada_Strings_Text_Output_Buffers,
RE_Wait_For_Release => Ada_Synchronous_Barriers,
RE_Suspend_Until_True => Ada_Synchronous_Task_Control,
RE_Access_Level => Ada_Tags,
RE_Alignment => Ada_Tags,
RE_Address_Array => Ada_Tags,
RE_Addr_Ptr => Ada_Tags,
RE_Base_Address => Ada_Tags,
RE_Check_Interface_Conversion => Ada_Tags,
RE_Check_TSD => Ada_Tags,
RE_Cstring_Ptr => Ada_Tags,
RE_CW_Membership => Ada_Tags,
RE_Descendant_Tag => Ada_Tags,
RE_Dispatch_Table => Ada_Tags,
RE_Dispatch_Table_Wrapper => Ada_Tags,
RE_Displace => Ada_Tags,
RE_DT => Ada_Tags,
RE_DT_Offset_To_Top_Offset => Ada_Tags,
RE_DT_Predef_Prims_Offset => Ada_Tags,
RE_DT_Typeinfo_Ptr_Size => Ada_Tags,
RE_External_Tag => Ada_Tags,
RO_TA_External_Tag => Ada_Tags,
RE_Get_Access_Level => Ada_Tags,
RE_Get_Alignment => Ada_Tags,
RE_Get_Entry_Index => Ada_Tags,
RE_Get_Offset_Index => Ada_Tags,
RE_Get_Prim_Op_Kind => Ada_Tags,
RE_Get_Tagged_Kind => Ada_Tags,
RE_HT_Link => Ada_Tags,
RE_Idepth => Ada_Tags,
RE_Interfaces_Array => Ada_Tags,
RE_Interfaces_Table => Ada_Tags,
RE_Interface_Data => Ada_Tags,
RE_Interface_Data_Element => Ada_Tags,
RE_Interface_Tag => Ada_Tags,
RE_Is_Abstract => Ada_Tags,
RE_IW_Membership => Ada_Tags,
RE_Max_Predef_Prims => Ada_Tags,
RE_Needs_Finalization => Ada_Tags,
RE_No_Dispatch_Table_Wrapper => Ada_Tags,
RE_No_Tag => Ada_Tags,
RE_NDT_Prims_Ptr => Ada_Tags,
RE_NDT_TSD => Ada_Tags,
RE_Num_Prims => Ada_Tags,
RE_Object_Specific_Data => Ada_Tags,
RE_Offset_To_Top => Ada_Tags,
RE_Offset_To_Top_Ptr => Ada_Tags,
RE_Offset_To_Top_Function_Ptr => Ada_Tags,
RE_OSD_Table => Ada_Tags,
RE_OSD_Num_Prims => Ada_Tags,
RE_POK_Function => Ada_Tags,
RE_POK_Procedure => Ada_Tags,
RE_POK_Protected_Entry => Ada_Tags,
RE_POK_Protected_Function => Ada_Tags,
RE_POK_Protected_Procedure => Ada_Tags,
RE_POK_Task_Entry => Ada_Tags,
RE_POK_Task_Function => Ada_Tags,
RE_POK_Task_Procedure => Ada_Tags,
RE_Predef_Prims => Ada_Tags,
RE_Predef_Prims_Table_Ptr => Ada_Tags,
RE_Prim_Op_Kind => Ada_Tags,
RE_Prim_Ptr => Ada_Tags,
RE_Prims_Ptr => Ada_Tags,
RE_Primary_DT => Ada_Tags,
RE_Signature => Ada_Tags,
RE_SSD => Ada_Tags,
RE_TSD => Ada_Tags,
RE_Type_Specific_Data => Ada_Tags,
RE_Register_Interface_Offset => Ada_Tags,
RE_Register_Tag => Ada_Tags,
RE_Register_TSD => Ada_Tags,
RE_Transportable => Ada_Tags,
RE_Secondary_DT => Ada_Tags,
RE_Secondary_Tag => Ada_Tags,
RE_Select_Specific_Data => Ada_Tags,
RE_Set_Entry_Index => Ada_Tags,
RE_Set_Dynamic_Offset_To_Top => Ada_Tags,
RE_Set_Prim_Op_Kind => Ada_Tags,
RE_Size_Func => Ada_Tags,
RE_Size_Ptr => Ada_Tags,
RE_Tag => Ada_Tags,
RE_Tag_Error => Ada_Tags,
RE_Tag_Kind => Ada_Tags,
RE_Tag_Ptr => Ada_Tags,
RE_Tag_Table => Ada_Tags,
RE_Tags_Table => Ada_Tags,
RE_Tagged_Kind => Ada_Tags,
RE_Type_Specific_Data_Ptr => Ada_Tags,
RE_TK_Abstract_Limited_Tagged => Ada_Tags,
RE_TK_Abstract_Tagged => Ada_Tags,
RE_TK_Limited_Tagged => Ada_Tags,
RE_TK_Protected => Ada_Tags,
RE_TK_Tagged => Ada_Tags,
RE_TK_Task => Ada_Tags,
RE_Unregister_Tag => Ada_Tags,
RE_Set_Specific_Handler => Ada_Task_Termination,
RE_Specific_Handler => Ada_Task_Termination,
RE_Abort_Task => Ada_Task_Identification,
RE_Current_Task => Ada_Task_Identification,
RO_AT_Task_Id => Ada_Task_Identification,
RE_Tasking_State => Ada_Task_Identification,
RE_Decimal_IO => Ada_Text_IO,
RE_Fixed_IO => Ada_Text_IO,
RO_WT_Decimal_IO => Ada_Wide_Text_IO,
RO_WT_Fixed_IO => Ada_Wide_Text_IO,
RO_WW_Decimal_IO => Ada_Wide_Wide_Text_IO,
RO_WW_Fixed_IO => Ada_Wide_Wide_Text_IO,
RE_Stream_T => CUDA_Driver_Types,
RE_Fatbin_Wrapper => CUDA_Internal,
RE_Push_Call_Configuration => CUDA_Internal,
RE_Pop_Call_Configuration => CUDA_Internal,
RE_Register_Fat_Binary => CUDA_Internal,
RE_Register_Fat_Binary_End => CUDA_Internal,
RE_Register_Function => CUDA_Internal,
RE_Launch_Kernel => CUDA_Runtime_Api,
RE_Dim3 => CUDA_Vector_Types,
RE_Integer_8 => Interfaces,
RE_Integer_16 => Interfaces,
RE_Integer_32 => Interfaces,
RE_Integer_64 => Interfaces,
RE_Unsigned_8 => Interfaces,
RE_Unsigned_16 => Interfaces,
RE_Unsigned_32 => Interfaces,
RE_Unsigned_64 => Interfaces,
RO_IC_Unsigned => Interfaces_C,
RO_IC_Unsigned_Long_Long => Interfaces_C,
RE_Chars_Ptr => Interfaces_C_Strings,
RE_New_Char_Array => Interfaces_C_Strings,
RE_Address => System,
RE_Any_Priority => System,
RE_Bit_Order => System,
RE_Default_Priority => System,
RE_High_Order_First => System,
RE_Interrupt_Priority => System,
RE_Lib_Stop => System,
RE_Low_Order_First => System,
RE_Max_Base_Digits => System,
RE_Max_Priority => System,
RE_Null_Address => System,
RE_Priority => System,
RE_Address_Image => System_Address_Image,
RE_Add_With_Ovflo_Check => System_Arith_64,
RE_Double_Divide => System_Arith_64,
RE_Multiply_With_Ovflo_Check => System_Arith_64,
RE_Scaled_Divide => System_Arith_64,
RE_Subtract_With_Ovflo_Check => System_Arith_64,
RE_Create_AST_Handler => System_AST_Handling,
RE_Assert_Failure => System_Assertions,
RE_Raise_Assert_Failure => System_Assertions,
RE_Lock_Free_Read_8 => System_Atomic_Primitives,
RE_Lock_Free_Read_16 => System_Atomic_Primitives,
RE_Lock_Free_Read_32 => System_Atomic_Primitives,
RE_Lock_Free_Read_64 => System_Atomic_Primitives,
RE_Lock_Free_Try_Write_8 => System_Atomic_Primitives,
RE_Lock_Free_Try_Write_16 => System_Atomic_Primitives,
RE_Lock_Free_Try_Write_32 => System_Atomic_Primitives,
RE_Lock_Free_Try_Write_64 => System_Atomic_Primitives,
RE_Uint8 => System_Atomic_Primitives,
RE_Uint16 => System_Atomic_Primitives,
RE_Uint32 => System_Atomic_Primitives,
RE_Uint64 => System_Atomic_Primitives,
RE_AST_Handler => System_Aux_DEC,
RE_Import_Address => System_Aux_DEC,
RE_Import_Value => System_Aux_DEC,
RE_No_AST_Handler => System_Aux_DEC,
RE_Type_Class => System_Aux_DEC,
RE_Type_Class_Enumeration => System_Aux_DEC,
RE_Type_Class_Integer => System_Aux_DEC,
RE_Type_Class_Fixed_Point => System_Aux_DEC,
RE_Type_Class_Floating_Point => System_Aux_DEC,
RE_Type_Class_Array => System_Aux_DEC,
RE_Type_Class_Record => System_Aux_DEC,
RE_Type_Class_Access => System_Aux_DEC,
RE_Type_Class_Task => System_Aux_DEC,
RE_Type_Class_Address => System_Aux_DEC,
RE_Big_Abs => System_Bignums,
RE_Big_Add => System_Bignums,
RE_Big_Div => System_Bignums,
RE_Big_Exp => System_Bignums,
RE_Big_Mod => System_Bignums,
RE_Big_Mul => System_Bignums,
RE_Big_Neg => System_Bignums,
RE_Big_Rem => System_Bignums,
RE_Big_Sub => System_Bignums,
RE_Big_EQ => System_Bignums,
RE_Big_GE => System_Bignums,
RE_Big_GT => System_Bignums,
RE_Big_LE => System_Bignums,
RE_Big_LT => System_Bignums,
RE_Big_NE => System_Bignums,
RE_Bignum => System_Bignums,
RE_Bignum_In_LLI_Range => System_Bignums,
RE_To_Bignum => System_Bignums,
RE_From_Bignum => System_Bignums,
RE_Copy_Bitfield => System_Bitfields,
RE_Bit_And => System_Bit_Ops,
RE_Bit_Eq => System_Bit_Ops,
RE_Bit_Not => System_Bit_Ops,
RE_Bit_Or => System_Bit_Ops,
RE_Bit_Xor => System_Bit_Ops,
RE_Checked_Pool => System_Checked_Pools,
RE_Vector_Not => System_Boolean_Array_Operations,
RE_Vector_And => System_Boolean_Array_Operations,
RE_Vector_Or => System_Boolean_Array_Operations,
RE_Vector_Nand => System_Boolean_Array_Operations,
RE_Vector_Nor => System_Boolean_Array_Operations,
RE_Vector_Nxor => System_Boolean_Array_Operations,
RE_Vector_Xor => System_Boolean_Array_Operations,
RE_Bswap_16 => System_Byte_Swapping,
RE_Bswap_32 => System_Byte_Swapping,
RE_Bswap_64 => System_Byte_Swapping,
RE_Compare_Array_S8 => System_Compare_Array_Signed_8,
RE_Compare_Array_S8_Unaligned => System_Compare_Array_Signed_8,
RE_Compare_Array_S16 => System_Compare_Array_Signed_16,
RE_Compare_Array_S32 => System_Compare_Array_Signed_32,
RE_Compare_Array_S64 => System_Compare_Array_Signed_64,
RE_Compare_Array_U8 => System_Compare_Array_Unsigned_8,
RE_Compare_Array_U8_Unaligned => System_Compare_Array_Unsigned_8,
RE_Compare_Array_U16 => System_Compare_Array_Unsigned_16,
RE_Compare_Array_U32 => System_Compare_Array_Unsigned_32,
RE_Compare_Array_U64 => System_Compare_Array_Unsigned_64,
RE_Str_Concat_2 => System_Concat_2,
RE_Str_Concat_3 => System_Concat_3,
RE_Str_Concat_4 => System_Concat_4,
RE_Str_Concat_5 => System_Concat_5,
RE_Str_Concat_6 => System_Concat_6,
RE_Str_Concat_7 => System_Concat_7,
RE_Str_Concat_8 => System_Concat_8,
RE_Str_Concat_9 => System_Concat_9,
RE_Str_Concat_Bounds_2 => System_Concat_2,
RE_Str_Concat_Bounds_3 => System_Concat_3,
RE_Str_Concat_Bounds_4 => System_Concat_4,
RE_Str_Concat_Bounds_5 => System_Concat_5,
RE_Str_Concat_Bounds_6 => System_Concat_6,
RE_Str_Concat_Bounds_7 => System_Concat_7,
RE_Str_Concat_Bounds_8 => System_Concat_8,
RE_Str_Concat_Bounds_9 => System_Concat_9,
RE_Get_Active_Partition_Id => System_DSA_Services,
RE_Get_Local_Partition_Id => System_DSA_Services,
RE_Get_Passive_Partition_Id => System_DSA_Services,
RE_Any_Container_Ptr => System_DSA_Types,
RE_Check_Standard_Allocator => System_Elaboration_Allocators,
RE_Register_Exception => System_Exception_Table,
RE_Local_Raise => System_Exceptions_Debug,
RE_Exn_Integer => System_Exn_Int,
RE_Exn_Float => System_Exn_LLF,
RE_Exn_Long_Float => System_Exn_LLF,
RE_Exn_Long_Long_Float => System_Exn_LLF,
RE_Exn_Long_Long_Integer => System_Exn_LLI,
RE_Exp_Integer => System_Exp_Int,
RE_Exp_Long_Long_Integer => System_Exp_LLI,
RE_Exp_Long_Long_Unsigned => System_Exp_LLU,
RE_Exp_Modular => System_Exp_Mod,
RE_Exp_Unsigned => System_Exp_Uns,
RE_Attr_Float => System_Fat_Flt,
RE_Attr_IEEE_Long => System_Fat_IEEE_Long_Float,
RE_Fat_IEEE_Long => System_Fat_IEEE_Long_Float,
RE_Attr_IEEE_Short => System_Fat_IEEE_Short_Float,
RE_Fat_IEEE_Short => System_Fat_IEEE_Short_Float,
RE_Attr_Long_Float => System_Fat_LFlt,
RE_Attr_Long_Long_Float => System_Fat_LLF,
RE_Attr_Short_Float => System_Fat_SFlt,
RE_Attr_VAX_D_Float => System_Fat_VAX_D_Float,
RE_Fat_VAX_D => System_Fat_VAX_D_Float,
RE_Attr_VAX_F_Float => System_Fat_VAX_F_Float,
RE_Fat_VAX_F => System_Fat_VAX_F_Float,
RE_Attr_VAX_G_Float => System_Fat_VAX_G_Float,
RE_Fat_VAX_G => System_Fat_VAX_G_Float,
RE_Add_Offset_To_Address => System_Finalization_Masters,
RE_Attach => System_Finalization_Masters,
RE_Base_Pool => System_Finalization_Masters,
RE_Detach => System_Finalization_Masters,
RE_Finalization_Master => System_Finalization_Masters,
RE_Finalization_Master_Ptr => System_Finalization_Masters,
RE_Set_Base_Pool => System_Finalization_Masters,
RE_Set_Finalize_Address => System_Finalization_Masters,
RE_Set_Is_Heterogeneous => System_Finalization_Masters,
RE_Root_Controlled => System_Finalization_Root,
RE_Root_Controlled_Ptr => System_Finalization_Root,
RE_Fore => System_Fore,
RE_Image_Boolean => System_Img_Bool,
RE_Image_Character => System_Img_Char,
RE_Image_Character_05 => System_Img_Char,
RE_Image_Decimal => System_Img_Dec,
RE_Image_Enumeration_8 => System_Img_Enum_New,
RE_Image_Enumeration_16 => System_Img_Enum_New,
RE_Image_Enumeration_32 => System_Img_Enum_New,
RE_Image_Integer => System_Img_Int,
RE_Image_Long_Long_Decimal => System_Img_LLD,
RE_Image_Long_Long_Integer => System_Img_LLI,
RE_Image_Long_Long_Unsigned => System_Img_LLU,
RE_Image_Ordinary_Fixed_Point => System_Img_Real,
RE_Image_Floating_Point => System_Img_Real,
RE_Image_Unsigned => System_Img_Uns,
RE_Image_Wide_Character => System_Img_WChar,
RE_Image_Wide_Wide_Character => System_Img_WChar,
RE_Bind_Interrupt_To_Entry => System_Interrupts,
RE_Default_Interrupt_Priority => System_Interrupts,
RE_Dynamic_Interrupt_Protection => System_Interrupts,
RE_Install_Handlers => System_Interrupts,
RE_Install_Restricted_Handlers => System_Interrupts,
RE_Register_Interrupt_Handler => System_Interrupts,
RE_Static_Interrupt_Protection => System_Interrupts,
RE_System_Interrupt_Id => System_Interrupts,
RE_Expon_LLF => System_Long_Long_Float_Expon,
RE_Asm_Insn => System_Machine_Code,
RE_Asm_Input_Operand => System_Machine_Code,
RE_Asm_Output_Operand => System_Machine_Code,
RE_Mantissa_Value => System_Mantissa,
RE_Free => System_Memory,
RE_CPU_Range => System_Multiprocessors,
RE_Bits_03 => System_Pack_03,
RE_Get_03 => System_Pack_03,
RE_Set_03 => System_Pack_03,
RE_Bits_05 => System_Pack_05,
RE_Get_05 => System_Pack_05,
RE_Set_05 => System_Pack_05,
RE_Bits_06 => System_Pack_06,
RE_Get_06 => System_Pack_06,
RE_GetU_06 => System_Pack_06,
RE_Set_06 => System_Pack_06,
RE_SetU_06 => System_Pack_06,
RE_Bits_07 => System_Pack_07,
RE_Get_07 => System_Pack_07,
RE_Set_07 => System_Pack_07,
RE_Bits_09 => System_Pack_09,
RE_Get_09 => System_Pack_09,
RE_Set_09 => System_Pack_09,
RE_Bits_10 => System_Pack_10,
RE_Get_10 => System_Pack_10,
RE_GetU_10 => System_Pack_10,
RE_Set_10 => System_Pack_10,
RE_SetU_10 => System_Pack_10,
RE_Bits_11 => System_Pack_11,
RE_Get_11 => System_Pack_11,
RE_Set_11 => System_Pack_11,
RE_Bits_12 => System_Pack_12,
RE_Get_12 => System_Pack_12,
RE_GetU_12 => System_Pack_12,
RE_Set_12 => System_Pack_12,
RE_SetU_12 => System_Pack_12,
RE_Bits_13 => System_Pack_13,
RE_Get_13 => System_Pack_13,
RE_Set_13 => System_Pack_13,
RE_Bits_14 => System_Pack_14,
RE_Get_14 => System_Pack_14,
RE_GetU_14 => System_Pack_14,
RE_Set_14 => System_Pack_14,
RE_SetU_14 => System_Pack_14,
RE_Bits_15 => System_Pack_15,
RE_Get_15 => System_Pack_15,
RE_Set_15 => System_Pack_15,
RE_Bits_17 => System_Pack_17,
RE_Get_17 => System_Pack_17,
RE_Set_17 => System_Pack_17,
RE_Bits_18 => System_Pack_18,
RE_Get_18 => System_Pack_18,
RE_GetU_18 => System_Pack_18,
RE_Set_18 => System_Pack_18,
RE_SetU_18 => System_Pack_18,
RE_Bits_19 => System_Pack_19,
RE_Get_19 => System_Pack_19,
RE_Set_19 => System_Pack_19,
RE_Bits_20 => System_Pack_20,
RE_Get_20 => System_Pack_20,
RE_GetU_20 => System_Pack_20,
RE_Set_20 => System_Pack_20,
RE_SetU_20 => System_Pack_20,
RE_Bits_21 => System_Pack_21,
RE_Get_21 => System_Pack_21,
RE_Set_21 => System_Pack_21,
RE_Bits_22 => System_Pack_22,
RE_Get_22 => System_Pack_22,
RE_GetU_22 => System_Pack_22,
RE_Set_22 => System_Pack_22,
RE_SetU_22 => System_Pack_22,
RE_Bits_23 => System_Pack_23,
RE_Get_23 => System_Pack_23,
RE_Set_23 => System_Pack_23,
RE_Bits_24 => System_Pack_24,
RE_Get_24 => System_Pack_24,
RE_GetU_24 => System_Pack_24,
RE_Set_24 => System_Pack_24,
RE_SetU_24 => System_Pack_24,
RE_Bits_25 => System_Pack_25,
RE_Get_25 => System_Pack_25,
RE_Set_25 => System_Pack_25,
RE_Bits_26 => System_Pack_26,
RE_Get_26 => System_Pack_26,
RE_GetU_26 => System_Pack_26,
RE_Set_26 => System_Pack_26,
RE_SetU_26 => System_Pack_26,
RE_Bits_27 => System_Pack_27,
RE_Get_27 => System_Pack_27,
RE_Set_27 => System_Pack_27,
RE_Bits_28 => System_Pack_28,
RE_Get_28 => System_Pack_28,
RE_GetU_28 => System_Pack_28,
RE_Set_28 => System_Pack_28,
RE_SetU_28 => System_Pack_28,
RE_Bits_29 => System_Pack_29,
RE_Get_29 => System_Pack_29,
RE_Set_29 => System_Pack_29,
RE_Bits_30 => System_Pack_30,
RE_Get_30 => System_Pack_30,
RE_GetU_30 => System_Pack_30,
RE_Set_30 => System_Pack_30,
RE_SetU_30 => System_Pack_30,
RE_Bits_31 => System_Pack_31,
RE_Get_31 => System_Pack_31,
RE_Set_31 => System_Pack_31,
RE_Bits_33 => System_Pack_33,
RE_Get_33 => System_Pack_33,
RE_Set_33 => System_Pack_33,
RE_Bits_34 => System_Pack_34,
RE_Get_34 => System_Pack_34,
RE_GetU_34 => System_Pack_34,
RE_Set_34 => System_Pack_34,
RE_SetU_34 => System_Pack_34,
RE_Bits_35 => System_Pack_35,
RE_Get_35 => System_Pack_35,
RE_Set_35 => System_Pack_35,
RE_Bits_36 => System_Pack_36,
RE_Get_36 => System_Pack_36,
RE_GetU_36 => System_Pack_36,
RE_Set_36 => System_Pack_36,
RE_SetU_36 => System_Pack_36,
RE_Bits_37 => System_Pack_37,
RE_Get_37 => System_Pack_37,
RE_Set_37 => System_Pack_37,
RE_Bits_38 => System_Pack_38,
RE_Get_38 => System_Pack_38,
RE_GetU_38 => System_Pack_38,
RE_Set_38 => System_Pack_38,
RE_SetU_38 => System_Pack_38,
RE_Bits_39 => System_Pack_39,
RE_Get_39 => System_Pack_39,
RE_Set_39 => System_Pack_39,
RE_Bits_40 => System_Pack_40,
RE_Get_40 => System_Pack_40,
RE_GetU_40 => System_Pack_40,
RE_Set_40 => System_Pack_40,
RE_SetU_40 => System_Pack_40,
RE_Bits_41 => System_Pack_41,
RE_Get_41 => System_Pack_41,
RE_Set_41 => System_Pack_41,
RE_Bits_42 => System_Pack_42,
RE_Get_42 => System_Pack_42,
RE_GetU_42 => System_Pack_42,
RE_Set_42 => System_Pack_42,
RE_SetU_42 => System_Pack_42,
RE_Bits_43 => System_Pack_43,
RE_Get_43 => System_Pack_43,
RE_Set_43 => System_Pack_43,
RE_Bits_44 => System_Pack_44,
RE_Get_44 => System_Pack_44,
RE_GetU_44 => System_Pack_44,
RE_Set_44 => System_Pack_44,
RE_SetU_44 => System_Pack_44,
RE_Bits_45 => System_Pack_45,
RE_Get_45 => System_Pack_45,
RE_Set_45 => System_Pack_45,
RE_Bits_46 => System_Pack_46,
RE_Get_46 => System_Pack_46,
RE_GetU_46 => System_Pack_46,
RE_Set_46 => System_Pack_46,
RE_SetU_46 => System_Pack_46,
RE_Bits_47 => System_Pack_47,
RE_Get_47 => System_Pack_47,
RE_Set_47 => System_Pack_47,
RE_Bits_48 => System_Pack_48,
RE_Get_48 => System_Pack_48,
RE_GetU_48 => System_Pack_48,
RE_Set_48 => System_Pack_48,
RE_SetU_48 => System_Pack_48,
RE_Bits_49 => System_Pack_49,
RE_Get_49 => System_Pack_49,
RE_Set_49 => System_Pack_49,
RE_Bits_50 => System_Pack_50,
RE_Get_50 => System_Pack_50,
RE_GetU_50 => System_Pack_50,
RE_Set_50 => System_Pack_50,
RE_SetU_50 => System_Pack_50,
RE_Bits_51 => System_Pack_51,
RE_Get_51 => System_Pack_51,
RE_Set_51 => System_Pack_51,
RE_Bits_52 => System_Pack_52,
RE_Get_52 => System_Pack_52,
RE_GetU_52 => System_Pack_52,
RE_Set_52 => System_Pack_52,
RE_SetU_52 => System_Pack_52,
RE_Bits_53 => System_Pack_53,
RE_Get_53 => System_Pack_53,
RE_Set_53 => System_Pack_53,
RE_Bits_54 => System_Pack_54,
RE_Get_54 => System_Pack_54,
RE_GetU_54 => System_Pack_54,
RE_Set_54 => System_Pack_54,
RE_SetU_54 => System_Pack_54,
RE_Bits_55 => System_Pack_55,
RE_Get_55 => System_Pack_55,
RE_Set_55 => System_Pack_55,
RE_Bits_56 => System_Pack_56,
RE_Get_56 => System_Pack_56,
RE_GetU_56 => System_Pack_56,
RE_Set_56 => System_Pack_56,
RE_SetU_56 => System_Pack_56,
RE_Bits_57 => System_Pack_57,
RE_Get_57 => System_Pack_57,
RE_Set_57 => System_Pack_57,
RE_Bits_58 => System_Pack_58,
RE_Get_58 => System_Pack_58,
RE_GetU_58 => System_Pack_58,
RE_Set_58 => System_Pack_58,
RE_SetU_58 => System_Pack_58,
RE_Bits_59 => System_Pack_59,
RE_Get_59 => System_Pack_59,
RE_Set_59 => System_Pack_59,
RE_Bits_60 => System_Pack_60,
RE_Get_60 => System_Pack_60,
RE_GetU_60 => System_Pack_60,
RE_Set_60 => System_Pack_60,
RE_SetU_60 => System_Pack_60,
RE_Bits_61 => System_Pack_61,
RE_Get_61 => System_Pack_61,
RE_Set_61 => System_Pack_61,
RE_Bits_62 => System_Pack_62,
RE_Get_62 => System_Pack_62,
RE_GetU_62 => System_Pack_62,
RE_Set_62 => System_Pack_62,
RE_SetU_62 => System_Pack_62,
RE_Bits_63 => System_Pack_63,
RE_Get_63 => System_Pack_63,
RE_Set_63 => System_Pack_63,
RE_Adjust_Storage_Size => System_Parameters,
RE_Default_Secondary_Stack_Size => System_Parameters,
RE_Default_Stack_Size => System_Parameters,
RE_Garbage_Collected => System_Parameters,
RE_Size_Type => System_Parameters,
RE_Unspecified_Size => System_Parameters,
RE_DSA_Implementation => System_Partition_Interface,
RE_PCS_Version => System_Partition_Interface,
RE_Get_RACW => System_Partition_Interface,
RE_Get_RCI_Package_Receiver => System_Partition_Interface,
RE_Get_Unique_Remote_Pointer => System_Partition_Interface,
RE_RACW_Stub_Type => System_Partition_Interface,
RE_RACW_Stub_Type_Access => System_Partition_Interface,
RE_RAS_Proxy_Type_Access => System_Partition_Interface,
RE_Raise_Program_Error_Unknown_Tag => System_Partition_Interface,
RE_Register_Passive_Package => System_Partition_Interface,
RE_Register_Receiving_Stub => System_Partition_Interface,
RE_Request => System_Partition_Interface,
RE_Request_Access => System_Partition_Interface,
RE_RCI_Locator => System_Partition_Interface,
RE_RCI_Subp_Info => System_Partition_Interface,
RE_RCI_Subp_Info_Array => System_Partition_Interface,
RE_Same_Partition => System_Partition_Interface,
RE_Subprogram_Id => System_Partition_Interface,
RE_Get_RAS_Info => System_Partition_Interface,
RE_To_PolyORB_String => System_Partition_Interface,
RE_Caseless_String_Eq => System_Partition_Interface,
RE_TypeCode => System_Partition_Interface,
RE_Any => System_Partition_Interface,
RE_Mode_In => System_Partition_Interface,
RE_Mode_Out => System_Partition_Interface,
RE_Mode_Inout => System_Partition_Interface,
RE_NamedValue => System_Partition_Interface,
RE_Result_Name => System_Partition_Interface,
RE_Object_Ref => System_Partition_Interface,
RE_Create_Any => System_Partition_Interface,
RE_Any_Aggregate_Build => System_Partition_Interface,
RE_Add_Aggregate_Element => System_Partition_Interface,
RE_Get_Aggregate_Element => System_Partition_Interface,
RE_Content_Type => System_Partition_Interface,
RE_Any_Member_Type => System_Partition_Interface,
RE_Get_Nested_Sequence_Length => System_Partition_Interface,
RE_Get_Any_Type => System_Partition_Interface,
RE_Extract_Union_Value => System_Partition_Interface,
RE_NVList_Ref => System_Partition_Interface,
RE_NVList_Create => System_Partition_Interface,
RE_NVList_Add_Item => System_Partition_Interface,
RE_Request_Arguments => System_Partition_Interface,
RE_Request_Invoke => System_Partition_Interface,
RE_Request_Raise_Occurrence => System_Partition_Interface,
RE_Request_Set_Out => System_Partition_Interface,
RE_Request_Setup => System_Partition_Interface,
RE_Nil_Exc_List => System_Partition_Interface,
RE_Servant => System_Partition_Interface,
RE_Move_Any_Value => System_Partition_Interface,
RE_Set_Result => System_Partition_Interface,
RE_Register_Obj_Receiving_Stub => System_Partition_Interface,
RE_Register_Pkg_Receiving_Stub => System_Partition_Interface,
RE_Is_Nil => System_Partition_Interface,
RE_Entity_Ptr => System_Partition_Interface,
RE_Entity_Of => System_Partition_Interface,
RE_Inc_Usage => System_Partition_Interface,
RE_Set_Ref => System_Partition_Interface,
RE_Make_Ref => System_Partition_Interface,
RE_Get_Local_Address => System_Partition_Interface,
RE_Get_Reference => System_Partition_Interface,
RE_Asynchronous_P_To_Sync_Scope => System_Partition_Interface,
RE_Buffer_Stream_Type => System_Partition_Interface,
RE_Release_Buffer => System_Partition_Interface,
RE_BS_To_Any => System_Partition_Interface,
RE_Any_To_BS => System_Partition_Interface,
RE_Build_Complex_TC => System_Partition_Interface,
RE_Get_TC => System_Partition_Interface,
RE_Set_TC => System_Partition_Interface,
RE_FA_A => System_Partition_Interface,
RE_FA_B => System_Partition_Interface,
RE_FA_C => System_Partition_Interface,
RE_FA_F => System_Partition_Interface,
RE_FA_I8 => System_Partition_Interface,
RE_FA_I16 => System_Partition_Interface,
RE_FA_I32 => System_Partition_Interface,
RE_FA_I64 => System_Partition_Interface,
RE_FA_LF => System_Partition_Interface,
RE_FA_LLF => System_Partition_Interface,
RE_FA_SF => System_Partition_Interface,
RE_FA_U8 => System_Partition_Interface,
RE_FA_U16 => System_Partition_Interface,
RE_FA_U32 => System_Partition_Interface,
RE_FA_U64 => System_Partition_Interface,
RE_FA_WC => System_Partition_Interface,
RE_FA_WWC => System_Partition_Interface,
RE_FA_String => System_Partition_Interface,
RE_FA_ObjRef => System_Partition_Interface,
RE_TA_A => System_Partition_Interface,
RE_TA_B => System_Partition_Interface,
RE_TA_C => System_Partition_Interface,
RE_TA_F => System_Partition_Interface,
RE_TA_I8 => System_Partition_Interface,
RE_TA_I16 => System_Partition_Interface,
RE_TA_I32 => System_Partition_Interface,
RE_TA_I64 => System_Partition_Interface,
RE_TA_LF => System_Partition_Interface,
RE_TA_LLF => System_Partition_Interface,
RE_TA_SF => System_Partition_Interface,
RE_TA_U8 => System_Partition_Interface,
RE_TA_U16 => System_Partition_Interface,
RE_TA_U32 => System_Partition_Interface,
RE_TA_U64 => System_Partition_Interface,
RE_TA_WC => System_Partition_Interface,
RE_TA_WWC => System_Partition_Interface,
RE_TA_String => System_Partition_Interface,
RE_TA_ObjRef => System_Partition_Interface,
RE_TA_Std_String => System_Partition_Interface,
RE_TA_TC => System_Partition_Interface,
RE_TC_A => System_Partition_Interface,
RE_TC_B => System_Partition_Interface,
RE_TC_C => System_Partition_Interface,
RE_TC_F => System_Partition_Interface,
RE_TC_I8 => System_Partition_Interface,
RE_TC_I16 => System_Partition_Interface,
RE_TC_I32 => System_Partition_Interface,
RE_TC_I64 => System_Partition_Interface,
RE_TC_LF => System_Partition_Interface,
RE_TC_LLF => System_Partition_Interface,
RE_TC_SF => System_Partition_Interface,
RE_TC_U8 => System_Partition_Interface,
RE_TC_U16 => System_Partition_Interface,
RE_TC_U32 => System_Partition_Interface,
RE_TC_U64 => System_Partition_Interface,
RE_TC_Void => System_Partition_Interface,
RE_TC_Opaque => System_Partition_Interface,
RE_TC_WC => System_Partition_Interface,
RE_TC_WWC => System_Partition_Interface,
RE_TC_String => System_Partition_Interface,
RE_Tk_Alias => System_Partition_Interface,
RE_Tk_Array => System_Partition_Interface,
RE_Tk_Sequence => System_Partition_Interface,
RE_Tk_Struct => System_Partition_Interface,
RE_Tk_Objref => System_Partition_Interface,
RE_Tk_Union => System_Partition_Interface,
RE_Global_Pool_Object => System_Pool_Global,
RE_Global_Pool_32_Object => System_Pool_32_Global,
RE_Stack_Bounded_Pool => System_Pool_Size,
RE_Put_Image_Integer => System_Put_Images,
RE_Put_Image_Long_Long_Integer => System_Put_Images,
RE_Put_Image_Unsigned => System_Put_Images,
RE_Put_Image_Long_Long_Unsigned => System_Put_Images,
RE_Put_Image_Thin_Pointer => System_Put_Images,
RE_Put_Image_Fat_Pointer => System_Put_Images,
RE_Put_Image_Access_Subp => System_Put_Images,
RE_Put_Image_Access_Prot_Subp => System_Put_Images,
RE_Put_Image_String => System_Put_Images,
RE_Put_Image_Wide_String => System_Put_Images,
RE_Put_Image_Wide_Wide_String => System_Put_Images,
RE_Array_Before => System_Put_Images,
RE_Array_Between => System_Put_Images,
RE_Array_After => System_Put_Images,
RE_Simple_Array_Between => System_Put_Images,
RE_Record_Before => System_Put_Images,
RE_Record_Between => System_Put_Images,
RE_Record_After => System_Put_Images,
RE_Put_Image_Unknown => System_Put_Images,
RE_Put_Image_Protected => System_Put_Task_Images,
RE_Put_Image_Task => System_Put_Task_Images,
RO_RD_Delay_For => System_Relative_Delays,
RE_Do_Apc => System_RPC,
RE_Do_Rpc => System_RPC,
RE_Params_Stream_Type => System_RPC,
RE_Partition_ID => System_RPC,
RE_IS_Is1 => System_Scalar_Values,
RE_IS_Is2 => System_Scalar_Values,
RE_IS_Is4 => System_Scalar_Values,
RE_IS_Is8 => System_Scalar_Values,
RE_IS_Iu1 => System_Scalar_Values,
RE_IS_Iu2 => System_Scalar_Values,
RE_IS_Iu4 => System_Scalar_Values,
RE_IS_Iu8 => System_Scalar_Values,
RE_IS_Iz1 => System_Scalar_Values,
RE_IS_Iz2 => System_Scalar_Values,
RE_IS_Iz4 => System_Scalar_Values,
RE_IS_Iz8 => System_Scalar_Values,
RE_IS_Isf => System_Scalar_Values,
RE_IS_Ifl => System_Scalar_Values,
RE_IS_Ilf => System_Scalar_Values,
RE_IS_Ill => System_Scalar_Values,
RE_Mark_Id => System_Secondary_Stack,
RE_SS_Allocate => System_Secondary_Stack,
RE_SS_Mark => System_Secondary_Stack,
RE_SS_Pool => System_Secondary_Stack,
RE_SS_Release => System_Secondary_Stack,
RE_SS_Stack => System_Secondary_Stack,
RE_Shared_Var_Lock => System_Shared_Storage,
RE_Shared_Var_Unlock => System_Shared_Storage,
RE_Shared_Var_Procs => System_Shared_Storage,
RE_Abort_Undefer_Direct => System_Standard_Library,
RE_Exception_Data_Ptr => System_Standard_Library,
RE_Integer_Address => System_Storage_Elements,
RE_Storage_Array => System_Storage_Elements,
RE_Storage_Count => System_Storage_Elements,
RE_Storage_Offset => System_Storage_Elements,
RE_To_Address => System_Storage_Elements,
RE_Allocate_Any => System_Storage_Pools,
RE_Deallocate_Any => System_Storage_Pools,
RE_Root_Storage_Pool => System_Storage_Pools,
RE_Root_Storage_Pool_Ptr => System_Storage_Pools,
RE_Adjust_Controlled_Dereference => System_Storage_Pools_Subpools,
RE_Allocate_Any_Controlled => System_Storage_Pools_Subpools,
RE_Deallocate_Any_Controlled => System_Storage_Pools_Subpools,
RE_Header_Size_With_Padding => System_Storage_Pools_Subpools,
RE_Root_Storage_Pool_With_Subpools => System_Storage_Pools_Subpools,
RE_Root_Subpool => System_Storage_Pools_Subpools,
RE_Subpool_Handle => System_Storage_Pools_Subpools,
RE_I_AD => System_Stream_Attributes,
RE_I_AS => System_Stream_Attributes,
RE_I_B => System_Stream_Attributes,
RE_I_C => System_Stream_Attributes,
RE_I_F => System_Stream_Attributes,
RE_I_I => System_Stream_Attributes,
RE_I_I24 => System_Stream_Attributes,
RE_I_LF => System_Stream_Attributes,
RE_I_LI => System_Stream_Attributes,
RE_I_LLF => System_Stream_Attributes,
RE_I_LLI => System_Stream_Attributes,
RE_I_LLU => System_Stream_Attributes,
RE_I_LU => System_Stream_Attributes,
RE_I_SF => System_Stream_Attributes,
RE_I_SI => System_Stream_Attributes,
RE_I_SSI => System_Stream_Attributes,
RE_I_SSU => System_Stream_Attributes,
RE_I_SU => System_Stream_Attributes,
RE_I_U => System_Stream_Attributes,
RE_I_U24 => System_Stream_Attributes,
RE_I_WC => System_Stream_Attributes,
RE_I_WWC => System_Stream_Attributes,
RE_W_AD => System_Stream_Attributes,
RE_W_AS => System_Stream_Attributes,
RE_W_B => System_Stream_Attributes,
RE_W_C => System_Stream_Attributes,
RE_W_F => System_Stream_Attributes,
RE_W_I => System_Stream_Attributes,
RE_W_I24 => System_Stream_Attributes,
RE_W_LF => System_Stream_Attributes,
RE_W_LI => System_Stream_Attributes,
RE_W_LLF => System_Stream_Attributes,
RE_W_LLI => System_Stream_Attributes,
RE_W_LLU => System_Stream_Attributes,
RE_W_LU => System_Stream_Attributes,
RE_W_SF => System_Stream_Attributes,
RE_W_SI => System_Stream_Attributes,
RE_W_SSI => System_Stream_Attributes,
RE_W_SSU => System_Stream_Attributes,
RE_W_SU => System_Stream_Attributes,
RE_W_U => System_Stream_Attributes,
RE_W_U24 => System_Stream_Attributes,
RE_W_WC => System_Stream_Attributes,
RE_W_WWC => System_Stream_Attributes,
RE_Storage_Array_Input => System_Strings_Stream_Ops,
RE_Storage_Array_Input_Blk_IO => System_Strings_Stream_Ops,
RE_Storage_Array_Output => System_Strings_Stream_Ops,
RE_Storage_Array_Output_Blk_IO => System_Strings_Stream_Ops,
RE_Storage_Array_Read => System_Strings_Stream_Ops,
RE_Storage_Array_Read_Blk_IO => System_Strings_Stream_Ops,
RE_Storage_Array_Write => System_Strings_Stream_Ops,
RE_Storage_Array_Write_Blk_IO => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Input => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Input_Blk_IO => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Output => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Output_Blk_IO => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Read => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Read_Blk_IO => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Write => System_Strings_Stream_Ops,
RE_Stream_Element_Array_Write_Blk_IO => System_Strings_Stream_Ops,
RE_String_Input => System_Strings_Stream_Ops,
RE_String_Input_Blk_IO => System_Strings_Stream_Ops,
RE_String_Input_Tag => System_Strings_Stream_Ops,
RE_String_Output => System_Strings_Stream_Ops,
RE_String_Output_Blk_IO => System_Strings_Stream_Ops,
RE_String_Read => System_Strings_Stream_Ops,
RE_String_Read_Blk_IO => System_Strings_Stream_Ops,
RE_String_Write => System_Strings_Stream_Ops,
RE_String_Write_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_String_Input => System_Strings_Stream_Ops,
RE_Wide_String_Input_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_String_Output => System_Strings_Stream_Ops,
RE_Wide_String_Output_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_String_Read => System_Strings_Stream_Ops,
RE_Wide_String_Read_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_String_Write => System_Strings_Stream_Ops,
RE_Wide_String_Write_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Input => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Input_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Output => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Output_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Read => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Read_Blk_IO => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Write => System_Strings_Stream_Ops,
RE_Wide_Wide_String_Write_Blk_IO => System_Strings_Stream_Ops,
RE_Task_Info_Type => System_Task_Info,
RE_Unspecified_Task_Info => System_Task_Info,
RE_Task_Procedure_Access => System_Tasking,
RO_ST_Number_Of_Entries => System_Tasking,
RO_ST_Task_Id => System_Tasking,
RO_ST_Null_Task => System_Tasking,
RE_Call_Modes => System_Tasking,
RE_Simple_Call => System_Tasking,
RE_Conditional_Call => System_Tasking,
RE_Asynchronous_Call => System_Tasking,
RE_Foreign_Task_Level => System_Tasking,
RE_Environment_Task_Level => System_Tasking,
RE_Independent_Task_Level => System_Tasking,
RE_Library_Task_Level => System_Tasking,
RE_Ada_Task_Control_Block => System_Tasking,
RE_Task_List => System_Tasking,
RE_Accept_List => System_Tasking,
RE_No_Rendezvous => System_Tasking,
RE_Null_Task_Entry => System_Tasking,
RE_Select_Index => System_Tasking,
RE_Else_Mode => System_Tasking,
RE_Simple_Mode => System_Tasking,
RE_Terminate_Mode => System_Tasking,
RE_Delay_Mode => System_Tasking,
RE_Entry_Index => System_Tasking,
RE_Task_Entry_Index => System_Tasking,
RE_Self => System_Tasking,
RE_Master_Id => System_Tasking,
RE_Unspecified_Priority => System_Tasking,
RE_Activation_Chain => System_Tasking,
RE_Activation_Chain_Access => System_Tasking,
RE_Storage_Size => System_Tasking,
RE_Unspecified_CPU => System_Tasking,
RE_Dispatching_Domain_Access => System_Tasking,
RE_Abort_Defer => System_Soft_Links,
RE_Abort_Undefer => System_Soft_Links,
RE_Complete_Master => System_Soft_Links,
RE_Current_Master => System_Soft_Links,
RE_Dummy_Communication_Block => System_Soft_Links,
RE_Enter_Master => System_Soft_Links,
RE_Get_Current_Excep => System_Soft_Links,
RE_Get_GNAT_Exception => System_Soft_Links,
RE_Save_Library_Occurrence => System_Soft_Links,
RE_Bits_1 => System_Unsigned_Types,
RE_Bits_2 => System_Unsigned_Types,
RE_Bits_4 => System_Unsigned_Types,
RE_Float_Unsigned => System_Unsigned_Types,
RE_Long_Unsigned => System_Unsigned_Types,
RE_Long_Long_Unsigned => System_Unsigned_Types,
RE_Packed_Byte => System_Unsigned_Types,
RE_Packed_Bytes1 => System_Unsigned_Types,
RE_Packed_Bytes2 => System_Unsigned_Types,
RE_Packed_Bytes4 => System_Unsigned_Types,
RE_Rev_Packed_Bytes1 => System_Unsigned_Types,
RE_Rev_Packed_Bytes2 => System_Unsigned_Types,
RE_Rev_Packed_Bytes4 => System_Unsigned_Types,
RE_Short_Unsigned => System_Unsigned_Types,
RE_Short_Short_Unsigned => System_Unsigned_Types,
RE_Unsigned => System_Unsigned_Types,
RE_Value_Boolean => System_Val_Bool,
RE_Value_Character => System_Val_Char,
RE_Value_Decimal => System_Val_Dec,
RE_Value_Enumeration_8 => System_Val_Enum,
RE_Value_Enumeration_16 => System_Val_Enum,
RE_Value_Enumeration_32 => System_Val_Enum,
RE_Value_Integer => System_Val_Int,
RE_Value_Long_Long_Decimal => System_Val_LLD,
RE_Value_Long_Long_Integer => System_Val_LLI,
RE_Value_Long_Long_Unsigned => System_Val_LLU,
RE_Value_Real => System_Val_Real,
RE_Value_Unsigned => System_Val_Uns,
RE_Value_Wide_Character => System_Val_WChar,
RE_Value_Wide_Wide_Character => System_Val_WChar,
RE_Version_String => System_Version_Control,
RE_Get_Version_String => System_Version_Control,
RE_String_To_Wide_String => System_WCh_StW,
RE_String_To_Wide_Wide_String => System_WCh_StW,
RE_Wide_String_To_String => System_WCh_WtS,
RE_Wide_Wide_String_To_String => System_WCh_WtS,
RE_Wide_Wide_Width_Character => System_WWd_Char,
RE_Wide_Width_Character => System_WWd_Char,
RE_Wide_Wide_Width_Enumeration_8 => System_WWd_Enum,
RE_Wide_Wide_Width_Enumeration_16 => System_WWd_Enum,
RE_Wide_Wide_Width_Enumeration_32 => System_WWd_Enum,
RE_Wide_Width_Enumeration_8 => System_WWd_Enum,
RE_Wide_Width_Enumeration_16 => System_WWd_Enum,
RE_Wide_Width_Enumeration_32 => System_WWd_Enum,
RE_Wide_Wide_Width_Wide_Character => System_WWd_Wchar,
RE_Wide_Wide_Width_Wide_Wide_Char => System_WWd_Wchar,
RE_Wide_Width_Wide_Character => System_WWd_Wchar,
RE_Wide_Width_Wide_Wide_Character => System_WWd_Wchar,
RE_Width_Boolean => System_Wid_Bool,
RE_Width_Character => System_Wid_Char,
RE_Width_Enumeration_8 => System_Wid_Enum,
RE_Width_Enumeration_16 => System_Wid_Enum,
RE_Width_Enumeration_32 => System_Wid_Enum,
RE_Width_Long_Long_Integer => System_Wid_LLI,
RE_Width_Long_Long_Unsigned => System_Wid_LLU,
RE_Width_Wide_Character => System_Wid_WChar,
RE_Width_Wide_Wide_Character => System_Wid_WChar,
RE_Dispatching_Domain =>
System_Multiprocessors_Dispatching_Domains,
RE_Protected_Entry_Body_Array =>
System_Tasking_Protected_Objects_Entries,
RE_Protected_Entry_Queue_Max_Array =>
System_Tasking_Protected_Objects_Entries,
RE_Protection_Entries =>
System_Tasking_Protected_Objects_Entries,
RE_Protection_Entries_Access =>
System_Tasking_Protected_Objects_Entries,
RE_Initialize_Protection_Entries =>
System_Tasking_Protected_Objects_Entries,
RE_Lock_Entries =>
System_Tasking_Protected_Objects_Entries,
RE_Unlock_Entries =>
System_Tasking_Protected_Objects_Entries,
RO_PE_Get_Ceiling =>
System_Tasking_Protected_Objects_Entries,
RO_PE_Number_Of_Entries =>
System_Tasking_Protected_Objects_Entries,
RO_PE_Set_Ceiling =>
System_Tasking_Protected_Objects_Entries,
RE_Communication_Block =>
System_Tasking_Protected_Objects_Operations,
RE_Protected_Entry_Call =>
System_Tasking_Protected_Objects_Operations,
RE_Service_Entries =>
System_Tasking_Protected_Objects_Operations,
RE_Cancel_Protected_Entry_Call =>
System_Tasking_Protected_Objects_Operations,
RE_Enqueued =>
System_Tasking_Protected_Objects_Operations,
RE_Cancelled =>
System_Tasking_Protected_Objects_Operations,
RE_Complete_Entry_Body =>
System_Tasking_Protected_Objects_Operations,
RE_Exceptional_Complete_Entry_Body =>
System_Tasking_Protected_Objects_Operations,
RE_Requeue_Protected_Entry =>
System_Tasking_Protected_Objects_Operations,
RE_Requeue_Task_To_Protected_Entry =>
System_Tasking_Protected_Objects_Operations,
RE_Protected_Count =>
System_Tasking_Protected_Objects_Operations,
RE_Protected_Entry_Caller =>
System_Tasking_Protected_Objects_Operations,
RE_Timed_Protected_Entry_Call =>
System_Tasking_Protected_Objects_Operations,
RE_Protection_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Initialize_Protection_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Lock_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Unlock_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Protected_Single_Entry_Call =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Service_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Exceptional_Complete_Single_Entry_Body =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Protected_Count_Entry =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Protected_Single_Entry_Caller =>
System_Tasking_Protected_Objects_Single_Entry,
RE_Protected_Entry_Index => System_Tasking_Protected_Objects,
RE_Entry_Body => System_Tasking_Protected_Objects,
RE_Protection => System_Tasking_Protected_Objects,
RE_Initialize_Protection => System_Tasking_Protected_Objects,
RE_Finalize_Protection => System_Tasking_Protected_Objects,
RE_Lock => System_Tasking_Protected_Objects,
RE_Lock_Read_Only => System_Tasking_Protected_Objects,
RE_Get_Ceiling => System_Tasking_Protected_Objects,
RE_Set_Ceiling => System_Tasking_Protected_Objects,
RE_Unlock => System_Tasking_Protected_Objects,
RE_Delay_Block => System_Tasking_Async_Delays,
RE_Timed_Out => System_Tasking_Async_Delays,
RE_Cancel_Async_Delay => System_Tasking_Async_Delays,
RE_Enqueue_Duration => System_Tasking_Async_Delays,
RE_Enqueue_Calendar =>
System_Tasking_Async_Delays_Enqueue_Calendar,
RE_Enqueue_RT =>
System_Tasking_Async_Delays_Enqueue_RT,
RE_Accept_Call => System_Tasking_Rendezvous,
RE_Accept_Trivial => System_Tasking_Rendezvous,
RE_Callable => System_Tasking_Rendezvous,
RE_Call_Simple => System_Tasking_Rendezvous,
RE_Cancel_Task_Entry_Call => System_Tasking_Rendezvous,
RE_Requeue_Task_Entry => System_Tasking_Rendezvous,
RE_Requeue_Protected_To_Task_Entry => System_Tasking_Rendezvous,
RE_Complete_Rendezvous => System_Tasking_Rendezvous,
RE_Task_Count => System_Tasking_Rendezvous,
RE_Exceptional_Complete_Rendezvous => System_Tasking_Rendezvous,
RE_Selective_Wait => System_Tasking_Rendezvous,
RE_Task_Entry_Call => System_Tasking_Rendezvous,
RE_Task_Entry_Caller => System_Tasking_Rendezvous,
RE_Timed_Task_Entry_Call => System_Tasking_Rendezvous,
RE_Timed_Selective_Wait => System_Tasking_Rendezvous,
RE_Activate_Restricted_Tasks => System_Tasking_Restricted_Stages,
RE_Complete_Restricted_Activation => System_Tasking_Restricted_Stages,
RE_Create_Restricted_Task => System_Tasking_Restricted_Stages,
RE_Create_Restricted_Task_Sequential => System_Tasking_Restricted_Stages,
RE_Complete_Restricted_Task => System_Tasking_Restricted_Stages,
RE_Restricted_Terminated => System_Tasking_Restricted_Stages,
RE_Abort_Tasks => System_Tasking_Stages,
RE_Activate_Tasks => System_Tasking_Stages,
RE_Complete_Activation => System_Tasking_Stages,
RE_Create_Task => System_Tasking_Stages,
RE_Complete_Task => System_Tasking_Stages,
RE_Free_Task => System_Tasking_Stages,
RE_Expunge_Unactivated_Tasks => System_Tasking_Stages,
RE_Move_Activation_Chain => System_Tasking_Stages,
RE_Terminated => System_Tasking_Stages);
--------------------------------
-- Configurable Run-Time Mode --
--------------------------------
-- Part of the job of Rtsfind is to enforce run-time restrictions in
-- configurable run-time mode. This is done by monitoring implicit access
-- to the run time library requested by calls to the RTE function. A call
-- may be invalid in configurable run-time mode for either of the
-- following two reasons:
-- 1. File in which entity lives is not present in run-time library
-- 2. File is present, but entity is not defined in the file
-- In normal mode, either or these two situations is a fatal error
-- that indicates that the run-time library is incorrectly configured,
-- and a fatal error message is issued to signal this error.
-- In configurable run-time mode, either of these two situations indicates
-- simply that the corresponding operation is not available in the current
-- run-time that is use. This is not a configuration error, but rather a
-- natural result of a limited run-time. This situation is signalled by
-- raising the exception RE_Not_Available. The caller must respond to
-- this exception by posting an appropriate error message.
----------------------
-- No_Run_Time_Mode --
----------------------
-- For backwards compatibility with previous versions of GNAT, the
-- compiler recognizes the pragma No_Run_Time. This provides a special
-- version of configurable run-time mode that operates with the standard
-- run-time library, but allows only a subset of entities to be
-- accessed. If any other entity is accessed, then it is treated
-- as a configurable run-time violation, and the exception
-- RE_Not_Available is raised.
-- The following array defines the set of units that contain entities
-- that can be referenced in No_Run_Time mode. For each of these units,
-- all entities defined in the unit can be used in this mode.
OK_No_Run_Time_Unit : constant array (RTU_Id) of Boolean :=
(Ada_Exceptions => True,
Ada_Tags => True,
Interfaces => True,
System => True,
System_Parameters => True,
System_Fat_Flt => True,
System_Fat_LFlt => True,
System_Fat_LLF => True,
System_Fat_SFlt => True,
System_Machine_Code => True,
System_Secondary_Stack => True,
System_Storage_Elements => True,
System_Task_Info => True,
System_Unsigned_Types => True,
others => False);
-----------------
-- Subprograms --
-----------------
RE_Not_Available : exception;
-- Raised by RTE if the requested entity is not available. This can
-- occur either because the file in which the entity should be found
-- does not exist, or because the entity is not present in the file.
procedure Check_Text_IO_Special_Unit (Nam : Node_Id);
-- In Ada 83, and hence for compatibility in later versions of Ada, package
-- Text_IO has generic subpackages (e.g. Integer_IO). They really should be
-- child packages, and in GNAT, they *are* child packages. To maintain the
-- required compatibility, this routine is called for package renamings and
-- generic instantiations, with the simple name of the referenced package.
-- If Text_IO has been with'ed and if the simple name of Nam matches
-- one of the subpackages of Text_IO, then this subpackage is with'ed
-- automatically. The important result of this approach is that Text_IO
-- does not drag in all the code for the subpackages unless they are used.
-- Our test is a little crude, and could drag in stuff when it is not
-- necessary, but that is acceptable. Wide_[Wide_]Text_IO is handled in
-- a similar manner.
procedure Initialize;
-- Procedure to initialize data structures used by RTE. Called at the
-- start of processing a new main source file. Must be called after
-- Initialize_Snames (since names it enters into name table must come
-- after names entered by Snames).
function Is_RTE (Ent : Entity_Id; E : RE_Id) return Boolean;
-- This function determines if the given entity corresponds to the entity
-- referenced by RE_Id. It is similar in effect to (Ent = RTE (E)) except
-- that the latter would unconditionally load the unit containing E. For
-- this call, if the unit is not loaded, then a result of False is returned
-- immediately, since obviously Ent cannot be the entity in question if the
-- corresponding unit has not been loaded.
function Is_RTU (Ent : Entity_Id; U : RTU_Id) return Boolean;
pragma Inline (Is_RTU);
-- This function determines if the given entity corresponds to the entity
-- for the unit referenced by U. If this unit has not been loaded, the
-- answer will always be False. If the unit has been loaded, then the
-- entity id values are compared and True is returned if Ent is the
-- entity for this unit.
function Is_Text_IO_Special_Unit (Nam : Node_Id) return Boolean;
-- Returns True if the given Nam is an Expanded Name, whose Prefix is Ada,
-- and whose selector is either Text_IO.xxx or Wide_Text_IO.xxx or
-- Wide_Wide_Text_IO.xxx, where xxx is one of the subpackages of Text_IO
-- that is specially handled as described for Check_Text_IO_Special_Unit.
function Is_Text_IO_Special_Package (E : Entity_Id) return Boolean;
-- Return True iff E is one of the special generic Text_IO packages, which
-- Ada RM defines to be nested in Ada.Text_IO, but GNAT defines as its
-- private children. This is similar to Is_Text_IO_Special_Unit, but is
-- meant to be used on a fully resolved AST, especially in the backends.
-- This is used by SPARK.
function RTE (E : RE_Id) return Entity_Id;
-- Given the entity defined in the above tables, as identified by the
-- corresponding value in the RE_Id enumeration type, returns the Id of the
-- corresponding entity, first loading in (parsing, analyzing and
-- expanding) its spec if the unit has not already been loaded. For
-- efficiency reasons, this routine restricts the search to the package
-- entity chain.
--
-- Note: In the case of a package, RTE can return either an entity that is
-- declared at the top level of the package, or the package entity itself.
-- If an entity within the package has the same simple name as the package,
-- then the entity within the package is returned.
--
-- If RTE returns, the returned value is the required entity
--
-- If the entity is not available, then an error message is given. The
-- form of the message depends on whether we are in configurable run time
-- mode or not. In configurable run time mode, a missing entity is not
-- that surprising and merely says that the particular construct is not
-- supported by the run-time in use. If we are not in configurable run
-- time mode, a missing entity is some kind of run-time configuration
-- error. In either case, the result of the call is to raise the exception
-- RE_Not_Available, which should terminate the expansion of the current
-- construct.
function RTE_Available (E : RE_Id) return Boolean;
-- Returns true if a call to RTE will succeed without raising an exception
-- and without generating an error message, i.e. if the call will obtain
-- the desired entity without any problems.
--
-- If we call this and it returns True, we should generate a call to E.
-- In other words, the compiler should not call RTE_Available (E) until
-- it has decided it wants to generate a call to E. Otherwise we can get
-- spurious dependencies and elaboration orders.
--
-- if RTE_Available (E) -- WRONG!
-- and then <some condition>
-- then
-- generate call to E;
--
-- Should be:
--
-- if <some condition>
-- and then RTE_Available (E) -- Correct
-- then
-- generate call to E;
function RTE_Record_Component (E : RE_Id) return Entity_Id;
-- Given the entity defined in the above tables, as identified by the
-- corresponding value in the RE_Id enumeration type, returns the Id of
-- the corresponding entity, first loading in (parsing, analyzing and
-- expanding) its spec if the unit has not already been loaded. For
-- efficiency reasons, this routine restricts the search of E to fields
-- of record type declarations found in the package entity chain.
--
-- Note: In the case of a package, RTE can return either an entity that is
-- declared at the top level of the package, or the package entity itself.
-- If an entity within the package has the same simple name as the package,
-- then the entity within the package is returned.
--
-- If RTE returns, the returned value is the required entity
--
-- If the entity is not available, then an error message is given. The
-- form of the message depends on whether we are in configurable run time
-- mode or not. In configurable run time mode, a missing entity is not
-- that surprising and merely says that the particular construct is not
-- supported by the run-time in use. If we are not in configurable run
-- time mode, a missing entity is some kind of run-time configuration
-- error. In either case, the result of the call is to raise the exception
-- RE_Not_Available, which should terminate the expansion of the current
-- construct.
function RTE_Record_Component_Available (E : RE_Id) return Boolean;
-- Returns true if a call to RTE_Record_Component will succeed without
-- raising an exception and without generating an error message, i.e.
-- if the call will obtain the desired entity without any problems.
function RTU_Entity (U : RTU_Id) return Entity_Id;
pragma Inline (RTU_Entity);
-- This function returns the entity for the unit referenced by U. If
-- this unit has not been loaded, it returns Empty.
function RTU_Loaded (U : RTU_Id) return Boolean;
pragma Inline (RTU_Loaded);
-- Returns true if indicated unit has already been successfully loaded.
-- If the unit has not been loaded, returns False. Note that this does
-- not mean that an attempt to load it subsequently would fail.
procedure Set_RTU_Loaded (N : Node_Id);
-- Register the predefined unit N as already loaded
procedure SPARK_Implicit_Load (E : RE_Id);
-- Force loading of the unit containing the entity E; only needed in
-- GNATprove mode when processing code that implicitly references a
-- given entity.
end Rtsfind;
| 49.361237 | 79 | 0.544125 |
a170cf3b7ccfb95d543c59f9e3bd468429bc5035 | 2,507 | ads | Ada | regtests/client/src/client/testapi-clients.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 17 | 2017-09-09T15:52:14.000Z | 2022-01-23T01:18:06.000Z | regtests/client/src/client/testapi-clients.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 13 | 2020-10-04T16:04:42.000Z | 2022-03-25T19:33:03.000Z | regtests/client/src/client/testapi-clients.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 4 | 2021-01-06T08:43:55.000Z | 2022-03-11T21:45:06.000Z | -- REST API Validation
-- API to validate
--
-- The version of the OpenAPI document: 1.0.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1-SNAPSHOT.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with TestAPI.Models;
with Swagger.Clients;
package TestAPI.Clients is
pragma Style_Checks ("-mr");
type Client_Type is new Swagger.Clients.Client_Type with null record;
--
-- Query an orchestrated service instance
procedure Orch_Store
(Client : in out Client_Type;
Inline_Object_3Type : in TestAPI.Models.InlineObject3_Type);
-- Create a ticket
procedure Do_Create_Ticket
(Client : in out Client_Type;
Title : in Swagger.UString;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString);
-- Delete a ticket
procedure Do_Delete_Ticket
(Client : in out Client_Type;
Tid : in Swagger.Long);
-- List the tickets
procedure Do_Head_Ticket
(Client : in out Client_Type);
-- Patch a ticket
procedure Do_Patch_Ticket
(Client : in out Client_Type;
Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type);
-- Update a ticket
procedure Do_Update_Ticket
(Client : in out Client_Type;
Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type);
-- Get a ticket
-- Get a ticket
procedure Do_Get_Ticket
(Client : in out Client_Type;
Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type);
-- List the tickets
-- List the tickets created for the project.
procedure Do_List_Tickets
(Client : in out Client_Type;
Status : in Swagger.Nullable_UString;
Owner : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type_Vectors.Vector);
-- Get a ticket
-- Get a ticket
procedure Do_Options_Ticket
(Client : in out Client_Type;
Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type);
end TestAPI.Clients;
| 29.845238 | 77 | 0.676905 |
06136c36e0e5484cf4c5d642c1b3cdacc2ee2447 | 318 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/alignment8.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/alignment8.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/alignment8.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
with System;
procedure Alignment8 is
type R is record
I : Integer;
F : Long_Long_Integer;
end record;
for R'Alignment use 8;
procedure Q (A : System.Address) is
F : Long_Long_Integer;
for F'Address use A;
begin
F := 0;
end;
V : R;
begin
Q (V.F'Address);
end;
| 12.72 | 37 | 0.603774 |
0698a316571b4f9f93d26b85d30d4e8dcb927201 | 7,593 | ads | Ada | msp430x2/msp430g2553/svd/msp430_svd-timer_1_a3.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | msp430x2/msp430g2553/svd/msp430_svd-timer_1_a3.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | msp430x2/msp430g2553/svd/msp430_svd-timer_1_a3.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | -- This spec has been automatically generated from msp430g2553.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- Timer1_A3
package MSP430_SVD.TIMER_1_A3 is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Timer A mode control 1
type TA1CTL_MC_Field is
(-- Timer A mode control: 0 - Stop
Mc_0,
-- Timer A mode control: 1 - Up to CCR0
Mc_1,
-- Timer A mode control: 2 - Continous up
Mc_2,
-- Timer A mode control: 3 - Up/Down
Mc_3)
with Size => 2;
for TA1CTL_MC_Field use
(Mc_0 => 0,
Mc_1 => 1,
Mc_2 => 2,
Mc_3 => 3);
-- Timer A clock input divider 1
type TA1CTL_ID_Field is
(-- Timer A input divider: 0 - /1
Id_0,
-- Timer A input divider: 1 - /2
Id_1,
-- Timer A input divider: 2 - /4
Id_2,
-- Timer A input divider: 3 - /8
Id_3)
with Size => 2;
for TA1CTL_ID_Field use
(Id_0 => 0,
Id_1 => 1,
Id_2 => 2,
Id_3 => 3);
-- Timer A clock source select 1
type TA1CTL_TASSEL_Field is
(-- Timer A clock source select: 0 - TACLK
Tassel_0,
-- Timer A clock source select: 1 - ACLK
Tassel_1,
-- Timer A clock source select: 2 - SMCLK
Tassel_2,
-- Timer A clock source select: 3 - INCLK
Tassel_3)
with Size => 2;
for TA1CTL_TASSEL_Field use
(Tassel_0 => 0,
Tassel_1 => 1,
Tassel_2 => 2,
Tassel_3 => 3);
-- Timer1_A3 Control
type TA1CTL_Register is record
-- Timer A counter interrupt flag
TAIFG : MSP430_SVD.Bit := 16#0#;
-- Timer A counter interrupt enable
TAIE : MSP430_SVD.Bit := 16#0#;
-- Timer A counter clear
TACLR : MSP430_SVD.Bit := 16#0#;
-- unspecified
Reserved_3_3 : MSP430_SVD.Bit := 16#0#;
-- Timer A mode control 1
MC : TA1CTL_MC_Field := MSP430_SVD.TIMER_1_A3.Mc_0;
-- Timer A clock input divider 1
ID : TA1CTL_ID_Field := MSP430_SVD.TIMER_1_A3.Id_0;
-- Timer A clock source select 1
TASSEL : TA1CTL_TASSEL_Field := MSP430_SVD.TIMER_1_A3.Tassel_0;
-- unspecified
Reserved_10_15 : MSP430_SVD.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 16,
Bit_Order => System.Low_Order_First;
for TA1CTL_Register use record
TAIFG at 0 range 0 .. 0;
TAIE at 0 range 1 .. 1;
TACLR at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
MC at 0 range 4 .. 5;
ID at 0 range 6 .. 7;
TASSEL at 0 range 8 .. 9;
Reserved_10_15 at 0 range 10 .. 15;
end record;
-- Output mode 2
type TA1CCTL0_OUTMOD_Field is
(-- PWM output mode: 0 - output only
Outmod_0,
-- PWM output mode: 1 - set
Outmod_1,
-- PWM output mode: 2 - PWM toggle/reset
Outmod_2,
-- PWM output mode: 3 - PWM set/reset
Outmod_3,
-- PWM output mode: 4 - toggle
Outmod_4,
-- PWM output mode: 5 - Reset
Outmod_5,
-- PWM output mode: 6 - PWM toggle/set
Outmod_6,
-- PWM output mode: 7 - PWM reset/set
Outmod_7)
with Size => 3;
for TA1CCTL0_OUTMOD_Field use
(Outmod_0 => 0,
Outmod_1 => 1,
Outmod_2 => 2,
Outmod_3 => 3,
Outmod_4 => 4,
Outmod_5 => 5,
Outmod_6 => 6,
Outmod_7 => 7);
-- Capture input select 1
type TA1CCTL0_CCIS_Field is
(-- Capture input select: 0 - CCIxA
Ccis_0,
-- Capture input select: 1 - CCIxB
Ccis_1,
-- Capture input select: 2 - GND
Ccis_2,
-- Capture input select: 3 - Vcc
Ccis_3)
with Size => 2;
for TA1CCTL0_CCIS_Field use
(Ccis_0 => 0,
Ccis_1 => 1,
Ccis_2 => 2,
Ccis_3 => 3);
-- Capture mode 1
type TA1CCTL0_CM_Field is
(-- Capture mode: 0 - disabled
Cm_0,
-- Capture mode: 1 - pos. edge
Cm_1,
-- Capture mode: 1 - neg. edge
Cm_2,
-- Capture mode: 1 - both edges
Cm_3)
with Size => 2;
for TA1CCTL0_CM_Field use
(Cm_0 => 0,
Cm_1 => 1,
Cm_2 => 2,
Cm_3 => 3);
-- Timer1_A3 Capture/Compare Control 0
type TA1CCTL_Register is record
-- Capture/compare interrupt flag
CCIFG : MSP430_SVD.Bit := 16#0#;
-- Capture/compare overflow flag
COV : MSP430_SVD.Bit := 16#0#;
-- PWM Output signal if output mode 0
OUT_k : MSP430_SVD.Bit := 16#0#;
-- Capture input signal (read)
CCI : MSP430_SVD.Bit := 16#0#;
-- Capture/compare interrupt enable
CCIE : MSP430_SVD.Bit := 16#0#;
-- Output mode 2
OUTMOD : TA1CCTL0_OUTMOD_Field := MSP430_SVD.TIMER_1_A3.Outmod_0;
-- Capture mode: 1 /Compare mode : 0
CAP : MSP430_SVD.Bit := 16#0#;
-- unspecified
Reserved_9_9 : MSP430_SVD.Bit := 16#0#;
-- Latched capture signal (read)
SCCI : MSP430_SVD.Bit := 16#0#;
-- Capture sychronize
SCS : MSP430_SVD.Bit := 16#0#;
-- Capture input select 1
CCIS : TA1CCTL0_CCIS_Field := MSP430_SVD.TIMER_1_A3.Ccis_0;
-- Capture mode 1
CM : TA1CCTL0_CM_Field := MSP430_SVD.TIMER_1_A3.Cm_0;
end record
with Volatile_Full_Access, Object_Size => 16,
Bit_Order => System.Low_Order_First;
for TA1CCTL_Register use record
CCIFG at 0 range 0 .. 0;
COV at 0 range 1 .. 1;
OUT_k at 0 range 2 .. 2;
CCI at 0 range 3 .. 3;
CCIE at 0 range 4 .. 4;
OUTMOD at 0 range 5 .. 7;
CAP at 0 range 8 .. 8;
Reserved_9_9 at 0 range 9 .. 9;
SCCI at 0 range 10 .. 10;
SCS at 0 range 11 .. 11;
CCIS at 0 range 12 .. 13;
CM at 0 range 14 .. 15;
end record;
-----------------
-- Peripherals --
-----------------
-- Timer1_A3
type TIMER_1_A3_Peripheral is record
-- Timer1_A3 Interrupt Vector Word
TA1IV : aliased MSP430_SVD.UInt16;
-- Timer1_A3 Control
TA1CTL : aliased TA1CTL_Register;
-- Timer1_A3 Capture/Compare Control 0
TA1CCTL0 : aliased TA1CCTL_Register;
-- Timer1_A3 Capture/Compare Control 1
TA1CCTL1 : aliased TA1CCTL_Register;
-- Timer1_A3 Capture/Compare Control 2
TA1CCTL2 : aliased TA1CCTL_Register;
-- Timer1_A3 Counter Register
TA1R : aliased MSP430_SVD.UInt16;
-- Timer1_A3 Capture/Compare 0
TA1CCR0 : aliased MSP430_SVD.UInt16;
-- Timer1_A3 Capture/Compare 1
TA1CCR1 : aliased MSP430_SVD.UInt16;
-- Timer1_A3 Capture/Compare 2
TA1CCR2 : aliased MSP430_SVD.UInt16;
end record
with Volatile;
for TIMER_1_A3_Peripheral use record
TA1IV at 16#0# range 0 .. 15;
TA1CTL at 16#62# range 0 .. 15;
TA1CCTL0 at 16#64# range 0 .. 15;
TA1CCTL1 at 16#66# range 0 .. 15;
TA1CCTL2 at 16#68# range 0 .. 15;
TA1R at 16#72# range 0 .. 15;
TA1CCR0 at 16#74# range 0 .. 15;
TA1CCR1 at 16#76# range 0 .. 15;
TA1CCR2 at 16#78# range 0 .. 15;
end record;
-- Timer1_A3
TIMER_1_A3_Periph : aliased TIMER_1_A3_Peripheral
with Import, Address => TIMER_1_A3_Base;
end MSP430_SVD.TIMER_1_A3;
| 30.011858 | 77 | 0.554853 |
06b334369aca504c51cbd8f87fd31e79513eaa31 | 4,250 | adb | Ada | day25/day25.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | 2 | 2019-09-15T04:52:09.000Z | 2020-11-17T16:46:46.000Z | day25/day25.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | null | null | null | day25/day25.adb | thorstel/Advent-of-Code-2018 | d67cb7ffeac9e68560af34ca1bc29928bad1d3b9 | [
"BSD-3-Clause"
] | null | null | null | with Ada.Assertions; use Ada.Assertions;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers.Ordered_Maps;
with Ada.Containers.Vectors;
procedure Day25 is
generic
type T is private;
with function "<" (Left, Right : T) return Boolean;
package Disjoint_Sets is
procedure Insert (Element : T);
procedure Make_Union (Element1, Element2 : T);
Number_Of_Sets : Natural := 0;
private
type Set_Element is record
ID : T;
Rank : Natural;
Size : Natural;
end record;
function Find (Element : T) return Set_Element;
package PM is new Ada.Containers.Ordered_Maps
(Key_Type => T,
Element_Type => Set_Element);
Table : PM.Map;
end Disjoint_Sets;
package body Disjoint_Sets is
function Find (Element : T) return Set_Element is
Set : Set_Element := (Element, 0, 0);
begin
if not Table.Contains (Element) then
Number_Of_Sets := Number_Of_Sets + 1;
Set.Size := 1;
Table.Insert (Element, Set);
return Set;
else
Set := Table (Element);
if Set.ID = Element then
return Set;
else
declare
Parent : constant Set_Element := Find (Set.ID);
ID : constant T := Set.ID;
begin
Set.ID := Parent.ID;
Table.Replace (ID, Set);
return Parent;
end;
end if;
end if;
end Find;
procedure Insert (Element : T) is
Set : constant Set_Element := Find (Element);
begin
Assert (Set.Size > 0);
end Insert;
procedure Make_Union (Element1, Element2 : T) is
Set1 : Set_Element := Find (Element1);
Set2 : Set_Element := Find (Element2);
ID1 : constant T := Set1.ID;
ID2 : constant T := Set2.ID;
begin
if Set1.ID = Set2.ID then
return;
end if;
Number_Of_Sets := Number_Of_Sets - 1;
if (Set1.Rank < Set2.Rank) then
Set1.ID := Set2.ID;
Set2.Size := Set2.Size + Set1.Size;
else
Set2.ID := Set1.ID;
Set1.Size := Set1.Size + Set2.Size;
if Set1.Rank = Set2.Rank then
Set1.Rank := Set1.Rank + 1;
end if;
end if;
Table.Replace (ID1, Set1);
Table.Replace (ID2, Set2);
end Make_Union;
end Disjoint_Sets;
type Point_Type is array (Positive range 1 .. 4) of Integer;
function Manhattan_Distance (P1, P2 : Point_Type) return Natural is
Dist : Natural := 0;
begin
for I in Point_Type'Range loop
Dist := Dist + abs (P1 (I) - P2 (I));
end loop;
return Dist;
end Manhattan_Distance;
package PV is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Point_Type);
package DS is new Disjoint_Sets (T => Point_Type, "<" => "<");
Points : PV.Vector;
Input : File_Type;
begin
Open (Input, In_File, "input.txt");
while not End_Of_File (Input) loop
declare
Line : constant String := Get_Line (Input);
Point : Point_Type;
P : Positive := Point'First;
F, L : Positive := Line'First;
begin
while L <= Line'Last loop
if Line (L) = ',' or L = Line'Last then
if L = Line'Last then
Point (P) := Integer'Value (Line (F .. L));
else
Point (P) := Integer'Value (Line (F .. L - 1));
end if;
P := P + 1;
F := L + 1;
end if;
L := L + 1;
end loop;
Assert (P = Point_Type'Last + 1, "Invalid Input");
DS.Insert (Point);
for Point2 of Points loop
if Manhattan_Distance (Point, Point2) <= 3 then
DS.Make_Union (Point, Point2);
end if;
end loop;
Points.Append (Point);
end;
end loop;
Close (Input);
Put_Line ("Number of constellations =" & Natural'Image (DS.Number_Of_Sets));
end Day25;
| 30.57554 | 79 | 0.519059 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.