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
|
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
31c05193ba2c91f2987cda0203832897a5649209 | 272 | ads | Ada | test/src/yaml-loading_tests-suite.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 32 | 2017-08-02T16:45:34.000Z | 2021-08-18T20:12:57.000Z | test/src/yaml-loading_tests-suite.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 15 | 2017-09-13T09:43:38.000Z | 2022-01-20T23:21:47.000Z | test/src/yaml-loading_tests-suite.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 5 | 2017-09-19T16:54:22.000Z | 2020-04-09T07:17:02.000Z | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with AUnit.Test_Suites;
package Yaml.Loading_Tests.Suite is
function Suite return AUnit.Test_Suites.Access_Test_Suite;
end Yaml.Loading_Tests.Suite;
| 34 | 75 | 0.783088 |
4177f569b40ab976e9d4ba2950cf8a8beca7faf8 | 2,413 | ads | Ada | src/el-variables.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 6 | 2015-01-18T23:04:00.000Z | 2022-01-26T12:34:07.000Z | src/el-variables.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 1 | 2022-01-30T20:46:16.000Z | 2022-01-30T20:46:16.000Z | src/el-variables.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 2 | 2021-01-06T08:27:49.000Z | 2022-01-30T19:33:41.000Z | -----------------------------------------------------------------------
-- el-variables -- Variable mapper
-- Copyright (C) 2009, 2010, 2011, 2021 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
--
-- The expression context provides information to resolve runtime
-- information when evaluating an expression. The context provides
-- a resolver whose role is to find variables given their name.
with Ada.Strings.Unbounded;
with EL.Expressions;
with EL.Objects;
package EL.Variables is
pragma Preelaborate;
use Ada.Strings.Unbounded;
No_Variable : exception;
type Variable_Mapper is interface;
type Variable_Mapper_Access is access all Variable_Mapper'Class;
procedure Bind (Mapper : in out Variable_Mapper;
Name : in String;
Value : in EL.Objects.Object) is abstract;
function Get_Variable (Mapper : Variable_Mapper;
Name : Unbounded_String)
return EL.Expressions.Expression is abstract;
-- Get the Value_Expression that corresponds to the given variable name.
function Get_Variable (Mapper : in Variable_Mapper'Class;
Name : in Unbounded_String)
return EL.Expressions.Value_Expression;
procedure Set_Variable (Mapper : in out Variable_Mapper;
Name : in Unbounded_String;
Value : in EL.Expressions.Expression) is abstract;
-- Set the variable to the given value expression.
procedure Set_Variable (Mapper : in out Variable_Mapper'Class;
Name : in Unbounded_String;
Value : in EL.Expressions.Value_Expression);
end EL.Variables;
| 39.557377 | 78 | 0.631579 |
3dd9fe906b95979eb3b1764e0decb690d1cb671e | 71 | ada | Ada | Task/Extreme-floating-point-values/Ada/extreme-floating-point-values-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Extreme-floating-point-values/Ada/extreme-floating-point-values-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Extreme-floating-point-values/Ada/extreme-floating-point-values-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | subtype Consistent_Float is Float range Float'Range; -- No IEEE ideals
| 35.5 | 70 | 0.802817 |
410f4111b6f5678adde37d56d1caa4c1adb1efc0 | 7,509 | ads | Ada | HdGfxLib/libgfxinit/common/hw-gfx-gma.ads | jam3st/edk2 | d477ef9975cc6cdf1fca4d221c3064c2f2d804e8 | [
"BSD-2-Clause"
] | 1 | 2019-02-05T09:50:07.000Z | 2019-02-05T09:50:07.000Z | HdGfxLib/libgfxinit/common/hw-gfx-gma.ads | jam3st/edk2 | d477ef9975cc6cdf1fca4d221c3064c2f2d804e8 | [
"BSD-2-Clause"
] | null | null | null | HdGfxLib/libgfxinit/common/hw-gfx-gma.ads | jam3st/edk2 | d477ef9975cc6cdf1fca4d221c3064c2f2d804e8 | [
"BSD-2-Clause"
] | null | null | null | --
-- Copyright (C) 2015-2018 secunet Security Networks AG
-- Copyright (C) 2017 Nico Huber <[email protected]>
--
-- 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 2 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.
--
with HW.Config;
with HW.Time;
with HW.Port_IO;
package HW.GFX.GMA
with
Abstract_State =>
(State,
Init_State,
Config_State,
(Device_State with External)),
Initializes =>
(Init_State,
Config_State)
is
GTT_Page_Size : constant := 4096;
type GTT_Address_Type is mod 2 ** 39;
subtype GTT_Range is Natural range 0 .. 16#8_0000# - 1;
GTT_Rotation_Offset : constant GTT_Range := GTT_Range'Last / 2 + 1;
type CPU_Type is
(G45,
Ironlake,
Sandybridge,
Ivybridge,
Haswell,
Broadwell,
Broxton,
Skylake);
type CPU_Variant is (Normal, ULT);
type Port_Type is
(Disabled,
Internal,
DP1,
DP2,
DP3,
HDMI1, -- or DVI
HDMI2, -- or DVI
HDMI3, -- or DVI
Analog);
type Cursor_Mode is (No_Cursor, ARGB_Cursor);
type Cursor_Size is (Cursor_64x64, Cursor_128x128, Cursor_256x256);
Cursor_Width : constant array (Cursor_Size) of Width_Type := (64, 128, 256);
subtype Cursor_Pos is Int32 range Int32'First / 2 .. Int32'Last / 2;
type Cursor_Type is record
Mode : Cursor_Mode;
Size : Cursor_Size;
Center_X : Cursor_Pos;
Center_Y : Cursor_Pos;
GTT_Offset : GTT_Range;
end record;
Default_Cursor : constant Cursor_Type :=
(Mode => No_Cursor,
Size => Cursor_Size'First,
Center_X => 0,
Center_Y => 0,
GTT_Offset => 0);
type Pipe_Config is record
Port : Port_Type;
Framebuffer : Framebuffer_Type;
Cursor : Cursor_Type;
Mode : Mode_Type;
end record;
type Pipe_Index is (Primary, Secondary, Tertiary);
type Pipe_Configs is array (Pipe_Index) of Pipe_Config;
-- Special framebuffer offset to indicate legacy VGA plane.
-- Only valid on primary pipe.
VGA_PLANE_FRAMEBUFFER_OFFSET : constant := 16#ffff_ffff#;
pragma Warnings (GNATprove, Off, "unused variable ""Write_Delay""",
Reason => "Write_Delay is used for debugging only");
procedure Initialize
(Write_Delay : in Word64 := 0;
Clean_State : in Boolean := False;
Success : out Boolean)
with
Global =>
(In_Out => (Config_State, Device_State, Port_IO.State),
Output => (State, Init_State),
Input => (Time.State)),
Post => Success = Is_Initialized;
function Is_Initialized return Boolean
with
Global => (Input => Init_State);
pragma Warnings (GNATprove, On, "unused variable ""Write_Delay""");
pragma Warnings (GNATprove, Off, "subprogram ""Power_Up_VGA"" has no effect",
Reason => "Effect depends on the platform compiled for");
procedure Power_Up_VGA
with
Pre => Is_Initialized;
procedure Update_Outputs (Configs : Pipe_Configs);
procedure Update_Cursor (Pipe : Pipe_Index; Cursor : Cursor_Type);
procedure Place_Cursor
(Pipe : Pipe_Index;
X : Cursor_Pos;
Y : Cursor_Pos);
procedure Move_Cursor
(Pipe : Pipe_Index;
X : Cursor_Pos;
Y : Cursor_Pos);
pragma Warnings (GNATprove, Off, "subprogram ""Dump_Configs"" has no effect",
Reason => "It's only used for debugging");
procedure Dump_Configs (Configs : Pipe_Configs);
procedure Write_GTT
(GTT_Page : GTT_Range;
Device_Address : GTT_Address_Type;
Valid : Boolean);
procedure Setup_Default_FB
(FB : in Framebuffer_Type;
Clear : in Boolean := True;
Success : out Boolean)
with
Pre => Is_Initialized and HW.Config.Dynamic_MMIO;
procedure Map_Linear_FB (Linear_FB : out Word64; FB : in Framebuffer_Type)
with
Pre => Is_Initialized and HW.Config.Dynamic_MMIO;
private
-- For the default framebuffer setup (see below) with 90 degree rotations,
-- we expect the offset which is used for the final scanout to be above
-- `GTT_Rotation_Offset`. So we can use `Offset - GTT_Rotation_Offset` for
-- the physical memory location and aperture mapping.
function Phys_Offset (FB : Framebuffer_Type) return Word32 is
(if Rotation_90 (FB)
then FB.Offset - Word32 (GTT_Rotation_Offset) * GTT_Page_Size
else FB.Offset);
----------------------------------------------------------------------------
-- State tracking for the currently configured pipes
Cur_Configs : Pipe_Configs with Part_Of => State;
function Requires_Scaling (Pipe_Cfg : Pipe_Config) return Boolean is
(Requires_Scaling (Pipe_Cfg.Framebuffer, Pipe_Cfg.Mode));
function Scaling_Type (Pipe_Cfg : Pipe_Config) return Scaling_Aspect is
(Scaling_Type (Pipe_Cfg.Framebuffer, Pipe_Cfg.Mode));
----------------------------------------------------------------------------
-- Internal representation of a single pipe's configuration
subtype Active_Port_Type is Port_Type
range Port_Type'Succ (Disabled) .. Port_Type'Last;
type GPU_Port is (DIGI_A, DIGI_B, DIGI_C, DIGI_D, DIGI_E, LVDS, VGA);
subtype Digital_Port is GPU_Port range DIGI_A .. DIGI_E;
subtype GMCH_DP_Port is GPU_Port range DIGI_B .. DIGI_D;
subtype GMCH_HDMI_Port is GPU_Port range DIGI_B .. DIGI_C;
type PCH_Port is
(PCH_DAC, PCH_LVDS,
PCH_HDMI_B, PCH_HDMI_C, PCH_HDMI_D,
PCH_DP_B, PCH_DP_C, PCH_DP_D);
subtype PCH_HDMI_Port is PCH_Port range PCH_HDMI_B .. PCH_HDMI_D;
subtype PCH_DP_Port is PCH_Port range PCH_DP_B .. PCH_DP_D;
type Port_Config is
record
Port : GPU_Port;
PCH_Port : GMA.PCH_Port;
Display : Display_Type;
Mode : Mode_Type;
Is_FDI : Boolean;
FDI : DP_Link;
DP : DP_Link;
end record;
type FDI_Training_Type is (Simple_Training, Full_Training, Auto_Training);
----------------------------------------------------------------------------
type DP_Port is (DP_A, DP_B, DP_C, DP_D);
----------------------------------------------------------------------------
subtype DDI_HDMI_Buf_Trans_Range is Integer range 0 .. 11;
----------------------------------------------------------------------------
Tile_Width : constant array (Tiling_Type) of Pos32 :=
(Linear => 16, X_Tiled => 128, Y_Tiled => 32);
Tile_Rows : constant array (Tiling_Type) of Pos32 :=
(Linear => 1, X_Tiled => 8, Y_Tiled => 32);
function FB_Pitch (Px : Pos_Pixel_Type; FB : Framebuffer_Type) return Natural
is (Natural (Div_Round_Up
(Pixel_To_Bytes (Px, FB), Tile_Width (FB.Tiling) * 4)));
function Valid_Stride (FB : Framebuffer_Type) return Boolean is
(FB.Width + FB.Start_X <= FB.Stride and
Pixel_To_Bytes (FB.Stride, FB) mod (Tile_Width (FB.Tiling) * 4) = 0 and
FB.Height + FB.Start_Y <= FB.V_Stride and
FB.V_Stride mod Tile_Rows (FB.Tiling) = 0);
end HW.GFX.GMA;
| 32.790393 | 80 | 0.624717 |
29c5a82b4e54ac7c54002af64400893c1f3d069d | 73,552 | adb | Ada | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Loop_VITIS_LOOP_184_2_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Loop_VITIS_LOOP_184_2_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Loop_VITIS_LOOP_184_2_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_VITIS_LOOP_184_2_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>low_thresh</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>4294967295</coreId>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>gmem0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>544108393</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>4</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>low_r</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>9</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>low_t</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>9</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>high_thresh</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>353</coreId>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>gmem1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>257</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>4</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>high_r</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>22</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>9</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>high_t</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>4227858560</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>9</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>low_thresh_read</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>180</coreId>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>high_thresh_read</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>gmem0_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>609</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>gmem1_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>gmem0_addr_1_rd_req</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>14</coreId>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
<item>59</item>
</oprand_edges>
<opcode>readreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.30</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>gmem1_addr_1_rd_req</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3405340480</coreId>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>readreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.30</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>br_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>913</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.29</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>index</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>index</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>825438509</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
<item>67</item>
<item>68</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>add_ln184</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>71</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.99</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>icmp_ln184</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>72</item>
<item>74</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.96</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>br_ln184</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>75</item>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>index_cast_i</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>gmem0_addr_read</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3405698312</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
<item>251</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.30</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>low_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
<item>85</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>low_addr_write_ln186</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3406017160</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.75</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>low_t_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>187</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>88</item>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>low_t_addr_write_ln187</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>187</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.75</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>gmem1_addr_read</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>93</item>
<item>94</item>
<item>252</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.30</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>high_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
<item>97</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>high_addr_write_ln188</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>188</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>961</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>98</item>
<item>99</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.75</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>high_t_addr</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>189</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
<item>102</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>high_t_addr_write_ln189</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>189</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>881</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.75</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>br_ln184</name>
<fileName>src/xf_colordetect_accel_stream.cpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>colordetect_accel</contextFuncName>
<contextNormFuncName>colordetect_accel</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/xf_colordetect_accel_stream.cpp</first>
<second>colordetect_accel</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3405534656</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>58</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>66</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>3405666216</coreId>
</Obj>
<bitwidth>4</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>70</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>132</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>305</coreId>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_37">
<Value>
<Obj>
<type>2</type>
<id>83</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</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>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_38">
<Obj>
<type>3</type>
<id>22</id>
<name>entry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>13</item>
<item>14</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>29</id>
<name>.preheader.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>26</item>
<item>28</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>43</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>30</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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_41">
<Obj>
<type>3</type>
<id>45</id>
<name>.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>977</coreId>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_42">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_43">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_44">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>63</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>68</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>76</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>105</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>247</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>248</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>249</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>250</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>251</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>252</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_94">
<mId>1</mId>
<mTag>Loop_VITIS_LOOP_184_2_proc</mTag>
<mNormTag>Loop_VITIS_LOOP_184_2_proc</mNormTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>19</mMinLatency>
<mMaxLatency>19</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_95">
<mId>2</mId>
<mTag>Entry</mTag>
<mNormTag>Entry</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>7</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_96">
<mId>3</mId>
<mTag>VITIS_LOOP_184_2</mTag>
<mNormTag>VITIS_LOOP_184_2</mNormTag>
<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>29</item>
<item>43</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>9</mMinTripCount>
<mMaxTripCount>9</mMaxTripCount>
<mMinLatency>10</mMinLatency>
<mMaxLatency>10</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_97">
<mId>4</mId>
<mTag>Return</mTag>
<mNormTag>Return</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>24</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>13</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>6</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>6</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>22</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>7</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>8</first>
<second>8</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>9</first>
<second>10</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>9</first>
<second>9</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_98">
<region_name>VITIS_LOOP_184_2</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>43</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core>
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 28.442382 | 88 | 0.619222 |
580093d4e585921b16b0c065b0b400fd0eb9dfaf | 2,621 | adb | Ada | src/hardware/hardware-pwm.adb | kisom/rover-mk1 | 5d7495893a7305387508755c0d5f2758660f6bf5 | [
"MIT"
] | null | null | null | src/hardware/hardware-pwm.adb | kisom/rover-mk1 | 5d7495893a7305387508755c0d5f2758660f6bf5 | [
"MIT"
] | null | null | null | src/hardware/hardware-pwm.adb | kisom/rover-mk1 | 5d7495893a7305387508755c0d5f2758660f6bf5 | [
"MIT"
] | null | null | null | with AVR.Interrupts;
package body Hardware.PWM is
procedure Connect (pin : in AVR.Bit_Number; which : out Servo_Index) is
s : Servo_ptr;
begin
if (Active_Servos < Max_Servos) then
Active_Servos := Active_Servos + 1;
Servos (Active_Servos) := new Servo;
s := Servos(Active_Servos);
s.Pin := pin;
s.Min := Min_Pulse;
s.Max := Max_Pulse;
s.Trim := 0;
s.Ticks := 0;
which := Servo_Index (Active_Servos);
end if;
end Connect;
procedure Trim (which : in Servo_Index ; trim : in Integer_16) is
s : Servo_ptr;
-- We use Servo_Index for constraint checks, but need to use the
-- Integer value for compatibility elsewhere.
n : Integer;
begin
n := Integer (which);
if (Active_Servos > 0 and n < Active_Servos) then
s := Servos (n);
s.Trim := trim;
end if;
end Trim;
function ServoMaxPulse (s : Servo_ptr) return Unsigned_16 is
begin
return Max_Pulse - Update_Wait * s.Max;
end ServoMaxPulse;
function ServoMinPulse (s : Servo_ptr) return Unsigned_16 is
begin
return Max_Pulse - Update_Wait * s.Min;
end ServoMinPulse;
procedure Set (which : in Servo_Index; us : in Unsigned_16) is
n : Integer;
s : Servo_ptr;
dur : Unsigned_16;
sSREG : Unsigned_8;
begin
n := Integer (which);
if (n < Active_Servos) then
s := Servos (n);
dur := us + Unsigned_16 (s.Trim);
if (us < ServoMinPulse (s)) then
dur := ServoMinPulse (s);
elsif (us > ServoMaxPulse (s)) then
dur := ServoMaxPulse (s);
end if;
sSREG := MCU.SREG;
Interrupts.cli;
s.Ticks := dur;
MCU.SREG := sSREG;
Interrupts.sei;
end if;
end Set;
procedure Servo_ISR is
s : Servo_ptr;
begin
if (Current_Servo < Active_Servos and Current_Servo /= 0) then
s := Servos (Current_Servo);
MCU.PORTB_Bits (s.Pin) := Low;
else
MCU.TCNT1 := 0;
Current_Servo := 0;
end if;
Current_Servo := Current_Servo + 1;
if (Current_Servo < Active_Servos) then
s := Servos (Current_Servo);
MCU.OCR1A := MCU.TCNT1 + s.Ticks;
MCU.PORTB_Bits (s.Pin) := High;
else
if ((MCU.TCNT1 + Update_Wait) < Update_Interval) then
MCU.OCR1A := Update_Interval;
else
MCU.OCR1A := MCU.OCR1A + Update_Wait;
end if;
end if;
end Servo_ISR;
end Hardware.PWM;
| 26.474747 | 74 | 0.561999 |
57a1ca10d6db97799b0ce7e7260b8d41ddd43af9 | 3,704 | adb | Ada | regtests/util-streams-buffered-lzma-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | regtests/util-streams-buffered-lzma-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | regtests/util-streams-buffered-lzma-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- util-streams-buffered-lzma-tests -- Unit tests for encoding buffered streams
-- Copyright (C) 2018, 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with Util.Streams.Files;
with Util.Streams.Texts;
with Ada.Streams.Stream_IO;
package body Util.Streams.Buffered.Lzma.Tests is
use Util.Streams.Files;
use Ada.Streams.Stream_IO;
package Caller is new Util.Test_Caller (Test, "Streams.Buffered.Lzma");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Util.Streams.Buffered.Lzma.Write",
Test_Compress_Stream'Access);
Caller.Add_Test (Suite, "Test Util.Streams.Buffered.Lzma.Write (2)",
Test_Compress_File_Stream'Access);
end Add_Tests;
procedure Test_Compress_Stream (T : in out Test) is
Stream : aliased File_Stream;
Buffer : aliased Util.Streams.Buffered.Lzma.Compress_Stream;
Print : Util.Streams.Texts.Print_Stream;
Path : constant String := Util.Tests.Get_Test_Path ("regtests/result/test-stream.lzma");
Expect : constant String := Util.Tests.Get_Path ("regtests/expect/test-stream.lzma");
begin
Stream.Create (Mode => Out_File, Name => Path);
Buffer.Initialize (Output => Stream'Access,
Size => 1024);
Print.Initialize (Output => Buffer'Access, Size => 5);
for I in 1 .. 32 loop
Print.Write ("abcd");
Print.Write (" fghij");
Print.Write (ASCII.LF);
end loop;
Print.Flush;
Stream.Close;
Util.Tests.Assert_Equal_Files (T => T,
Expect => Expect,
Test => Path,
Message => "LZMA stream");
end Test_Compress_Stream;
procedure Test_Compress_File_Stream (T : in out Test) is
Stream : aliased File_Stream;
In_Stream : aliased File_Stream;
Buffer : aliased Util.Streams.Buffered.Lzma.Compress_Stream;
Path : constant String
:= Util.Tests.Get_Test_Path ("regtests/result/test-big-stream.lzma");
Expect : constant String
:= Util.Tests.Get_Path ("regtests/expect/test-big-stream.lzma");
begin
In_Stream.Open (Ada.Streams.Stream_IO.In_File,
Util.Tests.Get_Path ("regtests/files/test-big-stream.bin"));
Stream.Create (Mode => Out_File, Name => Path);
Buffer.Initialize (Output => Stream'Access,
Size => 32768);
Util.Streams.Copy (From => In_Stream, Into => Buffer);
Buffer.Flush;
Buffer.Close;
Util.Tests.Assert_Equal_Files (T => T,
Expect => Expect,
Test => Path,
Message => "LZMA stream");
end Test_Compress_File_Stream;
end Util.Streams.Buffered.Lzma.Tests;
| 43.069767 | 97 | 0.598812 |
41f8dadfd22d01e7627167373033055ac94723b2 | 3,864 | ads | Ada | source/web/tools/a2js/properties-expressions-explicit_dereference.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/a2js/properties-expressions-explicit_dereference.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/a2js/properties-expressions-explicit_dereference.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Asis;
with Engines.Contexts;
with League.Strings;
package Properties.Expressions.Explicit_Dereference is
function Address
(Engine : access Engines.Contexts.Context;
Element : Asis.Expression;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Expression;
Name : Engines.Text_Property) return League.Strings.Universal_String;
end Properties.Expressions.Explicit_Dereference;
| 61.333333 | 78 | 0.432453 |
59930a65795c4fde3ba9344d3d6be15db0d35b9c | 18,371 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C H 9 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Expand routines for chapter 9 constructs
with Types; use Types;
package Exp_Ch9 is
type Subprogram_Protection_Mode is
(Dispatching_Mode,
Protected_Mode,
Unprotected_Mode);
-- This type is used to distinguish the different protection modes of a
-- protected subprogram.
procedure Build_Activation_Chain_Entity (N : Node_Id);
-- Given a declaration N of an object that is a task, or contains tasks
-- (other than allocators to tasks) this routine ensures that an activation
-- chain has been declared in the appropriate scope, building the required
-- declaration for the chain variable if not. The name of this variable
-- is always _Chain and it is accessed by name.
function Build_Call_With_Task (N : Node_Id; E : Entity_Id) return Node_Id;
-- N is a node representing the name of a task or an access to a task.
-- The value returned is a call to the function whose name is the entity
-- E (typically a runtime routine entity obtained using RTE) with the
-- Task_Id of the associated task as the parameter. The caller is
-- responsible for analyzing and resolving the resulting tree.
procedure Build_Class_Wide_Master (Typ : Entity_Id);
-- Given an access-to-limited class-wide type or an access-to-limited
-- interface, ensure that the designated type has a _master and generate
-- a renaming of the said master to service the access type.
function Build_Master_Declaration (Loc : Source_Ptr) return Node_Id;
-- For targets supporting tasks, generate:
-- _Master : constant Integer := Current_Master.all;
-- For targets where tasks or tasking hierarchies are prohibited, generate:
-- _Master : constant Master_Id := 3;
procedure Build_Master_Entity (Obj_Or_Typ : Entity_Id);
-- Given the name of an object or a type which is either a task, contains
-- tasks or designates tasks, create a _master in the appropriate scope
-- which captures the value of Current_Master. Mark the nearest enclosing
-- body or block as being a task master.
procedure Build_Master_Renaming
(Ptr_Typ : Entity_Id;
Ins_Nod : Node_Id := Empty);
-- Given an access type Ptr_Typ whose designated type is either a task or
-- contains tasks, create a renaming of the form:
--
-- <Ptr_Typ>M : Master_Id renames _Master;
--
-- where _master denotes the task master of the enclosing context. Ins_Nod
-- is used to provide a specific insertion node for the renaming.
function Build_Protected_Sub_Specification
(N : Node_Id;
Prot_Typ : Entity_Id;
Mode : Subprogram_Protection_Mode) return Node_Id;
-- Build the specification for protected subprogram. This is called when
-- expanding a protected type, and also when expanding the declaration for
-- an Access_To_Protected_Subprogram type. In the latter case, Prot_Typ is
-- empty, and the first parameter of the signature of the protected op is
-- of type System.Address.
procedure Build_Protected_Subprogram_Call
(N : Node_Id;
Name : Node_Id;
Rec : Node_Id;
External : Boolean := True);
-- The node N is a subprogram or entry call to a protected subprogram. This
-- procedure rewrites this call with the appropriate expansion. Name is the
-- subprogram, and Rec is the record corresponding to the protected object.
-- External is False if the call is to another protected subprogram within
-- the same object.
procedure Build_Protected_Subprogram_Call_Cleanup
(Op_Spec : Node_Id;
Conc_Typ : Node_Id;
Loc : Source_Ptr;
Stmts : List_Id);
-- Append to Stmts the cleanups after a call to a protected subprogram
-- whose specification is Op_Spec. Conc_Typ is the concurrent type and Loc
-- the sloc for appended statements. The cleanup will either unlock the
-- protected object or serve pending entries.
procedure Build_Task_Activation_Call (N : Node_Id);
-- This procedure is called for constructs that can be task activators,
-- i.e. task bodies, subprogram bodies, package bodies and blocks. If the
-- construct is a task activator (as indicated by the non-empty setting of
-- Activation_Chain_Entity, either in the construct, or, in the case of a
-- package body, in its associated package spec), then a call to
-- Activate_Tasks with this entity as the single parameter is inserted at
-- the start of the statements of the activator.
procedure Build_Task_Allocate_Block
(Actions : List_Id;
N : Node_Id;
Args : List_Id);
-- This routine is used in the case of allocators where the designated type
-- is a task or contains tasks. In this case, the normal initialize call
-- is replaced by:
--
-- blockname : label;
-- blockname : declare
-- _Chain : Activation_Chain;
--
-- procedure _Expunge is
-- begin
-- Expunge_Unactivated_Tasks (_Chain);
-- end;
--
-- begin
-- Init (Args);
-- Activate_Tasks (_Chain);
-- at end
-- _Expunge;
-- end;
--
-- to get the task or tasks created and initialized. The expunge call
-- ensures that any tasks that get created but not activated due to an
-- exception are properly expunged (it has no effect in the normal case).
-- The argument N is the allocator, and Args is the list of arguments for
-- the initialization call, constructed by the caller, which uses the
-- Master_Id of the access type as the _Master parameter, and _Chain
-- (defined above) as the _Chain parameter.
procedure Build_Task_Allocate_Block_With_Init_Stmts
(Actions : List_Id;
N : Node_Id;
Init_Stmts : List_Id);
-- Ada 2005 (AI-287): Similar to previous routine, but used to expand
-- allocated aggregates with default initialized components. Init_Stmts
-- contains the list of statements required to initialize the allocated
-- aggregate. It replaces the call to Init (Args) done by
-- Build_Task_Allocate_Block. Also used to expand allocators containing
-- build-in-place function calls.
function Build_Wrapper_Spec
(Subp_Id : Entity_Id;
Obj_Typ : Entity_Id;
Formals : List_Id) return Node_Id;
-- Ada 2005 (AI-345): Build the specification of a primitive operation
-- associated with a protected or task type. This is required to implement
-- dispatching calls through interfaces. Subp_Id is the primitive to be
-- wrapped, Obj_Typ is the type of the newly added formal parameter to
-- handle object notation, Formals are the original entry formals that
-- will be explicitly replicated.
function Concurrent_Ref (N : Node_Id) return Node_Id;
-- Given the name of a concurrent object (task or protected object), or
-- the name of an access to a concurrent object, this function returns an
-- expression referencing the associated Task_Id or Protection object,
-- respectively. Note that a special case is when the name is a reference
-- to a task type name. This can only happen within a task body, and the
-- meaning is to get the Task_Id for the currently executing task.
function Convert_Concurrent
(N : Node_Id;
Typ : Entity_Id) return Node_Id;
-- N is an expression of type Typ. If the type is not a concurrent type
-- then it is returned unchanged. If it is a task or protected reference,
-- Convert_Concurrent creates an unchecked conversion node from this
-- expression to the corresponding concurrent record type value. We need
-- this in any situation where the concurrent type is used, because the
-- actual concurrent object is an object of the corresponding concurrent
-- type, and manipulations on the concurrent object actually manipulate the
-- corresponding object of the record type.
function Entry_Index_Expression
(Sloc : Source_Ptr;
Ent : Entity_Id;
Index : Node_Id;
Ttyp : Entity_Id)
return Node_Id;
-- Returns an expression to compute a task entry index given the name of
-- the entry or entry family. For the case of a task entry family, the
-- Index parameter contains the expression for the subscript. Ttyp is the
-- task type.
procedure Establish_Task_Master (N : Node_Id);
-- Given a subprogram body, or a block statement, or a task body, this
-- procedure makes the necessary transformations required of a task master
-- (add Enter_Master call at start, and establish a cleanup routine to make
-- sure Complete_Master is called on exit).
procedure Expand_Access_Protected_Subprogram_Type (N : Node_Id);
-- Build Equivalent_Type for an Access_To_Protected_Subprogram.
-- Equivalent_Type is a record type with two components: a pointer to the
-- protected object, and a pointer to the operation itself.
procedure Expand_Accept_Declarations (N : Node_Id; Ent : Entity_Id);
-- Expand declarations required for accept statement. See bodies of both
-- Expand_Accept_Declarations and Expand_N_Accept_Statement for full
-- details of the nature and use of these declarations, which are inserted
-- immediately before the accept node N. The second argument is the entity
-- for the corresponding entry.
procedure Expand_Entry_Barrier (N : Node_Id; Ent : Entity_Id);
-- Expand the entry barrier into a function. This is called directly
-- from Analyze_Entry_Body so that the discriminals and privals of the
-- barrier can be attached to the function declaration list, and a new
-- set prepared for the entry body procedure, before the entry body
-- statement sequence can be expanded. The resulting function is analyzed
-- now, within the context of the protected object, to resolve calls to
-- other protected functions.
procedure Expand_N_Abort_Statement (N : Node_Id);
procedure Expand_N_Accept_Statement (N : Node_Id);
procedure Expand_N_Asynchronous_Select (N : Node_Id);
procedure Expand_N_Conditional_Entry_Call (N : Node_Id);
procedure Expand_N_Delay_Relative_Statement (N : Node_Id);
procedure Expand_N_Delay_Until_Statement (N : Node_Id);
procedure Expand_N_Entry_Body (N : Node_Id);
procedure Expand_N_Entry_Call_Statement (N : Node_Id);
procedure Expand_N_Entry_Declaration (N : Node_Id);
procedure Expand_N_Protected_Body (N : Node_Id);
procedure Expand_N_Protected_Type_Declaration (N : Node_Id);
-- Expands protected type declarations. This results, among other things,
-- in the declaration of a record type for the representation of protected
-- objects and (if there are entries) in an entry service procedure. The
-- Protection value used by the GNARL to control the object will always be
-- the first field of the record, and the entry service procedure spec (if
-- it exists) will always immediately follow the record declaration. This
-- allows these two nodes to be found from the type, without benefit of
-- further attributes, using Corresponding_Record.
procedure Expand_N_Requeue_Statement (N : Node_Id);
procedure Expand_N_Selective_Accept (N : Node_Id);
procedure Expand_N_Single_Protected_Declaration (N : Node_Id);
procedure Expand_N_Single_Task_Declaration (N : Node_Id);
procedure Expand_N_Task_Body (N : Node_Id);
procedure Expand_N_Task_Type_Declaration (N : Node_Id);
procedure Expand_N_Timed_Entry_Call (N : Node_Id);
procedure Expand_Protected_Body_Declarations
(N : Node_Id;
Spec_Id : Entity_Id);
-- Expand declarations required for a protected body. See bodies of both
-- Expand_Protected_Body_Declarations and Expand_N_Protected_Body for full
-- details of the nature and use of these declarations. The second argument
-- is the entity for the corresponding protected type declaration.
function External_Subprogram (E : Entity_Id) return Entity_Id;
-- Return the external version of a protected operation, which locks
-- the object before invoking the internal protected subprogram body.
function Find_Master_Scope (E : Entity_Id) return Entity_Id;
-- When a type includes tasks, a master entity is created in the scope, to
-- be used by the runtime during activation. In general the master is the
-- immediate scope in which the type is declared, but in Ada 2005, in the
-- presence of synchronized classwide interfaces, the immediate scope of
-- an anonymous access type may be a transient scope, which has no run-time
-- presence. In this case, the scope of the master is the innermost scope
-- that comes from source.
function First_Protected_Operation (D : List_Id) return Node_Id;
-- Given the declarations list for a protected body, find the
-- first protected operation body.
procedure Install_Private_Data_Declarations
(Loc : Source_Ptr;
Spec_Id : Entity_Id;
Conc_Typ : Entity_Id;
Body_Nod : Node_Id;
Decls : List_Id;
Barrier : Boolean := False;
Family : Boolean := False);
-- This routines generates several types, objects and object renamings used
-- in the handling of discriminants and private components of protected and
-- task types. It also generates the entry index for entry families. Formal
-- Spec_Id denotes an entry, entry family or a subprogram, Conc_Typ is the
-- concurrent type where Spec_Id resides, Body_Nod is the corresponding
-- body of Spec_Id, Decls are the declarations of the subprogram or entry.
-- Flag Barrier denotes whether the context is an entry barrier function.
-- Flag Family is used in conjunction with Barrier to denote a barrier for
-- an entry family.
--
-- The generated types, entities and renamings are:
--
-- * If flag Barrier is set or Spec_Id denotes a protected entry or an
-- entry family, generate:
--
-- type prot_typVP is access prot_typV;
-- _object : prot_typVP := prot_typV (_O);
--
-- where prot_typV is the corresponding record of a protected type and
-- _O is a formal parameter representing the concurrent object of either
-- the barrier function or the entry (family).
--
-- * If Conc_Typ is a protected type, create a renaming for the Protection
-- field _object:
--
-- conc_typR : protection_typ renames _object._object;
--
-- * If Conc_Typ has discriminants, create renamings of the form:
--
-- discr_nameD : discr_typ renames _object.discr_name;
-- or
-- discr_nameD : discr_typ renames _task.discr_name;
--
-- * If Conc_Typ denotes a protected type and has private components,
-- generate renamings of the form:
--
-- comp_name : comp_typ renames _object.comp_name;
--
-- * Finally, is flag Barrier and Family are set or Spec_Id denotes an
-- entry family, generate the entry index constant:
--
-- subtype Jnn is <Type of Index> range Low .. High;
-- J : constant Jnn :=
-- Jnn'Val (_E - <Index expression> + Jnn'Pos (Jnn'First));
--
-- All the above declarations are inserted in the order shown to the front
-- of Decls.
function Make_Task_Create_Call (Task_Rec : Entity_Id) return Node_Id;
-- Given the entity of the record type created for a task type, build
-- the call to Create_Task
function Make_Initialize_Protection
(Protect_Rec : Entity_Id) return List_Id;
-- Given the entity of the record type created for a protected type, build
-- a list of statements needed for proper initialization of the object.
function Next_Protected_Operation (N : Node_Id) return Node_Id;
-- Given a protected operation node (a subprogram or entry body), find the
-- following node in the declarations list.
procedure Set_Discriminals (Dec : Node_Id);
-- Replace discriminals in a protected type for use by the next protected
-- operation on the type. Each operation needs a new set of discriminals,
-- since it needs a unique renaming of the discriminant fields in the
-- record used to implement the protected type.
end Exp_Ch9;
| 50.608815 | 79 | 0.670241 |
2224dddcd6a4a944e642c51fdc5d0eeb3c5eccdf | 3,323 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95065a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95065a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95065a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C95065A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT CONSTRAINT_ERROR IS NOT RAISED WHEN AN ENTRY IS DECLARED
-- IF THE VALUE OF THE DEFAULT EXPRESSION FOR THE FORMAL PARAMETER DOES
-- NOT SATISFY THE CONSTRAINTS OF THE TYPE MARK, BUT IS RAISED WHEN THE
-- ENTRY IS CALLED AND THE DEFAULT VALUE IS USED.
-- CASE (A) ARRAY PARAMETERS CONSTRAINED WITH NONSTATIC BOUNDS AND
-- INITIALIZED WITH A STATIC AGGREGATE.
-- JWC 6/19/85
WITH REPORT; USE REPORT;
PROCEDURE C95065A IS
BEGIN
TEST ("C95065A", "CHECK THAT CONSTRAINT_ERROR IS NOT RAISED IF " &
"AN INITIALIZATION VALUE DOES NOT SATISFY " &
"CONSTRAINTS ON A FORMAL PARAMETER WHEN THE " &
"FORMAL PART IS ELABORATED");
BEGIN
DECLARE
TYPE A1 IS ARRAY (1 .. IDENT_INT(1), 1 .. IDENT_INT(10))
OF INTEGER;
TASK T IS
ENTRY E1 (A : A1 := ((1, 0), (0, 1)));
END T;
TASK BODY T IS
BEGIN
SELECT
ACCEPT E1 (A : A1 := ((1, 0), (0, 1))) DO
FAILED ("ACCEPT E1 EXECUTED");
END E1;
OR
TERMINATE;
END SELECT;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED IN TASK T");
END T;
BEGIN
T.E1;
FAILED ("CONSTRAINT ERROR NOT RAISED ON CALL TO T.E1");
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED - E1");
END;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED (BY ENTRY DECL)");
WHEN TASKING_ERROR =>
FAILED ("TASKING_ERROR RAISED");
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED");
END;
RESULT;
END C95065A;
| 36.119565 | 79 | 0.555823 |
5840a7c85693c05f2d88ec25e22ad73e9f473810 | 1,295 | adb | Ada | benchmark/ada/anytime.adb | erlingrj/ktc | b77f9a2ce991f7c6e8fe2702a7ec9b5e56a6476d | [
"BSD-3-Clause"
] | null | null | null | benchmark/ada/anytime.adb | erlingrj/ktc | b77f9a2ce991f7c6e8fe2702a7ec9b5e56a6476d | [
"BSD-3-Clause"
] | null | null | null | benchmark/ada/anytime.adb | erlingrj/ktc | b77f9a2ce991f7c6e8fe2702a7ec9b5e56a6476d | [
"BSD-3-Clause"
] | null | null | null | with Ada.Text_Io; use Ada.Text_Io;
with Ada.Real_Time.Timing_Events; use Ada.Real_Time.Timing_Events;
with Ada.Real_Time; use Ada.Real_Time;
with Ada.Numerics.Float_Random;
procedure Anytime is
protected Pi_Increment is
procedure Increment(z: in float; count: in out float; iter: in out float);
end Pi_Increment;
protected body Pi_Increment is
procedure Increment(z: in float; count: in out float; iter: in out float) is
begin
if z <= 1.0 then
count := count + 1.0;
else
count := count;
end if;
iter := iter + 1.0;
end Increment;
end Pi_Increment;
task type Calculate_Pi is
end Calculate_Pi;
task body Calculate_Pi is
use Ada.Numerics.Float_Random;
G : Generator;
Now : Time;
Interval : Time_Span := Milliseconds(3000);
X : float;
Y : float;
Z : float;
Pi : float := 3.14;
Cnt : float := 0.0;
Itr : float := 0.0;
begin
Now := Clock;
Reset(G, 1);
select
delay until Now + Interval;
Pi := (Cnt/Itr)*3.14;
Put_Line(Float'Image(Pi));
then abort
loop
X := Random(G);
Y := Random(G);
Z := X*X + Y*Y;
Pi_Increment.Increment(Z, Cnt, Itr);
end loop;
end select;
end Calculate_Pi;
Pi : Calculate_Pi;
begin
Put_Line("Calculate Pi");
end Anytime;
| 21.229508 | 82 | 0.633977 |
2257617139a9c914bfa24c888bb65d8f93822f96 | 5,285 | adb | Ada | awa/src/awa-events.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-events.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-events.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- awa-events -- AWA Events
-- Copyright (C) 2012, 2015, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ADO.Sessions.Entities;
package body AWA.Events is
-- ------------------------------
-- Set the event type which identifies the event.
-- ------------------------------
procedure Set_Event_Kind (Event : in out Module_Event;
Kind : in Event_Index) is
begin
Event.Kind := Kind;
end Set_Event_Kind;
-- ------------------------------
-- Get the event type which identifies the event.
-- ------------------------------
function Get_Event_Kind (Event : in Module_Event) return Event_Index is
begin
return Event.Kind;
end Get_Event_Kind;
-- ------------------------------
-- Set a parameter on the message.
-- ------------------------------
procedure Set_Parameter (Event : in out Module_Event;
Name : in String;
Value : in String) is
begin
Event.Props.Include (Name, Util.Beans.Objects.To_Object (Value));
end Set_Parameter;
procedure Set_Parameter (Event : in out Module_Event;
Name : in String;
Value : in Util.Beans.Objects.Object) is
begin
Event.Props.Include (Name, Value);
end Set_Parameter;
-- ------------------------------
-- Get the parameter with the given name.
-- ------------------------------
function Get_Parameter (Event : in Module_Event;
Name : in String) return String is
Pos : constant Util.Beans.Objects.Maps.Cursor := Event.Props.Find (Name);
begin
if Util.Beans.Objects.Maps.Has_Element (Pos) then
return Util.Beans.Objects.To_String (Util.Beans.Objects.Maps.Element (Pos));
else
return "";
end if;
end Get_Parameter;
-- ------------------------------
-- Set the parameters of the message.
-- ------------------------------
procedure Set_Parameters (Event : in out Module_Event;
Parameters : in Util.Beans.Objects.Maps.Map) is
begin
Event.Props := Parameters;
end Set_Parameters;
-- ------------------------------
-- Get the value that corresponds to the parameter with the given name.
-- ------------------------------
function Get_Value (Event : in Module_Event;
Name : in String) return Util.Beans.Objects.Object is
begin
if Event.Props.Contains (Name) then
return Event.Props.Element (Name);
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Get the entity identifier associated with the event.
-- ------------------------------
function Get_Entity_Identifier (Event : in Module_Event) return ADO.Identifier is
begin
return Event.Entity;
end Get_Entity_Identifier;
-- ------------------------------
-- Set the entity identifier associated with the event.
-- ------------------------------
procedure Set_Entity_Identifier (Event : in out Module_Event;
Id : in ADO.Identifier) is
begin
Event.Entity := Id;
end Set_Entity_Identifier;
-- ------------------------------
-- Set the database entity associated with the event.
-- ------------------------------
procedure Set_Entity (Event : in out Module_Event;
Entity : in ADO.Objects.Object_Ref'Class;
Session : in ADO.Sessions.Session'Class) is
Key : constant ADO.Objects.Object_Key := Entity.Get_Key;
begin
Event.Entity := ADO.Objects.Get_Value (Key);
Event.Entity_Type := ADO.Sessions.Entities.Find_Entity_Type (Session, Key);
end Set_Entity;
-- ------------------------------
-- Copy the event properties to the map passed in <tt>Into</tt>.
-- ------------------------------
procedure Copy (Event : in Module_Event;
Into : in out Util.Beans.Objects.Maps.Map) is
begin
Into := Event.Props;
end Copy;
-- ------------------------------
-- Make and return a copy of the event.
-- ------------------------------
function Copy (Event : in Module_Event) return Module_Event_Access is
Result : constant Module_Event_Access := new Module_Event;
begin
Result.Kind := Event.Kind;
Result.Props := Event.Props;
return Result;
end Copy;
end AWA.Events;
| 37.75 | 85 | 0.528477 |
5755ed202aa0e9b6d725f9f8b5f35d8e5e838e36 | 14,117 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-strunb.ads | 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/a-strunb.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-strunb.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . U N B O U N D E D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, 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 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Maps;
with Ada.Finalization;
package Ada.Strings.Unbounded is
pragma Preelaborate;
type Unbounded_String is private;
Null_Unbounded_String : constant Unbounded_String;
function Length (Source : Unbounded_String) return Natural;
type String_Access is access all String;
procedure Free (X : in out String_Access);
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Unbounded_String
(Source : String) return Unbounded_String;
function To_Unbounded_String
(Length : Natural) return Unbounded_String;
function To_String (Source : Unbounded_String) return String;
procedure Set_Unbounded_String
(Target : out Unbounded_String;
Source : String);
pragma Ada_05 (Set_Unbounded_String);
procedure Append
(Source : in out Unbounded_String;
New_Item : Unbounded_String);
procedure Append
(Source : in out Unbounded_String;
New_Item : String);
procedure Append
(Source : in out Unbounded_String;
New_Item : Character);
function "&"
(Left : Unbounded_String;
Right : Unbounded_String) return Unbounded_String;
function "&"
(Left : Unbounded_String;
Right : String) return Unbounded_String;
function "&"
(Left : String;
Right : Unbounded_String) return Unbounded_String;
function "&"
(Left : Unbounded_String;
Right : Character) return Unbounded_String;
function "&"
(Left : Character;
Right : Unbounded_String) return Unbounded_String;
function Element
(Source : Unbounded_String;
Index : Positive) return Character;
procedure Replace_Element
(Source : in out Unbounded_String;
Index : Positive;
By : Character);
function Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return String;
function Unbounded_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural) return Unbounded_String;
pragma Ada_05 (Unbounded_Slice);
procedure Unbounded_Slice
(Source : Unbounded_String;
Target : out Unbounded_String;
Low : Positive;
High : Natural);
pragma Ada_05 (Unbounded_Slice);
function "="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean;
function "="
(Left : Unbounded_String;
Right : String) return Boolean;
function "="
(Left : String;
Right : Unbounded_String) return Boolean;
function "<"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean;
function "<"
(Left : Unbounded_String;
Right : String) return Boolean;
function "<"
(Left : String;
Right : Unbounded_String) return Boolean;
function "<="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean;
function "<="
(Left : Unbounded_String;
Right : String) return Boolean;
function "<="
(Left : String;
Right : Unbounded_String) return Boolean;
function ">"
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean;
function ">"
(Left : Unbounded_String;
Right : String) return Boolean;
function ">"
(Left : String;
Right : Unbounded_String) return Boolean;
function ">="
(Left : Unbounded_String;
Right : Unbounded_String) return Boolean;
function ">="
(Left : Unbounded_String;
Right : String) return Boolean;
function ">="
(Left : String;
Right : Unbounded_String) return Boolean;
------------------------
-- Search Subprograms --
------------------------
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
function Index
(Source : Unbounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural;
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Unbounded_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Unbounded_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural;
function Count
(Source : Unbounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural;
function Count
(Source : Unbounded_String;
Set : Maps.Character_Set) return Natural;
procedure Find_Token
(Source : Unbounded_String;
Set : Maps.Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping) return Unbounded_String;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping);
function Translate
(Source : Unbounded_String;
Mapping : Maps.Character_Mapping_Function) return Unbounded_String;
procedure Translate
(Source : in out Unbounded_String;
Mapping : Maps.Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Unbounded_String;
Low : Positive;
High : Natural;
By : String) return Unbounded_String;
procedure Replace_Slice
(Source : in out Unbounded_String;
Low : Positive;
High : Natural;
By : String);
function Insert
(Source : Unbounded_String;
Before : Positive;
New_Item : String) return Unbounded_String;
procedure Insert
(Source : in out Unbounded_String;
Before : Positive;
New_Item : String);
function Overwrite
(Source : Unbounded_String;
Position : Positive;
New_Item : String) return Unbounded_String;
procedure Overwrite
(Source : in out Unbounded_String;
Position : Positive;
New_Item : String);
function Delete
(Source : Unbounded_String;
From : Positive;
Through : Natural) return Unbounded_String;
procedure Delete
(Source : in out Unbounded_String;
From : Positive;
Through : Natural);
function Trim
(Source : Unbounded_String;
Side : Trim_End) return Unbounded_String;
procedure Trim
(Source : in out Unbounded_String;
Side : Trim_End);
function Trim
(Source : Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Unbounded_String;
procedure Trim
(Source : in out Unbounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set);
function Head
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String;
procedure Head
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space);
function Tail
(Source : Unbounded_String;
Count : Natural;
Pad : Character := Space) return Unbounded_String;
procedure Tail
(Source : in out Unbounded_String;
Count : Natural;
Pad : Character := Space);
function "*"
(Left : Natural;
Right : Character) return Unbounded_String;
function "*"
(Left : Natural;
Right : String) return Unbounded_String;
function "*"
(Left : Natural;
Right : Unbounded_String) return Unbounded_String;
private
pragma Inline (Length);
package AF renames Ada.Finalization;
Null_String : aliased String := "";
function To_Unbounded (S : String) return Unbounded_String
renames To_Unbounded_String;
type Unbounded_String is new AF.Controlled with record
Reference : String_Access := Null_String'Access;
Last : Natural := 0;
end record;
-- The Unbounded_String is using a buffered implementation to increase
-- speed of the Append/Delete/Insert procedures. The Reference string
-- pointer above contains the current string value and extra room at the
-- end to be used by the next Append routine. Last is the index of the
-- string ending character. So the current string value is really
-- Reference (1 .. Last).
pragma Stream_Convert (Unbounded_String, To_Unbounded, To_String);
pragma Finalize_Storage_Only (Unbounded_String);
-- Finalization is required only for freeing storage
procedure Initialize (Object : in out Unbounded_String);
procedure Adjust (Object : in out Unbounded_String);
procedure Finalize (Object : in out Unbounded_String);
procedure Realloc_For_Chunk
(Source : in out Unbounded_String;
Chunk_Size : Natural);
pragma Inline (Realloc_For_Chunk);
-- Adjust the size allocated for the string. Add at least Chunk_Size so it
-- is safe to add a string of this size at the end of the current content.
-- The real size allocated for the string is Chunk_Size + x of the current
-- string size. This buffered handling makes the Append unbounded string
-- routines very fast. This spec is in the private part so that it can be
-- accessed from children (e.g. from Unbounded.Text_IO).
Null_Unbounded_String : constant Unbounded_String :=
(AF.Controlled with
Reference => Null_String'Access,
Last => 0);
-- Note: this declaration is illegal since library level controlled
-- objects are not allowed in preelaborated units. See AI-161 for a
-- discussion of this issue and an attempt to address it. Meanwhile,
-- what happens in GNAT is that this check is omitted for internal
-- implementation units (see check in sem_cat.adb).
end Ada.Strings.Unbounded;
| 32.37844 | 78 | 0.595098 |
5793a6c599f7ddcc60d792c6ab28a291745beb3c | 799 | ads | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/arraydim/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-8.3/gdb/testsuite/gdb.ada/arraydim/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-8.3/gdb/testsuite/gdb.ada/arraydim/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2013-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
| 38.047619 | 73 | 0.737171 |
41387c1992286bcf976fcaba221667fa27aa9713 | 1,557 | ads | Ada | src/norx1641.ads | jhumphry/SPARK_NORX | 898c3842b4445db41cd851206e82336100f768b8 | [
"0BSD"
] | 9 | 2016-05-10T17:58:15.000Z | 2020-10-14T08:40:14.000Z | src/norx1641.ads | jhumphry/SPARK_NORX | 898c3842b4445db41cd851206e82336100f768b8 | [
"0BSD"
] | null | null | null | src/norx1641.ads | jhumphry/SPARK_NORX | 898c3842b4445db41cd851206e82336100f768b8 | [
"0BSD"
] | null | null | null | -- NORX1641
-- an Ada implementation of the NORX Authenticated Encryption Algorithm
-- created by Jean-Philippe Aumasson, Philipp Jovanovic and Samuel Neves
-- This instantiation words on 16-bit words, with 4 rounds and a parallelism
-- degree of 1. Note that the Key_Position is 2 here, not 4 as it is in all
-- the other instantiations. This was a deliberate decision by the designers in
-- order to keep the lower half of the state initialised in a constant way, as
-- it may be slightly more exposed to differential attacks.
-- Copyright (c) 2016, James Humphry - see LICENSE file for details
pragma SPARK_Mode (On);
with Interfaces;
with NORX;
with NORX_Load_Store;
pragma Elaborate_All(NORX);
use all type Interfaces.Unsigned_16;
package NORX1641 is new NORX(w => 16,
Word => Interfaces.Unsigned_16,
Storage_Array_To_Word => NORX_Load_Store.Storage_Array_To_Unsigned_16,
Word_To_Storage_Array => NORX_Load_Store.Unsigned_16_To_Storage_Array,
l => 4,
k => 96,
Key_Position => 2,
t => 96,
n => 32,
rot => (8, 11, 12, 15),
r => 128,
c => 128);
| 44.485714 | 99 | 0.511882 |
2258b34ba9d4a5901266641bab5de61f22b2b44b | 51,603 | adb | Ada | source/amf/ocl/amf-internals-ocl_tuple_types.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/ocl/amf-internals-ocl_tuple_types.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/ocl/amf-internals-ocl_tuple_types.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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.OCL_Attributes;
with AMF.String_Collections;
with AMF.UML.Classifier_Template_Parameters;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Collaboration_Uses.Collections;
with AMF.UML.Comments.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Features.Collections;
with AMF.UML.Generalization_Sets.Collections;
with AMF.UML.Generalizations.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces.Collections;
with AMF.UML.Operations.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameterable_Elements.Collections;
with AMF.UML.Properties.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Redefinable_Template_Signatures;
with AMF.UML.String_Expressions;
with AMF.UML.Substitutions.Collections;
with AMF.UML.Template_Bindings.Collections;
with AMF.UML.Template_Parameters;
with AMF.UML.Template_Signatures;
with AMF.UML.Types;
with AMF.UML.Use_Cases.Collections;
with AMF.Visitors.OCL_Iterators;
with AMF.Visitors.OCL_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.OCL_Tuple_Types is
-------------------------
-- Get_Owned_Attribute --
-------------------------
overriding function Get_Owned_Attribute
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Attribute
(Self.Element)));
end Get_Owned_Attribute;
-------------------------
-- Get_Owned_Operation --
-------------------------
overriding function Get_Owned_Operation
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Operations.Collections.Ordered_Set_Of_UML_Operation is
begin
return
AMF.UML.Operations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Operation
(Self.Element)));
end Get_Owned_Operation;
-------------------
-- Get_Attribute --
-------------------
overriding function Get_Attribute
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Attribute
(Self.Element)));
end Get_Attribute;
---------------------------
-- Get_Collaboration_Use --
---------------------------
overriding function Get_Collaboration_Use
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use is
begin
return
AMF.UML.Collaboration_Uses.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Collaboration_Use
(Self.Element)));
end Get_Collaboration_Use;
-----------------
-- Get_Feature --
-----------------
overriding function Get_Feature
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
return
AMF.UML.Features.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Feature
(Self.Element)));
end Get_Feature;
-----------------
-- Get_General --
-----------------
overriding function Get_General
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_General
(Self.Element)));
end Get_General;
------------------------
-- Get_Generalization --
------------------------
overriding function Get_Generalization
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization is
begin
return
AMF.UML.Generalizations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Generalization
(Self.Element)));
end Get_Generalization;
--------------------------
-- Get_Inherited_Member --
--------------------------
overriding function Get_Inherited_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Inherited_Member
(Self.Element)));
end Get_Inherited_Member;
---------------------
-- Get_Is_Abstract --
---------------------
overriding function Get_Is_Abstract
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Abstract
(Self.Element);
end Get_Is_Abstract;
---------------------
-- Set_Is_Abstract --
---------------------
overriding procedure Set_Is_Abstract
(Self : not null access OCL_Tuple_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Abstract
(Self.Element, To);
end Set_Is_Abstract;
---------------------------------
-- Get_Is_Final_Specialization --
---------------------------------
overriding function Get_Is_Final_Specialization
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Final_Specialization
(Self.Element);
end Get_Is_Final_Specialization;
---------------------------------
-- Set_Is_Final_Specialization --
---------------------------------
overriding procedure Set_Is_Final_Specialization
(Self : not null access OCL_Tuple_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Final_Specialization
(Self.Element, To);
end Set_Is_Final_Specialization;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access is
begin
return
AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
------------------------
-- Get_Owned_Use_Case --
------------------------
overriding function Get_Owned_Use_Case
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Use_Case
(Self.Element)));
end Get_Owned_Use_Case;
--------------------------
-- Get_Powertype_Extent --
--------------------------
overriding function Get_Powertype_Extent
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set is
begin
return
AMF.UML.Generalization_Sets.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Powertype_Extent
(Self.Element)));
end Get_Powertype_Extent;
------------------------------
-- Get_Redefined_Classifier --
------------------------------
overriding function Get_Redefined_Classifier
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefined_Classifier
(Self.Element)));
end Get_Redefined_Classifier;
------------------------
-- Get_Representation --
------------------------
overriding function Get_Representation
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access is
begin
return
AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Representation
(Self.Element)));
end Get_Representation;
------------------------
-- Set_Representation --
------------------------
overriding procedure Set_Representation
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Representation
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Representation;
----------------------
-- Get_Substitution --
----------------------
overriding function Get_Substitution
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution is
begin
return
AMF.UML.Substitutions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Substitution
(Self.Element)));
end Get_Substitution;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access is
begin
return
AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
------------------
-- Get_Use_Case --
------------------
overriding function Get_Use_Case
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Use_Case
(Self.Element)));
end Get_Use_Case;
------------------------
-- Get_Element_Import --
------------------------
overriding function Get_Element_Import
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import is
begin
return
AMF.UML.Element_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Element_Import
(Self.Element)));
end Get_Element_Import;
-------------------------
-- Get_Imported_Member --
-------------------------
overriding function Get_Imported_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
return
AMF.UML.Packageable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Imported_Member
(Self.Element)));
end Get_Imported_Member;
----------------
-- Get_Member --
----------------
overriding function Get_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Member
(Self.Element)));
end Get_Member;
----------------------
-- Get_Owned_Member --
----------------------
overriding function Get_Owned_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Member
(Self.Element)));
end Get_Owned_Member;
--------------------
-- Get_Owned_Rule --
--------------------
overriding function Get_Owned_Rule
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Rule
(Self.Element)));
end Get_Owned_Rule;
------------------------
-- Get_Package_Import --
------------------------
overriding function Get_Package_Import
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import is
begin
return
AMF.UML.Package_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Package_Import
(Self.Element)));
end Get_Package_Import;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
--------------
-- Get_Name --
--------------
overriding function Get_Name
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Name;
--------------
-- Set_Name --
--------------
overriding procedure Set_Name
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Name;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Optional_UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element);
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Optional_UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, To);
end Set_Visibility;
-----------------------
-- Get_Owned_Comment --
-----------------------
overriding function Get_Owned_Comment
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Comments.Collections.Set_Of_UML_Comment is
begin
return
AMF.UML.Comments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment
(Self.Element)));
end Get_Owned_Comment;
-----------------------
-- Get_Owned_Element --
-----------------------
overriding function Get_Owned_Element
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element
(Self.Element)));
end Get_Owned_Element;
---------------
-- Get_Owner --
---------------
overriding function Get_Owner
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner
(Self.Element)));
end Get_Owner;
-----------------
-- Get_Package --
-----------------
overriding function Get_Package
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Package
(Self.Element)));
end Get_Package;
-----------------
-- Set_Package --
-----------------
overriding procedure Set_Package
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Package;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element).Value;
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, (False, To));
end Set_Visibility;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owning_Template_Parameter
(Self.Element)));
end Get_Owning_Template_Parameter;
-----------------------------------
-- Set_Owning_Template_Parameter --
-----------------------------------
overriding procedure Set_Owning_Template_Parameter
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owning_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owning_Template_Parameter;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access is
begin
return
AMF.UML.Template_Signatures.UML_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access OCL_Tuple_Type_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
--------------------------
-- Get_Template_Binding --
--------------------------
overriding function Get_Template_Binding
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding is
begin
return
AMF.UML.Template_Bindings.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Binding
(Self.Element)));
end Get_Template_Binding;
-----------------
-- Get_Is_Leaf --
-----------------
overriding function Get_Is_Leaf
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Leaf
(Self.Element);
end Get_Is_Leaf;
-----------------
-- Set_Is_Leaf --
-----------------
overriding procedure Set_Is_Leaf
(Self : not null access OCL_Tuple_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Leaf
(Self.Element, To);
end Set_Is_Leaf;
---------------------------
-- Get_Redefined_Element --
---------------------------
overriding function Get_Redefined_Element
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is
begin
return
AMF.UML.Redefinable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefined_Element
(Self.Element)));
end Get_Redefined_Element;
------------------------------
-- Get_Redefinition_Context --
------------------------------
overriding function Get_Redefinition_Context
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefinition_Context
(Self.Element)));
end Get_Redefinition_Context;
-------------
-- Inherit --
-------------
overriding function Inherit
(Self : not null access constant OCL_Tuple_Type_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherit unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Inherit";
return Inherit (Self, Inhs);
end Inherit;
------------------
-- All_Features --
------------------
overriding function All_Features
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Features unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.All_Features";
return All_Features (Self);
end All_Features;
-----------------
-- All_Parents --
-----------------
overriding function All_Parents
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Parents unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.All_Parents";
return All_Parents (Self);
end All_Parents;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant OCL_Tuple_Type_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
-------------
-- General --
-------------
overriding function General
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "General unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.General";
return General (Self);
end General;
-----------------------
-- Has_Visibility_Of --
-----------------------
overriding function Has_Visibility_Of
(Self : not null access constant OCL_Tuple_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Has_Visibility_Of unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Has_Visibility_Of";
return Has_Visibility_Of (Self, N);
end Has_Visibility_Of;
-------------------------
-- Inheritable_Members --
-------------------------
overriding function Inheritable_Members
(Self : not null access constant OCL_Tuple_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inheritable_Members unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Inheritable_Members";
return Inheritable_Members (Self, C);
end Inheritable_Members;
----------------------
-- Inherited_Member --
----------------------
overriding function Inherited_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherited_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Inherited_Member";
return Inherited_Member (Self);
end Inherited_Member;
-----------------
-- Is_Template --
-----------------
overriding function Is_Template
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Template";
return Is_Template (Self);
end Is_Template;
-------------------------
-- May_Specialize_Type --
-------------------------
overriding function May_Specialize_Type
(Self : not null access constant OCL_Tuple_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "May_Specialize_Type unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.May_Specialize_Type";
return May_Specialize_Type (Self, C);
end May_Specialize_Type;
-------------
-- Parents --
-------------
overriding function Parents
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parents unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Parents";
return Parents (Self);
end Parents;
------------------------
-- Exclude_Collisions --
------------------------
overriding function Exclude_Collisions
(Self : not null access constant OCL_Tuple_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Exclude_Collisions unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Exclude_Collisions";
return Exclude_Collisions (Self, Imps);
end Exclude_Collisions;
-------------------------
-- Get_Names_Of_Member --
-------------------------
overriding function Get_Names_Of_Member
(Self : not null access constant OCL_Tuple_Type_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Get_Names_Of_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Get_Names_Of_Member";
return Get_Names_Of_Member (Self, Element);
end Get_Names_Of_Member;
--------------------
-- Import_Members --
--------------------
overriding function Import_Members
(Self : not null access constant OCL_Tuple_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Import_Members unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Import_Members";
return Import_Members (Self, Imps);
end Import_Members;
---------------------
-- Imported_Member --
---------------------
overriding function Imported_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Imported_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Imported_Member";
return Imported_Member (Self);
end Imported_Member;
---------------------------------
-- Members_Are_Distinguishable --
---------------------------------
overriding function Members_Are_Distinguishable
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Members_Are_Distinguishable unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Members_Are_Distinguishable";
return Members_Are_Distinguishable (Self);
end Members_Are_Distinguishable;
------------------
-- Owned_Member --
------------------
overriding function Owned_Member
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Owned_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Owned_Member";
return Owned_Member (Self);
end Owned_Member;
--------------------
-- All_Namespaces --
--------------------
overriding function All_Namespaces
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.All_Namespaces";
return All_Namespaces (Self);
end All_Namespaces;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant OCL_Tuple_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Namespace";
return Namespace (Self);
end Namespace;
--------------------
-- Qualified_Name --
--------------------
overriding function Qualified_Name
(Self : not null access constant OCL_Tuple_Type_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Qualified_Name";
return Qualified_Name (Self);
end Qualified_Name;
---------------
-- Separator --
---------------
overriding function Separator
(Self : not null access constant OCL_Tuple_Type_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Separator unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Separator";
return Separator (Self);
end Separator;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.All_Owned_Elements";
return All_Owned_Elements (Self);
end All_Owned_Elements;
-------------------
-- Must_Be_Owned --
-------------------
overriding function Must_Be_Owned
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Must_Be_Owned";
return Must_Be_Owned (Self);
end Must_Be_Owned;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant OCL_Tuple_Type_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant OCL_Tuple_Type_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant OCL_Tuple_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
----------------------------
-- Parameterable_Elements --
----------------------------
overriding function Parameterable_Elements
(Self : not null access constant OCL_Tuple_Type_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parameterable_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Parameterable_Elements";
return Parameterable_Elements (Self);
end Parameterable_Elements;
------------------------
-- Is_Consistent_With --
------------------------
overriding function Is_Consistent_With
(Self : not null access constant OCL_Tuple_Type_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Consistent_With";
return Is_Consistent_With (Self, Redefinee);
end Is_Consistent_With;
-----------------------------------
-- Is_Redefinition_Context_Valid --
-----------------------------------
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant OCL_Tuple_Type_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Tuple_Type_Proxy.Is_Redefinition_Context_Valid";
return Is_Redefinition_Context_Valid (Self, Redefined);
end Is_Redefinition_Context_Valid;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant OCL_Tuple_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Enter_Tuple_Type
(AMF.OCL.Tuple_Types.OCL_Tuple_Type_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant OCL_Tuple_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Leave_Tuple_Type
(AMF.OCL.Tuple_Types.OCL_Tuple_Type_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant OCL_Tuple_Type_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then
AMF.Visitors.OCL_Iterators.OCL_Iterator'Class
(Iterator).Visit_Tuple_Type
(Visitor,
AMF.OCL.Tuple_Types.OCL_Tuple_Type_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.OCL_Tuple_Types;
| 36.417078 | 108 | 0.644381 |
3d9dc8ccdcf27483a87eedd3b8b98a6c678a18a6 | 1,257 | ads | Ada | regtests/dlls/util-systems-dlls-tests.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | regtests/dlls/util-systems-dlls-tests.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | regtests/dlls/util-systems-dlls-tests.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util-systems-dlls-tests -- Unit tests for shared libraries
-- Copyright (C) 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
package Util.Systems.DLLs.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
-- Test the loading a shared library.
procedure Test_Load (T : in out Test);
-- Test getting a shared library symbol.
procedure Test_Get_Symbol (T : in out Test);
end Util.Systems.DLLs.Tests;
| 36.970588 | 76 | 0.646778 |
58eca0eb9af3aa8a39f2d806a0cf0b3a5791f759 | 332 | ads | Ada | Sources/Globe_3d/models/box.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/models/box.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/models/box.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | with GLOBE_3D;
package Box is
procedure Create (object : in out GLOBE_3D.p_Object_3D;
Sides : GLOBE_3D.Vector_3D := (1.0, 1.0, 1.0);
scale : GLOBE_3D.Real := 1.0;
centre : GLOBE_3D.Point_3D := (0.0, 0.0, 0.0));
end Box;
| 30.181818 | 78 | 0.451807 |
225c3300b4d5fc1f30a1b2abbd0f9cd2d42e274d | 317 | ads | Ada | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | package openGL.Conversions
is
function to_Vector_4 (From : in rgba_Color) return Vector_4;
function to_Vector_4 (From : in lucid_Color) return Vector_4;
function to_Vector_3 (From : in rgb_Color) return Vector_3;
function to_Vector_3 (From : in Color) return Vector_3;
end openGL.Conversions;
| 28.818182 | 64 | 0.747634 |
29e9e9862ef7de39499a74581ddf66e7efcef5b0 | 43,141 | adb | Ada | Vivado_HLS_Tutorial/Interface_Synthesis/lab1/adders_prj/solution2/.autopilot/db/adders.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Interface_Synthesis/lab1/adders_prj/solution2/.autopilot/db/adders.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Interface_Synthesis/lab1/adders_prj/solution2/.autopilot/db/adders.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>adders</name>
<ret_bitwidth>32</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>in1</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>in1</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</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>in2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in2</originalName>
<rtlName/>
<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>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>in3</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in3</originalName>
<rtlName/>
<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>6</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>in3_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in3</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>in2_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in2</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>in1_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in1</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp1</name>
<fileName>adders.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>adders</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/Interface_Synthesis/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>adders.c</first>
<second>adders</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>adders_add_32ns_32ns_32_8_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>sum</name>
<fileName>adders.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>adders</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Interface_Synthesis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>adders.c</first>
<second>adders</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum</originalName>
<rtlName>adders_add_32ns_32ns_32_8_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name/>
<fileName>adders.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>61</lineNumber>
<contextFuncName>adders</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Interface_Synthesis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>adders.c</first>
<second>adders</second>
</first>
<second>61</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</consts>
<blocks class_id="16" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="17" tracking_level="1" version="0" object_id="_10">
<Obj>
<type>3</type>
<id>19</id>
<name>adders</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>9</item>
<item>10</item>
<item>11</item>
<item>16</item>
<item>17</item>
<item>18</item>
</node_objs>
</item>
</blocks>
<edges class_id="18" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="19" tracking_level="1" version="0" object_id="_11">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="19" object_id="_12">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="19" object_id="_13">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="19" object_id="_14">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="19" object_id="_15">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="19" object_id="_16">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="19" object_id="_17">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="19" object_id="_18">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="20" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="21" tracking_level="1" version="0" object_id="_19">
<mId>1</mId>
<mTag>adders</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>15</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="23" tracking_level="1" version="0" object_id="_20">
<states class_id="24" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="25" tracking_level="1" version="0" object_id="_21">
<id>1</id>
<operations class_id="26" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="1" version="0" object_id="_22">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_23">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_24">
<id>16</id>
<stage>8</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_25">
<id>2</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_26">
<id>16</id>
<stage>7</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_27">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_28">
<id>16</id>
<stage>6</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_29">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_30">
<id>16</id>
<stage>5</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_31">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_32">
<id>16</id>
<stage>4</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_33">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_34">
<id>16</id>
<stage>3</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_35">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_36">
<id>16</id>
<stage>2</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_37">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_38">
<id>16</id>
<stage>1</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_39">
<id>9</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_40">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_41">
<id>17</id>
<stage>8</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_42">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_43">
<id>17</id>
<stage>7</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_44">
<id>11</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_45">
<id>17</id>
<stage>6</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_46">
<id>12</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_47">
<id>17</id>
<stage>5</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_48">
<id>13</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_49">
<id>17</id>
<stage>4</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_50">
<id>14</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_51">
<id>17</id>
<stage>3</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_52">
<id>15</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_53">
<id>17</id>
<stage>2</stage>
<latency>8</latency>
</item>
</operations>
</item>
<item class_id_reference="25" object_id="_54">
<id>16</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="27" object_id="_55">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_56">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_57">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_58">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_59">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_60">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_61">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_62">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_63">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="27" object_id="_64">
<id>17</id>
<stage>1</stage>
<latency>8</latency>
</item>
<item class_id_reference="27" object_id="_65">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="28" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="29" tracking_level="1" version="0" object_id="_66">
<inState>1</inState>
<outState>2</outState>
<condition class_id="30" tracking_level="0" version="0">
<id>16</id>
<sop class_id="31" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="29" object_id="_67">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>17</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="29" object_id="_68">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>18</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="29" object_id="_69">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>19</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="29" object_id="_70">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>20</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="29" object_id="_71">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>21</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="29" object_id="_72">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>22</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="29" object_id="_73">
<inState>8</inState>
<outState>9</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="29" object_id="_74">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>24</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="29" object_id="_75">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>25</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="29" object_id="_76">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>26</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="29" object_id="_77">
<inState>12</inState>
<outState>13</outState>
<condition>
<id>27</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="29" object_id="_78">
<inState>13</inState>
<outState>14</outState>
<condition>
<id>28</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="29" object_id="_79">
<inState>14</inState>
<outState>15</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="29" object_id="_80">
<inState>15</inState>
<outState>16</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>
</transitions>
</fsm>
<res class_id="33" tracking_level="1" version="0" object_id="_81">
<dp_component_resource class_id="34" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="35" tracking_level="0" version="0">
<first>adders_add_32ns_32ns_32_8_U0 (adders_add_32ns_32ns_32_8)</first>
<second class_id="36" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>FF</first>
<second>375</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>adders_add_32ns_32ns_32_8_U1 (adders_add_32ns_32ns_32_8)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>FF</first>
<second>375</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
</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>1</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>17</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>17</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>2</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>16</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>tmp1_reg_63</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="38" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>adders_add_32ns_32ns_32_8_U0 (adders_add_32ns_32ns_32_8)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>adders_add_32ns_32ns_32_8_U1 (adders_add_32ns_32ns_32_8)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</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="40" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>9</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>7</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>8</first>
<second>7</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>19</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>15</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="46" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="47" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>24</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>30</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>36</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>42</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
</second>
</item>
<item>
<first>48</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="50" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>2</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>grp_fu_42</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
<item>16</item>
</second>
</item>
<item>
<first>grp_fu_48</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
<item>17</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>3</count>
<item_version>0</item_version>
<item>
<first>in1_read_read_fu_30</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>in2_read_read_fu_36</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>in3_read_read_fu_24</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_return</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="52" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>53</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>in1_read_reg_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>in2_read_reg_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>in3_read_reg_53</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>tmp1_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</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="53" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>in1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>in2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
<item>
<first>in3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="55" 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>
| 30.661692 | 98 | 0.461881 |
584a57c54475111026aae1d3088e7cbd6ef4e314 | 1,744 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_create_glx_pixmap_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_create_glx_pixmap_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_create_glx_pixmap_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_create_glx_pixmap_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;
screen : aliased Interfaces.Unsigned_32;
visual : aliased xcb.xcb_visualid_t;
pixmap : aliased xcb.xcb_pixmap_t;
glx_pixmap : aliased xcb.xcb_glx_pixmap_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_create_glx_pixmap_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_create_glx_pixmap_request_t.Item,
Element_Array => xcb.xcb_glx_create_glx_pixmap_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_create_glx_pixmap_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_create_glx_pixmap_request_t.Pointer,
Element_Array => xcb.xcb_glx_create_glx_pixmap_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_create_glx_pixmap_request_t;
| 29.559322 | 79 | 0.678899 |
5959eb9e1dd575c643ed4bf86783e70cf6e5245f | 6,689 | adb | Ada | src/drivers/sercom_u2201/sam-sercom-spi.adb | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | 1 | 2020-02-24T23:19:03.000Z | 2020-02-24T23:19:03.000Z | src/drivers/sercom_u2201/sam-sercom-spi.adb | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | src/drivers/sercom_u2201/sam-sercom-spi.adb | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019, 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. --
-- --
------------------------------------------------------------------------------
package body SAM.SERCOM.SPI is
---------------
-- Configure --
---------------
procedure Configure
(This : in out SPI_Device;
Baud : UInt8;
Data_Order : Data_Bit_Order;
Phase : Clock_Phase;
Polarity : Clock_Polarity;
DIPO : Pad_Id;
DOPO : Pad_Id;
Slave_Select_Enable : Boolean)
is
CTRLB : SERCOM_CTRLB_SERCOM_SPI_Register;
begin
This.Reset;
This.Periph.SERCOM_SPI.CTRLA :=
(MODE => 3, -- SPI Master
DOPO => UInt2 (DOPO),
DIPO => UInt2 (DIPO),
FORM => 0,
CPHA => (case Phase is
when Sample_Leading_Edge => False,
when Sample_Trailing_Edge => True),
CPOL => (case Polarity is
when Active_High => False,
when Active_Low => True),
DORD => (case Data_Order is
when Most_Significant_First => False,
when Least_Significant_First => True),
others => <>
);
This.Periph.SERCOM_SPI.BAUD := Baud;
CTRLB := This.Periph.SERCOM_SPI.CTRLB;
CTRLB.CHSIZE := 0;
CTRLB.MSSEN := Slave_Select_Enable;
This.Periph.SERCOM_SPI.CTRLB := CTRLB;
-- Wait for CTRLB synchronization signal
while This.Periph.SERCOM_SPI.SYNCBUSY.CTRLB loop
null;
end loop;
This.Config_Done := True;
end Configure;
---------------------
-- Enable_Receiver --
---------------------
procedure Enable_Receiver (This : in out SPI_Device) is
begin
This.Periph.SERCOM_SPI.CTRLB.RXEN := True;
-- Wait for CTRLB synchronization signal
while This.Periph.SERCOM_SPI.SYNCBUSY.CTRLB loop
null;
end loop;
end Enable_Receiver;
----------------------
-- Disable_Receiver --
----------------------
procedure Disable_Receiver (This : in out SPI_Device) is
begin
This.Periph.SERCOM_SPI.CTRLB.RXEN := False;
-- Wait for CTRLB synchronization signal
while This.Periph.SERCOM_SPI.SYNCBUSY.CTRLB loop
null;
end loop;
end Disable_Receiver;
------------------
-- Data_Address --
------------------
function Data_Address (This : SPI_Device) return System.Address
is (This.Periph.SERCOM_SPI.DATA'Address);
--------------
-- Transmit --
--------------
overriding
procedure Transmit
(This : in out SPI_Device;
Data : SPI_Data_8b;
Status : out SPI_Status;
Timeout : Natural := 1_000)
is
pragma Unreferenced (Timeout);
begin
for Elt of Data loop
This.Periph.SERCOM_SPI.DATA := UInt32 (Elt);
while not This.Periph.SERCOM_SPI.INTFLAG.TXC loop
null;
end loop;
end loop;
Status := Ok;
end Transmit;
--------------
-- Transmit --
--------------
overriding
procedure Transmit
(This : in out SPI_Device;
Data : SPI_Data_16b;
Status : out SPI_Status;
Timeout : Natural := 1_000)
is
begin
raise Program_Error with "Unimplemented procedure Transmit 16b";
end Transmit;
-------------
-- Receive --
-------------
overriding
procedure Receive
(This : in out SPI_Device;
Data : out SPI_Data_8b;
Status : out SPI_Status;
Timeout : Natural := 1_000)
is
pragma Unreferenced (Timeout);
begin
for Elt of Data loop
-- Write anything to trigger the transaction
This.Periph.SERCOM_SPI.DATA := 0;
while not This.Periph.SERCOM_SPI.INTFLAG.RXC loop
null;
end loop;
Elt := UInt8 (This.Periph.SERCOM_SPI.DATA and 16#FF#);
end loop;
Status := Ok;
end Receive;
-------------
-- Receive --
-------------
overriding
procedure Receive
(This : in out SPI_Device;
Data : out SPI_Data_16b;
Status : out SPI_Status;
Timeout : Natural := 1_000)
is
begin
raise Program_Error with "Unimplemented procedure Receive 16bit";
end Receive;
end SAM.SERCOM.SPI;
| 33.113861 | 78 | 0.515473 |
3dcf2150c80d61df1af342801a70eb59a9ae6d07 | 607 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/discr13.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/discr13.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/discr13.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
with Discr12_Pkg; use Discr12_Pkg;
procedure Discr13 is
function F1 return Integer is
begin
return Dummy (1);
end F1;
protected type Poe (D3 : Integer := F1) is
entry E (D3 .. F1); -- F1 evaluated
function Is_Ok (D3 : Integer; E_First : Integer; E_Last : Integer) return Boolean;
end Poe;
protected body Poe is
entry E (for I in D3 .. F1) when True is
begin
null;
end E;
function Is_Ok (D3 : Integer; E_First : Integer; E_Last : Integer) return Boolean is
begin
return False;
end Is_Ok;
end Poe;
begin
null;
end;
| 19.580645 | 88 | 0.635914 |
228b9ae153b1aea3a438d2b1c8fc690e84b9bb1f | 2,313 | adb | Ada | src/shared/generic/lsc-internal-byteswap64.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | src/shared/generic/lsc-internal-byteswap64.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | src/shared/generic/lsc-internal-byteswap64.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- 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 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 LSC.Internal.Ops64;
package body LSC.Internal.Byteswap64 is
function Swap (Value : Types.Word64) return Types.Word64
is
Temp : Types.Byte_Array64_Type;
begin
Temp := Types.Word64_To_Byte_Array64 (Value);
return Ops64.Bytes_To_Word (Temp (0), Temp (1), Temp (2), Temp (3),
Temp (4), Temp (5), Temp (6), Temp (7));
end Swap;
end LSC.Internal.Byteswap64;
| 47.204082 | 79 | 0.661479 |
2f16f26dc1db4b625b2b64aefe914a873b6456aa | 11,621 | adb | Ada | runtime/ravenscar-sfp-stm32f427/bsp/setup_pll.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/bsp/setup_pll.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/bsp/setup_pll.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- Copyright (C) 2012-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. --
-- --
-- --
-- --
-- --
-- --
-- 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 Ada_2012; -- To work around pre-commit check?
pragma Restrictions (No_Elaboration_Code);
pragma Suppress (All_Checks);
-- This initialization procedure mainly initializes the PLLs and
-- all derived clocks.
with Ada.Unchecked_Conversion;
with Interfaces.Bit_Types; use Interfaces, Interfaces.Bit_Types;
with Interfaces.STM32.FLASH; use Interfaces.STM32.FLASH;
with Interfaces.STM32.PWR; use Interfaces.STM32.PWR;
with Interfaces.STM32.RCC; use Interfaces.STM32.RCC;
with System.BB.Parameters; use System.BB.Parameters;
with System.BB.MCU_Parameters;
with System.STM32; use System.STM32;
procedure Setup_Pll is
procedure Initialize_Clocks;
procedure Reset_Clocks;
------------------------------
-- Clock Tree Configuration --
------------------------------
HSE_Enabled : constant Boolean := True; -- use high-speed ext. clock
HSE_Bypass : constant Boolean := False; -- don't bypass ext. resonator
LSI_Enabled : constant Boolean := True; -- use low-speed internal clock
Activate_PLL : constant Boolean := True;
Activate_Overdrive : constant Boolean := True;
Activate_PLLI2S : constant Boolean := False;
pragma Assert ((if Activate_PLL then HSE_Enabled),
"PLL only supported with external clock");
pragma Assert (not Activate_PLLI2S, "not yet implemented");
-----------------------
-- Initialize_Clocks --
-----------------------
procedure Initialize_Clocks
is
-------------------------------
-- Compute Clock Frequencies --
-------------------------------
PLLP_Value : constant PLLP_Range := 2;
-- Arbitrary fixed to a convenient value
PLLCLKIN : constant Integer := 1_000_000;
PLLM_Value : constant Integer := HSE_Clock / PLLCLKIN;
-- First divider M is set to produce a 1Mhz clock
PLLN_Value : constant Integer :=
(PLLP_Value * Clock_Frequency) / PLLCLKIN;
-- Compute N to to generate the required frequency
PLLVC0 : constant Integer := PLLCLKIN * PLLN_Value;
PLLCLKOUT : constant Integer := PLLVC0 / PLLP_Value;
PLLQ_Value : constant PLLQ_Range := 7;
-- Arbitrary fixed
PLLM : constant UInt6 := UInt6 (PLLM_Value);
PLLN : constant UInt9 := UInt9 (PLLN_Value);
PLLP : constant UInt2 := UInt2 (PLLP_Value / 2 - 1);
PLLQ : constant UInt4 := UInt4 (PLLQ_Value);
SW : constant SYSCLK_Source :=
(if Activate_PLL then SYSCLK_SRC_PLL
else (if HSE_Enabled then SYSCLK_SRC_HSE
else SYSCLK_SRC_HSI));
SW_Value : constant CFGR_SW_Field :=
SYSCLK_Source'Enum_Rep (SW);
SYSCLK : constant Integer := (if Activate_PLL
then PLLCLKOUT
else HSICLK);
HCLK : constant Integer :=
(if not AHB_PRE.Enabled
then SYSCLK
else
(case AHB_PRE.Value is
when DIV2 => SYSCLK / 2,
when DIV4 => SYSCLK / 4,
when DIV8 => SYSCLK / 8,
when DIV16 => SYSCLK / 16,
when DIV64 => SYSCLK / 64,
when DIV128 => SYSCLK / 128,
when DIV256 => SYSCLK / 256,
when DIV512 => SYSCLK / 512));
PCLK1 : constant Integer :=
(if not APB1_PRE.Enabled
then HCLK
else
(case APB1_PRE.Value is
when DIV2 => HCLK / 2,
when DIV4 => HCLK / 4,
when DIV8 => HCLK / 8,
when DIV16 => HCLK / 16));
PCLK2 : constant Integer :=
(if not APB2_PRE.Enabled
then HCLK
else
(case APB2_PRE.Value is
when DIV2 => HCLK / 2,
when DIV4 => HCLK / 4,
when DIV8 => HCLK / 8,
when DIV16 => HCLK / 16));
function To_AHB is new Ada.Unchecked_Conversion
(AHB_Prescaler, UInt4);
function To_APB is new Ada.Unchecked_Conversion
(APB_Prescaler, UInt3);
begin
-- Check configuration
pragma Warnings (Off, "condition is always False");
if PLLVC0 not in PLLVC0_Range
or else
PLLCLKOUT not in PLLOUT_Range
then
raise Program_Error with "Invalid clock configuration";
end if;
if SYSCLK /= Clock_Frequency then
raise Program_Error with "Cannot generate requested clock";
end if;
if HCLK not in HCLK_Range
or else
PCLK1 not in PCLK1_Range
or else
PCLK2 not in PCLK2_Range
then
raise Program_Error with "Invalid AHB/APB prescalers configuration";
end if;
pragma Warnings (On, "condition is always False");
-- PWR clock enable
RCC_Periph.APB1ENR.PWREN := 1;
-- Reset the power interface
RCC_Periph.APB1RSTR.PWRRST := 1;
RCC_Periph.APB1RSTR.PWRRST := 0;
-- PWR initialization
-- Select higher supply power for stable operation at max. freq.
-- See table "General operating conditions" of the STM32 datasheets
-- to obtain the maximal operating frequency depending on the power
-- scaling mode and the over-drive mode
System.BB.MCU_Parameters.PWR_Initialize;
if not HSE_Enabled then
-- Setup internal clock and wait for HSI stabilisation.
RCC_Periph.CR.HSION := 1;
loop
exit when RCC_Periph.CR.HSIRDY = 1;
end loop;
else
-- Configure high-speed external clock, if enabled
RCC_Periph.CR.HSEON := 1;
RCC_Periph.CR.HSEBYP := (if HSE_Bypass then 1 else 0);
loop
exit when RCC_Periph.CR.HSERDY = 1;
end loop;
end if;
-- Configure low-speed internal clock if enabled
if LSI_Enabled then
RCC_Periph.CSR.LSION := 1;
loop
exit when RCC_Periph.CSR.LSIRDY = 1;
end loop;
end if;
-- Activate PLL if enabled
if Activate_PLL then
-- Disable the main PLL before configuring it
RCC_Periph.CR.PLLON := 0;
-- Configure the PLL clock source, multiplication and division
-- factors
RCC_Periph.PLLCFGR :=
(PLLM => PLLM,
PLLN => PLLN,
PLLP => PLLP,
PLLQ => PLLQ,
PLLSRC => (if HSE_Enabled
then PLL_Source'Enum_Rep (PLL_SRC_HSE)
else PLL_Source'Enum_Rep (PLL_SRC_HSI)),
others => <>);
RCC_Periph.CR.PLLON := 1;
loop
exit when RCC_Periph.CR.PLLRDY = 1;
end loop;
end if;
-- Configure OverDrive mode
if Activate_Overdrive then
System.BB.MCU_Parameters.PWR_Overdrive_Enable;
end if;
-- Configure flash
-- Must be done before increasing the frequency, otherwise the CPU
-- won't be able to fetch new instructions.
FLASH_Periph.ACR.ICEN := 0;
FLASH_Periph.ACR.DCEN := 0;
FLASH_Periph.ACR.ICRST := 1;
FLASH_Periph.ACR.DCRST := 1;
FLASH_Periph.ACR :=
(LATENCY => 5,
ICEN => 1,
DCEN => 1,
PRFTEN => 1,
others => <>);
-- Configure derived clocks
RCC_Periph.CFGR :=
(SW => SW_Value,
HPRE => To_AHB (AHB_PRE),
PPRE => (As_Array => True,
Arr => (1 => To_APB (APB1_PRE),
2 => To_APB (APB2_PRE))),
RTCPRE => 16#0#,
I2SSRC => I2S_Clock_Selection'Enum_Rep (I2SSEL_PLL),
MCO1 => MC01_Clock_Selection'Enum_Rep (MC01SEL_HSI),
MCO1PRE => MC0x_Prescaler'Enum_Rep (MC0xPRE_DIV1),
MCO2 => MC02_Clock_Selection'Enum_Rep (MC02SEL_SYSCLK),
MCO2PRE => MC0x_Prescaler'Enum_Rep (MC0xPRE_DIV5),
others => <>);
if Activate_PLL then
loop
exit when RCC_Periph.CFGR.SWS =
SYSCLK_Source'Enum_Rep (SYSCLK_SRC_PLL);
end loop;
-- Wait until voltage supply scaling has completed
loop
exit when System.BB.MCU_Parameters.Is_PWR_Stabilized;
end loop;
end if;
end Initialize_Clocks;
------------------
-- Reset_Clocks --
------------------
procedure Reset_Clocks is
begin
-- Switch on high speed internal clock
RCC_Periph.CR.HSION := 1;
-- Reset CFGR regiser
RCC_Periph.CFGR := (others => <>);
-- Reset HSEON, CSSON and PLLON bits
RCC_Periph.CR.HSEON := 0;
RCC_Periph.CR.CSSON := 0;
RCC_Periph.CR.PLLON := 0;
-- Reset PLL configuration register
RCC_Periph.PLLCFGR := (others => <>);
-- Reset HSE bypass bit
RCC_Periph.CR.HSEBYP := 0;
-- Disable all interrupts
RCC_Periph.CIR := (others => <>);
end Reset_Clocks;
begin
Reset_Clocks;
Initialize_Clocks;
end Setup_Pll;
| 35.978328 | 79 | 0.499785 |
4d459e5c862a68fc3a5bba26138275797d096751 | 2,608 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-explli.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-explli.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-explli.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X P _ L L I --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Long_Long_Integer exponentiation (checks on)
with System.Expont;
package System.Exp_LLI is
function Exp_Long_Long_Integer is new Expont (Long_Long_Integer);
pragma Pure_Function (Exp_Long_Long_Integer);
end System.Exp_LLI;
| 62.095238 | 78 | 0.340491 |
59d3440dc37b964fbc79725f0e3eb4d844ab1f83 | 792 | adb | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/inherited_primitive_operation.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/inherited_primitive_operation.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/inherited_primitive_operation.adb | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z |
PROCEDURE Inherited_Primitive_Operation IS
PACKAGE Inner IS
TYPE PARENT IS ARRAY (INTEGER RANGE <>) OF float;
FUNCTION CREATE ( F, L : INTEGER;
TYPETAG : PARENT -- TO RESOLVE OVERLOADING.
) RETURN PARENT;
END Inner;
TYPE T IS NEW Inner.PARENT (5 .. 7);
X : T := (OTHERS => 2.0);
PACKAGE BODY Inner IS
FUNCTION CREATE
( F, L : INTEGER;
TYPETAG : PARENT
) RETURN PARENT
IS
A : PARENT (F .. L) := (others => 0.0);
BEGIN
RETURN A;
END CREATE;
END Inner;
BEGIN
-- CREATE MUST NOT HAVE A PREFIX
X := CREATE(2, 4, X);
END Inherited_Primitive_Operation;
| 22.628571 | 73 | 0.484848 |
5895940574e99b3fc780b2dbb30fd9938969f452 | 3,413 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__android.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__android.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-osinte__android.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is an Android version of this package.
-- This package encapsulates all direct interfaces to OS services
-- that are needed by children of System.
with Interfaces.C; use Interfaces.C;
package body System.OS_Interface is
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.tv_sec) + Duration (TS.tv_nsec) / 10#1#E9;
end To_Duration;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec'(tv_sec => S,
tv_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
end System.OS_Interface;
| 45.506667 | 78 | 0.421037 |
124eb9002bf6ddef945d5efe8c02aeb27b0b6b85 | 69,221 | adb | Ada | source/oasis/program-elements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Pragmas;
with Program.Elements.Defining_Names;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Defining_Character_Literals;
with Program.Elements.Defining_Operator_Symbols;
with Program.Elements.Defining_Expanded_Names;
with Program.Elements.Declarations;
with Program.Elements.Type_Declarations;
with Program.Elements.Task_Type_Declarations;
with Program.Elements.Protected_Type_Declarations;
with Program.Elements.Subtype_Declarations;
with Program.Elements.Object_Declarations;
with Program.Elements.Single_Task_Declarations;
with Program.Elements.Single_Protected_Declarations;
with Program.Elements.Number_Declarations;
with Program.Elements.Enumeration_Literal_Specifications;
with Program.Elements.Discriminant_Specifications;
with Program.Elements.Component_Declarations;
with Program.Elements.Loop_Parameter_Specifications;
with Program.Elements.Generalized_Iterator_Specifications;
with Program.Elements.Element_Iterator_Specifications;
with Program.Elements.Procedure_Declarations;
with Program.Elements.Function_Declarations;
with Program.Elements.Parameter_Specifications;
with Program.Elements.Procedure_Body_Declarations;
with Program.Elements.Function_Body_Declarations;
with Program.Elements.Return_Object_Specifications;
with Program.Elements.Package_Declarations;
with Program.Elements.Package_Body_Declarations;
with Program.Elements.Object_Renaming_Declarations;
with Program.Elements.Exception_Renaming_Declarations;
with Program.Elements.Procedure_Renaming_Declarations;
with Program.Elements.Function_Renaming_Declarations;
with Program.Elements.Package_Renaming_Declarations;
with Program.Elements.Generic_Package_Renaming_Declarations;
with Program.Elements.Generic_Procedure_Renaming_Declarations;
with Program.Elements.Generic_Function_Renaming_Declarations;
with Program.Elements.Task_Body_Declarations;
with Program.Elements.Protected_Body_Declarations;
with Program.Elements.Entry_Declarations;
with Program.Elements.Entry_Body_Declarations;
with Program.Elements.Entry_Index_Specifications;
with Program.Elements.Procedure_Body_Stubs;
with Program.Elements.Function_Body_Stubs;
with Program.Elements.Package_Body_Stubs;
with Program.Elements.Task_Body_Stubs;
with Program.Elements.Protected_Body_Stubs;
with Program.Elements.Exception_Declarations;
with Program.Elements.Choice_Parameter_Specifications;
with Program.Elements.Generic_Package_Declarations;
with Program.Elements.Generic_Procedure_Declarations;
with Program.Elements.Generic_Function_Declarations;
with Program.Elements.Package_Instantiations;
with Program.Elements.Procedure_Instantiations;
with Program.Elements.Function_Instantiations;
with Program.Elements.Formal_Object_Declarations;
with Program.Elements.Formal_Type_Declarations;
with Program.Elements.Formal_Procedure_Declarations;
with Program.Elements.Formal_Function_Declarations;
with Program.Elements.Formal_Package_Declarations;
with Program.Elements.Definitions;
with Program.Elements.Type_Definitions;
with Program.Elements.Subtype_Indications;
with Program.Elements.Constraints;
with Program.Elements.Component_Definitions;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Discrete_Subtype_Indications;
with Program.Elements.Discrete_Range_Attribute_References;
with Program.Elements.Discrete_Simple_Expression_Ranges;
with Program.Elements.Unknown_Discriminant_Parts;
with Program.Elements.Known_Discriminant_Parts;
with Program.Elements.Record_Definitions;
with Program.Elements.Null_Components;
with Program.Elements.Variant_Parts;
with Program.Elements.Variants;
with Program.Elements.Others_Choices;
with Program.Elements.Anonymous_Access_Definitions;
with Program.Elements.Anonymous_Access_To_Objects;
with Program.Elements.Anonymous_Access_To_Procedures;
with Program.Elements.Anonymous_Access_To_Functions;
with Program.Elements.Private_Type_Definitions;
with Program.Elements.Private_Extension_Definitions;
with Program.Elements.Incomplete_Type_Definitions;
with Program.Elements.Task_Definitions;
with Program.Elements.Protected_Definitions;
with Program.Elements.Formal_Type_Definitions;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Real_Range_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Numeric_Literals;
with Program.Elements.String_Literals;
with Program.Elements.Identifiers;
with Program.Elements.Operator_Symbols;
with Program.Elements.Character_Literals;
with Program.Elements.Explicit_Dereferences;
with Program.Elements.Infix_Operators;
with Program.Elements.Function_Calls;
with Program.Elements.Indexed_Components;
with Program.Elements.Slices;
with Program.Elements.Selected_Components;
with Program.Elements.Attribute_References;
with Program.Elements.Record_Aggregates;
with Program.Elements.Extension_Aggregates;
with Program.Elements.Array_Aggregates;
with Program.Elements.Short_Circuit_Operations;
with Program.Elements.Membership_Tests;
with Program.Elements.Null_Literals;
with Program.Elements.Parenthesized_Expressions;
with Program.Elements.Raise_Expressions;
with Program.Elements.Type_Conversions;
with Program.Elements.Qualified_Expressions;
with Program.Elements.Allocators;
with Program.Elements.Case_Expressions;
with Program.Elements.If_Expressions;
with Program.Elements.Quantified_Expressions;
with Program.Elements.Associations;
with Program.Elements.Discriminant_Associations;
with Program.Elements.Record_Component_Associations;
with Program.Elements.Array_Component_Associations;
with Program.Elements.Parameter_Associations;
with Program.Elements.Formal_Package_Associations;
with Program.Elements.Statements;
with Program.Elements.Null_Statements;
with Program.Elements.Assignment_Statements;
with Program.Elements.If_Statements;
with Program.Elements.Case_Statements;
with Program.Elements.Loop_Statements;
with Program.Elements.While_Loop_Statements;
with Program.Elements.For_Loop_Statements;
with Program.Elements.Block_Statements;
with Program.Elements.Exit_Statements;
with Program.Elements.Goto_Statements;
with Program.Elements.Call_Statements;
with Program.Elements.Simple_Return_Statements;
with Program.Elements.Extended_Return_Statements;
with Program.Elements.Accept_Statements;
with Program.Elements.Requeue_Statements;
with Program.Elements.Delay_Statements;
with Program.Elements.Terminate_Alternative_Statements;
with Program.Elements.Select_Statements;
with Program.Elements.Abort_Statements;
with Program.Elements.Raise_Statements;
with Program.Elements.Code_Statements;
with Program.Elements.Paths;
with Program.Elements.Elsif_Paths;
with Program.Elements.Case_Paths;
with Program.Elements.Select_Paths;
with Program.Elements.Case_Expression_Paths;
with Program.Elements.Elsif_Expression_Paths;
with Program.Elements.Clauses;
with Program.Elements.Use_Clauses;
with Program.Elements.With_Clauses;
with Program.Elements.Representation_Clauses;
with Program.Elements.Component_Clauses;
with Program.Elements.Derived_Types;
with Program.Elements.Derived_Record_Extensions;
with Program.Elements.Enumeration_Types;
with Program.Elements.Signed_Integer_Types;
with Program.Elements.Modular_Types;
with Program.Elements.Root_Types;
with Program.Elements.Floating_Point_Types;
with Program.Elements.Ordinary_Fixed_Point_Types;
with Program.Elements.Decimal_Fixed_Point_Types;
with Program.Elements.Unconstrained_Array_Types;
with Program.Elements.Constrained_Array_Types;
with Program.Elements.Record_Types;
with Program.Elements.Interface_Types;
with Program.Elements.Object_Access_Types;
with Program.Elements.Procedure_Access_Types;
with Program.Elements.Function_Access_Types;
with Program.Elements.Formal_Private_Type_Definitions;
with Program.Elements.Formal_Derived_Type_Definitions;
with Program.Elements.Formal_Discrete_Type_Definitions;
with Program.Elements.Formal_Signed_Integer_Type_Definitions;
with Program.Elements.Formal_Modular_Type_Definitions;
with Program.Elements.Formal_Floating_Point_Definitions;
with Program.Elements.Formal_Ordinary_Fixed_Point_Definitions;
with Program.Elements.Formal_Decimal_Fixed_Point_Definitions;
with Program.Elements.Formal_Unconstrained_Array_Types;
with Program.Elements.Formal_Constrained_Array_Types;
with Program.Elements.Formal_Access_Types;
with Program.Elements.Formal_Object_Access_Types;
with Program.Elements.Formal_Procedure_Access_Types;
with Program.Elements.Formal_Function_Access_Types;
with Program.Elements.Formal_Interface_Types;
with Program.Elements.Access_Types;
with Program.Elements.Range_Attribute_References;
with Program.Elements.Simple_Expression_Ranges;
with Program.Elements.Digits_Constraints;
with Program.Elements.Delta_Constraints;
with Program.Elements.Index_Constraints;
with Program.Elements.Discriminant_Constraints;
with Program.Elements.Attribute_Definition_Clauses;
with Program.Elements.Enumeration_Representation_Clauses;
with Program.Elements.Record_Representation_Clauses;
with Program.Elements.At_Clauses;
with Program.Elements.Exception_Handlers;
package body Program.Elements is
function Each_Enclosing_Element
(Self : not null access Element'Class)
return Program.Element_Iterators.Enclosing_Element_Iterator
renames Program.Element_Iterators.To_Enclosing_Element_Iterator;
function Each_Child
(Self : not null access Element'Class)
return Program.Element_Iterators.Child_Iterator
renames Program.Element_Iterators.To_Child_Iterator;
function To_Pragma
(Self : access Element'Class)
return Program.Elements.Pragmas.Pragma_Access is
begin
return Program.Elements.Pragmas.Pragma_Access (Self);
end To_Pragma;
function To_Defining_Name
(Self : access Element'Class)
return Program.Elements.Defining_Names.Defining_Name_Access is
begin
return Program.Elements.Defining_Names.Defining_Name_Access (Self);
end To_Defining_Name;
function To_Defining_Identifier
(Self : access Element'Class)
return Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is
begin
return Program.Elements.Defining_Identifiers.Defining_Identifier_Access
(Self);
end To_Defining_Identifier;
function To_Defining_Character_Literal
(Self : access Element'Class)
return Program.Elements.Defining_Character_Literals
.Defining_Character_Literal_Access is
begin
return Program.Elements.Defining_Character_Literals
.Defining_Character_Literal_Access
(Self);
end To_Defining_Character_Literal;
function To_Defining_Operator_Symbol
(Self : access Element'Class)
return Program.Elements.Defining_Operator_Symbols
.Defining_Operator_Symbol_Access is
begin
return Program.Elements.Defining_Operator_Symbols
.Defining_Operator_Symbol_Access
(Self);
end To_Defining_Operator_Symbol;
function To_Defining_Expanded_Name
(Self : access Element'Class)
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Access is
begin
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Access
(Self);
end To_Defining_Expanded_Name;
function To_Declaration
(Self : access Element'Class)
return Program.Elements.Declarations.Declaration_Access is
begin
return Program.Elements.Declarations.Declaration_Access (Self);
end To_Declaration;
function To_Type_Declaration
(Self : access Element'Class)
return Program.Elements.Type_Declarations.Type_Declaration_Access is
begin
return Program.Elements.Type_Declarations.Type_Declaration_Access (Self);
end To_Type_Declaration;
function To_Task_Type_Declaration
(Self : access Element'Class)
return Program.Elements.Task_Type_Declarations
.Task_Type_Declaration_Access is
begin
return Program.Elements.Task_Type_Declarations
.Task_Type_Declaration_Access
(Self);
end To_Task_Type_Declaration;
function To_Protected_Type_Declaration
(Self : access Element'Class)
return Program.Elements.Protected_Type_Declarations
.Protected_Type_Declaration_Access is
begin
return Program.Elements.Protected_Type_Declarations
.Protected_Type_Declaration_Access
(Self);
end To_Protected_Type_Declaration;
function To_Subtype_Declaration
(Self : access Element'Class)
return Program.Elements.Subtype_Declarations
.Subtype_Declaration_Access is
begin
return Program.Elements.Subtype_Declarations.Subtype_Declaration_Access
(Self);
end To_Subtype_Declaration;
function To_Object_Declaration
(Self : access Element'Class)
return Program.Elements.Object_Declarations.Object_Declaration_Access is
begin
return Program.Elements.Object_Declarations.Object_Declaration_Access
(Self);
end To_Object_Declaration;
function To_Single_Task_Declaration
(Self : access Element'Class)
return Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Access is
begin
return Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Access
(Self);
end To_Single_Task_Declaration;
function To_Single_Protected_Declaration
(Self : access Element'Class)
return Program.Elements.Single_Protected_Declarations
.Single_Protected_Declaration_Access is
begin
return Program.Elements.Single_Protected_Declarations
.Single_Protected_Declaration_Access
(Self);
end To_Single_Protected_Declaration;
function To_Number_Declaration
(Self : access Element'Class)
return Program.Elements.Number_Declarations.Number_Declaration_Access is
begin
return Program.Elements.Number_Declarations.Number_Declaration_Access
(Self);
end To_Number_Declaration;
function To_Enumeration_Literal_Specification
(Self : access Element'Class)
return Program.Elements.Enumeration_Literal_Specifications
.Enumeration_Literal_Specification_Access is
begin
return Program.Elements.Enumeration_Literal_Specifications
.Enumeration_Literal_Specification_Access
(Self);
end To_Enumeration_Literal_Specification;
function To_Discriminant_Specification
(Self : access Element'Class)
return Program.Elements.Discriminant_Specifications
.Discriminant_Specification_Access is
begin
return Program.Elements.Discriminant_Specifications
.Discriminant_Specification_Access
(Self);
end To_Discriminant_Specification;
function To_Component_Declaration
(Self : access Element'Class)
return Program.Elements.Component_Declarations
.Component_Declaration_Access is
begin
return Program.Elements.Component_Declarations
.Component_Declaration_Access
(Self);
end To_Component_Declaration;
function To_Loop_Parameter_Specification
(Self : access Element'Class)
return Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access is
begin
return Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access
(Self);
end To_Loop_Parameter_Specification;
function To_Generalized_Iterator_Specification
(Self : access Element'Class)
return Program.Elements.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access is
begin
return Program.Elements.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access
(Self);
end To_Generalized_Iterator_Specification;
function To_Element_Iterator_Specification
(Self : access Element'Class)
return Program.Elements.Element_Iterator_Specifications
.Element_Iterator_Specification_Access is
begin
return Program.Elements.Element_Iterator_Specifications
.Element_Iterator_Specification_Access
(Self);
end To_Element_Iterator_Specification;
function To_Procedure_Declaration
(Self : access Element'Class)
return Program.Elements.Procedure_Declarations
.Procedure_Declaration_Access is
begin
return Program.Elements.Procedure_Declarations
.Procedure_Declaration_Access
(Self);
end To_Procedure_Declaration;
function To_Function_Declaration
(Self : access Element'Class)
return Program.Elements.Function_Declarations
.Function_Declaration_Access is
begin
return Program.Elements.Function_Declarations.Function_Declaration_Access
(Self);
end To_Function_Declaration;
function To_Parameter_Specification
(Self : access Element'Class)
return Program.Elements.Parameter_Specifications
.Parameter_Specification_Access is
begin
return Program.Elements.Parameter_Specifications
.Parameter_Specification_Access
(Self);
end To_Parameter_Specification;
function To_Procedure_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Procedure_Body_Declarations
.Procedure_Body_Declaration_Access is
begin
return Program.Elements.Procedure_Body_Declarations
.Procedure_Body_Declaration_Access
(Self);
end To_Procedure_Body_Declaration;
function To_Function_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Function_Body_Declarations
.Function_Body_Declaration_Access is
begin
return Program.Elements.Function_Body_Declarations
.Function_Body_Declaration_Access
(Self);
end To_Function_Body_Declaration;
function To_Return_Object_Specification
(Self : access Element'Class)
return Program.Elements.Return_Object_Specifications
.Return_Object_Specification_Access is
begin
return Program.Elements.Return_Object_Specifications
.Return_Object_Specification_Access
(Self);
end To_Return_Object_Specification;
function To_Package_Declaration
(Self : access Element'Class)
return Program.Elements.Package_Declarations
.Package_Declaration_Access is
begin
return Program.Elements.Package_Declarations.Package_Declaration_Access
(Self);
end To_Package_Declaration;
function To_Package_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Package_Body_Declarations
.Package_Body_Declaration_Access is
begin
return Program.Elements.Package_Body_Declarations
.Package_Body_Declaration_Access
(Self);
end To_Package_Body_Declaration;
function To_Object_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Object_Renaming_Declarations
.Object_Renaming_Declaration_Access is
begin
return Program.Elements.Object_Renaming_Declarations
.Object_Renaming_Declaration_Access
(Self);
end To_Object_Renaming_Declaration;
function To_Exception_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Access is
begin
return Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Access
(Self);
end To_Exception_Renaming_Declaration;
function To_Procedure_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Procedure_Renaming_Declarations
.Procedure_Renaming_Declaration_Access is
begin
return Program.Elements.Procedure_Renaming_Declarations
.Procedure_Renaming_Declaration_Access
(Self);
end To_Procedure_Renaming_Declaration;
function To_Function_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Function_Renaming_Declarations
.Function_Renaming_Declaration_Access is
begin
return Program.Elements.Function_Renaming_Declarations
.Function_Renaming_Declaration_Access
(Self);
end To_Function_Renaming_Declaration;
function To_Package_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Package_Renaming_Declarations
.Package_Renaming_Declaration_Access is
begin
return Program.Elements.Package_Renaming_Declarations
.Package_Renaming_Declaration_Access
(Self);
end To_Package_Renaming_Declaration;
function To_Generic_Package_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Package_Renaming_Declarations
.Generic_Package_Renaming_Declaration_Access is
begin
return Program.Elements.Generic_Package_Renaming_Declarations
.Generic_Package_Renaming_Declaration_Access
(Self);
end To_Generic_Package_Renaming_Declaration;
function To_Generic_Procedure_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Procedure_Renaming_Declarations
.Generic_Procedure_Renaming_Declaration_Access is
begin
return Program.Elements.Generic_Procedure_Renaming_Declarations
.Generic_Procedure_Renaming_Declaration_Access
(Self);
end To_Generic_Procedure_Renaming_Declaration;
function To_Generic_Function_Renaming_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Access is
begin
return Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Access
(Self);
end To_Generic_Function_Renaming_Declaration;
function To_Task_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Task_Body_Declarations
.Task_Body_Declaration_Access is
begin
return Program.Elements.Task_Body_Declarations
.Task_Body_Declaration_Access
(Self);
end To_Task_Body_Declaration;
function To_Protected_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Access is
begin
return Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Access
(Self);
end To_Protected_Body_Declaration;
function To_Entry_Declaration
(Self : access Element'Class)
return Program.Elements.Entry_Declarations.Entry_Declaration_Access is
begin
return Program.Elements.Entry_Declarations.Entry_Declaration_Access
(Self);
end To_Entry_Declaration;
function To_Entry_Body_Declaration
(Self : access Element'Class)
return Program.Elements.Entry_Body_Declarations
.Entry_Body_Declaration_Access is
begin
return Program.Elements.Entry_Body_Declarations
.Entry_Body_Declaration_Access
(Self);
end To_Entry_Body_Declaration;
function To_Entry_Index_Specification
(Self : access Element'Class)
return Program.Elements.Entry_Index_Specifications
.Entry_Index_Specification_Access is
begin
return Program.Elements.Entry_Index_Specifications
.Entry_Index_Specification_Access
(Self);
end To_Entry_Index_Specification;
function To_Procedure_Body_Stub
(Self : access Element'Class)
return Program.Elements.Procedure_Body_Stubs
.Procedure_Body_Stub_Access is
begin
return Program.Elements.Procedure_Body_Stubs.Procedure_Body_Stub_Access
(Self);
end To_Procedure_Body_Stub;
function To_Function_Body_Stub
(Self : access Element'Class)
return Program.Elements.Function_Body_Stubs.Function_Body_Stub_Access is
begin
return Program.Elements.Function_Body_Stubs.Function_Body_Stub_Access
(Self);
end To_Function_Body_Stub;
function To_Package_Body_Stub
(Self : access Element'Class)
return Program.Elements.Package_Body_Stubs.Package_Body_Stub_Access is
begin
return Program.Elements.Package_Body_Stubs.Package_Body_Stub_Access
(Self);
end To_Package_Body_Stub;
function To_Task_Body_Stub
(Self : access Element'Class)
return Program.Elements.Task_Body_Stubs.Task_Body_Stub_Access is
begin
return Program.Elements.Task_Body_Stubs.Task_Body_Stub_Access (Self);
end To_Task_Body_Stub;
function To_Protected_Body_Stub
(Self : access Element'Class)
return Program.Elements.Protected_Body_Stubs
.Protected_Body_Stub_Access is
begin
return Program.Elements.Protected_Body_Stubs.Protected_Body_Stub_Access
(Self);
end To_Protected_Body_Stub;
function To_Exception_Declaration
(Self : access Element'Class)
return Program.Elements.Exception_Declarations
.Exception_Declaration_Access is
begin
return Program.Elements.Exception_Declarations
.Exception_Declaration_Access
(Self);
end To_Exception_Declaration;
function To_Choice_Parameter_Specification
(Self : access Element'Class)
return Program.Elements.Choice_Parameter_Specifications
.Choice_Parameter_Specification_Access is
begin
return Program.Elements.Choice_Parameter_Specifications
.Choice_Parameter_Specification_Access
(Self);
end To_Choice_Parameter_Specification;
function To_Generic_Package_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Access is
begin
return Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Access
(Self);
end To_Generic_Package_Declaration;
function To_Generic_Procedure_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Procedure_Declarations
.Generic_Procedure_Declaration_Access is
begin
return Program.Elements.Generic_Procedure_Declarations
.Generic_Procedure_Declaration_Access
(Self);
end To_Generic_Procedure_Declaration;
function To_Generic_Function_Declaration
(Self : access Element'Class)
return Program.Elements.Generic_Function_Declarations
.Generic_Function_Declaration_Access is
begin
return Program.Elements.Generic_Function_Declarations
.Generic_Function_Declaration_Access
(Self);
end To_Generic_Function_Declaration;
function To_Package_Instantiation
(Self : access Element'Class)
return Program.Elements.Package_Instantiations
.Package_Instantiation_Access is
begin
return Program.Elements.Package_Instantiations
.Package_Instantiation_Access
(Self);
end To_Package_Instantiation;
function To_Procedure_Instantiation
(Self : access Element'Class)
return Program.Elements.Procedure_Instantiations
.Procedure_Instantiation_Access is
begin
return Program.Elements.Procedure_Instantiations
.Procedure_Instantiation_Access
(Self);
end To_Procedure_Instantiation;
function To_Function_Instantiation
(Self : access Element'Class)
return Program.Elements.Function_Instantiations
.Function_Instantiation_Access is
begin
return Program.Elements.Function_Instantiations
.Function_Instantiation_Access
(Self);
end To_Function_Instantiation;
function To_Formal_Object_Declaration
(Self : access Element'Class)
return Program.Elements.Formal_Object_Declarations
.Formal_Object_Declaration_Access is
begin
return Program.Elements.Formal_Object_Declarations
.Formal_Object_Declaration_Access
(Self);
end To_Formal_Object_Declaration;
function To_Formal_Type_Declaration
(Self : access Element'Class)
return Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Access is
begin
return Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Access
(Self);
end To_Formal_Type_Declaration;
function To_Formal_Procedure_Declaration
(Self : access Element'Class)
return Program.Elements.Formal_Procedure_Declarations
.Formal_Procedure_Declaration_Access is
begin
return Program.Elements.Formal_Procedure_Declarations
.Formal_Procedure_Declaration_Access
(Self);
end To_Formal_Procedure_Declaration;
function To_Formal_Function_Declaration
(Self : access Element'Class)
return Program.Elements.Formal_Function_Declarations
.Formal_Function_Declaration_Access is
begin
return Program.Elements.Formal_Function_Declarations
.Formal_Function_Declaration_Access
(Self);
end To_Formal_Function_Declaration;
function To_Formal_Package_Declaration
(Self : access Element'Class)
return Program.Elements.Formal_Package_Declarations
.Formal_Package_Declaration_Access is
begin
return Program.Elements.Formal_Package_Declarations
.Formal_Package_Declaration_Access
(Self);
end To_Formal_Package_Declaration;
function To_Definition
(Self : access Element'Class)
return Program.Elements.Definitions.Definition_Access is
begin
return Program.Elements.Definitions.Definition_Access (Self);
end To_Definition;
function To_Type_Definition
(Self : access Element'Class)
return Program.Elements.Type_Definitions.Type_Definition_Access is
begin
return Program.Elements.Type_Definitions.Type_Definition_Access (Self);
end To_Type_Definition;
function To_Subtype_Indication
(Self : access Element'Class)
return Program.Elements.Subtype_Indications.Subtype_Indication_Access is
begin
return Program.Elements.Subtype_Indications.Subtype_Indication_Access
(Self);
end To_Subtype_Indication;
function To_Constraint
(Self : access Element'Class)
return Program.Elements.Constraints.Constraint_Access is
begin
return Program.Elements.Constraints.Constraint_Access (Self);
end To_Constraint;
function To_Component_Definition
(Self : access Element'Class)
return Program.Elements.Component_Definitions
.Component_Definition_Access is
begin
return Program.Elements.Component_Definitions.Component_Definition_Access
(Self);
end To_Component_Definition;
function To_Discrete_Range
(Self : access Element'Class)
return Program.Elements.Discrete_Ranges.Discrete_Range_Access is
begin
return Program.Elements.Discrete_Ranges.Discrete_Range_Access (Self);
end To_Discrete_Range;
function To_Discrete_Subtype_Indication
(Self : access Element'Class)
return Program.Elements.Discrete_Subtype_Indications
.Discrete_Subtype_Indication_Access is
begin
return Program.Elements.Discrete_Subtype_Indications
.Discrete_Subtype_Indication_Access
(Self);
end To_Discrete_Subtype_Indication;
function To_Discrete_Range_Attribute_Reference
(Self : access Element'Class)
return Program.Elements.Discrete_Range_Attribute_References
.Discrete_Range_Attribute_Reference_Access is
begin
return Program.Elements.Discrete_Range_Attribute_References
.Discrete_Range_Attribute_Reference_Access
(Self);
end To_Discrete_Range_Attribute_Reference;
function To_Discrete_Simple_Expression_Range
(Self : access Element'Class)
return Program.Elements.Discrete_Simple_Expression_Ranges
.Discrete_Simple_Expression_Range_Access is
begin
return Program.Elements.Discrete_Simple_Expression_Ranges
.Discrete_Simple_Expression_Range_Access
(Self);
end To_Discrete_Simple_Expression_Range;
function To_Unknown_Discriminant_Part
(Self : access Element'Class)
return Program.Elements.Unknown_Discriminant_Parts
.Unknown_Discriminant_Part_Access is
begin
return Program.Elements.Unknown_Discriminant_Parts
.Unknown_Discriminant_Part_Access
(Self);
end To_Unknown_Discriminant_Part;
function To_Known_Discriminant_Part
(Self : access Element'Class)
return Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access is
begin
return Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access
(Self);
end To_Known_Discriminant_Part;
function To_Record_Definition
(Self : access Element'Class)
return Program.Elements.Record_Definitions.Record_Definition_Access is
begin
return Program.Elements.Record_Definitions.Record_Definition_Access
(Self);
end To_Record_Definition;
function To_Null_Component
(Self : access Element'Class)
return Program.Elements.Null_Components.Null_Component_Access is
begin
return Program.Elements.Null_Components.Null_Component_Access (Self);
end To_Null_Component;
function To_Variant_Part
(Self : access Element'Class)
return Program.Elements.Variant_Parts.Variant_Part_Access is
begin
return Program.Elements.Variant_Parts.Variant_Part_Access (Self);
end To_Variant_Part;
function To_Variant
(Self : access Element'Class)
return Program.Elements.Variants.Variant_Access is
begin
return Program.Elements.Variants.Variant_Access (Self);
end To_Variant;
function To_Others_Choice
(Self : access Element'Class)
return Program.Elements.Others_Choices.Others_Choice_Access is
begin
return Program.Elements.Others_Choices.Others_Choice_Access (Self);
end To_Others_Choice;
function To_Anonymous_Access_Definition
(Self : access Element'Class)
return Program.Elements.Anonymous_Access_Definitions
.Anonymous_Access_Definition_Access is
begin
return Program.Elements.Anonymous_Access_Definitions
.Anonymous_Access_Definition_Access
(Self);
end To_Anonymous_Access_Definition;
function To_Anonymous_Access_To_Object
(Self : access Element'Class)
return Program.Elements.Anonymous_Access_To_Objects
.Anonymous_Access_To_Object_Access is
begin
return Program.Elements.Anonymous_Access_To_Objects
.Anonymous_Access_To_Object_Access
(Self);
end To_Anonymous_Access_To_Object;
function To_Anonymous_Access_To_Procedure
(Self : access Element'Class)
return Program.Elements.Anonymous_Access_To_Procedures
.Anonymous_Access_To_Procedure_Access is
begin
return Program.Elements.Anonymous_Access_To_Procedures
.Anonymous_Access_To_Procedure_Access
(Self);
end To_Anonymous_Access_To_Procedure;
function To_Anonymous_Access_To_Function
(Self : access Element'Class)
return Program.Elements.Anonymous_Access_To_Functions
.Anonymous_Access_To_Function_Access is
begin
return Program.Elements.Anonymous_Access_To_Functions
.Anonymous_Access_To_Function_Access
(Self);
end To_Anonymous_Access_To_Function;
function To_Private_Type_Definition
(Self : access Element'Class)
return Program.Elements.Private_Type_Definitions
.Private_Type_Definition_Access is
begin
return Program.Elements.Private_Type_Definitions
.Private_Type_Definition_Access
(Self);
end To_Private_Type_Definition;
function To_Private_Extension_Definition
(Self : access Element'Class)
return Program.Elements.Private_Extension_Definitions
.Private_Extension_Definition_Access is
begin
return Program.Elements.Private_Extension_Definitions
.Private_Extension_Definition_Access
(Self);
end To_Private_Extension_Definition;
function To_Incomplete_Type_Definition
(Self : access Element'Class)
return Program.Elements.Incomplete_Type_Definitions
.Incomplete_Type_Definition_Access is
begin
return Program.Elements.Incomplete_Type_Definitions
.Incomplete_Type_Definition_Access
(Self);
end To_Incomplete_Type_Definition;
function To_Task_Definition
(Self : access Element'Class)
return Program.Elements.Task_Definitions.Task_Definition_Access is
begin
return Program.Elements.Task_Definitions.Task_Definition_Access (Self);
end To_Task_Definition;
function To_Protected_Definition
(Self : access Element'Class)
return Program.Elements.Protected_Definitions
.Protected_Definition_Access is
begin
return Program.Elements.Protected_Definitions.Protected_Definition_Access
(Self);
end To_Protected_Definition;
function To_Formal_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Type_Definitions
.Formal_Type_Definition_Access is
begin
return Program.Elements.Formal_Type_Definitions
.Formal_Type_Definition_Access
(Self);
end To_Formal_Type_Definition;
function To_Aspect_Specification
(Self : access Element'Class)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Access is
begin
return Program.Elements.Aspect_Specifications.Aspect_Specification_Access
(Self);
end To_Aspect_Specification;
function To_Real_Range_Specification
(Self : access Element'Class)
return Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access is
begin
return Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access
(Self);
end To_Real_Range_Specification;
function To_Expression
(Self : access Element'Class)
return Program.Elements.Expressions.Expression_Access is
begin
return Program.Elements.Expressions.Expression_Access (Self);
end To_Expression;
function To_Numeric_Literal
(Self : access Element'Class)
return Program.Elements.Numeric_Literals.Numeric_Literal_Access is
begin
return Program.Elements.Numeric_Literals.Numeric_Literal_Access (Self);
end To_Numeric_Literal;
function To_String_Literal
(Self : access Element'Class)
return Program.Elements.String_Literals.String_Literal_Access is
begin
return Program.Elements.String_Literals.String_Literal_Access (Self);
end To_String_Literal;
function To_Identifier
(Self : access Element'Class)
return Program.Elements.Identifiers.Identifier_Access is
begin
return Program.Elements.Identifiers.Identifier_Access (Self);
end To_Identifier;
function To_Operator_Symbol
(Self : access Element'Class)
return Program.Elements.Operator_Symbols.Operator_Symbol_Access is
begin
return Program.Elements.Operator_Symbols.Operator_Symbol_Access (Self);
end To_Operator_Symbol;
function To_Character_Literal
(Self : access Element'Class)
return Program.Elements.Character_Literals.Character_Literal_Access is
begin
return Program.Elements.Character_Literals.Character_Literal_Access
(Self);
end To_Character_Literal;
function To_Explicit_Dereference
(Self : access Element'Class)
return Program.Elements.Explicit_Dereferences
.Explicit_Dereference_Access is
begin
return Program.Elements.Explicit_Dereferences.Explicit_Dereference_Access
(Self);
end To_Explicit_Dereference;
function To_Infix_Operator
(Self : access Element'Class)
return Program.Elements.Infix_Operators.Infix_Operator_Access is
begin
return Program.Elements.Infix_Operators.Infix_Operator_Access (Self);
end To_Infix_Operator;
function To_Function_Call
(Self : access Element'Class)
return Program.Elements.Function_Calls.Function_Call_Access is
begin
return Program.Elements.Function_Calls.Function_Call_Access (Self);
end To_Function_Call;
function To_Indexed_Component
(Self : access Element'Class)
return Program.Elements.Indexed_Components.Indexed_Component_Access is
begin
return Program.Elements.Indexed_Components.Indexed_Component_Access
(Self);
end To_Indexed_Component;
function To_Slice
(Self : access Element'Class)
return Program.Elements.Slices.Slice_Access is
begin
return Program.Elements.Slices.Slice_Access (Self);
end To_Slice;
function To_Selected_Component
(Self : access Element'Class)
return Program.Elements.Selected_Components.Selected_Component_Access is
begin
return Program.Elements.Selected_Components.Selected_Component_Access
(Self);
end To_Selected_Component;
function To_Attribute_Reference
(Self : access Element'Class)
return Program.Elements.Attribute_References
.Attribute_Reference_Access is
begin
return Program.Elements.Attribute_References.Attribute_Reference_Access
(Self);
end To_Attribute_Reference;
function To_Record_Aggregate
(Self : access Element'Class)
return Program.Elements.Record_Aggregates.Record_Aggregate_Access is
begin
return Program.Elements.Record_Aggregates.Record_Aggregate_Access (Self);
end To_Record_Aggregate;
function To_Extension_Aggregate
(Self : access Element'Class)
return Program.Elements.Extension_Aggregates
.Extension_Aggregate_Access is
begin
return Program.Elements.Extension_Aggregates.Extension_Aggregate_Access
(Self);
end To_Extension_Aggregate;
function To_Array_Aggregate
(Self : access Element'Class)
return Program.Elements.Array_Aggregates.Array_Aggregate_Access is
begin
return Program.Elements.Array_Aggregates.Array_Aggregate_Access (Self);
end To_Array_Aggregate;
function To_Short_Circuit_Operation
(Self : access Element'Class)
return Program.Elements.Short_Circuit_Operations
.Short_Circuit_Operation_Access is
begin
return Program.Elements.Short_Circuit_Operations
.Short_Circuit_Operation_Access
(Self);
end To_Short_Circuit_Operation;
function To_Membership_Test
(Self : access Element'Class)
return Program.Elements.Membership_Tests.Membership_Test_Access is
begin
return Program.Elements.Membership_Tests.Membership_Test_Access (Self);
end To_Membership_Test;
function To_Null_Literal
(Self : access Element'Class)
return Program.Elements.Null_Literals.Null_Literal_Access is
begin
return Program.Elements.Null_Literals.Null_Literal_Access (Self);
end To_Null_Literal;
function To_Parenthesized_Expression
(Self : access Element'Class)
return Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access is
begin
return Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access
(Self);
end To_Parenthesized_Expression;
function To_Raise_Expression
(Self : access Element'Class)
return Program.Elements.Raise_Expressions.Raise_Expression_Access is
begin
return Program.Elements.Raise_Expressions.Raise_Expression_Access (Self);
end To_Raise_Expression;
function To_Type_Conversion
(Self : access Element'Class)
return Program.Elements.Type_Conversions.Type_Conversion_Access is
begin
return Program.Elements.Type_Conversions.Type_Conversion_Access (Self);
end To_Type_Conversion;
function To_Qualified_Expression
(Self : access Element'Class)
return Program.Elements.Qualified_Expressions
.Qualified_Expression_Access is
begin
return Program.Elements.Qualified_Expressions.Qualified_Expression_Access
(Self);
end To_Qualified_Expression;
function To_Allocator
(Self : access Element'Class)
return Program.Elements.Allocators.Allocator_Access is
begin
return Program.Elements.Allocators.Allocator_Access (Self);
end To_Allocator;
function To_Case_Expression
(Self : access Element'Class)
return Program.Elements.Case_Expressions.Case_Expression_Access is
begin
return Program.Elements.Case_Expressions.Case_Expression_Access (Self);
end To_Case_Expression;
function To_If_Expression
(Self : access Element'Class)
return Program.Elements.If_Expressions.If_Expression_Access is
begin
return Program.Elements.If_Expressions.If_Expression_Access (Self);
end To_If_Expression;
function To_Quantified_Expression
(Self : access Element'Class)
return Program.Elements.Quantified_Expressions
.Quantified_Expression_Access is
begin
return Program.Elements.Quantified_Expressions
.Quantified_Expression_Access
(Self);
end To_Quantified_Expression;
function To_Association
(Self : access Element'Class)
return Program.Elements.Associations.Association_Access is
begin
return Program.Elements.Associations.Association_Access (Self);
end To_Association;
function To_Discriminant_Association
(Self : access Element'Class)
return Program.Elements.Discriminant_Associations
.Discriminant_Association_Access is
begin
return Program.Elements.Discriminant_Associations
.Discriminant_Association_Access
(Self);
end To_Discriminant_Association;
function To_Record_Component_Association
(Self : access Element'Class)
return Program.Elements.Record_Component_Associations
.Record_Component_Association_Access is
begin
return Program.Elements.Record_Component_Associations
.Record_Component_Association_Access
(Self);
end To_Record_Component_Association;
function To_Array_Component_Association
(Self : access Element'Class)
return Program.Elements.Array_Component_Associations
.Array_Component_Association_Access is
begin
return Program.Elements.Array_Component_Associations
.Array_Component_Association_Access
(Self);
end To_Array_Component_Association;
function To_Parameter_Association
(Self : access Element'Class)
return Program.Elements.Parameter_Associations
.Parameter_Association_Access is
begin
return Program.Elements.Parameter_Associations
.Parameter_Association_Access
(Self);
end To_Parameter_Association;
function To_Formal_Package_Association
(Self : access Element'Class)
return Program.Elements.Formal_Package_Associations
.Formal_Package_Association_Access is
begin
return Program.Elements.Formal_Package_Associations
.Formal_Package_Association_Access
(Self);
end To_Formal_Package_Association;
function To_Statement
(Self : access Element'Class)
return Program.Elements.Statements.Statement_Access is
begin
return Program.Elements.Statements.Statement_Access (Self);
end To_Statement;
function To_Null_Statement
(Self : access Element'Class)
return Program.Elements.Null_Statements.Null_Statement_Access is
begin
return Program.Elements.Null_Statements.Null_Statement_Access (Self);
end To_Null_Statement;
function To_Assignment_Statement
(Self : access Element'Class)
return Program.Elements.Assignment_Statements
.Assignment_Statement_Access is
begin
return Program.Elements.Assignment_Statements.Assignment_Statement_Access
(Self);
end To_Assignment_Statement;
function To_If_Statement
(Self : access Element'Class)
return Program.Elements.If_Statements.If_Statement_Access is
begin
return Program.Elements.If_Statements.If_Statement_Access (Self);
end To_If_Statement;
function To_Case_Statement
(Self : access Element'Class)
return Program.Elements.Case_Statements.Case_Statement_Access is
begin
return Program.Elements.Case_Statements.Case_Statement_Access (Self);
end To_Case_Statement;
function To_Loop_Statement
(Self : access Element'Class)
return Program.Elements.Loop_Statements.Loop_Statement_Access is
begin
return Program.Elements.Loop_Statements.Loop_Statement_Access (Self);
end To_Loop_Statement;
function To_While_Loop_Statement
(Self : access Element'Class)
return Program.Elements.While_Loop_Statements
.While_Loop_Statement_Access is
begin
return Program.Elements.While_Loop_Statements.While_Loop_Statement_Access
(Self);
end To_While_Loop_Statement;
function To_For_Loop_Statement
(Self : access Element'Class)
return Program.Elements.For_Loop_Statements.For_Loop_Statement_Access is
begin
return Program.Elements.For_Loop_Statements.For_Loop_Statement_Access
(Self);
end To_For_Loop_Statement;
function To_Block_Statement
(Self : access Element'Class)
return Program.Elements.Block_Statements.Block_Statement_Access is
begin
return Program.Elements.Block_Statements.Block_Statement_Access (Self);
end To_Block_Statement;
function To_Exit_Statement
(Self : access Element'Class)
return Program.Elements.Exit_Statements.Exit_Statement_Access is
begin
return Program.Elements.Exit_Statements.Exit_Statement_Access (Self);
end To_Exit_Statement;
function To_Goto_Statement
(Self : access Element'Class)
return Program.Elements.Goto_Statements.Goto_Statement_Access is
begin
return Program.Elements.Goto_Statements.Goto_Statement_Access (Self);
end To_Goto_Statement;
function To_Call_Statement
(Self : access Element'Class)
return Program.Elements.Call_Statements.Call_Statement_Access is
begin
return Program.Elements.Call_Statements.Call_Statement_Access (Self);
end To_Call_Statement;
function To_Simple_Return_Statement
(Self : access Element'Class)
return Program.Elements.Simple_Return_Statements
.Simple_Return_Statement_Access is
begin
return Program.Elements.Simple_Return_Statements
.Simple_Return_Statement_Access
(Self);
end To_Simple_Return_Statement;
function To_Extended_Return_Statement
(Self : access Element'Class)
return Program.Elements.Extended_Return_Statements
.Extended_Return_Statement_Access is
begin
return Program.Elements.Extended_Return_Statements
.Extended_Return_Statement_Access
(Self);
end To_Extended_Return_Statement;
function To_Accept_Statement
(Self : access Element'Class)
return Program.Elements.Accept_Statements.Accept_Statement_Access is
begin
return Program.Elements.Accept_Statements.Accept_Statement_Access (Self);
end To_Accept_Statement;
function To_Requeue_Statement
(Self : access Element'Class)
return Program.Elements.Requeue_Statements.Requeue_Statement_Access is
begin
return Program.Elements.Requeue_Statements.Requeue_Statement_Access
(Self);
end To_Requeue_Statement;
function To_Delay_Statement
(Self : access Element'Class)
return Program.Elements.Delay_Statements.Delay_Statement_Access is
begin
return Program.Elements.Delay_Statements.Delay_Statement_Access (Self);
end To_Delay_Statement;
function To_Terminate_Alternative_Statement
(Self : access Element'Class)
return Program.Elements.Terminate_Alternative_Statements
.Terminate_Alternative_Statement_Access is
begin
return Program.Elements.Terminate_Alternative_Statements
.Terminate_Alternative_Statement_Access
(Self);
end To_Terminate_Alternative_Statement;
function To_Select_Statement
(Self : access Element'Class)
return Program.Elements.Select_Statements.Select_Statement_Access is
begin
return Program.Elements.Select_Statements.Select_Statement_Access (Self);
end To_Select_Statement;
function To_Abort_Statement
(Self : access Element'Class)
return Program.Elements.Abort_Statements.Abort_Statement_Access is
begin
return Program.Elements.Abort_Statements.Abort_Statement_Access (Self);
end To_Abort_Statement;
function To_Raise_Statement
(Self : access Element'Class)
return Program.Elements.Raise_Statements.Raise_Statement_Access is
begin
return Program.Elements.Raise_Statements.Raise_Statement_Access (Self);
end To_Raise_Statement;
function To_Code_Statement
(Self : access Element'Class)
return Program.Elements.Code_Statements.Code_Statement_Access is
begin
return Program.Elements.Code_Statements.Code_Statement_Access (Self);
end To_Code_Statement;
function To_Path
(Self : access Element'Class)
return Program.Elements.Paths.Path_Access is
begin
return Program.Elements.Paths.Path_Access (Self);
end To_Path;
function To_Elsif_Path
(Self : access Element'Class)
return Program.Elements.Elsif_Paths.Elsif_Path_Access is
begin
return Program.Elements.Elsif_Paths.Elsif_Path_Access (Self);
end To_Elsif_Path;
function To_Case_Path
(Self : access Element'Class)
return Program.Elements.Case_Paths.Case_Path_Access is
begin
return Program.Elements.Case_Paths.Case_Path_Access (Self);
end To_Case_Path;
function To_Select_Path
(Self : access Element'Class)
return Program.Elements.Select_Paths.Select_Path_Access is
begin
return Program.Elements.Select_Paths.Select_Path_Access (Self);
end To_Select_Path;
function To_Case_Expression_Path
(Self : access Element'Class)
return Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Access is
begin
return Program.Elements.Case_Expression_Paths.Case_Expression_Path_Access
(Self);
end To_Case_Expression_Path;
function To_Elsif_Expression_Path
(Self : access Element'Class)
return Program.Elements.Elsif_Expression_Paths
.Elsif_Expression_Path_Access is
begin
return Program.Elements.Elsif_Expression_Paths
.Elsif_Expression_Path_Access
(Self);
end To_Elsif_Expression_Path;
function To_Clause
(Self : access Element'Class)
return Program.Elements.Clauses.Clause_Access is
begin
return Program.Elements.Clauses.Clause_Access (Self);
end To_Clause;
function To_Use_Clause
(Self : access Element'Class)
return Program.Elements.Use_Clauses.Use_Clause_Access is
begin
return Program.Elements.Use_Clauses.Use_Clause_Access (Self);
end To_Use_Clause;
function To_With_Clause
(Self : access Element'Class)
return Program.Elements.With_Clauses.With_Clause_Access is
begin
return Program.Elements.With_Clauses.With_Clause_Access (Self);
end To_With_Clause;
function To_Representation_Clause
(Self : access Element'Class)
return Program.Elements.Representation_Clauses
.Representation_Clause_Access is
begin
return Program.Elements.Representation_Clauses
.Representation_Clause_Access
(Self);
end To_Representation_Clause;
function To_Component_Clause
(Self : access Element'Class)
return Program.Elements.Component_Clauses.Component_Clause_Access is
begin
return Program.Elements.Component_Clauses.Component_Clause_Access (Self);
end To_Component_Clause;
function To_Derived_Type
(Self : access Element'Class)
return Program.Elements.Derived_Types.Derived_Type_Access is
begin
return Program.Elements.Derived_Types.Derived_Type_Access (Self);
end To_Derived_Type;
function To_Derived_Record_Extension
(Self : access Element'Class)
return Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Access is
begin
return Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Access
(Self);
end To_Derived_Record_Extension;
function To_Enumeration_Type
(Self : access Element'Class)
return Program.Elements.Enumeration_Types.Enumeration_Type_Access is
begin
return Program.Elements.Enumeration_Types.Enumeration_Type_Access (Self);
end To_Enumeration_Type;
function To_Signed_Integer_Type
(Self : access Element'Class)
return Program.Elements.Signed_Integer_Types
.Signed_Integer_Type_Access is
begin
return Program.Elements.Signed_Integer_Types.Signed_Integer_Type_Access
(Self);
end To_Signed_Integer_Type;
function To_Modular_Type
(Self : access Element'Class)
return Program.Elements.Modular_Types.Modular_Type_Access is
begin
return Program.Elements.Modular_Types.Modular_Type_Access (Self);
end To_Modular_Type;
function To_Root_Type
(Self : access Element'Class)
return Program.Elements.Root_Types.Root_Type_Access is
begin
return Program.Elements.Root_Types.Root_Type_Access (Self);
end To_Root_Type;
function To_Floating_Point_Type
(Self : access Element'Class)
return Program.Elements.Floating_Point_Types
.Floating_Point_Type_Access is
begin
return Program.Elements.Floating_Point_Types.Floating_Point_Type_Access
(Self);
end To_Floating_Point_Type;
function To_Ordinary_Fixed_Point_Type
(Self : access Element'Class)
return Program.Elements.Ordinary_Fixed_Point_Types
.Ordinary_Fixed_Point_Type_Access is
begin
return Program.Elements.Ordinary_Fixed_Point_Types
.Ordinary_Fixed_Point_Type_Access
(Self);
end To_Ordinary_Fixed_Point_Type;
function To_Decimal_Fixed_Point_Type
(Self : access Element'Class)
return Program.Elements.Decimal_Fixed_Point_Types
.Decimal_Fixed_Point_Type_Access is
begin
return Program.Elements.Decimal_Fixed_Point_Types
.Decimal_Fixed_Point_Type_Access
(Self);
end To_Decimal_Fixed_Point_Type;
function To_Unconstrained_Array_Type
(Self : access Element'Class)
return Program.Elements.Unconstrained_Array_Types
.Unconstrained_Array_Type_Access is
begin
return Program.Elements.Unconstrained_Array_Types
.Unconstrained_Array_Type_Access
(Self);
end To_Unconstrained_Array_Type;
function To_Constrained_Array_Type
(Self : access Element'Class)
return Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Access is
begin
return Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Access
(Self);
end To_Constrained_Array_Type;
function To_Record_Type
(Self : access Element'Class)
return Program.Elements.Record_Types.Record_Type_Access is
begin
return Program.Elements.Record_Types.Record_Type_Access (Self);
end To_Record_Type;
function To_Interface_Type
(Self : access Element'Class)
return Program.Elements.Interface_Types.Interface_Type_Access is
begin
return Program.Elements.Interface_Types.Interface_Type_Access (Self);
end To_Interface_Type;
function To_Object_Access_Type
(Self : access Element'Class)
return Program.Elements.Object_Access_Types.Object_Access_Type_Access is
begin
return Program.Elements.Object_Access_Types.Object_Access_Type_Access
(Self);
end To_Object_Access_Type;
function To_Procedure_Access_Type
(Self : access Element'Class)
return Program.Elements.Procedure_Access_Types
.Procedure_Access_Type_Access is
begin
return Program.Elements.Procedure_Access_Types
.Procedure_Access_Type_Access
(Self);
end To_Procedure_Access_Type;
function To_Function_Access_Type
(Self : access Element'Class)
return Program.Elements.Function_Access_Types
.Function_Access_Type_Access is
begin
return Program.Elements.Function_Access_Types.Function_Access_Type_Access
(Self);
end To_Function_Access_Type;
function To_Formal_Private_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Private_Type_Definitions
.Formal_Private_Type_Definition_Access is
begin
return Program.Elements.Formal_Private_Type_Definitions
.Formal_Private_Type_Definition_Access
(Self);
end To_Formal_Private_Type_Definition;
function To_Formal_Derived_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Derived_Type_Definitions
.Formal_Derived_Type_Definition_Access is
begin
return Program.Elements.Formal_Derived_Type_Definitions
.Formal_Derived_Type_Definition_Access
(Self);
end To_Formal_Derived_Type_Definition;
function To_Formal_Discrete_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Discrete_Type_Definitions
.Formal_Discrete_Type_Definition_Access is
begin
return Program.Elements.Formal_Discrete_Type_Definitions
.Formal_Discrete_Type_Definition_Access
(Self);
end To_Formal_Discrete_Type_Definition;
function To_Formal_Signed_Integer_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Signed_Integer_Type_Definitions
.Formal_Signed_Integer_Type_Definition_Access is
begin
return Program.Elements.Formal_Signed_Integer_Type_Definitions
.Formal_Signed_Integer_Type_Definition_Access
(Self);
end To_Formal_Signed_Integer_Type_Definition;
function To_Formal_Modular_Type_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Modular_Type_Definitions
.Formal_Modular_Type_Definition_Access is
begin
return Program.Elements.Formal_Modular_Type_Definitions
.Formal_Modular_Type_Definition_Access
(Self);
end To_Formal_Modular_Type_Definition;
function To_Formal_Floating_Point_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Floating_Point_Definitions
.Formal_Floating_Point_Definition_Access is
begin
return Program.Elements.Formal_Floating_Point_Definitions
.Formal_Floating_Point_Definition_Access
(Self);
end To_Formal_Floating_Point_Definition;
function To_Formal_Ordinary_Fixed_Point_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Ordinary_Fixed_Point_Definitions
.Formal_Ordinary_Fixed_Point_Definition_Access is
begin
return Program.Elements.Formal_Ordinary_Fixed_Point_Definitions
.Formal_Ordinary_Fixed_Point_Definition_Access
(Self);
end To_Formal_Ordinary_Fixed_Point_Definition;
function To_Formal_Decimal_Fixed_Point_Definition
(Self : access Element'Class)
return Program.Elements.Formal_Decimal_Fixed_Point_Definitions
.Formal_Decimal_Fixed_Point_Definition_Access is
begin
return Program.Elements.Formal_Decimal_Fixed_Point_Definitions
.Formal_Decimal_Fixed_Point_Definition_Access
(Self);
end To_Formal_Decimal_Fixed_Point_Definition;
function To_Formal_Unconstrained_Array_Type
(Self : access Element'Class)
return Program.Elements.Formal_Unconstrained_Array_Types
.Formal_Unconstrained_Array_Type_Access is
begin
return Program.Elements.Formal_Unconstrained_Array_Types
.Formal_Unconstrained_Array_Type_Access
(Self);
end To_Formal_Unconstrained_Array_Type;
function To_Formal_Constrained_Array_Type
(Self : access Element'Class)
return Program.Elements.Formal_Constrained_Array_Types
.Formal_Constrained_Array_Type_Access is
begin
return Program.Elements.Formal_Constrained_Array_Types
.Formal_Constrained_Array_Type_Access
(Self);
end To_Formal_Constrained_Array_Type;
function To_Formal_Access_Type
(Self : access Element'Class)
return Program.Elements.Formal_Access_Types.Formal_Access_Type_Access is
begin
return Program.Elements.Formal_Access_Types.Formal_Access_Type_Access
(Self);
end To_Formal_Access_Type;
function To_Formal_Object_Access_Type
(Self : access Element'Class)
return Program.Elements.Formal_Object_Access_Types
.Formal_Object_Access_Type_Access is
begin
return Program.Elements.Formal_Object_Access_Types
.Formal_Object_Access_Type_Access
(Self);
end To_Formal_Object_Access_Type;
function To_Formal_Procedure_Access_Type
(Self : access Element'Class)
return Program.Elements.Formal_Procedure_Access_Types
.Formal_Procedure_Access_Type_Access is
begin
return Program.Elements.Formal_Procedure_Access_Types
.Formal_Procedure_Access_Type_Access
(Self);
end To_Formal_Procedure_Access_Type;
function To_Formal_Function_Access_Type
(Self : access Element'Class)
return Program.Elements.Formal_Function_Access_Types
.Formal_Function_Access_Type_Access is
begin
return Program.Elements.Formal_Function_Access_Types
.Formal_Function_Access_Type_Access
(Self);
end To_Formal_Function_Access_Type;
function To_Formal_Interface_Type
(Self : access Element'Class)
return Program.Elements.Formal_Interface_Types
.Formal_Interface_Type_Access is
begin
return Program.Elements.Formal_Interface_Types
.Formal_Interface_Type_Access
(Self);
end To_Formal_Interface_Type;
function To_Access_Type
(Self : access Element'Class)
return Program.Elements.Access_Types.Access_Type_Access is
begin
return Program.Elements.Access_Types.Access_Type_Access (Self);
end To_Access_Type;
function To_Range_Attribute_Reference
(Self : access Element'Class)
return Program.Elements.Range_Attribute_References
.Range_Attribute_Reference_Access is
begin
return Program.Elements.Range_Attribute_References
.Range_Attribute_Reference_Access
(Self);
end To_Range_Attribute_Reference;
function To_Simple_Expression_Range
(Self : access Element'Class)
return Program.Elements.Simple_Expression_Ranges
.Simple_Expression_Range_Access is
begin
return Program.Elements.Simple_Expression_Ranges
.Simple_Expression_Range_Access
(Self);
end To_Simple_Expression_Range;
function To_Digits_Constraint
(Self : access Element'Class)
return Program.Elements.Digits_Constraints.Digits_Constraint_Access is
begin
return Program.Elements.Digits_Constraints.Digits_Constraint_Access
(Self);
end To_Digits_Constraint;
function To_Delta_Constraint
(Self : access Element'Class)
return Program.Elements.Delta_Constraints.Delta_Constraint_Access is
begin
return Program.Elements.Delta_Constraints.Delta_Constraint_Access (Self);
end To_Delta_Constraint;
function To_Index_Constraint
(Self : access Element'Class)
return Program.Elements.Index_Constraints.Index_Constraint_Access is
begin
return Program.Elements.Index_Constraints.Index_Constraint_Access (Self);
end To_Index_Constraint;
function To_Discriminant_Constraint
(Self : access Element'Class)
return Program.Elements.Discriminant_Constraints
.Discriminant_Constraint_Access is
begin
return Program.Elements.Discriminant_Constraints
.Discriminant_Constraint_Access
(Self);
end To_Discriminant_Constraint;
function To_Attribute_Definition_Clause
(Self : access Element'Class)
return Program.Elements.Attribute_Definition_Clauses
.Attribute_Definition_Clause_Access is
begin
return Program.Elements.Attribute_Definition_Clauses
.Attribute_Definition_Clause_Access
(Self);
end To_Attribute_Definition_Clause;
function To_Enumeration_Representation_Clause
(Self : access Element'Class)
return Program.Elements.Enumeration_Representation_Clauses
.Enumeration_Representation_Clause_Access is
begin
return Program.Elements.Enumeration_Representation_Clauses
.Enumeration_Representation_Clause_Access
(Self);
end To_Enumeration_Representation_Clause;
function To_Record_Representation_Clause
(Self : access Element'Class)
return Program.Elements.Record_Representation_Clauses
.Record_Representation_Clause_Access is
begin
return Program.Elements.Record_Representation_Clauses
.Record_Representation_Clause_Access
(Self);
end To_Record_Representation_Clause;
function To_At_Clause
(Self : access Element'Class)
return Program.Elements.At_Clauses.At_Clause_Access is
begin
return Program.Elements.At_Clauses.At_Clause_Access (Self);
end To_At_Clause;
function To_Exception_Handler
(Self : access Element'Class)
return Program.Elements.Exception_Handlers.Exception_Handler_Access is
begin
return Program.Elements.Exception_Handlers.Exception_Handler_Access
(Self);
end To_Exception_Handler;
end Program.Elements;
| 35.644181 | 79 | 0.780197 |
5863b65178248c0ddc95712c1115acc0f25da423 | 6,446 | adb | Ada | source/compiler/compiler-context.adb | yannickmoy/protobuf | aebbc88cdcea147eb110b70e04eb6936e523ca95 | [
"MIT"
] | 12 | 2020-05-04T09:30:21.000Z | 2022-02-08T21:47:32.000Z | source/compiler/compiler-context.adb | yannickmoy/protobuf | aebbc88cdcea147eb110b70e04eb6936e523ca95 | [
"MIT"
] | 6 | 2021-03-16T15:17:33.000Z | 2022-03-31T21:32:47.000Z | source/compiler/compiler-context.adb | yannickmoy/protobuf | aebbc88cdcea147eb110b70e04eb6936e523ca95 | [
"MIT"
] | 1 | 2021-03-16T15:09:27.000Z | 2021-03-16T15:09:27.000Z | -- MIT License
--
-- Copyright (c) 2020 Max Reznik
--
-- 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.
with League.String_Vectors;
with Compiler.File_Descriptors;
package body Compiler.Context is
function "+" (Text : Wide_Wide_String)
return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
Reserved : String_Sets.Set;
---------
-- "+" --
---------
function "+"
(Self : Ada_Type_Name) return League.Strings.Universal_String
is
use type League.Strings.Universal_String;
begin
if Self.Package_Name.Is_Empty then
return Self.Type_Name;
else
return Self.Package_Name & "." & Self.Type_Name;
end if;
end "+";
--------------
-- Get_File --
--------------
function Get_File
(Request : Google.Protobuf.Compiler.Plugin.Code_Generator_Request;
Name : League.Strings.Universal_String)
return Google.Protobuf.Descriptor.File_Descriptor_Proto
is
use type League.Strings.Universal_String;
begin
for J in 1 .. Request.Proto_File.Length loop
declare
Result : constant Google.Protobuf.Descriptor.File_Descriptor_Proto
:= Request.Proto_File (J);
begin
if Result.Name.Is_Set and then Result.Name.Value = Name then
return Result;
end if;
end;
end loop;
raise Constraint_Error;
end Get_File;
--------------------------
-- Populate_Named_Types --
--------------------------
procedure Populate_Named_Types
(Request : Google.Protobuf.Compiler.Plugin.Code_Generator_Request;
Map : in out Compiler.Context.Named_Type_Maps.Map) is
begin
for J in 1 .. Request.Proto_File.Length loop
Compiler.File_Descriptors.Populate_Named_Types
(Request.Proto_File (J), Map);
end loop;
end Populate_Named_Types;
-------------------
-- Relative_Name --
-------------------
function Relative_Name
(Full_Name : League.Strings.Universal_String;
Current_Package : League.Strings.Universal_String)
return League.Strings.Universal_String
is
use type League.Strings.Universal_String;
FN : constant League.String_Vectors.Universal_String_Vector :=
Full_Name.Split ('.');
CP : constant League.String_Vectors.Universal_String_Vector :=
Current_Package.Split ('.');
begin
for J in 1 .. FN.Length - 1 loop
declare
Prefix : constant League.Strings.Universal_String :=
FN.Element (J);
Ok : Boolean := True;
begin
for K in J + 1 .. CP.Length loop
Ok := Prefix /= CP.Element (K);
exit when not Ok;
end loop;
if Ok then
declare
Result : League.String_Vectors.Universal_String_Vector;
begin
for K in J .. FN.Length loop
Result.Append (FN.Element (K));
end loop;
return Result.Join ('.');
end;
end if;
end;
end loop;
return FN.Element (FN.Length);
end Relative_Name;
-----------------
-- To_Ada_Name --
-----------------
function To_Ada_Name
(Text : League.Strings.Universal_String)
return League.Strings.Universal_String
is
use type League.Strings.Universal_String;
Allow_Underscore : Boolean := False;
Force_Upper : Boolean := True;
Last_Was_Upper : Boolean := True;
Result : League.Strings.Universal_String;
begin
if Reserved.Contains (Text.To_Lowercase) then
return To_Ada_Name ("PB_" & Text);
elsif Text.Ends_With ("_") then
return To_Ada_Name (Text.Head (Text.Length - 1));
end if;
for J in 1 .. Text.Length loop
if Text.Element (J).To_Wide_Wide_Character = '_' then
if Allow_Underscore then
Result.Append (Text.Element (J));
end if;
Force_Upper := True;
elsif Force_Upper then
Result.Append (Text.Slice (J, J).To_Uppercase);
Force_Upper := False;
Last_Was_Upper := True;
elsif Text.Slice (J, J).To_Uppercase /= Text.Slice (J, J) then
Last_Was_Upper := False;
Result.Append (Text.Element (J));
elsif not Last_Was_Upper then
Last_Was_Upper := True;
Result.Append ("_");
Result.Append (Text.Element (J));
else
Result.Append (Text.Element (J));
end if;
Allow_Underscore := Text.Element (J).To_Wide_Wide_Character /= '_';
end loop;
return Result;
end To_Ada_Name;
--------------------------
-- To_Selected_Ada_Name --
--------------------------
function To_Selected_Ada_Name
(Text : League.Strings.Universal_String)
return League.Strings.Universal_String
is
List : League.String_Vectors.Universal_String_Vector := Text.Split ('.');
begin
for J in 1 .. List.Length loop
List.Replace (J, To_Ada_Name (List (J)));
end loop;
return List.Join ('.');
end To_Selected_Ada_Name;
begin
Reserved.Insert (+"begin");
Reserved.Insert (+"end");
Reserved.Insert (+"package");
Reserved.Insert (+"type");
end Compiler.Context;
| 31.291262 | 79 | 0.606733 |
570c749a5dd406ac70ed00b2051d094c686dcbef | 5,970 | adb | Ada | tools-src/gnu/gcc/gcc/ada/g-hesora.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/g-hesora.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/g-hesora.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- G N A T . H E A P _ S O R T _ A --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1995-1999 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
package body GNAT.Heap_Sort_A is
----------
-- Sort --
----------
-- We are using the classical heapsort algorithm (i.e. Floyd's Treesort3)
-- as described by Knuth ("The Art of Programming", Volume III, first
-- edition, section 5.2.3, p. 145-147) with the modification that is
-- mentioned in exercise 18. For more details on this algorithm, see
-- Robert B. K. Dewar PhD thesis "The use of Computers in the X-ray
-- Phase Problem". University of Chicago, 1968, which was the first
-- publication of the modification, which reduces the number of compares
-- from 2NlogN to NlogN.
procedure Sort (N : Natural; Move : Move_Procedure; Lt : Lt_Function) is
Max : Natural := N;
-- Current Max index in tree being sifted
procedure Sift (S : Positive);
-- This procedure sifts up node S, i.e. converts the subtree rooted
-- at node S into a heap, given the precondition that any sons of
-- S are already heaps. On entry, the contents of node S is found
-- in the temporary (index 0), the actual contents of node S on
-- entry are irrelevant. This is just a minor optimization to avoid
-- what would otherwise be two junk moves in phase two of the sort.
procedure Sift (S : Positive) is
C : Positive := S;
Son : Positive;
Father : Positive;
begin
-- This is where the optimization is done, normally we would do a
-- comparison at each stage between the current node and the larger
-- of the two sons, and continue the sift only if the current node
-- was less than this maximum. In this modified optimized version,
-- we assume that the current node will be less than the larger
-- son, and unconditionally sift up. Then when we get to the bottom
-- of the tree, we check parents to make sure that we did not make
-- a mistake. This roughly cuts the number of comparisions in half,
-- since it is almost always the case that our assumption is correct.
-- Loop to pull up larger sons
loop
Son := 2 * C;
exit when Son > Max;
if Son < Max and then Lt (Son, Son + 1) then
Son := Son + 1;
end if;
Move (Son, C);
C := Son;
end loop;
-- Loop to check fathers
while C /= S loop
Father := C / 2;
if Lt (Father, 0) then
Move (Father, C);
C := Father;
else
exit;
end if;
end loop;
-- Last step is to pop the sifted node into place
Move (0, C);
end Sift;
-- Start of processing for Sort
begin
-- Phase one of heapsort is to build the heap. This is done by
-- sifting nodes N/2 .. 1 in sequence.
for J in reverse 1 .. N / 2 loop
Move (J, 0);
Sift (J);
end loop;
-- In phase 2, the largest node is moved to end, reducing the size
-- of the tree by one, and the displaced node is sifted down from
-- the top, so that the largest node is again at the top.
while Max > 1 loop
Move (Max, 0);
Move (1, Max);
Max := Max - 1;
Sift (1);
end loop;
end Sort;
end GNAT.Heap_Sort_A;
| 43.897059 | 79 | 0.489615 |
589232d02400b4a2d082fce57c68693025319dec | 1,211 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-llftio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-llftio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-llftio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . L O N G _ L O N G _ F L O A T _ T E X T _ I O --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO;
package Ada.Long_Long_Float_Text_IO is
new Ada.Text_IO.Float_IO (Long_Long_Float);
| 60.55 | 78 | 0.308836 |
415193c1d249e41d4c9ddd21fdab5515f00cdb03 | 284 | adb | Ada | Practica 03/P03_Crea_Tarea_De_Tipo/src/crea_tarea_de_tipo.adb | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | null | null | null | Practica 03/P03_Crea_Tarea_De_Tipo/src/crea_tarea_de_tipo.adb | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | null | null | null | Practica 03/P03_Crea_Tarea_De_Tipo/src/crea_tarea_de_tipo.adb | dpr1005/Tiempo-Real-Ejercicios | 244911e9e9a2d8667649eb9f3d7417c39b340161 | [
"BSD-3-Clause"
] | 1 | 2022-03-06T17:37:39.000Z | 2022-03-06T17:37:39.000Z | with Tipos_Tarea; use Tipos_Tarea;
procedure Crea_Tarea_De_Tipo is
T1 : Tarea_Repetitiva(1);
T2 : Tarea_Repetitiva(2);
T3 : Tarea_Repetitiva(3);
type Tarea_Ptr is access Tarea_Repetitiva;
T : Tarea_Ptr;
begin
T := new Tarea_Repetitiva(4);
end Crea_Tarea_De_Tipo;
| 20.285714 | 45 | 0.735915 |
417297bffa95ee9edde91977ed94c63d51eec29e | 1,551 | ada | Ada | Task/Huffman-coding/Ada/huffman-coding-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Huffman-coding/Ada/huffman-coding-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Huffman-coding/Ada/huffman-coding-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO;
with Huffman;
procedure Main is
package Char_Natural_Huffman_Tree is new Huffman
(Symbol_Type => Character,
Put => Ada.Text_IO.Put,
Symbol_Sequence => String,
Frequency_Type => Natural);
Tree : Char_Natural_Huffman_Tree.Huffman_Tree;
Frequencies : Char_Natural_Huffman_Tree.Frequency_Maps.Map;
Input_String : constant String :=
"this is an example for huffman encoding";
begin
-- build frequency map
for I in Input_String'Range loop
declare
use Char_Natural_Huffman_Tree.Frequency_Maps;
Position : constant Cursor := Frequencies.Find (Input_String (I));
begin
if Position = No_Element then
Frequencies.Insert (Key => Input_String (I), New_Item => 1);
else
Frequencies.Replace_Element
(Position => Position,
New_Item => Element (Position) + 1);
end if;
end;
end loop;
-- create huffman tree
Char_Natural_Huffman_Tree.Create_Tree
(Tree => Tree,
Frequencies => Frequencies);
-- dump encodings
Char_Natural_Huffman_Tree.Dump_Encoding (Tree => Tree);
-- encode example string
declare
Code : constant Char_Natural_Huffman_Tree.Bit_Sequence :=
Char_Natural_Huffman_Tree.Encode
(Tree => Tree,
Symbols => Input_String);
begin
Char_Natural_Huffman_Tree.Put (Code);
Ada.Text_IO.Put_Line
(Char_Natural_Huffman_Tree.Decode (Tree => Tree, Code => Code));
end;
end Main;
| 31.02 | 75 | 0.648614 |
2984b273a23bae7876e333aca72565e2d3ae4db4 | 5,572 | adb | Ada | source/nodes/program-nodes-exception_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-exception_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-exception_declarations.adb | 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 body Program.Nodes.Exception_Declarations is
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Exception_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Exception_Declaration is
begin
return Result : Exception_Declaration :=
(Names => Names, Colon_Token => Colon_Token,
Exception_Token => Exception_Token, With_Token => With_Token,
Aspects => Aspects, Semicolon_Token => Semicolon_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Exception_Declaration is
begin
return Result : Implicit_Exception_Declaration :=
(Names => Names, Aspects => Aspects,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Names
(Self : Base_Exception_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access is
begin
return Self.Names;
end Names;
overriding function Aspects
(Self : Base_Exception_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is
begin
return Self.Aspects;
end Aspects;
overriding function Colon_Token
(Self : Exception_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Colon_Token;
end Colon_Token;
overriding function Exception_Token
(Self : Exception_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Exception_Token;
end Exception_Token;
overriding function With_Token
(Self : Exception_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Semicolon_Token
(Self : Exception_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Exception_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Exception_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Exception_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_Exception_Declaration'Class) is
begin
for Item in Self.Names.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
for Item in Self.Aspects.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Exception_Declaration_Element
(Self : Base_Exception_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Exception_Declaration_Element;
overriding function Is_Declaration_Element
(Self : Base_Exception_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Declaration_Element;
overriding procedure Visit
(Self : not null access Base_Exception_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Exception_Declaration (Self);
end Visit;
overriding function To_Exception_Declaration_Text
(Self : aliased in out Exception_Declaration)
return Program.Elements.Exception_Declarations
.Exception_Declaration_Text_Access is
begin
return Self'Unchecked_Access;
end To_Exception_Declaration_Text;
overriding function To_Exception_Declaration_Text
(Self : aliased in out Implicit_Exception_Declaration)
return Program.Elements.Exception_Declarations
.Exception_Declaration_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Exception_Declaration_Text;
end Program.Nodes.Exception_Declarations;
| 32.584795 | 79 | 0.718772 |
41c89c2ebf3c1ae9a5c6524c1a8b516e347cb828 | 5,691 | ads | Ada | src/ada/src/common/uxas-common-sentinel_serial_buffers.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 88 | 2017-08-24T07:02:01.000Z | 2022-03-18T04:34:17.000Z | src/ada/src/common/uxas-common-sentinel_serial_buffers.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 46 | 2017-06-08T18:18:08.000Z | 2022-03-15T18:24:43.000Z | src/ada/src/common/uxas-common-sentinel_serial_buffers.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 53 | 2017-06-22T14:48:05.000Z | 2022-02-15T16:59:38.000Z | with AVTAS.LMCP.Types; use AVTAS.LMCP.Types;
with Dynamic_Strings; use Dynamic_Strings;
package UxAS.Common.Sentinel_Serial_Buffers is
Type_Name : constant String := "SerialStringSentinel";
Sentinal_Buffer_Max_Capacity : constant := 2 * 1024; -- arbitrary TODO: see how big it really needs to be
subtype Buffer_Capacity is Integer range 1 .. Sentinal_Buffer_Max_Capacity;
type Sentinel_Serial_Buffer (Capacity : Buffer_Capacity) is tagged limited record
-- These are all public in the C++ version...
Data : Dynamic_String (Capacity);
Valid_Deserialize_Count : UInt32 := 0;
Invalid_Deserialize_Count : UInt32 := 0;
Disregarded_Data_Count : UInt32 := 0;
end record;
-- std::string
-- getNextPayloadString(const std::string& newDataChunk);
procedure Get_Next_Payload_String
(This : in out Sentinel_Serial_Buffer;
New_Data_Chunk : String;
Result : out String);
-- static std::string
-- createSentinelizedString(const std::string& data);
function Create_Sentinelized_String (Data : String) return String;
-- Supports strings containing only ascii characters
-- static uint32_t
-- calculateChecksum(const std::string& str);
function Calculated_Checksum (Str : String) return UInt32;
-- static std::unique_ptr<std::string>
-- getDetectSentinelBaseStringsMessage(const std::string& data);
function Get_Detect_Sentinel_Base_Strings_Message (Data : String) return String;
-- static const std::string&
-- getSerialSentinelBeforePayloadSize() { static std::string s_string("+=+=+=+="); return(s_string); };
Serial_Sentinel_Before_Payload_Size : constant String (1 .. 8) := "+=+=+=+=";
-- static const uint32_t
-- getSerialSentinelBeforePayloadSizeSize() { static const uint32_t s_sz = getSerialSentinelBeforePayloadSize().size(); return(s_sz); };
Serial_Sentinel_Before_Payload_Size_Size : constant := Serial_Sentinel_Before_Payload_Size'Length;
-- static const std::string&
-- getSerialSentinelBeforePayloadSizeBase() { static std::string s_string("+="); return(s_string); };
Serial_Sentinel_Before_Payload_Size_Base : constant String (1 .. 2) := "+=";
-- static const uint32_t
-- getSerialSentinelBeforePayloadSizeBaseSize() { static const uint32_t s_sz = getSerialSentinelBeforePayloadSizeBase().size(); return(s_sz); };
Serial_Sentinel_Before_Payload_Size_Base_Size : constant := Serial_Sentinel_Before_Payload_Size_Base'Length;
-- static const std::string&
-- getSerialSentinelAfterPayloadSize() { static std::string s_string("#@#@#@#@"); return(s_string); };
Serial_Sentinel_After_Payload_Size : constant String (1 .. 8) := "#@#@#@#@";
-- static const uint32_t
-- getSerialSentinelAfterPayloadSizeSize() { static const uint32_t s_sz = getSerialSentinelAfterPayloadSize().size(); return(s_sz); };
Serial_Sentinel_After_Payload_Size_Size : constant := Serial_Sentinel_After_Payload_Size'Length;
-- static const std::string&
-- getSerialSentinelAfterPayloadSizeBase() { static std::string s_string("#@"); return(s_string); };
Serial_Sentinel_After_Payload_Size_Base : constant String (1 .. 2) := "#@";
-- static const uint32_t
-- getSerialSentinelAfterPayloadSizeBaseSize() { static const uint32_t s_sz = getSerialSentinelAfterPayloadSizeBase().size(); return(s_sz); };
Serial_Sentinel_After_Payload_Size_Base_Size : constant := Serial_Sentinel_After_Payload_Size_Base'Length;
-- static const std::string&
-- getSerialSentinelBeforeChecksum() { static std::string s_string("!%!%!%!%"); return(s_string); };
Serial_Sentinel_Before_Checksum : constant String (1 .. 8) := "!%!%!%!%";
-- static const uint32_t
-- getSerialSentinelBeforeChecksumSize() { static const uint32_t s_sz = getSerialSentinelBeforeChecksum().size(); return(s_sz); };
Serial_Sentinel_Before_Checksum_Size : constant := Serial_Sentinel_Before_Checksum'Length;
-- static const std::string&
-- getSerialSentinelBeforeChecksumBase() { static std::string s_string("!%"); return(s_string); };
Serial_Sentinel_Before_Checksum_Base : constant String (1 .. 2) := "!%";
-- static const uint32_t
-- getSerialSentinelBeforeChecksumBaseSize() { static const uint32_t s_sz = getSerialSentinelBeforeChecksumBase().size(); return(s_sz); };
Serial_Sentinel_Before_Checksum_Base_Size : constant := Serial_Sentinel_Before_Checksum_Base'Length;
-- static const std::string&
-- getSerialSentinelAfterChecksum() { static std::string s_string("?^?^?^?^"); return(s_string); };
Serial_Sentinel_After_Checksum : constant String (1 .. 8) := "?^?^?^?^";
-- static const uint32_t
-- getSerialSentinelAfterChecksumSize() { static const uint32_t s_sz = getSerialSentinelAfterChecksum().size(); return(s_sz); };
Serial_Sentinel_After_Checksum_Size : constant := Serial_Sentinel_After_Checksum'Length;
-- static const std::string&
-- getSerialSentinelAfterChecksumBase() { static std::string s_string("?^"); return(s_string); };
Serial_Sentinel_After_Checksum_Base : constant String (1 .. 2) := "?^";
-- static const uint32_t
-- getSerialSentinelAfterChecksumBaseSize() { static const uint32_t s_sz = getSerialSentinelAfterChecksumBase().size(); return(s_sz); };
Serial_Sentinel_After_Checksum_Base_Size : constant := Serial_Sentinel_After_Checksum_Base'Length;
-- static const std::string&
-- getValidIntegerDigits() { static std::string s_string("1234567890"); return(s_string); };
Valid_Integer_Digits : constant String (1 .. 10) := "1234567890";
end UxAS.Common.Sentinel_Serial_Buffers;
| 51.736364 | 148 | 0.725356 |
3de275cac57c73349fd5a23a11bff0dac0dea0cb | 34,473 | ads | Ada | stm32f0/stm32f051x/svd/stm32_svd-rcc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f0/stm32f051x/svd/stm32_svd-rcc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f0/stm32f051x/svd/stm32_svd-rcc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | -- This spec has been automatically generated from STM32F0xx.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.RCC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_HSION_Field is STM32_SVD.Bit;
subtype CR_HSIRDY_Field is STM32_SVD.Bit;
subtype CR_HSITRIM_Field is STM32_SVD.UInt5;
subtype CR_HSICAL_Field is STM32_SVD.Byte;
subtype CR_HSEON_Field is STM32_SVD.Bit;
subtype CR_HSERDY_Field is STM32_SVD.Bit;
subtype CR_HSEBYP_Field is STM32_SVD.Bit;
subtype CR_CSSON_Field is STM32_SVD.Bit;
subtype CR_PLLON_Field is STM32_SVD.Bit;
subtype CR_PLLRDY_Field is STM32_SVD.Bit;
-- Clock control register
type CR_Register is record
-- Internal High Speed clock enable
HSION : CR_HSION_Field := 16#1#;
-- Read-only. Internal High Speed clock ready flag
HSIRDY : CR_HSIRDY_Field := 16#1#;
-- unspecified
Reserved_2_2 : STM32_SVD.Bit := 16#0#;
-- Internal High Speed clock trimming
HSITRIM : CR_HSITRIM_Field := 16#10#;
-- Read-only. Internal High Speed clock Calibration
HSICAL : CR_HSICAL_Field := 16#0#;
-- External High Speed clock enable
HSEON : CR_HSEON_Field := 16#0#;
-- Read-only. External High Speed clock ready flag
HSERDY : CR_HSERDY_Field := 16#0#;
-- External High Speed clock Bypass
HSEBYP : CR_HSEBYP_Field := 16#0#;
-- Clock Security System enable
CSSON : CR_CSSON_Field := 16#0#;
-- unspecified
Reserved_20_23 : STM32_SVD.UInt4 := 16#0#;
-- PLL enable
PLLON : CR_PLLON_Field := 16#0#;
-- Read-only. PLL clock ready flag
PLLRDY : CR_PLLRDY_Field := 16#0#;
-- unspecified
Reserved_26_31 : STM32_SVD.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
HSION at 0 range 0 .. 0;
HSIRDY at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
HSITRIM at 0 range 3 .. 7;
HSICAL at 0 range 8 .. 15;
HSEON at 0 range 16 .. 16;
HSERDY at 0 range 17 .. 17;
HSEBYP at 0 range 18 .. 18;
CSSON at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
PLLON at 0 range 24 .. 24;
PLLRDY at 0 range 25 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype CFGR_SW_Field is STM32_SVD.UInt2;
subtype CFGR_SWS_Field is STM32_SVD.UInt2;
subtype CFGR_HPRE_Field is STM32_SVD.UInt4;
subtype CFGR_PPRE_Field is STM32_SVD.UInt3;
subtype CFGR_ADCPRE_Field is STM32_SVD.UInt2;
subtype CFGR_PLLSRC_Field is STM32_SVD.Bit;
subtype CFGR_PLLXTPRE_Field is STM32_SVD.Bit;
subtype CFGR_PLLMUL_Field is STM32_SVD.UInt4;
subtype CFGR_MCO_Field is STM32_SVD.UInt3;
-- Clock configuration register (RCC_CFGR)
type CFGR_Register is record
-- System clock Switch
SW : CFGR_SW_Field := 16#0#;
-- Read-only. System Clock Switch Status
SWS : CFGR_SWS_Field := 16#0#;
-- AHB prescaler
HPRE : CFGR_HPRE_Field := 16#0#;
-- APB Low speed prescaler (APB1)
PPRE : CFGR_PPRE_Field := 16#0#;
-- unspecified
Reserved_11_13 : STM32_SVD.UInt3 := 16#0#;
-- ADC prescaler
ADCPRE : CFGR_ADCPRE_Field := 16#0#;
-- PLL entry clock source
PLLSRC : CFGR_PLLSRC_Field := 16#0#;
-- HSE divider for PLL entry
PLLXTPRE : CFGR_PLLXTPRE_Field := 16#0#;
-- PLL Multiplication Factor
PLLMUL : CFGR_PLLMUL_Field := 16#0#;
-- unspecified
Reserved_22_23 : STM32_SVD.UInt2 := 16#0#;
-- Microcontroller clock output
MCO : CFGR_MCO_Field := 16#0#;
-- unspecified
Reserved_27_31 : STM32_SVD.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR_Register use record
SW at 0 range 0 .. 1;
SWS at 0 range 2 .. 3;
HPRE at 0 range 4 .. 7;
PPRE at 0 range 8 .. 10;
Reserved_11_13 at 0 range 11 .. 13;
ADCPRE at 0 range 14 .. 15;
PLLSRC at 0 range 16 .. 16;
PLLXTPRE at 0 range 17 .. 17;
PLLMUL at 0 range 18 .. 21;
Reserved_22_23 at 0 range 22 .. 23;
MCO at 0 range 24 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype CIR_LSIRDYF_Field is STM32_SVD.Bit;
subtype CIR_LSERDYF_Field is STM32_SVD.Bit;
subtype CIR_HSIRDYF_Field is STM32_SVD.Bit;
subtype CIR_HSERDYF_Field is STM32_SVD.Bit;
subtype CIR_PLLRDYF_Field is STM32_SVD.Bit;
subtype CIR_HSI14RDYF_Field is STM32_SVD.Bit;
subtype CIR_CSSF_Field is STM32_SVD.Bit;
subtype CIR_LSIRDYIE_Field is STM32_SVD.Bit;
subtype CIR_LSERDYIE_Field is STM32_SVD.Bit;
subtype CIR_HSIRDYIE_Field is STM32_SVD.Bit;
subtype CIR_HSERDYIE_Field is STM32_SVD.Bit;
subtype CIR_PLLRDYIE_Field is STM32_SVD.Bit;
subtype CIR_HSI14RDYE_Field is STM32_SVD.Bit;
subtype CIR_LSIRDYC_Field is STM32_SVD.Bit;
subtype CIR_LSERDYC_Field is STM32_SVD.Bit;
subtype CIR_HSIRDYC_Field is STM32_SVD.Bit;
subtype CIR_HSERDYC_Field is STM32_SVD.Bit;
subtype CIR_PLLRDYC_Field is STM32_SVD.Bit;
subtype CIR_HSI14RDYC_Field is STM32_SVD.Bit;
subtype CIR_CSSC_Field is STM32_SVD.Bit;
-- Clock interrupt register (RCC_CIR)
type CIR_Register is record
-- Read-only. LSI Ready Interrupt flag
LSIRDYF : CIR_LSIRDYF_Field := 16#0#;
-- Read-only. LSE Ready Interrupt flag
LSERDYF : CIR_LSERDYF_Field := 16#0#;
-- Read-only. HSI Ready Interrupt flag
HSIRDYF : CIR_HSIRDYF_Field := 16#0#;
-- Read-only. HSE Ready Interrupt flag
HSERDYF : CIR_HSERDYF_Field := 16#0#;
-- Read-only. PLL Ready Interrupt flag
PLLRDYF : CIR_PLLRDYF_Field := 16#0#;
-- Read-only. HSI14 ready interrupt flag
HSI14RDYF : CIR_HSI14RDYF_Field := 16#0#;
-- unspecified
Reserved_6_6 : STM32_SVD.Bit := 16#0#;
-- Read-only. Clock Security System Interrupt flag
CSSF : CIR_CSSF_Field := 16#0#;
-- LSI Ready Interrupt Enable
LSIRDYIE : CIR_LSIRDYIE_Field := 16#0#;
-- LSE Ready Interrupt Enable
LSERDYIE : CIR_LSERDYIE_Field := 16#0#;
-- HSI Ready Interrupt Enable
HSIRDYIE : CIR_HSIRDYIE_Field := 16#0#;
-- HSE Ready Interrupt Enable
HSERDYIE : CIR_HSERDYIE_Field := 16#0#;
-- PLL Ready Interrupt Enable
PLLRDYIE : CIR_PLLRDYIE_Field := 16#0#;
-- HSI14 ready interrupt enable
HSI14RDYE : CIR_HSI14RDYE_Field := 16#0#;
-- unspecified
Reserved_14_15 : STM32_SVD.UInt2 := 16#0#;
-- Write-only. LSI Ready Interrupt Clear
LSIRDYC : CIR_LSIRDYC_Field := 16#0#;
-- Write-only. LSE Ready Interrupt Clear
LSERDYC : CIR_LSERDYC_Field := 16#0#;
-- Write-only. HSI Ready Interrupt Clear
HSIRDYC : CIR_HSIRDYC_Field := 16#0#;
-- Write-only. HSE Ready Interrupt Clear
HSERDYC : CIR_HSERDYC_Field := 16#0#;
-- Write-only. PLL Ready Interrupt Clear
PLLRDYC : CIR_PLLRDYC_Field := 16#0#;
-- Write-only. HSI 14 MHz Ready Interrupt Clear
HSI14RDYC : CIR_HSI14RDYC_Field := 16#0#;
-- unspecified
Reserved_22_22 : STM32_SVD.Bit := 16#0#;
-- Write-only. Clock security system interrupt clear
CSSC : CIR_CSSC_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CIR_Register use record
LSIRDYF at 0 range 0 .. 0;
LSERDYF at 0 range 1 .. 1;
HSIRDYF at 0 range 2 .. 2;
HSERDYF at 0 range 3 .. 3;
PLLRDYF at 0 range 4 .. 4;
HSI14RDYF at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CSSF at 0 range 7 .. 7;
LSIRDYIE at 0 range 8 .. 8;
LSERDYIE at 0 range 9 .. 9;
HSIRDYIE at 0 range 10 .. 10;
HSERDYIE at 0 range 11 .. 11;
PLLRDYIE at 0 range 12 .. 12;
HSI14RDYE at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
LSIRDYC at 0 range 16 .. 16;
LSERDYC at 0 range 17 .. 17;
HSIRDYC at 0 range 18 .. 18;
HSERDYC at 0 range 19 .. 19;
PLLRDYC at 0 range 20 .. 20;
HSI14RDYC at 0 range 21 .. 21;
Reserved_22_22 at 0 range 22 .. 22;
CSSC at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype APB2RSTR_SYSCFGRST_Field is STM32_SVD.Bit;
subtype APB2RSTR_ADCRST_Field is STM32_SVD.Bit;
subtype APB2RSTR_TIM1RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_SPI1RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_USART1RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_TIM15RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_TIM16RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_TIM17RST_Field is STM32_SVD.Bit;
subtype APB2RSTR_DBGMCURST_Field is STM32_SVD.Bit;
-- APB2 peripheral reset register (RCC_APB2RSTR)
type APB2RSTR_Register is record
-- SYSCFG and COMP reset
SYSCFGRST : APB2RSTR_SYSCFGRST_Field := 16#0#;
-- unspecified
Reserved_1_8 : STM32_SVD.Byte := 16#0#;
-- ADC interface reset
ADCRST : APB2RSTR_ADCRST_Field := 16#0#;
-- unspecified
Reserved_10_10 : STM32_SVD.Bit := 16#0#;
-- TIM1 timer reset
TIM1RST : APB2RSTR_TIM1RST_Field := 16#0#;
-- SPI 1 reset
SPI1RST : APB2RSTR_SPI1RST_Field := 16#0#;
-- unspecified
Reserved_13_13 : STM32_SVD.Bit := 16#0#;
-- USART1 reset
USART1RST : APB2RSTR_USART1RST_Field := 16#0#;
-- unspecified
Reserved_15_15 : STM32_SVD.Bit := 16#0#;
-- TIM15 timer reset
TIM15RST : APB2RSTR_TIM15RST_Field := 16#0#;
-- TIM16 timer reset
TIM16RST : APB2RSTR_TIM16RST_Field := 16#0#;
-- TIM17 timer reset
TIM17RST : APB2RSTR_TIM17RST_Field := 16#0#;
-- unspecified
Reserved_19_21 : STM32_SVD.UInt3 := 16#0#;
-- Debug MCU reset
DBGMCURST : APB2RSTR_DBGMCURST_Field := 16#0#;
-- unspecified
Reserved_23_31 : STM32_SVD.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2RSTR_Register use record
SYSCFGRST at 0 range 0 .. 0;
Reserved_1_8 at 0 range 1 .. 8;
ADCRST at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
TIM1RST at 0 range 11 .. 11;
SPI1RST at 0 range 12 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
USART1RST at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
TIM15RST at 0 range 16 .. 16;
TIM16RST at 0 range 17 .. 17;
TIM17RST at 0 range 18 .. 18;
Reserved_19_21 at 0 range 19 .. 21;
DBGMCURST at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype APB1RSTR_TIM2RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_TIM3RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_TIM6RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_TIM14RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_WWDGRST_Field is STM32_SVD.Bit;
subtype APB1RSTR_SPI2RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_USART2RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_I2C1RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_I2C2RST_Field is STM32_SVD.Bit;
subtype APB1RSTR_PWRRST_Field is STM32_SVD.Bit;
subtype APB1RSTR_DACRST_Field is STM32_SVD.Bit;
subtype APB1RSTR_CECRST_Field is STM32_SVD.Bit;
-- APB1 peripheral reset register (RCC_APB1RSTR)
type APB1RSTR_Register is record
-- Timer 2 reset
TIM2RST : APB1RSTR_TIM2RST_Field := 16#0#;
-- Timer 3 reset
TIM3RST : APB1RSTR_TIM3RST_Field := 16#0#;
-- unspecified
Reserved_2_3 : STM32_SVD.UInt2 := 16#0#;
-- Timer 6 reset
TIM6RST : APB1RSTR_TIM6RST_Field := 16#0#;
-- unspecified
Reserved_5_7 : STM32_SVD.UInt3 := 16#0#;
-- Timer 14 reset
TIM14RST : APB1RSTR_TIM14RST_Field := 16#0#;
-- unspecified
Reserved_9_10 : STM32_SVD.UInt2 := 16#0#;
-- Window watchdog reset
WWDGRST : APB1RSTR_WWDGRST_Field := 16#0#;
-- unspecified
Reserved_12_13 : STM32_SVD.UInt2 := 16#0#;
-- SPI2 reset
SPI2RST : APB1RSTR_SPI2RST_Field := 16#0#;
-- unspecified
Reserved_15_16 : STM32_SVD.UInt2 := 16#0#;
-- USART 2 reset
USART2RST : APB1RSTR_USART2RST_Field := 16#0#;
-- unspecified
Reserved_18_20 : STM32_SVD.UInt3 := 16#0#;
-- I2C1 reset
I2C1RST : APB1RSTR_I2C1RST_Field := 16#0#;
-- I2C2 reset
I2C2RST : APB1RSTR_I2C2RST_Field := 16#0#;
-- unspecified
Reserved_23_27 : STM32_SVD.UInt5 := 16#0#;
-- Power interface reset
PWRRST : APB1RSTR_PWRRST_Field := 16#0#;
-- DAC interface reset
DACRST : APB1RSTR_DACRST_Field := 16#0#;
-- HDMI CEC reset
CECRST : APB1RSTR_CECRST_Field := 16#0#;
-- unspecified
Reserved_31_31 : STM32_SVD.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1RSTR_Register use record
TIM2RST at 0 range 0 .. 0;
TIM3RST at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
TIM6RST at 0 range 4 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TIM14RST at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGRST at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2RST at 0 range 14 .. 14;
Reserved_15_16 at 0 range 15 .. 16;
USART2RST at 0 range 17 .. 17;
Reserved_18_20 at 0 range 18 .. 20;
I2C1RST at 0 range 21 .. 21;
I2C2RST at 0 range 22 .. 22;
Reserved_23_27 at 0 range 23 .. 27;
PWRRST at 0 range 28 .. 28;
DACRST at 0 range 29 .. 29;
CECRST at 0 range 30 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
subtype AHBENR_DMAEN_Field is STM32_SVD.Bit;
subtype AHBENR_SRAMEN_Field is STM32_SVD.Bit;
subtype AHBENR_FLITFEN_Field is STM32_SVD.Bit;
subtype AHBENR_CRCEN_Field is STM32_SVD.Bit;
subtype AHBENR_IOPAEN_Field is STM32_SVD.Bit;
subtype AHBENR_IOPBEN_Field is STM32_SVD.Bit;
subtype AHBENR_IOPCEN_Field is STM32_SVD.Bit;
subtype AHBENR_IOPDEN_Field is STM32_SVD.Bit;
subtype AHBENR_IOPFEN_Field is STM32_SVD.Bit;
subtype AHBENR_TSCEN_Field is STM32_SVD.Bit;
-- AHB Peripheral Clock enable register (RCC_AHBENR)
type AHBENR_Register is record
-- DMA1 clock enable
DMAEN : AHBENR_DMAEN_Field := 16#0#;
-- unspecified
Reserved_1_1 : STM32_SVD.Bit := 16#0#;
-- SRAM interface clock enable
SRAMEN : AHBENR_SRAMEN_Field := 16#1#;
-- unspecified
Reserved_3_3 : STM32_SVD.Bit := 16#0#;
-- FLITF clock enable
FLITFEN : AHBENR_FLITFEN_Field := 16#1#;
-- unspecified
Reserved_5_5 : STM32_SVD.Bit := 16#0#;
-- CRC clock enable
CRCEN : AHBENR_CRCEN_Field := 16#0#;
-- unspecified
Reserved_7_16 : STM32_SVD.UInt10 := 16#0#;
-- I/O port A clock enable
IOPAEN : AHBENR_IOPAEN_Field := 16#0#;
-- I/O port B clock enable
IOPBEN : AHBENR_IOPBEN_Field := 16#0#;
-- I/O port C clock enable
IOPCEN : AHBENR_IOPCEN_Field := 16#0#;
-- I/O port D clock enable
IOPDEN : AHBENR_IOPDEN_Field := 16#0#;
-- unspecified
Reserved_21_21 : STM32_SVD.Bit := 16#0#;
-- I/O port F clock enable
IOPFEN : AHBENR_IOPFEN_Field := 16#0#;
-- unspecified
Reserved_23_23 : STM32_SVD.Bit := 16#0#;
-- Touch sensing controller clock enable
TSCEN : AHBENR_TSCEN_Field := 16#0#;
-- unspecified
Reserved_25_31 : STM32_SVD.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHBENR_Register use record
DMAEN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
SRAMEN at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
FLITFEN at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
CRCEN at 0 range 6 .. 6;
Reserved_7_16 at 0 range 7 .. 16;
IOPAEN at 0 range 17 .. 17;
IOPBEN at 0 range 18 .. 18;
IOPCEN at 0 range 19 .. 19;
IOPDEN at 0 range 20 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
IOPFEN at 0 range 22 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
TSCEN at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype APB2ENR_SYSCFGEN_Field is STM32_SVD.Bit;
subtype APB2ENR_ADCEN_Field is STM32_SVD.Bit;
subtype APB2ENR_TIM1EN_Field is STM32_SVD.Bit;
subtype APB2ENR_SPI1EN_Field is STM32_SVD.Bit;
subtype APB2ENR_USART1EN_Field is STM32_SVD.Bit;
subtype APB2ENR_TIM15EN_Field is STM32_SVD.Bit;
subtype APB2ENR_TIM16EN_Field is STM32_SVD.Bit;
subtype APB2ENR_TIM17EN_Field is STM32_SVD.Bit;
subtype APB2ENR_DBGMCUEN_Field is STM32_SVD.Bit;
-- APB2 peripheral clock enable register (RCC_APB2ENR)
type APB2ENR_Register is record
-- SYSCFG clock enable
SYSCFGEN : APB2ENR_SYSCFGEN_Field := 16#0#;
-- unspecified
Reserved_1_8 : STM32_SVD.Byte := 16#0#;
-- ADC 1 interface clock enable
ADCEN : APB2ENR_ADCEN_Field := 16#0#;
-- unspecified
Reserved_10_10 : STM32_SVD.Bit := 16#0#;
-- TIM1 Timer clock enable
TIM1EN : APB2ENR_TIM1EN_Field := 16#0#;
-- SPI 1 clock enable
SPI1EN : APB2ENR_SPI1EN_Field := 16#0#;
-- unspecified
Reserved_13_13 : STM32_SVD.Bit := 16#0#;
-- USART1 clock enable
USART1EN : APB2ENR_USART1EN_Field := 16#0#;
-- unspecified
Reserved_15_15 : STM32_SVD.Bit := 16#0#;
-- TIM15 timer clock enable
TIM15EN : APB2ENR_TIM15EN_Field := 16#0#;
-- TIM16 timer clock enable
TIM16EN : APB2ENR_TIM16EN_Field := 16#0#;
-- TIM17 timer clock enable
TIM17EN : APB2ENR_TIM17EN_Field := 16#0#;
-- unspecified
Reserved_19_21 : STM32_SVD.UInt3 := 16#0#;
-- MCU debug module clock enable
DBGMCUEN : APB2ENR_DBGMCUEN_Field := 16#0#;
-- unspecified
Reserved_23_31 : STM32_SVD.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2ENR_Register use record
SYSCFGEN at 0 range 0 .. 0;
Reserved_1_8 at 0 range 1 .. 8;
ADCEN at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
TIM1EN at 0 range 11 .. 11;
SPI1EN at 0 range 12 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
USART1EN at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
TIM15EN at 0 range 16 .. 16;
TIM16EN at 0 range 17 .. 17;
TIM17EN at 0 range 18 .. 18;
Reserved_19_21 at 0 range 19 .. 21;
DBGMCUEN at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype APB1ENR_TIM2EN_Field is STM32_SVD.Bit;
subtype APB1ENR_TIM3EN_Field is STM32_SVD.Bit;
subtype APB1ENR_TIM6EN_Field is STM32_SVD.Bit;
subtype APB1ENR_TIM14EN_Field is STM32_SVD.Bit;
subtype APB1ENR_WWDGEN_Field is STM32_SVD.Bit;
subtype APB1ENR_SPI2EN_Field is STM32_SVD.Bit;
subtype APB1ENR_USART2EN_Field is STM32_SVD.Bit;
subtype APB1ENR_I2C1EN_Field is STM32_SVD.Bit;
subtype APB1ENR_I2C2EN_Field is STM32_SVD.Bit;
subtype APB1ENR_PWREN_Field is STM32_SVD.Bit;
subtype APB1ENR_DACEN_Field is STM32_SVD.Bit;
subtype APB1ENR_CECEN_Field is STM32_SVD.Bit;
-- APB1 peripheral clock enable register (RCC_APB1ENR)
type APB1ENR_Register is record
-- Timer 2 clock enable
TIM2EN : APB1ENR_TIM2EN_Field := 16#0#;
-- Timer 3 clock enable
TIM3EN : APB1ENR_TIM3EN_Field := 16#0#;
-- unspecified
Reserved_2_3 : STM32_SVD.UInt2 := 16#0#;
-- Timer 6 clock enable
TIM6EN : APB1ENR_TIM6EN_Field := 16#0#;
-- unspecified
Reserved_5_7 : STM32_SVD.UInt3 := 16#0#;
-- Timer 14 clock enable
TIM14EN : APB1ENR_TIM14EN_Field := 16#0#;
-- unspecified
Reserved_9_10 : STM32_SVD.UInt2 := 16#0#;
-- Window watchdog clock enable
WWDGEN : APB1ENR_WWDGEN_Field := 16#0#;
-- unspecified
Reserved_12_13 : STM32_SVD.UInt2 := 16#0#;
-- SPI 2 clock enable
SPI2EN : APB1ENR_SPI2EN_Field := 16#0#;
-- unspecified
Reserved_15_16 : STM32_SVD.UInt2 := 16#0#;
-- USART 2 clock enable
USART2EN : APB1ENR_USART2EN_Field := 16#0#;
-- unspecified
Reserved_18_20 : STM32_SVD.UInt3 := 16#0#;
-- I2C 1 clock enable
I2C1EN : APB1ENR_I2C1EN_Field := 16#0#;
-- I2C 2 clock enable
I2C2EN : APB1ENR_I2C2EN_Field := 16#0#;
-- unspecified
Reserved_23_27 : STM32_SVD.UInt5 := 16#0#;
-- Power interface clock enable
PWREN : APB1ENR_PWREN_Field := 16#0#;
-- DAC interface clock enable
DACEN : APB1ENR_DACEN_Field := 16#0#;
-- HDMI CEC interface clock enable
CECEN : APB1ENR_CECEN_Field := 16#0#;
-- unspecified
Reserved_31_31 : STM32_SVD.Bit := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1ENR_Register use record
TIM2EN at 0 range 0 .. 0;
TIM3EN at 0 range 1 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
TIM6EN at 0 range 4 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TIM14EN at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGEN at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2EN at 0 range 14 .. 14;
Reserved_15_16 at 0 range 15 .. 16;
USART2EN at 0 range 17 .. 17;
Reserved_18_20 at 0 range 18 .. 20;
I2C1EN at 0 range 21 .. 21;
I2C2EN at 0 range 22 .. 22;
Reserved_23_27 at 0 range 23 .. 27;
PWREN at 0 range 28 .. 28;
DACEN at 0 range 29 .. 29;
CECEN at 0 range 30 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
subtype BDCR_LSEON_Field is STM32_SVD.Bit;
subtype BDCR_LSERDY_Field is STM32_SVD.Bit;
subtype BDCR_LSEBYP_Field is STM32_SVD.Bit;
subtype BDCR_LSEDRV_Field is STM32_SVD.UInt2;
subtype BDCR_RTCSEL_Field is STM32_SVD.UInt2;
subtype BDCR_RTCEN_Field is STM32_SVD.Bit;
subtype BDCR_BDRST_Field is STM32_SVD.Bit;
-- Backup domain control register (RCC_BDCR)
type BDCR_Register is record
-- External Low Speed oscillator enable
LSEON : BDCR_LSEON_Field := 16#0#;
-- Read-only. External Low Speed oscillator ready
LSERDY : BDCR_LSERDY_Field := 16#0#;
-- External Low Speed oscillator bypass
LSEBYP : BDCR_LSEBYP_Field := 16#0#;
-- LSE oscillator drive capability
LSEDRV : BDCR_LSEDRV_Field := 16#0#;
-- unspecified
Reserved_5_7 : STM32_SVD.UInt3 := 16#0#;
-- RTC clock source selection
RTCSEL : BDCR_RTCSEL_Field := 16#0#;
-- unspecified
Reserved_10_14 : STM32_SVD.UInt5 := 16#0#;
-- RTC clock enable
RTCEN : BDCR_RTCEN_Field := 16#0#;
-- Backup domain software reset
BDRST : BDCR_BDRST_Field := 16#0#;
-- unspecified
Reserved_17_31 : STM32_SVD.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BDCR_Register use record
LSEON at 0 range 0 .. 0;
LSERDY at 0 range 1 .. 1;
LSEBYP at 0 range 2 .. 2;
LSEDRV at 0 range 3 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
RTCSEL at 0 range 8 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
RTCEN at 0 range 15 .. 15;
BDRST at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
subtype CSR_LSION_Field is STM32_SVD.Bit;
subtype CSR_LSIRDY_Field is STM32_SVD.Bit;
subtype CSR_RMVF_Field is STM32_SVD.Bit;
subtype CSR_OBLRSTF_Field is STM32_SVD.Bit;
subtype CSR_PINRSTF_Field is STM32_SVD.Bit;
subtype CSR_PORRSTF_Field is STM32_SVD.Bit;
subtype CSR_SFTRSTF_Field is STM32_SVD.Bit;
subtype CSR_IWDGRSTF_Field is STM32_SVD.Bit;
subtype CSR_WWDGRSTF_Field is STM32_SVD.Bit;
subtype CSR_LPWRRSTF_Field is STM32_SVD.Bit;
-- Control/status register (RCC_CSR)
type CSR_Register is record
-- Internal low speed oscillator enable
LSION : CSR_LSION_Field := 16#0#;
-- Read-only. Internal low speed oscillator ready
LSIRDY : CSR_LSIRDY_Field := 16#0#;
-- unspecified
Reserved_2_23 : STM32_SVD.UInt22 := 16#0#;
-- Remove reset flag
RMVF : CSR_RMVF_Field := 16#0#;
-- Option byte loader reset flag
OBLRSTF : CSR_OBLRSTF_Field := 16#0#;
-- PIN reset flag
PINRSTF : CSR_PINRSTF_Field := 16#1#;
-- POR/PDR reset flag
PORRSTF : CSR_PORRSTF_Field := 16#1#;
-- Software reset flag
SFTRSTF : CSR_SFTRSTF_Field := 16#0#;
-- Independent watchdog reset flag
IWDGRSTF : CSR_IWDGRSTF_Field := 16#0#;
-- Window watchdog reset flag
WWDGRSTF : CSR_WWDGRSTF_Field := 16#0#;
-- Low-power reset flag
LPWRRSTF : CSR_LPWRRSTF_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
LSION at 0 range 0 .. 0;
LSIRDY at 0 range 1 .. 1;
Reserved_2_23 at 0 range 2 .. 23;
RMVF at 0 range 24 .. 24;
OBLRSTF at 0 range 25 .. 25;
PINRSTF at 0 range 26 .. 26;
PORRSTF at 0 range 27 .. 27;
SFTRSTF at 0 range 28 .. 28;
IWDGRSTF at 0 range 29 .. 29;
WWDGRSTF at 0 range 30 .. 30;
LPWRRSTF at 0 range 31 .. 31;
end record;
subtype AHBRSTR_IOPARST_Field is STM32_SVD.Bit;
subtype AHBRSTR_IOPBRST_Field is STM32_SVD.Bit;
subtype AHBRSTR_IOPCRST_Field is STM32_SVD.Bit;
subtype AHBRSTR_IOPDRST_Field is STM32_SVD.Bit;
subtype AHBRSTR_IOPFRST_Field is STM32_SVD.Bit;
subtype AHBRSTR_TSCRST_Field is STM32_SVD.Bit;
-- AHB peripheral reset register
type AHBRSTR_Register is record
-- unspecified
Reserved_0_16 : STM32_SVD.UInt17 := 16#0#;
-- I/O port A reset
IOPARST : AHBRSTR_IOPARST_Field := 16#0#;
-- I/O port B reset
IOPBRST : AHBRSTR_IOPBRST_Field := 16#0#;
-- I/O port C reset
IOPCRST : AHBRSTR_IOPCRST_Field := 16#0#;
-- I/O port D reset
IOPDRST : AHBRSTR_IOPDRST_Field := 16#0#;
-- unspecified
Reserved_21_21 : STM32_SVD.Bit := 16#0#;
-- I/O port F reset
IOPFRST : AHBRSTR_IOPFRST_Field := 16#0#;
-- unspecified
Reserved_23_23 : STM32_SVD.Bit := 16#0#;
-- Touch sensing controller reset
TSCRST : AHBRSTR_TSCRST_Field := 16#0#;
-- unspecified
Reserved_25_31 : STM32_SVD.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHBRSTR_Register use record
Reserved_0_16 at 0 range 0 .. 16;
IOPARST at 0 range 17 .. 17;
IOPBRST at 0 range 18 .. 18;
IOPCRST at 0 range 19 .. 19;
IOPDRST at 0 range 20 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
IOPFRST at 0 range 22 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
TSCRST at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CFGR2_PREDIV_Field is STM32_SVD.UInt4;
-- Clock configuration register 2
type CFGR2_Register is record
-- PREDIV division factor
PREDIV : CFGR2_PREDIV_Field := 16#0#;
-- unspecified
Reserved_4_31 : STM32_SVD.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR2_Register use record
PREDIV at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype CFGR3_USART1SW_Field is STM32_SVD.UInt2;
subtype CFGR3_I2C1SW_Field is STM32_SVD.Bit;
subtype CFGR3_CECSW_Field is STM32_SVD.Bit;
subtype CFGR3_ADCSW_Field is STM32_SVD.Bit;
-- Clock configuration register 3
type CFGR3_Register is record
-- USART1 clock source selection
USART1SW : CFGR3_USART1SW_Field := 16#0#;
-- unspecified
Reserved_2_3 : STM32_SVD.UInt2 := 16#0#;
-- I2C1 clock source selection
I2C1SW : CFGR3_I2C1SW_Field := 16#0#;
-- unspecified
Reserved_5_5 : STM32_SVD.Bit := 16#0#;
-- HDMI CEC clock source selection
CECSW : CFGR3_CECSW_Field := 16#0#;
-- unspecified
Reserved_7_7 : STM32_SVD.Bit := 16#0#;
-- ADC clock source selection
ADCSW : CFGR3_ADCSW_Field := 16#0#;
-- unspecified
Reserved_9_31 : STM32_SVD.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR3_Register use record
USART1SW at 0 range 0 .. 1;
Reserved_2_3 at 0 range 2 .. 3;
I2C1SW at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
CECSW at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
ADCSW at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype CR2_HSI14ON_Field is STM32_SVD.Bit;
subtype CR2_HSI14RDY_Field is STM32_SVD.Bit;
subtype CR2_HSI14DIS_Field is STM32_SVD.Bit;
subtype CR2_HSI14TRIM_Field is STM32_SVD.UInt5;
subtype CR2_HSI14CAL_Field is STM32_SVD.Byte;
-- Clock control register 2
type CR2_Register is record
-- HSI14 clock enable
HSI14ON : CR2_HSI14ON_Field := 16#0#;
-- Read-only. HR14 clock ready flag
HSI14RDY : CR2_HSI14RDY_Field := 16#0#;
-- HSI14 clock request from ADC disable
HSI14DIS : CR2_HSI14DIS_Field := 16#0#;
-- HSI14 clock trimming
HSI14TRIM : CR2_HSI14TRIM_Field := 16#10#;
-- Read-only. HSI14 clock calibration
HSI14CAL : CR2_HSI14CAL_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
HSI14ON at 0 range 0 .. 0;
HSI14RDY at 0 range 1 .. 1;
HSI14DIS at 0 range 2 .. 2;
HSI14TRIM at 0 range 3 .. 7;
HSI14CAL at 0 range 8 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Reset and clock control
type RCC_Peripheral is record
-- Clock control register
CR : aliased CR_Register;
-- Clock configuration register (RCC_CFGR)
CFGR : aliased CFGR_Register;
-- Clock interrupt register (RCC_CIR)
CIR : aliased CIR_Register;
-- APB2 peripheral reset register (RCC_APB2RSTR)
APB2RSTR : aliased APB2RSTR_Register;
-- APB1 peripheral reset register (RCC_APB1RSTR)
APB1RSTR : aliased APB1RSTR_Register;
-- AHB Peripheral Clock enable register (RCC_AHBENR)
AHBENR : aliased AHBENR_Register;
-- APB2 peripheral clock enable register (RCC_APB2ENR)
APB2ENR : aliased APB2ENR_Register;
-- APB1 peripheral clock enable register (RCC_APB1ENR)
APB1ENR : aliased APB1ENR_Register;
-- Backup domain control register (RCC_BDCR)
BDCR : aliased BDCR_Register;
-- Control/status register (RCC_CSR)
CSR : aliased CSR_Register;
-- AHB peripheral reset register
AHBRSTR : aliased AHBRSTR_Register;
-- Clock configuration register 2
CFGR2 : aliased CFGR2_Register;
-- Clock configuration register 3
CFGR3 : aliased CFGR3_Register;
-- Clock control register 2
CR2 : aliased CR2_Register;
end record
with Volatile;
for RCC_Peripheral use record
CR at 16#0# range 0 .. 31;
CFGR at 16#4# range 0 .. 31;
CIR at 16#8# range 0 .. 31;
APB2RSTR at 16#C# range 0 .. 31;
APB1RSTR at 16#10# range 0 .. 31;
AHBENR at 16#14# range 0 .. 31;
APB2ENR at 16#18# range 0 .. 31;
APB1ENR at 16#1C# range 0 .. 31;
BDCR at 16#20# range 0 .. 31;
CSR at 16#24# range 0 .. 31;
AHBRSTR at 16#28# range 0 .. 31;
CFGR2 at 16#2C# range 0 .. 31;
CFGR3 at 16#30# range 0 .. 31;
CR2 at 16#34# range 0 .. 31;
end record;
-- Reset and clock control
RCC_Periph : aliased RCC_Peripheral
with Import, Address => System'To_Address (16#40021000#);
end STM32_SVD.RCC;
| 38.820946 | 65 | 0.607809 |
583520f02854bb0ca87ab221743ecc9b46ba0d4a | 5,294 | ads | Ada | source/amf/uml/amf-standard_profile_l2-sends-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-standard_profile_l2-sends-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-standard_profile_l2-sends-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Standard_Profile_L2.Sends.Collections is
pragma Preelaborate;
package Standard_Profile_L2_Send_Collections is
new AMF.Generic_Collections
(Standard_Profile_L2_Send,
Standard_Profile_L2_Send_Access);
type Set_Of_Standard_Profile_L2_Send is
new Standard_Profile_L2_Send_Collections.Set with null record;
Empty_Set_Of_Standard_Profile_L2_Send : constant Set_Of_Standard_Profile_L2_Send;
type Ordered_Set_Of_Standard_Profile_L2_Send is
new Standard_Profile_L2_Send_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Standard_Profile_L2_Send : constant Ordered_Set_Of_Standard_Profile_L2_Send;
type Bag_Of_Standard_Profile_L2_Send is
new Standard_Profile_L2_Send_Collections.Bag with null record;
Empty_Bag_Of_Standard_Profile_L2_Send : constant Bag_Of_Standard_Profile_L2_Send;
type Sequence_Of_Standard_Profile_L2_Send is
new Standard_Profile_L2_Send_Collections.Sequence with null record;
Empty_Sequence_Of_Standard_Profile_L2_Send : constant Sequence_Of_Standard_Profile_L2_Send;
private
Empty_Set_Of_Standard_Profile_L2_Send : constant Set_Of_Standard_Profile_L2_Send
:= (Standard_Profile_L2_Send_Collections.Set with null record);
Empty_Ordered_Set_Of_Standard_Profile_L2_Send : constant Ordered_Set_Of_Standard_Profile_L2_Send
:= (Standard_Profile_L2_Send_Collections.Ordered_Set with null record);
Empty_Bag_Of_Standard_Profile_L2_Send : constant Bag_Of_Standard_Profile_L2_Send
:= (Standard_Profile_L2_Send_Collections.Bag with null record);
Empty_Sequence_Of_Standard_Profile_L2_Send : constant Sequence_Of_Standard_Profile_L2_Send
:= (Standard_Profile_L2_Send_Collections.Sequence with null record);
end AMF.Standard_Profile_L2.Sends.Collections;
| 57.543478 | 100 | 0.543068 |
4191fd3c96ce770e542bf5a684205e2d31294007 | 7,221 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-comlin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-comlin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-comlin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C O M M A N D _ L I N E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, 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. --
-- --
------------------------------------------------------------------------------
package Ada.Command_Line is
pragma Preelaborate;
function Argument_Count return Natural;
-- If the external execution environment supports passing arguments to a
-- program, then Argument_Count returns the number of arguments passed to
-- the program invoking the function. Otherwise it return 0.
--
-- In GNAT: Corresponds to (argc - 1) in C.
pragma Assertion_Policy (Pre => Ignore);
-- We need to ignore the precondition of Argument, below, so that we don't
-- raise Assertion_Error. The body raises Constraint_Error. It would be
-- cleaner to add "or else raise Constraint_Error" to the precondition, but
-- SPARK does not yet support raise expressions.
function Argument (Number : Positive) return String with
Pre => Number <= Argument_Count;
-- If the external execution environment supports passing arguments to
-- a program, then Argument returns an implementation-defined value
-- corresponding to the argument at relative position Number. If Number
-- is outside the range 1 .. Argument_Count, then Constraint_Error is
-- propagated.
--
-- in GNAT: Corresponds to argv [n] (for n > 0) in C.
function Command_Name return String;
-- If the external execution environment supports passing arguments to
-- a program, then Command_Name returns an implementation-defined value
-- corresponding to the name of the command invoking the program.
-- Otherwise Command_Name returns the null string.
--
-- in GNAT: Corresponds to argv [0] in C.
type Exit_Status is new Integer;
Success : constant Exit_Status;
Failure : constant Exit_Status;
procedure Set_Exit_Status (Code : Exit_Status);
------------------------------------
-- Note on Interface Requirements --
------------------------------------
-- Services in this package are not supported during the elaboration of an
-- auto-initialized Stand-Alone Library.
-- If the main program is in Ada, this package works as specified without
-- any other work than the normal steps of WITH'ing the package and then
-- calling the desired routines.
-- If the main program is not in Ada, then the information must be made
-- available for this package to work correctly. In particular, it is
-- required that the global variable "gnat_argc" contain the number of
-- arguments, and that the global variable "gnat_argv" points to an
-- array of null-terminated strings, the first entry being the command
-- name, and the remaining entries being the command arguments.
-- These correspond to the normal argc/argv variables passed to a C
-- main program, and the following is an example of a complete C main
-- program that stores the required information:
-- main(int argc, char **argv, char **envp)
-- {
-- extern int gnat_argc;
-- extern char **gnat_argv;
-- extern char **gnat_envp;
-- gnat_argc = argc;
-- gnat_argv = argv;
-- gnat_envp = envp;
-- adainit();
-- adamain();
-- adafinal();
-- }
-- The assignment statements ensure that the necessary information is
-- available for finding the command name and command line arguments.
private
Success : constant Exit_Status := 0;
Failure : constant Exit_Status := 1;
-- The following locations support the operation of the package
-- Ada.Command_Line.Remove, which provides facilities for logically
-- removing arguments from the command line. If one of the remove
-- procedures is called in this unit, then Remove_Args/Remove_Count
-- are set to indicate which arguments are removed. If no such calls
-- have been made, then Remove_Args is null.
Remove_Count : Natural;
-- Number of arguments reflecting removals. Not defined unless
-- Remove_Args is non-null.
type Arg_Nums is array (Positive range <>) of Positive;
type Arg_Nums_Ptr is access Arg_Nums;
-- An array that maps logical argument numbers (reflecting removal)
-- to physical argument numbers (e.g. if the first argument has been
-- removed, but not the second, then Arg_Nums (1) will be set to 2.
Remove_Args : Arg_Nums_Ptr := null;
-- Left set to null if no remove calls have been made, otherwise set
-- to point to an appropriate mapping array. Only the first Remove_Count
-- elements are relevant.
pragma Import (C, Set_Exit_Status, "__gnat_set_exit_status");
end Ada.Command_Line;
| 49.8 | 79 | 0.577205 |
58b0eeead0ae1167b6029848db134f83fca435ff | 711 | adb | Ada | src/entropy-none/siphash-entropy.adb | jhumphry/SPARK_SipHash | 9e9490e23ae722f8392b5f9cbdbc6bc8c6104fa5 | [
"CC0-1.0"
] | 5 | 2018-10-10T21:19:01.000Z | 2020-10-14T08:42:58.000Z | src/entropy-none/siphash-entropy.adb | jhumphry/SPARK_SipHash | 9e9490e23ae722f8392b5f9cbdbc6bc8c6104fa5 | [
"CC0-1.0"
] | null | null | null | src/entropy-none/siphash-entropy.adb | jhumphry/SPARK_SipHash | 9e9490e23ae722f8392b5f9cbdbc6bc8c6104fa5 | [
"CC0-1.0"
] | null | null | null | -- SipHash.Entropy
-- A child package that attempts to set the key from an entropy source on the
-- system.
-- This implementation is for systems where no entropy is available.
-- Copyright (c) 2015, James Humphry - see LICENSE file for details
package body SipHash.Entropy
with SPARK_Mode => Off
is
function System_Entropy_Source return Boolean is
(False);
procedure Set_Key_From_System_Entropy is
begin
raise Entropy_Unavailable
with "System entropy not available on this system";
end Set_Key_From_System_Entropy;
procedure Set_Key_From_System_Entropy (Success : out Boolean) is
begin
Success := False;
end Set_Key_From_System_Entropy;
end SipHash.Entropy;
| 26.333333 | 77 | 0.752461 |
4140106c8d6ae8eee03cd3958b5d96657a66cbd6 | 9,888 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/g-sercom-linux.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/g-sercom-linux.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/g-sercom-linux.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . S E R I A L _ C O M M U N I C A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2007-2016, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the GNU/Linux implementation of this package
with Ada.Streams; use Ada.Streams;
with Ada; use Ada;
with Ada.Unchecked_Deallocation;
with System; use System;
with System.Communication; use System.Communication;
with System.CRTL; use System.CRTL;
with System.OS_Constants;
with GNAT.OS_Lib; use GNAT.OS_Lib;
package body GNAT.Serial_Communications is
package OSC renames System.OS_Constants;
use type Interfaces.C.unsigned;
type Port_Data is new int;
subtype unsigned is Interfaces.C.unsigned;
subtype char is Interfaces.C.char;
subtype unsigned_char is Interfaces.C.unsigned_char;
function fcntl (fd : int; cmd : int; value : int) return int;
pragma Import (C, fcntl, "fcntl");
C_Data_Rate : constant array (Data_Rate) of unsigned :=
(B75 => OSC.B75,
B110 => OSC.B110,
B150 => OSC.B150,
B300 => OSC.B300,
B600 => OSC.B600,
B1200 => OSC.B1200,
B2400 => OSC.B2400,
B4800 => OSC.B4800,
B9600 => OSC.B9600,
B19200 => OSC.B19200,
B38400 => OSC.B38400,
B57600 => OSC.B57600,
B115200 => OSC.B115200);
C_Bits : constant array (Data_Bits) of unsigned :=
(CS7 => OSC.CS7, CS8 => OSC.CS8);
C_Stop_Bits : constant array (Stop_Bits_Number) of unsigned :=
(One => 0, Two => OSC.CSTOPB);
C_Parity : constant array (Parity_Check) of unsigned :=
(None => 0,
Odd => OSC.PARENB or OSC.PARODD,
Even => OSC.PARENB);
procedure Raise_Error (Message : String; Error : Integer := Errno);
pragma No_Return (Raise_Error);
----------
-- Name --
----------
function Name (Number : Positive) return Port_Name is
N : constant Natural := Number - 1;
N_Img : constant String := Natural'Image (N);
begin
return Port_Name ("/dev/ttyS" & N_Img (N_Img'First + 1 .. N_Img'Last));
end Name;
----------
-- Open --
----------
procedure Open
(Port : out Serial_Port;
Name : Port_Name)
is
use OSC;
C_Name : constant String := String (Name) & ASCII.NUL;
Res : int;
begin
if Port.H = null then
Port.H := new Port_Data;
end if;
Port.H.all := Port_Data (open
(C_Name (C_Name'First)'Address, int (O_RDWR + O_NOCTTY + O_NDELAY)));
if Port.H.all = -1 then
Raise_Error ("open: open failed");
end if;
-- By default we are in blocking mode
Res := fcntl (int (Port.H.all), F_SETFL, 0);
if Res = -1 then
Raise_Error ("open: fcntl failed");
end if;
end Open;
-----------------
-- Raise_Error --
-----------------
procedure Raise_Error (Message : String; Error : Integer := Errno) is
begin
raise Serial_Error with Message
& (if Error /= 0
then " (" & Errno_Message (Err => Error) & ')'
else "");
end Raise_Error;
----------
-- Read --
----------
overriding procedure Read
(Port : in out Serial_Port;
Buffer : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
Len : constant size_t := Buffer'Length;
Res : ssize_t;
begin
if Port.H = null then
Raise_Error ("read: port not opened", 0);
end if;
Res := read (Integer (Port.H.all), Buffer'Address, Len);
if Res = -1 then
Raise_Error ("read failed");
end if;
Last := Last_Index (Buffer'First, size_t (Res));
end Read;
---------
-- Set --
---------
procedure Set
(Port : Serial_Port;
Rate : Data_Rate := B9600;
Bits : Data_Bits := CS8;
Stop_Bits : Stop_Bits_Number := One;
Parity : Parity_Check := None;
Block : Boolean := True;
Local : Boolean := True;
Flow : Flow_Control := None;
Timeout : Duration := 10.0)
is
use OSC;
type termios is record
c_iflag : unsigned;
c_oflag : unsigned;
c_cflag : unsigned;
c_lflag : unsigned;
c_line : unsigned_char;
c_cc : Interfaces.C.char_array (0 .. 31);
c_ispeed : unsigned;
c_ospeed : unsigned;
end record;
pragma Convention (C, termios);
function tcgetattr (fd : int; termios_p : Address) return int;
pragma Import (C, tcgetattr, "tcgetattr");
function tcsetattr
(fd : int; action : int; termios_p : Address) return int;
pragma Import (C, tcsetattr, "tcsetattr");
function tcflush (fd : int; queue_selector : int) return int;
pragma Import (C, tcflush, "tcflush");
Current : termios;
Res : int;
pragma Warnings (Off, Res);
-- Warnings off, since we don't always test the result
begin
if Port.H = null then
Raise_Error ("set: port not opened", 0);
end if;
-- Get current port settings
Res := tcgetattr (int (Port.H.all), Current'Address);
-- Change settings now
Current.c_cflag := C_Data_Rate (Rate)
or C_Bits (Bits)
or C_Stop_Bits (Stop_Bits)
or C_Parity (Parity)
or CREAD;
Current.c_iflag := 0;
Current.c_lflag := 0;
Current.c_oflag := 0;
if Local then
Current.c_cflag := Current.c_cflag or CLOCAL;
end if;
case Flow is
when None =>
null;
when RTS_CTS =>
Current.c_cflag := Current.c_cflag or CRTSCTS;
when Xon_Xoff =>
Current.c_iflag := Current.c_iflag or IXON;
end case;
Current.c_ispeed := Data_Rate_Value (Rate);
Current.c_ospeed := Data_Rate_Value (Rate);
Current.c_cc (VMIN) := char'Val (0);
Current.c_cc (VTIME) := char'Val (Natural (Timeout * 10));
-- Set port settings
Res := tcflush (int (Port.H.all), TCIFLUSH);
Res := tcsetattr (int (Port.H.all), TCSANOW, Current'Address);
-- Block
Res := fcntl (int (Port.H.all), F_SETFL, (if Block then 0 else FNDELAY));
if Res = -1 then
Raise_Error ("set: fcntl failed");
end if;
end Set;
-----------
-- Write --
-----------
overriding procedure Write
(Port : in out Serial_Port;
Buffer : Stream_Element_Array)
is
Len : constant size_t := Buffer'Length;
Res : ssize_t;
begin
if Port.H = null then
Raise_Error ("write: port not opened", 0);
end if;
Res := write (int (Port.H.all), Buffer'Address, Len);
if Res = -1 then
Raise_Error ("write failed");
end if;
pragma Assert (size_t (Res) = Len);
end Write;
-----------
-- Close --
-----------
procedure Close (Port : in out Serial_Port) is
procedure Unchecked_Free is
new Unchecked_Deallocation (Port_Data, Port_Data_Access);
Res : int;
pragma Unreferenced (Res);
begin
if Port.H /= null then
Res := close (int (Port.H.all));
Unchecked_Free (Port.H);
end if;
end Close;
end GNAT.Serial_Communications;
| 31.390476 | 79 | 0.490696 |
22808b3869cf2039896038978a2193611a050cba | 627 | ads | Ada | tier-1/gmp/source/thin/gmp_c-mp_srcptr.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/gmp/source/thin/gmp_c-mp_srcptr.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/gmp/source/thin/gmp_c-mp_srcptr.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with gmp_c.Pointers;
with Interfaces.C;
package gmp_c.mp_srcptr is
-- Item
--
subtype Item is gmp_c.Pointers.mp_limb_t_Pointer;
-- Items
--
type Items is
array (Interfaces.C.size_t range <>) of aliased gmp_c.mp_srcptr.Item;
-- Pointer
--
type Pointer is access all gmp_c.mp_srcptr.Item;
-- Pointers
--
type Pointers is
array (Interfaces.C.size_t range <>) of aliased gmp_c.mp_srcptr.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all gmp_c.mp_srcptr.Pointer;
end gmp_c.mp_srcptr;
| 20.225806 | 77 | 0.684211 |
571901cc8f993b28bb4b21c77eeb25114c437dab | 979 | adb | Ada | build_gnu/binutils/gdb/testsuite/gdb.ada/array_subscript_addr/p.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2017-05-31T21:42:12.000Z | 2017-05-31T21:42:12.000Z | build_gnu/binutils/gdb/testsuite/gdb.ada/array_subscript_addr/p.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | null | null | null | build_gnu/binutils/gdb/testsuite/gdb.ada/array_subscript_addr/p.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2019-12-17T22:04:07.000Z | 2019-12-17T22:04:07.000Z | -- Copyright 2008-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure P is
type Table is array (1 .. 3) of Integer;
function Create (I : Integer) return Table is
begin
return (4 + I, 8 * I, 7 * I + 4);
end Create;
A : Table := Create (7);
C : Integer;
begin
C := A (1) + A (2); -- STOP
end P;
| 32.633333 | 73 | 0.682329 |
29cb9fba997490d6e8f45aabbdbea4e3f2b84f11 | 3,387 | ads | Ada | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/loopwave_callback.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/loopwave_callback.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/loopwave_callback.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null |
-- ----------------------------------------------------------------- --
-- --
-- This is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public --
-- License as published by the Free Software Foundation; either --
-- version 2 of the License, or (at your option) any later version. --
-- --
-- This software is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU General Public --
-- License along with this library; if not, write to the --
-- Free Software Foundation, Inc., 59 Temple Place - Suite 330, --
-- Boston, MA 02111-1307, USA. --
-- --
-- ----------------------------------------------------------------- --
-- ----------------------------------------------------------------- --
-- This is a translation, to the Ada programming language, of the --
-- original C test files written by Sam Lantinga - www.libsdl.org --
-- translation made by Antonio F. Vargas - www.adapower.net/~avargas --
-- ----------------------------------------------------------------- --
-- ----------------------------------------------------------------- --
-- WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
-- ----------------------------------------------------------------- --
-- SERIOUS WARNING: The Ada code in this files may, at some points,
-- rely directly on pointer arithmetic which is considered very
-- unsafe and PRONE TO ERROR. The AdaSDL_Mixer examples are
-- more appropriate and easier to understand. They should be used in
-- replacement of this files. Please go there.
-- This file exists only for the sake of completness and to test
-- AdaSDL without the dependency of AdaSDL_Mixer.
-- ----------------------------------------------------------------- --
-- WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
-- ----------------------------------------------------------------- --
with Interfaces.C;
with Interfaces.C.Pointers;
with SDL.Types; use SDL.Types;
with SDL.Audio;
package Loopwave_Callback is
package A renames SDL.Audio;
package C renames Interfaces.C;
use type C.int;
done : C.int := 0;
type Wave_Type is
record
spec : aliased A.AudioSpec;
sound : aliased Uint8_ptr; -- Pointer do wave data
soundlen : aliased Uint32; -- Length of wave data
soundpos : C.int; -- Current play position
end record;
pragma Convention (C, Wave_Type);
wave : Wave_Type;
procedure fillerup (userdata : void_ptr;
the_stream : Uint8_ptr;
the_len : C.int);
pragma Convention (C, fillerup);
procedure poked (sig : C.int);
pragma Convention (C, poked);
end Loopwave_Callback;
| 46.39726 | 72 | 0.483909 |
225793b1a0d20afb48c535a8edee7c9c62408fd7 | 4,618 | adb | Ada | src/util-streams-texts.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-streams-texts.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-streams-texts.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- Util.Streams.Files -- File Stream utilities
-- 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.IO_Exceptions;
package body Util.Streams.Texts is
procedure Initialize (Stream : in out Print_Stream;
To : in Output_Stream_Access) is
begin
Stream.Initialize (Output => To, Input => null, Size => 4096);
end Initialize;
-- ------------------------------
-- Write an integer on the stream.
-- ------------------------------
procedure Write (Stream : in out Print_Stream;
Item : in Integer) is
S : constant String := Integer'Image (Item);
begin
if Item > 0 then
Stream.Write (S (S'First + 1 .. S'Last));
else
Stream.Write (S);
end if;
end Write;
-- ------------------------------
-- Write an integer on the stream.
-- ------------------------------
procedure Write (Stream : in out Print_Stream;
Item : in Long_Long_Integer) is
S : constant String := Long_Long_Integer'Image (Item);
begin
if Item > 0 then
Stream.Write (S (S'First + 1 .. S'Last));
else
Stream.Write (S);
end if;
end Write;
-- ------------------------------
-- Write a string on the stream.
-- ------------------------------
procedure Write (Stream : in out Print_Stream;
Item : in Ada.Strings.Unbounded.Unbounded_String) is
begin
Stream.Write (Ada.Strings.Unbounded.To_String (Item));
end Write;
-- ------------------------------
-- Write a date on the stream.
-- ------------------------------
procedure Write (Stream : in out Print_Stream;
Item : in Ada.Calendar.Time;
Format : in GNAT.Calendar.Time_IO.Picture_String
:= GNAT.Calendar.Time_IO.ISO_Date) is
begin
Stream.Write (GNAT.Calendar.Time_IO.Image (Item, Format));
end Write;
-- ------------------------------
-- Get the output stream content as a string.
-- ------------------------------
function To_String (Stream : in Buffered.Buffered_Stream) return String is
use Ada.Streams;
Size : constant Natural := Stream.Get_Size;
Buffer : constant Streams.Buffered.Buffer_Access := Stream.Get_Buffer;
Result : String (1 .. Size);
begin
for I in Result'Range loop
Result (I) := Character'Val (Buffer (Stream_Element_Offset (I)));
end loop;
return Result;
end To_String;
-- ------------------------------
-- Initialize the reader to read the input from the input stream given in <b>From</b>.
-- ------------------------------
procedure Initialize (Stream : in out Reader_Stream;
From : in Input_Stream_Access) is
begin
Stream.Initialize (Output => null, Input => From, Size => 4096);
end Initialize;
-- ------------------------------
-- Read an input line from the input stream. The line is terminated by ASCII.LF.
-- When <b>Strip</b> is set, the line terminators (ASCII.CR, ASCII.LF) are removed.
-- ------------------------------
procedure Read_Line (Stream : in out Reader_Stream;
Into : out Ada.Strings.Unbounded.Unbounded_String;
Strip : in Boolean := False) is
C : Character;
begin
while not Stream.Is_Eof loop
Stream.Read (C);
if C = ASCII.LF then
if not Strip then
Ada.Strings.Unbounded.Append (Into, C);
end if;
return;
elsif C /= ASCII.CR or not Strip then
Ada.Strings.Unbounded.Append (Into, C);
end if;
end loop;
exception
when Ada.IO_Exceptions.Data_Error =>
return;
end Read_Line;
end Util.Streams.Texts;
| 36.362205 | 90 | 0.530966 |
58a8168d46d55c29e86373690f66dfaf476bdc30 | 9,696 | ads | Ada | extern/gnat_sdl/gnat_sdl2/src/sdl_atomic_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl2/src/sdl_atomic_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl2/src/sdl_atomic_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with SDL_stdinc_h;
with System;
package SDL_atomic_h is
-- arg-macro: procedure SDL_CompilerBarrier ()
-- __asm__ __volatile__ ("" : : : & "memory")
-- arg-macro: procedure SDL_MemoryBarrierRelease ()
-- SDL_CompilerBarrier()
-- arg-macro: procedure SDL_MemoryBarrierAcquire ()
-- SDL_CompilerBarrier()
-- arg-macro: procedure SDL_AtomicIncRef (a)
-- SDL_AtomicAdd(a, 1)
-- arg-macro: function SDL_AtomicDecRef (a)
-- return SDL_AtomicAdd(a, -1) = 1;
-- Simple DirectMedia Layer
-- Copyright (C) 1997-2018 Sam Lantinga <[email protected]>
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--
--*
-- * \file SDL_atomic.h
-- *
-- * Atomic operations.
-- *
-- * IMPORTANT:
-- * If you are not an expert in concurrent lockless programming, you should
-- * only be using the atomic lock and reference counting functions in this
-- * file. In all other cases you should be protecting your data structures
-- * with full mutexes.
-- *
-- * The list of "safe" functions to use are:
-- * SDL_AtomicLock()
-- * SDL_AtomicUnlock()
-- * SDL_AtomicIncRef()
-- * SDL_AtomicDecRef()
-- *
-- * Seriously, here be dragons!
-- * ^^^^^^^^^^^^^^^^^^^^^^^^^^^
-- *
-- * You can find out a little more about lockless programming and the
-- * subtle issues that can arise here:
-- * http://msdn.microsoft.com/en-us/library/ee418650%28v=vs.85%29.aspx
-- *
-- * There's also lots of good information here:
-- * http://www.1024cores.net/home/lock-free-algorithms
-- * http://preshing.com/
-- *
-- * These operations may or may not actually be implemented using
-- * processor specific atomic operations. When possible they are
-- * implemented as true processor specific atomic operations. When that
-- * is not possible the are implemented using locks that *do* use the
-- * available atomic operations.
-- *
-- * All of the atomic operations that modify memory are full memory barriers.
--
-- Set up for C function definitions, even when using C++
--*
-- * \name SDL AtomicLock
-- *
-- * The atomic locks are efficient spinlocks using CPU instructions,
-- * but are vulnerable to starvation and can spin forever if a thread
-- * holding a lock has been terminated. For this reason you should
-- * minimize the code executed inside an atomic lock and never do
-- * expensive things like API or system calls while holding them.
-- *
-- * The atomic locks are not safe to lock recursively.
-- *
-- * Porting Note:
-- * The spin lock functions and type are required and can not be
-- * emulated because they are used in the atomic emulation code.
--
-- @{
subtype SDL_SpinLock is int; -- ..\SDL2_tmp\SDL_atomic.h:89
--*
-- * \brief Try to lock a spin lock by setting it to a non-zero value.
-- *
-- * \param lock Points to the lock.
-- *
-- * \return SDL_TRUE if the lock succeeded, SDL_FALSE if the lock is already held.
--
function SDL_AtomicTryLock (lock : access SDL_SpinLock) return SDL_stdinc_h.SDL_bool; -- ..\SDL2_tmp\SDL_atomic.h:98
pragma Import (C, SDL_AtomicTryLock, "SDL_AtomicTryLock");
--*
-- * \brief Lock a spin lock by setting it to a non-zero value.
-- *
-- * \param lock Points to the lock.
--
procedure SDL_AtomicLock (lock : access SDL_SpinLock); -- ..\SDL2_tmp\SDL_atomic.h:105
pragma Import (C, SDL_AtomicLock, "SDL_AtomicLock");
--*
-- * \brief Unlock a spin lock by setting it to 0. Always returns immediately
-- *
-- * \param lock Points to the lock.
--
procedure SDL_AtomicUnlock (lock : access SDL_SpinLock); -- ..\SDL2_tmp\SDL_atomic.h:112
pragma Import (C, SDL_AtomicUnlock, "SDL_AtomicUnlock");
-- @}
-- SDL AtomicLock
--*
-- * The compiler barrier prevents the compiler from reordering
-- * reads and writes to globally visible variables across the call.
--
-- This is correct for all CPUs when using GCC or Solaris Studio 12.1+.
--*
-- * Memory barriers are designed to prevent reads and writes from being
-- * reordered by the compiler and being seen out of order on multi-core CPUs.
-- *
-- * A typical pattern would be for thread A to write some data and a flag,
-- * and for thread B to read the flag and get the data. In this case you
-- * would insert a release barrier between writing the data and the flag,
-- * guaranteeing that the data write completes no later than the flag is
-- * written, and you would insert an acquire barrier between reading the
-- * flag and reading the data, to ensure that all the reads associated
-- * with the flag have completed.
-- *
-- * In this pattern you should always see a release barrier paired with
-- * an acquire barrier and you should gate the data reads/writes with a
-- * single flag variable.
-- *
-- * For more information on these semantics, take a look at the blog post:
-- * http://preshing.com/20120913/acquire-and-release-semantics
--
procedure SDL_MemoryBarrierReleaseFunction; -- ..\SDL2_tmp\SDL_atomic.h:155
pragma Import (C, SDL_MemoryBarrierReleaseFunction, "SDL_MemoryBarrierReleaseFunction");
procedure SDL_MemoryBarrierAcquireFunction; -- ..\SDL2_tmp\SDL_atomic.h:156
pragma Import (C, SDL_MemoryBarrierAcquireFunction, "SDL_MemoryBarrierAcquireFunction");
-- The mcr instruction isn't available in thumb mode, use real functions
-- This is correct for all CPUs on Solaris when using Solaris Studio 12.1+.
-- This is correct for the x86 and x64 CPUs, and we'll expand this over time.
--*
-- * \brief A type representing an atomic integer value. It is a struct
-- * so people don't accidentally use numeric operations on it.
--
-- skipped anonymous struct anon_5
type SDL_atomic_t is record
value : aliased int; -- ..\SDL2_tmp\SDL_atomic.h:198
end record;
pragma Convention (C_Pass_By_Copy, SDL_atomic_t); -- ..\SDL2_tmp\SDL_atomic.h:198
--*
-- * \brief Set an atomic variable to a new value if it is currently an old value.
-- *
-- * \return SDL_TRUE if the atomic variable was set, SDL_FALSE otherwise.
-- *
-- * \note If you don't know what this function is for, you shouldn't use it!
--
function SDL_AtomicCAS
(a : access SDL_atomic_t;
oldval : int;
newval : int) return SDL_stdinc_h.SDL_bool; -- ..\SDL2_tmp\SDL_atomic.h:207
pragma Import (C, SDL_AtomicCAS, "SDL_AtomicCAS");
--*
-- * \brief Set an atomic variable to a value.
-- *
-- * \return The previous value of the atomic variable.
--
function SDL_AtomicSet (a : access SDL_atomic_t; v : int) return int; -- ..\SDL2_tmp\SDL_atomic.h:214
pragma Import (C, SDL_AtomicSet, "SDL_AtomicSet");
--*
-- * \brief Get the value of an atomic variable
--
function SDL_AtomicGet (a : access SDL_atomic_t) return int; -- ..\SDL2_tmp\SDL_atomic.h:219
pragma Import (C, SDL_AtomicGet, "SDL_AtomicGet");
--*
-- * \brief Add to an atomic variable.
-- *
-- * \return The previous value of the atomic variable.
-- *
-- * \note This same style can be used for any number operation
--
function SDL_AtomicAdd (a : access SDL_atomic_t; v : int) return int; -- ..\SDL2_tmp\SDL_atomic.h:228
pragma Import (C, SDL_AtomicAdd, "SDL_AtomicAdd");
--*
-- * \brief Increment an atomic variable used as a reference count.
--
--*
-- * \brief Decrement an atomic variable used as a reference count.
-- *
-- * \return SDL_TRUE if the variable reached zero after decrementing,
-- * SDL_FALSE otherwise
--
--*
-- * \brief Set a pointer to a new value if it is currently an old value.
-- *
-- * \return SDL_TRUE if the pointer was set, SDL_FALSE otherwise.
-- *
-- * \note If you don't know what this function is for, you shouldn't use it!
--
function SDL_AtomicCASPtr
(a : System.Address;
oldval : System.Address;
newval : System.Address) return SDL_stdinc_h.SDL_bool; -- ..\SDL2_tmp\SDL_atomic.h:254
pragma Import (C, SDL_AtomicCASPtr, "SDL_AtomicCASPtr");
--*
-- * \brief Set a pointer to a value atomically.
-- *
-- * \return The previous value of the pointer.
--
function SDL_AtomicSetPtr (a : System.Address; v : System.Address) return System.Address; -- ..\SDL2_tmp\SDL_atomic.h:261
pragma Import (C, SDL_AtomicSetPtr, "SDL_AtomicSetPtr");
--*
-- * \brief Get the value of a pointer atomically.
--
function SDL_AtomicGetPtr (a : System.Address) return System.Address; -- ..\SDL2_tmp\SDL_atomic.h:266
pragma Import (C, SDL_AtomicGetPtr, "SDL_AtomicGetPtr");
-- Ends C function definitions when using C++
-- vi: set ts=4 sw=4 expandtab:
end SDL_atomic_h;
| 37.727626 | 125 | 0.675639 |
395cd2d7a9f857afcc1e3918764e4898bf3b1059 | 5,444 | ads | Ada | ADL/drivers/stm32h743/stm32-power_control.ads | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32h743/stm32-power_control.ads | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32h743/stm32-power_control.ads | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of 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 STM32_SVD.PWR; use STM32_SVD.PWR;
package STM32.Power_Control is
-- This processor doesn't need to enable power control module.
procedure Disable_Backup_Domain_Protection;
procedure Enable_Backup_Domain_Protection;
type Wakeup_Pin is (WKUP_1, WKUP_2, WKUP_3, WKUP_4, WKUP_5, WKUP_6);
type Wakeup_Pin_List is array (Wakeup_Pin) of Wakeup_Pin;
procedure Enable_Wakeup_Pin (Pin : Wakeup_Pin;
Enabled : Boolean := True);
-- When enabled, the wakeup pin (PA0) is used for wakeup from Standby mode
-- and forced in input pull down configuration (rising edge on WKUP pin
-- wakes-up the system from Standby mode).
-- When disabled, the wakeup pin is used for general purpose I/O. An event
-- on the wakeup pin does not wakeup the device from Standby mode.
type Wakeup_Pin_Polarity is (Rising_Edge, Falling_Edge);
type Wakeup_Pin_PullMode is (No_Pull_Up, Pull_Up, Pull_Down);
procedure Set_Wakeup_Pin_Polarity (Pin : Wakeup_Pin;
Pol : Wakeup_Pin_Polarity;
Pull : Wakeup_Pin_PullMode);
function Wakeup_Flag (Pin : Wakeup_Pin) return Boolean;
-- This flag is set by hardware and cleared either by a system reset or by
-- calling the Clear_Wakeup_Flag procedure.
procedure Clear_Wakeup_Flag (Pin : Wakeup_Pin);
procedure Clear_Wakeup_Flag (Pins : Wakeup_Pin_List);
function Standby_Flag return Boolean;
-- This flag is set by hardware and cleared only by a POR/PDR (power-on
-- reset/power-down reset) or by calling the Clear_Standby_Flag procedure.
procedure Clear_Standby_Flag;
type System_Stop_Mode is
(SVOS_Scale_5,
SVOS_Scale_4,
SVOS_Scale_3);
-- VCORE voltage level in system Stop mode.
for System_Stop_Mode use
(SVOS_Scale_5 => 2#01#,
SVOS_Scale_4 => 2#10#,
SVOS_Scale_3 => 2#11#);
procedure Set_System_Stop_Mode (Mode : System_Stop_Mode);
-- Control the VCORE voltage level in system Stop mode, to obtain the best
-- trade-off between power consumption and performance.
type Low_Power_Mode is
(Stop_0,
Stop_1,
Standby,
Shutdown);
for Low_Power_Mode use
(Stop_0 => 2#000#,
Stop_1 => 2#001#,
Standby => 2#011#,
Shutdown => 2#100#);
procedure Set_Power_Down_Deepsleep (Enabled : Boolean := True);
-- When enabled, the MCU enters Standby mode when CPU enters deepsleep.
-- When disabled, the MCU enters Stop mode when CPU enters deepsleep.
procedure Set_Low_Power_Deepsleep (Enabled : Boolean := True);
-- When enabled, the voltage regulator is in low-power during MCU Stop mode.
-- When disabled, the voltage regulator is on during MCU Stop mode.
procedure Enter_Standby_Mode
with No_Return;
-- Clear the wakeup and standby flag, set the power-down on CPU deep sleep
-- and trigger MCU deep sleep.
-- MCU gets out of standby with a reset, so this procedure does not return.
end STM32.Power_Control;
| 47.754386 | 80 | 0.60856 |
3d2033b16b1ac5b8204dd476c3a6d4e9108ba4ad | 147,821 | adb | Ada | HLS/lab3/dct.prj/solution6/.autopilot/db/Loop_Xpose_Row_Outer.bind.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | 1 | 2021-03-03T16:53:52.000Z | 2021-03-03T16:53:52.000Z | HLS/lab3/dct.prj/solution6/.autopilot/db/Loop_Xpose_Row_Outer.bind.adb | lfVelez/ISPR | 840f41c2053a48642a7b287feecfea79c6f389b3 | [
"MIT"
] | null | null | null | HLS/lab3/dct.prj/solution6/.autopilot/db/Loop_Xpose_Row_Outer.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>Loop_Xpose_Row_Outer</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>row_outbuf_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>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>col_inbuf_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>col_inbuf_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>col_inbuf_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>col_inbuf_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>col_inbuf_4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>col_inbuf_5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>col_inbuf_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>col_inbuf_7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>8</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>48</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>10</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>77</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>j_0_i</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</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/lab3</first>
<second class_id="12" tracking_level="0" version="0">
<count>2</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.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>i_1_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>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>139</item>
<item>140</item>
<item>141</item>
<item>142</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>143</item>
<item>145</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>146</item>
<item>148</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>j</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>37</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>37</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_s</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>39</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>39</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>81</item>
<item>83</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>i_1_i_mid2</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>39</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>39</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>84</item>
<item>86</item>
<item>87</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>tmp_3_mid2_v</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>88</item>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>tmp_3_mid2</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>91</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_3_mid2_cast</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>39</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>39</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>97</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_8_cast</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_9</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>tmp_9_cast</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>101</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>row_outbuf_i_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>102</item>
<item>104</item>
<item>105</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>row_outbuf_i_load</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>106</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_3</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>39</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>39</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>16</count>
<item_version>0</item_version>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>113</item>
<item>114</item>
<item>116</item>
<item>117</item>
<item>119</item>
<item>120</item>
<item>122</item>
<item>123</item>
<item>125</item>
<item>126</item>
<item>128</item>
<item>129</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>col_inbuf_6_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>191</item>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>194</item>
<item>195</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>196</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>col_inbuf_5_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>188</item>
<item>189</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>190</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>col_inbuf_4_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
<item>181</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>182</item>
<item>183</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>184</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>col_inbuf_3_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>176</item>
<item>177</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>178</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>col_inbuf_2_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
<item>169</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>170</item>
<item>171</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>172</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>59</id>
<name>col_inbuf_1_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>161</item>
<item>162</item>
<item>163</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>164</item>
<item>165</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>166</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>col_inbuf_0_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
<item>157</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>64</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>158</item>
<item>159</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>160</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>col_inbuf_7_addr</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>197</item>
<item>198</item>
<item>199</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>68</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</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>200</item>
<item>201</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name></name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>202</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>i</name>
<fileName>dct.c</fileName>
<fileDirectory>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</fileDirectory>
<lineNumber>39</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/lfvelez/Documentos/ISPR/HLS/labsource/labs/lab3</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.c</first>
<second>dct</second>
</first>
<second>87</second>
</item>
<item>
<first>
<first>dct.c</first>
<second>dct_2d</second>
</first>
<second>39</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></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>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>73</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>154</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>82</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>85</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>96</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>103</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="_63">
<Value>
<Obj>
<type>2</type>
<id>112</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>115</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>121</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>5</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>127</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>6</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>130</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>144</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_71">
<Value>
<Obj>
<type>2</type>
<id>147</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_72">
<Obj>
<type>3</type>
<id>11</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>18</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>38</id>
<name>.preheader2.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>14</count>
<item_version>0</item_version>
<item>19</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_75">
<Obj>
<type>3</type>
<id>42</id>
<name>branch6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_76">
<Obj>
<type>3</type>
<id>46</id>
<name>branch5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
<item>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_77">
<Obj>
<type>3</type>
<id>50</id>
<name>branch4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>47</item>
<item>48</item>
<item>49</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_78">
<Obj>
<type>3</type>
<id>54</id>
<name>branch3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_79">
<Obj>
<type>3</type>
<id>58</id>
<name>branch2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>55</item>
<item>56</item>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_80">
<Obj>
<type>3</type>
<id>62</id>
<name>branch1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>66</id>
<name>branch0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>70</id>
<name>branch7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>74</id>
<name>ifBlock</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>72</item>
<item>73</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>76</id>
<name>.preheader1.i.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>130</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_85">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>114</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>117</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>120</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>123</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>126</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>129</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>132</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>134</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>136</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>138</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>151</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>172</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>202</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>234</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>235</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>236</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>237</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>239</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>240</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>241</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>242</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>243</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>245</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>246</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>247</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>248</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>249</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>250</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>251</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>252</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>253</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>18</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="_215">
<mId>1</mId>
<mTag>Loop_Xpose_Row_Outer</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>67</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_216">
<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>11</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="_217">
<mId>3</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>11</count>
<item_version>0</item_version>
<item>18</item>
<item>38</item>
<item>42</item>
<item>46</item>
<item>50</item>
<item>54</item>
<item>58</item>
<item>62</item>
<item>66</item>
<item>70</item>
<item>74</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>65</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_218">
<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>76</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_219">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_220">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_221">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_222">
<id>2</id>
<operations>
<count>19</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_223">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_227">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_228">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_229">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_230">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_231">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_232">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_234">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_235">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_237">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_238">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_239">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_242">
<id>3</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_243">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_244">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_245">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>35</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_252">
<id>4</id>
<operations>
<count>25</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_253">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>35</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_278">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_279">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_280">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>85</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="_281">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>111</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="_282">
<inState>4</inState>
<outState>2</outState>
<condition>
<id>112</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="_283">
<inState>2</inState>
<outState>5</outState>
<condition>
<id>110</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>15</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_284">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>113</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>15</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>48</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>10</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</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>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>1</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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>11</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_285">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>11</count>
<item_version>0</item_version>
<item>18</item>
<item>38</item>
<item>42</item>
<item>46</item>
<item>50</item>
<item>54</item>
<item>58</item>
<item>62</item>
<item>66</item>
<item>70</item>
<item>74</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>79</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
<item>
<first>84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>117</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>26</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>col_inbuf_0_addr_gep_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>col_inbuf_1_addr_gep_fu_149</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>col_inbuf_2_addr_gep_fu_136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>col_inbuf_3_addr_gep_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>col_inbuf_4_addr_gep_fu_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>col_inbuf_5_addr_gep_fu_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>col_inbuf_6_addr_gep_fu_84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>col_inbuf_7_addr_gep_fu_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>i_1_i_mid2_fu_245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>i_1_i_phi_fu_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>i_fu_290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_227</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>j_0_i_phi_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>j_fu_233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>row_outbuf_i_addr_gep_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_3_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp_3_mid2_cast_fu_265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_3_mid2_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>tmp_3_mid2_v_fu_253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_8_cast_fu_275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_9_cast_fu_285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>tmp_9_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_fu_268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_s_fu_239</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first class_id="52" tracking_level="0" version="0">
<first>col_inbuf_0</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_1</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_2</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_3</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_4</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_5</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_6</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_7</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>
<first>row_outbuf_i</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>321</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>332</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>i_1_i_mid2_reg_315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>i_1_i_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>i_reg_337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>j_0_i_reg_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>row_outbuf_i_addr_reg_332</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_3_mid2_v_reg_321</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_3_reg_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>i_1_i_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>j_0_i_reg_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="53" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>col_inbuf_0(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>64</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_1(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>60</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_2(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>56</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_3(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>52</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_4(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>48</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_5(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>44</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_6(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>40</item>
</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_7(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>68</item>
</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_i(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>35</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="55" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
<item>
<first>7</first>
<second>RAM</second>
</item>
<item>
<first>8</first>
<second>RAM</second>
</item>
<item>
<first>9</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 24.764785 | 90 | 0.573389 |
2959dafd301c91b2cb834ea0c955eb9729c2e1e6 | 46 | adb | Ada | AdaToolsTests/Both.adb | gitter-badger/Ada-tools | 1a7c354ca49925d12a9be0e14c88b66e7350d257 | [
"BSD-3-Clause"
] | null | null | null | AdaToolsTests/Both.adb | gitter-badger/Ada-tools | 1a7c354ca49925d12a9be0e14c88b66e7350d257 | [
"BSD-3-Clause"
] | null | null | null | AdaToolsTests/Both.adb | gitter-badger/Ada-tools | 1a7c354ca49925d12a9be0e14c88b66e7350d257 | [
"BSD-3-Clause"
] | null | null | null | with Body;
package body Both is
end Both; | 11.5 | 21 | 0.695652 |
3d324a72cf2d31231734a2e25e73c2b406dda1a0 | 4,821 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3403e.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/ce3403e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3403e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3403E.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 SKIP_LINE INCREMENTS THE CURRENT LINE NUMBER BY ONE
-- AND SETS THE CURRENT COLUMN NUMBER TO ONE IF THE LINE TERMINATOR
-- IS NOT FOLLOWED BY A PAGE TERMINATOR, AND THAT IT SETS BOTH THE
-- LINE AND COLUMN NUMBERS TO ONE AND INCREMENTS THE CURRENT PAGE
-- NUMBER BY ONE IF THE LINE TERMINATOR IS FOLLOWED BY A PAGE
-- TERMINATOR.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS ONLY APPLICABLE TO IMPLEMENTATIONS WHICH
-- SUPPORT TEXT FILES.
-- HISTORY:
-- ABW 08/26/82
-- SPS 09/20/82
-- TBN 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- DWC 09/09/87 REVISED TEST TO USE A FILE NAME, REMOVED
-- DEPENDENCE ON RESET, AND ATTEMPTED TO
-- DELETE THE FILE.
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
PROCEDURE CE3403E IS
INCOMPLETE : EXCEPTION;
FILE : FILE_TYPE;
ONE : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(1));
TWO : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(2));
CHAR : CHARACTER := ('C');
BEGIN
TEST ("CE3403E" , "CHECK THAT SKIP_LINE SETS COLUMN, " &
"LINE, AND PAGE NUMBERS CORRECTLY");
BEGIN
CREATE (FILE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED; TEXT CREATE");
RAISE INCOMPLETE;
END;
PUT (FILE, CHAR);
NEW_LINE (FILE);
PUT (FILE, CHAR);
NEW_PAGE (FILE);
PUT (FILE, CHAR);
CLOSE (FILE);
BEGIN
OPEN (FILE, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT OPEN " &
"WITH IN_FILE MODE");
RAISE INCOMPLETE;
END;
IF (LINE (FILE) /= ONE) OR (PAGE (FILE) /= ONE) THEN
FAILED ("INCORRECT LINE AND PAGE NUMBERS");
ELSE
-- LINE TERMINATOR NOT FOLLOWED BY PAGE TERMINATOR
GET (FILE, CHAR);
IF CHAR /= 'C' THEN
FAILED ("INCORRECT VALUE READ - 1");
END IF;
SKIP_LINE (FILE);
IF LINE (FILE) /= TWO THEN
FAILED ("FIRST SUBTEST - LINE NOT INCREMENTED");
END IF;
IF COL (FILE) /= ONE THEN
FAILED ("FIRST SUBTEST - COLUMN NOT SET TO ONE");
END IF;
-- LINE TERMINATOR FOLLOWED BY PAGE TERMINATOR
GET (FILE, CHAR);
IF CHAR /= 'C' THEN
FAILED ("INCORRECT VALUE READ - 2");
END IF;
SKIP_LINE (FILE);
IF LINE (FILE) /= ONE THEN
FAILED ("SECOND SUBTEST - LINE NOT SET TO ONE");
END IF;
IF COL (FILE) /= ONE THEN
FAILED ("SECOND SUBTEST - COLUMN NOT SET TO ONE");
END IF;
IF PAGE (FILE) /= TWO THEN
FAILED ("SECOND SUBTEST - PAGE NOT INCREMENTED");
END IF;
END IF;
BEGIN
DELETE (FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE3403E;
| 31.927152 | 79 | 0.577266 |
2278012bbe608cb47650c24bef4cd97c04ee0e8d | 98 | adb | Ada | sanity-checking/tests/0005-gnatcov-basic/src/hello.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 5 | 2021-06-04T05:24:49.000Z | 2022-01-23T11:17:29.000Z | sanity-checking/tests/0005-gnatcov-basic/src/hello.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 7 | 2021-05-30T14:29:26.000Z | 2022-01-20T09:02:46.000Z | sanity-checking/tests/0005-gnatcov-basic/src/hello.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 4 | 2021-05-29T19:07:47.000Z | 2021-11-11T05:53:14.000Z | with Ada.Text_IO;
procedure Hello is
begin
Ada.Text_IO.Put_Line ("Hello, World!");
end Hello;
| 14 | 42 | 0.72449 |
2286a68ef66000f83c404e8c711b0dd383121133 | 2,283 | ads | Ada | source/oasis/program-compilations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-compilations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-compilations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Contexts;
package Program.Compilations is
pragma Pure;
-- A specific Compilation value is valid (usable) for as long as the
-- Context variable, used to create it, remains open. Once an Context is
-- closed, all associated Compilation values become invalid. It is
-- erroneous to use an invalid Compilation value.
type Compilation is limited interface;
-- The Ada Compilation abstraction:
--
-- The text of a program is submitted to the compiler in one or more
-- compilations. Each compilation is a succession of compilation units.
type Compilation_Access is access all Compilation'Class
with Storage_Size => 0;
function Is_Assigned (Self : access Compilation'Class) return Boolean
is (Self /= null);
not overriding function Context (Self : Compilation)
return not null Program.Contexts.Context_Access is abstract;
-- Return corresponding context
not overriding function Text_Name
(Self : Compilation) return Text is abstract;
-- Returns the name of the text, or other structure, that was the source of
-- the compilation that resulted in this Compilation. Returns a null string
-- if the text name is not available for any reason.
not overriding function Object_Name
(Self : Compilation) return Text is abstract;
-- Returns the name of the object, or other structure, that contains the
-- binary result of the compilation for this Compilation. Returns a null
-- string if the object name is not available for any reason.
not overriding function Line_Count
(Self : Compilation) return Natural is abstract;
not overriding function Line
(Self : Compilation;
Index : Positive) return Text is abstract;
not overriding function Lexical_Element_Count
(Self : Compilation) return Natural is abstract;
not overriding function Lexical_Element
(Self : Compilation;
Index : Positive) return Program.Lexical_Elements.Lexical_Element_Access
is abstract;
-- TODO: Compilation_Pragmas?
end Program.Compilations;
| 36.822581 | 79 | 0.711783 |
50b61359058eb86c277d34a509f5d0547a664beb | 1,500 | ads | Ada | orka_simd/src/x86/gnat/orka-simd-sse4_1-singles-math.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka_simd/src/x86/gnat/orka-simd-sse4_1-singles-math.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka_simd/src/x86/gnat/orka-simd-sse4_1-singles-math.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Orka.SIMD.SSE.Singles;
package Orka.SIMD.SSE4_1.Singles.Math is
pragma Pure;
use Orka.SIMD.SSE.Singles;
function Round (Elements : m128; Rounding : Unsigned_32) return m128
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_roundps";
function Round_Nearest_Integer (Elements : m128) return m128 is
(Round (Elements, 0));
-- Round each element to the nearest integer
function Floor (Elements : m128) return m128 is
(Round (Elements, 1));
-- Round each element down to an integer value
function Ceil (Elements : m128) return m128 is
(Round (Elements, 2));
-- Round each element up to an integer value
function Round_Truncate (Elements : m128) return m128 is
(Round (Elements, 3));
-- Round each element to zero
end Orka.SIMD.SSE4_1.Singles.Math;
| 34.090909 | 85 | 0.712 |
22a0b303722e9f32eaa6fbf0d9763efbc7376305 | 488 | ads | Ada | src/skill-iterators.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | src/skill-iterators.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | src/skill-iterators.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | -- ___ _ ___ _ _ --
-- / __| |/ (_) | | Common SKilL implementation --
-- \__ \ ' <| | | |__ top level iterator package --
-- |___/_|\_\_|_|____| by: Timm Felden --
-- --
pragma Ada_2012;
package Skill.Iterators is
pragma Pure;
end Skill.Iterators;
| 40.666667 | 80 | 0.309426 |
22513799770b1606817aa23e1b9b0fb57a148b90 | 157 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/ifaces.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/ifaces.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/ifaces.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | with Text_IO; use Text_IO;
package body Ifaces is
procedure op1 (this : Root) is begin null; end;
procedure op2 (this : DT) is begin null; end;
end;
| 26.166667 | 50 | 0.694268 |
3dad18b5efa91311fe484c26368cf04def17df70 | 8,575 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-tigeli.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-tigeli.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-tigeli.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . G E T _ L I N E --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- The implementation of Ada.Text_IO.Get_Line is split into a subunit so that
-- different implementations can be used on different systems. This is the
-- standard implementation (it uses low level features not suitable for use
-- on virtual machines).
with System; use System;
with System.Storage_Elements; use System.Storage_Elements;
separate (Ada.Text_IO)
procedure Get_Line
(File : File_Type;
Item : out String;
Last : out Natural)
is
Chunk_Size : constant := 80;
-- We read into a fixed size auxiliary buffer. Because this buffer
-- needs to be pre-initialized, there is a trade-off between size and
-- speed. Experiments find returns are diminishing after 50 and this
-- size allows most lines to be processed with a single read.
ch : int;
N : Natural;
procedure memcpy (s1, s2 : chars; n : size_t);
pragma Import (C, memcpy);
function memchr (s : chars; ch : int; n : size_t) return chars;
pragma Import (C, memchr);
procedure memset (b : chars; ch : int; n : size_t);
pragma Import (C, memset);
function Get_Chunk (N : Positive) return Natural;
-- Reads at most N - 1 characters into Item (Last + 1 .. Item'Last),
-- updating Last. Raises End_Error if nothing was read (End_Of_File).
-- Returns number of characters still to read (either 0 or 1) in
-- case of success.
---------------
-- Get_Chunk --
---------------
function Get_Chunk (N : Positive) return Natural is
Buf : String (1 .. Chunk_Size);
S : constant chars := Buf (1)'Address;
P : chars;
begin
if N = 1 then
return N;
end if;
memset (S, 10, size_t (N));
if fgets (S, N, File.Stream) = Null_Address then
if ferror (File.Stream) /= 0 then
raise Device_Error;
-- If incomplete last line, pretend we found a LM
elsif Last >= Item'First then
return 0;
else
raise End_Error;
end if;
end if;
P := memchr (S, LM, size_t (N));
-- If no LM is found, the buffer got filled without reading a new
-- line. Otherwise, the LM is either one from the input, or else one
-- from the initialization, which means an incomplete end-of-line was
-- encountered. Only in first case the LM will be followed by a 0.
if P = Null_Address then
pragma Assert (Buf (N) = ASCII.NUL);
memcpy (Item (Last + 1)'Address,
Buf (1)'Address, size_t (N - 1));
Last := Last + N - 1;
return 1;
else
-- P points to the LM character. Set K so Buf (K) is the character
-- right before.
declare
K : Natural := Natural (P - S);
begin
-- If K + 2 is greater than N, then Buf (K + 1) cannot be a LM
-- character from the source file, as the call to fgets copied at
-- most N - 1 characters. Otherwise, either LM is a character from
-- the source file and then Buf (K + 2) should be 0, or LM is a
-- character put in Buf by memset and then Buf (K) is the 0 put in
-- by fgets. In both cases where LM does not come from the source
-- file, compensate.
if K + 2 > N or else Buf (K + 2) /= ASCII.NUL then
-- Incomplete last line, so remove the extra 0
pragma Assert (Buf (K) = ASCII.NUL);
K := K - 1;
end if;
memcpy (Item (Last + 1)'Address,
Buf (1)'Address, size_t (K));
Last := Last + K;
end;
return 0;
end if;
end Get_Chunk;
-- Start of processing for Get_Line
begin
FIO.Check_Read_Status (AP (File));
-- Set Last to Item'First - 1 when no characters are read, as mandated by
-- Ada RM. In the case where Item'First is negative or null, this results
-- in Constraint_Error being raised.
Last := Item'First - 1;
-- Immediate exit for null string, this is a case in which we do not
-- need to test for end of file and we do not skip a line mark under
-- any circumstances.
if Item'First > Item'Last then
return;
end if;
N := Item'Last - Item'First + 1;
-- Here we have at least one character, if we are immediately before
-- a line mark, then we will just skip past it storing no characters.
if File.Before_LM then
File.Before_LM := False;
File.Before_LM_PM := False;
-- Otherwise we need to read some characters
else
while N >= Chunk_Size loop
if Get_Chunk (Chunk_Size) = 0 then
N := 0;
else
N := N - Chunk_Size + 1;
end if;
end loop;
if N > 1 then
N := Get_Chunk (N);
end if;
-- Almost there, only a little bit more to read
if N = 1 then
ch := Getc (File);
-- If we get EOF after already reading data, this is an incomplete
-- last line, in which case no End_Error should be raised.
if ch = EOF then
if Last < Item'First then
raise End_Error;
else -- All done
return;
end if;
elsif ch /= LM then
-- Buffer really is full without having seen LM, update col
Last := Last + 1;
Item (Last) := Character'Val (ch);
File.Col := File.Col + Count (Last - Item'First + 1);
return;
end if;
end if;
end if;
-- We have skipped past, but not stored, a line mark. Skip following
-- page mark if one follows, but do not do this for a non-regular file
-- (since otherwise we get annoying wait for an extra character)
File.Line := File.Line + 1;
File.Col := 1;
if File.Before_LM_PM then
File.Line := 1;
File.Before_LM_PM := False;
File.Page := File.Page + 1;
elsif File.Is_Regular_File then
ch := Getc (File);
if ch = PM and then File.Is_Regular_File then
File.Line := 1;
File.Page := File.Page + 1;
else
Ungetc (ch, File);
end if;
end if;
end Get_Line;
| 35.433884 | 79 | 0.516152 |
3d78c5fb5a395a91ebd1bb12a5adc1506c66582b | 3,439 | ads | Ada | 3-mid/impact/source/2d/dynamics/joints/impact-d2-joint-mouse.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/2d/dynamics/joints/impact-d2-joint-mouse.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/2d/dynamics/joints/impact-d2-joint-mouse.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package impact.d2.Joint.mouse
--
--
--
is
-- #ifndef B2_MOUSE_JOINT_H
-- #define B2_MOUSE_JOINT_H
--
-- #include <Box2D/Dynamics/Joints/b2Joint.h>
--
-- /// Mouse joint definition. This requires a world target point,
-- /// tuning parameters, and the time step.
-- struct b2MouseJointDef : public b2JointDef
-- {
-- b2MouseJointDef()
-- {
-- type = e_mouseJoint;
-- target.Set(0.0f, 0.0f);
-- maxForce = 0.0f;
-- frequencyHz = 5.0f;
-- dampingRatio = 0.7f;
-- }
--
-- /// The initial world target point. This is assumed
-- /// to coincide with the body anchor initially.
-- b2Vec2 target;
--
-- /// The maximum constraint force that can be exerted
-- /// to move the candidate body. Usually you will express
-- /// as some multiple of the weight (multiplier * mass * gravity).
-- float32 maxForce;
--
-- /// The response speed.
-- float32 frequencyHz;
--
-- /// The damping ratio. 0 = no damping, 1 = critical damping.
-- float32 dampingRatio;
-- };
--
-- /// A mouse joint is used to make a point on a body track a
-- /// specified world point. This a soft constraint with a maximum
-- /// force. This allows the constraint to stretch and without
-- /// applying huge forces.
-- /// NOTE: this joint is not documented in the manual because it was
-- /// developed to be used in the testbed. If you want to learn how to
-- /// use the mouse joint, look at the testbed.
-- class b2MouseJoint : public b2Joint
-- {
-- public:
--
-- /// Implements b2Joint.
-- b2Vec2 GetAnchorA() const;
--
-- /// Implements b2Joint.
-- b2Vec2 GetAnchorB() const;
--
-- /// Implements b2Joint.
-- b2Vec2 GetReactionForce(float32 inv_dt) const;
--
-- /// Implements b2Joint.
-- float32 GetReactionTorque(float32 inv_dt) const;
--
-- /// Use this to update the target point.
-- void SetTarget(const b2Vec2& target);
-- const b2Vec2& GetTarget() const;
--
-- /// Set/get the maximum force in Newtons.
-- void SetMaxForce(float32 force);
-- float32 GetMaxForce() const;
--
-- /// Set/get the frequency in Hertz.
-- void SetFrequency(float32 hz);
-- float32 GetFrequency() const;
--
-- /// Set/get the damping ratio (dimensionless).
-- void SetDampingRatio(float32 ratio);
-- float32 GetDampingRatio() const;
--
-- protected:
-- friend class b2Joint;
--
-- b2MouseJoint(const b2MouseJointDef* def);
--
-- void InitVelocityConstraints(const b2TimeStep& step);
-- void SolveVelocityConstraints(const b2TimeStep& step);
-- bool SolvePositionConstraints(float32 baumgarte) { B2_NOT_USED(baumgarte); return true; }
--
-- b2Vec2 m_localAnchor;
-- b2Vec2 m_target;
-- b2Vec2 m_impulse;
--
-- b2Mat22 m_mass; // effective mass for point-to-point constraint.
-- b2Vec2 m_C; // position error
-- float32 m_maxForce;
-- float32 m_frequencyHz;
-- float32 m_dampingRatio;
-- float32 m_beta;
-- float32 m_gamma;
-- };
--
-- #endif
procedure dummy;
end impact.d2.Joint.mouse;
| 31.842593 | 101 | 0.56877 |
418ae0e669fa139d8bf65490fed36c423ac7e47b | 50 | ads | Ada | boards/host/startup.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | boards/host/startup.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | boards/host/startup.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | package Startup is
pragma Pure;
end Startup;
| 8.333333 | 18 | 0.72 |
3d29939905d7c5f94b112ea9221f3e788671222c | 17,287 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stwiun__shared.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stwiun__shared.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stwiun__shared.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ U N B O U N D E D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This version is supported on:
-- - all Alpha platforms
-- - all ia64 platforms
-- - all PowerPC platforms
-- - all SPARC V9 platforms
-- - all x86 platforms
-- - all x86_64 platforms
with Ada.Strings.Wide_Maps;
private with Ada.Finalization;
private with System.Atomic_Counters;
package Ada.Strings.Wide_Unbounded is
pragma Preelaborate;
type Unbounded_Wide_String is private;
pragma Preelaborable_Initialization (Unbounded_Wide_String);
Null_Unbounded_Wide_String : constant Unbounded_Wide_String;
function Length (Source : Unbounded_Wide_String) return Natural;
type Wide_String_Access is access all Wide_String;
procedure Free (X : in out Wide_String_Access);
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Unbounded_Wide_String
(Source : Wide_String) return Unbounded_Wide_String;
function To_Unbounded_Wide_String
(Length : Natural) return Unbounded_Wide_String;
function To_Wide_String
(Source : Unbounded_Wide_String) return Wide_String;
procedure Set_Unbounded_Wide_String
(Target : out Unbounded_Wide_String;
Source : Wide_String);
pragma Ada_05 (Set_Unbounded_Wide_String);
procedure Append
(Source : in out Unbounded_Wide_String;
New_Item : Unbounded_Wide_String);
procedure Append
(Source : in out Unbounded_Wide_String;
New_Item : Wide_String);
procedure Append
(Source : in out Unbounded_Wide_String;
New_Item : Wide_Character);
function "&"
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Unbounded_Wide_String;
function "&"
(Left : Unbounded_Wide_String;
Right : Wide_String) return Unbounded_Wide_String;
function "&"
(Left : Wide_String;
Right : Unbounded_Wide_String) return Unbounded_Wide_String;
function "&"
(Left : Unbounded_Wide_String;
Right : Wide_Character) return Unbounded_Wide_String;
function "&"
(Left : Wide_Character;
Right : Unbounded_Wide_String) return Unbounded_Wide_String;
function Element
(Source : Unbounded_Wide_String;
Index : Positive) return Wide_Character;
procedure Replace_Element
(Source : in out Unbounded_Wide_String;
Index : Positive;
By : Wide_Character);
function Slice
(Source : Unbounded_Wide_String;
Low : Positive;
High : Natural) return Wide_String;
function Unbounded_Slice
(Source : Unbounded_Wide_String;
Low : Positive;
High : Natural) return Unbounded_Wide_String;
pragma Ada_05 (Unbounded_Slice);
procedure Unbounded_Slice
(Source : Unbounded_Wide_String;
Target : out Unbounded_Wide_String;
Low : Positive;
High : Natural);
pragma Ada_05 (Unbounded_Slice);
function "="
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function "="
(Left : Unbounded_Wide_String;
Right : Wide_String) return Boolean;
function "="
(Left : Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function "<"
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function "<"
(Left : Unbounded_Wide_String;
Right : Wide_String) return Boolean;
function "<"
(Left : Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function "<="
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function "<="
(Left : Unbounded_Wide_String;
Right : Wide_String) return Boolean;
function "<="
(Left : Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function ">"
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function ">"
(Left : Unbounded_Wide_String;
Right : Wide_String) return Boolean;
function ">"
(Left : Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function ">="
(Left : Unbounded_Wide_String;
Right : Unbounded_Wide_String) return Boolean;
function ">="
(Left : Unbounded_Wide_String;
Right : Wide_String) return Boolean;
function ">="
(Left : Wide_String;
Right : Unbounded_Wide_String) return Boolean;
------------------------
-- Search Subprograms --
------------------------
function Index
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
function Index
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
function Index
(Source : Unbounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Unbounded_Wide_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Unbounded_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
function Count
(Source : Unbounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
function Count
(Source : Unbounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set) return Natural;
procedure Find_Token
(Source : Unbounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural);
pragma Ada_2012 (Find_Token);
procedure Find_Token
(Source : Unbounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Unbounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping)
return Unbounded_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping);
function Translate
(Source : Unbounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function)
return Unbounded_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Unbounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String) return Unbounded_Wide_String;
procedure Replace_Slice
(Source : in out Unbounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String);
function Insert
(Source : Unbounded_Wide_String;
Before : Positive;
New_Item : Wide_String) return Unbounded_Wide_String;
procedure Insert
(Source : in out Unbounded_Wide_String;
Before : Positive;
New_Item : Wide_String);
function Overwrite
(Source : Unbounded_Wide_String;
Position : Positive;
New_Item : Wide_String) return Unbounded_Wide_String;
procedure Overwrite
(Source : in out Unbounded_Wide_String;
Position : Positive;
New_Item : Wide_String);
function Delete
(Source : Unbounded_Wide_String;
From : Positive;
Through : Natural) return Unbounded_Wide_String;
procedure Delete
(Source : in out Unbounded_Wide_String;
From : Positive;
Through : Natural);
function Trim
(Source : Unbounded_Wide_String;
Side : Trim_End) return Unbounded_Wide_String;
procedure Trim
(Source : in out Unbounded_Wide_String;
Side : Trim_End);
function Trim
(Source : Unbounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set) return Unbounded_Wide_String;
procedure Trim
(Source : in out Unbounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set);
function Head
(Source : Unbounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space) return Unbounded_Wide_String;
procedure Head
(Source : in out Unbounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space);
function Tail
(Source : Unbounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space) return Unbounded_Wide_String;
procedure Tail
(Source : in out Unbounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space);
function "*"
(Left : Natural;
Right : Wide_Character) return Unbounded_Wide_String;
function "*"
(Left : Natural;
Right : Wide_String) return Unbounded_Wide_String;
function "*"
(Left : Natural;
Right : Unbounded_Wide_String) return Unbounded_Wide_String;
private
pragma Inline (Length);
package AF renames Ada.Finalization;
type Shared_Wide_String (Max_Length : Natural) is limited record
Counter : System.Atomic_Counters.Atomic_Counter;
-- Reference counter
Last : Natural := 0;
Data : Wide_String (1 .. Max_Length);
-- Last is the index of last significant element of the Data. All
-- elements with larger indexes are just extra room for expansion.
end record;
type Shared_Wide_String_Access is access all Shared_Wide_String;
procedure Reference (Item : not null Shared_Wide_String_Access);
-- Increment reference counter.
procedure Unreference (Item : not null Shared_Wide_String_Access);
-- Decrement reference counter. Deallocate Item when ref counter is zero
function Can_Be_Reused
(Item : Shared_Wide_String_Access;
Length : Natural) return Boolean;
-- Returns True if Shared_Wide_String can be reused. There are two criteria
-- when Shared_Wide_String can be reused: its reference counter must be one
-- (thus Shared_Wide_String is owned exclusively) and its size is
-- sufficient to store string with specified length effectively.
function Allocate (Max_Length : Natural) return Shared_Wide_String_Access;
-- Allocates new Shared_Wide_String with at least specified maximum length.
-- Actual maximum length of the allocated Shared_Wide_String can be
-- slightly greater. Returns reference to Empty_Shared_Wide_String when
-- requested length is zero.
Empty_Shared_Wide_String : aliased Shared_Wide_String (0);
function To_Unbounded (S : Wide_String) return Unbounded_Wide_String
renames To_Unbounded_Wide_String;
-- This renames are here only to be used in the pragma Stream_Convert
type Unbounded_Wide_String is new AF.Controlled with record
Reference : Shared_Wide_String_Access := Empty_Shared_Wide_String'Access;
end record;
-- The Unbounded_Wide_String uses several techniques to increase speed of
-- the application:
-- - implicit sharing or copy-on-write. Unbounded_Wide_String contains
-- only the reference to the data which is shared between several
-- instances. The shared data is reallocated only when its value is
-- changed and the object mutation can't be used or it is inefficient to
-- use it;
-- - object mutation. Shared data object can be reused without memory
-- reallocation when all of the following requirements are meat:
-- - shared data object don't used anywhere longer;
-- - its size is sufficient to store new value;
-- - the gap after reuse is less than some threshold.
-- - memory preallocation. Most of used memory allocation algorithms
-- aligns allocated segment on the some boundary, thus some amount of
-- additional memory can be preallocated without any impact. Such
-- preallocated memory can used later by Append/Insert operations
-- without reallocation.
-- Reference counting uses GCC builtin atomic operations, which allows safe
-- sharing of internal data between Ada tasks. Nevertheless, this does not
-- make objects of Unbounded_String thread-safe: an instance cannot be
-- accessed by several tasks simultaneously.
pragma Stream_Convert (Unbounded_Wide_String, To_Unbounded, To_Wide_String);
-- Provide stream routines without dragging in Ada.Streams
pragma Finalize_Storage_Only (Unbounded_Wide_String);
-- Finalization is required only for freeing storage
overriding procedure Initialize (Object : in out Unbounded_Wide_String);
overriding procedure Adjust (Object : in out Unbounded_Wide_String);
overriding procedure Finalize (Object : in out Unbounded_Wide_String);
pragma Inline (Initialize, Adjust);
Null_Unbounded_Wide_String : constant Unbounded_Wide_String :=
(AF.Controlled with
Reference =>
Empty_Shared_Wide_String'Access);
end Ada.Strings.Wide_Unbounded;
| 34.852823 | 79 | 0.631457 |
57d288f37e2a467e191358954a640ce9a69671ce | 4,557 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35503o.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35503o.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35503o.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C35503O.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 'FIRST' AND 'LAST' YIELD THE CORRECT RESULTS WHEN THE
-- PREFIX IS AN INTEGER TYPE.
-- HISTORY:
-- RJW 03/17/86 CREATED ORIGINAL TEST.
-- DHH 10/19/87 SHORTENED LINES CONTAINING MORE THAN 72 CHARACTERS.
WITH REPORT; USE REPORT;
PROCEDURE C35503O IS
BEGIN
TEST ("C35503O", "CHECK THAT 'FIRST' AND 'LAST' YIELD THE " &
"CORRECT RESULTS WHEN THE PREFIX IS AN " &
"INTEGER TYPE" );
DECLARE
SUBTYPE SINTEGER IS INTEGER;
SUBTYPE SMALL IS INTEGER RANGE IDENT_INT(-10) ..
IDENT_INT(10);
SUBTYPE NOINTEGER IS INTEGER
RANGE IDENT_INT(5) .. IDENT_INT(-7);
TYPE INT IS RANGE -6 .. 6;
SUBTYPE SINT IS INT
RANGE INT(IDENT_INT(-4)) .. INT(IDENT_INT(4));
SUBTYPE NOINT IS INT
RANGE INT(IDENT_INT(1)) .. INT(IDENT_INT(-1));
TYPE NEWINT IS NEW INTEGER RANGE IDENT_INT(-9) ..
IDENT_INT(-2);
SUBTYPE SNEWINT IS NEWINT RANGE -7 .. -5;
SUBTYPE NONEWINT IS NEWINT RANGE 3 .. -15;
BEGIN
IF SINTEGER'FIRST /= INTEGER'FIRST THEN
FAILED ( "WRONG VALUE FOR SINTEGER'FIRST" );
END IF;
IF SINTEGER'LAST /= INTEGER'LAST THEN
FAILED ( "WRONG VALUE FOR SINTEGER'LAST" );
END IF;
IF SMALL'FIRST /= -10 THEN
FAILED ( "WRONG VALUE FOR SMALL'FIRST" );
END IF;
IF SMALL'LAST /= 10 THEN
FAILED ( "WRONG VALUE FOR SMALL'LAST" );
END IF;
IF NOINTEGER'FIRST /= 5 THEN
FAILED ( "WRONG VALUE FOR NOINTEGER'FIRST" );
END IF;
IF NOINTEGER'LAST /= -7 THEN
FAILED ( "WRONG VALUE FOR NOINTEGER'LAST" );
END IF;
IF INT'FIRST /= -6 THEN
FAILED ( "WRONG VALUE FOR INT'FIRST" );
END IF;
IF INT'LAST /= 6 THEN
FAILED ( "WRONG VALUE FOR INT'LAST" );
END IF;
IF SINT'FIRST /= -4 THEN
FAILED ( "WRONG VALUE FOR SINT'FIRST" );
END IF;
IF SINT'LAST /= 4 THEN
FAILED ( "WRONG VALUE FOR SINT'LAST" );
END IF;
IF NOINT'FIRST /= 1 THEN
FAILED ( "WRONG VALUE FOR NOINT'FIRST" );
END IF;
IF NOINT'LAST /= -1 THEN
FAILED ( "WRONG VALUE FOR NOINT'LAST" );
END IF;
IF NEWINT'FIRST /= -9 THEN
FAILED ( "WRONG VALUE FOR NEWINT'FIRST" );
END IF;
IF NEWINT'LAST /= -2 THEN
FAILED ( "WRONG VALUE FOR NEWINT'LAST" );
END IF;
IF SNEWINT'FIRST /= -7 THEN
FAILED ( "WRONG VALUE FOR SNEWINT'FIRST" );
END IF;
IF SNEWINT'LAST /= -5 THEN
FAILED ( "WRONG VALUE FOR SNEWINT'LAST" );
END IF;
IF NONEWINT'FIRST /= 3 THEN
FAILED ( "WRONG VALUE FOR NONEWINT'FIRST" );
END IF;
IF NONEWINT'LAST /= -15 THEN
FAILED ( "WRONG VALUE FOR NONEWINT'LAST" );
END IF;
END;
RESULT;
END C35503O;
| 36.166667 | 79 | 0.544218 |
3d4b56dbfad799859063f9547f2a13ab8d51d739 | 143 | ads | Ada | 1-base/math/source/precision/float/applied/float_math-statistics.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 1-base/math/source/precision/float/applied/float_math-statistics.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/applied/float_math-statistics.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
any_Math.any_Statistics;
package float_Math.Statistics is new float_Math.any_Statistics;
pragma Pure (float_Math.Statistics);
| 20.428571 | 68 | 0.783217 |
3d0934c8d69e5794b79923f915d4db4299d9485f | 52,704 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/exp_intr.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/exp_intr.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/exp_intr.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ I N T R --
-- --
-- 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 Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Expander; use Expander;
with Exp_Atag; use Exp_Atag;
with Exp_Ch4; use Exp_Ch4;
with Exp_Ch7; use Exp_Ch7;
with Exp_Ch11; use Exp_Ch11;
with Exp_Code; use Exp_Code;
with Exp_Fixd; use Exp_Fixd;
with Exp_Util; use Exp_Util;
with Freeze; use Freeze;
with Inline; use Inline;
with Nmake; use Nmake;
with Nlists; use Nlists;
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_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
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 Stand; use Stand;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Urealp; use Urealp;
package body Exp_Intr is
-----------------------
-- Local Subprograms --
-----------------------
procedure Expand_Binary_Operator_Call (N : Node_Id);
-- Expand a call to an intrinsic arithmetic operator when the operand
-- types or sizes are not identical.
procedure Expand_Is_Negative (N : Node_Id);
-- Expand a call to the intrinsic Is_Negative function
procedure Expand_Dispatching_Constructor_Call (N : Node_Id);
-- Expand a call to an instantiation of Generic_Dispatching_Constructor
-- into a dispatching call to the actual subprogram associated with the
-- Constructor formal subprogram, passing it the Parameters actual of
-- the call to the instantiation and dispatching based on call's Tag
-- parameter.
procedure Expand_Exception_Call (N : Node_Id; Ent : RE_Id);
-- Expand a call to Exception_Information/Message/Name. The first
-- parameter, N, is the node for the function call, and Ent is the
-- entity for the corresponding routine in the Ada.Exceptions package.
procedure Expand_Import_Call (N : Node_Id);
-- Expand a call to Import_Address/Longest_Integer/Value. The parameter
-- N is the node for the function call.
procedure Expand_Shift (N : Node_Id; E : Entity_Id; K : Node_Kind);
-- Expand an intrinsic shift operation, N and E are from the call to
-- Expand_Intrinsic_Call (call node and subprogram spec entity) and
-- K is the kind for the shift node
procedure Expand_Unc_Conversion (N : Node_Id; E : Entity_Id);
-- Expand a call to an instantiation of Unchecked_Conversion into a node
-- N_Unchecked_Type_Conversion.
procedure Expand_Unc_Deallocation (N : Node_Id);
-- Expand a call to an instantiation of Unchecked_Deallocation into a node
-- N_Free_Statement and appropriate context.
procedure Expand_To_Address (N : Node_Id);
procedure Expand_To_Pointer (N : Node_Id);
-- Expand a call to corresponding function, declared in an instance of
-- System.Address_To_Access_Conversions.
procedure Expand_Source_Info (N : Node_Id; Nam : Name_Id);
-- Rewrite the node as the appropriate string literal or positive
-- constant. Nam is the name of one of the intrinsics declared in
-- GNAT.Source_Info; see g-souinf.ads for documentation of these
-- intrinsics.
procedure Append_Entity_Name (Buf : in out Bounded_String; E : Entity_Id);
-- Recursive procedure to construct string for qualified name of enclosing
-- program unit. The qualification stops at an enclosing scope has no
-- source name (block or loop). If entity is a subprogram instance, skip
-- enclosing wrapper package. The name is appended to Buf.
---------------------
-- Add_Source_Info --
---------------------
procedure Add_Source_Info
(Buf : in out Bounded_String;
Loc : Source_Ptr;
Nam : Name_Id)
is
begin
case Nam is
when Name_Line =>
Append (Buf, Nat (Get_Logical_Line_Number (Loc)));
when Name_File =>
Append_Decoded (Buf, Reference_Name (Get_Source_File_Index (Loc)));
when Name_Source_Location =>
Build_Location_String (Buf, Loc);
when Name_Enclosing_Entity =>
-- Skip enclosing blocks to reach enclosing unit
declare
Ent : Entity_Id := Current_Scope;
begin
while Present (Ent) loop
exit when not Ekind_In (Ent, E_Block, E_Loop);
Ent := Scope (Ent);
end loop;
-- Ent now points to the relevant defining entity
Append_Entity_Name (Buf, Ent);
end;
when Name_Compilation_ISO_Date =>
Append (Buf, Opt.Compilation_Time (1 .. 10));
when Name_Compilation_Date =>
declare
subtype S13 is String (1 .. 3);
Months : constant array (1 .. 12) of S13 :=
("Jan", "Feb", "Mar", "Apr", "May", "Jun",
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec");
M1 : constant Character := Opt.Compilation_Time (6);
M2 : constant Character := Opt.Compilation_Time (7);
MM : constant Natural range 1 .. 12 :=
(Character'Pos (M1) - Character'Pos ('0')) * 10 +
(Character'Pos (M2) - Character'Pos ('0'));
begin
-- Reformat ISO date into MMM DD YYYY (__DATE__) format
Append (Buf, Months (MM));
Append (Buf, ' ');
Append (Buf, Opt.Compilation_Time (9 .. 10));
Append (Buf, ' ');
Append (Buf, Opt.Compilation_Time (1 .. 4));
end;
when Name_Compilation_Time =>
Append (Buf, Opt.Compilation_Time (12 .. 19));
when others =>
raise Program_Error;
end case;
end Add_Source_Info;
-----------------------
-- Append_Entity_Name --
-----------------------
procedure Append_Entity_Name (Buf : in out Bounded_String; E : Entity_Id) is
Temp : Bounded_String;
procedure Inner (E : Entity_Id);
-- Inner recursive routine, keep outer routine nonrecursive to ease
-- debugging when we get strange results from this routine.
-----------
-- Inner --
-----------
procedure Inner (E : Entity_Id) is
begin
-- If entity has an internal name, skip by it, and print its scope.
-- Note that we strip a final R from the name before the test; this
-- is needed for some cases of instantiations.
declare
E_Name : Bounded_String;
begin
Append (E_Name, Chars (E));
if E_Name.Chars (E_Name.Length) = 'R' then
E_Name.Length := E_Name.Length - 1;
end if;
if Is_Internal_Name (E_Name) then
Inner (Scope (E));
return;
end if;
end;
-- Just print entity name if its scope is at the outer level
if Scope (E) = Standard_Standard then
null;
-- If scope comes from source, write scope and entity
elsif Comes_From_Source (Scope (E)) then
Append_Entity_Name (Temp, Scope (E));
Append (Temp, '.');
-- If in wrapper package skip past it
elsif Is_Wrapper_Package (Scope (E)) then
Append_Entity_Name (Temp, Scope (Scope (E)));
Append (Temp, '.');
-- Otherwise nothing to output (happens in unnamed block statements)
else
null;
end if;
-- Output the name
declare
E_Name : Bounded_String;
begin
Append_Unqualified_Decoded (E_Name, Chars (E));
-- Remove trailing upper-case letters from the name (useful for
-- dealing with some cases of internal names generated in the case
-- of references from within a generic).
while E_Name.Length > 1
and then E_Name.Chars (E_Name.Length) in 'A' .. 'Z'
loop
E_Name.Length := E_Name.Length - 1;
end loop;
-- Adjust casing appropriately (gets name from source if possible)
Adjust_Name_Case (E_Name, Sloc (E));
Append (Temp, E_Name);
end;
end Inner;
-- Start of processing for Append_Entity_Name
begin
Inner (E);
Append (Buf, Temp);
end Append_Entity_Name;
---------------------------------
-- Expand_Binary_Operator_Call --
---------------------------------
procedure Expand_Binary_Operator_Call (N : Node_Id) is
T1 : constant Entity_Id := Underlying_Type (Etype (Left_Opnd (N)));
T2 : constant Entity_Id := Underlying_Type (Etype (Right_Opnd (N)));
TR : constant Entity_Id := Etype (N);
T3 : Entity_Id;
Res : Node_Id;
Siz : constant Uint := UI_Max (RM_Size (T1), RM_Size (T2));
-- Maximum of operand sizes
begin
-- Nothing to do if the operands have the same modular type
if Base_Type (T1) = Base_Type (T2)
and then Is_Modular_Integer_Type (T1)
then
return;
end if;
-- Use Unsigned_32 for sizes of 32 or below, else Unsigned_64
if Siz > 32 then
T3 := RTE (RE_Unsigned_64);
else
T3 := RTE (RE_Unsigned_32);
end if;
-- Copy operator node, and reset type and entity fields, for
-- subsequent reanalysis.
Res := New_Copy (N);
Set_Etype (Res, T3);
case Nkind (N) is
when N_Op_And => Set_Entity (Res, Standard_Op_And);
when N_Op_Or => Set_Entity (Res, Standard_Op_Or);
when N_Op_Xor => Set_Entity (Res, Standard_Op_Xor);
when others => raise Program_Error;
end case;
-- Convert operands to large enough intermediate type
Set_Left_Opnd (Res,
Unchecked_Convert_To (T3, Relocate_Node (Left_Opnd (N))));
Set_Right_Opnd (Res,
Unchecked_Convert_To (T3, Relocate_Node (Right_Opnd (N))));
-- Analyze and resolve result formed by conversion to target type
Rewrite (N, Unchecked_Convert_To (TR, Res));
Analyze_And_Resolve (N, TR);
end Expand_Binary_Operator_Call;
-----------------------------------------
-- Expand_Dispatching_Constructor_Call --
-----------------------------------------
-- Transform a call to an instantiation of Generic_Dispatching_Constructor
-- of the form:
-- GDC_Instance (The_Tag, Parameters'Access)
-- to a class-wide conversion of a dispatching call to the actual
-- associated with the formal subprogram Construct, designating The_Tag
-- as the controlling tag of the call:
-- T'Class (Construct'Actual (Params)) -- Controlling tag is The_Tag
-- which will eventually be expanded to the following:
-- T'Class (The_Tag.all (Construct'Actual'Index).all (Params))
-- A class-wide membership test is also generated, preceding the call, to
-- ensure that the controlling tag denotes a type in T'Class.
procedure Expand_Dispatching_Constructor_Call (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Tag_Arg : constant Node_Id := First_Actual (N);
Param_Arg : constant Node_Id := Next_Actual (Tag_Arg);
Subp_Decl : constant Node_Id := Parent (Parent (Entity (Name (N))));
Inst_Pkg : constant Node_Id := Parent (Subp_Decl);
Act_Rename : Node_Id;
Act_Constr : Entity_Id;
Iface_Tag : Node_Id := Empty;
Cnstr_Call : Node_Id;
Result_Typ : Entity_Id;
begin
-- Remove side effects from tag argument early, before rewriting
-- the dispatching constructor call, as Remove_Side_Effects relies
-- on Tag_Arg's Parent link properly attached to the tree (once the
-- call is rewritten, the Parent is inconsistent as it points to the
-- rewritten node, which is not the syntactic parent of the Tag_Arg
-- anymore).
Remove_Side_Effects (Tag_Arg);
-- Check that we have a proper tag
Insert_Action (N,
Make_Implicit_If_Statement (N,
Condition => Make_Op_Eq (Loc,
Left_Opnd => New_Copy_Tree (Tag_Arg),
Right_Opnd => New_Occurrence_Of (RTE (RE_No_Tag), Loc)),
Then_Statements => New_List (
Make_Raise_Statement (Loc,
New_Occurrence_Of (RTE (RE_Tag_Error), Loc)))));
-- Check that it is not the tag of an abstract type
Insert_Action (N,
Make_Implicit_If_Statement (N,
Condition => Make_Function_Call (Loc,
Name =>
New_Occurrence_Of (RTE (RE_Type_Is_Abstract), Loc),
Parameter_Associations => New_List (New_Copy_Tree (Tag_Arg))),
Then_Statements => New_List (
Make_Raise_Statement (Loc,
New_Occurrence_Of (RTE (RE_Tag_Error), Loc)))));
-- The subprogram is the third actual in the instantiation, and is
-- retrieved from the corresponding renaming declaration. However,
-- freeze nodes may appear before, so we retrieve the declaration
-- with an explicit loop.
Act_Rename := First (Visible_Declarations (Inst_Pkg));
while Nkind (Act_Rename) /= N_Subprogram_Renaming_Declaration loop
Next (Act_Rename);
end loop;
Act_Constr := Entity (Name (Act_Rename));
Result_Typ := Class_Wide_Type (Etype (Act_Constr));
-- Check that the accessibility level of the tag is no deeper than that
-- of the constructor function.
Insert_Action (N,
Make_Implicit_If_Statement (N,
Condition =>
Make_Op_Gt (Loc,
Left_Opnd =>
Build_Get_Access_Level (Loc, New_Copy_Tree (Tag_Arg)),
Right_Opnd =>
Make_Integer_Literal (Loc, Scope_Depth (Act_Constr))),
Then_Statements => New_List (
Make_Raise_Statement (Loc,
New_Occurrence_Of (RTE (RE_Tag_Error), Loc)))));
if Is_Interface (Etype (Act_Constr)) then
-- If the result type is not known to be a parent of Tag_Arg then we
-- need to locate the tag of the secondary dispatch table.
if not Is_Ancestor (Etype (Result_Typ), Etype (Tag_Arg),
Use_Full_View => True)
and then Tagged_Type_Expansion
then
-- Obtain the reference to the Ada.Tags service before generating
-- the Object_Declaration node to ensure that if this service is
-- not available in the runtime then we generate a clear error.
declare
Fname : constant Node_Id :=
New_Occurrence_Of (RTE (RE_Secondary_Tag), Loc);
begin
pragma Assert (not Is_Interface (Etype (Tag_Arg)));
-- The tag is the first entry in the dispatch table of the
-- return type of the constructor.
Iface_Tag :=
Make_Object_Declaration (Loc,
Defining_Identifier => Make_Temporary (Loc, 'V'),
Object_Definition =>
New_Occurrence_Of (RTE (RE_Tag), Loc),
Expression =>
Make_Function_Call (Loc,
Name => Fname,
Parameter_Associations => New_List (
Relocate_Node (Tag_Arg),
New_Occurrence_Of
(Node (First_Elmt
(Access_Disp_Table (Etype (Act_Constr)))),
Loc))));
Insert_Action (N, Iface_Tag);
end;
end if;
end if;
-- Create the call to the actual Constructor function
Cnstr_Call :=
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Act_Constr, Loc),
Parameter_Associations => New_List (Relocate_Node (Param_Arg)));
-- Establish its controlling tag from the tag passed to the instance
-- The tag may be given by a function call, in which case a temporary
-- should be generated now, to prevent out-of-order insertions during
-- the expansion of that call when stack-checking is enabled.
if Present (Iface_Tag) then
Set_Controlling_Argument (Cnstr_Call,
New_Occurrence_Of (Defining_Identifier (Iface_Tag), Loc));
else
Set_Controlling_Argument (Cnstr_Call,
Relocate_Node (Tag_Arg));
end if;
-- Rewrite and analyze the call to the instance as a class-wide
-- conversion of the call to the actual constructor.
Rewrite (N, Convert_To (Result_Typ, Cnstr_Call));
-- Do not generate a run-time check on the built object if tag
-- checks are suppressed for the result type or tagged type expansion
-- is disabled.
if Tag_Checks_Suppressed (Etype (Result_Typ))
or else not Tagged_Type_Expansion
then
null;
-- Generate a class-wide membership test to ensure that the call's tag
-- argument denotes a type within the class. We must keep separate the
-- case in which the Result_Type of the constructor function is a tagged
-- type from the case in which it is an abstract interface because the
-- run-time subprogram required to check these cases differ (and have
-- one difference in their parameters profile).
-- Call CW_Membership if the Result_Type is a tagged type to look for
-- the tag in the table of ancestor tags.
elsif not Is_Interface (Result_Typ) then
declare
Obj_Tag_Node : Node_Id := New_Copy_Tree (Tag_Arg);
CW_Test_Node : Node_Id;
begin
Build_CW_Membership (Loc,
Obj_Tag_Node => Obj_Tag_Node,
Typ_Tag_Node =>
New_Occurrence_Of (
Node (First_Elmt (Access_Disp_Table (
Root_Type (Result_Typ)))), Loc),
Related_Nod => N,
New_Node => CW_Test_Node);
Insert_Action (N,
Make_Implicit_If_Statement (N,
Condition =>
Make_Op_Not (Loc, CW_Test_Node),
Then_Statements =>
New_List (Make_Raise_Statement (Loc,
New_Occurrence_Of (RTE (RE_Tag_Error), Loc)))));
end;
-- Call IW_Membership test if the Result_Type is an abstract interface
-- to look for the tag in the table of interface tags.
else
Insert_Action (N,
Make_Implicit_If_Statement (N,
Condition =>
Make_Op_Not (Loc,
Make_Function_Call (Loc,
Name => New_Occurrence_Of (RTE (RE_IW_Membership), Loc),
Parameter_Associations => New_List (
Make_Attribute_Reference (Loc,
Prefix => New_Copy_Tree (Tag_Arg),
Attribute_Name => Name_Address),
New_Occurrence_Of (
Node (First_Elmt (Access_Disp_Table (
Root_Type (Result_Typ)))), Loc)))),
Then_Statements =>
New_List (
Make_Raise_Statement (Loc,
Name => New_Occurrence_Of (RTE (RE_Tag_Error), Loc)))));
end if;
Analyze_And_Resolve (N, Etype (Act_Constr));
end Expand_Dispatching_Constructor_Call;
---------------------------
-- Expand_Exception_Call --
---------------------------
-- If the function call is not within an exception handler, then the call
-- is replaced by a null string. Otherwise the appropriate routine in
-- Ada.Exceptions is called passing the choice parameter specification
-- from the enclosing handler. If the enclosing handler lacks a choice
-- parameter, then one is supplied.
procedure Expand_Exception_Call (N : Node_Id; Ent : RE_Id) is
Loc : constant Source_Ptr := Sloc (N);
P : Node_Id;
E : Entity_Id;
begin
-- Climb up parents to see if we are in exception handler
P := Parent (N);
loop
-- Case of not in exception handler, replace by null string
if No (P) then
Rewrite (N,
Make_String_Literal (Loc,
Strval => ""));
exit;
-- Case of in exception handler
elsif Nkind (P) = N_Exception_Handler then
-- Handler cannot be used for a local raise, and furthermore, this
-- is a violation of the No_Exception_Propagation restriction.
Set_Local_Raise_Not_OK (P);
Check_Restriction (No_Exception_Propagation, N);
-- If no choice parameter present, then put one there. Note that
-- we do not need to put it on the entity chain, since no one will
-- be referencing it by normal visibility methods.
if No (Choice_Parameter (P)) then
E := Make_Temporary (Loc, 'E');
Set_Choice_Parameter (P, E);
Set_Ekind (E, E_Variable);
Set_Etype (E, RTE (RE_Exception_Occurrence));
Set_Scope (E, Current_Scope);
end if;
Rewrite (N,
Make_Function_Call (Loc,
Name => New_Occurrence_Of (RTE (Ent), Loc),
Parameter_Associations => New_List (
New_Occurrence_Of (Choice_Parameter (P), Loc))));
exit;
-- Keep climbing
else
P := Parent (P);
end if;
end loop;
Analyze_And_Resolve (N, Standard_String);
end Expand_Exception_Call;
------------------------
-- Expand_Import_Call --
------------------------
-- The function call must have a static string as its argument. We create
-- a dummy variable which uses this string as the external name in an
-- Import pragma. The result is then obtained as the address of this
-- dummy variable, converted to the appropriate target type.
procedure Expand_Import_Call (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Ent : constant Entity_Id := Entity (Name (N));
Str : constant Node_Id := First_Actual (N);
Dum : constant Entity_Id := Make_Temporary (Loc, 'D');
begin
Insert_Actions (N, New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Dum,
Object_Definition =>
New_Occurrence_Of (Standard_Character, Loc)),
Make_Pragma (Loc,
Chars => Name_Import,
Pragma_Argument_Associations => New_List (
Make_Pragma_Argument_Association (Loc,
Expression => Make_Identifier (Loc, Name_Ada)),
Make_Pragma_Argument_Association (Loc,
Expression => Make_Identifier (Loc, Chars (Dum))),
Make_Pragma_Argument_Association (Loc,
Chars => Name_Link_Name,
Expression => Relocate_Node (Str))))));
Rewrite (N,
Unchecked_Convert_To (Etype (Ent),
Make_Attribute_Reference (Loc,
Prefix => Make_Identifier (Loc, Chars (Dum)),
Attribute_Name => Name_Address)));
Analyze_And_Resolve (N, Etype (Ent));
end Expand_Import_Call;
---------------------------
-- Expand_Intrinsic_Call --
---------------------------
procedure Expand_Intrinsic_Call (N : Node_Id; E : Entity_Id) is
Nam : Name_Id;
begin
-- If an external name is specified for the intrinsic, it is handled
-- by the back-end: leave the call node unchanged for now.
if Present (Interface_Name (E)) then
return;
end if;
-- If the intrinsic subprogram is generic, gets its original name
if Present (Parent (E))
and then Present (Generic_Parent (Parent (E)))
then
Nam := Chars (Generic_Parent (Parent (E)));
else
Nam := Chars (E);
end if;
if Nam = Name_Asm then
Expand_Asm_Call (N);
elsif Nam = Name_Divide then
Expand_Decimal_Divide_Call (N);
elsif Nam = Name_Exception_Information then
Expand_Exception_Call (N, RE_Exception_Information);
elsif Nam = Name_Exception_Message then
Expand_Exception_Call (N, RE_Exception_Message);
elsif Nam = Name_Exception_Name then
Expand_Exception_Call (N, RE_Exception_Name_Simple);
elsif Nam = Name_Generic_Dispatching_Constructor then
Expand_Dispatching_Constructor_Call (N);
elsif Nam_In (Nam, Name_Import_Address,
Name_Import_Largest_Value,
Name_Import_Value)
then
Expand_Import_Call (N);
elsif Nam = Name_Is_Negative then
Expand_Is_Negative (N);
elsif Nam = Name_Rotate_Left then
Expand_Shift (N, E, N_Op_Rotate_Left);
elsif Nam = Name_Rotate_Right then
Expand_Shift (N, E, N_Op_Rotate_Right);
elsif Nam = Name_Shift_Left then
Expand_Shift (N, E, N_Op_Shift_Left);
elsif Nam = Name_Shift_Right then
Expand_Shift (N, E, N_Op_Shift_Right);
elsif Nam = Name_Shift_Right_Arithmetic then
Expand_Shift (N, E, N_Op_Shift_Right_Arithmetic);
elsif Nam = Name_Unchecked_Conversion then
Expand_Unc_Conversion (N, E);
elsif Nam = Name_Unchecked_Deallocation then
Expand_Unc_Deallocation (N);
elsif Nam = Name_To_Address then
Expand_To_Address (N);
elsif Nam = Name_To_Pointer then
Expand_To_Pointer (N);
elsif Nam_In (Nam, Name_File,
Name_Line,
Name_Source_Location,
Name_Enclosing_Entity,
Name_Compilation_ISO_Date,
Name_Compilation_Date,
Name_Compilation_Time)
then
Expand_Source_Info (N, Nam);
-- If we have a renaming, expand the call to the original operation,
-- which must itself be intrinsic, since renaming requires matching
-- conventions and this has already been checked.
elsif Present (Alias (E)) then
Expand_Intrinsic_Call (N, Alias (E));
elsif Nkind (N) in N_Binary_Op then
Expand_Binary_Operator_Call (N);
-- The only other case is where an external name was specified, since
-- this is the only way that an otherwise unrecognized name could
-- escape the checking in Sem_Prag. Nothing needs to be done in such
-- a case, since we pass such a call to the back end unchanged.
else
null;
end if;
end Expand_Intrinsic_Call;
------------------------
-- Expand_Is_Negative --
------------------------
procedure Expand_Is_Negative (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Opnd : constant Node_Id := Relocate_Node (First_Actual (N));
begin
-- We replace the function call by the following expression
-- if Opnd < 0.0 then
-- True
-- else
-- if Opnd > 0.0 then
-- False;
-- else
-- Float_Unsigned!(Float (Opnd)) /= 0
-- end if;
-- end if;
Rewrite (N,
Make_If_Expression (Loc,
Expressions => New_List (
Make_Op_Lt (Loc,
Left_Opnd => Duplicate_Subexpr (Opnd),
Right_Opnd => Make_Real_Literal (Loc, Ureal_0)),
New_Occurrence_Of (Standard_True, Loc),
Make_If_Expression (Loc,
Expressions => New_List (
Make_Op_Gt (Loc,
Left_Opnd => Duplicate_Subexpr_No_Checks (Opnd),
Right_Opnd => Make_Real_Literal (Loc, Ureal_0)),
New_Occurrence_Of (Standard_False, Loc),
Make_Op_Ne (Loc,
Left_Opnd =>
Unchecked_Convert_To
(RTE (RE_Float_Unsigned),
Convert_To
(Standard_Float,
Duplicate_Subexpr_No_Checks (Opnd))),
Right_Opnd =>
Make_Integer_Literal (Loc, 0)))))));
Analyze_And_Resolve (N, Standard_Boolean);
end Expand_Is_Negative;
------------------
-- Expand_Shift --
------------------
-- This procedure is used to convert a call to a shift function to the
-- corresponding operator node. This conversion is not done by the usual
-- circuit for converting calls to operator functions (e.g. "+"(1,2)) to
-- operator nodes, because shifts are not predefined operators.
-- As a result, whenever a shift is used in the source program, it will
-- remain as a call until converted by this routine to the operator node
-- form which the back end is expecting to see.
-- Note: it is possible for the expander to generate shift operator nodes
-- directly, which will be analyzed in the normal manner by calling Analyze
-- and Resolve. Such shift operator nodes will not be seen by Expand_Shift.
procedure Expand_Shift (N : Node_Id; E : Entity_Id; K : Node_Kind) is
Entyp : constant Entity_Id := Etype (E);
Left : constant Node_Id := First_Actual (N);
Loc : constant Source_Ptr := Sloc (N);
Right : constant Node_Id := Next_Actual (Left);
Ltyp : constant Node_Id := Etype (Left);
Rtyp : constant Node_Id := Etype (Right);
Typ : constant Entity_Id := Etype (N);
Snode : Node_Id;
begin
Snode := New_Node (K, Loc);
Set_Right_Opnd (Snode, Relocate_Node (Right));
Set_Chars (Snode, Chars (E));
Set_Etype (Snode, Base_Type (Entyp));
Set_Entity (Snode, E);
if Compile_Time_Known_Value (Type_High_Bound (Rtyp))
and then Expr_Value (Type_High_Bound (Rtyp)) < Esize (Ltyp)
then
Set_Shift_Count_OK (Snode, True);
end if;
if Typ = Entyp then
-- Note that we don't call Analyze and Resolve on this node, because
-- it already got analyzed and resolved when it was a function call.
Set_Left_Opnd (Snode, Relocate_Node (Left));
Rewrite (N, Snode);
Set_Analyzed (N);
-- However, we do call the expander, so that the expansion for
-- rotates and shift_right_arithmetic happens if Modify_Tree_For_C
-- is set.
if Expander_Active then
Expand (N);
end if;
else
-- If the context type is not the type of the operator, it is an
-- inherited operator for a derived type. Wrap the node in a
-- conversion so that it is type-consistent for possible further
-- expansion (e.g. within a lock-free protected type).
Set_Left_Opnd (Snode,
Unchecked_Convert_To (Base_Type (Entyp), Relocate_Node (Left)));
Rewrite (N, Unchecked_Convert_To (Typ, Snode));
-- Analyze and resolve result formed by conversion to target type
Analyze_And_Resolve (N, Typ);
end if;
end Expand_Shift;
------------------------
-- Expand_Source_Info --
------------------------
procedure Expand_Source_Info (N : Node_Id; Nam : Name_Id) is
Loc : constant Source_Ptr := Sloc (N);
begin
-- Integer cases
if Nam = Name_Line then
Rewrite (N,
Make_Integer_Literal (Loc,
Intval => UI_From_Int (Int (Get_Logical_Line_Number (Loc)))));
Analyze_And_Resolve (N, Standard_Positive);
-- String cases
else
declare
Buf : Bounded_String;
begin
Add_Source_Info (Buf, Loc, Nam);
Rewrite (N, Make_String_Literal (Loc, Strval => +Buf));
Analyze_And_Resolve (N, Standard_String);
end;
end if;
Set_Is_Static_Expression (N);
end Expand_Source_Info;
---------------------------
-- Expand_Unc_Conversion --
---------------------------
procedure Expand_Unc_Conversion (N : Node_Id; E : Entity_Id) is
Func : constant Entity_Id := Entity (Name (N));
Conv : Node_Id;
Ftyp : Entity_Id;
Ttyp : Entity_Id;
begin
-- Rewrite as unchecked conversion node. Note that we must convert
-- the operand to the formal type of the input parameter of the
-- function, so that the resulting N_Unchecked_Type_Conversion
-- call indicates the correct types for Gigi.
-- Right now, we only do this if a scalar type is involved. It is
-- not clear if it is needed in other cases. If we do attempt to
-- do the conversion unconditionally, it crashes 3411-018. To be
-- investigated further ???
Conv := Relocate_Node (First_Actual (N));
Ftyp := Etype (First_Formal (Func));
if Is_Scalar_Type (Ftyp) then
Conv := Convert_To (Ftyp, Conv);
Set_Parent (Conv, N);
Analyze_And_Resolve (Conv);
end if;
-- The instantiation of Unchecked_Conversion creates a wrapper package,
-- and the target type is declared as a subtype of the actual. Recover
-- the actual, which is the subtype indic. in the subtype declaration
-- for the target type. This is semantically correct, and avoids
-- anomalies with access subtypes. For entities, leave type as is.
-- We do the analysis here, because we do not want the compiler
-- to try to optimize or otherwise reorganize the unchecked
-- conversion node.
Ttyp := Etype (E);
if Is_Entity_Name (Conv) then
null;
elsif Nkind (Parent (Ttyp)) = N_Subtype_Declaration then
Ttyp := Entity (Subtype_Indication (Parent (Etype (E))));
elsif Is_Itype (Ttyp) then
Ttyp :=
Entity (Subtype_Indication (Associated_Node_For_Itype (Ttyp)));
else
raise Program_Error;
end if;
Rewrite (N, Unchecked_Convert_To (Ttyp, Conv));
Set_Etype (N, Ttyp);
Set_Analyzed (N);
if Nkind (N) = N_Unchecked_Type_Conversion then
Expand_N_Unchecked_Type_Conversion (N);
end if;
end Expand_Unc_Conversion;
-----------------------------
-- Expand_Unc_Deallocation --
-----------------------------
procedure Expand_Unc_Deallocation (N : Node_Id) is
Arg : constant Node_Id := First_Actual (N);
Loc : constant Source_Ptr := Sloc (N);
Typ : constant Entity_Id := Etype (Arg);
Desig_Typ : constant Entity_Id := Designated_Type (Typ);
Needs_Fin : constant Boolean := Needs_Finalization (Desig_Typ);
Root_Typ : constant Entity_Id := Underlying_Type (Root_Type (Typ));
Pool : constant Entity_Id := Associated_Storage_Pool (Root_Typ);
Stmts : constant List_Id := New_List;
Arg_Known_Non_Null : constant Boolean := Known_Non_Null (N);
-- This captures whether we know the argument to be non-null so that
-- we can avoid the test. The reason that we need to capture this is
-- that we analyze some generated statements before properly attaching
-- them to the tree, and that can disturb current value settings.
Exceptions_OK : constant Boolean :=
not Restriction_Active (No_Exception_Propagation);
Abrt_Blk : Node_Id := Empty;
Abrt_Blk_Id : Entity_Id;
Abrt_HSS : Node_Id;
AUD : Entity_Id;
Fin_Blk : Node_Id;
Fin_Call : Node_Id;
Fin_Data : Finalization_Exception_Data;
Free_Arg : Node_Id;
Free_Nod : Node_Id;
Gen_Code : Node_Id;
Obj_Ref : Node_Id;
begin
-- Nothing to do if we know the argument is null
if Known_Null (N) then
return;
end if;
-- Processing for pointer to controlled types. Generate:
-- Abrt : constant Boolean := ...;
-- Ex : Exception_Occurrence;
-- Raised : Boolean := False;
-- begin
-- Abort_Defer;
-- begin
-- [Deep_]Finalize (Obj_Ref);
-- exception
-- when others =>
-- if not Raised then
-- Raised := True;
-- Save_Occurrence (Ex, Get_Current_Excep.all.all);
-- end;
-- at end
-- Abort_Undefer_Direct;
-- end;
-- Depending on whether exception propagation is enabled and/or aborts
-- are allowed, the generated code may lack block statements.
if Needs_Fin then
Obj_Ref :=
Make_Explicit_Dereference (Loc,
Prefix => Duplicate_Subexpr_No_Checks (Arg));
-- If the designated type is tagged, the finalization call must
-- dispatch because the designated type may not be the actual type
-- of the object. If the type is synchronized, the deallocation
-- applies to the corresponding record type.
if Is_Tagged_Type (Desig_Typ) then
if Is_Concurrent_Type (Desig_Typ) then
Obj_Ref :=
Unchecked_Convert_To
(Class_Wide_Type (Corresponding_Record_Type (Desig_Typ)),
Obj_Ref);
elsif not Is_Class_Wide_Type (Desig_Typ) then
Obj_Ref :=
Unchecked_Convert_To (Class_Wide_Type (Desig_Typ), Obj_Ref);
end if;
-- Otherwise the designated type is untagged. Set the type of the
-- dereference explicitly to force a conversion when needed given
-- that [Deep_]Finalize may be inherited from a parent type.
else
Set_Etype (Obj_Ref, Desig_Typ);
end if;
-- Generate:
-- [Deep_]Finalize (Obj_Ref);
Fin_Call := Make_Final_Call (Obj_Ref => Obj_Ref, Typ => Desig_Typ);
-- Generate:
-- Abrt : constant Boolean := ...;
-- Ex : Exception_Occurrence;
-- Raised : Boolean := False;
-- begin
-- <Fin_Call>
-- exception
-- when others =>
-- if not Raised then
-- Raised := True;
-- Save_Occurrence (Ex, Get_Current_Excep.all.all);
-- end;
if Exceptions_OK then
Build_Object_Declarations (Fin_Data, Stmts, Loc);
Fin_Blk :=
Make_Block_Statement (Loc,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (Fin_Call),
Exception_Handlers => New_List (
Build_Exception_Handler (Fin_Data))));
-- Otherwise exception propagation is not allowed
else
Fin_Blk := Fin_Call;
end if;
-- The finalization action must be protected by an abort defer and
-- undefer pair when aborts are allowed. Generate:
-- begin
-- Abort_Defer;
-- <Fin_Blk>
-- at end
-- Abort_Undefer_Direct;
-- end;
if Abort_Allowed then
AUD := RTE (RE_Abort_Undefer_Direct);
Abrt_HSS :=
Make_Handled_Sequence_Of_Statements (Loc,
Statements => New_List (
Build_Runtime_Call (Loc, RE_Abort_Defer),
Fin_Blk),
At_End_Proc => New_Occurrence_Of (AUD, Loc));
Abrt_Blk :=
Make_Block_Statement (Loc,
Handled_Statement_Sequence => Abrt_HSS);
Add_Block_Identifier (Abrt_Blk, Abrt_Blk_Id);
Expand_At_End_Handler (Abrt_HSS, Abrt_Blk_Id);
-- Present the Abort_Undefer_Direct function to the backend so
-- that it can inline the call to the function.
Add_Inlined_Body (AUD, N);
-- Otherwise aborts are not allowed
else
Abrt_Blk := Fin_Blk;
end if;
Append_To (Stmts, Abrt_Blk);
end if;
-- For a task type, call Free_Task before freeing the ATCB. We used to
-- detect the case of Abort followed by a Free here, because the Free
-- wouldn't actually free if it happens before the aborted task actually
-- terminates. The warning was removed, because Free now works properly
-- (the task will be freed once it terminates).
if Is_Task_Type (Desig_Typ) then
Append_To (Stmts,
Cleanup_Task (N, Duplicate_Subexpr_No_Checks (Arg)));
-- For composite types that contain tasks, recurse over the structure
-- to build the selectors for the task subcomponents.
elsif Has_Task (Desig_Typ) then
if Is_Array_Type (Desig_Typ) then
Append_List_To (Stmts, Cleanup_Array (N, Arg, Desig_Typ));
elsif Is_Record_Type (Desig_Typ) then
Append_List_To (Stmts, Cleanup_Record (N, Arg, Desig_Typ));
end if;
end if;
-- Same for simple protected types. Eventually call Finalize_Protection
-- before freeing the PO for each protected component.
if Is_Simple_Protected_Type (Desig_Typ) then
Append_To (Stmts,
Cleanup_Protected_Object (N, Duplicate_Subexpr_No_Checks (Arg)));
elsif Has_Simple_Protected_Object (Desig_Typ) then
if Is_Array_Type (Desig_Typ) then
Append_List_To (Stmts, Cleanup_Array (N, Arg, Desig_Typ));
elsif Is_Record_Type (Desig_Typ) then
Append_List_To (Stmts, Cleanup_Record (N, Arg, Desig_Typ));
end if;
end if;
-- Normal processing for non-controlled types. The argument to free is
-- a renaming rather than a constant to ensure that the original context
-- is always set to null after the deallocation takes place.
Free_Arg := Duplicate_Subexpr_No_Checks (Arg, Renaming_Req => True);
Free_Nod := Make_Free_Statement (Loc, Empty);
Append_To (Stmts, Free_Nod);
Set_Storage_Pool (Free_Nod, Pool);
-- Attach to tree before analysis of generated subtypes below
Set_Parent (Stmts, Parent (N));
-- Deal with storage pool
if Present (Pool) then
-- Freeing the secondary stack is meaningless
if Is_RTE (Pool, RE_SS_Pool) then
null;
-- If the pool object is of a simple storage pool type, then attempt
-- to locate the type's Deallocate procedure, if any, and set the
-- free operation's procedure to call. If the type doesn't have a
-- Deallocate (which is allowed), then the actual will simply be set
-- to null.
elsif Present
(Get_Rep_Pragma (Etype (Pool), Name_Simple_Storage_Pool_Type))
then
declare
Pool_Typ : constant Entity_Id := Base_Type (Etype (Pool));
Dealloc : Entity_Id;
begin
Dealloc := Get_Name_Entity_Id (Name_Deallocate);
while Present (Dealloc) loop
if Scope (Dealloc) = Scope (Pool_Typ)
and then Present (First_Formal (Dealloc))
and then Etype (First_Formal (Dealloc)) = Pool_Typ
then
Set_Procedure_To_Call (Free_Nod, Dealloc);
exit;
else
Dealloc := Homonym (Dealloc);
end if;
end loop;
end;
-- Case of a class-wide pool type: make a dispatching call to
-- Deallocate through the class-wide Deallocate_Any.
elsif Is_Class_Wide_Type (Etype (Pool)) then
Set_Procedure_To_Call (Free_Nod, RTE (RE_Deallocate_Any));
-- Case of a specific pool type: make a statically bound call
else
Set_Procedure_To_Call
(Free_Nod, Find_Prim_Op (Etype (Pool), Name_Deallocate));
end if;
end if;
if Present (Procedure_To_Call (Free_Nod)) then
-- For all cases of a Deallocate call, the back-end needs to be able
-- to compute the size of the object being freed. This may require
-- some adjustments for objects of dynamic size.
--
-- If the type is class wide, we generate an implicit type with the
-- right dynamic size, so that the deallocate call gets the right
-- size parameter computed by GIGI. Same for an access to
-- unconstrained packed array.
if Is_Class_Wide_Type (Desig_Typ)
or else
(Is_Array_Type (Desig_Typ)
and then not Is_Constrained (Desig_Typ)
and then Is_Packed (Desig_Typ))
then
declare
Deref : constant Node_Id :=
Make_Explicit_Dereference (Loc,
Duplicate_Subexpr_No_Checks (Arg));
D_Subtyp : Node_Id;
D_Type : Entity_Id;
begin
-- Perform minor decoration as it is needed by the side effect
-- removal mechanism.
Set_Etype (Deref, Desig_Typ);
Set_Parent (Deref, Free_Nod);
D_Subtyp := Make_Subtype_From_Expr (Deref, Desig_Typ);
if Nkind (D_Subtyp) in N_Has_Entity then
D_Type := Entity (D_Subtyp);
else
D_Type := Make_Temporary (Loc, 'A');
Insert_Action (Deref,
Make_Subtype_Declaration (Loc,
Defining_Identifier => D_Type,
Subtype_Indication => D_Subtyp));
end if;
-- Force freezing at the point of the dereference. For the
-- class wide case, this avoids having the subtype frozen
-- before the equivalent type.
Freeze_Itype (D_Type, Deref);
Set_Actual_Designated_Subtype (Free_Nod, D_Type);
end;
end if;
end if;
-- Ada 2005 (AI-251): In case of abstract interface type we must
-- displace the pointer to reference the base of the object to
-- deallocate its memory, unless we're targetting a VM, in which case
-- no special processing is required.
-- Generate:
-- free (Base_Address (Obj_Ptr))
if Is_Interface (Directly_Designated_Type (Typ))
and then Tagged_Type_Expansion
then
Set_Expression (Free_Nod,
Unchecked_Convert_To (Typ,
Make_Function_Call (Loc,
Name =>
New_Occurrence_Of (RTE (RE_Base_Address), Loc),
Parameter_Associations => New_List (
Unchecked_Convert_To (RTE (RE_Address), Free_Arg)))));
-- Generate:
-- free (Obj_Ptr)
else
Set_Expression (Free_Nod, Free_Arg);
end if;
-- Only remaining step is to set result to null, or generate a raise of
-- Constraint_Error if the target object is "not null".
if Can_Never_Be_Null (Etype (Arg)) then
Append_To (Stmts,
Make_Raise_Constraint_Error (Loc,
Reason => CE_Access_Check_Failed));
else
declare
Lhs : constant Node_Id := Duplicate_Subexpr_No_Checks (Arg);
begin
Set_Assignment_OK (Lhs);
Append_To (Stmts,
Make_Assignment_Statement (Loc,
Name => Lhs,
Expression => Make_Null (Loc)));
end;
end if;
-- Generate a test of whether any earlier finalization raised an
-- exception, and in that case raise Program_Error with the previous
-- exception occurrence.
-- Generate:
-- if Raised and then not Abrt then
-- raise Program_Error; -- for restricted RTS
-- <or>
-- Raise_From_Controlled_Operation (E); -- all other cases
-- end if;
if Needs_Fin and then Exceptions_OK then
Append_To (Stmts, Build_Raise_Statement (Fin_Data));
end if;
-- If we know the argument is non-null, then make a block statement
-- that contains the required statements, no need for a test.
if Arg_Known_Non_Null then
Gen_Code :=
Make_Block_Statement (Loc,
Handled_Statement_Sequence =>
Make_Handled_Sequence_Of_Statements (Loc,
Statements => Stmts));
-- If the argument may be null, wrap the statements inside an IF that
-- does an explicit test to exclude the null case.
else
Gen_Code :=
Make_Implicit_If_Statement (N,
Condition =>
Make_Op_Ne (Loc,
Left_Opnd => Duplicate_Subexpr (Arg),
Right_Opnd => Make_Null (Loc)),
Then_Statements => Stmts);
end if;
-- Rewrite the call
Rewrite (N, Gen_Code);
Analyze (N);
end Expand_Unc_Deallocation;
-----------------------
-- Expand_To_Address --
-----------------------
procedure Expand_To_Address (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Arg : constant Node_Id := First_Actual (N);
Obj : Node_Id;
begin
Remove_Side_Effects (Arg);
Obj := Make_Explicit_Dereference (Loc, Relocate_Node (Arg));
Rewrite (N,
Make_If_Expression (Loc,
Expressions => New_List (
Make_Op_Eq (Loc,
Left_Opnd => New_Copy_Tree (Arg),
Right_Opnd => Make_Null (Loc)),
New_Occurrence_Of (RTE (RE_Null_Address), Loc),
Make_Attribute_Reference (Loc,
Prefix => Obj,
Attribute_Name => Name_Address))));
Analyze_And_Resolve (N, RTE (RE_Address));
end Expand_To_Address;
-----------------------
-- Expand_To_Pointer --
-----------------------
procedure Expand_To_Pointer (N : Node_Id) is
Arg : constant Node_Id := First_Actual (N);
begin
Rewrite (N, Unchecked_Convert_To (Etype (N), Arg));
Analyze (N);
end Expand_To_Pointer;
end Exp_Intr;
| 35.683142 | 79 | 0.574852 |
4dc48cdc632b80c854dc23150730985873d6d916 | 1,075 | ads | Ada | source/aspect/adam-aspect.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | source/aspect/adam-aspect.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | source/aspect/adam-aspect.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.Any,
Ada.Containers.Vectors,
Ada.Streams;
package AdaM.Aspect
is
type Item is new Any.item with private;
-- View
--
type View is access all Item'Class;
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View);
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View);
for View'write use View_write;
for View'read use View_read;
-- Vector
--
package Vectors is new ada.Containers.Vectors (Positive, View);
subtype Vector is Vectors.Vector;
-- Forge
--
function new_Subprogram return Aspect.view;
procedure free (Self : in out Aspect.view);
procedure destruct (Self : in out Aspect.item);
-- Attributes
--
overriding
function Id (Self : access Item) return AdaM.Id;
private
type Item is new Any.item with
record
null;
end record;
end AdaM.Aspect;
| 18.859649 | 85 | 0.59907 |
3d0aaaa8c3bb9d5f832b3057e4f9db13618e1398 | 4,680 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-sytaco.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/a-sytaco.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-sytaco.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S Y N C H R O N O U S _ T A S K _ C O N T R O L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Tasking;
-- Used for Detect_Blocking
-- Self
with Ada.Exceptions;
-- Used for Raise_Exception
with System.Task_Primitives.Operations;
-- Used for Initialize
-- Finalize
-- Current_State
-- Set_False
-- Set_True
-- Suspend_Until_True
package body Ada.Synchronous_Task_Control is
----------------
-- Initialize --
----------------
procedure Initialize (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Initialize (S.SO);
end Initialize;
--------------
-- Finalize --
--------------
procedure Finalize (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Finalize (S.SO);
end Finalize;
-------------------
-- Current_State --
-------------------
function Current_State (S : Suspension_Object) return Boolean is
begin
return System.Task_Primitives.Operations.Current_State (S.SO);
end Current_State;
---------------
-- Set_False --
---------------
procedure Set_False (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Set_False (S.SO);
end Set_False;
--------------
-- Set_True --
--------------
procedure Set_True (S : in out Suspension_Object) is
begin
System.Task_Primitives.Operations.Set_True (S.SO);
end Set_True;
------------------------
-- Suspend_Until_True --
------------------------
procedure Suspend_Until_True (S : in out Suspension_Object) is
begin
-- This is a potentially blocking (see ARM D.10, par. 10), so that
-- if pragma Detect_Blocking is active then Program_Error must be
-- raised if this operation is called from a protected action.
if System.Tasking.Detect_Blocking
and then System.Tasking.Self.Common.Protected_Action_Nesting > 0
then
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "potentially blocking operation");
end if;
System.Task_Primitives.Operations.Suspend_Until_True (S.SO);
end Suspend_Until_True;
end Ada.Synchronous_Task_Control;
| 40 | 78 | 0.503846 |
58a7470a8230c4f96fbd3598170864ceb4614727 | 33,897 | adb | Ada | src/parameters.adb | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 263 | 2015-12-30T22:24:04.000Z | 2022-03-25T03:13:52.000Z | src/parameters.adb | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 196 | 2016-01-08T19:50:19.000Z | 2022-03-25T22:02:10.000Z | src/parameters.adb | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 34 | 2016-03-08T02:43:35.000Z | 2022-03-25T21:51:03.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Ada.Directories;
with Ada.Text_IO;
with Ada.Characters.Latin_1;
with GNAT.OS_Lib;
with Unix;
package body Parameters is
package AD renames Ada.Directories;
package TIO renames Ada.Text_IO;
package LAT renames Ada.Characters.Latin_1;
package OSL renames GNAT.OS_Lib;
--------------------------
-- load_configuration --
--------------------------
function load_configuration (num_cores : cpu_range) return Boolean
is
fields_present : Boolean;
global_present : Boolean;
sel_profile : JT.Text;
begin
if not AD.Exists (conf_location) then
declare
test : String := determine_portsdirs;
begin
if test = "" then
return False;
end if;
end;
declare
File_Handle : TIO.File_Type;
begin
mkdirp_from_file (conf_location);
TIO.Create (File => File_Handle,
Mode => TIO.Out_File,
Name => conf_location);
TIO.Put_Line (File_Handle, "; This Synth configuration file is " &
"automatically generated");
TIO.Put_Line (File_Handle, "; Take care when hand editing!");
TIO.Close (File => File_Handle);
exception
when Error : others =>
TIO.Put_Line ("Failed to create " & conf_location);
return False;
end;
end if;
internal_config.Init (File_Name => conf_location,
On_Type_Mismatch => Config.Be_Quiet);
if section_exists (master_section, global_01) then
global_present := all_global_present;
else
write_blank_section (master_section);
global_present := False;
end if;
declare
envprofile : String := OSL.Getenv ("SYNTHPROFILE").all;
begin
sel_profile := extract_string (master_section, global_01, live_system);
if envprofile /= "" then
if section_exists (envprofile, Field_01) then
sel_profile := JT.SUS (envprofile);
end if;
end if;
end;
declare
profile : constant String := JT.USS (sel_profile);
begin
if section_exists (profile, Field_01) then
fields_present := all_params_present (profile);
else
write_blank_section (section => profile);
fields_present := False;
end if;
configuration := load_specific_profile (profile, num_cores);
end;
if not fields_present then
write_configuration (JT.USS (configuration.profile));
end if;
if not global_present then
write_master_section;
end if;
return True;
exception
when mishap : others => return False;
end load_configuration;
---------------------------
-- determine_portsdirs --
---------------------------
function determine_portsdirs return String
is
function get_varname return String;
function get_mkconf return String;
function get_varname return String is
begin
case software_framework is
when pkgsrc => return "PKGSRCDIR";
when ports_collection => return "PORTSDIR";
end case;
end get_varname;
function get_mkconf return String is
begin
case software_framework is
when pkgsrc => return "mk.conf";
when ports_collection => return "/etc/make.conf";
end case;
end get_mkconf;
varname : constant String := get_varname;
mkconf : constant String := get_mkconf;
begin
-- PORTSDIR in environment takes precedence
declare
portsdir : String := OSL.Getenv (varname).all;
begin
if portsdir /= "" then
if AD.Exists (portsdir) then
return portsdir;
end if;
end if;
end;
case software_framework is
when pkgsrc =>
if AD.Exists (std_pkgsrc_loc & "/mk/pkgformat/pkgng") then
return std_pkgsrc_loc;
end if;
when ports_collection =>
declare
portsdir : String := query_portsdir;
begin
if portsdir = "" then
TIO.Put_Line ("It seems that a blank " & varname &
" is defined in " & mkconf);
return "";
end if;
if AD.Exists (portsdir) then
return portsdir;
end if;
end;
if AD.Exists (std_dports_loc) then
return std_dports_loc;
elsif AD.Exists (std_ports_loc) then
return std_ports_loc;
end if;
end case;
TIO.Put_Line (varname & " cannot be determined.");
TIO.Put_Line ("Please set " & varname & " to a valid path in the environment or " &
mkconf);
return "";
end determine_portsdirs;
-----------------------------
-- load_specific_profile --
-----------------------------
function load_specific_profile (profile : String; num_cores : cpu_range)
return configuration_record
is
function opsys_ok return Boolean;
def_builders : Integer;
def_jlimit : Integer;
res : configuration_record;
function opsys_ok return Boolean is
begin
case software_framework is
when ports_collection =>
return (JT.equivalent (res.operating_sys, "FreeBSD") or else
JT.equivalent (res.operating_sys, "DragonFly"));
when pkgsrc =>
-- OpenBSD and derivatives are not supported because they lack mount_null (!)
return (JT.equivalent (res.operating_sys, "FreeBSD") or else
JT.equivalent (res.operating_sys, "DragonFly") or else
JT.equivalent (res.operating_sys, "NetBSD") or else
JT.equivalent (res.operating_sys, "Linux") or else
JT.equivalent (res.operating_sys, "SunOS")
);
end case;
end opsys_ok;
begin
-- The profile *must* exist before this procedure is called!
default_parallelism (num_cores => num_cores,
num_builders => def_builders,
jobs_per_builder => def_jlimit);
res.dir_packages := extract_string (profile, Field_01, LS_Packages);
if param_set (profile, Field_03) then
-- We can only check determine_portsdirs when no synth.ini file
-- exists. It's possible that it was configured with PORTSDIR
-- set which can be removed later. Use the dummy std_ports_loc
-- when we are sure the parameter is set (so dummy will NOT be used)
res.dir_portsdir := extract_string (profile, Field_03,
std_ports_loc);
else
res.dir_portsdir := extract_string (profile, Field_03,
determine_portsdirs);
end if;
res.dir_repository := res.dir_packages;
JT.SU.Append (res.dir_repository, "/All");
if param_set (profile, Field_04) then
res.dir_distfiles := extract_string (profile, Field_04, std_distfiles);
else
res.dir_distfiles := extract_string
(profile, Field_04, query_distfiles (JT.USS (res.dir_portsdir)));
end if;
res.dir_buildbase := extract_string (profile, Field_05, LS_Buildbase);
res.dir_logs := extract_string (profile, Field_06, LS_Logs);
res.dir_ccache := extract_string (profile, Field_07, no_ccache);
res.num_builders := builders
(extract_integer (profile, Field_08, def_builders));
res.jobs_limit := builders
(extract_integer (profile, Field_09, def_jlimit));
if param_set (profile, Field_12) then
res.operating_sys := extract_string (profile, Field_12, std_opsys);
else
res.operating_sys := extract_string
(profile, Field_12, query_opsys (JT.USS (res.dir_portsdir)));
end if;
if not opsys_ok then
TIO.Put_Line ("Unknown operating system: " & JT.USS (res.operating_sys));
case software_framework is
when ports_collection =>
TIO.Put_Line ("This configuration entry must be either 'FreeBSD' or 'DragonFly'");
when pkgsrc =>
TIO.Put_Line ("This configuration entry must be one of: FreeBSD,DragonFly," &
"NetBSD,Linux,SunOS");
end case;
TIO.Put_Line ("Manually edit " & Definitions.host_localbase &
"/etc/synth/synth.ini file to remove the line of the");
TIO.Put_Line (profile & " profile starting with 'Operating_system='");
TIO.Put_Line ("The synth.ini file should regenerate properly on the next Synth command.");
TIO.Put_Line ("");
raise bad_opsys;
end if;
if param_set (profile, Field_10) then
res.tmpfs_workdir := extract_boolean (profile, Field_10, False);
else
res.tmpfs_workdir := extract_boolean
(profile, Field_10, enough_memory (res.num_builders, res.operating_sys));
end if;
if param_set (profile, Field_11) then
res.tmpfs_localbase := extract_boolean (profile, Field_11, False);
else
res.tmpfs_localbase := extract_boolean
(profile, Field_11, enough_memory (res.num_builders, res.operating_sys));
end if;
res.dir_options := extract_string (profile, Field_13, std_options);
res.dir_system := extract_string (profile, Field_14, std_sysbase);
res.avec_ncurses := extract_boolean (profile, Field_15, True);
res.defer_prebuilt := extract_boolean (profile, Field_16, False);
res.profile := JT.SUS (profile);
return res;
end load_specific_profile;
---------------------------
-- write_configuration --
---------------------------
procedure write_configuration (profile : String := live_system)
is
contents : String := generated_section;
begin
internal_config.Replace_Section (profile, contents);
exception
when Error : others =>
raise update_config
with "Failed to update [" & profile & "] at " & conf_location;
end write_configuration;
---------------------------
-- write_blank_section --
---------------------------
procedure write_blank_section (section : String)
is
File_Handle : TIO.File_Type;
begin
TIO.Open (File => File_Handle,
Mode => TIO.Append_File,
Name => conf_location);
TIO.Put_Line (File_Handle, "");
TIO.Put_Line (File_Handle, "[" & section & "]");
TIO.Close (File_Handle);
exception
when Error : others =>
raise update_config
with "Failed to append [" & section & "] at " & conf_location;
end write_blank_section;
---------------------------
-- default_parallelism --
---------------------------
procedure default_parallelism (num_cores : cpu_range;
num_builders : out Integer;
jobs_per_builder : out Integer)
is
begin
case num_cores is
when 1 =>
num_builders := 1;
jobs_per_builder := 1;
when 2 | 3 =>
num_builders := 2;
jobs_per_builder := 2;
when 4 | 5 =>
num_builders := 3;
jobs_per_builder := 3;
when 6 | 7 =>
num_builders := 4;
jobs_per_builder := 3;
when 8 | 9 =>
num_builders := 6;
jobs_per_builder := 4;
when 10 | 11 =>
num_builders := 8;
jobs_per_builder := 4;
when others =>
num_builders := (Integer (num_cores) * 3) / 4;
jobs_per_builder := 5;
end case;
end default_parallelism;
----------------------
-- extract_string --
----------------------
function extract_string (profile, mark, default : String) return JT.Text
is
begin
return JT.SUS (internal_config.Value_Of (profile, mark, default));
end extract_string;
-----------------------
-- extract_boolean --
-----------------------
function extract_boolean (profile, mark : String; default : Boolean)
return Boolean
is
begin
return internal_config.Value_Of (profile, mark, default);
end extract_boolean;
-----------------------
-- extract_integer --
-----------------------
function extract_integer (profile, mark : String; default : Integer)
return Integer is
begin
return internal_config.Value_Of (profile, mark, default);
end extract_integer;
-----------------
-- param_set --
-----------------
function param_set (profile, field : String) return Boolean
is
garbage : constant String := "this-is-garbage";
begin
return internal_config.Value_Of (profile, field, garbage) /= garbage;
end param_set;
----------------------
-- section_exists --
----------------------
function section_exists (profile, mark : String) return Boolean is
begin
return param_set (profile, mark);
end section_exists;
--------------------------
-- all_params_present --
--------------------------
function all_params_present (profile : String) return Boolean is
begin
return
param_set (profile, Field_01) and then
param_set (profile, Field_02) and then
param_set (profile, Field_03) and then
param_set (profile, Field_04) and then
param_set (profile, Field_05) and then
param_set (profile, Field_06) and then
param_set (profile, Field_07) and then
param_set (profile, Field_08) and then
param_set (profile, Field_09) and then
param_set (profile, Field_10) and then
param_set (profile, Field_11) and then
param_set (profile, Field_12) and then
param_set (profile, Field_13) and then
param_set (profile, Field_14) and then
param_set (profile, Field_15) and then
param_set (profile, Field_16);
end all_params_present;
--------------------------
-- all_global_present --
--------------------------
function all_global_present return Boolean is
begin
return
param_set (master_section, global_01);
end all_global_present;
-------------------------
-- generated_section --
-------------------------
function generated_section return String
is
function USS (US : JT.Text) return String;
function BDS (BD : builders) return String;
function TFS (TF : Boolean) return String;
function USS (US : JT.Text) return String is
begin
return "= " & JT.USS (US) & LAT.LF;
end USS;
function BDS (BD : builders) return String
is
BDI : constant String := Integer'Image (Integer (BD));
begin
return LAT.Equals_Sign & BDI & LAT.LF;
end BDS;
function TFS (TF : Boolean) return String is
begin
if TF then
return LAT.Equals_Sign & " true" & LAT.LF;
else
return LAT.Equals_Sign & " false" & LAT.LF;
end if;
end TFS;
begin
return
Field_12 & USS (configuration.operating_sys) &
Field_01 & USS (configuration.dir_packages) &
Field_02 & USS (configuration.dir_repository) &
Field_03 & USS (configuration.dir_portsdir) &
Field_13 & USS (configuration.dir_options) &
Field_04 & USS (configuration.dir_distfiles) &
Field_05 & USS (configuration.dir_buildbase) &
Field_06 & USS (configuration.dir_logs) &
Field_07 & USS (configuration.dir_ccache) &
Field_14 & USS (configuration.dir_system) &
Field_08 & BDS (configuration.num_builders) &
Field_09 & BDS (configuration.jobs_limit) &
Field_10 & TFS (configuration.tmpfs_workdir) &
Field_11 & TFS (configuration.tmpfs_localbase) &
Field_15 & TFS (configuration.avec_ncurses) &
Field_16 & TFS (configuration.defer_prebuilt);
end generated_section;
-----------------------
-- query_distfiles --
-----------------------
function query_distfiles (portsdir : String) return String
is
-- DISTDIR is used by both pkgsrc and ports collection
begin
return query_generic (portsdir, "DISTDIR");
end query_distfiles;
------------------
-- query_opsys --
-------------------
function query_opsys (portsdir : String) return String
is
-- OPSYS is used by both pkgsrc and ports collection
begin
return query_generic (portsdir, "OPSYS");
end query_opsys;
---------------------
-- query_generic --
---------------------
function query_generic (portsdir, value : String) return String
is
-- devel/gmake exists on both pkgsrc and the ports collection
-- The actual port is not significant
command : constant String := host_make_program & " -C " & portsdir &
"/devel/gmake .MAKE.EXPAND_VARIABLES=yes -V " & value;
begin
return query_generic_core (command);
end query_generic;
--------------------------
-- query_generic_core --
--------------------------
function query_generic_core (command : String) return String
is
content : JT.Text;
status : Integer;
CR_loc : Integer;
CR : constant String (1 .. 1) := (1 => Character'Val (10));
begin
content := Unix.piped_command (command, status);
if status /= 0 then
raise make_query with command;
end if;
CR_loc := JT.SU.Index (Source => content, Pattern => CR);
return JT.SU.Slice (Source => content, Low => 1, High => CR_loc - 1);
end query_generic_core;
----------------------
-- query_portsdir --
----------------------
function query_portsdir return String
is
-- This is specific to the ports collection (invalid for pkgsrc)
command : constant String := host_make_program &
" -f /usr/share/mk/bsd.port.mk -V PORTSDIR";
begin
return query_generic_core (command);
exception
when others => return "";
end query_portsdir;
-----------------------------
-- query_physical_memory --
-----------------------------
procedure query_physical_memory is
-- Works for *BSD, DragonFly, Bitrig
-- DF/Free "hw.physmem: 8525971456" (8G)
-- NetBSD "hw.physmem = 1073278976" (1G)
command : constant String := "/sbin/sysctl hw.physmem";
content : JT.Text;
status : Integer;
begin
memory_megs := 1024;
content := Unix.piped_command (command, status);
if status /= 0 then
TIO.Put_Line ("command failed: " & command);
return;
end if;
declare
type styles is (unknown, dragonfly, netbsd);
function get_number_string return String;
style : styles := unknown;
response : constant String :=
JT.USS (content) (1 .. JT.SU.Length (content) - 1);
SP1 : constant String (1 .. 2) := (1 => LAT.Colon,
2 => LAT.Space);
SP2 : constant String (1 .. 2) := (1 => LAT.Equals_Sign,
2 => LAT.Space);
function get_number_string return String is
begin
case style is
when dragonfly => return JT.part_2 (response, SP1);
when netbsd => return JT.part_2 (response, SP2);
when unknown => return "1073741824";
end case;
end get_number_string;
begin
if JT.contains (response, SP1) then
style := dragonfly;
elsif JT.contains (response, SP2) then
style := netbsd;
else
TIO.Put_Line ("Anomaly, unable to detect physical memory");
TIO.Put_Line (response);
return;
end if;
declare
type memtype is mod 2**64;
numbers : String := get_number_string;
bytes : constant memtype := memtype'Value (numbers);
megs : constant memtype := bytes / 1024 / 1024;
begin
memory_megs := Natural (megs);
end;
end;
end query_physical_memory;
-----------------------------------
-- query_physical_memory_linux --
-----------------------------------
procedure query_physical_memory_linux
is
-- On linux, MemTotal should be on first line and that's what we're looking for
command : constant String := "/usr/bin/head /proc/meminfo";
found : Boolean := False;
status : Integer;
comres : JT.Text;
topline : JT.Text;
crlen1 : Natural;
crlen2 : Natural;
begin
comres := Unix.piped_command (command, status);
if status /= 0 then
raise make_query with command;
end if;
crlen1 := JT.SU.Length (comres);
loop
exit when found;
JT.nextline (lineblock => comres, firstline => topline);
crlen2 := JT.SU.Length (comres);
exit when crlen1 = crlen2;
crlen1 := crlen2;
if JT.SU.Length (topline) > 12 then
declare
line : String := JT.USS (topline);
begin
if line (line'First .. line'First + 8) = "MemTotal:" then
declare
type memtype is mod 2**64;
numbers : String :=
JT.part_1 (S => JT.trim (line (line'First + 9 .. line'Last)),
separator => " ");
kilobytes : constant memtype := memtype'Value (numbers);
megs : constant memtype := kilobytes / 1024;
begin
memory_megs := Natural (megs);
end;
found := True;
end if;
end;
end if;
end loop;
end query_physical_memory_linux;
-----------------------------------
-- query_physical_memory_sunos --
-----------------------------------
procedure query_physical_memory_sunos
is
-- On Solaris, we're looking for "Memory size" which should be on second line
command : constant String := "/usr/sbin/prtconf";
found : Boolean := False;
status : Integer;
comres : JT.Text;
topline : JT.Text;
crlen1 : Natural;
crlen2 : Natural;
begin
comres := Unix.piped_command (command, status);
if status /= 0 then
raise make_query with command;
end if;
crlen1 := JT.SU.Length (comres);
loop
exit when found;
JT.nextline (lineblock => comres, firstline => topline);
crlen2 := JT.SU.Length (comres);
exit when crlen1 = crlen2;
crlen1 := crlen2;
if JT.SU.Length (topline) > 12 then
declare
line : String := JT.USS (topline);
begin
if line (line'First .. line'First + 11) = "Memory size:" then
declare
type memtype is mod 2**64;
numbers : String :=
JT.part_1 (line (line'First + 13 .. line'Last), " ");
megabytes : constant memtype := memtype'Value (numbers);
begin
memory_megs := Natural (megabytes);
end;
found := True;
end if;
end;
end if;
end loop;
end query_physical_memory_sunos;
---------------------
-- enough_memory --
---------------------
function enough_memory (num_builders : builders; opsys : JT.Text) return Boolean is
megs_per_slave : Natural;
begin
if memory_megs = 0 then
if JT.equivalent (opsys, "Linux") then
query_physical_memory_linux;
elsif JT.equivalent (opsys, "SunOS") then
query_physical_memory_sunos;
else
query_physical_memory;
end if;
end if;
megs_per_slave := memory_megs / Positive (num_builders);
return megs_per_slave >= 1280;
end enough_memory;
----------------------------
-- write_master_section --
----------------------------
procedure write_master_section
is
function USS (US : JT.Text) return String;
function USS (US : JT.Text) return String is
begin
return "= " & JT.USS (US) & LAT.LF;
end USS;
contents : String :=
global_01 & USS (configuration.profile);
begin
internal_config.Replace_Section (master_section, contents);
exception
when Error : others =>
raise update_config
with "Failed to update [" & master_section & "] at " & conf_location;
end write_master_section;
---------------------
-- sections_list --
---------------------
function sections_list return JT.Text
is
handle : TIO.File_Type;
result : JT.Text;
begin
TIO.Open (File => handle, Mode => TIO.In_File, Name => conf_location);
while not TIO.End_Of_File (handle) loop
declare
Line : String := TIO.Get_Line (handle);
begin
if Line'Length > 0 and then
Line (1) = '[' and then
Line /= "[" & master_section & "]"
then
JT.SU.Append (result, Line (2 .. Line'Last - 1) & LAT.LF);
end if;
end;
end loop;
TIO.Close (handle);
return result;
end sections_list;
-----------------------
-- default_profile --
-----------------------
function default_profile (new_profile : String;
num_cores : cpu_range) return configuration_record
is
result : configuration_record;
def_builders : Integer;
def_jlimit : Integer;
begin
default_parallelism (num_cores => num_cores,
num_builders => def_builders,
jobs_per_builder => def_jlimit);
result.dir_portsdir := JT.SUS (std_ports_loc);
result.operating_sys := JT.SUS (query_opsys (std_ports_loc));
result.profile := JT.SUS (new_profile);
result.dir_system := JT.SUS (std_sysbase);
result.dir_repository := JT.SUS (LS_Packages & "/All");
result.dir_packages := JT.SUS (LS_Packages);
result.dir_distfiles := JT.SUS (std_distfiles);
result.dir_buildbase := JT.SUS (LS_Buildbase);
result.dir_logs := JT.SUS (LS_Logs);
result.dir_ccache := JT.SUS (no_ccache);
result.dir_options := JT.SUS (std_options);
result.num_builders := builders (def_builders);
result.jobs_limit := builders (def_jlimit);
result.tmpfs_workdir := enough_memory (result.num_builders, result.operating_sys);
result.tmpfs_localbase := enough_memory (result.num_builders, result.operating_sys);
result.avec_ncurses := True;
result.defer_prebuilt := False;
write_blank_section (section => new_profile);
return result;
end default_profile;
------------------------
-- mkdirp_from_file --
------------------------
procedure mkdirp_from_file (filename : String)
is
condir : String := AD.Containing_Directory (Name => filename);
begin
AD.Create_Path (New_Directory => condir);
exception
when others =>
raise update_config;
end mkdirp_from_file;
-----------------------
-- all_paths_valid --
-----------------------
function all_paths_valid return Boolean
is
use type AD.File_Kind;
function invalid_directory (folder : JT.Text; desc : String)
return Boolean;
function invalid_directory (folder : JT.Text; desc : String)
return Boolean
is
dossier : constant String := JT.USS (folder);
errmsg : constant String := "Configuration invalid: ";
begin
if AD.Exists (dossier) and then AD.Kind (dossier) = AD.Directory then
return False;
else
TIO.Put_Line (errmsg & desc & " directory: " & dossier);
return True;
end if;
end invalid_directory;
begin
declare
synth_tmp : constant String := "/var/synth";
begin
if invalid_directory (JT.SUS (synth_tmp), "xxx") then
if AD.Exists (synth_tmp) then
AD.Delete_File (synth_tmp);
end if;
AD.Create_Path (New_Directory => synth_tmp);
end if;
exception
when others =>
TIO.Put_Line ("Failed to create " & synth_tmp);
return False;
end;
if invalid_directory (configuration.dir_system, "[G] System root") then
return False;
elsif invalid_directory (configuration.dir_packages, "[B] Packages") then
return False;
elsif invalid_directory (configuration.dir_portsdir, "[A] Ports") then
return False;
elsif invalid_directory (configuration.dir_distfiles, "[C] Distfiles")
then
if JT.equivalent (configuration.dir_distfiles, "/usr/ports/distfiles")
then
TIO.Put_Line
("Rather than manually creating a directory at this location, " &
"consider" & LAT.LF &
"using a location outside of the ports tree. Don't forget " &
"to set" & LAT.LF &
"'DISTDIR' to this new location in /etc/make.conf though.");
end if;
return False;
elsif invalid_directory (configuration.dir_logs, "[E] Build logs") then
return False;
elsif invalid_directory (configuration.dir_options, "[D] Port options")
then
return False;
end if;
if JT.USS (configuration.dir_ccache) = no_ccache then
return True;
end if;
return not invalid_directory (configuration.dir_ccache,
"[H] Compiler cache");
end all_paths_valid;
----------------------
-- delete_profile --
----------------------
procedure delete_profile (profile : String)
is
old_file : TIO.File_Type;
new_file : TIO.File_Type;
nextgen : constant String := synth_confdir & "/synth.ini.next";
pattern : constant String := "[" & profile & "]";
blocking : Boolean := False;
begin
if not AD.Exists (conf_location) then
raise update_config
with "The " & conf_location & " configuration file does not exist.";
end if;
-- Try to defend malicious symlink: https://en.wikipedia.org/wiki/Symlink_race
if AD.Exists (nextgen) then
AD.Delete_File (nextgen);
end if;
TIO.Create (File => new_file, Mode => TIO.Out_File, Name => nextgen);
TIO.Open (File => old_file, Mode => TIO.In_File, Name => conf_location);
while not TIO.End_Of_File (old_file) loop
declare
Line : constant String := TIO.Get_Line (old_file);
bracket : Boolean := False;
begin
if not JT.IsBlank (Line) then
bracket := Line (1) = '[';
end if;
if bracket and then blocking then
blocking := False;
end if;
if not blocking and then Line = pattern then
blocking := True;
end if;
if not blocking then
TIO.Put_Line (new_file, Line);
end if;
end;
end loop;
TIO.Close (old_file);
TIO.Close (new_file);
AD.Delete_File (conf_location);
AD.Rename (Old_Name => nextgen, New_Name => conf_location);
exception
when others =>
if TIO.Is_Open (new_file) then
TIO.Close (new_file);
end if;
if AD.Exists (nextgen) then
AD.Delete_File (nextgen);
end if;
if TIO.Is_Open (old_file) then
TIO.Close (old_file);
end if;
raise update_config
with "Failed to remove " & profile & " profile";
end delete_profile;
----------------------------------
-- alternative_profiles_exist --
----------------------------------
function alternative_profiles_exist return Boolean
is
counter : Natural := 0;
conf_file : TIO.File_Type;
begin
if not AD.Exists (conf_location) then
return False;
end if;
TIO.Open (File => conf_file, Mode => TIO.In_File, Name => conf_location);
while not TIO.End_Of_File (conf_file) loop
declare
Line : constant String := TIO.Get_Line (conf_file);
bracket : Boolean := False;
begin
if not JT.IsBlank (Line) then
bracket := Line (1) = '[';
end if;
if bracket and then Line /= "[" & master_section & "]"
then
counter := counter + 1;
end if;
end;
end loop;
TIO.Close (conf_file);
return counter > 1;
exception
when others =>
if TIO.Is_Open (conf_file) then
TIO.Close (conf_file);
end if;
return False;
end alternative_profiles_exist;
end Parameters;
| 34.274014 | 99 | 0.548603 |
59ba44d8815e8a6c79d4c5cf8c2b0b40e3720971 | 475 | ads | Ada | demo/adainclude/memory_compare.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/memory_compare.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/memory_compare.ads | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | with System; use System;
with Interfaces.C; use Interfaces.C;
package Memory_Compare is
pragma Preelaborate;
function memcmp (S1 : Address; S2 : Address; N : size_t) return int;
pragma Export (C, memcmp, "memcmp");
-- compares the first n bytes of the memory areas s1 and s2. It returns
-- an integer less than, equal to, or greater than zero if s1 is
-- found, respectively, to be less than, to match, or be greater than s2.
end Memory_Compare;
| 33.928571 | 77 | 0.701053 |
5784a983a038c7c3550a82bd768f1d0c148f18c5 | 4,552 | ads | Ada | source/amf/uml/amf-uml-call_events.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-call_events.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-call_events.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A call event models the receipt by an object of a message invoking a call
-- of an operation.
------------------------------------------------------------------------------
with AMF.UML.Message_Events;
limited with AMF.UML.Operations;
package AMF.UML.Call_Events is
pragma Preelaborate;
type UML_Call_Event is limited interface
and AMF.UML.Message_Events.UML_Message_Event;
type UML_Call_Event_Access is
access all UML_Call_Event'Class;
for UML_Call_Event_Access'Storage_Size use 0;
not overriding function Get_Operation
(Self : not null access constant UML_Call_Event)
return AMF.UML.Operations.UML_Operation_Access is abstract;
-- Getter of CallEvent::operation.
--
-- Designates the operation whose invocation raised the call event.
not overriding procedure Set_Operation
(Self : not null access UML_Call_Event;
To : AMF.UML.Operations.UML_Operation_Access) is abstract;
-- Setter of CallEvent::operation.
--
-- Designates the operation whose invocation raised the call event.
end AMF.UML.Call_Events;
| 58.358974 | 78 | 0.45848 |
4151d61d20f6973975e6526b37f5492954a44fe1 | 1,818 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_pixel_mapusv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_pixel_mapusv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_pixel_mapusv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_pixel_mapusv_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
pad1 : aliased swig.int8_t_Array (0 .. 3);
n : aliased Interfaces.Unsigned_32;
datum : aliased Interfaces.Unsigned_16;
pad2 : aliased swig.int8_t_Array (0 .. 15);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_pixel_mapusv_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_pixel_mapusv_reply_t.Item,
Element_Array => xcb.xcb_glx_get_pixel_mapusv_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_pixel_mapusv_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_pixel_mapusv_reply_t.Pointer,
Element_Array => xcb.xcb_glx_get_pixel_mapusv_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_pixel_mapusv_reply_t;
| 29.803279 | 79 | 0.654565 |
228133c978e52a9cdb36bfbda5d6f525e3d43777 | 1,772 | ads | Ada | src/keystore-passwords-keys.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 25 | 2019-05-07T20:35:50.000Z | 2021-11-30T10:35:47.000Z | src/keystore-passwords-keys.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 12 | 2019-12-16T23:30:00.000Z | 2021-09-26T18:52:41.000Z | src/keystore-passwords-keys.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 3 | 2019-12-18T21:30:04.000Z | 2021-01-06T08:30:36.000Z | -----------------------------------------------------------------------
-- keystore-passwords-keys -- Key provider
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package Keystore.Passwords.Keys is
use type Ada.Streams.Stream_Element_Offset;
DEFAULT_KEY_LENGTH : constant := 32 + 16 + 32;
type Key_Provider is limited interface;
type Key_Provider_Access is access all Key_Provider'Class;
-- Get the Key, IV and signature.
procedure Get_Keys (From : in Key_Provider;
Key : out Secret_Key;
IV : out Secret_Key;
Sign : out Secret_Key) is abstract with
Post'Class => Key.Length = 32 and IV.Length = 16 and Sign.Length = 32;
-- Create a key, iv, sign provider from the string.
function Create (Password : in String;
Length : in Key_Length := DEFAULT_KEY_LENGTH)
return Key_Provider_Access;
function Create (Password : in Ada.Streams.Stream_Element_Array)
return Key_Provider_Access;
end Keystore.Passwords.Keys;
| 41.209302 | 76 | 0.623589 |
227e00d9a9065dadb2915d2e75edf68accd60542 | 63,330 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_Loop_1_pr.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_Loop_1_pr.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/linebuffer_Loop_1_pr.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>linebuffer_Loop_1_pr</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>in_axi_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</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>in_axi_stream_V_last_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>in_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</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>24</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</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_74_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>42</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</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_80_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>45</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>empty_21</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>31</item>
<item>32</item>
<item>33</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>552</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned char&gt;</second>
</first>
<second>552</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_14">
<Value>
<Obj>
<type>2</type>
<id>35</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_15">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2073600</content>
</item>
<item class_id_reference="16" object_id="_16">
<Value>
<Obj>
<type>2</type>
<id>44</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_17">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_18">
<Obj>
<type>3</type>
<id>12</id>
<name>.preheader.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_19">
<Obj>
<type>3</type>
<id>21</id>
<name>.preheader4.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_20">
<Obj>
<type>3</type>
<id>23</id>
<name>.critedge.exitStub</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>22</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_21">
<id>24</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_22">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_23">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>34</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>37</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>39</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>47</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>48</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>12</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="_43">
<mId>1</mId>
<mTag>linebuffer_Loop_1_pr</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>2073602</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_44">
<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>7</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="_45">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>2073600</mMinTripCount>
<mMaxTripCount>2073600</mMaxTripCount>
<mMinLatency>2073600</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_46">
<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>23</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="_47">
<states class_id="25" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_48">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_49">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_50">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_51">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_52">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_53">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_54">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_55">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_56">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_57">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_58">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_59">
<id>3</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_60">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_66">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_67">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_68">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_69">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>20</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="_70">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>19</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>9</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_71">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>9</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="_72">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>9</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_pp0_stage0_flag00001001 ( or ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state2_pp0_stage0_iter0 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state3_pp0_stage0_iter1 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_74_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>16</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>13</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>21</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>68</second>
</item>
<item>
<first>LUT</first>
<second>26</second>
</item>
</second>
</item>
<item>
<first>start_write ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
</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>8</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_last_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>in_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>21</second>
</item>
<item>
<first>(2Count)</first>
<second>42</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>real_start</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_90</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>21</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>21</second>
</item>
</second>
</item>
<item>
<first>real_start_status_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>start_control_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>start_once_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>tmp_value_V_reg_99</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>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>2</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>exitcond_flatten_fu_74_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>6</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>7</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_73">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</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>6</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>exitcond_flatten_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_17_write_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>empty_21_read_fu_48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>in_axi_stream_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core 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>3</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.272467 | 135 | 0.449724 |
58bc0df5ceb2448b112dde250602aea10315eb12 | 947 | ads | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/pckd_arr_ren/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-8.3/gdb/testsuite/gdb.ada/pckd_arr_ren/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-8.3/gdb/testsuite/gdb.ada/pckd_arr_ren/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2014-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Packed_Array is array (Natural range <>) of Boolean;
pragma Pack (Packed_Array);
function Make (H, L : Natural) return Packed_Array;
procedure Do_Nothing (A : System.Address);
end Pck;
| 37.88 | 73 | 0.732841 |
4d056a5c2a363f1aee71bed6c1545c621b826514 | 13,725 | ads | Ada | src/security-auth.ads | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 19 | 2015-01-18T23:04:59.000Z | 2021-11-30T10:39:10.000Z | src/security-auth.ads | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 4 | 2020-08-06T15:37:51.000Z | 2022-02-04T20:19:39.000Z | src/security-auth.ads | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 3 | 2021-01-04T10:23:22.000Z | 2022-01-30T21:45:49.000Z | -----------------------------------------------------------------------
-- security-auth -- Authentication Support
-- Copyright (C) 2009 - 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Ada.Calendar;
with Ada.Finalization;
-- = Authentication =
-- The `Security.Auth` package implements an authentication framework that is
-- suitable for OpenID 2.0, OAuth 2.0 and later for OpenID Connect. It allows an application
-- to authenticate users using an external authorization server such as Google, Facebook,
-- Google +, Twitter and others.
--
-- See OpenID Authentication 2.0 - Final
-- https://openid.net/specs/openid-authentication-2_0.html
--
-- See OpenID Connect Core 1.0
-- https://openid.net/specs/openid-connect-core-1_0.html
--
-- See Facebook API: The Login Flow for Web (without JavaScript SDK)
-- https://developers.facebook.com/docs/facebook-login/login-flow-for-web-no-jssdk/
--
-- Despite their subtle differences, all these authentication frameworks share almost
-- a common flow. The API provided by `Security.Auth` defines an abstraction suitable
-- for all these frameworks.
--
-- There are basically two steps that an application must implement:
--
-- * `Discovery`: to resolve and use the OpenID provider and redirect the user to the
-- provider authentication form.
-- * `Verify`: to decode the authentication and check its result.
--
-- [[images/OpenID.png]]
--
-- The authentication process is the following:
--
-- * The application should redirect the user to the authentication URL.
-- * The OpenID provider authenticate the user and redirects the user to the callback CB.
-- * The association is decoded from the callback parameter.
-- * The `Verify` procedure is called with the association to check the result and
-- obtain the authentication results.
--
-- == Initialization ==
-- The initialization process must be done before each two steps (discovery and verify).
-- The Authentication manager must be declared and configured.
--
-- Mgr : Security.Auth.Manager;
--
-- For the configuration, the <b>Initialize</b> procedure is called to configure
-- the Auth realm and set the authentication return callback URL. The return callback
-- must be a valid URL that is based on the realm. Example:
--
-- Mgr.Initialize (Name => "http://app.site.com/auth",
-- Return_To => "http://app.site.com/auth/verify",
-- Realm => "openid");
--
-- After this initialization, the authentication manager can be used in the authentication
-- process.
--
-- @include security-auth-openid.ads
-- @include security-auth-oauth-googleplus.ads
--
-- == Discovery: creating the authentication URL ==
-- The first step is to create an authentication URL to which the user must be redirected.
-- In this step, we have to create an OpenID manager, discover the OpenID provider,
-- do the association and get an <b>End_Point</b>. The OpenID provider is specified as an
-- URL, below is an example for Google OpenID:
--
-- Provider : constant String := "https://www.google.com/accounts/o8/id";
-- OP : Security.Auth.End_Point;
-- Assoc : constant Security.Auth.Association_Access := new Security.Auth.Association;
--
-- The following steps are performed:
--
-- * The <b>Discover</b> procedure is called to retrieve from the OpenID provider the XRDS
-- stream and identify the provider. An <b>End_Point</b> is returned in <tt>OP</tt>.
-- * The <b>Associate</b> procedure is called to make the association with the <b>End_Point</b>.
-- The <b>Association</b> record holds session, and authentication.
--
-- Mgr.Discover (Provider, OP); -- Yadis discovery (get the XRDS file).
-- Mgr.Associate (OP, Assoc.all);-- Associate and get an end-point with a key.
--
-- After this first step, you must manage to save the association in the HTTP session.
-- Then you must redirect to the authentication URL that is obtained by using:
--
-- Auth_URL : constant String := Mgr.Get_Authentication_URL (OP, Assoc.all);
--
-- == Verify: acknowledge the authentication in the callback URL ==
-- The second step is done when the user has finished the authentication successfully or not.
-- For this step, the application must get back the association that was saved in the session.
-- It must also prepare a parameters object that allows the OpenID framework to get the
-- URI parameters from the return callback.
--
-- Assoc : Association_Access := ...; -- Get the association saved in the session.
-- Credential : Security.Auth.Authentication;
-- Params : Auth_Params;
--
-- The auth manager must be initialized and the <b>Verify</b> procedure is called with
-- the association, parameters and the authentication result. The <b>Get_Status</b> function
-- must be used to check that the authentication succeeded.
--
-- Mgr.Verify (Assoc.all, Params, Credential);
-- if Security.Auth.Get_Status (Credential) = Security.Auth.AUTHENTICATED then ... -- Success.
--
-- == Principal creation ==
-- After the user is successfully authenticated, a user principal can be created and saved in
-- the session. The user principal can then be used to assign permissions to that user and
-- enforce the application permissions using the security policy manger.
--
-- P : Security.Auth.Principal_Access := Security.Auth.Create_Principal (Credential);
--
package Security.Auth is
-- Use an authentication server implementing OpenID 2.0.
PROVIDER_OPENID : constant String := "openid";
-- Use the Facebook OAuth 2.0 - draft 12 authentication server.
PROVIDER_FACEBOOK : constant String := "facebook";
-- Use the Google+ OpenID Connect Basic Client
PROVIDER_GOOGLE_PLUS : constant String := "google-plus";
-- Use the Yahoo! OpenID Connect Basic Client
PROVIDER_YAHOO : constant String := "yahoo";
-- Use the GitHub OpenID Connect Basic Client
PROVIDER_GITHUB : constant String := "github";
Invalid_End_Point : exception;
Service_Error : exception;
type Parameters is limited interface;
function Get_Parameter (Params : in Parameters;
Name : in String) return String is abstract;
-- ------------------------------
-- Auth provider
-- ------------------------------
-- The <b>End_Point</b> represents the authentication provider that will authenticate
-- the user.
type End_Point is private;
function To_String (OP : End_Point) return String;
-- ------------------------------
-- Association
-- ------------------------------
-- The association contains the shared secret between the relying party
-- and the authentication provider. The association can be cached and reused to authenticate
-- different users using the same authentication provider. The association also has an
-- expiration date.
type Association is private;
-- Get the provider.
function Get_Provider (Assoc : in Association) return String;
-- Dump the association as a string (for debugging purposes)
function To_String (Assoc : Association) return String;
type Auth_Result is (AUTHENTICATED, CANCEL, SETUP_NEEDED, UNKNOWN, INVALID_SIGNATURE);
-- ------------------------------
-- Authentication result
-- ------------------------------
--
type Authentication is private;
-- Get the email address
function Get_Email (Auth : in Authentication) return String;
-- Get the user first name.
function Get_First_Name (Auth : in Authentication) return String;
-- Get the user last name.
function Get_Last_Name (Auth : in Authentication) return String;
-- Get the user full name.
function Get_Full_Name (Auth : in Authentication) return String;
-- Get the user identity.
function Get_Identity (Auth : in Authentication) return String;
-- Get the user claimed identity.
function Get_Claimed_Id (Auth : in Authentication) return String;
-- Get the user language.
function Get_Language (Auth : in Authentication) return String;
-- Get the user country.
function Get_Country (Auth : in Authentication) return String;
-- Get the result of the authentication.
function Get_Status (Auth : in Authentication) return Auth_Result;
-- ------------------------------
-- Default principal
-- ------------------------------
type Principal is new Security.Principal with private;
type Principal_Access is access all Principal'Class;
-- Get the principal name.
function Get_Name (From : in Principal) return String;
-- Get the user email address.
function Get_Email (From : in Principal) return String;
-- Get the authentication data.
function Get_Authentication (From : in Principal) return Authentication;
-- Create a principal with the given authentication results.
function Create_Principal (Auth : in Authentication) return Principal_Access;
-- ------------------------------
-- Authentication Manager
-- ------------------------------
-- The <b>Manager</b> provides the core operations for the authentication process.
type Manager is tagged limited private;
type Manager_Access is access all Manager'Class;
-- Initialize the authentication realm.
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Name : in String := PROVIDER_OPENID);
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Factory : not null
access function (Name : in String) return Manager_Access;
Name : in String := PROVIDER_OPENID);
-- Discover the authentication provider that must be used to authenticate the user.
-- The <b>Name</b> can be an URL or an alias that identifies the provider.
-- A cached OpenID provider can be returned. The discover step may do nothing for
-- authentication providers based on OAuth.
-- (See OpenID Section 7.3 Discovery)
procedure Discover (Realm : in out Manager;
Name : in String;
Result : out End_Point);
-- Associate the application (relying party) with the authentication provider.
-- The association can be cached.
-- (See OpenID Section 8 Establishing Associations)
procedure Associate (Realm : in out Manager;
OP : in End_Point;
Result : out Association);
-- Get the authentication URL to which the user must be redirected for authentication
-- by the authentication server.
function Get_Authentication_URL (Realm : in Manager;
OP : in End_Point;
Assoc : in Association) return String;
-- Verify the authentication result
procedure Verify (Realm : in out Manager;
Assoc : in Association;
Request : in Parameters'Class;
Result : out Authentication);
-- Default factory used by `Initialize`. It supports OpenID, Google, Facebook.
function Default_Factory (Provider : in String) return Manager_Access;
type Factory_Access is not
null access function (Provider : in String) return Manager_Access;
-- Set the default factory to use.
procedure Set_Default_Factory (Factory : in Factory_Access);
private
use Ada.Strings.Unbounded;
type Association is record
Provider : Unbounded_String;
Session_Type : Unbounded_String;
Assoc_Type : Unbounded_String;
Assoc_Handle : Unbounded_String;
Mac_Key : Unbounded_String;
Expired : Ada.Calendar.Time;
Nonce : Unbounded_String;
end record;
type Authentication is record
Status : Auth_Result;
Identity : Unbounded_String;
Claimed_Id : Unbounded_String;
Email : Unbounded_String;
Full_Name : Unbounded_String;
First_Name : Unbounded_String;
Last_Name : Unbounded_String;
Language : Unbounded_String;
Country : Unbounded_String;
Gender : Unbounded_String;
Timezone : Unbounded_String;
Nickname : Unbounded_String;
end record;
type End_Point is record
URL : Unbounded_String;
Alias : Unbounded_String;
Expired : Ada.Calendar.Time;
end record;
type Manager is new Ada.Finalization.Limited_Controlled with record
Provider : Unbounded_String;
Delegate : Manager_Access;
end record;
overriding
procedure Finalize (Realm : in out Manager);
type Principal is new Security.Principal with record
Auth : Authentication;
end record;
procedure Set_Result (Result : in out Authentication;
Status : in Auth_Result;
Message : in String);
end Security.Auth;
| 40.970149 | 99 | 0.662587 |
222b88f4d9d53d4117b18356181a493954a6a0ce | 1,118 | ads | Ada | src/ada/src/comms/uxas-comms-transport-zeromq_socket_configurations.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 88 | 2017-08-24T07:02:01.000Z | 2022-03-18T04:34:17.000Z | src/ada/src/comms/uxas-comms-transport-zeromq_socket_configurations.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 46 | 2017-06-08T18:18:08.000Z | 2022-03-15T18:24:43.000Z | src/ada/src/comms/uxas-comms-transport-zeromq_socket_configurations.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 53 | 2017-06-22T14:48:05.000Z | 2022-02-15T16:59:38.000Z | with UxAS.Comms.Transport.Socket_Configurations;
use UxAS.Comms.Transport.Socket_Configurations;
with ZMQ.Sockets;
package UxAS.Comms.Transport.ZeroMQ_Socket_Configurations is
type ZeroMq_Socket_Configuration is new Socket_Configuration with record
Zmq_Socket_Type : ZMQ.Sockets.Socket_Type;
Is_Server_Bind : Boolean;
Receive_High_Water_Mark : Int32;
Send_High_Water_Mark : Int32;
Number_Of_IO_Threads : Positive;
end record;
function Make -- a convenience routine
(Network_Name : String;
Socket_Address : String;
Is_Receive : Boolean;
Zmq_Socket_Type : ZMQ.Sockets.Socket_Type;
Number_Of_IO_Threads : Positive;
Is_Server_Bind : Boolean;
Receive_High_Water_Mark : Int32;
Send_High_Water_Mark : Int32)
return ZeroMq_Socket_Configuration
with Pre'Class =>
Network_Name'Length in 1 .. Max_Network_Name_Length and then
Socket_Address'Length in 1 .. Max_Socket_Address_Length;
end UxAS.Comms.Transport.ZeroMQ_Socket_Configurations;
| 36.064516 | 75 | 0.701252 |
3d6ceb8fd615b58f58d92c00a1b8d34fba82c980 | 2,883 | ads | Ada | rotations/example.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | rotations/example.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | rotations/example.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | ---------------------------------------------------------------------------------
-- Copyright 2004-2005 © Luke A. Guest
--
-- This code is to be used for tutorial purposes only.
-- You may not redistribute this code in any form without my express permission.
---------------------------------------------------------------------------------
with SDL.Types; use SDL.Types;
with SDL.Keysym; use SDL.Keysym;
with SDL.Video; use SDL.Video;
with SDL.Timer;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with GL;
use type GL.GLfloat;
use type GL.GLbitfield;
package Example is
procedure PrintGLInfo;
procedure PrintUsage;
procedure CalculateFPS;
function Initialise return Boolean;
procedure Uninitialise;
procedure Update(Ticks : in Integer);
procedure Draw;
function GetTitle return String;
function GetWidth return Integer;
function GetHeight return Integer;
function GetBitsPerPixel return Integer;
procedure SetLastTickCount(Ticks : in Integer);
procedure SetSurface(Surface : in SDL.Video.Surface_Ptr);
function GetSurface return SDL.Video.Surface_Ptr;
procedure SetKey(Key : in SDL.Keysym.Key; Down : in Boolean);
procedure SetActive(Active : in Boolean);
function IsActive return Boolean;
procedure SetQuit(Quit : in Boolean);
function Quit return Boolean;
private
type KeysArray is array (SDL.Keysym.K_FIRST .. SDL.Keysym.K_LAST) of Boolean;
type Cubes is (LEFT, RIGHT);
type CubeSpeed is array (Cubes'First .. Cubes'Last) of GL.GLFloat;
Title : String := "Rotations Demo in Ada/SDL";
Width : Integer := 640;
Height : Integer := 480;
BitsPerPixel : Integer := 16;
IsFullScreen : Boolean := False;
Keys : KeysArray := (others => False);
IsVisible : Boolean := False;
LastTickCount : Integer := 0;
ScreenSurface : SDL.Video.Surface_Ptr := null;
AppActive : Boolean := True;
AppQuit : Boolean := False;
PressedL : Boolean := False;
PressedC : Boolean := False;
PressedS : Boolean := False;
LightingOn : Boolean := True;
CameraMoving : Boolean := False;
SmoothShadingOn : Boolean := True;
XSpeed : CubeSpeed := (0.0, 0.0);
YSpeed : CubeSpeed := (0.0, 0.0);
CameraXSpeed : GL.GLfloat := 0.0;
CameraYSpeed : GL.GLfloat := 0.0;
Zoom : GL.GLfloat := -6.0;
Cube : Cubes := LEFT;
LastElapsedTime : Float := 0.0;
FrameCount : Integer := 0;
FPS : Float := 0.0;
end Example;
| 39.493151 | 81 | 0.545612 |
580ff2580cd83e8220ed39a059952a20e8164a43 | 2,524 | adb | Ada | tests/src/spawn_manager-tests-main.adb | persan/spawn-manager | 9df1a2cda3a4f07ba594ead071fecb50546de650 | [
"BSD-3-Clause"
] | 1 | 2018-03-19T19:54:41.000Z | 2018-03-19T19:54:41.000Z | tests/src/spawn_manager-tests-main.adb | persan/spawn-manager | 9df1a2cda3a4f07ba594ead071fecb50546de650 | [
"BSD-3-Clause"
] | null | null | null | tests/src/spawn_manager-tests-main.adb | persan/spawn-manager | 9df1a2cda3a4f07ba594ead071fecb50546de650 | [
"BSD-3-Clause"
] | null | null | null | with GNAT.Exception_Traces;
with GNAT.Traceback.Symbolic;
with Ada.Text_IO; use Ada.Text_IO;
with Spawn_Manager.Client; use Spawn_Manager.Client;
with GNAT.Source_Info;
procedure Spawn_Manager.Tests.Main is
Args : GNAT.OS_Lib.Argument_List (1 .. 1);
Args2 : GNAT.OS_Lib.Argument_List (1 .. 1);
Ls : GNAT.OS_Lib.String_Access;
Proj_Version : constant String := $VERSION;
Ok : Boolean := False;
begin
Debug := True;
GNAT.Exception_Traces.Set_Trace_Decorator (GNAT.Traceback.Symbolic.Symbolic_Traceback'Access);
GNAT.Exception_Traces.Trace_On (GNAT.Exception_Traces.Every_Raise);
pragma Warnings (Off);
if Proj_Version /= Version then
raise Program_Error with "Version missmatch: Proj_Version=" & Proj_Version & ", Version=" & Version & ".";
end if;
pragma Warnings (On);
Ls := GNAT.OS_Lib.Locate_Exec_On_Path ("cat");
Args (1) := new String'("testdata.input");
Args2 (1) := new String'("<Erronous-file>");
Put_Line (GNAT.Source_Info.Source_Location);
declare
Return_Code : Integer;
Success : Boolean;
M : Controler; pragma Unreferenced (M);
P : Process_Id; pragma Unreferenced (P);
Status : Status_Kind; pragma Warnings (Off, Status);
begin
Put_Line (GNAT.Source_Info.Source_Location);
Client.Spawn (Ls.all, Args, Success);
Put_Line (GNAT.Source_Info.Source_Location);
Put_Line (GNAT.Source_Info.Source_Location & ": Success:" & Success'Img);
Ok := Success;
Return_Code := Client.Spawn (Ls.all, Args2);
Put_Line (GNAT.Source_Info.Source_Location & ": Return_Code:" & Return_Code'Img);
Ok := Ok or (Return_Code = 0);
Client.Spawn (Ls.all, Args, "test.out", Success, Return_Code);
declare
F : Ada.Text_IO.File_Type;
begin
Open (F, In_File, "test.out");
while not End_Of_File (F) loop
Put_Line ("!" & Get_Line (F));
end loop;
end;
Put_Line (GNAT.Source_Info.Source_Location & ": Success:" & Success'Img);
Put_Line (GNAT.Source_Info.Source_Location & ": Return_Code:" & Return_Code'Img);
Ok := Ok or Success;
Ok := Ok or (Return_Code = 0);
P := Waitpid (Invalid_Pid, Status => Status, Options => WNOHANG);
end;
Put_Line (GNAT.Source_Info.Source_Location);
if not Ok then
raise Program_Error with "test failed";
end if;
Put_Line (GNAT.Source_Info.Source_Location);
end Spawn_Manager.Tests.Main;
| 37.671642 | 112 | 0.650555 |
596b7a57f59ac5a42d722c013a3f6bb7c8f575e2 | 4,892 | ads | Ada | tools/ayacc/src/stack_pkg.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | lib/ayacc/stack_pkg.ads | alvaromb/Compilemon | de5f88f084705868d38e301d95bb4a19a46a1156 | [
"MIT"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | lib/ayacc/stack_pkg.ads | alvaromb/Compilemon | de5f88f084705868d38e301d95bb4a19a46a1156 | [
"MIT"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z |
-- Module : stack_pkg_.ada
-- Component of : common_library
-- Version : 1.2
-- Date : 11/21/86 16:33:02
-- SCCS File : disk21~/rschm/hasee/sccs/common_library/sccs/sxstack_pkg_.ada
-- $Source: /nosc/work/abstractions/stack/RCS/stack.spc,v $
-- $Revision: 1.5 $ -- $Date: 85/02/01 09:57:17 $ -- $Author: ron $
-- $Source: /nosc/work/abstractions/stack/RCS/stack.spc,v $
-- $Revision: 1.5 $ -- $Date: 85/02/01 09:57:17 $ -- $Author: ron $
with lists; --| Implementation uses lists. (private)
generic
type elem_type is private; --| Component element type.
package stack_pkg is
--| Overview:
--| This package provides the stack abstract data type. Element type is
--| a generic formal parameter to the package. There are no explicit
--| bounds on the number of objects that can be pushed onto a given stack.
--| All standard stack operations are provided.
--|
--| The following is a complete list of operations, written in the order
--| in which they appear in the spec. Overloaded subprograms are followed
--| by (n), where n is the number of subprograms of that name.
--|
--| Constructors:
--| create
--| push
--| pop (2)
--| copy
--| Query Operations:
--| top
--| size
--| is_empty
--| Heap Management:
--| destroy
--| Notes:
--| Programmer: Ron Kownacki
type stack is private; --| The stack abstract data type.
-- Exceptions:
uninitialized_stack: exception;
--| Raised on attempt to manipulate an uninitialized stack object.
--| The initialization operations are create and copy.
empty_stack: exception;
--| Raised by some operations when empty.
-- Constructors:
function create
return stack;
--| Effects:
--| Return the empty stack.
procedure push(s: in out stack;
e: elem_type);
--| Raises: uninitialized_stack
--| Effects:
--| Push e onto the top of s.
--| Raises uninitialized_stack iff s has not been initialized.
procedure pop(s: in out stack);
--| Raises: empty_stack, uninitialized_stack
--| Effects:
--| Pops the top element from s, and throws it away.
--| Raises empty_stack iff s is empty.
--| Raises uninitialized_stack iff s has not been initialized.
procedure pop(s: in out stack;
e: out elem_type);
--| Raises: empty_stack, uninitialized_stack
--| Effects:
--| Pops the top element from s, returns it as the e parameter.
--| Raises empty_stack iff s is empty.
--| Raises uninitialized_stack iff s has not been initialized.
function copy(s: stack)
return stack;
--| Raises: uninitialized_stack
--| Return a copy of s.
--| Stack assignment and passing stacks as subprogram parameters
--| result in the sharing of a single stack value by two stack
--| objects; changes to one will be visible through the others.
--| copy can be used to prevent this sharing.
--| Raises uninitialized_stack iff s has not been initialized.
-- Queries:
function top(s: stack)
return elem_type;
--| Raises: empty_stack, uninitialized_stack
--| Effects:
--| Return the element on the top of s. Raises empty_stack iff s is
--| empty.
--| Raises uninitialized_stack iff s has not been initialized.
function size(s: stack)
return natural;
--| Raises: uninitialized_stack
--| Effects:
--| Return the current number of elements in s.
--| Raises uninitialized_stack iff s has not been initialized.
function is_empty(s: stack)
return boolean;
--| Raises: uninitialized_stack
--| Effects:
--| Return true iff s is empty.
--| Raises uninitialized_stack iff s has not been initialized.
-- Heap Management:
procedure destroy(s: in out stack);
--| Effects:
--| Return the space consumed by s to the heap. No effect if s is
--| uninitialized. In any case, leaves s in uninitialized state.
private
package elem_list_pkg is new lists(elem_type);
subtype elem_list is elem_list_pkg.list;
type stack_rec is
record
size: natural := 0;
elts: elem_list := elem_list_pkg.create;
end record;
type stack is access stack_rec;
--| Let an instance of the representation type, r, be denoted by the
--| pair, <size, elts>. Dot selection is used to refer to these
--| components.
--|
--| Representation Invariants:
--| r /= null
--| elem_list_pkg.length(r.elts) = r.size.
--|
--| Abstraction Function:
--| A(<size, elem_list_pkg.create>) = stack_pkg.create.
--| A(<size, elem_list_pkg.attach(e, l)>) = push(A(<size, l>), e).
end stack_pkg;
| 29.119048 | 79 | 0.621627 |
5897aff4399a0864bfb02f540dbcbdc5314ef929 | 1,130 | adb | Ada | gdb/testsuite/gdb.ada/unsigned_range/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/unsigned_range/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/unsigned_range/foo.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2020-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pack; use Pack;
procedure Foo is
type U_W is range 0 .. 65535;
for U_W'Size use 16;
type R_C is
record
One : U_W;
Two : U_W;
end record;
for R_C use
record at mod 2;
One at 0 range 0 .. 15;
Two at 2 range 0 .. 15;
end record;
for R_C'size use 2*16;
Value: R_C := (One => 8000, Two => 51000);
begin
Do_Nothing (Value'Address); -- BREAK
end Foo;
| 28.25 | 73 | 0.675221 |
29274fa744ae71fd778e688abb59225965c392df | 206 | adb | Ada | llvm-2.9/test/FrontendAda/element_copy.adb | DependableSystemsLab/Trident | 90b38ab3ce8b7ad743986ddf66eaea7d20d921cb | [
"MIT"
] | 5 | 2018-09-23T05:44:31.000Z | 2021-09-08T18:52:37.000Z | llvm-2.9/test/FrontendAda/element_copy.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 4 | 2019-06-13T16:27:31.000Z | 2021-06-07T07:24:31.000Z | llvm-2.9/test/FrontendAda/element_copy.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 4 | 2018-09-23T05:44:33.000Z | 2021-04-20T00:29:11.000Z | -- RUN: %llvmgcc -S -O2 %s -I%p/Support -o - | grep 105 | count 2
package body Element_Copy is
function F return VariableSizedField is
X : VariableSizedField;
begin
return X;
end;
end;
| 22.888889 | 65 | 0.650485 |
10805c76bdc7f22776098c804df954ad3a1edc21 | 13,005 | adb | Ada | regtests/security-oauth-servers-tests.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 19 | 2015-01-18T23:04:59.000Z | 2021-11-30T10:39:10.000Z | regtests/security-oauth-servers-tests.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 4 | 2020-08-06T15:37:51.000Z | 2022-02-04T20:19:39.000Z | regtests/security-oauth-servers-tests.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 3 | 2021-01-04T10:23:22.000Z | 2022-01-30T21:45:49.000Z | -----------------------------------------------------------------------
-- security-oauth-servers-tests - Unit tests for server side OAuth
-- Copyright (C) 2017, 2018, 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with Security.Auth.Tests;
with Security.OAuth.File_Registry;
package body Security.OAuth.Servers.Tests is
use Auth.Tests;
use File_Registry;
package Caller is new Util.Test_Caller (Test, "Security.OAuth.Servers");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Security.OAuth.Servers.Find_Application",
Test_Application_Manager'Access);
Caller.Add_Test (Suite, "Test Security.OAuth.Servers.Verify",
Test_User_Verify'Access);
Caller.Add_Test (Suite, "Test Security.OAuth.Servers.Token",
Test_Token_Password'Access);
Caller.Add_Test (Suite, "Test Security.OAuth.Servers.Authenticate",
Test_Bad_Token'Access);
Caller.Add_Test (Suite, "Test Security.OAuth.File_Registry.Load",
Test_Load_Registry'Access);
end Add_Tests;
-- ------------------------------
-- Test the application manager.
-- ------------------------------
procedure Test_Application_Manager (T : in out Test) is
Manager : File_Application_Manager;
App : Application;
begin
App.Set_Application_Identifier ("my-app-id");
App.Set_Application_Secret ("my-secret");
App.Set_Application_Callback ("my-callback");
Manager.Add_Application (App);
-- Check that we can find our application.
declare
A : constant Application'Class := Manager.Find_Application ("my-app-id");
begin
Util.Tests.Assert_Equals (T, "my-app-id", A.Get_Application_Identifier,
"Invalid application returned by Find");
end;
-- Check that an exception is raised for an invalid client ID.
begin
declare
A : constant Application'Class := Manager.Find_Application ("unkown-app-id");
begin
Util.Tests.Fail (T, "Found the application " & A.Get_Application_Identifier);
end;
exception
when Invalid_Application =>
null;
end;
end Test_Application_Manager;
-- ------------------------------
-- Test the user registration and verification.
-- ------------------------------
procedure Test_User_Verify (T : in out Test) is
Manager : File_Realm_Manager;
Auth : Principal_Access;
begin
Manager.Add_User ("Gandalf", "Mithrandir");
Manager.Verify ("Gandalf", "mithrandir", Auth);
T.Assert (Auth = null, "Verify password should fail with an invalid password");
Manager.Verify ("Sauron", "Mithrandir", Auth);
T.Assert (Auth = null, "Verify password should fail with an invalid user");
Manager.Verify ("Gandalf", "Mithrandir", Auth);
T.Assert (Auth /= null, "Verify password operation failed for a good user/password");
end Test_User_Verify;
-- ------------------------------
-- Test the token operation that produces an access token from user/password.
-- RFC 6749: Section 4.3. Resource Owner Password Credentials Grant
-- ------------------------------
procedure Test_Token_Password (T : in out Test) is
use type Util.Strings.Name_Access;
Apps : aliased File_Application_Manager;
Realm : aliased File_Realm_Manager;
Manager : Auth_Manager;
App : Application;
Grant : Grant_Type;
Auth_Grant : Grant_Type;
Params : Test_Parameters;
begin
-- Add one test application.
App.Set_Application_Identifier ("my-app-id");
App.Set_Application_Secret ("my-secret");
App.Set_Application_Callback ("my-callback");
Apps.Add_Application (App);
-- Add one test user.
Realm.Add_User ("Gandalf", "Mithrandir");
-- Configure the auth manager.
Manager.Set_Application_Manager (Apps'Unchecked_Access);
Manager.Set_Realm_Manager (Realm'Unchecked_Access);
Manager.Set_Private_Key ("server-private-key-no-so-secure");
Manager.Token (Params, Grant);
T.Assert (Grant.Status = Invalid_Grant, "Expecting Invalid_Grant when client_id is missing");
Params.Set_Parameter (Security.OAuth.CLIENT_ID, "");
Manager.Token (Params, Grant);
T.Assert (Grant.Status = Invalid_Grant, "Expecting Invalid_Grant when client_id is empty");
Params.Set_Parameter (Security.OAuth.CLIENT_ID, "unkown-app");
Manager.Token (Params, Grant);
T.Assert (Grant.Status = Invalid_Grant, "Expecting Invalid_Grant when client_id is invalid");
Params.Set_Parameter (Security.OAuth.CLIENT_ID, "my-app-id");
Params.Set_Parameter (Security.OAuth.GRANT_TYPE, "");
Manager.Token (Params, Grant);
T.Assert (Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant when client_id is empty");
Params.Set_Parameter (Security.OAuth.GRANT_TYPE, "password");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant when the user/password is missing");
Params.Set_Parameter (Security.OAuth.USERNAME, "Gandalf");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant when the password is missing");
Params.Set_Parameter (Security.OAuth.PASSWORD, "test");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant when the password is invalid");
Params.Set_Parameter (Security.OAuth.PASSWORD, "Mithrandir");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant when the client_secret is invalid");
Params.Set_Parameter (Security.OAuth.CLIENT_SECRET, "my-secret");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Valid_Grant,
"Expecting Valid_Grant when the user/password are correct");
T.Assert (Grant.Error = null, "Expecting null error");
T.Assert (Length (Grant.Token) > 20,
"Expecting a token with some reasonable size");
T.Assert (Grant.Auth /= null,
"Expecting a non null auth principal");
Util.Tests.Assert_Equals (T, "Gandalf", Grant.Auth.Get_Name,
"Invalid user name in the principal");
-- Verify the access token.
for I in 1 .. 5 loop
Manager.Authenticate (To_String (Grant.Token), Auth_Grant);
T.Assert (Auth_Grant.Request = Access_Grant,
"Expecting Access_Grant for the authenticate");
T.Assert (Auth_Grant.Status = Valid_Grant,
"Expecting Valid_Grant when the access token is checked");
T.Assert (Auth_Grant.Error = null, "Expecting null error for access_token");
T.Assert (Auth_Grant.Auth = Grant.Auth, "Expecting valid auth principal");
end loop;
-- Verify the modified access token.
Manager.Authenticate (To_String (Grant.Token) & "x", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for the authenticate");
Manager.Revoke (To_String (Grant.Token));
-- Verify the access is now denied.
for I in 1 .. 5 loop
Manager.Authenticate (To_String (Grant.Token), Auth_Grant);
T.Assert (Auth_Grant.Status = Revoked_Grant,
"Expecting Revoked_Grant for the authenticate");
end loop;
-- Change application token expiration time to 1 second.
App.Expire_Timeout := 1.0;
Apps.Add_Application (App);
-- Make the access token.
Manager.Token (Params, Grant);
T.Assert (Grant.Status = Valid_Grant,
"Expecting Valid_Grant when the user/password are correct");
-- Verify the access token.
for I in 1 .. 5 loop
Manager.Authenticate (To_String (Grant.Token), Auth_Grant);
T.Assert (Auth_Grant.Request = Access_Grant,
"Expecting Access_Grant for the authenticate");
T.Assert (Auth_Grant.Status = Valid_Grant,
"Expecting Valid_Grant when the access token is checked");
T.Assert (Auth_Grant.Error = null,
"Expecting null error for access_token");
T.Assert (Auth_Grant.Auth = Grant.Auth,
"Expecting valid auth principal");
end loop;
-- Wait for the token to expire.
delay 2.0;
for I in 1 .. 5 loop
Manager.Authenticate (To_String (Grant.Token), Auth_Grant);
T.Assert (Auth_Grant.Status = Expired_Grant,
"Expecting Expired when the access token is checked");
end loop;
end Test_Token_Password;
-- ------------------------------
-- Test the access token validation with invalid tokens (bad formed).
-- ------------------------------
procedure Test_Bad_Token (T : in out Test) is
Manager : Auth_Manager;
Auth_Grant : Grant_Type;
begin
Manager.Authenticate ("x", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
Manager.Authenticate (".", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
Manager.Authenticate ("..", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
Manager.Authenticate ("a..", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
Manager.Authenticate ("..b", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
Manager.Authenticate ("a..b", Auth_Grant);
T.Assert (Auth_Grant.Status = Invalid_Grant,
"Expecting Invalid_Grant for badly formed token");
end Test_Bad_Token;
-- ------------------------------
-- Test the loading configuration files for the File_Registry.
-- ------------------------------
procedure Test_Load_Registry (T : in out Test) is
Apps : aliased File_Application_Manager;
Realm : aliased File_Realm_Manager;
Manager : Auth_Manager;
Grant : Grant_Type;
Params : Test_Parameters;
begin
Apps.Load (Util.Tests.Get_Path ("regtests/files/user_apps.properties"), "apps");
Realm.Load (Util.Tests.Get_Path ("regtests/files/user_apps.properties"), "users");
-- Configure the auth manager.
Manager.Set_Application_Manager (Apps'Unchecked_Access);
Manager.Set_Realm_Manager (Realm'Unchecked_Access);
Manager.Set_Private_Key ("server-private-key-no-so-secure");
Params.Set_Parameter (Security.OAuth.CLIENT_ID, "app-id-1");
Params.Set_Parameter (Security.OAuth.CLIENT_SECRET, "app-secret-1");
Params.Set_Parameter (Security.OAuth.GRANT_TYPE, "password");
Params.Set_Parameter (Security.OAuth.USERNAME, "joe");
Params.Set_Parameter (Security.OAuth.PASSWORD, "test");
Manager.Token (Params, Grant);
T.Assert (Grant.Request = Password_Grant,
"Expecting Password_Grant for the grant request");
T.Assert (Grant.Status = Valid_Grant,
"Expecting Valid_Grant when the user/password are correct");
end Test_Load_Registry;
end Security.OAuth.Servers.Tests;
| 43.787879 | 99 | 0.630911 |
59ccf830f85d4585f4c3583e30ef32c69e59abc9 | 330 | ads | Ada | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-statements.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-statements.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-statements.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | package Asis_Adapter.Element.Statements is
procedure Do_Pre_Child_Processing
(Element : in Asis.Element;
State : in out Class);
private
-- For debuggng:
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & "Statements";
end Asis_Adapter.Element.Statements;
| 23.571429 | 63 | 0.718182 |
58ab11a0b3aa4623cf5c1e5a0e36629e77616145 | 1,191 | ads | Ada | gdb-7.3/gdb/testsuite/gdb.ada/frame_args/pck.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | gdb-7.3/gdb/testsuite/gdb.ada/frame_args/pck.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | gdb-7.3/gdb/testsuite/gdb.ada/frame_args/pck.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | -- Copyright 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Struct is record
A : Integer;
B : Integer;
end record;
type Arr is array (1 .. 3) of Integer;
procedure Call_Me (Int : Integer;
Flt : Float;
Bln : Boolean;
Ary : Arr; -- Non scalar
Chr : Character;
Sad : System.Address;
Rec : Struct); -- Non scalar
end Pck;
| 31.342105 | 73 | 0.622166 |
58ceb832c7077aefd0541d77cf31d3a5f972fad1 | 5,163 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2111b.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/ce2111b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2111b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE2111B.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 A SUCCESSFUL RESET POSITIONS THE INDEX CORRECTLY
-- TO THE START OF THE FILE FOR DIRECT IO.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- RESET FOR DIRECT FILES.
-- HISTORY:
-- DLD 08/13/82
-- JBG 03/24/83
-- EG 05/29/85
-- JLH 07/23/87 ADDED CHECKS FOR USE_ERROR WHEN FILE IS RESET.
WITH REPORT; USE REPORT;
WITH DIRECT_IO;
PROCEDURE CE2111B IS
PACKAGE DIR_IO IS NEW DIRECT_IO (INTEGER);
USE DIR_IO;
TEST_FILE_ONE : DIR_IO.FILE_TYPE;
DATUM : INTEGER;
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE2111B", "CHECK THAT SUCCESSFUL RESETS POSITION THE " &
"INDEX CORRECTLY");
-- CREATE AND INITIALIZE TEST FILE
BEGIN
CREATE (TEST_FILE_ONE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON CREATE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED ON CREATE");
RAISE INCOMPLETE;
END;
WRITE (TEST_FILE_ONE, 5);
WRITE (TEST_FILE_ONE, 6);
WRITE (TEST_FILE_ONE, 7);
WRITE (TEST_FILE_ONE, 8);
-- CHECK THAT RESET POSITIONS INDEX CORRECTLY FOR OUT_FILE
BEGIN
RESET (TEST_FILE_ONE);
IF INDEX (TEST_FILE_ONE) /= 1 THEN
FAILED ("RESET INCORRECTLY POSITIONED FILE FOR " &
"OUT_FILE");
END IF;
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("RESET NOT SUPPORTED FOR OUT_FILE");
RAISE INCOMPLETE;
END;
-- WRITE MORE DATA
WRITE (TEST_FILE_ONE, 2);
CLOSE (TEST_FILE_ONE);
-- NOW CHECK TO SEE THAT RESET WORKED FOR OUT_FILE
BEGIN
OPEN (TEST_FILE_ONE, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("DIR_IO NOT SUPPORTED FOR IN_FILE OPEN");
RAISE INCOMPLETE;
END;
READ (TEST_FILE_ONE, DATUM);
IF DATUM /= 2 THEN
FAILED ("RESET FAILED FOR OUT_FILE");
END IF;
-- POSITION POINTER APPROPRIATELY FOR IN_FILE RESET
READ (TEST_FILE_ONE, DATUM);
-- RESET IN_FILE
BEGIN
RESET (TEST_FILE_ONE);
IF INDEX (TEST_FILE_ONE) /= 1 THEN
FAILED ("RESET INCORRECTLY POSITIONED FILE " &
"FOR IN_FILE");
END IF;
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("RESET NOT SUPPORTED FOR IN_FILE");
RAISE INCOMPLETE;
END;
-- VALIDATE IN_FILE RESET
READ (TEST_FILE_ONE, DATUM);
IF DATUM /= 2 THEN
FAILED ("RESET FAILED FOR IN_FILE");
END IF;
-- VALIDATE RESET FOR IN_OUT FILE
CLOSE (TEST_FILE_ONE);
BEGIN
OPEN (TEST_FILE_ONE, INOUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("DIR_IO NOT SUPPORTED FOR INOUT_FILE " &
"OPEN");
RAISE INCOMPLETE;
END;
-- WRITE NEW DATA
WRITE (TEST_FILE_ONE, 3);
-- RESET INOUT_FILE
BEGIN
RESET (TEST_FILE_ONE);
IF INDEX (TEST_FILE_ONE) /= 1 THEN
FAILED ("RESET INCORRECTLY POSITIONED FILE " &
"FOR INOUT_FILE");
END IF;
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("RESET NOT SUPPORTED FOR INOUT_FILE");
RAISE INCOMPLETE;
END;
-- VALIDATE RESET
READ (TEST_FILE_ONE, DATUM);
IF DATUM /= 3 THEN
FAILED ("RESET FAILED FOR INOUT_FILE");
END IF;
-- DELETE TEST FILE
BEGIN
DELETE (TEST_FILE_ONE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE2111B;
| 28.059783 | 79 | 0.59907 |
223e33dd9eda6a933b3338d829735de3fa308d3b | 11,719 | adb | Ada | src/fltk-widgets-groups-input_choices.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-groups-input_choices.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-groups-input_choices.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Ada.Unchecked_Deallocation,
Interfaces.C.Strings,
System;
use type
Interfaces.C.int,
Interfaces.C.Strings.chars_ptr,
System.Address;
package body FLTK.Widgets.Groups.Input_Choices is
procedure input_choice_set_draw_hook
(W, D : in System.Address);
pragma Import (C, input_choice_set_draw_hook, "input_choice_set_draw_hook");
pragma Inline (input_choice_set_draw_hook);
procedure input_choice_set_handle_hook
(W, H : in System.Address);
pragma Import (C, input_choice_set_handle_hook, "input_choice_set_handle_hook");
pragma Inline (input_choice_set_handle_hook);
function new_fl_input_choice
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_input_choice, "new_fl_input_choice");
pragma Inline (new_fl_input_choice);
procedure free_fl_input_choice
(W : in System.Address);
pragma Import (C, free_fl_input_choice, "free_fl_input_choice");
pragma Inline (free_fl_input_choice);
function fl_input_choice_input
(N : in System.Address)
return System.Address;
pragma Import (C, fl_input_choice_input, "fl_input_choice_input");
pragma Inline (fl_input_choice_input);
function fl_input_choice_menubutton
(N : in System.Address)
return System.Address;
pragma Import (C, fl_input_choice_menubutton, "fl_input_choice_menubutton");
pragma Inline (fl_input_choice_menubutton);
procedure fl_input_choice_clear
(N : in System.Address);
pragma Import (C, fl_input_choice_clear, "fl_input_choice_clear");
pragma Inline (fl_input_choice_clear);
function fl_input_choice_changed
(N : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_input_choice_changed, "fl_input_choice_changed");
pragma Inline (fl_input_choice_changed);
procedure fl_input_choice_clear_changed
(N : in System.Address);
pragma Import (C, fl_input_choice_clear_changed, "fl_input_choice_clear_changed");
pragma Inline (fl_input_choice_clear_changed);
procedure fl_input_choice_set_changed
(N : in System.Address);
pragma Import (C, fl_input_choice_set_changed, "fl_input_choice_set_changed");
pragma Inline (fl_input_choice_set_changed);
function fl_input_choice_get_down_box
(N : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_input_choice_get_down_box, "fl_input_choice_get_down_box");
pragma Inline (fl_input_choice_get_down_box);
procedure fl_input_choice_set_down_box
(N : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_input_choice_set_down_box, "fl_input_choice_set_down_box");
pragma Inline (fl_input_choice_set_down_box);
function fl_input_choice_get_textcolor
(N : in System.Address)
return Interfaces.C.unsigned;
pragma Import (C, fl_input_choice_get_textcolor, "fl_input_choice_get_textcolor");
pragma Inline (fl_input_choice_get_textcolor);
procedure fl_input_choice_set_textcolor
(N : in System.Address;
T : in Interfaces.C.unsigned);
pragma Import (C, fl_input_choice_set_textcolor, "fl_input_choice_set_textcolor");
pragma Inline (fl_input_choice_set_textcolor);
function fl_input_choice_get_textfont
(N : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_input_choice_get_textfont, "fl_input_choice_get_textfont");
pragma Inline (fl_input_choice_get_textfont);
procedure fl_input_choice_set_textfont
(N : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_input_choice_set_textfont, "fl_input_choice_set_textfont");
pragma Inline (fl_input_choice_set_textfont);
function fl_input_choice_get_textsize
(N : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_input_choice_get_textsize, "fl_input_choice_get_textsize");
pragma Inline (fl_input_choice_get_textsize);
procedure fl_input_choice_set_textsize
(N : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_input_choice_set_textsize, "fl_input_choice_set_textsize");
pragma Inline (fl_input_choice_set_textsize);
function fl_input_choice_get_value
(N : in System.Address)
return Interfaces.C.Strings.chars_ptr;
pragma Import (C, fl_input_choice_get_value, "fl_input_choice_get_value");
pragma Inline (fl_input_choice_get_value);
procedure fl_input_choice_set_value
(N : in System.Address;
T : in Interfaces.C.char_array);
pragma Import (C, fl_input_choice_set_value, "fl_input_choice_set_value");
pragma Inline (fl_input_choice_set_value);
procedure fl_input_choice_set_value2
(N : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_input_choice_set_value2, "fl_input_choice_set_value2");
pragma Inline (fl_input_choice_set_value2);
procedure fl_input_choice_draw
(W : in System.Address);
pragma Import (C, fl_input_choice_draw, "fl_input_choice_draw");
pragma Inline (fl_input_choice_draw);
function fl_input_choice_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_input_choice_handle, "fl_input_choice_handle");
pragma Inline (fl_input_choice_handle);
procedure Free is new Ada.Unchecked_Deallocation
(INP.Input, Input_Access);
procedure Free is new Ada.Unchecked_Deallocation
(MB.Menu_Button, Menu_Button_Access);
procedure Finalize
(This : in out Input_Choice) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Input_Choice'Class
then
Group (This).Clear;
free_fl_input_choice (This.Void_Ptr);
Free (This.My_Input);
Free (This.My_Menu_Button);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Group (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Input_Choice is
begin
return This : Input_Choice do
This.Void_Ptr := new_fl_input_choice
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_group_end (This.Void_Ptr);
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
input_choice_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
input_choice_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
This.My_Input := new INP.Input;
Wrapper (This.My_Input.all).Void_Ptr :=
fl_input_choice_input (This.Void_Ptr);
Wrapper (This.My_Input.all).Needs_Dealloc := False;
This.My_Menu_Button := new MB.Menu_Button;
Wrapper (This.My_Menu_Button.all).Void_Ptr :=
fl_input_choice_menubutton (This.Void_Ptr);
Wrapper (This.My_Menu_Button.all).Needs_Dealloc := False;
end return;
end Create;
end Forge;
function Input
(This : in out Input_Choice)
return INP.Input_Reference is
begin
return (Data => This.My_Input);
end Input;
function Menu_Button
(This : in out Input_Choice)
return MB.Menu_Button_Reference is
begin
return (Data => This.My_Menu_Button);
end Menu_Button;
procedure Clear
(This : in out Input_Choice) is
begin
fl_input_choice_clear (This.Void_Ptr);
end Clear;
function Has_Changed
(This : in Input_Choice)
return Boolean is
begin
return fl_input_choice_changed (This.Void_Ptr) /= 0;
end Has_Changed;
procedure Clear_Changed
(This : in out Input_Choice) is
begin
fl_input_choice_clear_changed (This.Void_Ptr);
end Clear_Changed;
procedure Set_Changed
(This : in out Input_Choice;
To : in Boolean) is
begin
if To then
fl_input_choice_set_changed (This.Void_Ptr);
end if;
end Set_Changed;
function Get_Down_Box
(This : in Input_Choice)
return Box_Kind is
begin
return Box_Kind'Val (fl_input_choice_get_down_box (This.Void_Ptr));
end Get_Down_Box;
procedure Set_Down_Box
(This : in out Input_Choice;
To : in Box_Kind) is
begin
fl_input_choice_set_down_box (This.Void_Ptr, Box_Kind'Pos (To));
end Set_Down_Box;
function Get_Text_Color
(This : in Input_Choice)
return Color is
begin
return Color (fl_input_choice_get_textcolor (This.Void_Ptr));
end Get_Text_Color;
procedure Set_Text_Color
(This : in out Input_Choice;
To : in Color) is
begin
fl_input_choice_set_textcolor (This.Void_Ptr, Interfaces.C.unsigned (To));
end Set_Text_Color;
function Get_Text_Font
(This : in Input_Choice)
return Font_Kind is
begin
return Font_Kind'Val (fl_input_choice_get_textfont (This.Void_Ptr));
end Get_Text_Font;
procedure Set_Text_Font
(This : in out Input_Choice;
To : in Font_Kind) is
begin
fl_input_choice_set_textfont (This.Void_Ptr, Font_Kind'Pos (To));
end Set_Text_Font;
function Get_Text_Size
(This : in Input_Choice)
return Font_Size is
begin
return Font_Size (fl_input_choice_get_textsize (This.Void_Ptr));
end Get_Text_Size;
procedure Set_Text_Size
(This : in out Input_Choice;
To : in Font_Size) is
begin
fl_input_choice_set_textsize (This.Void_Ptr, Interfaces.C.int (To));
end Set_Text_Size;
function Get_Input
(This : in Input_Choice)
return String
is
Ptr : Interfaces.C.Strings.chars_ptr := fl_input_choice_get_value (This.Void_Ptr);
begin
if Ptr = Interfaces.C.Strings.Null_Ptr then
return "";
else
-- pointer to internal buffer so no free necessary
return Interfaces.C.Strings.Value (Ptr);
end if;
end Get_Input;
procedure Set_Input
(This : in out Input_Choice;
To : in String) is
begin
fl_input_choice_set_value (This.Void_Ptr, Interfaces.C.To_C (To));
end Set_Input;
procedure Set_Item
(This : in out Input_Choice;
Num : in Integer) is
begin
fl_input_choice_set_value2 (This.Void_Ptr, Interfaces.C.int (Num));
end Set_Item;
procedure Draw
(This : in out Input_Choice) is
begin
fl_input_choice_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Input_Choice;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_input_choice_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Groups.Input_Choices;
| 29.151741 | 90 | 0.650226 |
31f7d634102c2ab804c10b64695134d252d690e0 | 23,639 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/sem_eval.ads | 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/sem_eval.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/sem_eval.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ E V A L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains various subprograms involved in compile time
-- evaluation of expressions and checks for staticness of expressions and
-- types. It also contains the circuitry for checking for violations of pure
-- and preelaborated conditions (this naturally goes here, since these rules
-- involve consideration of staticness).
-- Note: the static evaluation for attributes is found in Sem_Attr even though
-- logically it belongs here. We have done this so that it is easier to add
-- new attributes to GNAT.
with Types; use Types;
with Uintp; use Uintp;
with Urealp; use Urealp;
package Sem_Eval is
------------------------------------
-- Handling of Static Expressions --
------------------------------------
-- This package contains a set of routine that process individual
-- subexpression nodes with the objective of folding (precomputing) the
-- value of static expressions that are known at compile time and properly
-- computing the setting of two flags that appear in every subexpression
-- node:
-- Is_Static_Expression
-- This flag is set on any expression that is static according to the
-- rules in (RM 4.9(3-32)).
-- Raises_Constraint_Error
-- This flag indicatest that it is known at compile time that the
-- evaluation of an expression raises constraint error. If the
-- expression is static, and this flag is off, then it is also known at
-- compile time that the expression does not raise constraint error
-- (i.e. the flag is accurate for static expressions, and conservative
-- for non-static expressions.
-- If a static expression does not raise constraint error, then the
-- Raises_Constraint_Error flag is off, and the expression must be computed
-- at compile time, which means that it has the form of either a literal,
-- or a constant that is itself (recursively) either a literal or a
-- constant.
-- The above rules must be followed exactly in order for legality checks to
-- be accurate. For subexpressions that are not static according to the RM
-- definition, they are sometimes folded anyway, but of course in this case
-- Is_Static_Expression is not set.
-------------------------------
-- Compile-Time Known Values --
-------------------------------
-- For most legality checking purposes the flag Is_Static_Expression
-- defined in Sinfo should be used. This package also provides a routine
-- called Is_OK_Static_Expression which in addition of checking that an
-- expression is static in the RM 4.9 sense, it checks that the expression
-- does not raise constraint error. In fact for certain legality checks not
-- only do we need to ascertain that the expression is static, but we must
-- also ensure that it does not raise constraint error.
--
-- Neither of Is_Static_Expression and Is_OK_Static_Expression should be
-- used for compile time evaluation purposes. In fact certain expression
-- whose value is known at compile time are not static in the RM 4.9 sense.
-- A typical example is:
--
-- C : constant Integer := Record_Type'Size;
--
-- The expression 'C' is not static in the technical RM sense, but for many
-- simple record types, the size is in fact known at compile time. When we
-- are trying to perform compile time constant folding (for instance for
-- expressions like C + 1, Is_Static_Expression or Is_OK_Static_Expression
-- are not the right functions to test if folding is possible. Instead, we
-- use Compile_Time_Known_Value. All static expressions that do not raise
-- constraint error (i.e. those for which Is_OK_Static_Expression is true)
-- are known at compile time, but as shown by the above example, there are
-- cases of non-static expressions which are known at compile time.
-----------------
-- Subprograms --
-----------------
procedure Check_Non_Static_Context (N : Node_Id);
-- Deals with the special check required for a static expression that
-- appears in a non-static context, i.e. is not part of a larger static
-- expression (see RM 4.9(35)), i.e. the value of the expression must be
-- within the base range of the base type of its expected type. A check is
-- also made for expressions that are inside the base range, but outside
-- the range of the expected subtype (this is a warning message rather than
-- an illegality).
--
-- Note: most cases of non-static context checks are handled within
-- Sem_Eval itself, including all cases of expressions at the outer level
-- (i.e. those that are not a subexpression). Currently the only outside
-- customer for this procedure is Sem_Attr (because Eval_Attribute is
-- there). There is also one special case arising from ranges (see body of
-- Resolve_Range).
procedure Check_String_Literal_Length (N : Node_Id; Ttype : Entity_Id);
-- N is either a string literal, or a constraint error node. In the latter
-- case, the situation is already dealt with, and the call has no effect.
-- In the former case, if the target type, Ttyp is constrained, then a
-- check is made to see if the string literal is of appropriate length.
type Compare_Result is (LT, LE, EQ, GT, GE, NE, Unknown);
subtype Compare_GE is Compare_Result range EQ .. GE;
subtype Compare_LE is Compare_Result range LT .. EQ;
function Compile_Time_Compare
(L, R : Node_Id;
Rec : Boolean := False) return Compare_Result;
-- Given two expression nodes, finds out whether it can be determined at
-- compile time how the runtime values will compare. An Unknown result
-- means that the result of a comparison cannot be determined at compile
-- time, otherwise the returned result indicates the known result of the
-- comparison, given as tightly as possible (i.e. EQ or LT is preferred
-- returned value to LE). Rec is a parameter that is set True for a
-- recursive call from within Compile_Time_Compare to avoid some infinite
-- recursion cases. It should never be set by a client.
procedure Flag_Non_Static_Expr (Msg : String; Expr : Node_Id);
-- This procedure is called after it has been determined that Expr is not
-- static when it is required to be. Msg is the text of a message that
-- explains the error. This procedure checks if an error is already posted
-- on Expr, if so, it does nothing unless All_Errors_Mode is set in which
-- case this flag is ignored. Otherwise the given message is posted using
-- Error_Msg_F, and then Why_Not_Static is called on Expr to generate
-- additional messages. The string given as Msg should end with ! to make
-- it an unconditional message, to ensure that if it is posted, the entire
-- set of messages is all posted.
function Is_OK_Static_Expression (N : Node_Id) return Boolean;
-- An OK static expression is one that is static in the RM definition sense
-- and which does not raise constraint error. For most legality checking
-- purposes you should use Is_Static_Expression. For those legality checks
-- where the expression N should not raise constaint error use this
-- routine. This routine is *not* to be used in contexts where the test is
-- for compile time evaluation purposes. Use Compile_Time_Known_Value
-- instead (see section on "Compile-Time Known Values" above).
function Is_Static_Range (N : Node_Id) return Boolean;
-- Determine if range is static, as defined in RM 4.9(26). The only allowed
-- argument is an N_Range node (but note that the semantic analysis of
-- equivalent range attribute references already turned them into the
-- equivalent range).
function Is_OK_Static_Range (N : Node_Id) return Boolean;
-- Like Is_Static_Range, but also makes sure that the bounds of the range
-- are compile-time evaluable (i.e. do not raise constraint error). A
-- result of true means that the bounds are compile time evaluable. A
-- result of false means they are not (either because the range is not
-- static, or because one or the other bound raises CE).
function Is_Static_Subtype (Typ : Entity_Id) return Boolean;
-- Determines whether a subtype fits the definition of an Ada static
-- subtype as given in (RM 4.9(26)).
function Is_OK_Static_Subtype (Typ : Entity_Id) return Boolean;
-- Like Is_Static_Subtype but also makes sure that the bounds of the
-- subtype are compile-time evaluable (i.e. do not raise constraint error).
-- A result of true means that the bounds are compile time evaluable. A
-- result of false means they are not (either because the range is not
-- static, or because one or the other bound raises CE).
function Subtypes_Statically_Compatible
(T1 : Entity_Id;
T2 : Entity_Id) return Boolean;
-- Returns true if the subtypes are unconstrained or the constraint on
-- on T1 is statically compatible with T2 (as defined by 4.9.1(4)).
-- Otherwise returns false.
function Subtypes_Statically_Match (T1, T2 : Entity_Id) return Boolean;
-- Determine whether two types T1, T2, which have the same base type,
-- are statically matching subtypes (RM 4.9.1(1-2)).
function Compile_Time_Known_Value (Op : Node_Id) return Boolean;
-- Returns true if Op is an expression not raising constraint error whose
-- value is known at compile time. This is true if Op is a static
-- expression, but can also be true for expressions which are technically
-- non-static but which are in fact known at compile time, such as the
-- static lower bound of a non-static range or the value of a constant
-- object whose initial value is static. Note that this routine is defended
-- against unanalyzed expressions. Such expressions will not cause a
-- blowup, they may cause pessimistic (i.e. False) results to be returned.
function Compile_Time_Known_Value_Or_Aggr (Op : Node_Id) return Boolean;
-- Similar to Compile_Time_Known_Value, but also returns True if the value
-- is a compile time known aggregate, i.e. an aggregate all of whose
-- constituent expressions are either compile time known values or compile
-- time known aggregates.
function Compile_Time_Known_Bounds (T : Entity_Id) return Boolean;
-- If T is an array whose index bounds are all known at compile time, then
-- True is returned, if T is not an array, or one or more of its index
-- bounds is not known at compile time, then False is returned.
function Expr_Value (N : Node_Id) return Uint;
-- Returns the folded value of the expression N. This function is called in
-- instances where it has already been determined that the expression is
-- static or its value is compile time known (Compile_Time_Known_Value (N)
-- returns True). This version is used for integer values, and enumeration
-- or character literals. In the latter two cases, the value returned is
-- the Pos value in the relevant enumeration type. It can also be used for
-- fixed-point values, in which case it returns the corresponding integer
-- value. It cannot be used for floating-point values.
function Expr_Value_E (N : Node_Id) return Entity_Id;
-- Returns the folded value of the expression. This function is called in
-- instances where it has already been determined that the expression is
-- static or its value known at compile time. This version is used for
-- enumeration types and returns the corresponding enumeration literal.
function Expr_Value_R (N : Node_Id) return Ureal;
-- Returns the folded value of the expression. This function is called in
-- instances where it has already been determined that the expression is
-- static or its value known at compile time. This version is used for real
-- values (including both the floating-point and fixed-point cases). In the
-- case of a fixed-point type, the real value is returned (cf above version
-- returning Uint).
function Expr_Value_S (N : Node_Id) return Node_Id;
-- Returns the folded value of the expression. This function is called
-- in instances where it has already been determined that the expression
-- is static or its value is known at compile time. This version is used
-- for string types and returns the corresponding N_String_Literal node.
function Expr_Rep_Value (N : Node_Id) return Uint;
-- This is identical to Expr_Value, except in the case of enumeration
-- literals of types for which an enumeration representation clause has
-- been given, in which case it returns the representation value rather
-- than the pos value. This is the value that is needed for generating code
-- sequences, while the Expr_Value value is appropriate for compile time
-- constraint errors or getting the logical value. Note that this function
-- does NOT concern itself with biased values, if the caller needs a
-- properly biased value, the subtraction of the bias must be handled
-- explicitly.
procedure Eval_Actual (N : Node_Id);
procedure Eval_Allocator (N : Node_Id);
procedure Eval_Arithmetic_Op (N : Node_Id);
procedure Eval_Call (N : Node_Id);
procedure Eval_Character_Literal (N : Node_Id);
procedure Eval_Concatenation (N : Node_Id);
procedure Eval_Conditional_Expression (N : Node_Id);
procedure Eval_Entity_Name (N : Node_Id);
procedure Eval_Indexed_Component (N : Node_Id);
procedure Eval_Integer_Literal (N : Node_Id);
procedure Eval_Logical_Op (N : Node_Id);
procedure Eval_Membership_Op (N : Node_Id);
procedure Eval_Named_Integer (N : Node_Id);
procedure Eval_Named_Real (N : Node_Id);
procedure Eval_Op_Expon (N : Node_Id);
procedure Eval_Op_Not (N : Node_Id);
procedure Eval_Real_Literal (N : Node_Id);
procedure Eval_Relational_Op (N : Node_Id);
procedure Eval_Shift (N : Node_Id);
procedure Eval_Short_Circuit (N : Node_Id);
procedure Eval_Slice (N : Node_Id);
procedure Eval_String_Literal (N : Node_Id);
procedure Eval_Qualified_Expression (N : Node_Id);
procedure Eval_Type_Conversion (N : Node_Id);
procedure Eval_Unary_Op (N : Node_Id);
procedure Eval_Unchecked_Conversion (N : Node_Id);
procedure Fold_Str (N : Node_Id; Val : String_Id; Static : Boolean);
-- Rewrite N with a new N_String_Literal node as the result of the compile
-- time evaluation of the node N. Val is the resulting string value from
-- the folding operation. The Is_Static_Expression flag is set in the
-- result node. The result is fully analyzed and resolved. Static indicates
-- whether the result should be considered static or not (True = consider
-- static). The point here is that normally all string literals are static,
-- but if this was the result of some sequence of evaluation where values
-- were known at compile time but not static, then the result is not
-- static.
procedure Fold_Uint (N : Node_Id; Val : Uint; Static : Boolean);
-- Rewrite N with a (N_Integer_Literal, N_Identifier, N_Character_Literal)
-- node as the result of the compile time evaluation of the node N. Val is
-- the result in the integer case and is the position of the literal in the
-- literals list for the enumeration case. Is_Static_Expression is set True
-- in the result node. The result is fully analyzed/resolved. Static
-- indicates whether the result should be considered static or not (True =
-- consider static). The point here is that normally all string literals
-- are static, but if this was the result of some sequence of evaluation
-- where values were known at compile time but not static, then the result
-- is not static.
procedure Fold_Ureal (N : Node_Id; Val : Ureal; Static : Boolean);
-- Rewrite N with a new N_Real_Literal node as the result of the compile
-- time evaluation of the node N. Val is the resulting real value from the
-- folding operation. The Is_Static_Expression flag is set in the result
-- node. The result is fully analyzed and result. Static indicates whether
-- the result should be considered static or not (True = consider static).
-- The point here is that normally all string literals are static, but if
-- this was the result of some sequence of evaluation where values were
-- known at compile time but not static, then the result is not static.
function Is_In_Range
(N : Node_Id;
Typ : Entity_Id;
Fixed_Int : Boolean := False;
Int_Real : Boolean := False) return Boolean;
-- Returns True if it can be guaranteed at compile time that expression is
-- known to be in range of the subtype Typ. If the values of N or of either
-- bouds of Type are unknown at compile time, False will always be
-- returned. A result of False does not mean that the expression is out of
-- range, merely that it cannot be determined at compile time that it is in
-- range. If Typ is a floating point type or Int_Real is set, any integer
-- value is treated as though it was a real value (i.e. the underlying real
-- value is used). In this case we use the corresponding real value, both
-- for the bounds of Typ, and for the value of the expression N. If Typ is
-- a fixed type or a discrete type and Int_Real is False but flag Fixed_Int
-- is True then any fixed-point value is treated as though it was discrete
-- value (i.e. the underlying integer value is used). In this case we use
-- the corresponding integer value, both for the bounds of Typ, and for the
-- value of the expression N. If Typ is a discret type and Fixed_Int as
-- well as Int_Real are false, intere values are used throughout.
function Is_Out_Of_Range
(N : Node_Id;
Typ : Entity_Id;
Fixed_Int : Boolean := False;
Int_Real : Boolean := False) return Boolean;
-- Returns True if it can be guaranteed at compile time that expression is
-- known to be out of range of the subtype Typ. True is returned if Typ is
-- a scalar type, at least one of whose bounds is known at compile time,
-- and N is a compile time known expression which can be determined to be
-- outside a compile_time known bound of Typ. A result of False does not
-- mean that the expression is in range, but rather merely that it cannot
-- be determined at compile time that it is out of range. Flags Int_Real
-- and Fixed_Int are used as in routine Is_In_Range above.
function In_Subrange_Of
(T1 : Entity_Id;
T2 : Entity_Id;
Fixed_Int : Boolean := False) return Boolean;
-- Returns True if it can be guaranteed at compile time that the range of
-- values for scalar type T1 are always in the range of scalar type T2. A
-- result of False does not mean that T1 is not in T2's subrange, only that
-- it cannot be determined at compile time. Flag Fixed_Int is used as in
-- routine Is_In_Range above.
function Is_Null_Range (Lo : Node_Id; Hi : Node_Id) return Boolean;
-- Returns True if it can guarantee that Lo .. Hi is a null range. If it
-- cannot (because the value of Lo or Hi is not known at compile time) then
-- it returns False.
function Not_Null_Range (Lo : Node_Id; Hi : Node_Id) return Boolean;
-- Returns True if it can guarantee that Lo .. Hi is not a null range. If
-- it cannot (because the value of Lo or Hi is not known at compile time)
-- then it returns False.
procedure Why_Not_Static (Expr : Node_Id);
-- This procedure may be called after generating an error message that
-- complains that something is non-static. If it finds good reasons, it
-- generates one or more error messages pointing the appropriate offending
-- component of the expression. If no good reasons can be figured out, then
-- no messages are generated. The expectation here is that the caller has
-- already issued a message complaining that the expression is non-static.
-- Note that this message should be placed using Error_Msg_F or
-- Error_Msg_FE, so that it will sort before any messages placed by this
-- call. Note that it is fine to call Why_Not_Static with something that is
-- not an expression, and usually this has no effect, but in some cases
-- (N_Parameter_Association or N_Range), it makes sense for the internal
-- recursive calls.
procedure Initialize;
-- Initializes the internal data structures. Must be called before each
-- separate main program unit (e.g. in a GNSA/ASIS context).
private
-- The Eval routines are all marked inline, since they are called once
pragma Inline (Eval_Actual);
pragma Inline (Eval_Allocator);
pragma Inline (Eval_Character_Literal);
pragma Inline (Eval_Conditional_Expression);
pragma Inline (Eval_Indexed_Component);
pragma Inline (Eval_Named_Integer);
pragma Inline (Eval_Named_Real);
pragma Inline (Eval_Real_Literal);
pragma Inline (Eval_Shift);
pragma Inline (Eval_Slice);
pragma Inline (Eval_String_Literal);
pragma Inline (Eval_Unchecked_Conversion);
pragma Inline (Is_OK_Static_Expression);
end Sem_Eval;
| 56.688249 | 79 | 0.678709 |
297fd8e071702c517db3dd74d5d2d0e628834ef1 | 8,071 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-dwalin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-dwalin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-dwalin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . D W A R F _ L I N E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-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 provides routines to read DWARF line number information from
-- a generic object file with as little overhead as possible. This allows
-- conversions from PC addresses to human readable source locations.
--
-- Objects must be built with debugging information, however only the
-- .debug_line section of the object file is referenced. In cases where object
-- size is a consideration it's possible to strip all other .debug sections,
-- which will decrease the size of the object significantly.
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we can get
-- elaboration circularities when polling is turned on
with Ada.Exceptions.Traceback;
with System.Object_Reader;
with System.Storage_Elements;
with System.Bounded_Strings;
package System.Dwarf_Lines is
package AET renames Ada.Exceptions.Traceback;
package SOR renames System.Object_Reader;
type Dwarf_Context (In_Exception : Boolean := False) is private;
-- Type encapsulation the state of the Dwarf reader. When In_Exception
-- is True we are parsing as part of a exception handler decorator, we do
-- not want an exception to be raised, the parsing is done safely skipping
-- DWARF file that cannot be read or with stripped debug section for
-- example.
procedure Open
(File_Name : String;
C : out Dwarf_Context;
Success : out Boolean);
procedure Close (C : in out Dwarf_Context);
-- Open and close files
procedure Set_Load_Address (C : in out Dwarf_Context; Addr : Address);
-- Set the load address of a file. This is used to rebase PIE (Position
-- Independant Executable) binaries.
function Is_Inside (C : Dwarf_Context; Addr : Address) return Boolean;
pragma Inline (Is_Inside);
-- Return true iff a run-time address Addr is within the module
function Low_Address (C : Dwarf_Context)
return System.Address;
pragma Inline (Low_Address);
-- Return the lowest address of C, accounting for the module load address
procedure Dump (C : in out Dwarf_Context);
-- Dump each row found in the object's .debug_lines section to standard out
procedure Dump_Cache (C : Dwarf_Context);
-- Dump the cache (if present)
procedure Enable_Cache (C : in out Dwarf_Context);
-- Read symbols information to speed up Symbolic_Traceback.
procedure Symbolic_Traceback
(Cin : Dwarf_Context;
Traceback : AET.Tracebacks_Array;
Suppress_Hex : Boolean;
Symbol_Found : in out Boolean;
Res : in out System.Bounded_Strings.Bounded_String);
-- Generate a string for a traceback suitable for displaying to the user.
-- If one or more symbols are found, Symbol_Found is set to True. This
-- allows the caller to fall back to hexadecimal addresses.
Dwarf_Error : exception;
-- Raised if a problem is encountered parsing DWARF information. Can be a
-- result of a logic error or malformed DWARF information.
private
-- The following section numbers reference
-- "DWARF Debugging Information Format, Version 3"
-- published by the Standards Group, http://freestandards.org.
-- 6.2.2 State Machine Registers
type Line_Info_Registers is record
Address : SOR.uint64;
File : SOR.uint32;
Line : SOR.uint32;
Column : SOR.uint32;
Is_Stmt : Boolean;
Basic_Block : Boolean;
End_Sequence : Boolean;
Prologue_End : Boolean;
Epilogue_Begin : Boolean;
ISA : SOR.uint32;
Is_Row : Boolean;
end record;
-- 6.2.4 The Line Number Program Prologue
MAX_OPCODE_LENGTHS : constant := 256;
type Opcodes_Lengths_Array is
array (SOR.uint32 range 1 .. MAX_OPCODE_LENGTHS) of SOR.uint8;
type Line_Info_Prologue is record
Unit_Length : SOR.uint32;
Version : SOR.uint16;
Prologue_Length : SOR.uint32;
Min_Isn_Length : SOR.uint8;
Default_Is_Stmt : SOR.uint8;
Line_Base : SOR.int8;
Line_Range : SOR.uint8;
Opcode_Base : SOR.uint8;
Opcode_Lengths : Opcodes_Lengths_Array;
Includes_Offset : SOR.Offset;
File_Names_Offset : SOR.Offset;
end record;
type Search_Entry is record
First : SOR.uint32;
Size : SOR.uint32;
-- Function bounds as offset to the base address.
Sym : SOR.uint32;
-- Symbol offset to get the name.
Line : SOR.uint32;
-- Dwarf line offset.
end record;
type Search_Array is array (Natural range <>) of Search_Entry;
type Search_Array_Access is access Search_Array;
type Dwarf_Context (In_Exception : Boolean := False) is record
Low, High : System.Storage_Elements.Storage_Offset;
-- Bounds of the module, per the module object file
Obj : SOR.Object_File_Access;
-- The object file containing dwarf sections
Load_Address : System.Address := System.Null_Address;
-- The address at which the object file was loaded at run time
Has_Debug : Boolean;
-- True if all debug sections are available
Cache : Search_Array_Access;
-- Quick access to symbol and debug info (when present).
Lines : SOR.Mapped_Stream;
Aranges : SOR.Mapped_Stream;
Info : SOR.Mapped_Stream;
Abbrev : SOR.Mapped_Stream;
-- Dwarf line, aranges, info and abbrev sections
Prologue : Line_Info_Prologue;
Registers : Line_Info_Registers;
Next_Prologue : SOR.Offset;
-- State for lines
end record;
end System.Dwarf_Lines;
| 41.389744 | 79 | 0.585553 |
2254b6eec2c3a3cfcebbe3fc4e358ae2236d2a0a | 6,448 | ads | Ada | Util/llvm/bindings/ada/transforms/llvm_transforms-binding.ads | ianloic/unladen-swallow | 28148f4ddbb3d519042de1f9fc9f1356fdd31e31 | [
"PSF-2.0"
] | 5 | 2020-06-30T05:06:40.000Z | 2021-05-24T08:38:33.000Z | Util/llvm/bindings/ada/transforms/llvm_transforms-binding.ads | ianloic/unladen-swallow | 28148f4ddbb3d519042de1f9fc9f1356fdd31e31 | [
"PSF-2.0"
] | null | null | null | Util/llvm/bindings/ada/transforms/llvm_transforms-binding.ads | ianloic/unladen-swallow | 28148f4ddbb3d519042de1f9fc9f1356fdd31e31 | [
"PSF-2.0"
] | 2 | 2015-10-01T18:28:20.000Z | 2020-09-09T16:25:27.000Z | -- This file is generated by SWIG. Do *not* modify by hand.
--
with llvm;
package LLVM_Transforms.Binding is
procedure LLVMAddArgumentPromotionPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddConstantMergePass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddDeadArgEliminationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddDeadTypeEliminationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddFunctionAttrsPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddFunctionInliningPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddGlobalDCEPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddGlobalOptimizerPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddIPConstantPropagationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLowerSetJmpPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddPruneEHPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddRaiseAllocationsPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddStripDeadPrototypesPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddStripSymbolsPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddAggressiveDCEPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddCFGSimplificationPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddCondPropagationPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddDeadStoreEliminationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddGVNPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddIndVarSimplifyPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddInstructionCombiningPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddJumpThreadingPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLICMPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLoopDeletionPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLoopIndexSplitPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLoopRotatePass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLoopUnrollPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddLoopUnswitchPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddMemCpyOptPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddPromoteMemoryToRegisterPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddReassociatePass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddSCCPPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddScalarReplAggregatesPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddSimplifyLibCallsPass (PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddTailCallEliminationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddConstantPropagationPass
(PM : in llvm.LLVMPassManagerRef);
procedure LLVMAddDemoteMemoryToRegisterPass
(PM : in llvm.LLVMPassManagerRef);
private
pragma Import
(C,
LLVMAddArgumentPromotionPass,
"Ada_LLVMAddArgumentPromotionPass");
pragma Import
(C,
LLVMAddConstantMergePass,
"Ada_LLVMAddConstantMergePass");
pragma Import
(C,
LLVMAddDeadArgEliminationPass,
"Ada_LLVMAddDeadArgEliminationPass");
pragma Import
(C,
LLVMAddDeadTypeEliminationPass,
"Ada_LLVMAddDeadTypeEliminationPass");
pragma Import
(C,
LLVMAddFunctionAttrsPass,
"Ada_LLVMAddFunctionAttrsPass");
pragma Import
(C,
LLVMAddFunctionInliningPass,
"Ada_LLVMAddFunctionInliningPass");
pragma Import (C, LLVMAddGlobalDCEPass, "Ada_LLVMAddGlobalDCEPass");
pragma Import
(C,
LLVMAddGlobalOptimizerPass,
"Ada_LLVMAddGlobalOptimizerPass");
pragma Import
(C,
LLVMAddIPConstantPropagationPass,
"Ada_LLVMAddIPConstantPropagationPass");
pragma Import (C, LLVMAddLowerSetJmpPass, "Ada_LLVMAddLowerSetJmpPass");
pragma Import (C, LLVMAddPruneEHPass, "Ada_LLVMAddPruneEHPass");
pragma Import
(C,
LLVMAddRaiseAllocationsPass,
"Ada_LLVMAddRaiseAllocationsPass");
pragma Import
(C,
LLVMAddStripDeadPrototypesPass,
"Ada_LLVMAddStripDeadPrototypesPass");
pragma Import (C, LLVMAddStripSymbolsPass, "Ada_LLVMAddStripSymbolsPass");
pragma Import
(C,
LLVMAddAggressiveDCEPass,
"Ada_LLVMAddAggressiveDCEPass");
pragma Import
(C,
LLVMAddCFGSimplificationPass,
"Ada_LLVMAddCFGSimplificationPass");
pragma Import
(C,
LLVMAddCondPropagationPass,
"Ada_LLVMAddCondPropagationPass");
pragma Import
(C,
LLVMAddDeadStoreEliminationPass,
"Ada_LLVMAddDeadStoreEliminationPass");
pragma Import (C, LLVMAddGVNPass, "Ada_LLVMAddGVNPass");
pragma Import
(C,
LLVMAddIndVarSimplifyPass,
"Ada_LLVMAddIndVarSimplifyPass");
pragma Import
(C,
LLVMAddInstructionCombiningPass,
"Ada_LLVMAddInstructionCombiningPass");
pragma Import
(C,
LLVMAddJumpThreadingPass,
"Ada_LLVMAddJumpThreadingPass");
pragma Import (C, LLVMAddLICMPass, "Ada_LLVMAddLICMPass");
pragma Import (C, LLVMAddLoopDeletionPass, "Ada_LLVMAddLoopDeletionPass");
pragma Import
(C,
LLVMAddLoopIndexSplitPass,
"Ada_LLVMAddLoopIndexSplitPass");
pragma Import (C, LLVMAddLoopRotatePass, "Ada_LLVMAddLoopRotatePass");
pragma Import (C, LLVMAddLoopUnrollPass, "Ada_LLVMAddLoopUnrollPass");
pragma Import (C, LLVMAddLoopUnswitchPass, "Ada_LLVMAddLoopUnswitchPass");
pragma Import (C, LLVMAddMemCpyOptPass, "Ada_LLVMAddMemCpyOptPass");
pragma Import
(C,
LLVMAddPromoteMemoryToRegisterPass,
"Ada_LLVMAddPromoteMemoryToRegisterPass");
pragma Import (C, LLVMAddReassociatePass, "Ada_LLVMAddReassociatePass");
pragma Import (C, LLVMAddSCCPPass, "Ada_LLVMAddSCCPPass");
pragma Import
(C,
LLVMAddScalarReplAggregatesPass,
"Ada_LLVMAddScalarReplAggregatesPass");
pragma Import
(C,
LLVMAddSimplifyLibCallsPass,
"Ada_LLVMAddSimplifyLibCallsPass");
pragma Import
(C,
LLVMAddTailCallEliminationPass,
"Ada_LLVMAddTailCallEliminationPass");
pragma Import
(C,
LLVMAddConstantPropagationPass,
"Ada_LLVMAddConstantPropagationPass");
pragma Import
(C,
LLVMAddDemoteMemoryToRegisterPass,
"Ada_LLVMAddDemoteMemoryToRegisterPass");
end LLVM_Transforms.Binding;
| 31.149758 | 77 | 0.75 |
412b5b7d62c247fc00984f55dbc76d9cae682f88 | 2,821 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-assert.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-assert.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-assert.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . A S S E R T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
with Ada.Exceptions;
with System.Exceptions_Debug;
package body System.Assertions is
--------------------------
-- Raise_Assert_Failure --
--------------------------
procedure Raise_Assert_Failure (Msg : String) is
begin
System.Exceptions_Debug.Debug_Raise_Assert_Failure;
Ada.Exceptions.Raise_Exception (Assert_Failure'Identity, Msg);
end Raise_Assert_Failure;
end System.Assertions;
| 56.42 | 78 | 0.416164 |
4155537ef8e3b98fefaac05aa38ddabb822f2f20 | 17,863 | adb | Ada | source/amf/ocl/amf-internals-ocl_real_literal_exps.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/ocl/amf-internals-ocl_real_literal_exps.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/ocl/amf-internals-ocl_real_literal_exps.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$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.OCL_Attributes;
with AMF.UML.Comments.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Types;
with AMF.Visitors.OCL_Iterators;
with AMF.Visitors.OCL_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.OCL_Real_Literal_Exps is
---------------------
-- Get_Real_Symbol --
---------------------
overriding function Get_Real_Symbol
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.Real is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Real_Symbol
(Self.Element);
end Get_Real_Symbol;
---------------------
-- Set_Real_Symbol --
---------------------
overriding procedure Set_Real_Symbol
(Self : not null access OCL_Real_Literal_Exp_Proxy;
To : AMF.Real) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Real_Symbol
(Self.Element, To);
end Set_Real_Symbol;
--------------
-- Get_Type --
--------------
overriding function Get_Type
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Types.UML_Type_Access is
begin
return
AMF.UML.Types.UML_Type_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Type
(Self.Element)));
end Get_Type;
--------------
-- Set_Type --
--------------
overriding procedure Set_Type
(Self : not null access OCL_Real_Literal_Exp_Proxy;
To : AMF.UML.Types.UML_Type_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Type
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Type;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
--------------
-- Get_Name --
--------------
overriding function Get_Name
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Name;
--------------
-- Set_Name --
--------------
overriding procedure Set_Name
(Self : not null access OCL_Real_Literal_Exp_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Name;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access OCL_Real_Literal_Exp_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Optional_UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element);
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Real_Literal_Exp_Proxy;
To : AMF.UML.Optional_UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, To);
end Set_Visibility;
-----------------------
-- Get_Owned_Comment --
-----------------------
overriding function Get_Owned_Comment
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Comments.Collections.Set_Of_UML_Comment is
begin
return
AMF.UML.Comments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment
(Self.Element)));
end Get_Owned_Comment;
-----------------------
-- Get_Owned_Element --
-----------------------
overriding function Get_Owned_Element
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element
(Self.Element)));
end Get_Owned_Element;
---------------
-- Get_Owner --
---------------
overriding function Get_Owner
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner
(Self.Element)));
end Get_Owner;
--------------------
-- All_Namespaces --
--------------------
overriding function All_Namespaces
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.All_Namespaces";
return All_Namespaces (Self);
end All_Namespaces;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant OCL_Real_Literal_Exp_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.Namespace";
return Namespace (Self);
end Namespace;
--------------------
-- Qualified_Name --
--------------------
overriding function Qualified_Name
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.Qualified_Name";
return Qualified_Name (Self);
end Qualified_Name;
---------------
-- Separator --
---------------
overriding function Separator
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Separator unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.Separator";
return Separator (Self);
end Separator;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.All_Owned_Elements";
return All_Owned_Elements (Self);
end All_Owned_Elements;
-------------------
-- Must_Be_Owned --
-------------------
overriding function Must_Be_Owned
(Self : not null access constant OCL_Real_Literal_Exp_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Real_Literal_Exp_Proxy.Must_Be_Owned";
return Must_Be_Owned (Self);
end Must_Be_Owned;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant OCL_Real_Literal_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Enter_Real_Literal_Exp
(AMF.OCL.Real_Literal_Exps.OCL_Real_Literal_Exp_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant OCL_Real_Literal_Exp_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Leave_Real_Literal_Exp
(AMF.OCL.Real_Literal_Exps.OCL_Real_Literal_Exp_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant OCL_Real_Literal_Exp_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then
AMF.Visitors.OCL_Iterators.OCL_Iterator'Class
(Iterator).Visit_Real_Literal_Exp
(Visitor,
AMF.OCL.Real_Literal_Exps.OCL_Real_Literal_Exp_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.OCL_Real_Literal_Exps;
| 36.983437 | 108 | 0.604266 |
5965ac28b890306bec76b0bb112db0eb2f0513c1 | 5,831 | ads | Ada | src/gl/interface/gl-algebra.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/interface/gl-algebra.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/interface/gl-algebra.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 20 | 2015-03-17T07:15:57.000Z | 2022-02-02T17:12:11.000Z | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Interfaces.C.Pointers;
with GL.Vectors;
with GL.Matrices;
generic
type Element_Type is private;
type Index_Type is (<>);
with function "+" (Left, Right : Element_Type) return Element_Type is <>;
with function "-" (Left, Right : Element_Type) return Element_Type is <>;
with function "-" (Left : Element_Type) return Element_Type is <>;
with function "*" (Left, Right : Element_Type) return Element_Type is <>;
with function "/" (Left, Right : Element_Type) return Element_Type is <>;
Null_Value, One_Value : Element_Type;
package GL.Algebra is
pragma Preelaborate;
-----------------------------------------------------------------------------
-- Vector types --
-----------------------------------------------------------------------------
package Vectors2 is new Vectors (Index_Type => Index_2D,
Element_Type => Element_Type);
package Vectors3 is new Vectors (Index_Type => Index_3D,
Element_Type => Element_Type);
package Vectors4 is new Vectors (Index_Type => Index_Homogeneous,
Element_Type => Element_Type);
type Vector2 is new Vectors2.Vector;
type Vector3 is new Vectors3.Vector;
type Vector4 is new Vectors4.Vector;
-- Conversion functions between vectors. Default values are:
-- Z = 0, W = 1
function To_Vector2 (Vector : Vector3) return Vector2;
function To_Vector2 (Vector : Vector4) return Vector2;
function To_Vector3 (Vector : Vector2) return Vector3;
function To_Vector3 (Vector : Vector4) return Vector3;
function To_Vector4 (Vector : Vector2) return Vector4;
function To_Vector4 (Vector : Vector3) return Vector4;
pragma Inline (To_Vector2);
pragma Inline (To_Vector3);
pragma Inline (To_Vector4);
-----------------------------------------------------------------------------
-- Matrix types --
-----------------------------------------------------------------------------
package Matrices2 is new Matrices (Index_Type => Index_2D,
Element_Type => Element_Type,
Vector_Type => Vector2);
package Matrices3 is new Matrices (Index_Type => Index_3D,
Element_Type => Element_Type,
Vector_Type => Vector3);
package Matrices4 is new Matrices (Index_Type => Index_Homogeneous,
Element_Type => Element_Type,
Vector_Type => Vector4);
type Matrix2 is new Matrices2.Matrix;
type Matrix3 is new Matrices3.Matrix;
type Matrix4 is new Matrices4.Matrix;
Identity2 : constant Matrix2 := ((One_Value, Null_Value), (Null_Value, One_Value));
Identity3 : constant Matrix3 := ((One_Value, Null_Value, Null_Value),
(Null_Value, One_Value, Null_Value),
(Null_Value, Null_Value, One_Value));
Identity4 : constant Matrix4 := ((One_Value, Null_Value, Null_Value, Null_Value),
(Null_Value, One_Value, Null_Value, Null_Value),
(Null_Value, Null_Value, One_Value, Null_Value),
(Null_Value, Null_Value, Null_Value, One_Value));
-----------------------------------------------------------------------------
-- Array types --
-----------------------------------------------------------------------------
type Vector2_Array is array (Index_Type range <>) of aliased Vector2;
type Vector3_Array is array (Index_Type range <>) of aliased Vector3;
type Vector4_Array is array (Index_Type range <>) of aliased Vector4;
type Matrix2_Array is array (Index_Type range <>) of aliased Matrix2;
type Matrix3_Array is array (Index_Type range <>) of aliased Matrix3;
type Matrix4_Array is array (Index_Type range <>) of aliased Matrix4;
pragma Convention (C, Vector2_Array);
pragma Convention (C, Vector3_Array);
pragma Convention (C, Vector4_Array);
pragma Convention (C, Matrix2_Array);
pragma Convention (C, Matrix3_Array);
pragma Convention (C, Matrix4_Array);
-----------------------------------------------------------------------------
-- Pointer types --
-- note: These instances of the Pointers package do not have a usable --
-- default terminator. Only use the size-based subroutines. --
-----------------------------------------------------------------------------
package Vector2_Pointers is new Interfaces.C.Pointers
(Index_Type, Vector2, Vector2_Array, Vector2'(others => <>));
package Vector3_Pointers is new Interfaces.C.Pointers
(Index_Type, Vector3, Vector3_Array, Vector3'(others => <>));
package Vector4_Pointers is new Interfaces.C.Pointers
(Index_Type, Vector4, Vector4_Array, Vector4'(others => <>));
package Matrix2_Pointers is new Interfaces.C.Pointers
(Index_Type, Matrix2, Matrix2_Array, Matrix2'(others => (others => <>)));
package Matrix3_Pointers is new Interfaces.C.Pointers
(Index_Type, Matrix3, Matrix3_Array, Matrix3'(others => (others => <>)));
package Matrix4_Pointers is new Interfaces.C.Pointers
(Index_Type, Matrix4, Matrix4_Array, Matrix4'(others => (others => <>)));
function Cross_Product (Left, Right : Vector3) return Vector3;
end GL.Algebra;
| 49.837607 | 86 | 0.547933 |
3db4e35bb0ea52905a8ac642c3b9f5c8d0526f52 | 439 | adb | Ada | src/API/protypo-api-engine_values-range_iterators.adb | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | null | null | null | src/API/protypo-api-engine_values-range_iterators.adb | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | 4 | 2019-10-09T11:16:38.000Z | 2019-10-09T11:20:38.000Z | src/API/protypo-api-engine_values-range_iterators.adb | fintatarta/protypo | c0c2bca17bc766ab95acc99b7422485388a10cb4 | [
"MIT"
] | null | null | null | pragma Ada_2012;
package body Protypo.Api.Engine_Values.Range_Iterators is
-----------
-- Reset --
-----------
procedure Reset (Iter : in out Range_Iterator) is
begin
Iter.Current := Iter.Start;
end Reset;
----------
-- Next --
----------
procedure Next (Iter : in out Range_Iterator) is
begin
Iter.Current := Iter.Current + 1;
end Next;
end Protypo.Api.Engine_Values.Range_Iterators;
| 18.291667 | 57 | 0.592255 |
296d555e7945b6566bd6d44354418bfa61e45eab | 2,952 | ads | Ada | src/shared/generic/lsc-internal-pad64.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | src/shared/generic/lsc-internal-pad64.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | src/shared/generic/lsc-internal-pad64.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- 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 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 LSC.Internal.Types;
use type LSC.Internal.Types.Word64;
use type LSC.Internal.Types.Index;
-------------------------------------------------------------------------------
-- Cryptographic padding for arrays of 64-bit words
-------------------------------------------------------------------------------
package LSC.Internal.Pad64
is
pragma Pure;
-- Terminate a Word64 array
--
-- The array @Block@ is terminated by setting the bit at (@Length@ + 1) to 1
-- and all following bits to 0.
--
procedure Block_Terminate
(Block : in out Types.Word64_Array_Type;
Length : in Types.Word64)
--
-- <strong> NOTE: The postcondition currently does not completely express
-- the intended behaviour of the operation! </strong>
--
with
Depends => (Block =>+ Length),
Pre =>
Length / 64 + 1 <= Block'Length,
Post =>
(for all I in Types.Index range
Block'First + Types.Index (Length / 64) + 1 .. Block'Last => (Block (I) = 0));
end LSC.Internal.Pad64;
| 44.059701 | 90 | 0.618564 |
2f5cbf4a5cee068cbf2c413f534a37407949fa4c | 5,729 | adb | Ada | src/fltk-widgets-buttons.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-buttons.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-buttons.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Interfaces.C,
System;
use type
System.Address;
package body FLTK.Widgets.Buttons is
procedure button_set_draw_hook
(W, D : in System.Address);
pragma Import (C, button_set_draw_hook, "button_set_draw_hook");
pragma Inline (button_set_draw_hook);
procedure button_set_handle_hook
(W, H : in System.Address);
pragma Import (C, button_set_handle_hook, "button_set_handle_hook");
pragma Inline (button_set_handle_hook);
function new_fl_button
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_button, "new_fl_button");
pragma Inline (new_fl_button);
procedure free_fl_button
(B : in System.Address);
pragma Import (C, free_fl_button, "free_fl_button");
pragma Inline (free_fl_button);
function fl_button_get_state
(B : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_button_get_state, "fl_button_get_state");
pragma Inline (fl_button_get_state);
procedure fl_button_set_state
(B : in System.Address;
S : in Interfaces.C.int);
pragma Import (C, fl_button_set_state, "fl_button_set_state");
pragma Inline (fl_button_set_state);
procedure fl_button_set_only
(B : in System.Address);
pragma Import (C, fl_button_set_only, "fl_button_set_only");
pragma Inline (fl_button_set_only);
function fl_button_get_down_box
(B : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_button_get_down_box, "fl_button_get_down_box");
pragma Inline (fl_button_get_down_box);
procedure fl_button_set_down_box
(B : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_button_set_down_box, "fl_button_set_down_box");
pragma Inline (fl_button_set_down_box);
function fl_button_get_shortcut
(B : in System.Address)
return Interfaces.C.int;
pragma Import (C, fl_button_get_shortcut, "fl_button_get_shortcut");
pragma Inline (fl_button_get_shortcut);
procedure fl_button_set_shortcut
(B : in System.Address;
T : in Interfaces.C.int);
pragma Import (C, fl_button_set_shortcut, "fl_button_set_shortcut");
pragma Inline (fl_button_set_shortcut);
procedure fl_button_draw
(W : in System.Address);
pragma Import (C, fl_button_draw, "fl_button_draw");
pragma Inline (fl_button_draw);
function fl_button_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_button_handle, "fl_button_handle");
pragma Inline (fl_button_handle);
procedure Finalize
(This : in out Button) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Button'Class
then
free_fl_button (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Widget (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Button is
begin
return This : Button do
This.Void_Ptr := new_fl_button
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
button_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
button_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
end return;
end Create;
end Forge;
function Get_State
(This : in Button)
return State is
begin
return State'Val (fl_button_get_state (This.Void_Ptr));
end Get_State;
procedure Set_State
(This : in out Button;
St : in State) is
begin
fl_button_set_state (This.Void_Ptr, State'Pos (St));
end Set_State;
procedure Set_Only
(This : in out Button) is
begin
fl_button_set_only (This.Void_Ptr);
end Set_Only;
function Get_Down_Box
(This : in Button)
return Box_Kind is
begin
return Box_Kind'Val (fl_button_get_down_box (This.Void_Ptr));
end Get_Down_Box;
procedure Set_Down_Box
(This : in out Button;
To : in Box_Kind) is
begin
fl_button_set_down_box (This.Void_Ptr, Box_Kind'Pos (To));
end Set_Down_Box;
function Get_Shortcut
(This : in Button)
return Key_Combo is
begin
return To_Ada (Interfaces.C.unsigned_long (fl_button_get_shortcut (This.Void_Ptr)));
end Get_Shortcut;
procedure Set_Shortcut
(This : in out Button;
Key : in Key_Combo) is
begin
fl_button_set_shortcut (This.Void_Ptr, Interfaces.C.int (To_C (Key)));
end Set_Shortcut;
procedure Draw
(This : in out Button) is
begin
fl_button_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Button;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_button_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Buttons;
| 25.349558 | 92 | 0.612149 |
1d47edb75b508dfa1f781d4a3e2b89a1e6b743e7 | 1,074 | ada | Ada | Task/Set/Ada/set.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2021-05-05T13:42:20.000Z | 2021-05-05T13:42:20.000Z | Task/Set/Ada/set.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Set/Ada/set.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | with ada.containers.ordered_sets, ada.text_io;
use ada.text_io;
procedure set_demo is
package cs is new ada.containers.ordered_sets (character); use cs;
function "+" (s : string) return set is
(if s = "" then empty_set else Union(+ s(s'first..s'last - 1), To_Set (s(s'last))));
function "-" (s : Set) return string is
(if s = empty_set then "" else - (s - To_Set (s.last_element)) & s.last_element);
s1, s2 : set;
begin
loop
put ("s1= ");
s1 := + get_line;
exit when s1 = +"Quit!";
put ("s2= ");
s2 := + get_line;
Put_Line("Sets [" & (-s1) & "], [" & (-s2) & "] of size"
& S1.Length'img & " and" & s2.Length'img & ".");
Put_Line("Intersection: [" & (-(Intersection(S1, S2))) & "],");
Put_Line("Union: [" & (-(Union(s1, s2))) & "],");
Put_Line("Difference: [" & (-(Difference(s1, s2))) & "],");
Put_Line("Symmetric Diff: [" & (-(s1 xor s2)) & "],");
Put_Line("Subset: " & Boolean'Image(s1.Is_Subset(s2))
& ", Equal: " & Boolean'Image(s1 = s2) & ".");
end loop;
end set_demo;
| 35.8 | 85 | 0.541899 |
3debb5ace1a0fb949954f2d20cfbda813a6c0b89 | 3,152 | adb | Ada | bb-runtimes/tests/bsp_verification/src/support/report.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/tests/bsp_verification/src/support/report.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/tests/bsp_verification/src/support/report.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT BSP Test --
-- --
-- Copyright (C) 2018, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Report_IO; use Report_IO;
package body Report is
Separator : constant String := "****************************************";
----------
-- Test --
----------
procedure Test
(Name : String;
Descr : String)
is
begin
Put_Line (Separator);
Put_Line ("Test: " & Name);
Put_Line (Descr);
end Test;
------------
-- Failed --
------------
procedure Failed (Descr : String) is
begin
Put_Line ("Failed: " & Descr);
end Failed;
-------------
-- Comment --
-------------
procedure Comment (Descr : String) is
begin
Put_Line ("Note: " & Descr);
end Comment;
------------
-- Passed --
------------
procedure Passed (Descr : String) is
begin
Put_Line ("Passed: " & Descr);
end Passed;
-----------
-- Image --
-----------
function Image (N : Integer) return String is
Result : constant String := N'Image;
begin
if N < 0 then
return Result;
else
return Result (2 .. Result'Last);
end if;
end Image;
end Report;
| 35.022222 | 78 | 0.419416 |
220ffdc998be8059a3d0f93eb153b81bf4966ac7 | 2,713 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-sulcin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-sulcin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-sulcin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.STRINGS.UNBOUNDED.LESS_CASE_INSENSITIVE --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2019, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
function Ada.Strings.Unbounded.Less_Case_Insensitive
(Left, Right : Unbounded.Unbounded_String)
return Boolean;
pragma Preelaborate (Ada.Strings.Unbounded.Less_Case_Insensitive);
| 69.564103 | 78 | 0.425359 |
58d8b167c8bd7b690e71f4ad3c895760020c6c18 | 3,172 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sha256.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sha256.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-sha256.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S H A 2 5 6 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-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 implements the SHA-256 secure hash function as described in
-- FIPS PUB 180-3. The complete text of FIPS PUB 180-3 can be found at:
-- http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf
-- See the declaration of GNAT.Secure_Hashes.H in g-sechas.ads for complete
-- documentation.
with GNAT.Secure_Hashes.SHA2_Common;
with GNAT.Secure_Hashes.SHA2_32;
with System;
package GNAT.SHA256 is new GNAT.Secure_Hashes.H
(Block_Words => GNAT.Secure_Hashes.SHA2_Common.Block_Words,
State_Words => 8,
Hash_Words => 8,
Hash_Bit_Order => System.High_Order_First,
Hash_State => GNAT.Secure_Hashes.SHA2_32.Hash_State,
Initial_State => GNAT.Secure_Hashes.SHA2_32.SHA256_Init_State,
Transform => GNAT.Secure_Hashes.SHA2_32.Transform);
| 62.196078 | 78 | 0.460593 |
574cfdd1784bb5814abca9aaacf015cb3fb09d15 | 4,148 | adb | Ada | tests/renderwindow/main.adb | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 1 | 2017-10-07T06:20:38.000Z | 2017-10-07T06:20:38.000Z | tests/renderwindow/main.adb | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 3 | 2020-09-15T21:19:34.000Z | 2022-03-02T23:13:46.000Z | tests/renderwindow/main.adb | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 2 | 2020-09-26T21:16:43.000Z | 2022-01-16T19:36:48.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Sf.Config; use Sf.Config;
with Sf.Window.Types; use Sf.Window.Types;
with Sf.Window.Window; use Sf.Window.Window;
with Sf.Window.VideoMode; use Sf.Window.VideoMode;
with Sf.Window.Event; use Sf.Window.Event;
with Sf.Window.Input; use Sf.Window.Input;
with Sf.System.Sleep; use Sf.System.Sleep;
with Sf.Graphics.RenderWindow; use Sf.Graphics.RenderWindow;
with Sf.Graphics.Types; use Sf.Graphics.Types;
with Sf.Graphics.Sprite; use Sf.Graphics.Sprite;
with Sf.Graphics.Image; use Sf.Graphics.Image;
with Sf.Graphics.BlendMode; use Sf.Graphics.BlendMode;
with Sf.Graphics.String; use Sf.Graphics.String;
with Sf.Graphics.Color; use Sf.Graphics.Color;
with Sf.Graphics.Font; use Sf.Graphics.Font;
procedure Main is
Window : sfRenderWindow_Ptr;
Mode : sfVideoMode := (640, 480, 32);
Params : sfWindowSettings := (0, 0, 0);
Event : aliased sfEvent;
Input : sfInput_Ptr;
Sprite : sfSprite_Ptr;
Img : sfImage_Ptr;
Icon : sfImage_Ptr;
Str : sfString_Ptr;
Font : sfFont_Ptr;
begin
Img := sfImage_CreateFromFile ("logo.png");
if Img = null then
Put_Line ("Could not open image");
return;
end if;
Icon := sfImage_CreateFromFile ("icon64x64.png");
if Icon = null then
Put_Line ("Could not open image");
sfImage_Destroy (Img);
return;
end if;
Sprite := sfSprite_Create;
if Sprite = null then
Put_Line ("Could not create sprite");
sfImage_Destroy (Img);
return;
end if;
sfSprite_SetImage (Sprite, Img);
sfSprite_SetScale (Sprite, 100.0 / Float (sfImage_GetWidth (Img)), 100.0 / Float (sfImage_GetHeight (Img)));
sfSprite_SetPosition (Sprite, Float (Mode.Width / 2 - 100 / 2), Float (Mode.Height / 2 - 100 / 2));
sfSprite_SetBlendMode (Sprite, sfBlendAlpha);
Font := sfFont_GetDefaultFont;
--Font := sfFont_CreateFromFile("aerial.ttf", 20, null);
if Font = null then
Put_Line ("Could not get font");
sfSprite_Destroy (Sprite);
sfImage_Destroy (Img);
return;
end if;
Str := sfString_Create;
if Str = null then
Put_Line ("Could not create string");
sfSprite_Destroy (Sprite);
sfImage_Destroy (Img);
--sfFont_Destroy(Font);
return;
end if;
sfString_SetFont (Str, Font);
sfString_SetText (Str, "The SFML Logo" & Character'VAL (10) & "In Default Font");
--sfString_SetSize(Str, 20.0);
sfString_SetPosition (Str, Float (Mode.Width / 2) - (sfString_GetRect (Str).Right - sfString_GetRect (Str).Left) / 2.0, Float (Mode.Height / 2) + 60.0);
sfString_SetColor (Str, sfBlue);
Window := sfRenderWindow_Create (Mode, "Ada SFML Window", sfResize or sfClose, Params);
if Window = null then
Put_Line ("Failed to create window");
return;
end if;
sfRenderWindow_SetFramerateLimit (Window, 32);
sfRenderWindow_UseVerticalSync (Window, sfFalse);
sfRenderWindow_Show (Window, sfTrue);
sfRenderWindow_SetIcon (Window, sfImage_GetWidth (Icon), sfImage_GetHeight (Icon), sfImage_GetPixelsPtr (Icon));
while sfRenderWindow_IsOpened (Window) = sfTrue loop
while sfRenderWindow_GetEvent (Window, Event'ACCESS) = sfTrue loop
if Event.Event_Type = sfEvtClosed then
sfRenderWindow_Close (Window);
Put_Line ("Attepting to close");
end if;
Input := sfRenderWindow_GetInput (Window);
if Input /= null and then Event.Event_Type = sfEvtKeyPressed and then sfInput_IsKeyDown (Input, sfKeyEscape) = sfTrue then
sfRenderWindow_Close (Window);
Put_Line ("Attepting to close");
end if;
end loop;
sfRenderWindow_Clear (Window, sfWhite);
sfRenderWindow_DrawSprite (Window, Sprite);
sfRenderWindow_DrawString (Window, Str);
sfRenderWindow_Display (Window);
sfSleep (0.001);
end loop;
sfRenderWindow_Destroy (Window);
sfSprite_Destroy (Sprite);
sfImage_Destroy (Img);
sfImage_Destroy (Icon);
sfString_Destroy (Str);
--sfFont_Destroy(Font);
end Main;
| 34 | 155 | 0.669479 |
2ff0b583f55808546f34e83546ebf6476cc23e72 | 3,268 | ads | Ada | tools-src/gnu/gcc/gcc/ada/s-pack29.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/s-pack29.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/s-pack29.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 9 --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-2907, 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. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 29
package System.Pack_29 is
pragma Preelaborate (Pack_29);
Bits : constant := 29;
type Bits_29 is mod 2 ** Bits;
for Bits_29'Size use Bits;
function Get_29 (Arr : System.Address; N : Natural) return Bits_29;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_29 (Arr : System.Address; N : Natural; E : Bits_29);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_29;
| 59.418182 | 78 | 0.448898 |
2285261cfecf2336363b5246a87281b03297ba55 | 847 | adb | Ada | examples/temphum/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | examples/temphum/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | examples/temphum/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32GD.Board; use STM32GD.Board;
with Drivers.Si7006;
procedure Main is
package Si7006 is new Drivers.Si7006 (I2C => I2C);
Temperature : Si7006.Temperature_Type;
Humidity : Si7006.Humidity_Type;
Now : RTC.Date_Time_Type;
Wait_Time : RTC.Second_Delta_Type := 5;
begin
Init;
Text_IO.Put_Line ("Temperature/Humidity sensor starting");
loop
RTC.Read (Now);
LED.Set;
Text_IO.Put_Line ("Reading sensor data");
Temperature := Si7006.Temperature_x100;
Humidity := Si7006.Humidity;
Text_IO.Put ("Temperature: "); Text_IO.Put_Integer (Temperature);
Text_IO.Put (" Humidity: "); Text_IO.Put_Integer (Humidity);
Text_IO.New_Line;
LED.Clear;
RTC.Add_Seconds (Now, Wait_Time);
RTC.Set_Alarm (Now);
RTC.Wait_For_Alarm;
end loop;
end Main;
| 27.322581 | 71 | 0.664699 |
58a9b894bdf3672dd605fccfc200f93635e79c7e | 1,918 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c39006f0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c39006f0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c39006f0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C39006F0.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 NO PROGRAM_ERROR IS RAISED IF A SUBPROGRAM'S BODY HAS
-- BEEN ELABORATED BEFORE IT IS CALLED. CHECK THE FOLLOWING:
-- B) FOR A SUBPROGRAM LIBRARY UNIT USED IN ANOTHER UNIT, NO
-- PROGRAM_ERROR IS RAISED IF PRAGMA ELABORATE NAMES THE
-- SUBPROGRAM.
-- THIS SUBPROGRAM LIBRARY UNIT IS USED BY C39006F2.ADA.
-- HISTORY:
-- TBN 08/22/86 CREATED ORIGINAL TEST.
-- BCB 03/29/90 CORRECTED HEADER. CHANGED TEST NAME IN CALL
-- TO 'TEST'.
WITH REPORT; USE REPORT;
FUNCTION C39006F0 (A : INTEGER) RETURN INTEGER IS
BEGIN
RETURN (IDENT_INT(A));
END C39006F0;
| 42.622222 | 79 | 0.669447 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.